= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code) // deflate_state *s;\\n // ct_data *tree; /* the tree to be scanned */\\n // int max_code; /* and its largest code of non zero frequency */\\n {\\n var n;\\n /* iterates over all tree elements */\\n\\n var prevlen = -1;\\n /* last emitted length */\\n\\n var curlen;\\n /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]\\n /*.Len*/\\n ;\\n /* length of next code */\\n\\n var count = 0;\\n /* repeat count of the current code */\\n\\n var max_count = 7;\\n /* max repeat count */\\n\\n var min_count = 4;\\n /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */\\n\\n /* guard already set */\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]\\n /*.Len*/\\n ;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree);\\n } while (--count !== 0);\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n } //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\n\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n }\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n let n; /* iterates over all tree elements */\\n let prevlen = -1; /* last emitted length */\\n let curlen; /* length of current code */\\n\\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n let count = 0; /* repeat count of the current code */\\n let max_count = 7; /* max repeat count */\\n let min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree); \\n } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n\\t // deflate_state *s;\\n\\t // ct_data *tree; /* the tree to be scanned */\\n\\t // int max_code; /* and its largest code of non zero frequency */\\n\\t {\\n\\t var n; /* iterates over all tree elements */\\n\\t var prevlen = -1; /* last emitted length */\\n\\t var curlen; /* length of current code */\\n\\t\\n\\t var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\t\\n\\t var count = 0; /* repeat count of the current code */\\n\\t var max_count = 7; /* max repeat count */\\n\\t var min_count = 4; /* min repeat count */\\n\\t\\n\\t /* tree[max_code+1].Len = -1; */ /* guard already set */\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\t }\\n\\t\\n\\t for (n = 0; n <= max_code; n++) {\\n\\t curlen = nextlen;\\n\\t nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\t\\n\\t if (++count < max_count && curlen === nextlen) {\\n\\t continue;\\n\\t\\n\\t } else if (count < min_count) {\\n\\t do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\t\\n\\t } else if (curlen !== 0) {\\n\\t if (curlen !== prevlen) {\\n\\t send_code(s, curlen, s.bl_tree);\\n\\t count--;\\n\\t }\\n\\t //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\t send_code(s, REP_3_6, s.bl_tree);\\n\\t send_bits(s, count - 3, 2);\\n\\t\\n\\t } else if (count <= 10) {\\n\\t send_code(s, REPZ_3_10, s.bl_tree);\\n\\t send_bits(s, count - 3, 3);\\n\\t\\n\\t } else {\\n\\t send_code(s, REPZ_11_138, s.bl_tree);\\n\\t send_bits(s, count - 11, 7);\\n\\t }\\n\\t\\n\\t count = 0;\\n\\t prevlen = curlen;\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\t\\n\\t } else if (curlen === nextlen) {\\n\\t max_count = 6;\\n\\t min_count = 3;\\n\\t\\n\\t } else {\\n\\t max_count = 7;\\n\\t min_count = 4;\\n\\t }\\n\\t }\\n\\t }\",\n \"function send_tree(s, tree, max_code)\\n // deflate_state *s;\\n // ct_data *tree; /* the tree to be scanned */\\n // int max_code; /* and its largest code of non zero frequency */\\n {\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n \\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n \\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n \\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n \\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n \\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n \\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n \\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n \\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n \\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n \\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n \\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n \\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n }\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1] /*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1] /*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree);\\n } while (--count !== 0);\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n\\t// deflate_state *s;\\n\\t// ct_data *tree; /* the tree to be scanned */\\n\\t// int max_code; /* and its largest code of non zero frequency */\\n\\t{\\n\\t var n; /* iterates over all tree elements */\\n\\t var prevlen = -1; /* last emitted length */\\n\\t var curlen; /* length of current code */\\n\\n\\t var nextlen = tree[0 * 2 + 1] /*.Len*/ ; /* length of next code */\\n\\n\\t var count = 0; /* repeat count of the current code */\\n\\t var max_count = 7; /* max repeat count */\\n\\t var min_count = 4; /* min repeat count */\\n\\n\\t /* tree[max_code+1].Len = -1; */\\n\\t /* guard already set */\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\t }\\n\\n\\t for (n = 0; n <= max_code; n++) {\\n\\t curlen = nextlen;\\n\\t nextlen = tree[(n + 1) * 2 + 1] /*.Len*/ ;\\n\\n\\t if (++count < max_count && curlen === nextlen) {\\n\\t continue;\\n\\n\\t } else if (count < min_count) {\\n\\t do {\\n\\t send_code(s, curlen, s.bl_tree);\\n\\t } while (--count !== 0);\\n\\n\\t } else if (curlen !== 0) {\\n\\t if (curlen !== prevlen) {\\n\\t send_code(s, curlen, s.bl_tree);\\n\\t count--;\\n\\t }\\n\\t //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\t send_code(s, REP_3_6, s.bl_tree);\\n\\t send_bits(s, count - 3, 2);\\n\\n\\t } else if (count <= 10) {\\n\\t send_code(s, REPZ_3_10, s.bl_tree);\\n\\t send_bits(s, count - 3, 3);\\n\\n\\t } else {\\n\\t send_code(s, REPZ_11_138, s.bl_tree);\\n\\t send_bits(s, count - 11, 7);\\n\\t }\\n\\n\\t count = 0;\\n\\t prevlen = curlen;\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\n\\t } else if (curlen === nextlen) {\\n\\t max_count = 6;\\n\\t min_count = 3;\\n\\n\\t } else {\\n\\t max_count = 7;\\n\\t min_count = 4;\\n\\t }\\n\\t }\\n\\t}\",\n \"function send_tree(s, tree, max_code)\\n\\t// deflate_state *s;\\n\\t// ct_data *tree; /* the tree to be scanned */\\n\\t// int max_code; /* and its largest code of non zero frequency */\\n\\t{\\n\\t var n; /* iterates over all tree elements */\\n\\t var prevlen = -1; /* last emitted length */\\n\\t var curlen; /* length of current code */\\n\\n\\t var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n\\t var count = 0; /* repeat count of the current code */\\n\\t var max_count = 7; /* max repeat count */\\n\\t var min_count = 4; /* min repeat count */\\n\\n\\t /* tree[max_code+1].Len = -1; */ /* guard already set */\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\t }\\n\\n\\t for (n = 0; n <= max_code; n++) {\\n\\t curlen = nextlen;\\n\\t nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n\\t if (++count < max_count && curlen === nextlen) {\\n\\t continue;\\n\\n\\t } else if (count < min_count) {\\n\\t do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n\\t } else if (curlen !== 0) {\\n\\t if (curlen !== prevlen) {\\n\\t send_code(s, curlen, s.bl_tree);\\n\\t count--;\\n\\t }\\n\\t //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\t send_code(s, REP_3_6, s.bl_tree);\\n\\t send_bits(s, count-3, 2);\\n\\n\\t } else if (count <= 10) {\\n\\t send_code(s, REPZ_3_10, s.bl_tree);\\n\\t send_bits(s, count-3, 3);\\n\\n\\t } else {\\n\\t send_code(s, REPZ_11_138, s.bl_tree);\\n\\t send_bits(s, count-11, 7);\\n\\t }\\n\\n\\t count = 0;\\n\\t prevlen = curlen;\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\n\\t } else if (curlen === nextlen) {\\n\\t max_count = 6;\\n\\t min_count = 3;\\n\\n\\t } else {\\n\\t max_count = 7;\\n\\t min_count = 4;\\n\\t }\\n\\t }\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.70694613","0.6978705","0.6972461","0.6965995","0.6906903","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.6906186","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.69021696","0.68995845","0.6890173","0.68899167","0.6851374","0.6848537","0.68478805","0.6803277","0.6796974"],"string":"[\n \"0.70694613\",\n \"0.6978705\",\n \"0.6972461\",\n \"0.6965995\",\n \"0.6906903\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.6906186\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.69021696\",\n \"0.68995845\",\n \"0.6890173\",\n \"0.68899167\",\n \"0.6851374\",\n \"0.6848537\",\n \"0.68478805\",\n \"0.6803277\",\n \"0.6796974\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81752,"cells":{"query":{"kind":"string","value":"=========================================================================== Construct one Huffman tree and assigns the code bit strings and lengths. Update the total bit length for the current block. IN assertion: the field freq is set for all tree elements. OUT assertions: the fields len and code are set to the optimal bit length and corresponding code. The length opt_len is updated; static_len is also updated if stree is not null. The field max_code is set."},"document":{"kind":"string","value":"function build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n*2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node*2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function build_bl_tree() {\n\t\tvar max_blindex; // index of last bit length code of non zero freq\n\n\t\t// Determine the bit length frequencies for literal and distance trees\n\t\tscan_tree(dyn_ltree, l_desc.max_code);\n\t\tscan_tree(dyn_dtree, d_desc.max_code);\n\n\t\t// Build the bit length tree:\n\t\tbuild_tree(bl_desc);\n\t\t// opt_len now includes the length of the tree representations, except\n\t\t// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\n\t\t// Determine the number of bit length codes to send. The pkzip format\n\t\t// requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t// 3 but the actual value used is 4.)\n\t\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[bl_order[max_blindex]].dl !== 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// Update opt_len to include the bit length tree and counts */\n\t\topt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t\t// Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\n\t\treturn max_blindex;\n\t}","function build_bl_tree() {\n\t\t var max_blindex; // index of last bit length code of non zero freq\n\t\t // Determine the bit length frequencies for literal and distance trees\n \n\t\t scan_tree(dyn_ltree, l_desc.max_code);\n\t\t scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree:\n \n\t\t bl_desc.build_tree(that); // opt_len now includes the length of the tree representations, except\n\t\t // the lengths of the bit lengths codes and the 5+5+4 bits for the\n\t\t // counts.\n\t\t // Determine the number of bit length codes to send. The pkzip format\n\t\t // requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t // 3 but the actual value used is 4.)\n \n\t\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break;\n\t\t } // Update opt_len to include the bit length tree and counts\n \n \n\t\t that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t\t return max_blindex;\n\t\t} // Output a byte on the stream.","static initHuffmanTree() {\n let i = 0;\n while (i < 144) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x030 + i) << 8);\n ARR_LITERAL_LENGTHS[i++] = 8;\n }\n while (i < 256) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x190 - 144 + i) << 7);\n ARR_LITERAL_LENGTHS[i++] = 9;\n }\n while (i < 280) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x000 - 256 + i) << 9);\n ARR_LITERAL_LENGTHS[i++] = 7;\n }\n while (i < 286) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x0c0 - 280 + i) << 8);\n ARR_LITERAL_LENGTHS[i++] = 8;\n }\n for (i = 0; i < 30; i++) {\n ARR_DISTANCE_CODES[i] = CompressorHuffmanTree.bitReverse(i << 11);\n ARR_DISTANCE_LENGTHS[i] = 5;\n }\n }","function BuildHuffmanTable(root_table,root_table_off,\n root_bits,\n code_lengths,code_lengths_off,\n code_lengths_size,\n count,count_off) {\n var code=new HuffmanCode(); /* current table entry */\n var table=new Array(new HuffmanCode());//* /* next available space in table */\n var table_off=0;\n var len; /* current code length */\n var symbol; /* symbol index in original or sorted table */\n var key; /* reversed prefix code */\n var step; /* step size to replicate values in current table */\n var low; /* low bits for current root entry */\n var mask; /* mask for low bits */\n var table_bits; /* key length of current table */\n var table_size; /* size of current table */\n var total_size; /* sum of root table size and 2nd level table sizes */\n /* symbols sorted by code length */\n var sorted=new mallocArr(code_lengths_size,0);\n /* offsets in sorted table for each length */\n var offset=new mallocArr(kHuffmanMaxLength + 1,0);\n var max_length = 1;\n\n /* generate offsets into sorted symbol table by code length */\n {\n var sum = 0;\n for (len = 1; len <= kHuffmanMaxLength; len++) {\n offset[len] = sum;\n if (count[len]) {\n sum = (sum + count[len]);\n max_length = len;\n }\n }\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (symbol = 0; symbol < code_lengths_size; symbol++) {\n if (code_lengths[symbol] != 0) {\n sorted[offset[code_lengths[symbol]]++] = symbol;\n }\n }\n\n table = root_table;\n table_off = root_table_off;\n table_bits = root_bits;\n table_size = 1 << table_bits;\n total_size = table_size;\n\n /* special case code with only one value */\n if (offset[kHuffmanMaxLength] == 1) {\n code.bits = 0;\n code.value = (sorted[0]);\n for (key = 0; key < total_size; ++key) {\n table[table_off+key] = code;\n }\n return total_size;\n }\n\n /* fill in root table */\n /* let's reduce the table size to a smaller size if possible, and */\n /* create the repetitions by memcpy if possible in the coming loop */\n if (table_bits > max_length) {\n table_bits = max_length;\n table_size = 1 << table_bits;\n }\n key = 0;\n symbol = 0;\n code.bits = 1;\n step = 2;\n do {\n for (; count[code.bits] != 0; --count[code.bits]) {\n code.value = (sorted[symbol++]);\n ReplicateValue(table,table_off+key, step, table_size, code);\n key = GetNextKey(key, code.bits);\n }\n step <<= 1;\n } while (++code.bits <= table_bits);\n\n /* if root_bits != table_bits we only created one fraction of the */\n /* table, and we need to replicate it now. */\n while (total_size != table_size) {\n //memcpy(&table[table_size], &table[0], table_size * sizeof(table[0]));\n\tfor(var i=0;i> root_bits), step, table_size, code);\n key = GetNextKey(key, len);\n }\n }\n\n return total_size;\n}","function send_tree(s, tree, max_code) // deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */\n\n /* guard already set */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n do {\n send_code(s, curlen, s.bl_tree);\n } while (--count !== 0);\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n } //Assert(count >= 3 && count <= 6, \" 3_6?\");\n\n\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function build_bl_tree(s){var max_blindex;/* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */scan_tree(s,s.dyn_ltree,s.l_desc.max_code);scan_tree(s,s.dyn_dtree,s.d_desc.max_code);/* Build the bit length tree: */build_tree(s,s.bl_desc);/* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */ /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */for(max_blindex=BL_CODES-1;max_blindex>=3;max_blindex--){if(s.bl_tree[bl_order[max_blindex]*2+1]/*.Len*/!==0){break;}}/* Update opt_len to include the bit length tree and counts */s.opt_len+=3*(max_blindex+1)+5+5+4;//Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n return max_blindex;}","function scan_tree(tree, // the tree to be scanned\n\t\tmax_code // and its largest code of non zero frequency\n\t\t) {\n\t\t var n; // iterates over all tree elements\n \n\t\t var prevlen = -1; // last emitted length\n \n\t\t var curlen; // length of current code\n \n\t\t var nextlen = tree[0 * 2 + 1]; // length of next code\n \n\t\t var count = 0; // repeat count of the current code\n \n\t\t var max_count = 7; // max repeat count\n \n\t\t var min_count = 4; // min repeat count\n \n\t\t if (nextlen === 0) {\n\t\t\tmax_count = 138;\n\t\t\tmin_count = 3;\n\t\t }\n \n\t\t tree[(max_code + 1) * 2 + 1] = 0xffff; // guard\n \n\t\t for (n = 0; n <= max_code; n++) {\n\t\t\tcurlen = nextlen;\n\t\t\tnextlen = tree[(n + 1) * 2 + 1];\n \n\t\t\tif (++count < max_count && curlen == nextlen) {\n\t\t\t continue;\n\t\t\t} else if (count < min_count) {\n\t\t\t bl_tree[curlen * 2] += count;\n\t\t\t} else if (curlen !== 0) {\n\t\t\t if (curlen != prevlen) bl_tree[curlen * 2]++;\n\t\t\t bl_tree[REP_3_6 * 2]++;\n\t\t\t} else if (count <= 10) {\n\t\t\t bl_tree[REPZ_3_10 * 2]++;\n\t\t\t} else {\n\t\t\t bl_tree[REPZ_11_138 * 2]++;\n\t\t\t}\n \n\t\t\tcount = 0;\n\t\t\tprevlen = curlen;\n \n\t\t\tif (nextlen === 0) {\n\t\t\t max_count = 138;\n\t\t\t min_count = 3;\n\t\t\t} else if (curlen == nextlen) {\n\t\t\t max_count = 6;\n\t\t\t min_count = 3;\n\t\t\t} else {\n\t\t\t max_count = 7;\n\t\t\t min_count = 4;\n\t\t\t}\n\t\t }\n\t\t} // Construct the Huffman tree for the bit lengths and return the index in","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do {\n send_code(s, curlen, s.bl_tree); \n } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code) // deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */\n\n /* guard already set */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n do {\n send_code(s, curlen, s.bl_tree);\n } while (--count !== 0);\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n } //Assert(count >= 3 && count <= 6, \" 3_6?\");\n\n\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code) // deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */\n\n /* guard already set */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n do {\n send_code(s, curlen, s.bl_tree);\n } while (--count !== 0);\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n } //Assert(count >= 3 && count <= 6, \" 3_6?\");\n\n\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree$1(s, tree, max_code)\n\t// deflate_state *s;\n\t// ct_data *tree; /* the tree to be scanned */\n\t// int max_code; /* and its largest code of non zero frequency */\n\t{\n\t var n; /* iterates over all tree elements */\n\t var prevlen = -1; /* last emitted length */\n\t var curlen; /* length of current code */\n\n\t var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n\t var count = 0; /* repeat count of the current code */\n\t var max_count = 7; /* max repeat count */\n\t var min_count = 4; /* min repeat count */\n\n\t /* tree[max_code+1].Len = -1; */ /* guard already set */\n\t if (nextlen === 0) {\n\t max_count = 138;\n\t min_count = 3;\n\t }\n\n\t for (n = 0; n <= max_code; n++) {\n\t curlen = nextlen;\n\t nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n\t if (++count < max_count && curlen === nextlen) {\n\t continue;\n\n\t } else if (count < min_count) {\n\t do { send_code$1(s, curlen, s.bl_tree); } while (--count !== 0);\n\n\t } else if (curlen !== 0) {\n\t if (curlen !== prevlen) {\n\t send_code$1(s, curlen, s.bl_tree);\n\t count--;\n\t }\n\t //Assert(count >= 3 && count <= 6, \" 3_6?\");\n\t send_code$1(s, REP_3_6$1, s.bl_tree);\n\t send_bits$1(s, count - 3, 2);\n\n\t } else if (count <= 10) {\n\t send_code$1(s, REPZ_3_10$1, s.bl_tree);\n\t send_bits$1(s, count - 3, 3);\n\n\t } else {\n\t send_code$1(s, REPZ_11_138$1, s.bl_tree);\n\t send_bits$1(s, count - 11, 7);\n\t }\n\n\t count = 0;\n\t prevlen = curlen;\n\t if (nextlen === 0) {\n\t max_count = 138;\n\t min_count = 3;\n\n\t } else if (curlen === nextlen) {\n\t max_count = 6;\n\t min_count = 3;\n\n\t } else {\n\t max_count = 7;\n\t min_count = 4;\n\t }\n\t }\n\t}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function send_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n {\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }"],"string":"[\n \"function build_bl_tree() {\\n\\t\\tvar max_blindex; // index of last bit length code of non zero freq\\n\\n\\t\\t// Determine the bit length frequencies for literal and distance trees\\n\\t\\tscan_tree(dyn_ltree, l_desc.max_code);\\n\\t\\tscan_tree(dyn_dtree, d_desc.max_code);\\n\\n\\t\\t// Build the bit length tree:\\n\\t\\tbuild_tree(bl_desc);\\n\\t\\t// opt_len now includes the length of the tree representations, except\\n\\t\\t// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\n\\t\\t// Determine the number of bit length codes to send. The pkzip format\\n\\t\\t// requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t\\t// 3 but the actual value used is 4.)\\n\\t\\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t\\t\\tif (bl_tree[bl_order[max_blindex]].dl !== 0) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Update opt_len to include the bit length tree and counts */\\n\\t\\topt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t\\t// Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\n\\t\\treturn max_blindex;\\n\\t}\",\n \"function build_bl_tree() {\\n\\t\\t var max_blindex; // index of last bit length code of non zero freq\\n\\t\\t // Determine the bit length frequencies for literal and distance trees\\n \\n\\t\\t scan_tree(dyn_ltree, l_desc.max_code);\\n\\t\\t scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree:\\n \\n\\t\\t bl_desc.build_tree(that); // opt_len now includes the length of the tree representations, except\\n\\t\\t // the lengths of the bit lengths codes and the 5+5+4 bits for the\\n\\t\\t // counts.\\n\\t\\t // Determine the number of bit length codes to send. The pkzip format\\n\\t\\t // requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t\\t // 3 but the actual value used is 4.)\\n \\n\\t\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t\\t\\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break;\\n\\t\\t } // Update opt_len to include the bit length tree and counts\\n \\n \\n\\t\\t that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t\\t return max_blindex;\\n\\t\\t} // Output a byte on the stream.\",\n \"static initHuffmanTree() {\\n let i = 0;\\n while (i < 144) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x030 + i) << 8);\\n ARR_LITERAL_LENGTHS[i++] = 8;\\n }\\n while (i < 256) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x190 - 144 + i) << 7);\\n ARR_LITERAL_LENGTHS[i++] = 9;\\n }\\n while (i < 280) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x000 - 256 + i) << 9);\\n ARR_LITERAL_LENGTHS[i++] = 7;\\n }\\n while (i < 286) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x0c0 - 280 + i) << 8);\\n ARR_LITERAL_LENGTHS[i++] = 8;\\n }\\n for (i = 0; i < 30; i++) {\\n ARR_DISTANCE_CODES[i] = CompressorHuffmanTree.bitReverse(i << 11);\\n ARR_DISTANCE_LENGTHS[i] = 5;\\n }\\n }\",\n \"function BuildHuffmanTable(root_table,root_table_off,\\n root_bits,\\n code_lengths,code_lengths_off,\\n code_lengths_size,\\n count,count_off) {\\n var code=new HuffmanCode(); /* current table entry */\\n var table=new Array(new HuffmanCode());//* /* next available space in table */\\n var table_off=0;\\n var len; /* current code length */\\n var symbol; /* symbol index in original or sorted table */\\n var key; /* reversed prefix code */\\n var step; /* step size to replicate values in current table */\\n var low; /* low bits for current root entry */\\n var mask; /* mask for low bits */\\n var table_bits; /* key length of current table */\\n var table_size; /* size of current table */\\n var total_size; /* sum of root table size and 2nd level table sizes */\\n /* symbols sorted by code length */\\n var sorted=new mallocArr(code_lengths_size,0);\\n /* offsets in sorted table for each length */\\n var offset=new mallocArr(kHuffmanMaxLength + 1,0);\\n var max_length = 1;\\n\\n /* generate offsets into sorted symbol table by code length */\\n {\\n var sum = 0;\\n for (len = 1; len <= kHuffmanMaxLength; len++) {\\n offset[len] = sum;\\n if (count[len]) {\\n sum = (sum + count[len]);\\n max_length = len;\\n }\\n }\\n }\\n\\n /* sort symbols by length, by symbol order within each length */\\n for (symbol = 0; symbol < code_lengths_size; symbol++) {\\n if (code_lengths[symbol] != 0) {\\n sorted[offset[code_lengths[symbol]]++] = symbol;\\n }\\n }\\n\\n table = root_table;\\n table_off = root_table_off;\\n table_bits = root_bits;\\n table_size = 1 << table_bits;\\n total_size = table_size;\\n\\n /* special case code with only one value */\\n if (offset[kHuffmanMaxLength] == 1) {\\n code.bits = 0;\\n code.value = (sorted[0]);\\n for (key = 0; key < total_size; ++key) {\\n table[table_off+key] = code;\\n }\\n return total_size;\\n }\\n\\n /* fill in root table */\\n /* let's reduce the table size to a smaller size if possible, and */\\n /* create the repetitions by memcpy if possible in the coming loop */\\n if (table_bits > max_length) {\\n table_bits = max_length;\\n table_size = 1 << table_bits;\\n }\\n key = 0;\\n symbol = 0;\\n code.bits = 1;\\n step = 2;\\n do {\\n for (; count[code.bits] != 0; --count[code.bits]) {\\n code.value = (sorted[symbol++]);\\n ReplicateValue(table,table_off+key, step, table_size, code);\\n key = GetNextKey(key, code.bits);\\n }\\n step <<= 1;\\n } while (++code.bits <= table_bits);\\n\\n /* if root_bits != table_bits we only created one fraction of the */\\n /* table, and we need to replicate it now. */\\n while (total_size != table_size) {\\n //memcpy(&table[table_size], &table[0], table_size * sizeof(table[0]));\\n\\tfor(var i=0;i> root_bits), step, table_size, code);\\n key = GetNextKey(key, len);\\n }\\n }\\n\\n return total_size;\\n}\",\n \"function send_tree(s, tree, max_code) // deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n;\\n /* iterates over all tree elements */\\n\\n var prevlen = -1;\\n /* last emitted length */\\n\\n var curlen;\\n /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]\\n /*.Len*/\\n ;\\n /* length of next code */\\n\\n var count = 0;\\n /* repeat count of the current code */\\n\\n var max_count = 7;\\n /* max repeat count */\\n\\n var min_count = 4;\\n /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */\\n\\n /* guard already set */\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]\\n /*.Len*/\\n ;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree);\\n } while (--count !== 0);\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n } //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\n\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function build_bl_tree(s){var max_blindex;/* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */scan_tree(s,s.dyn_ltree,s.l_desc.max_code);scan_tree(s,s.dyn_dtree,s.d_desc.max_code);/* Build the bit length tree: */build_tree(s,s.bl_desc);/* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */ /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */for(max_blindex=BL_CODES-1;max_blindex>=3;max_blindex--){if(s.bl_tree[bl_order[max_blindex]*2+1]/*.Len*/!==0){break;}}/* Update opt_len to include the bit length tree and counts */s.opt_len+=3*(max_blindex+1)+5+5+4;//Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n return max_blindex;}\",\n \"function scan_tree(tree, // the tree to be scanned\\n\\t\\tmax_code // and its largest code of non zero frequency\\n\\t\\t) {\\n\\t\\t var n; // iterates over all tree elements\\n \\n\\t\\t var prevlen = -1; // last emitted length\\n \\n\\t\\t var curlen; // length of current code\\n \\n\\t\\t var nextlen = tree[0 * 2 + 1]; // length of next code\\n \\n\\t\\t var count = 0; // repeat count of the current code\\n \\n\\t\\t var max_count = 7; // max repeat count\\n \\n\\t\\t var min_count = 4; // min repeat count\\n \\n\\t\\t if (nextlen === 0) {\\n\\t\\t\\tmax_count = 138;\\n\\t\\t\\tmin_count = 3;\\n\\t\\t }\\n \\n\\t\\t tree[(max_code + 1) * 2 + 1] = 0xffff; // guard\\n \\n\\t\\t for (n = 0; n <= max_code; n++) {\\n\\t\\t\\tcurlen = nextlen;\\n\\t\\t\\tnextlen = tree[(n + 1) * 2 + 1];\\n \\n\\t\\t\\tif (++count < max_count && curlen == nextlen) {\\n\\t\\t\\t continue;\\n\\t\\t\\t} else if (count < min_count) {\\n\\t\\t\\t bl_tree[curlen * 2] += count;\\n\\t\\t\\t} else if (curlen !== 0) {\\n\\t\\t\\t if (curlen != prevlen) bl_tree[curlen * 2]++;\\n\\t\\t\\t bl_tree[REP_3_6 * 2]++;\\n\\t\\t\\t} else if (count <= 10) {\\n\\t\\t\\t bl_tree[REPZ_3_10 * 2]++;\\n\\t\\t\\t} else {\\n\\t\\t\\t bl_tree[REPZ_11_138 * 2]++;\\n\\t\\t\\t}\\n \\n\\t\\t\\tcount = 0;\\n\\t\\t\\tprevlen = curlen;\\n \\n\\t\\t\\tif (nextlen === 0) {\\n\\t\\t\\t max_count = 138;\\n\\t\\t\\t min_count = 3;\\n\\t\\t\\t} else if (curlen == nextlen) {\\n\\t\\t\\t max_count = 6;\\n\\t\\t\\t min_count = 3;\\n\\t\\t\\t} else {\\n\\t\\t\\t max_count = 7;\\n\\t\\t\\t min_count = 4;\\n\\t\\t\\t}\\n\\t\\t }\\n\\t\\t} // Construct the Huffman tree for the bit lengths and return the index in\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n let n; /* iterates over all tree elements */\\n let prevlen = -1; /* last emitted length */\\n let curlen; /* length of current code */\\n\\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n let count = 0; /* repeat count of the current code */\\n let max_count = 7; /* max repeat count */\\n let min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree); \\n } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code) // deflate_state *s;\\n // ct_data *tree; /* the tree to be scanned */\\n // int max_code; /* and its largest code of non zero frequency */\\n {\\n var n;\\n /* iterates over all tree elements */\\n\\n var prevlen = -1;\\n /* last emitted length */\\n\\n var curlen;\\n /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]\\n /*.Len*/\\n ;\\n /* length of next code */\\n\\n var count = 0;\\n /* repeat count of the current code */\\n\\n var max_count = 7;\\n /* max repeat count */\\n\\n var min_count = 4;\\n /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */\\n\\n /* guard already set */\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]\\n /*.Len*/\\n ;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree);\\n } while (--count !== 0);\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n } //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\n\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n }\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count-3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count-3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count-11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code) // deflate_state *s;\\n // ct_data *tree; /* the tree to be scanned */\\n // int max_code; /* and its largest code of non zero frequency */\\n {\\n var n;\\n /* iterates over all tree elements */\\n\\n var prevlen = -1;\\n /* last emitted length */\\n\\n var curlen;\\n /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]\\n /*.Len*/\\n ;\\n /* length of next code */\\n\\n var count = 0;\\n /* repeat count of the current code */\\n\\n var max_count = 7;\\n /* max repeat count */\\n\\n var min_count = 4;\\n /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */\\n\\n /* guard already set */\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]\\n /*.Len*/\\n ;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n } else if (count < min_count) {\\n do {\\n send_code(s, curlen, s.bl_tree);\\n } while (--count !== 0);\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n } //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\n\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n }\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree$1(s, tree, max_code)\\n\\t// deflate_state *s;\\n\\t// ct_data *tree; /* the tree to be scanned */\\n\\t// int max_code; /* and its largest code of non zero frequency */\\n\\t{\\n\\t var n; /* iterates over all tree elements */\\n\\t var prevlen = -1; /* last emitted length */\\n\\t var curlen; /* length of current code */\\n\\n\\t var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n\\t var count = 0; /* repeat count of the current code */\\n\\t var max_count = 7; /* max repeat count */\\n\\t var min_count = 4; /* min repeat count */\\n\\n\\t /* tree[max_code+1].Len = -1; */ /* guard already set */\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\t }\\n\\n\\t for (n = 0; n <= max_code; n++) {\\n\\t curlen = nextlen;\\n\\t nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n\\t if (++count < max_count && curlen === nextlen) {\\n\\t continue;\\n\\n\\t } else if (count < min_count) {\\n\\t do { send_code$1(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n\\t } else if (curlen !== 0) {\\n\\t if (curlen !== prevlen) {\\n\\t send_code$1(s, curlen, s.bl_tree);\\n\\t count--;\\n\\t }\\n\\t //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n\\t send_code$1(s, REP_3_6$1, s.bl_tree);\\n\\t send_bits$1(s, count - 3, 2);\\n\\n\\t } else if (count <= 10) {\\n\\t send_code$1(s, REPZ_3_10$1, s.bl_tree);\\n\\t send_bits$1(s, count - 3, 3);\\n\\n\\t } else {\\n\\t send_code$1(s, REPZ_11_138$1, s.bl_tree);\\n\\t send_bits$1(s, count - 11, 7);\\n\\t }\\n\\n\\t count = 0;\\n\\t prevlen = curlen;\\n\\t if (nextlen === 0) {\\n\\t max_count = 138;\\n\\t min_count = 3;\\n\\n\\t } else if (curlen === nextlen) {\\n\\t max_count = 6;\\n\\t min_count = 3;\\n\\n\\t } else {\\n\\t max_count = 7;\\n\\t min_count = 4;\\n\\t }\\n\\t }\\n\\t}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n{\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n}\",\n \"function send_tree(s, tree, max_code)\\n// deflate_state *s;\\n// ct_data *tree; /* the tree to be scanned */\\n// int max_code; /* and its largest code of non zero frequency */\\n {\\n var n; /* iterates over all tree elements */\\n var prevlen = -1; /* last emitted length */\\n var curlen; /* length of current code */\\n\\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\\n\\n var count = 0; /* repeat count of the current code */\\n var max_count = 7; /* max repeat count */\\n var min_count = 4; /* min repeat count */\\n\\n /* tree[max_code+1].Len = -1; */ /* guard already set */\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n }\\n\\n for (n = 0; n <= max_code; n++) {\\n curlen = nextlen;\\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\\n\\n if (++count < max_count && curlen === nextlen) {\\n continue;\\n\\n } else if (count < min_count) {\\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\\n\\n } else if (curlen !== 0) {\\n if (curlen !== prevlen) {\\n send_code(s, curlen, s.bl_tree);\\n count--;\\n }\\n //Assert(count >= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s, REP_3_6, s.bl_tree);\\n send_bits(s, count - 3, 2);\\n\\n } else if (count <= 10) {\\n send_code(s, REPZ_3_10, s.bl_tree);\\n send_bits(s, count - 3, 3);\\n\\n } else {\\n send_code(s, REPZ_11_138, s.bl_tree);\\n send_bits(s, count - 11, 7);\\n }\\n\\n count = 0;\\n prevlen = curlen;\\n if (nextlen === 0) {\\n max_count = 138;\\n min_count = 3;\\n\\n } else if (curlen === nextlen) {\\n max_count = 6;\\n min_count = 3;\\n\\n } else {\\n max_count = 7;\\n min_count = 4;\\n }\\n }\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.6371719","0.63665086","0.6333171","0.6235446","0.62348443","0.6192163","0.6171294","0.61624026","0.61611164","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.6161077","0.61574686","0.6153398","0.61473584","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.6142711","0.61398953"],"string":"[\n \"0.6371719\",\n \"0.63665086\",\n \"0.6333171\",\n \"0.6235446\",\n \"0.62348443\",\n \"0.6192163\",\n \"0.6171294\",\n \"0.61624026\",\n \"0.61611164\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.6161077\",\n \"0.61574686\",\n \"0.6153398\",\n \"0.61473584\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.6142711\",\n \"0.61398953\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81753,"cells":{"query":{"kind":"string","value":"=========================================================================== Scan a literal or distance tree to determine the frequencies of the codes in the bit length tree."},"document":{"kind":"string","value":"function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code+1)*2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n+1)*2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6*2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10*2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138*2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function scan_tree(tree, // the tree to be scanned\n\t\tmax_code // and its largest code of non zero frequency\n\t\t) {\n\t\t var n; // iterates over all tree elements\n \n\t\t var prevlen = -1; // last emitted length\n \n\t\t var curlen; // length of current code\n \n\t\t var nextlen = tree[0 * 2 + 1]; // length of next code\n \n\t\t var count = 0; // repeat count of the current code\n \n\t\t var max_count = 7; // max repeat count\n \n\t\t var min_count = 4; // min repeat count\n \n\t\t if (nextlen === 0) {\n\t\t\tmax_count = 138;\n\t\t\tmin_count = 3;\n\t\t }\n \n\t\t tree[(max_code + 1) * 2 + 1] = 0xffff; // guard\n \n\t\t for (n = 0; n <= max_code; n++) {\n\t\t\tcurlen = nextlen;\n\t\t\tnextlen = tree[(n + 1) * 2 + 1];\n \n\t\t\tif (++count < max_count && curlen == nextlen) {\n\t\t\t continue;\n\t\t\t} else if (count < min_count) {\n\t\t\t bl_tree[curlen * 2] += count;\n\t\t\t} else if (curlen !== 0) {\n\t\t\t if (curlen != prevlen) bl_tree[curlen * 2]++;\n\t\t\t bl_tree[REP_3_6 * 2]++;\n\t\t\t} else if (count <= 10) {\n\t\t\t bl_tree[REPZ_3_10 * 2]++;\n\t\t\t} else {\n\t\t\t bl_tree[REPZ_11_138 * 2]++;\n\t\t\t}\n \n\t\t\tcount = 0;\n\t\t\tprevlen = curlen;\n \n\t\t\tif (nextlen === 0) {\n\t\t\t max_count = 138;\n\t\t\t min_count = 3;\n\t\t\t} else if (curlen == nextlen) {\n\t\t\t max_count = 6;\n\t\t\t min_count = 3;\n\t\t\t} else {\n\t\t\t max_count = 7;\n\t\t\t min_count = 4;\n\t\t\t}\n\t\t }\n\t\t} // Construct the Huffman tree for the bit lengths and return the index in","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1] /*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1] /*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1] /*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n s.bl_tree[curlen * 2] /*.Freq*/ += count;\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) {\n s.bl_tree[curlen * 2] /*.Freq*/++;\n }\n s.bl_tree[REP_3_6 * 2] /*.Freq*/++;\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++;\n } else {\n s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code) // deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n tree[(max_code + 1) * 2 + 1]\n /*.Len*/\n = 0xffff;\n /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]\n /*.Freq*/\n += count;\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n s.bl_tree[curlen * 2] /*.Freq*/++;\n }\n\n s.bl_tree[REP_3_6 * 2] /*.Freq*/++;\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++;\n } else {\n s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) {\n s.bl_tree[curlen * 2]/*.Freq*/++; \n }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code)\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}","function scan_tree(s, tree, max_code) // deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n tree[(max_code + 1) * 2 + 1]\n /*.Len*/\n = 0xffff;\n /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]\n /*.Freq*/\n += count;\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n s.bl_tree[curlen * 2] /*.Freq*/++;\n }\n\n s.bl_tree[REP_3_6 * 2] /*.Freq*/++;\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++;\n } else {\n s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }","function scan_tree(s, tree, max_code) // deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {\n var n;\n /* iterates over all tree elements */\n\n var prevlen = -1;\n /* last emitted length */\n\n var curlen;\n /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]\n /*.Len*/\n ;\n /* length of next code */\n\n var count = 0;\n /* repeat count of the current code */\n\n var max_count = 7;\n /* max repeat count */\n\n var min_count = 4;\n /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n tree[(max_code + 1) * 2 + 1]\n /*.Len*/\n = 0xffff;\n /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]\n /*.Len*/\n ;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]\n /*.Freq*/\n += count;\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n s.bl_tree[curlen * 2] /*.Freq*/++;\n }\n\n s.bl_tree[REP_3_6 * 2] /*.Freq*/++;\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2] /*.Freq*/++;\n } else {\n s.bl_tree[REPZ_11_138 * 2] /*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n }","function scan_tree(s,tree,max_code)// deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {var n;/* iterates over all tree elements */var prevlen=-1;/* last emitted length */var curlen;/* length of current code */var nextlen=tree[0*2+1]/*.Len*/;/* length of next code */var count=0;/* repeat count of the current code */var max_count=7;/* max repeat count */var min_count=4;/* min repeat count */if(nextlen===0){max_count=138;min_count=3;}tree[(max_code+1)*2+1]/*.Len*/=0xffff;/* guard */for(n=0;n<=max_code;n++){curlen=nextlen;nextlen=tree[(n+1)*2+1]/*.Len*/;if(++count= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count-3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count-3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count-11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function send_all_trees(lcodes, dcodes, blcodes) {\n\t\t var rank; // index in bl_order\n \n\t\t send_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt\n \n\t\t send_bits(dcodes - 1, 5);\n\t\t send_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt\n \n\t\t for (rank = 0; rank < blcodes; rank++) {\n\t\t\tsend_bits(bl_tree[Tree.bl_order[rank] * 2 + 1], 3);\n\t\t }\n \n\t\t send_tree(dyn_ltree, lcodes - 1); // literal tree\n \n\t\t send_tree(dyn_dtree, dcodes - 1); // distance tree\n\t\t} // Flush the bit buffer, keeping at most 7 bits in it.","function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank;\n /* index in bl_order */\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n\n send_bits(s, lcodes - 257, 5);\n /* not +255 as stated in appnote.txt */\n\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4);\n /* not -3 as stated in appnote.txt */\n\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\n /*.Len*/\n , 3);\n } //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n\n send_tree(s, s.dyn_ltree, lcodes - 1);\n /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1);\n /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function $AvaN$var$send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank;\n /* index in bl_order */\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n\n $AvaN$var$send_bits(s, lcodes - 257, 5);\n /* not +255 as stated in appnote.txt */\n\n $AvaN$var$send_bits(s, dcodes - 1, 5);\n $AvaN$var$send_bits(s, blcodes - 4, 4);\n /* not -3 as stated in appnote.txt */\n\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n $AvaN$var$send_bits(s, s.bl_tree[$AvaN$var$bl_order[rank] * 2 + 1]\n /*.Len*/\n , 3);\n } //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n\n $AvaN$var$send_tree(s, s.dyn_ltree, lcodes - 1);\n /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n $AvaN$var$send_tree(s, s.dyn_dtree, dcodes - 1);\n /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s,lcodes,dcodes,blcodes)// deflate_state *s;\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\n {var rank;/* index in bl_order */ //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s,lcodes-257,5);/* not +255 as stated in appnote.txt */send_bits(s,dcodes-1,5);send_bits(s,blcodes-4,4);/* not -3 as stated in appnote.txt */for(rank=0;rankbits_sent));\n send_tree(s,s.dyn_ltree,lcodes-1);/* literal tree */ //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n send_tree(s,s.dyn_dtree,dcodes-1);/* distance tree */ //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n }","function send_tree(s,tree,max_code)// deflate_state *s;\n // ct_data *tree; /* the tree to be scanned */\n // int max_code; /* and its largest code of non zero frequency */\n {var n;/* iterates over all tree elements */var prevlen=-1;/* last emitted length */var curlen;/* length of current code */var nextlen=tree[0*2+1]/*.Len*/;/* length of next code */var count=0;/* repeat count of the current code */var max_count=7;/* max repeat count */var min_count=4;/* min repeat count */ /* tree[max_code+1].Len = -1; */ /* guard already set */if(nextlen===0){max_count=138;min_count=3;}for(n=0;n<=max_code;n++){curlen=nextlen;nextlen=tree[(n+1)*2+1]/*.Len*/;if(++count= 3 && count <= 6, \" 3_6?\");\n send_code(s,REP_3_6,s.bl_tree);send_bits(s,count-3,2);}else if(count<=10){send_code(s,REPZ_3_10,s.bl_tree);send_bits(s,count-3,3);}else {send_code(s,REPZ_11_138,s.bl_tree);send_bits(s,count-11,7);}count=0;prevlen=curlen;if(nextlen===0){max_count=138;min_count=3;}else if(curlen===nextlen){max_count=6;min_count=3;}else {max_count=7;min_count=4;}}}","function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\n {\n var rank;\n /* index in bl_order */\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n\n send_bits(s, lcodes - 257, 5);\n /* not +255 as stated in appnote.txt */\n\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4);\n /* not -3 as stated in appnote.txt */\n\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\n /*.Len*/\n , 3);\n } //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n\n send_tree(s, s.dyn_ltree, lcodes - 1);\n /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1);\n /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n }","function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\n {\n var rank;\n /* index in bl_order */\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n\n send_bits(s, lcodes - 257, 5);\n /* not +255 as stated in appnote.txt */\n\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4);\n /* not -3 as stated in appnote.txt */\n\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\n /*.Len*/\n , 3);\n } //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n\n send_tree(s, s.dyn_ltree, lcodes - 1);\n /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1);\n /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n }","function compress_block(ltree, dtree) {\n\t\tvar dist; // distance of matched string\n\t\tvar lc; // match length or unmatched char (if dist === 0)\n\t\tvar lx = 0; // running index in l_buf\n\t\tvar dx = 0; // running index in d_buf\n\t\tvar fx = 0; // running index in flag_buf\n\t\tvar flag = 0; // current flags\n\t\tvar code; // the code to send\n\t\tvar extra; // number of extra bits to send\n\n\t\tif (last_lit !== 0) {\n\t\t\tdo {\n\t\t\t\tif ((lx & 7) === 0) {\n\t\t\t\t\tflag = flag_buf[fx++];\n\t\t\t\t}\n\t\t\t\tlc = l_buf[lx++] & 0xff;\n\t\t\t\tif ((flag & 1) === 0) {\n\t\t\t\t\tSEND_CODE(lc, ltree); /* send a literal byte */\n\t\t\t\t\t//\tTracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n\t\t\t\t} else {\n\t\t\t\t\t// Here, lc is the match length - MIN_MATCH\n\t\t\t\t\tcode = length_code[lc];\n\t\t\t\t\tSEND_CODE(code + LITERALS + 1, ltree); // send the length code\n\t\t\t\t\textra = extra_lbits[code];\n\t\t\t\t\tif (extra !== 0) {\n\t\t\t\t\t\tlc -= base_length[code];\n\t\t\t\t\t\tsend_bits(lc, extra); // send the extra length bits\n\t\t\t\t\t}\n\t\t\t\t\tdist = d_buf[dx++];\n\t\t\t\t\t// Here, dist is the match distance - 1\n\t\t\t\t\tcode = D_CODE(dist);\n\t\t\t\t\t//\tAssert (code < D_CODES, \"bad d_code\");\n\n\t\t\t\t\tSEND_CODE(code, dtree); // send the distance code\n\t\t\t\t\textra = extra_dbits[code];\n\t\t\t\t\tif (extra !== 0) {\n\t\t\t\t\t\tdist -= base_dist[code];\n\t\t\t\t\t\tsend_bits(dist, extra); // send the extra distance bits\n\t\t\t\t\t}\n\t\t\t\t} // literal or match pair ?\n\t\t\t\tflag >>= 1;\n\t\t\t} while (lx < last_lit);\n\t\t}\n\n\t\tSEND_CODE(END_BLOCK, ltree);\n\t}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n let rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(lcodes, dcodes, blcodes) { // number of codes for each tree\n\t\tvar rank; // index in bl_order\n\n\t\t// Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n\t\t// Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, \"too many codes\");\n\t\t// Tracev((stderr, \"\\nbl counts: \"));\n\t\tsend_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt\n\t\tsend_bits(dcodes - 1, 5);\n\t\tsend_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt\n\t\tfor (rank = 0; rank < blcodes; rank++) {\n\t\t\t// Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n\t\t\tsend_bits(bl_tree[bl_order[rank]].dl, 3);\n\t\t}\n\n\t\t// send the literal tree\n\t\tsend_tree(dyn_ltree, lcodes - 1);\n\n\t\t// send the distance tree\n\t\tsend_tree(dyn_dtree, dcodes - 1);\n\t}","function send_all_trees$1(s, lcodes, dcodes, blcodes)\n\t// deflate_state *s;\n\t// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\t{\n\t var rank; /* index in bl_order */\n\n\t //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n\t //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n\t // \"too many codes\");\n\t //Tracev((stderr, \"\\nbl counts: \"));\n\t send_bits$1(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n\t send_bits$1(s, dcodes - 1, 5);\n\t send_bits$1(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n\t for (rank = 0; rank < blcodes; rank++) {\n\t //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n\t send_bits$1(s, s.bl_tree[bl_order$1[rank] * 2 + 1]/*.Len*/, 3);\n\t }\n\t //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n\t send_tree$1(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n\t //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n\t send_tree$1(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n\t //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n\t}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1] /*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}","function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}"],"string":"[\n \"function send_all_trees(lcodes, dcodes, blcodes) {\\n\\t\\t var rank; // index in bl_order\\n \\n\\t\\t send_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt\\n \\n\\t\\t send_bits(dcodes - 1, 5);\\n\\t\\t send_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt\\n \\n\\t\\t for (rank = 0; rank < blcodes; rank++) {\\n\\t\\t\\tsend_bits(bl_tree[Tree.bl_order[rank] * 2 + 1], 3);\\n\\t\\t }\\n \\n\\t\\t send_tree(dyn_ltree, lcodes - 1); // literal tree\\n \\n\\t\\t send_tree(dyn_dtree, dcodes - 1); // distance tree\\n\\t\\t} // Flush the bit buffer, keeping at most 7 bits in it.\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank;\\n /* index in bl_order */\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n\\n send_bits(s, lcodes - 257, 5);\\n /* not +255 as stated in appnote.txt */\\n\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4);\\n /* not -3 as stated in appnote.txt */\\n\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\\n /*.Len*/\\n , 3);\\n } //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1);\\n /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1);\\n /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function $AvaN$var$send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank;\\n /* index in bl_order */\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n\\n $AvaN$var$send_bits(s, lcodes - 257, 5);\\n /* not +255 as stated in appnote.txt */\\n\\n $AvaN$var$send_bits(s, dcodes - 1, 5);\\n $AvaN$var$send_bits(s, blcodes - 4, 4);\\n /* not -3 as stated in appnote.txt */\\n\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n $AvaN$var$send_bits(s, s.bl_tree[$AvaN$var$bl_order[rank] * 2 + 1]\\n /*.Len*/\\n , 3);\\n } //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n\\n $AvaN$var$send_tree(s, s.dyn_ltree, lcodes - 1);\\n /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n $AvaN$var$send_tree(s, s.dyn_dtree, dcodes - 1);\\n /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s,lcodes,dcodes,blcodes)// deflate_state *s;\\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n {var rank;/* index in bl_order */ //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s,lcodes-257,5);/* not +255 as stated in appnote.txt */send_bits(s,dcodes-1,5);send_bits(s,blcodes-4,4);/* not -3 as stated in appnote.txt */for(rank=0;rankbits_sent));\\n send_tree(s,s.dyn_ltree,lcodes-1);/* literal tree */ //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n send_tree(s,s.dyn_dtree,dcodes-1);/* distance tree */ //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n }\",\n \"function send_tree(s,tree,max_code)// deflate_state *s;\\n // ct_data *tree; /* the tree to be scanned */\\n // int max_code; /* and its largest code of non zero frequency */\\n {var n;/* iterates over all tree elements */var prevlen=-1;/* last emitted length */var curlen;/* length of current code */var nextlen=tree[0*2+1]/*.Len*/;/* length of next code */var count=0;/* repeat count of the current code */var max_count=7;/* max repeat count */var min_count=4;/* min repeat count */ /* tree[max_code+1].Len = -1; */ /* guard already set */if(nextlen===0){max_count=138;min_count=3;}for(n=0;n<=max_code;n++){curlen=nextlen;nextlen=tree[(n+1)*2+1]/*.Len*/;if(++count= 3 && count <= 6, \\\" 3_6?\\\");\\n send_code(s,REP_3_6,s.bl_tree);send_bits(s,count-3,2);}else if(count<=10){send_code(s,REPZ_3_10,s.bl_tree);send_bits(s,count-3,3);}else {send_code(s,REPZ_11_138,s.bl_tree);send_bits(s,count-11,7);}count=0;prevlen=curlen;if(nextlen===0){max_count=138;min_count=3;}else if(curlen===nextlen){max_count=6;min_count=3;}else {max_count=7;min_count=4;}}}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n {\\n var rank;\\n /* index in bl_order */\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n\\n send_bits(s, lcodes - 257, 5);\\n /* not +255 as stated in appnote.txt */\\n\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4);\\n /* not -3 as stated in appnote.txt */\\n\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\\n /*.Len*/\\n , 3);\\n } //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1);\\n /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1);\\n /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n }\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes) // deflate_state *s;\\n // int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n {\\n var rank;\\n /* index in bl_order */\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n\\n send_bits(s, lcodes - 257, 5);\\n /* not +255 as stated in appnote.txt */\\n\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4);\\n /* not -3 as stated in appnote.txt */\\n\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]\\n /*.Len*/\\n , 3);\\n } //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1);\\n /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1);\\n /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n }\",\n \"function compress_block(ltree, dtree) {\\n\\t\\tvar dist; // distance of matched string\\n\\t\\tvar lc; // match length or unmatched char (if dist === 0)\\n\\t\\tvar lx = 0; // running index in l_buf\\n\\t\\tvar dx = 0; // running index in d_buf\\n\\t\\tvar fx = 0; // running index in flag_buf\\n\\t\\tvar flag = 0; // current flags\\n\\t\\tvar code; // the code to send\\n\\t\\tvar extra; // number of extra bits to send\\n\\n\\t\\tif (last_lit !== 0) {\\n\\t\\t\\tdo {\\n\\t\\t\\t\\tif ((lx & 7) === 0) {\\n\\t\\t\\t\\t\\tflag = flag_buf[fx++];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tlc = l_buf[lx++] & 0xff;\\n\\t\\t\\t\\tif ((flag & 1) === 0) {\\n\\t\\t\\t\\t\\tSEND_CODE(lc, ltree); /* send a literal byte */\\n\\t\\t\\t\\t\\t//\\tTracecv(isgraph(lc), (stderr,\\\" '%c' \\\", lc));\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t// Here, lc is the match length - MIN_MATCH\\n\\t\\t\\t\\t\\tcode = length_code[lc];\\n\\t\\t\\t\\t\\tSEND_CODE(code + LITERALS + 1, ltree); // send the length code\\n\\t\\t\\t\\t\\textra = extra_lbits[code];\\n\\t\\t\\t\\t\\tif (extra !== 0) {\\n\\t\\t\\t\\t\\t\\tlc -= base_length[code];\\n\\t\\t\\t\\t\\t\\tsend_bits(lc, extra); // send the extra length bits\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tdist = d_buf[dx++];\\n\\t\\t\\t\\t\\t// Here, dist is the match distance - 1\\n\\t\\t\\t\\t\\tcode = D_CODE(dist);\\n\\t\\t\\t\\t\\t//\\tAssert (code < D_CODES, \\\"bad d_code\\\");\\n\\n\\t\\t\\t\\t\\tSEND_CODE(code, dtree); // send the distance code\\n\\t\\t\\t\\t\\textra = extra_dbits[code];\\n\\t\\t\\t\\t\\tif (extra !== 0) {\\n\\t\\t\\t\\t\\t\\tdist -= base_dist[code];\\n\\t\\t\\t\\t\\t\\tsend_bits(dist, extra); // send the extra distance bits\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} // literal or match pair ?\\n\\t\\t\\t\\tflag >>= 1;\\n\\t\\t\\t} while (lx < last_lit);\\n\\t\\t}\\n\\n\\t\\tSEND_CODE(END_BLOCK, ltree);\\n\\t}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n let rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(lcodes, dcodes, blcodes) { // number of codes for each tree\\n\\t\\tvar rank; // index in bl_order\\n\\n\\t\\t// Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n\\t\\t// Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, \\\"too many codes\\\");\\n\\t\\t// Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n\\t\\tsend_bits(lcodes - 257, 5); // not +255 as stated in appnote.txt\\n\\t\\tsend_bits(dcodes - 1, 5);\\n\\t\\tsend_bits(blcodes - 4, 4); // not -3 as stated in appnote.txt\\n\\t\\tfor (rank = 0; rank < blcodes; rank++) {\\n\\t\\t\\t// Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n\\t\\t\\tsend_bits(bl_tree[bl_order[rank]].dl, 3);\\n\\t\\t}\\n\\n\\t\\t// send the literal tree\\n\\t\\tsend_tree(dyn_ltree, lcodes - 1);\\n\\n\\t\\t// send the distance tree\\n\\t\\tsend_tree(dyn_dtree, dcodes - 1);\\n\\t}\",\n \"function send_all_trees$1(s, lcodes, dcodes, blcodes)\\n\\t// deflate_state *s;\\n\\t// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n\\t{\\n\\t var rank; /* index in bl_order */\\n\\n\\t //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n\\t //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n\\t // \\\"too many codes\\\");\\n\\t //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n\\t send_bits$1(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n\\t send_bits$1(s, dcodes - 1, 5);\\n\\t send_bits$1(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n\\t for (rank = 0; rank < blcodes; rank++) {\\n\\t //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n\\t send_bits$1(s, s.bl_tree[bl_order$1[rank] * 2 + 1]/*.Len*/, 3);\\n\\t }\\n\\t //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n\\t send_tree$1(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n\\t //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n\\t send_tree$1(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n\\t //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n\\t}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1] /*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes - 1, 5);\\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\",\n \"function send_all_trees(s, lcodes, dcodes, blcodes)\\n// deflate_state *s;\\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\\n{\\n var rank; /* index in bl_order */\\n\\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \\\"not enough codes\\\");\\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\\n // \\\"too many codes\\\");\\n //Tracev((stderr, \\\"\\\\nbl counts: \\\"));\\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\\n send_bits(s, dcodes-1, 5);\\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\\n for (rank = 0; rank < blcodes; rank++) {\\n //Tracev((stderr, \\\"\\\\nbl code %2d \\\", bl_order[rank]));\\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\\n }\\n //Tracev((stderr, \\\"\\\\nbl tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\\n //Tracev((stderr, \\\"\\\\nlit tree: sent %ld\\\", s->bits_sent));\\n\\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\\n //Tracev((stderr, \\\"\\\\ndist tree: sent %ld\\\", s->bits_sent));\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.721052","0.6960736","0.6942097","0.6926114","0.6910601","0.6898549","0.6897821","0.6881878","0.68465155","0.6825804","0.68159336","0.6795697","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.6787552","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164","0.67743164"],"string":"[\n \"0.721052\",\n \"0.6960736\",\n \"0.6942097\",\n \"0.6926114\",\n \"0.6910601\",\n \"0.6898549\",\n \"0.6897821\",\n \"0.6881878\",\n \"0.68465155\",\n \"0.6825804\",\n \"0.68159336\",\n \"0.6795697\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.6787552\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\",\n \"0.67743164\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81755,"cells":{"query":{"kind":"string","value":"=========================================================================== Construct the Huffman tree for the bit lengths and return the index in bl_order of the last bit length code to send."},"document":{"kind":"string","value":"function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3*(max_blindex+1) + 5+5+4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function build_bl_tree() {\n\t\tvar max_blindex; // index of last bit length code of non zero freq\n\n\t\t// Determine the bit length frequencies for literal and distance trees\n\t\tscan_tree(dyn_ltree, l_desc.max_code);\n\t\tscan_tree(dyn_dtree, d_desc.max_code);\n\n\t\t// Build the bit length tree:\n\t\tbuild_tree(bl_desc);\n\t\t// opt_len now includes the length of the tree representations, except\n\t\t// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\n\t\t// Determine the number of bit length codes to send. The pkzip format\n\t\t// requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t// 3 but the actual value used is 4.)\n\t\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[bl_order[max_blindex]].dl !== 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// Update opt_len to include the bit length tree and counts */\n\t\topt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t\t// Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\n\t\treturn max_blindex;\n\t}","function build_bl_tree() {\n\t\t var max_blindex; // index of last bit length code of non zero freq\n\t\t // Determine the bit length frequencies for literal and distance trees\n \n\t\t scan_tree(dyn_ltree, l_desc.max_code);\n\t\t scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree:\n \n\t\t bl_desc.build_tree(that); // opt_len now includes the length of the tree representations, except\n\t\t // the lengths of the bit lengths codes and the 5+5+4 bits for the\n\t\t // counts.\n\t\t // Determine the number of bit length codes to send. The pkzip format\n\t\t // requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t // 3 but the actual value used is 4.)\n \n\t\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break;\n\t\t } // Update opt_len to include the bit length tree and counts\n \n \n\t\t that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t\t return max_blindex;\n\t\t} // Output a byte on the stream.","function build_bl_tree(s){var max_blindex;/* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */scan_tree(s,s.dyn_ltree,s.l_desc.max_code);scan_tree(s,s.dyn_dtree,s.d_desc.max_code);/* Build the bit length tree: */build_tree(s,s.bl_desc);/* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */ /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */for(max_blindex=BL_CODES-1;max_blindex>=3;max_blindex--){if(s.bl_tree[bl_order[max_blindex]*2+1]/*.Len*/!==0){break;}}/* Update opt_len to include the bit length tree and counts */s.opt_len+=3*(max_blindex+1)+5+5+4;//Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n return max_blindex;}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\t\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\t\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\t\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\t\n\t return max_blindex;\n\t }","function build_bl_tree(s) {\n var max_blindex;\n /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n /* Build the bit length tree: */\n\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\n /*.Len*/\n !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n\n\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n }","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n \n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n \n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n \n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n \n return max_blindex;\n }","function build_bl_tree(s) {\n var max_blindex;\n /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n /* Build the bit length tree: */\n\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\n /*.Len*/\n !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n\n\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n var max_blindex;\n /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n /* Build the bit length tree: */\n\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\n /*.Len*/\n !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n\n\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n }","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1] /*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3*(max_blindex+1) + 5+5+4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n\t var max_blindex; /* index of last bit length code of non zero freq */\n\n\t /* Determine the bit length frequencies for literal and distance trees */\n\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n\t /* Build the bit length tree: */\n\t build_tree(s, s.bl_desc);\n\t /* opt_len now includes the length of the tree representations, except\n\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\t */\n\n\t /* Determine the number of bit length codes to send. The pkzip format\n\t * requires that at least 4 bit length codes be sent. (appnote.txt says\n\t * 3 but the actual value used is 4.)\n\t */\n\t for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\n\t if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {\n\t break;\n\t }\n\t }\n\t /* Update opt_len to include the bit length tree and counts */\n\t s.opt_len += 3*(max_blindex+1) + 5+5+4;\n\t //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t // s->opt_len, s->static_len));\n\n\t return max_blindex;\n\t}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}","function build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}"],"string":"[\n \"function build_bl_tree() {\\n\\t\\tvar max_blindex; // index of last bit length code of non zero freq\\n\\n\\t\\t// Determine the bit length frequencies for literal and distance trees\\n\\t\\tscan_tree(dyn_ltree, l_desc.max_code);\\n\\t\\tscan_tree(dyn_dtree, d_desc.max_code);\\n\\n\\t\\t// Build the bit length tree:\\n\\t\\tbuild_tree(bl_desc);\\n\\t\\t// opt_len now includes the length of the tree representations, except\\n\\t\\t// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\n\\t\\t// Determine the number of bit length codes to send. The pkzip format\\n\\t\\t// requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t\\t// 3 but the actual value used is 4.)\\n\\t\\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t\\t\\tif (bl_tree[bl_order[max_blindex]].dl !== 0) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Update opt_len to include the bit length tree and counts */\\n\\t\\topt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t\\t// Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\n\\t\\treturn max_blindex;\\n\\t}\",\n \"function build_bl_tree() {\\n\\t\\t var max_blindex; // index of last bit length code of non zero freq\\n\\t\\t // Determine the bit length frequencies for literal and distance trees\\n \\n\\t\\t scan_tree(dyn_ltree, l_desc.max_code);\\n\\t\\t scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree:\\n \\n\\t\\t bl_desc.build_tree(that); // opt_len now includes the length of the tree representations, except\\n\\t\\t // the lengths of the bit lengths codes and the 5+5+4 bits for the\\n\\t\\t // counts.\\n\\t\\t // Determine the number of bit length codes to send. The pkzip format\\n\\t\\t // requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t\\t // 3 but the actual value used is 4.)\\n \\n\\t\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t\\t\\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break;\\n\\t\\t } // Update opt_len to include the bit length tree and counts\\n \\n \\n\\t\\t that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t\\t return max_blindex;\\n\\t\\t} // Output a byte on the stream.\",\n \"function build_bl_tree(s){var max_blindex;/* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */scan_tree(s,s.dyn_ltree,s.l_desc.max_code);scan_tree(s,s.dyn_dtree,s.d_desc.max_code);/* Build the bit length tree: */build_tree(s,s.bl_desc);/* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */ /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */for(max_blindex=BL_CODES-1;max_blindex>=3;max_blindex--){if(s.bl_tree[bl_order[max_blindex]*2+1]/*.Len*/!==0){break;}}/* Update opt_len to include the bit length tree and counts */s.opt_len+=3*(max_blindex+1)+5+5+4;//Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n return max_blindex;}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\t\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\t\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\t\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\t\\n\\t return max_blindex;\\n\\t }\",\n \"function build_bl_tree(s) {\\n var max_blindex;\\n /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n /* Build the bit length tree: */\\n\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\\n /*.Len*/\\n !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n\\n\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n }\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n \\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n \\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n \\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n \\n return max_blindex;\\n }\",\n \"function build_bl_tree(s) {\\n var max_blindex;\\n /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n /* Build the bit length tree: */\\n\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\\n /*.Len*/\\n !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n\\n\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n var max_blindex;\\n /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n /* Build the bit length tree: */\\n\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]\\n /*.Len*/\\n !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n\\n\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n }\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex] * 2 + 1] /*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3*(max_blindex+1) + 5+5+4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n\\t var max_blindex; /* index of last bit length code of non zero freq */\\n\\n\\t /* Determine the bit length frequencies for literal and distance trees */\\n\\t scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n\\t scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n\\t /* Build the bit length tree: */\\n\\t build_tree(s, s.bl_desc);\\n\\t /* opt_len now includes the length of the tree representations, except\\n\\t * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\t */\\n\\n\\t /* Determine the number of bit length codes to send. The pkzip format\\n\\t * requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t * 3 but the actual value used is 4.)\\n\\t */\\n\\t for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {\\n\\t if (s.bl_tree[bl_order[max_blindex]*2 + 1]/*.Len*/ !== 0) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t /* Update opt_len to include the bit length tree and counts */\\n\\t s.opt_len += 3*(max_blindex+1) + 5+5+4;\\n\\t //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t // s->opt_len, s->static_len));\\n\\n\\t return max_blindex;\\n\\t}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\",\n \"function build_bl_tree(s) {\\n var max_blindex; /* index of last bit length code of non zero freq */\\n\\n /* Determine the bit length frequencies for literal and distance trees */\\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\\n\\n /* Build the bit length tree: */\\n build_tree(s, s.bl_desc);\\n /* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */\\n\\n /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */\\n for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\\n break;\\n }\\n }\\n /* Update opt_len to include the bit length tree and counts */\\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n //Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n\\n return max_blindex;\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7984391","0.79464096","0.73637545","0.7298226","0.7285736","0.7285724","0.724746","0.7231646","0.7228964","0.7219668","0.7219668","0.7219668","0.7219668","0.7219668","0.7218879","0.7215603","0.7215603","0.7182199","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828","0.7176828"],"string":"[\n \"0.7984391\",\n \"0.79464096\",\n \"0.73637545\",\n \"0.7298226\",\n \"0.7285736\",\n \"0.7285724\",\n \"0.724746\",\n \"0.7231646\",\n \"0.7228964\",\n \"0.7219668\",\n \"0.7219668\",\n \"0.7219668\",\n \"0.7219668\",\n \"0.7219668\",\n \"0.7218879\",\n \"0.7215603\",\n \"0.7215603\",\n \"0.7182199\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\",\n \"0.7176828\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81756,"cells":{"query":{"kind":"string","value":"=========================================================================== Send the header for a block using dynamic Huffman trees: the counts, the lengths of the bit length codes, the literal tree and the distance tree. IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4."},"document":{"kind":"string","value":"function send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes-1, 5);\n send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank]*2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes-1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes-1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function build_bl_tree() {\n\t\t var max_blindex; // index of last bit length code of non zero freq\n\t\t // Determine the bit length frequencies for literal and distance trees\n \n\t\t scan_tree(dyn_ltree, l_desc.max_code);\n\t\t scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree:\n \n\t\t bl_desc.build_tree(that); // opt_len now includes the length of the tree representations, except\n\t\t // the lengths of the bit lengths codes and the 5+5+4 bits for the\n\t\t // counts.\n\t\t // Determine the number of bit length codes to send. The pkzip format\n\t\t // requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t // 3 but the actual value used is 4.)\n \n\t\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break;\n\t\t } // Update opt_len to include the bit length tree and counts\n \n \n\t\t that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t\t return max_blindex;\n\t\t} // Output a byte on the stream.","function build_bl_tree() {\n\t\tvar max_blindex; // index of last bit length code of non zero freq\n\n\t\t// Determine the bit length frequencies for literal and distance trees\n\t\tscan_tree(dyn_ltree, l_desc.max_code);\n\t\tscan_tree(dyn_dtree, d_desc.max_code);\n\n\t\t// Build the bit length tree:\n\t\tbuild_tree(bl_desc);\n\t\t// opt_len now includes the length of the tree representations, except\n\t\t// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n\n\t\t// Determine the number of bit length codes to send. The pkzip format\n\t\t// requires that at least 4 bit length codes be sent. (appnote.txt says\n\t\t// 3 but the actual value used is 4.)\n\t\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n\t\t\tif (bl_tree[bl_order[max_blindex]].dl !== 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// Update opt_len to include the bit length tree and counts */\n\t\topt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n\t\t// Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\n\t\treturn max_blindex;\n\t}","static initHuffmanTree() {\n let i = 0;\n while (i < 144) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x030 + i) << 8);\n ARR_LITERAL_LENGTHS[i++] = 8;\n }\n while (i < 256) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x190 - 144 + i) << 7);\n ARR_LITERAL_LENGTHS[i++] = 9;\n }\n while (i < 280) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x000 - 256 + i) << 9);\n ARR_LITERAL_LENGTHS[i++] = 7;\n }\n while (i < 286) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x0c0 - 280 + i) << 8);\n ARR_LITERAL_LENGTHS[i++] = 8;\n }\n for (i = 0; i < 30; i++) {\n ARR_DISTANCE_CODES[i] = CompressorHuffmanTree.bitReverse(i << 11);\n ARR_DISTANCE_LENGTHS[i] = 5;\n }\n }","function $AvaN$var$_tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === $AvaN$var$Z_UNKNOWN) {\n s.strm.data_type = $AvaN$var$detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n $AvaN$var$build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n $AvaN$var$build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = $AvaN$var$build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n $AvaN$var$_tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === $AvaN$var$Z_FIXED || static_lenb === opt_lenb) {\n $AvaN$var$send_bits(s, ($AvaN$var$STATIC_TREES << 1) + (last ? 1 : 0), 3);\n $AvaN$var$compress_block(s, $AvaN$var$static_ltree, $AvaN$var$static_dtree);\n } else {\n $AvaN$var$send_bits(s, ($AvaN$var$DYN_TREES << 1) + (last ? 1 : 0), 3);\n $AvaN$var$send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n $AvaN$var$compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n $AvaN$var$init_block(s);\n\n if (last) {\n $AvaN$var$bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n}","function HuffmanTreeGroup(alphabet_size, num_htrees) {\n this.alphabet_size = alphabet_size;\n this.num_htrees = num_htrees;\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \n this.htrees = new Uint32Array(num_htrees);\n}","function HuffmanTreeGroup(alphabet_size, num_htrees) {\n this.alphabet_size = alphabet_size;\n this.num_htrees = num_htrees;\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \n this.htrees = new Uint32Array(num_htrees);\n}","function HuffmanTreeGroup(alphabet_size, num_htrees) {\n this.alphabet_size = alphabet_size;\n this.num_htrees = num_htrees;\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \n this.htrees = new Uint32Array(num_htrees);\n}","function HuffmanTreeGroup(alphabet_size, num_htrees) {\n this.alphabet_size = alphabet_size;\n this.num_htrees = num_htrees;\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \n this.htrees = new Uint32Array(num_htrees);\n}","function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n init_block(s);\n\n if (last) {\n bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n}","function HuffmanTreeGroup(alphabet_size, num_htrees) {\n this.alphabet_size = alphabet_size;\n this.num_htrees = num_htrees;\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]);\n this.htrees = new Uint32Array(num_htrees);\n}","function BuildHuffmanTable(root_table,root_table_off,\n root_bits,\n code_lengths,code_lengths_off,\n code_lengths_size,\n count,count_off) {\n var code=new HuffmanCode(); /* current table entry */\n var table=new Array(new HuffmanCode());//* /* next available space in table */\n var table_off=0;\n var len; /* current code length */\n var symbol; /* symbol index in original or sorted table */\n var key; /* reversed prefix code */\n var step; /* step size to replicate values in current table */\n var low; /* low bits for current root entry */\n var mask; /* mask for low bits */\n var table_bits; /* key length of current table */\n var table_size; /* size of current table */\n var total_size; /* sum of root table size and 2nd level table sizes */\n /* symbols sorted by code length */\n var sorted=new mallocArr(code_lengths_size,0);\n /* offsets in sorted table for each length */\n var offset=new mallocArr(kHuffmanMaxLength + 1,0);\n var max_length = 1;\n\n /* generate offsets into sorted symbol table by code length */\n {\n var sum = 0;\n for (len = 1; len <= kHuffmanMaxLength; len++) {\n offset[len] = sum;\n if (count[len]) {\n sum = (sum + count[len]);\n max_length = len;\n }\n }\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (symbol = 0; symbol < code_lengths_size; symbol++) {\n if (code_lengths[symbol] != 0) {\n sorted[offset[code_lengths[symbol]]++] = symbol;\n }\n }\n\n table = root_table;\n table_off = root_table_off;\n table_bits = root_bits;\n table_size = 1 << table_bits;\n total_size = table_size;\n\n /* special case code with only one value */\n if (offset[kHuffmanMaxLength] == 1) {\n code.bits = 0;\n code.value = (sorted[0]);\n for (key = 0; key < total_size; ++key) {\n table[table_off+key] = code;\n }\n return total_size;\n }\n\n /* fill in root table */\n /* let's reduce the table size to a smaller size if possible, and */\n /* create the repetitions by memcpy if possible in the coming loop */\n if (table_bits > max_length) {\n table_bits = max_length;\n table_size = 1 << table_bits;\n }\n key = 0;\n symbol = 0;\n code.bits = 1;\n step = 2;\n do {\n for (; count[code.bits] != 0; --count[code.bits]) {\n code.value = (sorted[symbol++]);\n ReplicateValue(table,table_off+key, step, table_size, code);\n key = GetNextKey(key, code.bits);\n }\n step <<= 1;\n } while (++code.bits <= table_bits);\n\n /* if root_bits != table_bits we only created one fraction of the */\n /* table, and we need to replicate it now. */\n while (total_size != table_size) {\n //memcpy(&table[table_size], &table[0], table_size * sizeof(table[0]));\n\tfor(var i=0;i> root_bits), step, table_size, code);\n key = GetNextKey(key, len);\n }\n }\n\n return total_size;\n}","function build_bl_tree(s){var max_blindex;/* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */scan_tree(s,s.dyn_ltree,s.l_desc.max_code);scan_tree(s,s.dyn_dtree,s.d_desc.max_code);/* Build the bit length tree: */build_tree(s,s.bl_desc);/* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */ /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */for(max_blindex=BL_CODES-1;max_blindex>=3;max_blindex--){if(s.bl_tree[bl_order[max_blindex]*2+1]/*.Len*/!==0){break;}}/* Update opt_len to include the bit length tree and counts */s.opt_len+=3*(max_blindex+1)+5+5+4;//Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n return max_blindex;}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n let max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb; \n }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN$1) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}"],"string":"[\n \"function build_bl_tree() {\\n\\t\\t var max_blindex; // index of last bit length code of non zero freq\\n\\t\\t // Determine the bit length frequencies for literal and distance trees\\n \\n\\t\\t scan_tree(dyn_ltree, l_desc.max_code);\\n\\t\\t scan_tree(dyn_dtree, d_desc.max_code); // Build the bit length tree:\\n \\n\\t\\t bl_desc.build_tree(that); // opt_len now includes the length of the tree representations, except\\n\\t\\t // the lengths of the bit lengths codes and the 5+5+4 bits for the\\n\\t\\t // counts.\\n\\t\\t // Determine the number of bit length codes to send. The pkzip format\\n\\t\\t // requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t\\t // 3 but the actual value used is 4.)\\n \\n\\t\\t for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t\\t\\tif (bl_tree[Tree.bl_order[max_blindex] * 2 + 1] !== 0) break;\\n\\t\\t } // Update opt_len to include the bit length tree and counts\\n \\n \\n\\t\\t that.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t\\t return max_blindex;\\n\\t\\t} // Output a byte on the stream.\",\n \"function build_bl_tree() {\\n\\t\\tvar max_blindex; // index of last bit length code of non zero freq\\n\\n\\t\\t// Determine the bit length frequencies for literal and distance trees\\n\\t\\tscan_tree(dyn_ltree, l_desc.max_code);\\n\\t\\tscan_tree(dyn_dtree, d_desc.max_code);\\n\\n\\t\\t// Build the bit length tree:\\n\\t\\tbuild_tree(bl_desc);\\n\\t\\t// opt_len now includes the length of the tree representations, except\\n\\t\\t// the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n\\n\\t\\t// Determine the number of bit length codes to send. The pkzip format\\n\\t\\t// requires that at least 4 bit length codes be sent. (appnote.txt says\\n\\t\\t// 3 but the actual value used is 4.)\\n\\t\\tfor (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\\n\\t\\t\\tif (bl_tree[bl_order[max_blindex]].dl !== 0) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Update opt_len to include the bit length tree and counts */\\n\\t\\topt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\\n\\t\\t// Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\n\\t\\treturn max_blindex;\\n\\t}\",\n \"static initHuffmanTree() {\\n let i = 0;\\n while (i < 144) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x030 + i) << 8);\\n ARR_LITERAL_LENGTHS[i++] = 8;\\n }\\n while (i < 256) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x190 - 144 + i) << 7);\\n ARR_LITERAL_LENGTHS[i++] = 9;\\n }\\n while (i < 280) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x000 - 256 + i) << 9);\\n ARR_LITERAL_LENGTHS[i++] = 7;\\n }\\n while (i < 286) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x0c0 - 280 + i) << 8);\\n ARR_LITERAL_LENGTHS[i++] = 8;\\n }\\n for (i = 0; i < 30; i++) {\\n ARR_DISTANCE_CODES[i] = CompressorHuffmanTree.bitReverse(i << 11);\\n ARR_DISTANCE_LENGTHS[i] = 5;\\n }\\n }\",\n \"function $AvaN$var$_tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb;\\n /* opt_len and static_len in bytes */\\n\\n var max_blindex = 0;\\n /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n\\n if (s.level > 0) {\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === $AvaN$var$Z_UNKNOWN) {\\n s.strm.data_type = $AvaN$var$detect_data_type(s);\\n }\\n /* Construct the literal and distance trees */\\n\\n\\n $AvaN$var$build_tree(s, s.l_desc); // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n $AvaN$var$build_tree(s, s.d_desc); // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n\\n max_blindex = $AvaN$var$build_bl_tree(s);\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5;\\n /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n $AvaN$var$_tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === $AvaN$var$Z_FIXED || static_lenb === opt_lenb) {\\n $AvaN$var$send_bits(s, ($AvaN$var$STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n $AvaN$var$compress_block(s, $AvaN$var$static_ltree, $AvaN$var$static_dtree);\\n } else {\\n $AvaN$var$send_bits(s, ($AvaN$var$DYN_TREES << 1) + (last ? 1 : 0), 3);\\n $AvaN$var$send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n $AvaN$var$compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n } // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n\\n\\n $AvaN$var$init_block(s);\\n\\n if (last) {\\n $AvaN$var$bi_windup(s);\\n } // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n\\n}\",\n \"function HuffmanTreeGroup(alphabet_size, num_htrees) {\\n this.alphabet_size = alphabet_size;\\n this.num_htrees = num_htrees;\\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \\n this.htrees = new Uint32Array(num_htrees);\\n}\",\n \"function HuffmanTreeGroup(alphabet_size, num_htrees) {\\n this.alphabet_size = alphabet_size;\\n this.num_htrees = num_htrees;\\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \\n this.htrees = new Uint32Array(num_htrees);\\n}\",\n \"function HuffmanTreeGroup(alphabet_size, num_htrees) {\\n this.alphabet_size = alphabet_size;\\n this.num_htrees = num_htrees;\\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \\n this.htrees = new Uint32Array(num_htrees);\\n}\",\n \"function HuffmanTreeGroup(alphabet_size, num_htrees) {\\n this.alphabet_size = alphabet_size;\\n this.num_htrees = num_htrees;\\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]); \\n this.htrees = new Uint32Array(num_htrees);\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb;\\n /* opt_len and static_len in bytes */\\n\\n var max_blindex = 0;\\n /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n\\n if (s.level > 0) {\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n /* Construct the literal and distance trees */\\n\\n\\n build_tree(s, s.l_desc); // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc); // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n\\n max_blindex = build_bl_tree(s);\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5;\\n /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n } // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n\\n\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n } // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n\\n}\",\n \"function HuffmanTreeGroup(alphabet_size, num_htrees) {\\n this.alphabet_size = alphabet_size;\\n this.num_htrees = num_htrees;\\n this.codes = new Array(num_htrees + num_htrees * kMaxHuffmanTableSize[(alphabet_size + 31) >>> 5]);\\n this.htrees = new Uint32Array(num_htrees);\\n}\",\n \"function BuildHuffmanTable(root_table,root_table_off,\\n root_bits,\\n code_lengths,code_lengths_off,\\n code_lengths_size,\\n count,count_off) {\\n var code=new HuffmanCode(); /* current table entry */\\n var table=new Array(new HuffmanCode());//* /* next available space in table */\\n var table_off=0;\\n var len; /* current code length */\\n var symbol; /* symbol index in original or sorted table */\\n var key; /* reversed prefix code */\\n var step; /* step size to replicate values in current table */\\n var low; /* low bits for current root entry */\\n var mask; /* mask for low bits */\\n var table_bits; /* key length of current table */\\n var table_size; /* size of current table */\\n var total_size; /* sum of root table size and 2nd level table sizes */\\n /* symbols sorted by code length */\\n var sorted=new mallocArr(code_lengths_size,0);\\n /* offsets in sorted table for each length */\\n var offset=new mallocArr(kHuffmanMaxLength + 1,0);\\n var max_length = 1;\\n\\n /* generate offsets into sorted symbol table by code length */\\n {\\n var sum = 0;\\n for (len = 1; len <= kHuffmanMaxLength; len++) {\\n offset[len] = sum;\\n if (count[len]) {\\n sum = (sum + count[len]);\\n max_length = len;\\n }\\n }\\n }\\n\\n /* sort symbols by length, by symbol order within each length */\\n for (symbol = 0; symbol < code_lengths_size; symbol++) {\\n if (code_lengths[symbol] != 0) {\\n sorted[offset[code_lengths[symbol]]++] = symbol;\\n }\\n }\\n\\n table = root_table;\\n table_off = root_table_off;\\n table_bits = root_bits;\\n table_size = 1 << table_bits;\\n total_size = table_size;\\n\\n /* special case code with only one value */\\n if (offset[kHuffmanMaxLength] == 1) {\\n code.bits = 0;\\n code.value = (sorted[0]);\\n for (key = 0; key < total_size; ++key) {\\n table[table_off+key] = code;\\n }\\n return total_size;\\n }\\n\\n /* fill in root table */\\n /* let's reduce the table size to a smaller size if possible, and */\\n /* create the repetitions by memcpy if possible in the coming loop */\\n if (table_bits > max_length) {\\n table_bits = max_length;\\n table_size = 1 << table_bits;\\n }\\n key = 0;\\n symbol = 0;\\n code.bits = 1;\\n step = 2;\\n do {\\n for (; count[code.bits] != 0; --count[code.bits]) {\\n code.value = (sorted[symbol++]);\\n ReplicateValue(table,table_off+key, step, table_size, code);\\n key = GetNextKey(key, code.bits);\\n }\\n step <<= 1;\\n } while (++code.bits <= table_bits);\\n\\n /* if root_bits != table_bits we only created one fraction of the */\\n /* table, and we need to replicate it now. */\\n while (total_size != table_size) {\\n //memcpy(&table[table_size], &table[0], table_size * sizeof(table[0]));\\n\\tfor(var i=0;i> root_bits), step, table_size, code);\\n key = GetNextKey(key, len);\\n }\\n }\\n\\n return total_size;\\n}\",\n \"function build_bl_tree(s){var max_blindex;/* index of last bit length code of non zero freq */ /* Determine the bit length frequencies for literal and distance trees */scan_tree(s,s.dyn_ltree,s.l_desc.max_code);scan_tree(s,s.dyn_dtree,s.d_desc.max_code);/* Build the bit length tree: */build_tree(s,s.bl_desc);/* opt_len now includes the length of the tree representations, except\\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\\n */ /* Determine the number of bit length codes to send. The pkzip format\\n * requires that at least 4 bit length codes be sent. (appnote.txt says\\n * 3 but the actual value used is 4.)\\n */for(max_blindex=BL_CODES-1;max_blindex>=3;max_blindex--){if(s.bl_tree[bl_order[max_blindex]*2+1]/*.Len*/!==0){break;}}/* Update opt_len to include the bit length tree and counts */s.opt_len+=3*(max_blindex+1)+5+5+4;//Tracev((stderr, \\\"\\\\ndyn trees: dyn %ld, stat %ld\\\",\\n // s->opt_len, s->static_len));\\n return max_blindex;}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n let max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb; \\n }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN$1) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len+3+7) >>> 3;\\n static_lenb = (s.static_len+3+7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.605133","0.58291775","0.5769802","0.5747375","0.56533957","0.56533957","0.56533957","0.56533957","0.5626713","0.55912226","0.55687624","0.556751","0.55406004","0.55307066","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55298615","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923","0.55249923"],"string":"[\n \"0.605133\",\n \"0.58291775\",\n \"0.5769802\",\n \"0.5747375\",\n \"0.56533957\",\n \"0.56533957\",\n \"0.56533957\",\n \"0.56533957\",\n \"0.5626713\",\n \"0.55912226\",\n \"0.55687624\",\n \"0.556751\",\n \"0.55406004\",\n \"0.55307066\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55298615\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\",\n \"0.55249923\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81757,"cells":{"query":{"kind":"string","value":"=========================================================================== Initialize the tree data structures for a new zlib stream."},"document":{"kind":"string","value":"function _tr_init(s)\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["_init() {\n this.__lookupTable = new qx.data.Array();\n this.__openNodes = [];\n this.__nestingLevel = [];\n this._initLayer();\n }","function _tr_init(s){if(!static_init_done){tr_static_init();static_init_done=true;}s.l_desc=new TreeDesc(s.dyn_ltree,static_l_desc);s.d_desc=new TreeDesc(s.dyn_dtree,static_d_desc);s.bl_desc=new TreeDesc(s.bl_tree,static_bl_desc);s.bi_buf=0;s.bi_valid=0;/* Initialize the first block of the first file: */init_block(s);}","constructor() {\n this._tree=new NaryTree();\n }","buildTree() {\n\t\tthis.assignLevel(this.nodesList[0], 0);\n\t\tthis.positionMap = new Map();\n\t\tthis.assignPosition(this.nodesList[0], 0);\n\t}","function treeInit() {\n tree = new YAHOO.widget.TreeView(\"en_tree\");\n // Caricamento dinamico dei dati \n tree.setDynamicLoad(loadDataForNode);\n\n var root = tree.getRoot();\n var baseLabel = baseRoot.replace(/.*\\//, \"\");\n var tmpNode = new YAHOO.widget.TextNode({ label: baseLabel, fqFileName: baseRoot, type: \"dir\" }, root, false);\n oTextNodeMap[tmpNode.labelElId] = tmpNode;\n tree.render();\n}","static initHuffmanTree() {\n let i = 0;\n while (i < 144) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x030 + i) << 8);\n ARR_LITERAL_LENGTHS[i++] = 8;\n }\n while (i < 256) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x190 - 144 + i) << 7);\n ARR_LITERAL_LENGTHS[i++] = 9;\n }\n while (i < 280) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x000 - 256 + i) << 9);\n ARR_LITERAL_LENGTHS[i++] = 7;\n }\n while (i < 286) {\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x0c0 - 280 + i) << 8);\n ARR_LITERAL_LENGTHS[i++] = 8;\n }\n for (i = 0; i < 30; i++) {\n ARR_DISTANCE_CODES[i] = CompressorHuffmanTree.bitReverse(i << 11);\n ARR_DISTANCE_LENGTHS[i] = 5;\n }\n }","function _tr_init(s) {\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}","function _tr_init(s)\n {\n \n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n \n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n \n s.bi_buf = 0;\n s.bi_valid = 0;\n \n /* Initialize the first block of the first file: */\n init_block(s);\n }","function _tr_init(s) {\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n s.bi_buf = 0;\n s.bi_valid = 0;\n /* Initialize the first block of the first file: */\n\n init_block(s);\n}","function _tr_init(s) {\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}","function _tr_init(s) {\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n s.bi_buf = 0;\n s.bi_valid = 0;\n /* Initialize the first block of the first file: */\n\n init_block(s);\n }","function _tr_init(s) {\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n s.bi_buf = 0;\n s.bi_valid = 0;\n /* Initialize the first block of the first file: */\n\n init_block(s);\n }"],"string":"[\n \"_init() {\\n this.__lookupTable = new qx.data.Array();\\n this.__openNodes = [];\\n this.__nestingLevel = [];\\n this._initLayer();\\n }\",\n \"function _tr_init(s){if(!static_init_done){tr_static_init();static_init_done=true;}s.l_desc=new TreeDesc(s.dyn_ltree,static_l_desc);s.d_desc=new TreeDesc(s.dyn_dtree,static_d_desc);s.bl_desc=new TreeDesc(s.bl_tree,static_bl_desc);s.bi_buf=0;s.bi_valid=0;/* Initialize the first block of the first file: */init_block(s);}\",\n \"constructor() {\\n this._tree=new NaryTree();\\n }\",\n \"buildTree() {\\n\\t\\tthis.assignLevel(this.nodesList[0], 0);\\n\\t\\tthis.positionMap = new Map();\\n\\t\\tthis.assignPosition(this.nodesList[0], 0);\\n\\t}\",\n \"function treeInit() {\\n tree = new YAHOO.widget.TreeView(\\\"en_tree\\\");\\n // Caricamento dinamico dei dati \\n tree.setDynamicLoad(loadDataForNode);\\n\\n var root = tree.getRoot();\\n var baseLabel = baseRoot.replace(/.*\\\\//, \\\"\\\");\\n var tmpNode = new YAHOO.widget.TextNode({ label: baseLabel, fqFileName: baseRoot, type: \\\"dir\\\" }, root, false);\\n oTextNodeMap[tmpNode.labelElId] = tmpNode;\\n tree.render();\\n}\",\n \"static initHuffmanTree() {\\n let i = 0;\\n while (i < 144) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x030 + i) << 8);\\n ARR_LITERAL_LENGTHS[i++] = 8;\\n }\\n while (i < 256) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x190 - 144 + i) << 7);\\n ARR_LITERAL_LENGTHS[i++] = 9;\\n }\\n while (i < 280) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x000 - 256 + i) << 9);\\n ARR_LITERAL_LENGTHS[i++] = 7;\\n }\\n while (i < 286) {\\n ARR_LITERAL_CODES[i] = CompressorHuffmanTree.bitReverse((0x0c0 - 280 + i) << 8);\\n ARR_LITERAL_LENGTHS[i++] = 8;\\n }\\n for (i = 0; i < 30; i++) {\\n ARR_DISTANCE_CODES[i] = CompressorHuffmanTree.bitReverse(i << 11);\\n ARR_DISTANCE_LENGTHS[i] = 5;\\n }\\n }\",\n \"function _tr_init(s) {\\n\\n if (!static_init_done) {\\n tr_static_init();\\n static_init_done = true;\\n }\\n\\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\\n\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n /* Initialize the first block of the first file: */\\n init_block(s);\\n}\",\n \"function _tr_init(s)\\n {\\n \\n if (!static_init_done) {\\n tr_static_init();\\n static_init_done = true;\\n }\\n \\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\\n \\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n \\n /* Initialize the first block of the first file: */\\n init_block(s);\\n }\",\n \"function _tr_init(s) {\\n if (!static_init_done) {\\n tr_static_init();\\n static_init_done = true;\\n }\\n\\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n /* Initialize the first block of the first file: */\\n\\n init_block(s);\\n}\",\n \"function _tr_init(s) {\\n\\n if (!static_init_done) {\\n tr_static_init();\\n static_init_done = true;\\n }\\n\\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\\n\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n /* Initialize the first block of the first file: */\\n init_block(s);\\n}\",\n \"function _tr_init(s) {\\n if (!static_init_done) {\\n tr_static_init();\\n static_init_done = true;\\n }\\n\\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n /* Initialize the first block of the first file: */\\n\\n init_block(s);\\n }\",\n \"function _tr_init(s) {\\n if (!static_init_done) {\\n tr_static_init();\\n static_init_done = true;\\n }\\n\\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n /* Initialize the first block of the first file: */\\n\\n init_block(s);\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.6510822","0.6424953","0.6375535","0.63501585","0.6259595","0.6178484","0.6144798","0.61362624","0.6128932","0.60982025","0.6096389","0.60900533"],"string":"[\n \"0.6510822\",\n \"0.6424953\",\n \"0.6375535\",\n \"0.63501585\",\n \"0.6259595\",\n \"0.6178484\",\n \"0.6144798\",\n \"0.61362624\",\n \"0.6128932\",\n \"0.60982025\",\n \"0.6096389\",\n \"0.60900533\"\n]"},"document_score":{"kind":"string","value":"0.61420107"},"document_rank":{"kind":"string","value":"90"}}},{"rowIdx":81758,"cells":{"query":{"kind":"string","value":"=========================================================================== Send a stored block"},"document":{"kind":"string","value":"function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK<<1)+(last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["messageSent (peerId, block) {\n const ledger = this._findOrCreate(peerId)\n ledger.sentBytes(block ? block.data.length : 0)\n if (block && block.cid) {\n ledger.wantlist.remove(block.cid)\n }\n }","messageSent (peerId, block) {\n const ledger = this._findOrCreate(peerId)\n ledger.sentBytes(block ? block.data.length : 0)\n if (block && block.cid) {\n ledger.wantlist.remove(block.cid)\n }\n }","static mineBlock ( payload ){\n console.log(`Mining Block`)\n return new Promise((resolve, reject) => {\n let hash;\n let lastBlock = DB.transactionLastBlock();\n //payload.id = uuid();\n do {\n payload.created_at = Date.now()\n payload.nonce = CRPYTO.randomBytes(16).toString('base64');\n payload.difficulty = Block.adjustDifficulty(payload, lastBlock);\n //console.log('DIFFICULTY: ', payload.difficulty)\n payload.lastHash = lastBlock.hash\n hash = CryptUtil.hash(payload, payload.difficulty, payload.nonce);\n }while( HexToBin(hash).substr(0, payload.difficulty) !== '0'.repeat(payload.difficulty))\n let block = {\n payload : payload,\n hash\n }\n //Broadcast the new block\n global.node.broadcast.write(JSON.stringify({channel:'block', payload:block}))\n resolve(DB.transactionPutBlock(block));\n })\n \n \n }","postNewBlock() {\n let self = this;\n this.app.post(\"/api/block\", (req, res) => {\n let blockData = req.body.data;\n let block = new Block.Block(blockData);\n self.myBlockChain.addBlock(block)\n .then((block) => {\n res.send(block)\n })\n .catch((err) => {\n res.send(\"Error creating block: \" + err);\n })\n });\n }","postNewBlock() {\n this.server.route({\n method: 'POST',\n path: '/block',\n handler: (request, h) => {\n return new Promise ((resolve,reject)=>{\n var ctype = request.headers[\"content-type\"];\n if (!ctype || ctype.indexOf(\"application/json\") !== 0) {\n reject (Boom.badRequest(\"Wrong content-type. Required \\\"application/json\\\"\"));\n }\n const blockdata = request.payload.body;\n if (typeof blockdata === \"undefined\" || !blockdata || blockdata.trim().length === 0) { \n reject(Boom.badRequest(\"Bad Request expecting {\\\"data\\\":\\\"block body\\\"}\"));\n } else {\n this.blockChain.addBlock(new BlockClass.Block(blockdata)).then ((newblock)=>{\n resolve (JSON.stringify(newblock));\n });\n }\n });\n }\n });\n }","async storageBlock(newBlock) {\n await this.m_chainDB.BeginTranscation();\n let newHeaders = newBlock.toHeaders();\n\n let headerHash = newHeaders.hash('hex');\n let blockHash = newBlock.hash('hex');\n \n if (newHeaders.height === this.m_headerChain.getNowHeight() + 1) {\n await this.m_headerChain.addHeader(newHeaders);\n }\n await this.m_chainDB.CommitTranscation();\n\n this.m_blockStorage.add(newBlock);\n }","async function blxSendBinblock (data, fname, syncflag, mem_addr) {\n let txlen_total = data.length\n let tx_pos = 0\n const time0 = Date.now() - 1000\n let tw_old = time0\n let tw_new // Working Time fuer Fortschritt\n let sblk_len = (max_ble_blocklen - 2) & 0xFFFC // Initial MAX Size Block, but Multi of 4\n\n if (data.length > 1000) { // Mehr als 1k Daten UND File: -> FAST\n\n if(fname === undefined){\n // Might bee too fast for Download to CPU Memory, set to slow with .cf 15 or greater!!!\n if(con_memfast_speed < 15)\n terminalPrint(\"*** WARNING: Memory Connection Speed: \" + con_memfast_speed ) \n const os = con_fast_speed // temporaer mit MEMORY Speed\n con_fast_speed = con_memfast_speed\n await blxConnectionFast()\n con_fast_speed = os\n }else{\n await blxConnectionFast()\n } \n if (blxErrMsg) return\n // console.log(\"Fast OK\");\n }\n if(fname!== undefined) await blxDeviceCmd('P' + (syncflag ? '!' : '') + ':' + fname, 5000) // P wie PUT\n else {\n {\n let wadr = mem_addr\n let wsize = txlen_total\n const sector_size = 4096 // Fix fuer nrF52\n // Sektoren in einzeln Loeschen, da langsam\n while(wsize>0){\n await blxDeviceCmd('K:' + wadr + ' ' + 1 , 5000) \n if (blxErrMsg) return\n wadr+=sector_size\n wsize-=sector_size\n }\n }\n await blxDeviceCmd('I:' + mem_addr, 5000) // I wie Internal\n }\n if (blxErrMsg) return\n\n try {\n for (;;) {\n let blen = txlen_total // Blocklen\n if (blen > sblk_len ) blen = sblk_len\n const bdata = new Uint8Array(blen + 2)\n bdata[0] = blen\n bdata[1] = BB_BLE_BINBLK_IN // Binary Data\n // Aufgabe: data[tx_pos] an bdata[2] kopieren\n const datablock = data.subarray(tx_pos, tx_pos + blen)\n bdata.set(datablock, 2) // Copies datablock into bdata\n\n await NUS_data_chara_write.writeValue(bdata.buffer)\n\n // console.log(bdata);\n txlen_total -= blen\n tx_pos += blen\n if (!txlen_total) {\n const dtime = Date.now() - time0\n terminalPrint('Transfer OK (' + dtime / 1000 + ' sec, ' + ((data.length / dtime * 1000).toFixed(0)) + ' Bytes/sec)')\n break\n }\n tw_new = Date.now()\n if (tw_new - tw_old > 1000) { // Alle Sekunde Fortschritt\n tw_old = tw_new\n terminalPrint(((tx_pos * 100) / data.length).toFixed(0) + '% / ' + tx_pos + ' Bytes')\n }\n }\n } catch (error) {\n if (full_connected_flag === false) blxErrMsg = 'ERROR: Connection lost'\n else blxErrMsg = 'ERROR: Transfer ' + error\n return\n }\n\n await blxDeviceCmd('L', 5000) // Close\n\n if (blxErrMsg) return\n if (data.length > 1000) { // Mehr als 1k Daten: -> Wieder SLOW\n await blxConnectionSlow()\n }\n }","function copy_block(buf, // the input data\n\t\tlen, // its length\n\t\theader // true if block header must be written\n\t\t) {\n\t\t bi_windup(); // align on byte boundary\n \n\t\t last_eob_len = 8; // enough lookahead for inflate\n \n\t\t if (header) {\n\t\t\tput_short(len);\n\t\t\tput_short(~len);\n\t\t }\n \n\t\t that.pending_buf.set(window.subarray(buf, buf + len), that.pending);\n\t\t that.pending += len;\n\t\t} // Send a stored block","postNewBlock() {\n this.server.route({\n method: 'POST',\n path: '/api/block',\n handler: (request, h) => {\n return new Promise ((resolve,reject)=>{\n var ctype = request.headers[\"content-type\"];\n if (!ctype || ctype.indexOf(\"application/json\") !== 0) {\n reject (Boom.badRequest(\"Wrong content-type. Required \\\"application/json\\\"\"));\n }\n const blockdata = request.payload.body;\n if (typeof blockdata === \"undefined\" || !blockdata || blockdata.trim().length === 0) { \n reject(Boom.badRequest(\"Bad Request expecting {\\\"data\\\":\\\"block body\\\"}\"));\n } else {\n this.blockChain.addBlock(new BlockClass.Block(blockdata)).then ((newblock)=>{\n resolve (newblock);\n });\n }\n });\n }\n });\n }","messageSent (peerId, msg) {\n const ledger = this._findOrCreate(peerId)\n for (let block of msg.blocks.values()) {\n ledger.sentBytes(block.data.length)\n ledger.wantlist.remove(block.key)\n this.peerRequestQueue.remove(block.key, peerId)\n }\n }","processSend(privKey, previous, sendCallback) {\n let pubKey = nano_old.derivePublicKey(privKey)\n let address = nano.deriveAddress(pubKey, {useNanoPrefix: true})\n\n // make an extra check on valid destination\n if (this.state.validAddress && nano.checkAddress(this.state.address)) {\n this.inputToast = toast(\"Started transferring funds...\", helpers.getToast(helpers.toastType.SUCCESS_AUTO))\n this.appendLog(\"Transfer started: \" + address)\n this.generateWork(previous, this.defaultSendPow, function(work) {\n // create the block with the work found\n let block = nano.createBlock(privKey, {balance:'0', representative:this.representative,\n work:work, link:this.state.address, previous:previous})\n // replace xrb with nano (old library)\n block.block.account = block.block.account.replace('xrb', 'nano')\n block.block.link_as_account = block.block.link_as_account.replace('xrb', 'nano')\n\n // publish block for each iteration\n let jsonBlock = {action: \"process\", json_block: \"true\", subtype:\"send\", watch_work:\"false\", block: block.block}\n helpers.postDataTimeout(jsonBlock,helpers.constants.RPC_SWEEP_SERVER)\n .then(function(data) {\n if (data.hash) {\n this.inputToast = toast(\"Funds transferred!\", helpers.getToast(helpers.toastType.SUCCESS_AUTO))\n this.appendLog(\"Funds transferred: \"+data.hash)\n console.log(this.adjustedBalance + \" raw transferred to \" + this.state.address)\n }\n else {\n this.inputToast = toast(\"Failed processing block.\", helpers.getToast(helpers.toastType.ERROR_AUTO))\n this.appendLog(\"Failed processing block: \"+data.error)\n }\n sendCallback()\n }.bind(this))\n .catch(function(error) {\n this.handleRPCError(error)\n sendCallback()\n }.bind(this))}.bind(this)\n )\n }\n else {\n if (this.state.address !== '') {\n this.inputToast = toast(\"The destination address is not valid\", helpers.getToast(helpers.toastType.ERROR))\n }\n sendCallback()\n }\n }","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last) {\n\t //DeflateState *s;\n\t //charf *buf; /* input block */\n\t //ulg stored_len; /* length of input block */\n\t //int last; /* one if this is the last block for a file */\n\t send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n\t copy_block(s, buf, stored_len, true); /* with header */\n\t }","submitStarData() {\n this.server.route({\n method: 'POST',\n path: '/block',\n handler: async (request, h) => {\n const result = await this.mempool.verifyAddressRequest(request.payload);\n if (result.address !== undefined) {\n //add block to blockchain\n let blockResult = await this.blockchain.addBlock(new BlockClass.Block(result));\n return await this.blockchain.addDecodedStoryToReturnObj(blockResult); \n }\n return result; \n }\n });\n }","saveBlock(height, block) {\n\n const self = this;\n return new Promise((resolve, reject) => {\n\n const blockString = JSON.stringify(block);\n self.db.put(height, blockString, (err) => {\n\n if (err) {\n reject(err);\n }\n else {\n resolve(block);\n }\n });\n });\n }","function _tr_stored_block(s,buf,stored_len,last)//DeflateState *s;\n //charf *buf; /* input block */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {send_bits(s,(STORED_BLOCK<<1)+(last?1:0),3);/* send block type */copy_block(s,buf,stored_len,true);/* with header */}","postNewBlock() {\n let self = this.blockChain;\n this.server.route({\n method: 'POST',\n path: '/block',\n handler: async (request, h) => {\n //Fetching block data from request body\n \n try{\n let blockData = request.payload.body;\n //Check whether the data variable is empty \n if(blockData==null){\n return \"No block data added\";\n }\n if(blockData.length==0){\n return \"Data is empty\";\n }\n let promise = self.addBlock(new BlockClass.Block(blockData));\n let result = await promise;\n return result;\n }catch(err){\n console.log(err);\n return \"Block cannot be added\";\n }\n \n }\n });\n }","function _tr_stored_block(s, buf, stored_len, last) //DeflateState *s;\n //charf *buf; /* input block */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);\n /* send block type */\n\n copy_block(s, buf, stored_len, true);\n /* with header */\n }","requestLocalData() {\n if (this.sendBuffers.length > 0) {\n const sendData = this.sendBuffers.shift();\n this.sp.write(sendData.data, () => {\n if (this.sp) {\n this.sp.drain(() => {\n this.executeCheckList[sendData.index] = sendData.id;\n });\n }\n });\n }\n// console.count('write hardware');\n return;\n }","postNewBlock() {\r\n this.server.route({\r\n method: 'POST',\r\n path: '/api/block',\r\n handler: async (request, h) => {\r\n if(request.payload==undefined || request.payload.length==0 || !request.payload.body){\r\n throw Boom.badRequest(\"You have to specify a valid json object with a body property.\");\r\n }\r\n let newBlock = new Block.Block(request.payload.body);\r\n let blockData = await this.blockChain.addBlock(newBlock);\r\n return h.response(blockData).code(201);\r\n }\r\n });\r\n }","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last) //DeflateState *s;\n //charf *buf; /* input block */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);\n /* send block type */\n\n copy_block(s, buf, stored_len, true);\n /* with header */\n }","function sendTemporaryBlock(recipientId) {\n var fraudTemplate = require('./messagetemplates/fraudMessage');\n var message = fraudTemplate.getTemporaryBlockMessage(recipientId);\n sendToMessenger.sendAPIForMessage(message);\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}","function _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}"],"string":"[\n \"messageSent (peerId, block) {\\n const ledger = this._findOrCreate(peerId)\\n ledger.sentBytes(block ? block.data.length : 0)\\n if (block && block.cid) {\\n ledger.wantlist.remove(block.cid)\\n }\\n }\",\n \"messageSent (peerId, block) {\\n const ledger = this._findOrCreate(peerId)\\n ledger.sentBytes(block ? block.data.length : 0)\\n if (block && block.cid) {\\n ledger.wantlist.remove(block.cid)\\n }\\n }\",\n \"static mineBlock ( payload ){\\n console.log(`Mining Block`)\\n return new Promise((resolve, reject) => {\\n let hash;\\n let lastBlock = DB.transactionLastBlock();\\n //payload.id = uuid();\\n do {\\n payload.created_at = Date.now()\\n payload.nonce = CRPYTO.randomBytes(16).toString('base64');\\n payload.difficulty = Block.adjustDifficulty(payload, lastBlock);\\n //console.log('DIFFICULTY: ', payload.difficulty)\\n payload.lastHash = lastBlock.hash\\n hash = CryptUtil.hash(payload, payload.difficulty, payload.nonce);\\n }while( HexToBin(hash).substr(0, payload.difficulty) !== '0'.repeat(payload.difficulty))\\n let block = {\\n payload : payload,\\n hash\\n }\\n //Broadcast the new block\\n global.node.broadcast.write(JSON.stringify({channel:'block', payload:block}))\\n resolve(DB.transactionPutBlock(block));\\n })\\n \\n \\n }\",\n \"postNewBlock() {\\n let self = this;\\n this.app.post(\\\"/api/block\\\", (req, res) => {\\n let blockData = req.body.data;\\n let block = new Block.Block(blockData);\\n self.myBlockChain.addBlock(block)\\n .then((block) => {\\n res.send(block)\\n })\\n .catch((err) => {\\n res.send(\\\"Error creating block: \\\" + err);\\n })\\n });\\n }\",\n \"postNewBlock() {\\n this.server.route({\\n method: 'POST',\\n path: '/block',\\n handler: (request, h) => {\\n return new Promise ((resolve,reject)=>{\\n var ctype = request.headers[\\\"content-type\\\"];\\n if (!ctype || ctype.indexOf(\\\"application/json\\\") !== 0) {\\n reject (Boom.badRequest(\\\"Wrong content-type. Required \\\\\\\"application/json\\\\\\\"\\\"));\\n }\\n const blockdata = request.payload.body;\\n if (typeof blockdata === \\\"undefined\\\" || !blockdata || blockdata.trim().length === 0) { \\n reject(Boom.badRequest(\\\"Bad Request expecting {\\\\\\\"data\\\\\\\":\\\\\\\"block body\\\\\\\"}\\\"));\\n } else {\\n this.blockChain.addBlock(new BlockClass.Block(blockdata)).then ((newblock)=>{\\n resolve (JSON.stringify(newblock));\\n });\\n }\\n });\\n }\\n });\\n }\",\n \"async storageBlock(newBlock) {\\n await this.m_chainDB.BeginTranscation();\\n let newHeaders = newBlock.toHeaders();\\n\\n let headerHash = newHeaders.hash('hex');\\n let blockHash = newBlock.hash('hex');\\n \\n if (newHeaders.height === this.m_headerChain.getNowHeight() + 1) {\\n await this.m_headerChain.addHeader(newHeaders);\\n }\\n await this.m_chainDB.CommitTranscation();\\n\\n this.m_blockStorage.add(newBlock);\\n }\",\n \"async function blxSendBinblock (data, fname, syncflag, mem_addr) {\\n let txlen_total = data.length\\n let tx_pos = 0\\n const time0 = Date.now() - 1000\\n let tw_old = time0\\n let tw_new // Working Time fuer Fortschritt\\n let sblk_len = (max_ble_blocklen - 2) & 0xFFFC // Initial MAX Size Block, but Multi of 4\\n\\n if (data.length > 1000) { // Mehr als 1k Daten UND File: -> FAST\\n\\n if(fname === undefined){\\n // Might bee too fast for Download to CPU Memory, set to slow with .cf 15 or greater!!!\\n if(con_memfast_speed < 15)\\n terminalPrint(\\\"*** WARNING: Memory Connection Speed: \\\" + con_memfast_speed ) \\n const os = con_fast_speed // temporaer mit MEMORY Speed\\n con_fast_speed = con_memfast_speed\\n await blxConnectionFast()\\n con_fast_speed = os\\n }else{\\n await blxConnectionFast()\\n } \\n if (blxErrMsg) return\\n // console.log(\\\"Fast OK\\\");\\n }\\n if(fname!== undefined) await blxDeviceCmd('P' + (syncflag ? '!' : '') + ':' + fname, 5000) // P wie PUT\\n else {\\n {\\n let wadr = mem_addr\\n let wsize = txlen_total\\n const sector_size = 4096 // Fix fuer nrF52\\n // Sektoren in einzeln Loeschen, da langsam\\n while(wsize>0){\\n await blxDeviceCmd('K:' + wadr + ' ' + 1 , 5000) \\n if (blxErrMsg) return\\n wadr+=sector_size\\n wsize-=sector_size\\n }\\n }\\n await blxDeviceCmd('I:' + mem_addr, 5000) // I wie Internal\\n }\\n if (blxErrMsg) return\\n\\n try {\\n for (;;) {\\n let blen = txlen_total // Blocklen\\n if (blen > sblk_len ) blen = sblk_len\\n const bdata = new Uint8Array(blen + 2)\\n bdata[0] = blen\\n bdata[1] = BB_BLE_BINBLK_IN // Binary Data\\n // Aufgabe: data[tx_pos] an bdata[2] kopieren\\n const datablock = data.subarray(tx_pos, tx_pos + blen)\\n bdata.set(datablock, 2) // Copies datablock into bdata\\n\\n await NUS_data_chara_write.writeValue(bdata.buffer)\\n\\n // console.log(bdata);\\n txlen_total -= blen\\n tx_pos += blen\\n if (!txlen_total) {\\n const dtime = Date.now() - time0\\n terminalPrint('Transfer OK (' + dtime / 1000 + ' sec, ' + ((data.length / dtime * 1000).toFixed(0)) + ' Bytes/sec)')\\n break\\n }\\n tw_new = Date.now()\\n if (tw_new - tw_old > 1000) { // Alle Sekunde Fortschritt\\n tw_old = tw_new\\n terminalPrint(((tx_pos * 100) / data.length).toFixed(0) + '% / ' + tx_pos + ' Bytes')\\n }\\n }\\n } catch (error) {\\n if (full_connected_flag === false) blxErrMsg = 'ERROR: Connection lost'\\n else blxErrMsg = 'ERROR: Transfer ' + error\\n return\\n }\\n\\n await blxDeviceCmd('L', 5000) // Close\\n\\n if (blxErrMsg) return\\n if (data.length > 1000) { // Mehr als 1k Daten: -> Wieder SLOW\\n await blxConnectionSlow()\\n }\\n }\",\n \"function copy_block(buf, // the input data\\n\\t\\tlen, // its length\\n\\t\\theader // true if block header must be written\\n\\t\\t) {\\n\\t\\t bi_windup(); // align on byte boundary\\n \\n\\t\\t last_eob_len = 8; // enough lookahead for inflate\\n \\n\\t\\t if (header) {\\n\\t\\t\\tput_short(len);\\n\\t\\t\\tput_short(~len);\\n\\t\\t }\\n \\n\\t\\t that.pending_buf.set(window.subarray(buf, buf + len), that.pending);\\n\\t\\t that.pending += len;\\n\\t\\t} // Send a stored block\",\n \"postNewBlock() {\\n this.server.route({\\n method: 'POST',\\n path: '/api/block',\\n handler: (request, h) => {\\n return new Promise ((resolve,reject)=>{\\n var ctype = request.headers[\\\"content-type\\\"];\\n if (!ctype || ctype.indexOf(\\\"application/json\\\") !== 0) {\\n reject (Boom.badRequest(\\\"Wrong content-type. Required \\\\\\\"application/json\\\\\\\"\\\"));\\n }\\n const blockdata = request.payload.body;\\n if (typeof blockdata === \\\"undefined\\\" || !blockdata || blockdata.trim().length === 0) { \\n reject(Boom.badRequest(\\\"Bad Request expecting {\\\\\\\"data\\\\\\\":\\\\\\\"block body\\\\\\\"}\\\"));\\n } else {\\n this.blockChain.addBlock(new BlockClass.Block(blockdata)).then ((newblock)=>{\\n resolve (newblock);\\n });\\n }\\n });\\n }\\n });\\n }\",\n \"messageSent (peerId, msg) {\\n const ledger = this._findOrCreate(peerId)\\n for (let block of msg.blocks.values()) {\\n ledger.sentBytes(block.data.length)\\n ledger.wantlist.remove(block.key)\\n this.peerRequestQueue.remove(block.key, peerId)\\n }\\n }\",\n \"processSend(privKey, previous, sendCallback) {\\n let pubKey = nano_old.derivePublicKey(privKey)\\n let address = nano.deriveAddress(pubKey, {useNanoPrefix: true})\\n\\n // make an extra check on valid destination\\n if (this.state.validAddress && nano.checkAddress(this.state.address)) {\\n this.inputToast = toast(\\\"Started transferring funds...\\\", helpers.getToast(helpers.toastType.SUCCESS_AUTO))\\n this.appendLog(\\\"Transfer started: \\\" + address)\\n this.generateWork(previous, this.defaultSendPow, function(work) {\\n // create the block with the work found\\n let block = nano.createBlock(privKey, {balance:'0', representative:this.representative,\\n work:work, link:this.state.address, previous:previous})\\n // replace xrb with nano (old library)\\n block.block.account = block.block.account.replace('xrb', 'nano')\\n block.block.link_as_account = block.block.link_as_account.replace('xrb', 'nano')\\n\\n // publish block for each iteration\\n let jsonBlock = {action: \\\"process\\\", json_block: \\\"true\\\", subtype:\\\"send\\\", watch_work:\\\"false\\\", block: block.block}\\n helpers.postDataTimeout(jsonBlock,helpers.constants.RPC_SWEEP_SERVER)\\n .then(function(data) {\\n if (data.hash) {\\n this.inputToast = toast(\\\"Funds transferred!\\\", helpers.getToast(helpers.toastType.SUCCESS_AUTO))\\n this.appendLog(\\\"Funds transferred: \\\"+data.hash)\\n console.log(this.adjustedBalance + \\\" raw transferred to \\\" + this.state.address)\\n }\\n else {\\n this.inputToast = toast(\\\"Failed processing block.\\\", helpers.getToast(helpers.toastType.ERROR_AUTO))\\n this.appendLog(\\\"Failed processing block: \\\"+data.error)\\n }\\n sendCallback()\\n }.bind(this))\\n .catch(function(error) {\\n this.handleRPCError(error)\\n sendCallback()\\n }.bind(this))}.bind(this)\\n )\\n }\\n else {\\n if (this.state.address !== '') {\\n this.inputToast = toast(\\\"The destination address is not valid\\\", helpers.getToast(helpers.toastType.ERROR))\\n }\\n sendCallback()\\n }\\n }\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last) {\\n\\t //DeflateState *s;\\n\\t //charf *buf; /* input block */\\n\\t //ulg stored_len; /* length of input block */\\n\\t //int last; /* one if this is the last block for a file */\\n\\t send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n\\t copy_block(s, buf, stored_len, true); /* with header */\\n\\t }\",\n \"submitStarData() {\\n this.server.route({\\n method: 'POST',\\n path: '/block',\\n handler: async (request, h) => {\\n const result = await this.mempool.verifyAddressRequest(request.payload);\\n if (result.address !== undefined) {\\n //add block to blockchain\\n let blockResult = await this.blockchain.addBlock(new BlockClass.Block(result));\\n return await this.blockchain.addDecodedStoryToReturnObj(blockResult); \\n }\\n return result; \\n }\\n });\\n }\",\n \"saveBlock(height, block) {\\n\\n const self = this;\\n return new Promise((resolve, reject) => {\\n\\n const blockString = JSON.stringify(block);\\n self.db.put(height, blockString, (err) => {\\n\\n if (err) {\\n reject(err);\\n }\\n else {\\n resolve(block);\\n }\\n });\\n });\\n }\",\n \"function _tr_stored_block(s,buf,stored_len,last)//DeflateState *s;\\n //charf *buf; /* input block */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {send_bits(s,(STORED_BLOCK<<1)+(last?1:0),3);/* send block type */copy_block(s,buf,stored_len,true);/* with header */}\",\n \"postNewBlock() {\\n let self = this.blockChain;\\n this.server.route({\\n method: 'POST',\\n path: '/block',\\n handler: async (request, h) => {\\n //Fetching block data from request body\\n \\n try{\\n let blockData = request.payload.body;\\n //Check whether the data variable is empty \\n if(blockData==null){\\n return \\\"No block data added\\\";\\n }\\n if(blockData.length==0){\\n return \\\"Data is empty\\\";\\n }\\n let promise = self.addBlock(new BlockClass.Block(blockData));\\n let result = await promise;\\n return result;\\n }catch(err){\\n console.log(err);\\n return \\\"Block cannot be added\\\";\\n }\\n \\n }\\n });\\n }\",\n \"function _tr_stored_block(s, buf, stored_len, last) //DeflateState *s;\\n //charf *buf; /* input block */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);\\n /* send block type */\\n\\n copy_block(s, buf, stored_len, true);\\n /* with header */\\n }\",\n \"requestLocalData() {\\n if (this.sendBuffers.length > 0) {\\n const sendData = this.sendBuffers.shift();\\n this.sp.write(sendData.data, () => {\\n if (this.sp) {\\n this.sp.drain(() => {\\n this.executeCheckList[sendData.index] = sendData.id;\\n });\\n }\\n });\\n }\\n// console.count('write hardware');\\n return;\\n }\",\n \"postNewBlock() {\\r\\n this.server.route({\\r\\n method: 'POST',\\r\\n path: '/api/block',\\r\\n handler: async (request, h) => {\\r\\n if(request.payload==undefined || request.payload.length==0 || !request.payload.body){\\r\\n throw Boom.badRequest(\\\"You have to specify a valid json object with a body property.\\\");\\r\\n }\\r\\n let newBlock = new Block.Block(request.payload.body);\\r\\n let blockData = await this.blockChain.addBlock(newBlock);\\r\\n return h.response(blockData).code(201);\\r\\n }\\r\\n });\\r\\n }\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last) //DeflateState *s;\\n //charf *buf; /* input block */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);\\n /* send block type */\\n\\n copy_block(s, buf, stored_len, true);\\n /* with header */\\n }\",\n \"function sendTemporaryBlock(recipientId) {\\n var fraudTemplate = require('./messagetemplates/fraudMessage');\\n var message = fraudTemplate.getTemporaryBlockMessage(recipientId);\\n sendToMessenger.sendAPIForMessage(message);\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\",\n \"function _tr_stored_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\\n copy_block(s, buf, stored_len, true); /* with header */\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.6636688","0.6636688","0.6435359","0.62935793","0.60487586","0.60476345","0.60344964","0.6023343","0.59361583","0.58950603","0.58587354","0.5830017","0.582569","0.5822428","0.5819708","0.5804283","0.57723826","0.57716817","0.5749839","0.5746885","0.5746508","0.5741353","0.57344884","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903","0.57218903"],"string":"[\n \"0.6636688\",\n \"0.6636688\",\n \"0.6435359\",\n \"0.62935793\",\n \"0.60487586\",\n \"0.60476345\",\n \"0.60344964\",\n \"0.6023343\",\n \"0.59361583\",\n \"0.58950603\",\n \"0.58587354\",\n \"0.5830017\",\n \"0.582569\",\n \"0.5822428\",\n \"0.5819708\",\n \"0.5804283\",\n \"0.57723826\",\n \"0.57716817\",\n \"0.5749839\",\n \"0.5746885\",\n \"0.5746508\",\n \"0.5741353\",\n \"0.57344884\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\",\n \"0.57218903\"\n]"},"document_score":{"kind":"string","value":"0.5756371"},"document_rank":{"kind":"string","value":"36"}}},{"rowIdx":81759,"cells":{"query":{"kind":"string","value":"=========================================================================== Send one empty static block to give enough lookahead for inflate. This takes 10 bits, of which 7 may remain in the bit buffer."},"document":{"kind":"string","value":"function _tr_align(s) {\n send_bits(s, STATIC_TREES<<1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function inflate(data, usz) {\n /* shortcircuit for empty buffer [0x03, 0x00] */\n if (data[0] == 3 && !(data[1] & 0x3)) {\n return [new_raw_buf(usz), 2];\n }\n /* bit offset */\n\n\n var boff = 0;\n /* header includes final bit and type bits */\n\n var header = 0;\n var outbuf = new_unsafe_buf(usz ? usz : 1 << 18);\n var woff = 0;\n var OL = outbuf.length >>> 0;\n var max_len_1 = 0,\n max_len_2 = 0;\n\n while ((header & 1) == 0) {\n header = read_bits_3(data, boff);\n boff += 3;\n\n if (header >>> 1 == 0) {\n /* Stored block */\n if (boff & 7) boff += 8 - (boff & 7);\n /* 2 bytes sz, 2 bytes bit inverse */\n\n var sz = data[boff >>> 3] | data[(boff >>> 3) + 1] << 8;\n boff += 32;\n /* push sz bytes */\n\n if (!usz && OL < woff + sz) {\n outbuf = realloc(outbuf, woff + sz);\n OL = outbuf.length;\n }\n\n if (typeof data.copy === 'function') {\n // $FlowIgnore\n data.copy(outbuf, woff, boff >>> 3, (boff >>> 3) + sz);\n woff += sz;\n boff += 8 * sz;\n } else while (sz-- > 0) {\n outbuf[woff++] = data[boff >>> 3];\n boff += 8;\n }\n\n continue;\n } else if (header >>> 1 == 1) {\n /* Fixed Huffman */\n max_len_1 = 9;\n max_len_2 = 5;\n } else {\n /* Dynamic Huffman */\n boff = dyn(data, boff);\n max_len_1 = dyn_len_1;\n max_len_2 = dyn_len_2;\n }\n\n if (!usz && OL < woff + 32767) {\n outbuf = realloc(outbuf, woff + 32767);\n OL = outbuf.length;\n }\n\n for (;;) {\n // while(true) is apparently out of vogue in modern JS circles\n\n /* ingest code and move read head */\n var bits = read_bits_n(data, boff, max_len_1);\n var code = header >>> 1 == 1 ? fix_lmap[bits] : dyn_lmap[bits];\n boff += code & 15;\n code >>>= 4;\n /* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\n\n if ((code >>> 8 & 0xFF) === 0) outbuf[woff++] = code;else if (code == 256) break;else {\n code -= 257;\n var len_eb = code < 8 ? 0 : code - 4 >> 2;\n if (len_eb > 5) len_eb = 0;\n var tgt = woff + LEN_LN[code];\n /* length extra bits */\n\n if (len_eb > 0) {\n tgt += read_bits_n(data, boff, len_eb);\n boff += len_eb;\n }\n /* dist code */\n\n\n bits = read_bits_n(data, boff, max_len_2);\n code = header >>> 1 == 1 ? fix_dmap[bits] : dyn_dmap[bits];\n boff += code & 15;\n code >>>= 4;\n var dst_eb = code < 4 ? 0 : code - 2 >> 1;\n var dst = DST_LN[code];\n /* dist extra bits */\n\n if (dst_eb > 0) {\n dst += read_bits_n(data, boff, dst_eb);\n boff += dst_eb;\n }\n /* in the common case, manual byte copy is faster than TA set / Buffer copy */\n\n\n if (!usz && OL < tgt) {\n outbuf = realloc(outbuf, tgt);\n OL = outbuf.length;\n }\n\n while (woff < tgt) {\n outbuf[woff] = outbuf[woff - dst];\n ++woff;\n }\n }\n }\n }\n\n return [usz ? outbuf : outbuf.slice(0, woff), boff + 7 >>> 3];\n }","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n \n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n }","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n }","function send_bits(s,value,length){if(s.bi_valid>Buf_size-length){s.bi_buf|=value<>Buf_size-s.bi_valid;s.bi_valid+=length-Buf_size;}else {s.bi_buf|=value<= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n }","function bi_flush(s){if(s.bi_valid===16){put_short(s,s.bi_buf);s.bi_buf=0;s.bi_valid=0;}else if(s.bi_valid>=8){s.pending_buf[s.pending++]=s.bi_buf&0xff;s.bi_buf>>=8;s.bi_valid-=8;}}","function fixed(n) {\n return new FixedBuffer(ring(n), n);\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n }","function inflate(data, usz) {\n\t/* shortcircuit for empty buffer [0x03, 0x00] */\n\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\n\n\t/* bit offset */\n\tvar boff = 0;\n\n\t/* header includes final bit and type bits */\n\tvar header = 0;\n\n\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\n\tvar woff = 0;\n\tvar OL = outbuf.length>>>0;\n\tvar max_len_1 = 0, max_len_2 = 0;\n\n\twhile((header&1) == 0) {\n\t\theader = read_bits_3(data, boff); boff += 3;\n\t\tif((header >>> 1) == 0) {\n\t\t\t/* Stored block */\n\t\t\tif(boff & 7) boff += 8 - (boff&7);\n\t\t\t/* 2 bytes sz, 2 bytes bit inverse */\n\t\t\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\n\t\t\tboff += 32;\n\t\t\t/* push sz bytes */\n\t\t\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\n\t\t\tif(typeof data.copy === 'function') {\n\t\t\t\t// $FlowIgnore\n\t\t\t\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\n\t\t\t\twoff += sz; boff += 8*sz;\n\t\t\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\n\t\t\tcontinue;\n\t\t} else if((header >>> 1) == 1) {\n\t\t\t/* Fixed Huffman */\n\t\t\tmax_len_1 = 9; max_len_2 = 5;\n\t\t} else {\n\t\t\t/* Dynamic Huffman */\n\t\t\tboff = dyn(data, boff);\n\t\t\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\n\t\t}\n\t\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\n\t\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\n\t\t\t/* ingest code and move read head */\n\t\t\tvar bits = read_bits_n(data, boff, max_len_1);\n\t\t\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\n\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\n\t\t\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\n\t\t\telse if(code == 256) break;\n\t\t\telse {\n\t\t\t\tcode -= 257;\n\t\t\t\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\n\t\t\t\tvar tgt = woff + LEN_LN[code];\n\t\t\t\t/* length extra bits */\n\t\t\t\tif(len_eb > 0) {\n\t\t\t\t\ttgt += read_bits_n(data, boff, len_eb);\n\t\t\t\t\tboff += len_eb;\n\t\t\t\t}\n\n\t\t\t\t/* dist code */\n\t\t\t\tbits = read_bits_n(data, boff, max_len_2);\n\t\t\t\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\n\t\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\n\t\t\t\tvar dst = DST_LN[code];\n\t\t\t\t/* dist extra bits */\n\t\t\t\tif(dst_eb > 0) {\n\t\t\t\t\tdst += read_bits_n(data, boff, dst_eb);\n\t\t\t\t\tboff += dst_eb;\n\t\t\t\t}\n\n\t\t\t\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\n\t\t\t\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\n\t\t\t\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\n\t\t\t}\n\t\t}\n\t}\n\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\n}","function inflate(data, usz) {\n\t/* shortcircuit for empty buffer [0x03, 0x00] */\n\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\n\n\t/* bit offset */\n\tvar boff = 0;\n\n\t/* header includes final bit and type bits */\n\tvar header = 0;\n\n\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\n\tvar woff = 0;\n\tvar OL = outbuf.length>>>0;\n\tvar max_len_1 = 0, max_len_2 = 0;\n\n\twhile((header&1) == 0) {\n\t\theader = read_bits_3(data, boff); boff += 3;\n\t\tif((header >>> 1) == 0) {\n\t\t\t/* Stored block */\n\t\t\tif(boff & 7) boff += 8 - (boff&7);\n\t\t\t/* 2 bytes sz, 2 bytes bit inverse */\n\t\t\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\n\t\t\tboff += 32;\n\t\t\t/* push sz bytes */\n\t\t\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\n\t\t\tif(typeof data.copy === 'function') {\n\t\t\t\t// $FlowIgnore\n\t\t\t\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\n\t\t\t\twoff += sz; boff += 8*sz;\n\t\t\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\n\t\t\tcontinue;\n\t\t} else if((header >>> 1) == 1) {\n\t\t\t/* Fixed Huffman */\n\t\t\tmax_len_1 = 9; max_len_2 = 5;\n\t\t} else {\n\t\t\t/* Dynamic Huffman */\n\t\t\tboff = dyn(data, boff);\n\t\t\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\n\t\t}\n\t\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\n\t\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\n\t\t\t/* ingest code and move read head */\n\t\t\tvar bits = read_bits_n(data, boff, max_len_1);\n\t\t\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\n\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\n\t\t\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\n\t\t\telse if(code == 256) break;\n\t\t\telse {\n\t\t\t\tcode -= 257;\n\t\t\t\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\n\t\t\t\tvar tgt = woff + LEN_LN[code];\n\t\t\t\t/* length extra bits */\n\t\t\t\tif(len_eb > 0) {\n\t\t\t\t\ttgt += read_bits_n(data, boff, len_eb);\n\t\t\t\t\tboff += len_eb;\n\t\t\t\t}\n\n\t\t\t\t/* dist code */\n\t\t\t\tbits = read_bits_n(data, boff, max_len_2);\n\t\t\t\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\n\t\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\n\t\t\t\tvar dst = DST_LN[code];\n\t\t\t\t/* dist extra bits */\n\t\t\t\tif(dst_eb > 0) {\n\t\t\t\t\tdst += read_bits_n(data, boff, dst_eb);\n\t\t\t\t\tboff += dst_eb;\n\t\t\t\t}\n\n\t\t\t\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\n\t\t\t\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\n\t\t\t\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\n\t\t\t}\n\t\t}\n\t}\n\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\n}","function inflate(data, usz) {\n\t/* shortcircuit for empty buffer [0x03, 0x00] */\n\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\n\n\t/* bit offset */\n\tvar boff = 0;\n\n\t/* header includes final bit and type bits */\n\tvar header = 0;\n\n\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\n\tvar woff = 0;\n\tvar OL = outbuf.length>>>0;\n\tvar max_len_1 = 0, max_len_2 = 0;\n\n\twhile((header&1) == 0) {\n\t\theader = read_bits_3(data, boff); boff += 3;\n\t\tif((header >>> 1) == 0) {\n\t\t\t/* Stored block */\n\t\t\tif(boff & 7) boff += 8 - (boff&7);\n\t\t\t/* 2 bytes sz, 2 bytes bit inverse */\n\t\t\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\n\t\t\tboff += 32;\n\t\t\t/* push sz bytes */\n\t\t\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\n\t\t\tif(typeof data.copy === 'function') {\n\t\t\t\t// $FlowIgnore\n\t\t\t\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\n\t\t\t\twoff += sz; boff += 8*sz;\n\t\t\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\n\t\t\tcontinue;\n\t\t} else if((header >>> 1) == 1) {\n\t\t\t/* Fixed Huffman */\n\t\t\tmax_len_1 = 9; max_len_2 = 5;\n\t\t} else {\n\t\t\t/* Dynamic Huffman */\n\t\t\tboff = dyn(data, boff);\n\t\t\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\n\t\t}\n\t\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\n\t\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\n\t\t\t/* ingest code and move read head */\n\t\t\tvar bits = read_bits_n(data, boff, max_len_1);\n\t\t\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\n\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\n\t\t\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\n\t\t\telse if(code == 256) break;\n\t\t\telse {\n\t\t\t\tcode -= 257;\n\t\t\t\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\n\t\t\t\tvar tgt = woff + LEN_LN[code];\n\t\t\t\t/* length extra bits */\n\t\t\t\tif(len_eb > 0) {\n\t\t\t\t\ttgt += read_bits_n(data, boff, len_eb);\n\t\t\t\t\tboff += len_eb;\n\t\t\t\t}\n\n\t\t\t\t/* dist code */\n\t\t\t\tbits = read_bits_n(data, boff, max_len_2);\n\t\t\t\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\n\t\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\n\t\t\t\tvar dst = DST_LN[code];\n\t\t\t\t/* dist extra bits */\n\t\t\t\tif(dst_eb > 0) {\n\t\t\t\t\tdst += read_bits_n(data, boff, dst_eb);\n\t\t\t\t\tboff += dst_eb;\n\t\t\t\t}\n\n\t\t\t\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\n\t\t\t\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\n\t\t\t\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\n\t\t\t}\n\t\t}\n\t}\n\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\n}","function inflate(data, usz) {\n\t/* shortcircuit for empty buffer [0x03, 0x00] */\n\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\n\n\t/* bit offset */\n\tvar boff = 0;\n\n\t/* header includes final bit and type bits */\n\tvar header = 0;\n\n\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\n\tvar woff = 0;\n\tvar OL = outbuf.length>>>0;\n\tvar max_len_1 = 0, max_len_2 = 0;\n\n\twhile((header&1) == 0) {\n\t\theader = read_bits_3(data, boff); boff += 3;\n\t\tif((header >>> 1) == 0) {\n\t\t\t/* Stored block */\n\t\t\tif(boff & 7) boff += 8 - (boff&7);\n\t\t\t/* 2 bytes sz, 2 bytes bit inverse */\n\t\t\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\n\t\t\tboff += 32;\n\t\t\t/* push sz bytes */\n\t\t\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\n\t\t\tif(typeof data.copy === 'function') {\n\t\t\t\t// $FlowIgnore\n\t\t\t\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\n\t\t\t\twoff += sz; boff += 8*sz;\n\t\t\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\n\t\t\tcontinue;\n\t\t} else if((header >>> 1) == 1) {\n\t\t\t/* Fixed Huffman */\n\t\t\tmax_len_1 = 9; max_len_2 = 5;\n\t\t} else {\n\t\t\t/* Dynamic Huffman */\n\t\t\tboff = dyn(data, boff);\n\t\t\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\n\t\t}\n\t\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\n\t\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\n\t\t\t/* ingest code and move read head */\n\t\t\tvar bits = read_bits_n(data, boff, max_len_1);\n\t\t\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\n\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\n\t\t\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\n\t\t\telse if(code == 256) break;\n\t\t\telse {\n\t\t\t\tcode -= 257;\n\t\t\t\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\n\t\t\t\tvar tgt = woff + LEN_LN[code];\n\t\t\t\t/* length extra bits */\n\t\t\t\tif(len_eb > 0) {\n\t\t\t\t\ttgt += read_bits_n(data, boff, len_eb);\n\t\t\t\t\tboff += len_eb;\n\t\t\t\t}\n\n\t\t\t\t/* dist code */\n\t\t\t\tbits = read_bits_n(data, boff, max_len_2);\n\t\t\t\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\n\t\t\t\tboff += code & 15; code >>>= 4;\n\t\t\t\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\n\t\t\t\tvar dst = DST_LN[code];\n\t\t\t\t/* dist extra bits */\n\t\t\t\tif(dst_eb > 0) {\n\t\t\t\t\tdst += read_bits_n(data, boff, dst_eb);\n\t\t\t\t\tboff += dst_eb;\n\t\t\t\t}\n\n\t\t\t\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\n\t\t\t\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\n\t\t\t\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\n\t\t\t}\n\t\t}\n\t}\n\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\n}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\t\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t }","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function bi_flush(s) {\n\t if (s.bi_valid === 16) {\n\t put_short(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function copy_block(buf, // the input data\n\t\tlen, // its length\n\t\theader // true if block header must be written\n\t\t) {\n\t\t bi_windup(); // align on byte boundary\n \n\t\t last_eob_len = 8; // enough lookahead for inflate\n \n\t\t if (header) {\n\t\t\tput_short(len);\n\t\t\tput_short(~len);\n\t\t }\n \n\t\t that.pending_buf.set(window.subarray(buf, buf + len), that.pending);\n\t\t that.pending += len;\n\t\t} // Send a stored block","function send_bits(s, value, length) {\n if (s.bi_valid > Buf_size - length) {\n s.bi_buf |= value << s.bi_valid & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> Buf_size - s.bi_valid;\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= value << s.bi_valid & 0xffff;\n s.bi_valid += length;\n }\n }","function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n }","function bi_flush$1(s) {\n\t if (s.bi_valid === 16) {\n\t put_short$1(s, s.bi_buf);\n\t s.bi_buf = 0;\n\t s.bi_valid = 0;\n\n\t } else if (s.bi_valid >= 8) {\n\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n\t s.bi_buf >>= 8;\n\t s.bi_valid -= 8;\n\t }\n\t}","function _tr_align(s){send_bits(s,STATIC_TREES<<1,3);send_code(s,END_BLOCK,static_ltree);bi_flush(s);}","function bi_windup(s){if(s.bi_valid>8){put_short(s,s.bi_buf);}else if(s.bi_valid>0){//put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++]=s.bi_buf;}s.bi_buf=0;s.bi_valid=0;}","function send_bits(s, value, length) {\n if (s.bi_valid > Buf_size - length) {\n s.bi_buf |= value << s.bi_valid & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> Buf_size - s.bi_valid;\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= value << s.bi_valid & 0xffff;\n s.bi_valid += length;\n }\n }","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function flush_block(eof) { // true if this is the last block for a file\n\t\tvar opt_lenb, static_lenb, // opt_len and static_len in bytes\n\t\t\tmax_blindex, // index of last bit length code of non zero freq\n\t\t\tstored_len, // length of input block\n\t\t\ti;\n\n\t\tstored_len = strstart - block_start;\n\t\tflag_buf[last_flags] = flags; // Save the flags for the last 8 items\n\n\t\t// Construct the literal and distance trees\n\t\tbuild_tree(l_desc);\n\t\t// Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\n\t\tbuild_tree(d_desc);\n\t\t// Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\t\t// At this point, opt_len and static_len are the total bit lengths of\n\t\t// the compressed block data, excluding the tree representations.\n\n\t\t// Build the bit length tree for the above two trees, and get the index\n\t\t// in bl_order of the last bit length code to send.\n\t\tmax_blindex = build_bl_tree();\n\n\t // Determine the best encoding. Compute first the block length in bytes\n\t\topt_lenb = (opt_len + 3 + 7) >> 3;\n\t\tstatic_lenb = (static_len + 3 + 7) >> 3;\n\n\t// Trace((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \", opt_lenb, encoder->opt_len, static_lenb, encoder->static_len, stored_len, encoder->last_lit, encoder->last_dist));\n\n\t\tif (static_lenb <= opt_lenb) {\n\t\t\topt_lenb = static_lenb;\n\t\t}\n\t\tif (stored_len + 4 <= opt_lenb && block_start >= 0) { // 4: two words for the lengths\n\t\t\t// The test buf !== NULL is only necessary if LIT_BUFSIZE > WSIZE.\n\t\t\t// Otherwise we can't have processed more than WSIZE input bytes since\n\t\t\t// the last block flush, because compression would have been\n\t\t\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n\t\t\t// transform a block into a stored block.\n\t\t\tsend_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */\n\t\t\tbi_windup(); /* align on byte boundary */\n\t\t\tput_short(stored_len);\n\t\t\tput_short(~stored_len);\n\n\t\t\t// copy block\n\t\t\t/*\n\t\t\t\tp = &window[block_start];\n\t\t\t\tfor (i = 0; i < stored_len; i++) {\n\t\t\t\t\tput_byte(p[i]);\n\t\t\t\t}\n\t\t\t*/\n\t\t\tfor (i = 0; i < stored_len; i++) {\n\t\t\t\tput_byte(window[block_start + i]);\n\t\t\t}\n\t\t} else if (static_lenb === opt_lenb) {\n\t\t\tsend_bits((STATIC_TREES << 1) + eof, 3);\n\t\t\tcompress_block(static_ltree, static_dtree);\n\t\t} else {\n\t\t\tsend_bits((DYN_TREES << 1) + eof, 3);\n\t\t\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\n\t\t\tcompress_block(dyn_ltree, dyn_dtree);\n\t\t}\n\n\t\tinit_block();\n\n\t\tif (eof !== 0) {\n\t\t\tbi_windup();\n\t\t}\n\t}","function bi_windup(s) {\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n }","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}","function bi_flush(s) {\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n}"],"string":"[\n \"function inflate(data, usz) {\\n /* shortcircuit for empty buffer [0x03, 0x00] */\\n if (data[0] == 3 && !(data[1] & 0x3)) {\\n return [new_raw_buf(usz), 2];\\n }\\n /* bit offset */\\n\\n\\n var boff = 0;\\n /* header includes final bit and type bits */\\n\\n var header = 0;\\n var outbuf = new_unsafe_buf(usz ? usz : 1 << 18);\\n var woff = 0;\\n var OL = outbuf.length >>> 0;\\n var max_len_1 = 0,\\n max_len_2 = 0;\\n\\n while ((header & 1) == 0) {\\n header = read_bits_3(data, boff);\\n boff += 3;\\n\\n if (header >>> 1 == 0) {\\n /* Stored block */\\n if (boff & 7) boff += 8 - (boff & 7);\\n /* 2 bytes sz, 2 bytes bit inverse */\\n\\n var sz = data[boff >>> 3] | data[(boff >>> 3) + 1] << 8;\\n boff += 32;\\n /* push sz bytes */\\n\\n if (!usz && OL < woff + sz) {\\n outbuf = realloc(outbuf, woff + sz);\\n OL = outbuf.length;\\n }\\n\\n if (typeof data.copy === 'function') {\\n // $FlowIgnore\\n data.copy(outbuf, woff, boff >>> 3, (boff >>> 3) + sz);\\n woff += sz;\\n boff += 8 * sz;\\n } else while (sz-- > 0) {\\n outbuf[woff++] = data[boff >>> 3];\\n boff += 8;\\n }\\n\\n continue;\\n } else if (header >>> 1 == 1) {\\n /* Fixed Huffman */\\n max_len_1 = 9;\\n max_len_2 = 5;\\n } else {\\n /* Dynamic Huffman */\\n boff = dyn(data, boff);\\n max_len_1 = dyn_len_1;\\n max_len_2 = dyn_len_2;\\n }\\n\\n if (!usz && OL < woff + 32767) {\\n outbuf = realloc(outbuf, woff + 32767);\\n OL = outbuf.length;\\n }\\n\\n for (;;) {\\n // while(true) is apparently out of vogue in modern JS circles\\n\\n /* ingest code and move read head */\\n var bits = read_bits_n(data, boff, max_len_1);\\n var code = header >>> 1 == 1 ? fix_lmap[bits] : dyn_lmap[bits];\\n boff += code & 15;\\n code >>>= 4;\\n /* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\\n\\n if ((code >>> 8 & 0xFF) === 0) outbuf[woff++] = code;else if (code == 256) break;else {\\n code -= 257;\\n var len_eb = code < 8 ? 0 : code - 4 >> 2;\\n if (len_eb > 5) len_eb = 0;\\n var tgt = woff + LEN_LN[code];\\n /* length extra bits */\\n\\n if (len_eb > 0) {\\n tgt += read_bits_n(data, boff, len_eb);\\n boff += len_eb;\\n }\\n /* dist code */\\n\\n\\n bits = read_bits_n(data, boff, max_len_2);\\n code = header >>> 1 == 1 ? fix_dmap[bits] : dyn_dmap[bits];\\n boff += code & 15;\\n code >>>= 4;\\n var dst_eb = code < 4 ? 0 : code - 2 >> 1;\\n var dst = DST_LN[code];\\n /* dist extra bits */\\n\\n if (dst_eb > 0) {\\n dst += read_bits_n(data, boff, dst_eb);\\n boff += dst_eb;\\n }\\n /* in the common case, manual byte copy is faster than TA set / Buffer copy */\\n\\n\\n if (!usz && OL < tgt) {\\n outbuf = realloc(outbuf, tgt);\\n OL = outbuf.length;\\n }\\n\\n while (woff < tgt) {\\n outbuf[woff] = outbuf[woff - dst];\\n ++woff;\\n }\\n }\\n }\\n }\\n\\n return [usz ? outbuf : outbuf.slice(0, woff), boff + 7 >>> 3];\\n }\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n \\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n }\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n }\",\n \"function send_bits(s,value,length){if(s.bi_valid>Buf_size-length){s.bi_buf|=value<>Buf_size-s.bi_valid;s.bi_valid+=length-Buf_size;}else {s.bi_buf|=value<= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n }\",\n \"function bi_flush(s){if(s.bi_valid===16){put_short(s,s.bi_buf);s.bi_buf=0;s.bi_valid=0;}else if(s.bi_valid>=8){s.pending_buf[s.pending++]=s.bi_buf&0xff;s.bi_buf>>=8;s.bi_valid-=8;}}\",\n \"function fixed(n) {\\n return new FixedBuffer(ring(n), n);\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n }\",\n \"function inflate(data, usz) {\\n\\t/* shortcircuit for empty buffer [0x03, 0x00] */\\n\\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\\n\\n\\t/* bit offset */\\n\\tvar boff = 0;\\n\\n\\t/* header includes final bit and type bits */\\n\\tvar header = 0;\\n\\n\\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\\n\\tvar woff = 0;\\n\\tvar OL = outbuf.length>>>0;\\n\\tvar max_len_1 = 0, max_len_2 = 0;\\n\\n\\twhile((header&1) == 0) {\\n\\t\\theader = read_bits_3(data, boff); boff += 3;\\n\\t\\tif((header >>> 1) == 0) {\\n\\t\\t\\t/* Stored block */\\n\\t\\t\\tif(boff & 7) boff += 8 - (boff&7);\\n\\t\\t\\t/* 2 bytes sz, 2 bytes bit inverse */\\n\\t\\t\\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\\n\\t\\t\\tboff += 32;\\n\\t\\t\\t/* push sz bytes */\\n\\t\\t\\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\\n\\t\\t\\tif(typeof data.copy === 'function') {\\n\\t\\t\\t\\t// $FlowIgnore\\n\\t\\t\\t\\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\\n\\t\\t\\t\\twoff += sz; boff += 8*sz;\\n\\t\\t\\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\\n\\t\\t\\tcontinue;\\n\\t\\t} else if((header >>> 1) == 1) {\\n\\t\\t\\t/* Fixed Huffman */\\n\\t\\t\\tmax_len_1 = 9; max_len_2 = 5;\\n\\t\\t} else {\\n\\t\\t\\t/* Dynamic Huffman */\\n\\t\\t\\tboff = dyn(data, boff);\\n\\t\\t\\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\\n\\t\\t}\\n\\t\\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\\n\\t\\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\\n\\t\\t\\t/* ingest code and move read head */\\n\\t\\t\\tvar bits = read_bits_n(data, boff, max_len_1);\\n\\t\\t\\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\\n\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\\n\\t\\t\\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\\n\\t\\t\\telse if(code == 256) break;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcode -= 257;\\n\\t\\t\\t\\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\\n\\t\\t\\t\\tvar tgt = woff + LEN_LN[code];\\n\\t\\t\\t\\t/* length extra bits */\\n\\t\\t\\t\\tif(len_eb > 0) {\\n\\t\\t\\t\\t\\ttgt += read_bits_n(data, boff, len_eb);\\n\\t\\t\\t\\t\\tboff += len_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* dist code */\\n\\t\\t\\t\\tbits = read_bits_n(data, boff, max_len_2);\\n\\t\\t\\t\\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\\n\\t\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t\\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\\n\\t\\t\\t\\tvar dst = DST_LN[code];\\n\\t\\t\\t\\t/* dist extra bits */\\n\\t\\t\\t\\tif(dst_eb > 0) {\\n\\t\\t\\t\\t\\tdst += read_bits_n(data, boff, dst_eb);\\n\\t\\t\\t\\t\\tboff += dst_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\\n\\t\\t\\t\\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\\n\\t\\t\\t\\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\\n}\",\n \"function inflate(data, usz) {\\n\\t/* shortcircuit for empty buffer [0x03, 0x00] */\\n\\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\\n\\n\\t/* bit offset */\\n\\tvar boff = 0;\\n\\n\\t/* header includes final bit and type bits */\\n\\tvar header = 0;\\n\\n\\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\\n\\tvar woff = 0;\\n\\tvar OL = outbuf.length>>>0;\\n\\tvar max_len_1 = 0, max_len_2 = 0;\\n\\n\\twhile((header&1) == 0) {\\n\\t\\theader = read_bits_3(data, boff); boff += 3;\\n\\t\\tif((header >>> 1) == 0) {\\n\\t\\t\\t/* Stored block */\\n\\t\\t\\tif(boff & 7) boff += 8 - (boff&7);\\n\\t\\t\\t/* 2 bytes sz, 2 bytes bit inverse */\\n\\t\\t\\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\\n\\t\\t\\tboff += 32;\\n\\t\\t\\t/* push sz bytes */\\n\\t\\t\\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\\n\\t\\t\\tif(typeof data.copy === 'function') {\\n\\t\\t\\t\\t// $FlowIgnore\\n\\t\\t\\t\\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\\n\\t\\t\\t\\twoff += sz; boff += 8*sz;\\n\\t\\t\\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\\n\\t\\t\\tcontinue;\\n\\t\\t} else if((header >>> 1) == 1) {\\n\\t\\t\\t/* Fixed Huffman */\\n\\t\\t\\tmax_len_1 = 9; max_len_2 = 5;\\n\\t\\t} else {\\n\\t\\t\\t/* Dynamic Huffman */\\n\\t\\t\\tboff = dyn(data, boff);\\n\\t\\t\\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\\n\\t\\t}\\n\\t\\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\\n\\t\\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\\n\\t\\t\\t/* ingest code and move read head */\\n\\t\\t\\tvar bits = read_bits_n(data, boff, max_len_1);\\n\\t\\t\\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\\n\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\\n\\t\\t\\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\\n\\t\\t\\telse if(code == 256) break;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcode -= 257;\\n\\t\\t\\t\\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\\n\\t\\t\\t\\tvar tgt = woff + LEN_LN[code];\\n\\t\\t\\t\\t/* length extra bits */\\n\\t\\t\\t\\tif(len_eb > 0) {\\n\\t\\t\\t\\t\\ttgt += read_bits_n(data, boff, len_eb);\\n\\t\\t\\t\\t\\tboff += len_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* dist code */\\n\\t\\t\\t\\tbits = read_bits_n(data, boff, max_len_2);\\n\\t\\t\\t\\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\\n\\t\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t\\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\\n\\t\\t\\t\\tvar dst = DST_LN[code];\\n\\t\\t\\t\\t/* dist extra bits */\\n\\t\\t\\t\\tif(dst_eb > 0) {\\n\\t\\t\\t\\t\\tdst += read_bits_n(data, boff, dst_eb);\\n\\t\\t\\t\\t\\tboff += dst_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\\n\\t\\t\\t\\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\\n\\t\\t\\t\\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\\n}\",\n \"function inflate(data, usz) {\\n\\t/* shortcircuit for empty buffer [0x03, 0x00] */\\n\\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\\n\\n\\t/* bit offset */\\n\\tvar boff = 0;\\n\\n\\t/* header includes final bit and type bits */\\n\\tvar header = 0;\\n\\n\\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\\n\\tvar woff = 0;\\n\\tvar OL = outbuf.length>>>0;\\n\\tvar max_len_1 = 0, max_len_2 = 0;\\n\\n\\twhile((header&1) == 0) {\\n\\t\\theader = read_bits_3(data, boff); boff += 3;\\n\\t\\tif((header >>> 1) == 0) {\\n\\t\\t\\t/* Stored block */\\n\\t\\t\\tif(boff & 7) boff += 8 - (boff&7);\\n\\t\\t\\t/* 2 bytes sz, 2 bytes bit inverse */\\n\\t\\t\\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\\n\\t\\t\\tboff += 32;\\n\\t\\t\\t/* push sz bytes */\\n\\t\\t\\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\\n\\t\\t\\tif(typeof data.copy === 'function') {\\n\\t\\t\\t\\t// $FlowIgnore\\n\\t\\t\\t\\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\\n\\t\\t\\t\\twoff += sz; boff += 8*sz;\\n\\t\\t\\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\\n\\t\\t\\tcontinue;\\n\\t\\t} else if((header >>> 1) == 1) {\\n\\t\\t\\t/* Fixed Huffman */\\n\\t\\t\\tmax_len_1 = 9; max_len_2 = 5;\\n\\t\\t} else {\\n\\t\\t\\t/* Dynamic Huffman */\\n\\t\\t\\tboff = dyn(data, boff);\\n\\t\\t\\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\\n\\t\\t}\\n\\t\\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\\n\\t\\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\\n\\t\\t\\t/* ingest code and move read head */\\n\\t\\t\\tvar bits = read_bits_n(data, boff, max_len_1);\\n\\t\\t\\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\\n\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\\n\\t\\t\\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\\n\\t\\t\\telse if(code == 256) break;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcode -= 257;\\n\\t\\t\\t\\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\\n\\t\\t\\t\\tvar tgt = woff + LEN_LN[code];\\n\\t\\t\\t\\t/* length extra bits */\\n\\t\\t\\t\\tif(len_eb > 0) {\\n\\t\\t\\t\\t\\ttgt += read_bits_n(data, boff, len_eb);\\n\\t\\t\\t\\t\\tboff += len_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* dist code */\\n\\t\\t\\t\\tbits = read_bits_n(data, boff, max_len_2);\\n\\t\\t\\t\\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\\n\\t\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t\\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\\n\\t\\t\\t\\tvar dst = DST_LN[code];\\n\\t\\t\\t\\t/* dist extra bits */\\n\\t\\t\\t\\tif(dst_eb > 0) {\\n\\t\\t\\t\\t\\tdst += read_bits_n(data, boff, dst_eb);\\n\\t\\t\\t\\t\\tboff += dst_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\\n\\t\\t\\t\\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\\n\\t\\t\\t\\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\\n}\",\n \"function inflate(data, usz) {\\n\\t/* shortcircuit for empty buffer [0x03, 0x00] */\\n\\tif(data[0] == 3 && !(data[1] & 0x3)) { return [new_raw_buf(usz), 2]; }\\n\\n\\t/* bit offset */\\n\\tvar boff = 0;\\n\\n\\t/* header includes final bit and type bits */\\n\\tvar header = 0;\\n\\n\\tvar outbuf = new_unsafe_buf(usz ? usz : (1<<18));\\n\\tvar woff = 0;\\n\\tvar OL = outbuf.length>>>0;\\n\\tvar max_len_1 = 0, max_len_2 = 0;\\n\\n\\twhile((header&1) == 0) {\\n\\t\\theader = read_bits_3(data, boff); boff += 3;\\n\\t\\tif((header >>> 1) == 0) {\\n\\t\\t\\t/* Stored block */\\n\\t\\t\\tif(boff & 7) boff += 8 - (boff&7);\\n\\t\\t\\t/* 2 bytes sz, 2 bytes bit inverse */\\n\\t\\t\\tvar sz = data[boff>>>3] | data[(boff>>>3)+1]<<8;\\n\\t\\t\\tboff += 32;\\n\\t\\t\\t/* push sz bytes */\\n\\t\\t\\tif(!usz && OL < woff + sz) { outbuf = realloc(outbuf, woff + sz); OL = outbuf.length; }\\n\\t\\t\\tif(typeof data.copy === 'function') {\\n\\t\\t\\t\\t// $FlowIgnore\\n\\t\\t\\t\\tdata.copy(outbuf, woff, boff>>>3, (boff>>>3)+sz);\\n\\t\\t\\t\\twoff += sz; boff += 8*sz;\\n\\t\\t\\t} else while(sz-- > 0) { outbuf[woff++] = data[boff>>>3]; boff += 8; }\\n\\t\\t\\tcontinue;\\n\\t\\t} else if((header >>> 1) == 1) {\\n\\t\\t\\t/* Fixed Huffman */\\n\\t\\t\\tmax_len_1 = 9; max_len_2 = 5;\\n\\t\\t} else {\\n\\t\\t\\t/* Dynamic Huffman */\\n\\t\\t\\tboff = dyn(data, boff);\\n\\t\\t\\tmax_len_1 = dyn_len_1; max_len_2 = dyn_len_2;\\n\\t\\t}\\n\\t\\tif(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }\\n\\t\\tfor(;;) { // while(true) is apparently out of vogue in modern JS circles\\n\\t\\t\\t/* ingest code and move read head */\\n\\t\\t\\tvar bits = read_bits_n(data, boff, max_len_1);\\n\\t\\t\\tvar code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];\\n\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t/* 0-255 are literals, 256 is end of block token, 257+ are copy tokens */\\n\\t\\t\\tif(((code>>>8)&0xFF) === 0) outbuf[woff++] = code;\\n\\t\\t\\telse if(code == 256) break;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcode -= 257;\\n\\t\\t\\t\\tvar len_eb = (code < 8) ? 0 : ((code-4)>>2); if(len_eb > 5) len_eb = 0;\\n\\t\\t\\t\\tvar tgt = woff + LEN_LN[code];\\n\\t\\t\\t\\t/* length extra bits */\\n\\t\\t\\t\\tif(len_eb > 0) {\\n\\t\\t\\t\\t\\ttgt += read_bits_n(data, boff, len_eb);\\n\\t\\t\\t\\t\\tboff += len_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* dist code */\\n\\t\\t\\t\\tbits = read_bits_n(data, boff, max_len_2);\\n\\t\\t\\t\\tcode = (header>>>1) == 1 ? fix_dmap[bits] : dyn_dmap[bits];\\n\\t\\t\\t\\tboff += code & 15; code >>>= 4;\\n\\t\\t\\t\\tvar dst_eb = (code < 4 ? 0 : (code-2)>>1);\\n\\t\\t\\t\\tvar dst = DST_LN[code];\\n\\t\\t\\t\\t/* dist extra bits */\\n\\t\\t\\t\\tif(dst_eb > 0) {\\n\\t\\t\\t\\t\\tdst += read_bits_n(data, boff, dst_eb);\\n\\t\\t\\t\\t\\tboff += dst_eb;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t/* in the common case, manual byte copy is faster than TA set / Buffer copy */\\n\\t\\t\\t\\tif(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }\\n\\t\\t\\t\\twhile(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn [usz ? outbuf : outbuf.slice(0, woff), (boff+7)>>>3];\\n}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\t\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t }\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function bi_flush(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function copy_block(buf, // the input data\\n\\t\\tlen, // its length\\n\\t\\theader // true if block header must be written\\n\\t\\t) {\\n\\t\\t bi_windup(); // align on byte boundary\\n \\n\\t\\t last_eob_len = 8; // enough lookahead for inflate\\n \\n\\t\\t if (header) {\\n\\t\\t\\tput_short(len);\\n\\t\\t\\tput_short(~len);\\n\\t\\t }\\n \\n\\t\\t that.pending_buf.set(window.subarray(buf, buf + len), that.pending);\\n\\t\\t that.pending += len;\\n\\t\\t} // Send a stored block\",\n \"function send_bits(s, value, length) {\\n if (s.bi_valid > Buf_size - length) {\\n s.bi_buf |= value << s.bi_valid & 0xffff;\\n put_short(s, s.bi_buf);\\n s.bi_buf = value >> Buf_size - s.bi_valid;\\n s.bi_valid += length - Buf_size;\\n } else {\\n s.bi_buf |= value << s.bi_valid & 0xffff;\\n s.bi_valid += length;\\n }\\n }\",\n \"function bi_windup(s) {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n }\",\n \"function bi_flush$1(s) {\\n\\t if (s.bi_valid === 16) {\\n\\t put_short$1(s, s.bi_buf);\\n\\t s.bi_buf = 0;\\n\\t s.bi_valid = 0;\\n\\n\\t } else if (s.bi_valid >= 8) {\\n\\t s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n\\t s.bi_buf >>= 8;\\n\\t s.bi_valid -= 8;\\n\\t }\\n\\t}\",\n \"function _tr_align(s){send_bits(s,STATIC_TREES<<1,3);send_code(s,END_BLOCK,static_ltree);bi_flush(s);}\",\n \"function bi_windup(s){if(s.bi_valid>8){put_short(s,s.bi_buf);}else if(s.bi_valid>0){//put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++]=s.bi_buf;}s.bi_buf=0;s.bi_valid=0;}\",\n \"function send_bits(s, value, length) {\\n if (s.bi_valid > Buf_size - length) {\\n s.bi_buf |= value << s.bi_valid & 0xffff;\\n put_short(s, s.bi_buf);\\n s.bi_buf = value >> Buf_size - s.bi_valid;\\n s.bi_valid += length - Buf_size;\\n } else {\\n s.bi_buf |= value << s.bi_valid & 0xffff;\\n s.bi_valid += length;\\n }\\n }\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function flush_block(eof) { // true if this is the last block for a file\\n\\t\\tvar opt_lenb, static_lenb, // opt_len and static_len in bytes\\n\\t\\t\\tmax_blindex, // index of last bit length code of non zero freq\\n\\t\\t\\tstored_len, // length of input block\\n\\t\\t\\ti;\\n\\n\\t\\tstored_len = strstart - block_start;\\n\\t\\tflag_buf[last_flags] = flags; // Save the flags for the last 8 items\\n\\n\\t\\t// Construct the literal and distance trees\\n\\t\\tbuild_tree(l_desc);\\n\\t\\t// Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\n\\t\\tbuild_tree(d_desc);\\n\\t\\t// Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\t\\t// At this point, opt_len and static_len are the total bit lengths of\\n\\t\\t// the compressed block data, excluding the tree representations.\\n\\n\\t\\t// Build the bit length tree for the above two trees, and get the index\\n\\t\\t// in bl_order of the last bit length code to send.\\n\\t\\tmax_blindex = build_bl_tree();\\n\\n\\t // Determine the best encoding. Compute first the block length in bytes\\n\\t\\topt_lenb = (opt_len + 3 + 7) >> 3;\\n\\t\\tstatic_lenb = (static_len + 3 + 7) >> 3;\\n\\n\\t// Trace((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \\\", opt_lenb, encoder->opt_len, static_lenb, encoder->static_len, stored_len, encoder->last_lit, encoder->last_dist));\\n\\n\\t\\tif (static_lenb <= opt_lenb) {\\n\\t\\t\\topt_lenb = static_lenb;\\n\\t\\t}\\n\\t\\tif (stored_len + 4 <= opt_lenb && block_start >= 0) { // 4: two words for the lengths\\n\\t\\t\\t// The test buf !== NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n\\t\\t\\t// Otherwise we can't have processed more than WSIZE input bytes since\\n\\t\\t\\t// the last block flush, because compression would have been\\n\\t\\t\\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n\\t\\t\\t// transform a block into a stored block.\\n\\t\\t\\tsend_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */\\n\\t\\t\\tbi_windup(); /* align on byte boundary */\\n\\t\\t\\tput_short(stored_len);\\n\\t\\t\\tput_short(~stored_len);\\n\\n\\t\\t\\t// copy block\\n\\t\\t\\t/*\\n\\t\\t\\t\\tp = &window[block_start];\\n\\t\\t\\t\\tfor (i = 0; i < stored_len; i++) {\\n\\t\\t\\t\\t\\tput_byte(p[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t\\tfor (i = 0; i < stored_len; i++) {\\n\\t\\t\\t\\tput_byte(window[block_start + i]);\\n\\t\\t\\t}\\n\\t\\t} else if (static_lenb === opt_lenb) {\\n\\t\\t\\tsend_bits((STATIC_TREES << 1) + eof, 3);\\n\\t\\t\\tcompress_block(static_ltree, static_dtree);\\n\\t\\t} else {\\n\\t\\t\\tsend_bits((DYN_TREES << 1) + eof, 3);\\n\\t\\t\\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\\n\\t\\t\\tcompress_block(dyn_ltree, dyn_dtree);\\n\\t\\t}\\n\\n\\t\\tinit_block();\\n\\n\\t\\tif (eof !== 0) {\\n\\t\\t\\tbi_windup();\\n\\t\\t}\\n\\t}\",\n \"function bi_windup(s) {\\n if (s.bi_valid > 8) {\\n put_short(s, s.bi_buf);\\n } else if (s.bi_valid > 0) {\\n //put_byte(s, (Byte)s->bi_buf);\\n s.pending_buf[s.pending++] = s.bi_buf;\\n }\\n\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n }\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\",\n \"function bi_flush(s) {\\n if (s.bi_valid === 16) {\\n put_short(s, s.bi_buf);\\n s.bi_buf = 0;\\n s.bi_valid = 0;\\n\\n } else if (s.bi_valid >= 8) {\\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\\n s.bi_buf >>= 8;\\n s.bi_valid -= 8;\\n }\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.528871","0.52563787","0.52494574","0.52383506","0.51888853","0.51388097","0.5121298","0.51076716","0.51043904","0.51043904","0.51043904","0.51043904","0.51019776","0.50877845","0.50877845","0.50877845","0.50877845","0.50877845","0.50877845","0.50877845","0.50877845","0.50877845","0.5085012","0.5068875","0.5067823","0.50653714","0.506111","0.50489306","0.503946","0.5036662","0.50321656","0.5026489","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727","0.5020727"],"string":"[\n \"0.528871\",\n \"0.52563787\",\n \"0.52494574\",\n \"0.52383506\",\n \"0.51888853\",\n \"0.51388097\",\n \"0.5121298\",\n \"0.51076716\",\n \"0.51043904\",\n \"0.51043904\",\n \"0.51043904\",\n \"0.51043904\",\n \"0.51019776\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.50877845\",\n \"0.5085012\",\n \"0.5068875\",\n \"0.5067823\",\n \"0.50653714\",\n \"0.506111\",\n \"0.50489306\",\n \"0.503946\",\n \"0.5036662\",\n \"0.50321656\",\n \"0.5026489\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\",\n \"0.5020727\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81760,"cells":{"query":{"kind":"string","value":"=========================================================================== Determine the best encoding for the current block: dynamic trees, static trees or store, and output the encoded block to the zip file."},"document":{"kind":"string","value":"function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len+3+7) >>> 3;\n static_lenb = (s.static_len+3+7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len+4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES<<1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES<<1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code+1, s.d_desc.max_code+1, max_blindex+1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function flush_block(eof) { // true if this is the last block for a file\n\t\tvar opt_lenb, static_lenb, // opt_len and static_len in bytes\n\t\t\tmax_blindex, // index of last bit length code of non zero freq\n\t\t\tstored_len, // length of input block\n\t\t\ti;\n\n\t\tstored_len = strstart - block_start;\n\t\tflag_buf[last_flags] = flags; // Save the flags for the last 8 items\n\n\t\t// Construct the literal and distance trees\n\t\tbuild_tree(l_desc);\n\t\t// Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\n\t\tbuild_tree(d_desc);\n\t\t// Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\t\t// At this point, opt_len and static_len are the total bit lengths of\n\t\t// the compressed block data, excluding the tree representations.\n\n\t\t// Build the bit length tree for the above two trees, and get the index\n\t\t// in bl_order of the last bit length code to send.\n\t\tmax_blindex = build_bl_tree();\n\n\t // Determine the best encoding. Compute first the block length in bytes\n\t\topt_lenb = (opt_len + 3 + 7) >> 3;\n\t\tstatic_lenb = (static_len + 3 + 7) >> 3;\n\n\t// Trace((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \", opt_lenb, encoder->opt_len, static_lenb, encoder->static_len, stored_len, encoder->last_lit, encoder->last_dist));\n\n\t\tif (static_lenb <= opt_lenb) {\n\t\t\topt_lenb = static_lenb;\n\t\t}\n\t\tif (stored_len + 4 <= opt_lenb && block_start >= 0) { // 4: two words for the lengths\n\t\t\t// The test buf !== NULL is only necessary if LIT_BUFSIZE > WSIZE.\n\t\t\t// Otherwise we can't have processed more than WSIZE input bytes since\n\t\t\t// the last block flush, because compression would have been\n\t\t\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n\t\t\t// transform a block into a stored block.\n\t\t\tsend_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */\n\t\t\tbi_windup(); /* align on byte boundary */\n\t\t\tput_short(stored_len);\n\t\t\tput_short(~stored_len);\n\n\t\t\t// copy block\n\t\t\t/*\n\t\t\t\tp = &window[block_start];\n\t\t\t\tfor (i = 0; i < stored_len; i++) {\n\t\t\t\t\tput_byte(p[i]);\n\t\t\t\t}\n\t\t\t*/\n\t\t\tfor (i = 0; i < stored_len; i++) {\n\t\t\t\tput_byte(window[block_start + i]);\n\t\t\t}\n\t\t} else if (static_lenb === opt_lenb) {\n\t\t\tsend_bits((STATIC_TREES << 1) + eof, 3);\n\t\t\tcompress_block(static_ltree, static_dtree);\n\t\t} else {\n\t\t\tsend_bits((DYN_TREES << 1) + eof, 3);\n\t\t\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\n\t\t\tcompress_block(dyn_ltree, dyn_dtree);\n\t\t}\n\n\t\tinit_block();\n\n\t\tif (eof !== 0) {\n\t\t\tbi_windup();\n\t\t}\n\t}","function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n init_block(s);\n\n if (last) {\n bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n let max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb; \n }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN$1) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n}","function _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n {\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n }","function $AvaN$var$_tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === $AvaN$var$Z_UNKNOWN) {\n s.strm.data_type = $AvaN$var$detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n $AvaN$var$build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n $AvaN$var$build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = $AvaN$var$build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n $AvaN$var$_tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === $AvaN$var$Z_FIXED || static_lenb === opt_lenb) {\n $AvaN$var$send_bits(s, ($AvaN$var$STATIC_TREES << 1) + (last ? 1 : 0), 3);\n $AvaN$var$compress_block(s, $AvaN$var$static_ltree, $AvaN$var$static_dtree);\n } else {\n $AvaN$var$send_bits(s, ($AvaN$var$DYN_TREES << 1) + (last ? 1 : 0), 3);\n $AvaN$var$send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n $AvaN$var$compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n $AvaN$var$init_block(s);\n\n if (last) {\n $AvaN$var$bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n}","function _tr_flush_block(s, buf, stored_len, last)\n //DeflateState *s;\n //charf *buf; /* input block, or NULL if too old */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n \n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n \n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n \n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n \n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n \n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n \n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n \n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n \n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n \n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n \n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n \n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n \n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n \n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n \n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n \n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n }","function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n //charf *buf; /* input block, or NULL if too old */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n init_block(s);\n\n if (last) {\n bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n }","function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\n //charf *buf; /* input block, or NULL if too old */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {\n var opt_lenb, static_lenb;\n /* opt_len and static_len in bytes */\n\n var max_blindex = 0;\n /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n\n if (s.level > 0) {\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN) {\n s.strm.data_type = detect_data_type(s);\n }\n /* Construct the literal and distance trees */\n\n\n build_tree(s, s.l_desc); // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc); // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n\n max_blindex = build_bl_tree(s);\n /* Determine the best encoding. Compute the block lengths in bytes. */\n\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) {\n opt_lenb = static_lenb;\n }\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5;\n /* force a stored block */\n }\n\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block(s, buf, stored_len, last);\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n } // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n\n\n init_block(s);\n\n if (last) {\n bi_windup(s);\n } // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n\n }","function _tr_flush_block(s,buf,stored_len,last)//DeflateState *s;\n //charf *buf; /* input block, or NULL if too old */\n //ulg stored_len; /* length of input block */\n //int last; /* one if this is the last block for a file */\n {var opt_lenb,static_lenb;/* opt_len and static_len in bytes */var max_blindex=0;/* index of last bit length code of non zero freq */ /* Build the Huffman trees unless a stored block is forced */if(s.level>0){/* Check if the file is binary or text */if(s.strm.data_type===Z_UNKNOWN){s.strm.data_type=detect_data_type(s);}/* Construct the literal and distance trees */build_tree(s,s.l_desc);// Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n build_tree(s,s.d_desc);// Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */ /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */max_blindex=build_bl_tree(s);/* Determine the best encoding. Compute the block lengths in bytes. */opt_lenb=s.opt_len+3+7>>>3;static_lenb=s.static_len+3+7>>>3;// Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n if(static_lenb<=opt_lenb){opt_lenb=static_lenb;}}else {// Assert(buf != (char*)0, \"lost buf\");\n opt_lenb=static_lenb=stored_len+5;/* force a stored block */}if(stored_len+4<=opt_lenb&&buf!==-1){/* 4: two words for the lengths */ /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */_tr_stored_block(s,buf,stored_len,last);}else if(s.strategy===Z_FIXED||static_lenb===opt_lenb){send_bits(s,(STATIC_TREES<<1)+(last?1:0),3);compress_block(s,static_ltree,static_dtree);}else {send_bits(s,(DYN_TREES<<1)+(last?1:0),3);send_all_trees(s,s.l_desc.max_code+1,s.d_desc.max_code+1,max_blindex+1);compress_block(s,s.dyn_ltree,s.dyn_dtree);}// Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */init_block(s);if(last){bi_windup(s);}// Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n }","function _tr_flush_block(s, buf, stored_len, last)\n\t//DeflateState *s;\n\t//charf *buf; /* input block, or NULL if too old */\n\t//ulg stored_len; /* length of input block */\n\t//int last; /* one if this is the last block for a file */\n\t{\n\t var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n\t var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n\t /* Build the Huffman trees unless a stored block is forced */\n\t if (s.level > 0) {\n\n\t /* Check if the file is binary or text */\n\t if (s.strm.data_type === Z_UNKNOWN) {\n\t s.strm.data_type = detect_data_type(s);\n\t }\n\n\t /* Construct the literal and distance trees */\n\t build_tree(s, s.l_desc);\n\t // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n\t // s->static_len));\n\n\t build_tree(s, s.d_desc);\n\t // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n\t // s->static_len));\n\t /* At this point, opt_len and static_len are the total bit lengths of\n\t * the compressed block data, excluding the tree representations.\n\t */\n\n\t /* Build the bit length tree for the above two trees, and get the index\n\t * in bl_order of the last bit length code to send.\n\t */\n\t max_blindex = build_bl_tree(s);\n\n\t /* Determine the best encoding. Compute the block lengths in bytes. */\n\t opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n\t static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n\t // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n\t // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n\t // s->last_lit));\n\n\t if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n\t } else {\n\t // Assert(buf != (char*)0, \"lost buf\");\n\t opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n\t }\n\n\t if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n\t /* 4: two words for the lengths */\n\n\t /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n\t * Otherwise we can't have processed more than WSIZE input bytes since\n\t * the last block flush, because compression would have been\n\t * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n\t * transform a block into a stored block.\n\t */\n\t _tr_stored_block(s, buf, stored_len, last);\n\n\t } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n\t send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n\t compress_block(s, static_ltree, static_dtree);\n\n\t } else {\n\t send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n\t send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n\t compress_block(s, s.dyn_ltree, s.dyn_dtree);\n\t }\n\t // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\t /* The above check is made mod 2^32, for files larger than 512 MB\n\t * and uLong implemented on 32 bits.\n\t */\n\t init_block(s);\n\n\t if (last) {\n\t bi_windup(s);\n\t }\n\t // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n\t // s->compressed_len-7*last));\n\t}","function _tr_flush_block(s, buf, stored_len, last)\n\t//DeflateState *s;\n\t//charf *buf; /* input block, or NULL if too old */\n\t//ulg stored_len; /* length of input block */\n\t//int last; /* one if this is the last block for a file */\n\t{\n\t var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n\t var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n\t /* Build the Huffman trees unless a stored block is forced */\n\t if (s.level > 0) {\n\n\t /* Check if the file is binary or text */\n\t if (s.strm.data_type === Z_UNKNOWN) {\n\t s.strm.data_type = detect_data_type(s);\n\t }\n\n\t /* Construct the literal and distance trees */\n\t build_tree(s, s.l_desc);\n\t // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n\t // s->static_len));\n\n\t build_tree(s, s.d_desc);\n\t // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n\t // s->static_len));\n\t /* At this point, opt_len and static_len are the total bit lengths of\n\t * the compressed block data, excluding the tree representations.\n\t */\n\n\t /* Build the bit length tree for the above two trees, and get the index\n\t * in bl_order of the last bit length code to send.\n\t */\n\t max_blindex = build_bl_tree(s);\n\n\t /* Determine the best encoding. Compute the block lengths in bytes. */\n\t opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n\t static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n\t // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n\t // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n\t // s->last_lit));\n\n\t if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n\t } else {\n\t // Assert(buf != (char*)0, \"lost buf\");\n\t opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n\t }\n\n\t if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n\t /* 4: two words for the lengths */\n\n\t /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n\t * Otherwise we can't have processed more than WSIZE input bytes since\n\t * the last block flush, because compression would have been\n\t * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n\t * transform a block into a stored block.\n\t */\n\t _tr_stored_block(s, buf, stored_len, last);\n\n\t } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n\t send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n\t compress_block(s, static_ltree, static_dtree);\n\n\t } else {\n\t send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n\t send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n\t compress_block(s, s.dyn_ltree, s.dyn_dtree);\n\t }\n\t // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n\t /* The above check is made mod 2^32, for files larger than 512 MB\n\t * and uLong implemented on 32 bits.\n\t */\n\t init_block(s);\n\n\t if (last) {\n\t bi_windup(s);\n\t }\n\t // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n\t // s->compressed_len-7*last));\n\t}"],"string":"[\n \"function flush_block(eof) { // true if this is the last block for a file\\n\\t\\tvar opt_lenb, static_lenb, // opt_len and static_len in bytes\\n\\t\\t\\tmax_blindex, // index of last bit length code of non zero freq\\n\\t\\t\\tstored_len, // length of input block\\n\\t\\t\\ti;\\n\\n\\t\\tstored_len = strstart - block_start;\\n\\t\\tflag_buf[last_flags] = flags; // Save the flags for the last 8 items\\n\\n\\t\\t// Construct the literal and distance trees\\n\\t\\tbuild_tree(l_desc);\\n\\t\\t// Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\n\\t\\tbuild_tree(d_desc);\\n\\t\\t// Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\t\\t// At this point, opt_len and static_len are the total bit lengths of\\n\\t\\t// the compressed block data, excluding the tree representations.\\n\\n\\t\\t// Build the bit length tree for the above two trees, and get the index\\n\\t\\t// in bl_order of the last bit length code to send.\\n\\t\\tmax_blindex = build_bl_tree();\\n\\n\\t // Determine the best encoding. Compute first the block length in bytes\\n\\t\\topt_lenb = (opt_len + 3 + 7) >> 3;\\n\\t\\tstatic_lenb = (static_len + 3 + 7) >> 3;\\n\\n\\t// Trace((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \\\", opt_lenb, encoder->opt_len, static_lenb, encoder->static_len, stored_len, encoder->last_lit, encoder->last_dist));\\n\\n\\t\\tif (static_lenb <= opt_lenb) {\\n\\t\\t\\topt_lenb = static_lenb;\\n\\t\\t}\\n\\t\\tif (stored_len + 4 <= opt_lenb && block_start >= 0) { // 4: two words for the lengths\\n\\t\\t\\t// The test buf !== NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n\\t\\t\\t// Otherwise we can't have processed more than WSIZE input bytes since\\n\\t\\t\\t// the last block flush, because compression would have been\\n\\t\\t\\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n\\t\\t\\t// transform a block into a stored block.\\n\\t\\t\\tsend_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */\\n\\t\\t\\tbi_windup(); /* align on byte boundary */\\n\\t\\t\\tput_short(stored_len);\\n\\t\\t\\tput_short(~stored_len);\\n\\n\\t\\t\\t// copy block\\n\\t\\t\\t/*\\n\\t\\t\\t\\tp = &window[block_start];\\n\\t\\t\\t\\tfor (i = 0; i < stored_len; i++) {\\n\\t\\t\\t\\t\\tput_byte(p[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t\\tfor (i = 0; i < stored_len; i++) {\\n\\t\\t\\t\\tput_byte(window[block_start + i]);\\n\\t\\t\\t}\\n\\t\\t} else if (static_lenb === opt_lenb) {\\n\\t\\t\\tsend_bits((STATIC_TREES << 1) + eof, 3);\\n\\t\\t\\tcompress_block(static_ltree, static_dtree);\\n\\t\\t} else {\\n\\t\\t\\tsend_bits((DYN_TREES << 1) + eof, 3);\\n\\t\\t\\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\\n\\t\\t\\tcompress_block(dyn_ltree, dyn_dtree);\\n\\t\\t}\\n\\n\\t\\tinit_block();\\n\\n\\t\\tif (eof !== 0) {\\n\\t\\t\\tbi_windup();\\n\\t\\t}\\n\\t}\",\n \"function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb;\\n /* opt_len and static_len in bytes */\\n\\n var max_blindex = 0;\\n /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n\\n if (s.level > 0) {\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n /* Construct the literal and distance trees */\\n\\n\\n build_tree(s, s.l_desc); // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc); // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n\\n max_blindex = build_bl_tree(s);\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5;\\n /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n } // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n\\n\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n } // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n let max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb; \\n }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN$1) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n//DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n {\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n\\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n\\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n }\",\n \"function $AvaN$var$_tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\\n//charf *buf; /* input block, or NULL if too old */\\n//ulg stored_len; /* length of input block */\\n//int last; /* one if this is the last block for a file */\\n{\\n var opt_lenb, static_lenb;\\n /* opt_len and static_len in bytes */\\n\\n var max_blindex = 0;\\n /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n\\n if (s.level > 0) {\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === $AvaN$var$Z_UNKNOWN) {\\n s.strm.data_type = $AvaN$var$detect_data_type(s);\\n }\\n /* Construct the literal and distance trees */\\n\\n\\n $AvaN$var$build_tree(s, s.l_desc); // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n $AvaN$var$build_tree(s, s.d_desc); // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n\\n max_blindex = $AvaN$var$build_bl_tree(s);\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5;\\n /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n $AvaN$var$_tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === $AvaN$var$Z_FIXED || static_lenb === opt_lenb) {\\n $AvaN$var$send_bits(s, ($AvaN$var$STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n $AvaN$var$compress_block(s, $AvaN$var$static_ltree, $AvaN$var$static_dtree);\\n } else {\\n $AvaN$var$send_bits(s, ($AvaN$var$DYN_TREES << 1) + (last ? 1 : 0), 3);\\n $AvaN$var$send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n $AvaN$var$compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n } // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n\\n\\n $AvaN$var$init_block(s);\\n\\n if (last) {\\n $AvaN$var$bi_windup(s);\\n } // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n\\n}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n //DeflateState *s;\\n //charf *buf; /* input block, or NULL if too old */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {\\n var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n var max_blindex = 0; /* index of last bit length code of non zero freq */\\n \\n /* Build the Huffman trees unless a stored block is forced */\\n if (s.level > 0) {\\n \\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n \\n /* Construct the literal and distance trees */\\n build_tree(s, s.l_desc);\\n // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n \\n build_tree(s, s.d_desc);\\n // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n \\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n max_blindex = build_bl_tree(s);\\n \\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n static_lenb = (s.static_len + 3 + 7) >>> 3;\\n \\n // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n \\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n \\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n }\\n \\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n /* 4: two words for the lengths */\\n \\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n \\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n \\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n \\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n }\\n // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n init_block(s);\\n \\n if (last) {\\n bi_windup(s);\\n }\\n // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n }\",\n \"function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\\n //charf *buf; /* input block, or NULL if too old */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {\\n var opt_lenb, static_lenb;\\n /* opt_len and static_len in bytes */\\n\\n var max_blindex = 0;\\n /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n\\n if (s.level > 0) {\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n /* Construct the literal and distance trees */\\n\\n\\n build_tree(s, s.l_desc); // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc); // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n\\n max_blindex = build_bl_tree(s);\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5;\\n /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n } // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n\\n\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n } // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n\\n }\",\n \"function _tr_flush_block(s, buf, stored_len, last) //DeflateState *s;\\n //charf *buf; /* input block, or NULL if too old */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {\\n var opt_lenb, static_lenb;\\n /* opt_len and static_len in bytes */\\n\\n var max_blindex = 0;\\n /* index of last bit length code of non zero freq */\\n\\n /* Build the Huffman trees unless a stored block is forced */\\n\\n if (s.level > 0) {\\n /* Check if the file is binary or text */\\n if (s.strm.data_type === Z_UNKNOWN) {\\n s.strm.data_type = detect_data_type(s);\\n }\\n /* Construct the literal and distance trees */\\n\\n\\n build_tree(s, s.l_desc); // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n build_tree(s, s.d_desc); // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */\\n\\n /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */\\n\\n max_blindex = build_bl_tree(s);\\n /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\n opt_lenb = s.opt_len + 3 + 7 >>> 3;\\n static_lenb = s.static_len + 3 + 7 >>> 3; // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n\\n if (static_lenb <= opt_lenb) {\\n opt_lenb = static_lenb;\\n }\\n } else {\\n // Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb = static_lenb = stored_len + 5;\\n /* force a stored block */\\n }\\n\\n if (stored_len + 4 <= opt_lenb && buf !== -1) {\\n /* 4: two words for the lengths */\\n\\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */\\n _tr_stored_block(s, buf, stored_len, last);\\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n compress_block(s, static_ltree, static_dtree);\\n } else {\\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n } // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */\\n\\n\\n init_block(s);\\n\\n if (last) {\\n bi_windup(s);\\n } // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n\\n }\",\n \"function _tr_flush_block(s,buf,stored_len,last)//DeflateState *s;\\n //charf *buf; /* input block, or NULL if too old */\\n //ulg stored_len; /* length of input block */\\n //int last; /* one if this is the last block for a file */\\n {var opt_lenb,static_lenb;/* opt_len and static_len in bytes */var max_blindex=0;/* index of last bit length code of non zero freq */ /* Build the Huffman trees unless a stored block is forced */if(s.level>0){/* Check if the file is binary or text */if(s.strm.data_type===Z_UNKNOWN){s.strm.data_type=detect_data_type(s);}/* Construct the literal and distance trees */build_tree(s,s.l_desc);// Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n build_tree(s,s.d_desc);// Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n // s->static_len));\\n /* At this point, opt_len and static_len are the total bit lengths of\\n * the compressed block data, excluding the tree representations.\\n */ /* Build the bit length tree for the above two trees, and get the index\\n * in bl_order of the last bit length code to send.\\n */max_blindex=build_bl_tree(s);/* Determine the best encoding. Compute the block lengths in bytes. */opt_lenb=s.opt_len+3+7>>>3;static_lenb=s.static_len+3+7>>>3;// Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n // s->last_lit));\\n if(static_lenb<=opt_lenb){opt_lenb=static_lenb;}}else {// Assert(buf != (char*)0, \\\"lost buf\\\");\\n opt_lenb=static_lenb=stored_len+5;/* force a stored block */}if(stored_len+4<=opt_lenb&&buf!==-1){/* 4: two words for the lengths */ /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n * Otherwise we can't have processed more than WSIZE input bytes since\\n * the last block flush, because compression would have been\\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n * transform a block into a stored block.\\n */_tr_stored_block(s,buf,stored_len,last);}else if(s.strategy===Z_FIXED||static_lenb===opt_lenb){send_bits(s,(STATIC_TREES<<1)+(last?1:0),3);compress_block(s,static_ltree,static_dtree);}else {send_bits(s,(DYN_TREES<<1)+(last?1:0),3);send_all_trees(s,s.l_desc.max_code+1,s.d_desc.max_code+1,max_blindex+1);compress_block(s,s.dyn_ltree,s.dyn_dtree);}// Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n /* The above check is made mod 2^32, for files larger than 512 MB\\n * and uLong implemented on 32 bits.\\n */init_block(s);if(last){bi_windup(s);}// Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n // s->compressed_len-7*last));\\n }\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n\\t//DeflateState *s;\\n\\t//charf *buf; /* input block, or NULL if too old */\\n\\t//ulg stored_len; /* length of input block */\\n\\t//int last; /* one if this is the last block for a file */\\n\\t{\\n\\t var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n\\t var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n\\t /* Build the Huffman trees unless a stored block is forced */\\n\\t if (s.level > 0) {\\n\\n\\t /* Check if the file is binary or text */\\n\\t if (s.strm.data_type === Z_UNKNOWN) {\\n\\t s.strm.data_type = detect_data_type(s);\\n\\t }\\n\\n\\t /* Construct the literal and distance trees */\\n\\t build_tree(s, s.l_desc);\\n\\t // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n\\t // s->static_len));\\n\\n\\t build_tree(s, s.d_desc);\\n\\t // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n\\t // s->static_len));\\n\\t /* At this point, opt_len and static_len are the total bit lengths of\\n\\t * the compressed block data, excluding the tree representations.\\n\\t */\\n\\n\\t /* Build the bit length tree for the above two trees, and get the index\\n\\t * in bl_order of the last bit length code to send.\\n\\t */\\n\\t max_blindex = build_bl_tree(s);\\n\\n\\t /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\t opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n\\t static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n\\t // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n\\t // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n\\t // s->last_lit));\\n\\n\\t if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n\\t } else {\\n\\t // Assert(buf != (char*)0, \\\"lost buf\\\");\\n\\t opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n\\t }\\n\\n\\t if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n\\t /* 4: two words for the lengths */\\n\\n\\t /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n\\t * Otherwise we can't have processed more than WSIZE input bytes since\\n\\t * the last block flush, because compression would have been\\n\\t * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n\\t * transform a block into a stored block.\\n\\t */\\n\\t _tr_stored_block(s, buf, stored_len, last);\\n\\n\\t } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n\\t send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n\\t compress_block(s, static_ltree, static_dtree);\\n\\n\\t } else {\\n\\t send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n\\t send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n\\t compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n\\t }\\n\\t // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\t /* The above check is made mod 2^32, for files larger than 512 MB\\n\\t * and uLong implemented on 32 bits.\\n\\t */\\n\\t init_block(s);\\n\\n\\t if (last) {\\n\\t bi_windup(s);\\n\\t }\\n\\t // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n\\t // s->compressed_len-7*last));\\n\\t}\",\n \"function _tr_flush_block(s, buf, stored_len, last)\\n\\t//DeflateState *s;\\n\\t//charf *buf; /* input block, or NULL if too old */\\n\\t//ulg stored_len; /* length of input block */\\n\\t//int last; /* one if this is the last block for a file */\\n\\t{\\n\\t var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\\n\\t var max_blindex = 0; /* index of last bit length code of non zero freq */\\n\\n\\t /* Build the Huffman trees unless a stored block is forced */\\n\\t if (s.level > 0) {\\n\\n\\t /* Check if the file is binary or text */\\n\\t if (s.strm.data_type === Z_UNKNOWN) {\\n\\t s.strm.data_type = detect_data_type(s);\\n\\t }\\n\\n\\t /* Construct the literal and distance trees */\\n\\t build_tree(s, s.l_desc);\\n\\t // Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\", s->opt_len,\\n\\t // s->static_len));\\n\\n\\t build_tree(s, s.d_desc);\\n\\t // Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\", s->opt_len,\\n\\t // s->static_len));\\n\\t /* At this point, opt_len and static_len are the total bit lengths of\\n\\t * the compressed block data, excluding the tree representations.\\n\\t */\\n\\n\\t /* Build the bit length tree for the above two trees, and get the index\\n\\t * in bl_order of the last bit length code to send.\\n\\t */\\n\\t max_blindex = build_bl_tree(s);\\n\\n\\t /* Determine the best encoding. Compute the block lengths in bytes. */\\n\\t opt_lenb = (s.opt_len + 3 + 7) >>> 3;\\n\\t static_lenb = (s.static_len + 3 + 7) >>> 3;\\n\\n\\t // Tracev((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \\\",\\n\\t // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\\n\\t // s->last_lit));\\n\\n\\t if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\\n\\n\\t } else {\\n\\t // Assert(buf != (char*)0, \\\"lost buf\\\");\\n\\t opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\\n\\t }\\n\\n\\t if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\\n\\t /* 4: two words for the lengths */\\n\\n\\t /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n\\t * Otherwise we can't have processed more than WSIZE input bytes since\\n\\t * the last block flush, because compression would have been\\n\\t * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n\\t * transform a block into a stored block.\\n\\t */\\n\\t _tr_stored_block(s, buf, stored_len, last);\\n\\n\\t } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\\n\\n\\t send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\\n\\t compress_block(s, static_ltree, static_dtree);\\n\\n\\t } else {\\n\\t send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\\n\\t send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\\n\\t compress_block(s, s.dyn_ltree, s.dyn_dtree);\\n\\t }\\n\\t // Assert (s->compressed_len == s->bits_sent, \\\"bad compressed size\\\");\\n\\t /* The above check is made mod 2^32, for files larger than 512 MB\\n\\t * and uLong implemented on 32 bits.\\n\\t */\\n\\t init_block(s);\\n\\n\\t if (last) {\\n\\t bi_windup(s);\\n\\t }\\n\\t // Tracev((stderr,\\\"\\\\ncomprlen %lu(%lu) \\\", s->compressed_len>>3,\\n\\t // s->compressed_len-7*last));\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.60858995","0.5848022","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.5814596","0.58138496","0.5806112","0.58060175","0.5751075","0.5742372","0.5683359","0.56025267","0.5537455","0.55365497","0.5500078","0.5500078"],"string":"[\n \"0.60858995\",\n \"0.5848022\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.5814596\",\n \"0.58138496\",\n \"0.5806112\",\n \"0.58060175\",\n \"0.5751075\",\n \"0.5742372\",\n \"0.5683359\",\n \"0.56025267\",\n \"0.5537455\",\n \"0.55365497\",\n \"0.5500078\",\n \"0.5500078\"\n]"},"document_score":{"kind":"string","value":"0.58105415"},"document_rank":{"kind":"string","value":"90"}}},{"rowIdx":81761,"cells":{"query":{"kind":"string","value":"=========================================================================== Save the match info and tally the frequency counts. Return true if the current block must be flushed."},"document":{"kind":"string","value":"function _tr_tally(s, dist, lc)\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //var out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc*2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc]+LITERALS+1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defailts,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize-1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function track(match) {\n return counters[match] = (counters[match] || 0) + 1;\n }","function incrementMatchCount() {\n matchCount += 2;\n}","function checkIfCompleted() {\n matchingCards++;\n\n if (matchingCards >= Math.floor(fieldSize / 2)) {\n gameCompleted = true;\n timerStop();\n gratulation();\n }\n }","function checkWordsRecord() {\n console.log(\"Checking word scores\");\n // Check for new words answered records\n if ( window.wordsAnswered > window.highScores[window.gameMode]['words'] ) {\n console.log(\"New high word score for \" + window.gameMode);\n updateRecord(\"words\");\n return true;\n }\n else {\n return false;\n }\n}","function match() {\n\n\tpairs++;\n\tcount = 0;\n\tdisableCards();\n\tresetCards();\n\tscoreKeeper();\n\n}","writeMatches(pageClock) {\n var dict = {};\n dict[this.matchName] = pageClock.matches;\n chrome.storage.local.set(dict, () => {\n pageClock.debug.debug('Writing matches to storage...');\n if (typeof chrome.runtime.lastError !== 'undefined') {\n console.error(chrome.runtime.lastError);\n }\n });\n }","function _tr_align() {\n\t\t send_bits(STATIC_TREES << 1, 3);\n\t\t send_code(END_BLOCK, StaticTree.static_ltree);\n\t\t bi_flush(); // Of the 10 bits for the empty block, we have already sent\n\t\t // (10 - bi_valid) bits. The lookahead for the last real code (before\n\t\t // the EOB of the previous block) was thus at least one plus the length\n\t\t // of the EOB plus what we have just sent of the empty static block.\n \n\t\t if (1 + last_eob_len + 10 - bi_valid < 9) {\n\t\t\tsend_bits(STATIC_TREES << 1, 3);\n\t\t\tsend_code(END_BLOCK, StaticTree.static_ltree);\n\t\t\tbi_flush();\n\t\t }\n \n\t\t last_eob_len = 7;\n\t\t} // Save the match info and tally the frequency counts. Return true if","function afterMatchFound(result, ctx) {\n\n if(ctx.friendlies.indexOf(result.user.toLowerCase()) > -1) {\n result.relevance += ((1.0 - result.relevance) * 0.5); // up the relevance because it comes from a friendly\n }\n\n if(result.tags.length > 0) { // result.relevance\n console.debug(\"Found relevant match\" + (result.volatile ? \" [VOLATILE]\" : \"\") + \".\");\n console.debug(result.tweetid + \" [\"+result.relevance+\"]: \" + JSON.stringify(result.tags));\n // send through to InfluxDB\n saveTweetToInflux(result)\n } else {\n console.debug(\"Event not found to be relevant.\");\n }\n}","function C007_LunchBreak_Natalie_EatGoodMatch() {\r\n C007_LunchBreak_Natalie_MatchCount++;\r\n C007_LunchBreak_Natalie_CalcParams();\r\n CurrentTime = CurrentTime + 300000;\r\n}","checkMatch () {\n this.attempts++\n if (this.first === this.second) {\n this.hits++\n this.gameTimer.stopTimerOne()\n this.counter = 0\n this.firstIsflipped = false\n this.secondIsFlipped = false\n this.timerOneIsOn = false\n this.removeTwoPieces()\n this.flipped = 0\n this.first = ''\n this.second = '*'\n if (this.hits === this.max) {\n this.gameTimer.stopGameTimer()\n this.remove(this.max * 2)\n this.button.style.display = 'block'\n this.timeField.textContent = 'Congrats, you have made ' +\n this.attempts + ' attempts and won in ' + (++this.time) + this.seconds\n } else {\n this.focus(0, 100, true)\n }\n }\n }","function updateMatchIds() {\n this.matchIds = [];\n\n var i, len;\n for (i = 0, len = this.blockCounts.length; i < len; i++) {\n if (this.blockCounts[i] === 0) {\n this.matchIds.push(i);\n }\n }\n }","hasData() {\n const keys = this.keystrokeCount\n ? Object.keys(this.keystrokeCount.source)\n : null;\n if (!keys || keys.length === 0) {\n return false;\n }\n\n // delete files that don't have any kpm data\n let foundKpmData = false;\n if (this.keystrokeCount.keystrokes > 0) {\n foundKpmData = true;\n }\n\n // Now remove files that don't have any keystrokes that only\n // have an open or close associated with them. If they have\n // open AND close then it's ok, keep it.\n let keystrokesTally = 0;\n keys.forEach(key => {\n const data = this.keystrokeCount.source[key];\n\n const hasOpen = data.open > 0;\n const hasClose = data.close > 0;\n const hasKeystrokes = data.keystrokes > 0;\n keystrokesTally += data.keystrokes;\n if (\n (hasOpen && !hasClose && !hasKeystrokes) ||\n (hasClose && !hasOpen && !hasKeystrokes)\n ) {\n // delete it, no keystrokes and only an open\n delete this.keystrokeCount.source[key];\n } else if (!foundKpmData && hasOpen && hasClose) {\n foundKpmData = true;\n }\n });\n\n if (\n keystrokesTally > 0 &&\n keystrokesTally !== this.keystrokeCount.keystrokes\n ) {\n // use the keystrokes tally\n foundKpmData = true;\n this.keystrokeCount.keystrokes = keystrokesTally;\n }\n return foundKpmData;\n }","function isAllMatched(){\n \n if(allMatchedCards==16){\n clearInterval(interval);\n var grade= starRating(movesCounter);\n showInfo(grade); \n }\n}","function isLastMatchingPair() {\n return memoryGrid.querySelectorAll('.' + MATCH).length === 16;\n }","function checkForMatch() {\n let isMatch = firstCardFlip.dataset.name === secondCardFlip.dataset.name;\n isMatch ? disableCards() : unflipCards();\n if (isMatch) {\n counter++;\n console.log(\"isMatch: \", counter);\n if (counter === levelMatches) {\n window.location = nextUrl;\n }\n disableCards();\n } else {\n console.log(\"notMatch: \", counter);\n }\n\n}","function checkPointsRecord() {\n console.log(\"Checking point scores\");\n\n // Check new points records\n if ( window.currentScore > window.highScores[window.gameMode]['points'] ) {\n console.log(\"New high point score for \" + window.gameMode);\n updateRecord(\"points\");\n return true;\n }\n else {\n return false;\n }\n}","function isSameCountCheck(mac,count){\n\t\n\tvar tag = count_map[mac];\n\n\tif(tag === undefined){\n\t\ttag = -1;\n\t}\n\n\tif (tag === count){\n\t\tconsole.log('count:' + count + '(mac:' +mac + '):tag='+tag+'is same #### drop');\n\t\treturn true;\n\t}else{\n\t\tcount_map[mac] = count;\n\t\tconsole.log('count:' + count + '(mac:' +mac + '):tag='+tag +' @@@@ save' );\n\t\treturn false;\n\t}\n}","function matched() {\n deck.find('.open').addClass('match');\n setTimeout(function() {\n deck.find('.match').removeClass('open');\n }, 500);\n matchCards++;\n matchedCards = [];\n}","function matchSuccess() {\n matchCard1.addClass(\"animated pulse matched\");\n matchCard2.addClass(\"animated pulse matched\");\n matches++;\n if (matches === pairs) {\n setTimeout(gameOver, 500);\n }\n }","function quiescent() {\n return Object.keys(self.persistences).length ===\n self.lastObservedSize;\n }","function saveDoneBlock() {\n\n let blockAlreadyInserted = false;\n for (let i = 0; i < playerLevelEnvironment.listOfBlocksInThePlayingArea.length; i++) {\n if (playerLevelEnvironment.listOfBlocksInThePlayingArea[i].blockCounter === playerLevelEnvironment.blockCounter) {\n blockAlreadyInserted = true;\n }\n }\n\n if (blockAlreadyInserted === false) {\n try {\n playerLevelEnvironment.listOfBlocksInThePlayingArea.push({\n blockMap: blockMap[playerLevelEnvironment.blockIndex][playerLevelEnvironment.rotationIndex][playerLevelEnvironment.rotationIndex],\n blockIndex: playerLevelEnvironment.blockIndex,\n blockX: Math.floor(playerLevelEnvironment.xPlayArea / gameLevelEnvironment.pixelSize),\n blockY: Math.floor(playerLevelEnvironment.yPlayArea / gameLevelEnvironment.pixelSize) - 1,\n blockCounter: playerLevelEnvironment.blockCounter,\n wasChecked: false\n });\n } catch(error) {\n }\n }\n }","function flush_block(eof) { // true if this is the last block for a file\n\t\tvar opt_lenb, static_lenb, // opt_len and static_len in bytes\n\t\t\tmax_blindex, // index of last bit length code of non zero freq\n\t\t\tstored_len, // length of input block\n\t\t\ti;\n\n\t\tstored_len = strstart - block_start;\n\t\tflag_buf[last_flags] = flags; // Save the flags for the last 8 items\n\n\t\t// Construct the literal and distance trees\n\t\tbuild_tree(l_desc);\n\t\t// Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\n\t\tbuild_tree(d_desc);\n\t\t// Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\",\n\t\t// encoder->opt_len, encoder->static_len));\n\t\t// At this point, opt_len and static_len are the total bit lengths of\n\t\t// the compressed block data, excluding the tree representations.\n\n\t\t// Build the bit length tree for the above two trees, and get the index\n\t\t// in bl_order of the last bit length code to send.\n\t\tmax_blindex = build_bl_tree();\n\n\t // Determine the best encoding. Compute first the block length in bytes\n\t\topt_lenb = (opt_len + 3 + 7) >> 3;\n\t\tstatic_lenb = (static_len + 3 + 7) >> 3;\n\n\t// Trace((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \", opt_lenb, encoder->opt_len, static_lenb, encoder->static_len, stored_len, encoder->last_lit, encoder->last_dist));\n\n\t\tif (static_lenb <= opt_lenb) {\n\t\t\topt_lenb = static_lenb;\n\t\t}\n\t\tif (stored_len + 4 <= opt_lenb && block_start >= 0) { // 4: two words for the lengths\n\t\t\t// The test buf !== NULL is only necessary if LIT_BUFSIZE > WSIZE.\n\t\t\t// Otherwise we can't have processed more than WSIZE input bytes since\n\t\t\t// the last block flush, because compression would have been\n\t\t\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n\t\t\t// transform a block into a stored block.\n\t\t\tsend_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */\n\t\t\tbi_windup(); /* align on byte boundary */\n\t\t\tput_short(stored_len);\n\t\t\tput_short(~stored_len);\n\n\t\t\t// copy block\n\t\t\t/*\n\t\t\t\tp = &window[block_start];\n\t\t\t\tfor (i = 0; i < stored_len; i++) {\n\t\t\t\t\tput_byte(p[i]);\n\t\t\t\t}\n\t\t\t*/\n\t\t\tfor (i = 0; i < stored_len; i++) {\n\t\t\t\tput_byte(window[block_start + i]);\n\t\t\t}\n\t\t} else if (static_lenb === opt_lenb) {\n\t\t\tsend_bits((STATIC_TREES << 1) + eof, 3);\n\t\t\tcompress_block(static_ltree, static_dtree);\n\t\t} else {\n\t\t\tsend_bits((DYN_TREES << 1) + eof, 3);\n\t\t\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\n\t\t\tcompress_block(dyn_ltree, dyn_dtree);\n\t\t}\n\n\t\tinit_block();\n\n\t\tif (eof !== 0) {\n\t\t\tbi_windup();\n\t\t}\n\t}","function checkIfCompleted() {\n if (_progress > 102) {\n _recording = false;\n $(\"#overLayMessage\").text(\"YOU CREATED A LEVEL\");\n $(\"#recordButt\").css(\"visibility\", \"hidden\");\n $(\"#restartButt2\").css(\"display\", \"block\");\n $(\"#saveButt\").css(\"display\", \"block\");\n console.log(_keyStrokes.length);\n }\n }","function resetMatchCount() {\n matchCount = 0;\n}","function isMatch () {\n\n\tif(cardsInPlay[0] === cardsInPlay[1])\n\t\t{\n\t\talert('You found a match');\n\t\tscore=score+1;\n\t\tnumberOfLives=numberOfLives-1;\n\t\tupdateLives();\n\t\tupdateScore(score);\n\t\tsetTimeout(clearCard(),10000);\n\t\t\n\t\t}\n\telse {\n\t\talert('Sorry Try Again');\n\t\tsetTimeout(clearCard(),10000);\n\t\tnumberOfLives=numberOfLives-1;\n\t\tupdateLives();\n\t\t\n\t\t}\n\t\t\n\t\t\n\t}","update() {\n this._updated = true;\n let now = new Date().getTime();\n if (now > this._lastDumpTime + this._interval) {\n try {\n this.dump();\n }\n catch (ex) {\n // Todo: decide what to do\n }\n }\n }","function GotEverything() {\n return entryInfo.entries.length >= entryInfo.totalCount;\n }","function saveMatchFile()\n{\n var fileData = header;\n \n for(var allianceIndex = 0; allianceIndex < $alliance.length; allianceIndex++)\n {\n for(var teamIndex = 0; teamIndex < $alliance[allianceIndex].length; teamIndex++)\n {\n // Team number\n fileData += $alliance[allianceIndex][teamIndex].value + \",\";\n \n // Auto data\n fileData += autoData[allianceIndex][teamIndex].high + \",\";\n fileData += autoData[allianceIndex][teamIndex].low + \",\";\n fileData += autoData[allianceIndex][teamIndex].hotHigh + \",\";\n fileData += autoData[allianceIndex][teamIndex].hotLow + \",\";\n fileData += autoData[allianceIndex][teamIndex].highAttempts + \",\";\n \n // Teleop data\n fileData += teleopData[allianceIndex][teamIndex].high + \",\";\n fileData += teleopData[allianceIndex][teamIndex].low + \",\";\n fileData += teleopData[allianceIndex][teamIndex].passes + \",\";\n fileData += teleopData[allianceIndex][teamIndex].truss + \",\";\n fileData += teleopData[allianceIndex][teamIndex].highAttempts + \",\";\n fileData += teleopData[allianceIndex][teamIndex].trussAttempts + \",\";\n \n // Tag data\n fileData += tags[allianceIndex][teamIndex].offensive + \",\";\n fileData += tags[allianceIndex][teamIndex].offensiveSuccess + \",\";\n fileData += tags[allianceIndex][teamIndex].defensive + \",\";\n fileData += tags[allianceIndex][teamIndex].defensiveSuccess + \",\";\n fileData += tags[allianceIndex][teamIndex].broken + \",\";\n fileData += tags[allianceIndex][teamIndex].canCatch + \",\";\n fileData += tags[allianceIndex][teamIndex].looseGrip + \",\";\n fileData += tags[allianceIndex][teamIndex].twoBallAuto + \",\";\n fileData += tags[allianceIndex][teamIndex].goodWithYou + \",\";\n \n // Comments\n fileData += comments[allianceIndex][teamIndex] + \"\\n\";\n }\n }\n \n writeToFile(fileData, \"Match \" + $matchNumber.value + \".csv\");\n reset();\n}","function deflate_stored(flush) {\n\t\t // Stored blocks are limited to 0xffff bytes, pending_buf is limited\n\t\t // to pending_buf_size, and each stored block has a 5 byte header:\n\t\t var max_block_size = 0xffff;\n\t\t var max_start;\n \n\t\t if (max_block_size > pending_buf_size - 5) {\n\t\t\tmax_block_size = pending_buf_size - 5;\n\t\t } // Copy as much as possible from input to output:\n \n \n\t\t while (true) {\n\t\t\t// Fill the window as much as possible:\n\t\t\tif (lookahead <= 1) {\n\t\t\t fill_window();\n\t\t\t if (lookahead === 0 && flush == Z_NO_FLUSH) return NeedMore;\n\t\t\t if (lookahead === 0) break; // flush the current block\n\t\t\t}\n \n\t\t\tstrstart += lookahead;\n\t\t\tlookahead = 0; // Emit a stored block if pending_buf will be full:\n \n\t\t\tmax_start = block_start + max_block_size;\n \n\t\t\tif (strstart === 0 || strstart >= max_start) {\n\t\t\t // strstart === 0 is possible when wraparound on 16-bit machine\n\t\t\t lookahead = strstart - max_start;\n\t\t\t strstart = max_start;\n\t\t\t flush_block_only(false);\n\t\t\t if (strm.avail_out === 0) return NeedMore;\n\t\t\t} // Flush if we may have to slide, otherwise block_start may become\n\t\t\t// negative and the data will be gone:\n \n \n\t\t\tif (strstart - block_start >= w_size - MIN_LOOKAHEAD) {\n\t\t\t flush_block_only(false);\n\t\t\t if (strm.avail_out === 0) return NeedMore;\n\t\t\t}\n\t\t }\n \n\t\t flush_block_only(flush == Z_FINISH);\n\t\t if (strm.avail_out === 0) return flush == Z_FINISH ? FinishStarted : NeedMore;\n\t\t return flush == Z_FINISH ? FinishDone : BlockDone;\n\t\t}","match(order, priceLevel) {\n const matchingEventList = [];\n let volume = 0;\n\n while (true) {\n const tmpLLOE = this.orderMap.getFirstElementOfPriceLevel(priceLevel);\n if (!tmpLLOE) break; // all orders at this price level are matched\n\n const tradedQuantity = Math.min(order.remainingQuantity(), tmpLLOE.order.remainingQuantity());\n volume += tradedQuantity;\n logger.info(`orderbookside.js: match(): matches counter order id=${tmpLLOE.order._id} with trade quantity=${tradedQuantity}`);\n\n tmpLLOE.order.filledQuantity += tradedQuantity;\n order.filledQuantity += tradedQuantity;\n\n if (tmpLLOE.order.remainingQuantity() <= ZERO) tmpLLOE.order.filledQuantity = tmpLLOE.order.quantity;\n if (order.remainingQuantity() <= ZERO) order.filledQuantity = order.quantity;\n\n matchingEventList.push(OrderBookEvent.createNewMatchObject(tmpLLOE.order, tradedQuantity, tmpLLOE.order.remainingQuantity() <= ZERO));\n\n if (tmpLLOE.order.remainingQuantity() <= ZERO) this.orderMap.removeOrder(tmpLLOE.order);\n if (order.remainingQuantity() <= ZERO) break;\n }\n\n return {\n matchingEventList,\n volume,\n };\n }","function matchCheck() {\n\tif (openedCard[0].lastElementChild.classList.item(1) === openedCard[1].lastElementChild.classList.item(1)){\n\t\topenedCard[0].classList.add('match');\n\t\topenedCard[1].classList.add('match');\n\t\tmatchedCount++;\n\t\topenedCard = []; //to clear the openedCard array...\n\t\tanimationFinished = true;\n\t\t\n\t\tif (matchedCount == 8) {\n\t\tsetTimeout(function(){gameWon()},400); //you won...\n\t\t}\n\t} else {\n\t\tfailedCount ++;\n\t\tstars();\n\t\tsetTimeout(function() {turnBack()},500); //to delay time to turn the card...\n\t}\n}","count(value) {\n let currentState;\n if (this.currentTransactionIndex > -1) {\n currentState = this.applyTransactions();\n } else {\n currentState = this.db;\n }\n\n const keys = Object.keys(currentState);\n let count = 0;\n for (let i = 0; i < keys.length; i++) {\n if (currentState[keys[i]] === value) {\n count++;\n }\n }\n\n if (debug) {\n console.log('db: ', currentState, '\\n');\n }\n return count;\n }","function ifMatching() {\n playAudio(doubleWhip);\n // add match class to both cards\n for (c of open) {\n c.card.classList.add('match', `level${currentLevel}`); // keep cards face up\n }\n matchedPairs += 1;\n // if all pairs are matched, end level with popup\n if (matchedPairs === iconCollections[currentLevel - 1].length) {\n window.clearInterval(interval); // stop timer\n setTimeout(congratsPopup, 700); // delay 0.7 seconds before popup\n }\n resetOpen();\n}","function scoreKeeper() {\n for (i = 0; i < storeAnswers.length; i++) {\n if (storeAnswers[i] === questionsArray[i].answer) {\n correct++;\n console.log(correct);\n } else {\n incorrect++;\n }\n }\n }","function checkStatus() {\n\n for (let card of cards) {\n if (card.classList.contains('match')) {\n counter++;\n console.log(\"counter = \" + counter);\n break;\n }\n }\n if (counter == 8) {\n saveScore();\n displayScore();\n }\n }","function checkMatch(){\n\t\tplay = false;\n\t\tif (checking[0] == checking[1]){\n\t\t\tlet t1 = setTimeout(function(){\n\t\t\t\topenMatched();\n\t\t\t\tplay = true;\n\t\t\t}, 500);\n\t\t\tif (matches <= 7){\n\t\t\t\tmatches++;\t\t\t\t\n\t\t\t}\n\t\t\tif (matches == 8){\n\t\t\t\tlet t2 = setTimeout(function(){\n\t\t\t\t\talert(\"Well Done. Please Play Again!! \\nYou have won in \" + total_time + '\\nUsing ' + moves + ' Moves' + '\\nHaving ' + gstars + ' Stars');\n\t\t\t\t\tupdateCards();\n\t\t\t\t\tplay = true;\n\t\t\t\t}, 500);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tlet t3 = setTimeout(function(){\n\t\t\t\tparents[0].className = 'card';\n\t\t\t\tif (parents[1] != null || parents[1] == undefined){\n\t\t\t\t\tparents[1].className = 'card';\n\t\t\t\t}\n\t\t\t\tplay = true;\n\t\t\t}, 500);\n\t\t}\n}","shouldFlush(sizes, buffer) {\r\n\t\tvar result = \r\n\t\t\t(sizes.vertices + (buffer != null ? buffer.positionsIndex : 0) > this.MAX_BUFFER_SIZE) || \r\n\t\t\t(sizes.indices + (buffer != null ? buffer.indicesIndex : 0) > this.MAX_BUFFER_SIZE * this.indicesVerticesFactor) ||\r\n\t\t\t(sizes.lineIndices + (buffer != null ? buffer.lineIndicesIndex : 0) > this.MAX_BUFFER_SIZE * this.indicesVerticesFactor) ||\r\n\t\t\t(sizes.pickColors + (buffer != null ? buffer.pickColorsIndex : 0) > this.MAX_BUFFER_SIZE * this.colorBufferFactor);\r\n\t\t\r\n\t\t// Not storing the results in a variable resulted in this always returning something that evaluates to false...\r\n\t\t\r\n\t\treturn result;\r\n\t}","function decodeMatch(match, data) {\n rowProcessed = 0; // For debugging\n togglePlayer = 0; // To toggle players between the games.\n var score = [0, 0];\n while(data.length > 0) {\n var set = new Set();\n if (!decodeSet(set, data)) {\n return false;\n }\n // Store the set and the score before the win.\n match.sets.push([[score[0], score[1]], set]);\n score[set.winner]++;\n if (score[0] == 3) {\n match.winner = match.players[0];\n return true;\n } else if (score[1] == 3) {\n match.winner = match.players[1];\n return true;\n }\n }\n // When run out of data, the set winner is the winner of the last set.\n // In case this is a smaller 3 set match.\n match.winner = match.players[match.sets[match.sets.length - 1][1].winner];\n return true;\n}","calculateTrack () {\n if (!this.prevTest.exists) {\n return false;\n }\n\n if (this.prevTest.data().shouldtrack) {\n if (this.testCase.successful) {\n // check how many subsequent passes there have been\n if (this.prevTest.data().subsequentpasses < RESET_SUCCESS_COUNT) {\n return true;\n } else {\n return false;\n }\n } else {\n // the test was previously being tracked and failed, so continue tracking\n return true;\n }\n } else {\n if (this.testCase.successful) {\n // the test is successful and previously untracked, so no need to track\n return false;\n } else if (this.prevTest.data().hasfailed && this.prevTest.data().passed) {\n // the test is currently failing and has failed in a prior run, so track it\n return true;\n } else {\n // this is the first time that the test is failing, so no need to track yet\n return false;\n }\n }\n }","function checkMatch(){\n if(flipOne == flipTwo){\n points += 36;\n console.log('Match!');\n match++;\n }\n else{\n timer = setTimeout(function(){\n eventTarget1.style.transform = 'rotateY(0deg)';\n eventTarget2.style.transform = 'rotateY(0deg)';\n }, 750);\n totalFlips--;\n }\n document.getElementById('points').innerHTML = ' ' + points;\n document.getElementById('attempts').innerHTML = ' ' + totalFlips;\n if(match == totalMatches){\n document.getElementById('id02').style.display = 'block';\n }\n if(totalFlips == 0){\n document.getElementById('id03').style.display = 'block';\n }\n}","function whenSantaFirstEntersBasement() { \n console.time('q = 2 santa-time');\n fs.readFile('./data.txt', (err, data) => {\n const directions = data.toString();\n const directionsArray = directions.split('');\n let accumalator = 0\n let counter = 0\n const answer = directionsArray.some((currentItem) => { \n if(currentItem === '(') { \n accumalator += 1\n } else if(currentItem === ')') { \n accumalator -=1\n }\n counter ++\n return accumalator < 0;\n })\n console.timeEnd('q = 2 santa-time');\n console.log('basement entered at: ',counter);\n })\n}","function checkForPlayed() { // Function that resets the \"played\" counter\n let playedCount = 0; // if all movies are \"played\"\n\n for(i=0; i!=keys.length; i++) {\n if(db[keys[i]].played == true) {\n playedCount++;\n }\n }\n\n if(playedCount == keys.length) {\n for(i=0; i!=keys.length; i++) {\n db[keys[i]].played = false;\n }\n }\n}","function matchCheck(){\n return (points == match);\n }","function deflate_fast(flush) {\n\t\t // short hash_head = 0; // head of the hash chain\n\t\t var hash_head = 0; // head of the hash chain\n \n\t\t var bflush; // set if current block must be flushed\n \n\t\t while (true) {\n\t\t\t// Make sure that we always have enough lookahead, except\n\t\t\t// at the end of the input file. We need MAX_MATCH bytes\n\t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n\t\t\t// string following the next match.\n\t\t\tif (lookahead < MIN_LOOKAHEAD) {\n\t\t\t fill_window();\n \n\t\t\t if (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\n\t\t\t\treturn NeedMore;\n\t\t\t }\n \n\t\t\t if (lookahead === 0) break; // flush the current block\n\t\t\t} // Insert the string window[strstart .. strstart+2] in the\n\t\t\t// dictionary, and set hash_head to the head of the hash chain:\n \n \n\t\t\tif (lookahead >= MIN_MATCH) {\n\t\t\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\n \n\t\t\t hash_head = head[ins_h] & 0xffff;\n\t\t\t prev[strstart & w_mask] = head[ins_h];\n\t\t\t head[ins_h] = strstart;\n\t\t\t} // Find the longest match, discarding those <= prev_length.\n\t\t\t// At this point we have always match_length < MIN_MATCH\n \n \n\t\t\tif (hash_head !== 0 && (strstart - hash_head & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n\t\t\t // To simplify the code, we prevent matches with the string\n\t\t\t // of window index 0 (in particular we have to avoid a match\n\t\t\t // of the string with itself at the start of the input file).\n\t\t\t if (strategy != Z_HUFFMAN_ONLY) {\n\t\t\t\tmatch_length = longest_match(hash_head);\n\t\t\t } // longest_match() sets match_start\n \n\t\t\t}\n \n\t\t\tif (match_length >= MIN_MATCH) {\n\t\t\t // check_match(strstart, match_start, match_length);\n\t\t\t bflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH);\n\t\t\t lookahead -= match_length; // Insert new strings in the hash table only if the match length\n\t\t\t // is not too large. This saves time but degrades compression.\n \n\t\t\t if (match_length <= max_lazy_match && lookahead >= MIN_MATCH) {\n\t\t\t\tmatch_length--; // string at strstart already in hash table\n \n\t\t\t\tdo {\n\t\t\t\t strstart++;\n\t\t\t\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\n \n\t\t\t\t hash_head = head[ins_h] & 0xffff;\n\t\t\t\t prev[strstart & w_mask] = head[ins_h];\n\t\t\t\t head[ins_h] = strstart; // strstart never exceeds WSIZE-MAX_MATCH, so there are\n\t\t\t\t // always MIN_MATCH bytes ahead.\n\t\t\t\t} while (--match_length !== 0);\n \n\t\t\t\tstrstart++;\n\t\t\t } else {\n\t\t\t\tstrstart += match_length;\n\t\t\t\tmatch_length = 0;\n\t\t\t\tins_h = window[strstart] & 0xff;\n\t\t\t\tins_h = (ins_h << hash_shift ^ window[strstart + 1] & 0xff) & hash_mask; // If lookahead < MIN_MATCH, ins_h is garbage, but it does\n\t\t\t\t// not\n\t\t\t\t// matter since it will be recomputed at next deflate call.\n\t\t\t }\n\t\t\t} else {\n\t\t\t // No match, output a literal byte\n\t\t\t bflush = _tr_tally(0, window[strstart] & 0xff);\n\t\t\t lookahead--;\n\t\t\t strstart++;\n\t\t\t}\n \n\t\t\tif (bflush) {\n\t\t\t flush_block_only(false);\n\t\t\t if (strm.avail_out === 0) return NeedMore;\n\t\t\t}\n\t\t }\n \n\t\t flush_block_only(flush == Z_FINISH);\n \n\t\t if (strm.avail_out === 0) {\n\t\t\tif (flush == Z_FINISH) return FinishStarted;else return NeedMore;\n\t\t }\n \n\t\t return flush == Z_FINISH ? FinishDone : BlockDone;\n\t\t} // Same as above, but achieves better compression. We use a lazy","function is_matched(k, v) {\n $('.restart').attr(\"disabled\", false);\n counter += 1;\n if (counter == 1) {\n timer();\n }\n $('.moves').html(counter);\n if (matched_cards.length < 2) {\n // change front img with img to compare\n $('#' + k.id).children().attr('src', 'img/' + v + '.png');\n if (matched_cards.length == 0) {\n matched_cards.push(v);\n memory.push(k.id);\n }\n else if (matched_cards.length == 1) {\n matched_cards.push(v);\n memory.push(k.id);\n if (matched_cards[0] == matched_cards[1]) {\n no_of_matches += 2;\n matched_cards = [];\n memory = [];\n // if all cards are flipped\n if (no_of_matches == cards.length) {\n rating();\n $('.modal').fadeIn().show();\n $('.overlay').show();\n clearInterval(interval);\n }\n }\n //if 2 cards unmatched\n else {\n $('#' + k.id).children().attr('src', 'img/' + matched_cards[1] + '.png');\n setTimeout(rest_unmatched, 1000);\n }\n }\n \n }\n console.log(no_of_matches);\n console.log(counter);\n}","async checkSaves(whisper = false) {\n\t\tthis.saves = new Set();\n\t\tthis.failedSaves = this.item?.hasAttack ? new Set(this.hitTargets) : new Set(this.targets);\n\t\tthis.advantageSaves = new Set();\n\t\tthis.disadvantageSaves = new Set();\n\t\tthis.saveDisplayData = [];\n\t\tif (debugEnabled > 1)\n\t\t\tdebug(`checkSaves: whisper ${whisper} hit targets ${this.hitTargets}`);\n\t\tif (this.hitTargets.size <= 0) {\n\t\t\tthis.saveDisplayFlavor = `${i18n(\"midi-qol-relics.noSaveTargets\")}`;\n\t\t\treturn;\n\t\t}\n\t\tlet rollDC = this.saveItem.data.data.save.DC;\n\t\tif (this.saveItem.getSaveDC) {\n\t\t\trollDC = this.saveItem.getSaveDC(); // TODO see if I need to do this for ammo as well\n\t\t}\n\t\tlet rollAbility = this.saveItem.data.data.save.ability;\n\t\tlet promises = [];\n\t\t//@ts-ignore actor.rollAbilitySave\n\t\tvar rollAction = CONFIG.Actor.documentClass.prototype.rollAbilitySave;\n\t\tvar rollType = \"save\";\n\t\tif (this.saveItem.data.data.actionType === \"abil\") {\n\t\t\trollType = \"abil\";\n\t\t\t//@ts-ignore actor.rollAbilityTest\n\t\t\trollAction = CONFIG.Actor.documentClass.prototype.rollAbilityTest;\n\t\t}\n\t\t// make sure saving throws are renabled.\n\t\tconst playerMonksTB = installedModules.get(\"monks-tokenbar\") && configSettings.playerRollSaves === \"mtb\";\n\t\tlet monkRequests = [];\n\t\tlet showRoll = configSettings.autoCheckSaves === \"allShow\";\n\t\ttry {\n\t\t\tfor (let target of this.hitTargets) {\n\t\t\t\tif (!target.actor)\n\t\t\t\t\tcontinue; // no actor means multi levels or bugged actor - but we won't roll a save\n\t\t\t\tlet advantage = undefined;\n\t\t\t\t// If spell, check for magic resistance\n\t\t\t\tif (this.item.data.type === \"spell\") {\n\t\t\t\t\t// check magic resistance in custom damage reduction traits\n\t\t\t\t\t//@ts-ignore traits\n\t\t\t\t\tadvantage = (target?.actor?.data.data.traits?.dr?.custom || \"\").includes(i18n(\"midi-qol-relics.MagicResistant\"));\n\t\t\t\t\t// check magic resistance as a feature (based on the SRD name as provided by the Relics system)\n\t\t\t\t\tadvantage = advantage || target?.actor?.data.items.find(a => a.type === \"feat\" && a.name === i18n(\"midi-qol-relics.MagicResistanceFeat\")) !== undefined;\n\t\t\t\t\tif (advantage)\n\t\t\t\t\t\tthis.advantageSaves.add(target);\n\t\t\t\t\telse\n\t\t\t\t\t\tadvantage = undefined;\n\t\t\t\t\tif (debugEnabled > 1)\n\t\t\t\t\t\tdebug(`${target.actor.name} resistant to magic : ${advantage}`);\n\t\t\t\t}\n\t\t\t\tif (this.saveItem.data.flags[\"midi-qol-relics\"]?.isConcentrationCheck) {\n\t\t\t\t\tif (getProperty(target.actor.data.flags, \"midi-qol-relics.advantage.concentration\")) {\n\t\t\t\t\t\tadvantage = true;\n\t\t\t\t\t\tthis.advantageSaves.add(target);\n\t\t\t\t\t}\n\t\t\t\t\tif (getProperty(target.actor.data.flags, \"midi-qol-relics.disadvantage.concentration\")) {\n\t\t\t\t\t\tadvantage = false;\n\t\t\t\t\t\tthis.disadvantageSaves.add(target);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tvar player = playerFor(target);\n\t\t\t\tif (!player)\n\t\t\t\t\tplayer = ChatMessage.getWhisperRecipients(\"GM\").find(u => u.active);\n\t\t\t\tlet promptPlayer = (!player?.isGM && configSettings.playerRollSaves !== \"none\");\n\t\t\t\tlet GMprompt;\n\t\t\t\tlet gmMonksTB;\n\t\t\t\tif (player?.isGM) {\n\t\t\t\t\tconst monksTBSetting = target.document.isLinked ? configSettings.rollNPCLinkedSaves === \"mtb\" : configSettings.rollNPCSaves === \"mtb\";\n\t\t\t\t\tgmMonksTB = installedModules.get(\"monks-tokenbar\") && monksTBSetting;\n\t\t\t\t\tGMprompt = (target.document.isLinked ? configSettings.rollNPCLinkedSaves : configSettings.rollNPCSaves);\n\t\t\t\t\tpromptPlayer = GMprompt !== \"auto\";\n\t\t\t\t}\n\t\t\t\tif ((!player?.isGM && playerMonksTB) || (player?.isGM && gmMonksTB)) {\n\t\t\t\t\tpromises.push(new Promise((resolve) => {\n\t\t\t\t\t\tlet requestId = target.id;\n\t\t\t\t\t\tthis.saveRequests[requestId] = resolve;\n\t\t\t\t\t}));\n\t\t\t\t\t// record the targes to save.\n\t\t\t\t\tmonkRequests.push(target);\n\t\t\t\t}\n\t\t\t\telse if (promptPlayer && player?.active) {\n\t\t\t\t\t//@ts-ignore CONFIG.RELICS\n\t\t\t\t\tif (debugEnabled > 0)\n\t\t\t\t\t\twarn(`Player ${player?.name} controls actor ${target.actor.name} - requesting ${CONFIG.RELICS.abilities[this.saveItem.data.data.save.ability]} save`);\n\t\t\t\t\tpromises.push(new Promise((resolve) => {\n\t\t\t\t\t\tlet requestId = target.actor?.id ?? randomID();\n\t\t\t\t\t\tconst playerId = player?.id;\n\t\t\t\t\t\tif ([\"letme\", \"letmeQuery\"].includes(configSettings.playerRollSaves) && installedModules.get(\"lmrtfy\"))\n\t\t\t\t\t\t\trequestId = randomID();\n\t\t\t\t\t\tif ([\"letme\", \"letmeQuery\"].includes(GMprompt) && installedModules.get(\"lmrtfy\"))\n\t\t\t\t\t\t\trequestId = randomID();\n\t\t\t\t\t\tthis.saveRequests[requestId] = resolve;\n\t\t\t\t\t\trequestPCSave(this.saveItem.data.data.save.ability, rollType, player, target.actor, advantage, this.saveItem.name, rollDC, requestId, GMprompt);\n\t\t\t\t\t\t// set a timeout for taking over the roll\n\t\t\t\t\t\tif (configSettings.playerSaveTimeout > 0) {\n\t\t\t\t\t\t\tthis.saveTimeouts[requestId] = setTimeout(async () => {\n\t\t\t\t\t\t\t\tif (this.saveRequests[requestId]) {\n\t\t\t\t\t\t\t\t\tdelete this.saveRequests[requestId];\n\t\t\t\t\t\t\t\t\tdelete this.saveTimeouts[requestId];\n\t\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\t\tif (!game.user?.isGM && configSettings.autoCheckSaves === \"allShow\") {\n\t\t\t\t\t\t\t\t\t\t// non-gm users don't have permission to create chat cards impersonating the GM so hand the role to a GM client\n\t\t\t\t\t\t\t\t\t\tresult = await socketlibSocket.executeAsGM(\"rollAbility\", {\n\t\t\t\t\t\t\t\t\t\t\ttargetUuid: target.actor?.uuid ?? \"\",\n\t\t\t\t\t\t\t\t\t\t\trequest: rollType,\n\t\t\t\t\t\t\t\t\t\t\tability: this.saveItem.data.data.save.ability,\n\t\t\t\t\t\t\t\t\t\t\tshowRoll,\n\t\t\t\t\t\t\t\t\t\t\toptions: { messageData: { user: playerId }, chatMessage: showRoll, mapKeys: false, advantage: advantage === true, disadvantage: advantage === false, fastForward: true },\n\t\t\t\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\t\t\tresult = await rollAction.bind(target.actor)(this.saveItem.data.data.save.ability, { messageData: { user: playerId }, chatMessage: showRoll, mapKeys: false, advantage: advantage === true, disadvantage: advantage === false, fastForward: true });\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tresolve(result);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}, (configSettings.playerSaveTimeout || 1) * 1000);\n\t\t\t\t\t\t}\n\t\t\t\t\t}));\n\t\t\t\t}\n\t\t\t\telse { // GM to roll save\n\t\t\t\t\t// Find a player owner for the roll if possible\n\t\t\t\t\tlet owner = playerFor(target);\n\t\t\t\t\tif (owner)\n\t\t\t\t\t\tshowRoll = true; // Always show player save rolls\n\t\t\t\t\t// If no player owns the token, find an active GM\n\t\t\t\t\tif (!owner)\n\t\t\t\t\t\towner = game.users?.find((u) => u.isGM && u.active);\n\t\t\t\t\t// Fall back to rolling as the current user\n\t\t\t\t\tif (!owner)\n\t\t\t\t\t\towner = game.user ?? undefined;\n\t\t\t\t\tpromises.push(socketlibSocket.executeAsUser(\"rollAbility\", owner?.id, {\n\t\t\t\t\t\ttargetUuid: target.actor.uuid,\n\t\t\t\t\t\trequest: rollType,\n\t\t\t\t\t\tability: this.saveItem.data.data.save.ability,\n\t\t\t\t\t\tshowRoll,\n\t\t\t\t\t\toptions: { messageData: { user: owner?.id }, chatMessage: showRoll, mapKeys: false, advantage: advantage === true, disadvantage: advantage === false, fastForward: true },\n\t\t\t\t\t}));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (err) {\n\t\t\tconsole.warn(err);\n\t\t}\n\t\tfinally {\n\t\t}\n\t\tif (monkRequests.length > 0) {\n\t\t\tsocketlibSocket.executeAsGM(\"monksTokenBarSaves\", {\n\t\t\t\ttokens: monkRequests.map(t => t.document.uuid),\n\t\t\t\trequest: `save:${this.saveItem.data.data.save.ability}`,\n\t\t\t\tsilent: true,\n\t\t\t\trollMode: \"gmroll\"\n\t\t\t});\n\t\t}\n\t\t;\n\t\tif (debugEnabled > 1)\n\t\t\tdebug(\"check saves: requests are \", this.saveRequests);\n\t\tvar results = await Promise.all(promises);\n\t\tthis.saveResults = results;\n\t\tlet i = 0;\n\t\tfor (let target of this.hitTargets) {\n\t\t\tif (!target.actor)\n\t\t\t\tcontinue; // these were skipped when doing the rolls so they can be skipped now\n\t\t\tif (!results[i])\n\t\t\t\terror(\"Token \", target, \"could not roll save/check assuming 0\");\n\t\t\tconst result = results[i];\n\t\t\tlet rollTotal = results[i]?.total || 0;\n\t\t\tlet rollDetail = results[i];\n\t\t\tif (result?.terms[0]?.options?.advantage)\n\t\t\t\tthis.advantageSaves.add(target);\n\t\t\tif (result?.terms[0]?.options?.disadvantage)\n\t\t\t\tthis.disadvantageSaves.add(target);\n\t\t\tlet isFumble = false;\n\t\t\tlet isCritical = false;\n\t\t\tif (rollDetail.terms && checkRule(\"criticalSaves\") && rollDetail.terms[0] instanceof DiceTerm) { // normal d20 roll/lmrtfy/monks roll\n\t\t\t\tconst dterm = rollDetail.terms[0];\n\t\t\t\t//@ts-ignore\n\t\t\t\tisFumble = dterm.total <= (dterm.options?.fumble ?? 1);\n\t\t\t\t//@ts-ignore\n\t\t\t\tisCritical = dterm.total >= (dterm.options?.critical ?? 20);\n\t\t\t}\n\t\t\telse if (result.isBR && checkRule(\"criticalSaves\"))\n\t\t\t\tisCritical = result.isCritical;\n\t\t\tlet saved = (isCritical || rollTotal >= rollDC) && !isFumble;\n\t\t\tif (this.checkSuperSaver(target.actor, this.saveItem.data.data.save.ability))\n\t\t\t\tthis.superSavers.add(target);\n\t\t\tif (this.item.data.flags[\"midi-qol-relics\"]?.isConcentrationCheck) {\n\t\t\t\tconst checkBonus = getProperty(target, \"actor.data.flags.midi-qol-relics.concentrationSaveBonus\");\n\t\t\t\tif (checkBonus) {\n\t\t\t\t\tconst rollBonus = (await new Roll(checkBonus, target.actor?.getRollData()).evaluate({ async: true })).total;\n\t\t\t\t\trollTotal += rollBonus;\n\t\t\t\t\trollDetail = (await new Roll(`${rollDetail.result} + ${rollBonus}`).evaluate({ async: true }));\n\t\t\t\t\tsaved = (isCritical || rollTotal >= rollDC) && !isFumble; //TODO see if bonus can change critical/fumble\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (saved) {\n\t\t\t\tthis.saves.add(target);\n\t\t\t\tthis.failedSaves.delete(target);\n\t\t\t}\n\t\t\tif (game.user?.isGM)\n\t\t\t\tlog(`Ability save/check: ${target.name} rolled ${rollTotal} vs ${rollAbility} DC ${rollDC}`);\n\t\t\tlet saveString = i18n(saved ? \"midi-qol-relics.save-success\" : \"midi-qol-relics.save-failure\");\n\t\t\tlet adv = this.advantageSaves.has(target) ? `(${i18n(\"RELICS.Advantage\")})` : \"\";\n\t\t\tif (this.disadvantageSaves.has(target))\n\t\t\t\tadv = `(${i18n(\"RELICS.Disadvantage\")})`;\n\t\t\tif (game.system.id === \"sw5e\") {\n\t\t\t\tadv = this.advantageSaves.has(target) ? `(${i18n(\"SW5E.Advantage\")})` : \"\";\n\t\t\t\tif (this.disadvantageSaves.has(target))\n\t\t\t\t\tadv = `(${i18n(\"SW5E.Disadvantage\")})`;\n\t\t\t}\n\t\t\tlet img = target.data.img ?? target.actor.img ?? \"\";\n\t\t\tif (configSettings.usePlayerPortrait && target.actor.data.type === \"character\")\n\t\t\t\timg = target.actor?.img ?? target.data.img ?? \"\";\n\t\t\tif (VideoHelper.hasVideoExtension(img)) {\n\t\t\t\timg = await game.video.createThumbnail(img, { width: 100, height: 100 });\n\t\t\t}\n\t\t\tlet isPlayerOwned = target.actor.hasPlayerOwner;\n\t\t\tthis.saveDisplayData.push({\n\t\t\t\tgmName: target.name,\n\t\t\t\tplayerName: getTokenPlayerName(target),\n\t\t\t\timg,\n\t\t\t\tisPC: isPlayerOwned,\n\t\t\t\ttarget,\n\t\t\t\tsaveString,\n\t\t\t\trollTotal,\n\t\t\t\trollDetail,\n\t\t\t\tid: target.id,\n\t\t\t\tadv\n\t\t\t});\n\t\t\ti++;\n\t\t}\n\t\tif (this.item.data.data.actionType !== \"abil\")\n\t\t\t//@ts-ignore CONFIG.RELICS\n\t\t\tthis.saveDisplayFlavor = `${this.item.name} ${CONFIG.RELICS.abilities[rollAbility]} ${i18n(this.hitTargets.size > 1 ? \"midi-qol-relics.saving-throws\" : \"midi-qol-relics.saving-throw\")}:`;\n\t\telse\n\t\t\t//@ts-ignore CONFIG.RELICS\n\t\t\tthis.saveDisplayFlavor = `${this.item.name} ${CONFIG.RELICS.abilities[rollAbility]} ${i18n(this.hitTargets.size > 1 ? \"midi-qol-relics.ability-checks\" : \"midi-qol-relics.ability-check\")}:`;\n\t}","function testFlush(suitArray){\n let findSame1 = 0;\n for(let i = 0; i < suitArray.length - 1; i++){\n if(suitArray[i] === suitArray[i + 1]){\n findSame1 += 1;\n }\n }\n return findSame1 === 4;\n }","finished() {\n const target = Game.getObjectById(this.params.targetId);\n if (target.hits <= 0) {\n return true;\n }\n }","function addHitAndCheckWin() {\n numHits++;\n console.log(numHits);\n return numHits >= maxHits;\n}","function countSave(count) {\n saveAll += count;\n countAllSavings();\n }","function checkWin() {\n match_found += 1;\n if (match_found === 8) {\n showResults();\n }\n}","function checkForMatch() {\n\tif (\n\t\ttoggledCards[0].firstElementChild.className === toggledCards[1].firstElementChild.className\n\t) {\n\t\t// if the cards do match, lock the cards in the open position (put this functionality in another function that you call from this one)\n\t\ttoggleMatchCard(toggledCards[0]);\n\t\ttoggleMatchCard(toggledCards[1]);\n\t\ttoggledCards = [];\n\t\tmatched++;\n\t\t// stop the game if TOTAL_PAIRS reached with a timeout of 1000\n\t\tsetTimeout(() => {\n\t\t\tif (matched === TOTAL_PAIRS) {\n\t\t\t\tgameOver();\n\t\t\t}\n\t\t}, 1000);\n\t}else{\n\t\t//setTimeOut is a callback function that runs after the designated time expires.\n\t\tsetTimeout(() => {\n\t\t\t// if the cards do not match, remove the cards from the list and hide the card's symbol (put this functionality in another function that you call from this one)\n\t\t\ttoggleCard(toggledCards[0]);\n\t\t\ttoggleCard(toggledCards[1]);\n\t\t\ttoggledCards = [];\n\t\t}, 1000);\n\n\t}\n}","function checkAllAFK(match, teamId, row) {\n\n /*\n We define AFK to be having 35% or less XP than the average\n Where the average doesn't consider non-zero entities\n NOTE: We are testing 35% right now based on a a previous game to see if it breaks anything by being that high\n There was a game I got crushed in but I still had 52%, I expect as high as 40% is okay\n 47% definitely broke it\n 35% broke it and the value it broke on was 28%\n I'm leaving it at 35 but if I publish, 25% is a better value\n */\n var deltas = [];\n var deltaTimes = ['0-10', '10-20', '20-30', '30-end'];\n var myAFK = 0;\n var theirAFK = 0;\n var afk = false;\n for(var i = 0; i < 10; i++) {\n deltas.push(getXPPerMinuteDelta(match['participants'][i]));\n }\n var averageDeltas = getAverageDeltas(deltas, deltaTimes);\n for(var i = 0; i < deltas.length; i++) {\n for(var j = 0; j < deltaTimes.length; j++) {\n if(deltas[i][deltaTimes[j]] <= (averageDeltas[deltaTimes[j]] * 0.35)) {\n if(match['participants'][i]['teamId'] == teamId) {\n myAFK++;\n }\n else {\n theirAFK++;\n }\n break;\n }\n }\n }\n setCell('My AFK', row, myAFK);\n setCell('Their AFK', row, theirAFK);\n}","function checkMatch() {\n const firstCardClass = openCards[0].firstElementChild.className;\n const secondCardClass = openCards[1].firstElementChild.className;\n if (firstCardClass === secondCardClass) {\n //locks cards in open position\n doMatch();\n } else {\n //flips cards over again\n setTimeout(removeCards, 1000);\n }\n //increases move and star counter\n moveCount();\n starCount();\n}","async _saveLastSeqIfNeeded() {\n // Is it time to save the lastSeq again?\n if (new Date().getTime() - this._seqLastSaved.getTime() >= this._saveSeqAfterSeconds * 1000) {\n await this._saveLastSeq()\n }\n }","function quest2() {\n fs.readFile('./santa.txt', (err, data) => {\n console.time('santaTime');\n const directions = data.toString();\n const directionsArray = directions.split('');\n let accumulator = 0\n let counter = 0\n const answer = directionsArray.some((currentItem) => {\n if (currentItem === '(') {\n accumulator += 1\n } else if (currentItem === ')') {\n accumulator -= 1\n }\n counter ++\n return accumulator <0; //ends the function when 0 is reached\n })\n console.timeEnd('santaTime');\n console.log('basement entry at: ', counter);\n })\n}","record(count) {\n\t\tvar score = acc_helper(global.barCoords[this.state.target_index].rot, this.state.user_rotation);\n\t\tvar url = 'https://filtergraph.com/aiw/default/log_scores?';\n\t\turl += 'score=' + String(score) + '&';\n\t\turl += 'test_name=' + this.state.test_name + '&';\n\t\turl += 'user_ID=' + global.user_ID + '&';\n\t\turl += 'test_ID=' + global.test_ID + '&';\n\t\turl += 'key=' + global.key;\n\t\tfetch(url)\n\t\t\t.then((response) => response.text())\n\t\t\t.then((responseText) => {\n\t\t\t\tconsole.log(\"backend receipt: \" + this.state.test_name + \", screen \"\n\t\t\t\t+ String(count) + \", score \" + String(score) + ': ' + responseText);\n\t\t\t})\n\t\t\t.catch((error) => {\n\t\t\t\tconsole.error(error);\n\t\t\t\tAlert(\"Something went wrong. Please check your connection.\");\n\t\t\t});\n\t\treturn score;\n\t}","function checkForMatch(){\n\tif (toggledCards[0].firstElementChild.className === toggledCards[1].firstElementChild.className){\t\t\n\t\tconsole.log('Matched');\n\t\ttoggledCards[0].classList.toggle('match')\n\t\ttoggledCards[1].classList.toggle('match')\n\t\ttoggledCards = [];\n\t\tmatched++;\n\t\tconsole.log(matched);\n\t} else {\n\t setTimeout(() => {\n\t\tconsole.log('No Match');\n\t\ttoggleCard(toggledCards[0]);\n\t\ttoggleCard(toggledCards[1]);\n\t\ttoggledCards = [];\n\t }, 1000);\n }\n if (matched === 8) {\n gameOver();\n }\n}","flush() {\n if (!this._replay || !this._replay.isEnabled()) {\n return;\n }\n\n return this._replay.flushImmediate();\n }","function matcher (record) {\n this.depth = this.depth || 1 // depth tracking starts at level 1\n this.tracker = this.tracker || 0 // for basic sums, start counter at 0\n const subTotal = this.tracker + record\n // Found a match in the specified with desired qty of results, don't keep searching!\n if (subTotal === this.target && this.depth >= goal) {\n results.push(record)\n return true\n }\n // When subtotal exceeds target, return immediately and don't waste time\n // on more loops that won't get results\n if (subTotal > this.target) {\n return false\n }\n // If we're already at max depth, don't waste time on more loops\n if (this.depth >= this.maxDepth) {\n return false\n }\n // Check the next level down\n const res = records.find(matcher, {\n maxDepth: this.maxDepth,\n target: this.target,\n depth: this.depth + 1,\n tracker: this.tracker + record\n })\n // Propogate maches back up the recursion chain, capturing each\n if (res) {\n results.push(record)\n return true\n }\n // Nothing found with this combo, step to the next sibling\n return false\n }","function registerFrequency(frequency){\n\n\t// need to store frequency in a data structure that allows O(1) look up on the phase and\n\t// the counts of repeats, there are two separate JS objects being used to achieve this.\n\t// There is an inherent need to ensure that these two data structures are kept in sync for\n\t// the relationships between them to remain true.\n\n\t// Does the passed frequency exist in the store yet?\n\tif (frequenciesSeen[frequency]) {\n\n\t\tlet countPassedFrequencySeen = frequenciesSeen[frequency];\n\n\t\t// Remove the frequency from the repeatsOfFrequencies Object for the current frequency count\n\t\t\n\t\t// If present in the repeatsOfFrequencies object already remove it\n\t\tif (repeatsOfFrequencies[countPassedFrequencySeen] && repeatsOfFrequencies[countPassedFrequencySeen][frequency]) {\n\t\t\tdelete repeatsOfFrequencies[countPassedFrequencySeen][frequency]\n\t\t}\n\n\t\t// Increment the value for passed frequency in the store\n\t\tfrequenciesSeen[frequency] = frequenciesSeen[frequency] + 1;\n\n\n // Create object for the current count if it does not exist\n if (!repeatsOfFrequencies[countPassedFrequencySeen]) {\n repeatsOfFrequencies[countPassedFrequencySeen] = {};\n }\n\n // Add to repeatsOfFrequencies object\n\t\trepeatsOfFrequencies[countPassedFrequencySeen][frequency] = {egg: true};\n\n console.log(`seen ${frequency} at least twice now...`)\n\n\t} else {\n\t\t// Add passed frequency to the store\n\t\tfrequenciesSeen[frequency] = 1;\n\n\t\t\n\n\t}\n\n}","function checkMatches(drawData) {\n const { winningNumbers, drawedSets} = drawData;\n //const numAmount = winningNumbers.size;\n for (set of drawedSets) {\n set.match = 0;\n for (let num of set.numbers) {\n if (winningNumbers.includes(num)) {\n set.match++;\n }\n }\n }\n //console.log(winningNumbers, drawedSets);\n}","function checkForWin() {\n matchesFound += 1;\n if (matchesFound == 8) {\n showResults();\n }\n}","markOpenCardsAsMatch() {\n this.matchedCards.push(this.openCards[0], this.openCards[1]);\n this.openCards.forEach((card) => {\n setTimeout(this.markCardAsMatch.bind(this, card), 500);\n });\n if (this.matchedCards.length === 16) {\n setTimeout(() => {\n this.hideDeck();\n this.displaySuccessMessage();\n }, 2000);\n this.scoringHandler.stopTimer();\n }\n\n this.openCards = [];\n }","_attemptToMatchHash() {\n attemptToMatchHash(this, this.savedHash, defaultSuccessHandler);\n }","function countUpdate() {\n\n\tconsole.log('\\nnew call');\n\n \t// if we should block, count blocked time\n\tvar blocked = JSON.parse(localStorage[\"blockVar\"]);\n\tif (blocked) {\n\t\tcheckBlock();\n\t\treturn;\n\t}\n\n\tchrome.idle.queryState(30, function (state) {\n \tchrome.windows.getCurrent(function (current) {\n\n \t\t// count time is browser is in use\n\t\t\tif (state === \"active\" || current.state === \"fullscreen\") {\n \t\t\t\tchrome.tabs.query({active: true, currentWindow: true}, \n \t\t\t\t\tfunction (tabs) {\n\n\n\t\t\t\t\t// if we shouldn't block, count wasted time\n\t\t\t\t\tif (tabs.length === 0) return;\n\n\t\t\t\t\tvar tab = tabs[0];\n\t\t\t\t\t// get current Domain\n\t\t\t\t\tvar current = getDomain(tab.url);\t\n\n\t\t\t\t\t// a problem cause undefined\n\t\t\t\t\tconsole.log(localStorage[\"domHash\"]);\n \t\t\t\t\tvar dH = JSON.parse(localStorage[\"domHash\"]);\n \t\t\tif (dH !== undefined) {\n\t\t\t\t\t\tconsole.log('domHash got');\n\t\t\t\t\t\tconsole.log('current domain is ' + current);\n\t\t\t\t\t\t\n\t\t\t\t\t\t// get the hashed domain\n\t\t\t\t\t\tvar found = 'false';\n\t\t\t\t\t\tfor (var k in dH) {\n \t\t\t\t\t\tif (k === current) {\n \t\t\t\t\t\t\tconsole.log('match found!');\n \t\t\t\t\t\t\tdH[k] += UPDATE_SECONDS;\n \t\t\t\t\t\t\t\tconsole.log(dH);\n\t\t\t\t\t\t\t\tfound = 'true';\n\t\t\t\t\t\t\t\tbreak;\n \t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (found === 'true') {\n\t\t\t\t\t\t\tconsole.log(' updating...');\n\t\t\t\t\t\t\tlocalStorage[\"domHash\"] = JSON.stringify(dH);\n\t\t\t\t\t\t\tconsole.log(\"domHash updated!\");\n\t\t\t\t\t\t\tcountSum();\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse console.log('no change needed');\n\t\t\t\t\t}\n\t\t\t\t\telse console.log('PANIC: Hash table does not exist!');\n\t\t\t\t\t\t\t\t\t\n\t\t\t\t});\n\t\t\t}\n\t\t\telse console.log('state inactive; no update needed.');\n\t\t});\n\t});\n}","countTracked() {\n return(Object.keys(tTracked).length)\n }","function isCompleted() {\n return cards.length === matchedCards.length;\n}","async function matchCollector() {\n // retrieve all active challenges\n console.log('**** Match Collector ****');\n let challengeCount = await codbets_reader.challengeCount();\n challengeCount = ethers.BigNumber.from(challengeCount).toNumber();\n console.log(`Current challenge count is ${challengeCount}`);\n\n if (challengeCount == 0) return;\n // Loop through all existing challenge Ids\n for (let challengeId = 1; challengeId <= challengeCount; challengeId++) {\n // - retrieve the challenge struct\n challenge = await codbets_reader.challenges(challengeId);\n\n if (challenge.settled) continue;\n if (!challenge.accepted) continue;\n\n // - call matchFinder()\n const matchId = await matchFinder(challenge.gamertag1, challenge.gamertag2);\n // - with return matchId, call fetchWinner(matchId, gamertag1, gamertag2, challengeId)\n if (matchId) {\n console.log(`Match Id ${matchId} found for Challenge id ${challengeId}`);\n await codbets_writer.fetchWinner(\n matchId,\n challenge.gamertag1,\n challenge.gamertag2,\n challengeId\n );\n } else {\n console.log(`No matches found for Challenge id ${challengeId}`);\n }\n }\n //\n}","isFree() {\n return this.track === FREE;\n }","function deflate_slow(flush) {\n\t\t // short hash_head = 0; // head of hash chain\n\t\t var hash_head = 0; // head of hash chain\n \n\t\t var bflush; // set if current block must be flushed\n \n\t\t var max_insert; // Process the input block.\n \n\t\t while (true) {\n\t\t\t// Make sure that we always have enough lookahead, except\n\t\t\t// at the end of the input file. We need MAX_MATCH bytes\n\t\t\t// for the next match, plus MIN_MATCH bytes to insert the\n\t\t\t// string following the next match.\n\t\t\tif (lookahead < MIN_LOOKAHEAD) {\n\t\t\t fill_window();\n \n\t\t\t if (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\n\t\t\t\treturn NeedMore;\n\t\t\t }\n \n\t\t\t if (lookahead === 0) break; // flush the current block\n\t\t\t} // Insert the string window[strstart .. strstart+2] in the\n\t\t\t// dictionary, and set hash_head to the head of the hash chain:\n \n \n\t\t\tif (lookahead >= MIN_MATCH) {\n\t\t\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\n \n\t\t\t hash_head = head[ins_h] & 0xffff;\n\t\t\t prev[strstart & w_mask] = head[ins_h];\n\t\t\t head[ins_h] = strstart;\n\t\t\t} // Find the longest match, discarding those <= prev_length.\n \n \n\t\t\tprev_length = match_length;\n\t\t\tprev_match = match_start;\n\t\t\tmatch_length = MIN_MATCH - 1;\n \n\t\t\tif (hash_head !== 0 && prev_length < max_lazy_match && (strstart - hash_head & 0xffff) <= w_size - MIN_LOOKAHEAD) {\n\t\t\t // To simplify the code, we prevent matches with the string\n\t\t\t // of window index 0 (in particular we have to avoid a match\n\t\t\t // of the string with itself at the start of the input file).\n\t\t\t if (strategy != Z_HUFFMAN_ONLY) {\n\t\t\t\tmatch_length = longest_match(hash_head);\n\t\t\t } // longest_match() sets match_start\n \n \n\t\t\t if (match_length <= 5 && (strategy == Z_FILTERED || match_length == MIN_MATCH && strstart - match_start > 4096)) {\n\t\t\t\t// If prev_match is also MIN_MATCH, match_start is garbage\n\t\t\t\t// but we will ignore the current match anyway.\n\t\t\t\tmatch_length = MIN_MATCH - 1;\n\t\t\t }\n\t\t\t} // If there was a match at the previous step and the current\n\t\t\t// match is not better, output the previous match:\n \n \n\t\t\tif (prev_length >= MIN_MATCH && match_length <= prev_length) {\n\t\t\t max_insert = strstart + lookahead - MIN_MATCH; // Do not insert strings in hash table beyond this.\n\t\t\t // check_match(strstart-1, prev_match, prev_length);\n \n\t\t\t bflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH); // Insert in hash table all strings up to the end of the match.\n\t\t\t // strstart-1 and strstart are already inserted. If there is not\n\t\t\t // enough lookahead, the last two strings are not inserted in\n\t\t\t // the hash table.\n \n\t\t\t lookahead -= prev_length - 1;\n\t\t\t prev_length -= 2;\n \n\t\t\t do {\n\t\t\t\tif (++strstart <= max_insert) {\n\t\t\t\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\n \n\t\t\t\t hash_head = head[ins_h] & 0xffff;\n\t\t\t\t prev[strstart & w_mask] = head[ins_h];\n\t\t\t\t head[ins_h] = strstart;\n\t\t\t\t}\n\t\t\t } while (--prev_length !== 0);\n \n\t\t\t match_available = 0;\n\t\t\t match_length = MIN_MATCH - 1;\n\t\t\t strstart++;\n \n\t\t\t if (bflush) {\n\t\t\t\tflush_block_only(false);\n\t\t\t\tif (strm.avail_out === 0) return NeedMore;\n\t\t\t }\n\t\t\t} else if (match_available !== 0) {\n\t\t\t // If there was no match at the previous position, output a\n\t\t\t // single literal. If there was a match but the current match\n\t\t\t // is longer, truncate the previous match to a single literal.\n\t\t\t bflush = _tr_tally(0, window[strstart - 1] & 0xff);\n \n\t\t\t if (bflush) {\n\t\t\t\tflush_block_only(false);\n\t\t\t }\n \n\t\t\t strstart++;\n\t\t\t lookahead--;\n\t\t\t if (strm.avail_out === 0) return NeedMore;\n\t\t\t} else {\n\t\t\t // There is no previous match to compare with, wait for\n\t\t\t // the next step to decide.\n\t\t\t match_available = 1;\n\t\t\t strstart++;\n\t\t\t lookahead--;\n\t\t\t}\n\t\t }\n \n\t\t if (match_available !== 0) {\n\t\t\tbflush = _tr_tally(0, window[strstart - 1] & 0xff);\n\t\t\tmatch_available = 0;\n\t\t }\n \n\t\t flush_block_only(flush == Z_FINISH);\n \n\t\t if (strm.avail_out === 0) {\n\t\t\tif (flush == Z_FINISH) return FinishStarted;else return NeedMore;\n\t\t }\n \n\t\t return flush == Z_FINISH ? FinishDone : BlockDone;\n\t\t}","checkAutomaticMatch() {\n TweenMax.delayedCall(0.5, () => {\n let matches = this.checkGridForMatches();\n if (matches.length > 0) {\n this.gatherMatchingBlocks(matches);\n this.increaseCardsPointsAfterMatch(matches);\n } else {\n this.checkPossibleMove();\n }\n })\n }","function setMatch() {\n open.forEach(function(card) {\n card.addClass('match');\n });\n open = [];\n matched += 2;\n if (Won()) {\n stopTimer();\n gameOver();\n }\n}","function doTF(tf)\r\n{\r\n termfrequency = {};\r\n var word = tf.split(' '); // individual words\r\n var count=0;\r\n \r\n for(var i = 0;i 0 && quantifierRecurse !== true) ? ndxInitializer.shift() : 0; (qndx < (isNaN(qt.quantifier.max) ? qndx + 1 : qt.quantifier.max)) && testPos <= pos; qndx++) {\n var tokenGroup = maskToken.matches[maskToken.matches.indexOf(qt) - 1];\n match = handleMatch(tokenGroup, [qndx].concat(loopNdx), true);\n if (match) {\n //get latest match\n var latestMatch = matches[matches.length - 1][\"match\"];\n if (qndx > qt.quantifier.min - 1) { //mark optionality\n latestMatch.optionalQuantifier = true;\n }\n var isFirstMatch = (tokenGroup.matches.indexOf(latestMatch) == 0);\n if (isFirstMatch) { //search for next possible match\n if (qndx > qt.quantifier.min - 1) {\n insertStop = true;\n testPos = pos; //match the position after the group\n break; //stop quantifierloop\n } else return true;\n } else {\n return true;\n }\n }\n }\n } else {\n match = ResolveTestFromToken(match, ndxInitializer, loopNdx, quantifierRecurse);\n if (match)\n return true;\n }\n } else testPos++;\n }","postrender() {\n this.count++;\n if (this.mode === settings_1.settings.GC_MODES.MANUAL) {\n return;\n }\n this.checkCount++;\n if (this.checkCount > this.checkCountMax) {\n this.checkCount = 0;\n this.run();\n }\n }","function isMatch() {\n if (cardOne.dataset.title === cardTwo.dataset.title) {\n keepShowing();\n pairs = pairs + 1;\n checkIfWon();\n return;\n }\n unflipCards();\n decreaseHealth();\n}","function handleMatch(match, loopNdx, quantifierRecurse) {\n\t function isFirstMatch(latestMatch, tokenGroup) {\n\t var firstMatch = $.inArray(latestMatch, tokenGroup.matches) === 0;\n\t if (!firstMatch) {\n\t $.each(tokenGroup.matches, function (ndx, match) {\n\t if (match.isQuantifier === true) {\n\t firstMatch = isFirstMatch(latestMatch, tokenGroup.matches[ndx - 1]);\n\t if (firstMatch) return false;\n\t }\n\t });\n\t }\n\t return firstMatch;\n\t }\n\n\t function resolveNdxInitializer(pos, alternateNdx) {\n\t var bestMatch = selectBestMatch(pos, alternateNdx);\n\t return bestMatch ? bestMatch.locator.slice(bestMatch.alternation + 1) : [];\n\t }\n\t if (testPos > 10000) {\n\t throw \"Inputmask: There is probably an error in your mask definition or in the code. Create an issue on github with an example of the mask you are using. \" + getMaskSet().mask;\n\t }\n\t if (testPos === pos && match.matches === undefined) {\n\t matches.push({\n\t \"match\": match,\n\t \"locator\": loopNdx.reverse(),\n\t \"cd\": cacheDependency\n\t });\n\t return true;\n\t } else if (match.matches !== undefined) {\n\t if (match.isGroup && quantifierRecurse !== match) { //when a group pass along to the quantifier\n\t match = handleMatch(maskToken.matches[$.inArray(match, maskToken.matches) + 1], loopNdx);\n\t if (match) return true;\n\t } else if (match.isOptional) {\n\t var optionalToken = match;\n\t match = resolveTestFromToken(match, ndxInitializer, loopNdx, quantifierRecurse);\n\t if (match) {\n\t latestMatch = matches[matches.length - 1].match;\n\t if (isFirstMatch(latestMatch, optionalToken)) {\n\t insertStop = true; //insert a stop\n\t testPos = pos; //match the position after the group\n\t } else return true;\n\t }\n\t } else if (match.isAlternator) {\n\t var alternateToken = match,\n\t\t\t\t\t\t\t\t\tmalternateMatches = [],\n\t\t\t\t\t\t\t\t\tmaltMatches,\n\t\t\t\t\t\t\t\t\tcurrentMatches = matches.slice(),\n\t\t\t\t\t\t\t\t\tloopNdxCnt = loopNdx.length;\n\t var altIndex = ndxInitializer.length > 0 ? ndxInitializer.shift() : -1;\n\t if (altIndex === -1 || typeof altIndex === \"string\") {\n\t var currentPos = testPos,\n\t\t\t\t\t\t\t\t\t\tndxInitializerClone = ndxInitializer.slice(),\n\t\t\t\t\t\t\t\t\t\taltIndexArr = [],\n\t\t\t\t\t\t\t\t\t\tamndx;\n\t if (typeof altIndex == \"string\") {\n\t altIndexArr = altIndex.split(\",\");\n\t } else {\n\t for (amndx = 0; amndx < alternateToken.matches.length; amndx++) {\n\t altIndexArr.push(amndx);\n\t }\n\t }\n\t for (var ndx = 0; ndx < altIndexArr.length; ndx++) {\n\t amndx = parseInt(altIndexArr[ndx]);\n\t matches = [];\n\t //set the correct ndxInitializer\n\t ndxInitializer = resolveNdxInitializer(testPos, amndx);\n\t match = handleMatch(alternateToken.matches[amndx] || maskToken.matches[amndx], [amndx].concat(loopNdx), quantifierRecurse) || match;\n\t if (match !== true && match !== undefined && (altIndexArr[altIndexArr.length - 1] < alternateToken.matches.length)) { //no match in the alternations (length mismatch) => look further\n\t var ntndx = maskToken.matches.indexOf(match) + 1;\n\t if (maskToken.matches.length > ntndx) {\n\t match = handleMatch(maskToken.matches[ntndx], [ntndx].concat(loopNdx.slice(1, loopNdx.length)), quantifierRecurse);\n\t if (match) {\n\t altIndexArr.push(ntndx.toString());\n\t $.each(matches, function (ndx, lmnt) {\n\t lmnt.alternation = loopNdx.length - 1;\n\t });\n\t }\n\t }\n\t }\n\t maltMatches = matches.slice();\n\t testPos = currentPos;\n\t matches = [];\n\t //cloneback\n\t for (var i = 0; i < ndxInitializerClone.length; i++) {\n\t ndxInitializer[i] = ndxInitializerClone[i];\n\t }\n\t //fuzzy merge matches\n\t for (var ndx1 = 0; ndx1 < maltMatches.length; ndx1++) {\n\t var altMatch = maltMatches[ndx1];\n\t altMatch.alternation = altMatch.alternation || loopNdxCnt;\n\t for (var ndx2 = 0; ndx2 < malternateMatches.length; ndx2++) {\n\t var altMatch2 = malternateMatches[ndx2];\n\t //verify equality\n\t if (altMatch.match.def === altMatch2.match.def && (typeof altIndex !== \"string\" || $.inArray(altMatch.locator[altMatch.alternation].toString(), altIndexArr) !== -1)) {\n\t if (altMatch.match.mask === altMatch2.match.mask) {\n\t maltMatches.splice(ndx1, 1);\n\t ndx1--;\n\t }\n\t if (altMatch2.locator[altMatch.alternation].toString().indexOf(altMatch.locator[altMatch.alternation]) === -1) {\n\t altMatch2.locator[altMatch.alternation] = altMatch2.locator[altMatch.alternation] + \",\" + altMatch.locator[altMatch.alternation];\n\t altMatch2.alternation = altMatch.alternation; //we pass the alternation index => used in determineLastRequiredPosition\n\t }\n\t break;\n\t }\n\t }\n\t }\n\t malternateMatches = malternateMatches.concat(maltMatches);\n\t }\n\n\t if (typeof altIndex == \"string\") { //filter matches\n\t malternateMatches = $.map(malternateMatches, function (lmnt, ndx) {\n\t if (isFinite(ndx)) {\n\t var mamatch,\n\t\t\t\t\t\t\t\t\t\t\t\t\talternation = lmnt.alternation,\n\t\t\t\t\t\t\t\t\t\t\t\t\taltLocArr = lmnt.locator[alternation].toString().split(\",\");\n\t lmnt.locator[alternation] = undefined;\n\t lmnt.alternation = undefined;\n\t for (var alndx = 0; alndx < altLocArr.length; alndx++) {\n\t mamatch = $.inArray(altLocArr[alndx], altIndexArr) !== -1;\n\t if (mamatch) { //rebuild the locator with valid entries\n\t if (lmnt.locator[alternation] !== undefined) {\n\t lmnt.locator[alternation] += \",\";\n\t lmnt.locator[alternation] += altLocArr[alndx];\n\t } else lmnt.locator[alternation] = parseInt(altLocArr[alndx]);\n\n\t lmnt.alternation = alternation;\n\t }\n\t }\n\t if (lmnt.locator[alternation] !== undefined) return lmnt;\n\t }\n\t });\n\t }\n\n\t matches = currentMatches.concat(malternateMatches);\n\t testPos = pos;\n\t insertStop = matches.length > 0; //insert a stopelemnt when there is an alternate - needed for non-greedy option\n\t } else {\n\t // if (alternateToken.matches[altIndex]) { //if not in the initial alternation => look further\n\t match = handleMatch(alternateToken.matches[altIndex] || maskToken.matches[altIndex], [altIndex].concat(loopNdx), quantifierRecurse);\n\t // } else match = false;\n\t }\n\t if (match) return true;\n\t } else if (match.isQuantifier && quantifierRecurse !== maskToken.matches[$.inArray(match, maskToken.matches) - 1]) {\n\t var qt = match;\n\t for (var qndx = (ndxInitializer.length > 0) ? ndxInitializer.shift() : 0;\n\t\t\t\t\t\t\t\t\t(qndx < (isNaN(qt.quantifier.max) ? qndx + 1 : qt.quantifier.max)) && testPos <= pos; qndx++) {\n\t var tokenGroup = maskToken.matches[$.inArray(qt, maskToken.matches) - 1];\n\t match = handleMatch(tokenGroup, [qndx].concat(loopNdx), tokenGroup); //set the tokenGroup as quantifierRecurse marker\n\t if (match) {\n\t //get latest match\n\t latestMatch = matches[matches.length - 1].match;\n\t latestMatch.optionalQuantifier = qndx > (qt.quantifier.min - 1);\n\t if (isFirstMatch(latestMatch, tokenGroup)) { //search for next possible match\n\t if (qndx > (qt.quantifier.min - 1)) {\n\t insertStop = true;\n\t testPos = pos; //match the position after the group\n\t break; //stop quantifierloop\n\t } else return true;\n\t } else {\n\t return true;\n\t }\n\t }\n\t }\n\t } else {\n\t match = resolveTestFromToken(match, ndxInitializer, loopNdx, quantifierRecurse);\n\t if (match) return true;\n\t }\n\t } else testPos++;\n\t }","function saveEntireAmtStateDone() {\r\n if (--IntelAmtEntireStateCalls != 0) return;\r\n var out = fs.openSync(settings.output, 'w');\r\n fs.writeSync(out, Buffer.from(JSON.stringify(IntelAmtEntireState)));\r\n fs.closeSync(out);\r\n console.log('Done, results written to ' + settings.output + '.');\r\n exit(1);\r\n}","function checkBlock() {\n\t\n\t// get/update block time and duration in seconds\n\tvar count = JSON.parse(localStorage[\"blockCount\"]);\n\tcount += UPDATE_SECONDS;\n\t\n\tvar blockDur = localStorage[\"blockDuration\"];\n\tblockDur = blockDur * 3600;\n\tconsole.log(count + \" seconds of \" + blockDur + \" second sentence served\");\n\t// remove block if duration exceeded\n\tif (count >= blockDur) {\n \tlocalStorage[\"blockVar\"] = \"false\";\n \tlocalStorage[\"target\"] = 0;\n \tlocalStorage[\"blockCount\"] = 0;\n \t\tconsole.log(\"you did great. the block is coming down\");\n\t}\n\telse {\n\t\tlocalStorage[\"blockCount\"] = count;\n\t}\n}","function checkMatch() {\n if (facedCards[0].firstElementChild.className == facedCards[1].firstElementChild.className) {\n for (let card of facedCards) {\n card.classList.add(\"match\");\n }\n /*Once match is made facedCards array is emptied. */\n facedCards = [];\n /*Match is added to match total*/\n matches++;\n /*Updates the wait variable to false so that users can click cards for the next try*/\n wait = false;\n } else {\n /*Flips cards that are not a match back over after a short delay. */\n setTimeout(clearFacedCards, 1000);\n }\n}","function checkIfcurrentFilterMatchSave() {\r\n\r\n\tfor (var i=0; i<9; i++) {\r\n\t\r\n\t\tif (assistsFilter[i] != assistsFilterBackup[i]) {\r\n\t\t\tsaveFilterButton.disabled = false;\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n\t\r\n\tfor (var i=0; i<7; i++) {\r\n\t\r\n\t\tif (gameSettingsFilter[i] != gameSettingsFilterBackup[i]) {\r\n\t\t\tsaveFilterButton.disabled = false;\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n\t\r\n\tsaveFilterButton.disabled = true;\r\n}","function match() {\n\t\tfor(card of chosenCards) {\n\t\t\t\tcard.classList.add('match');\n\t\t\t\tgotRight(card);\n\t\t};\n\t\tpairsRemain--;\n\t\tcheckWin();\n\t\tempty();\n}","function checkWinCondition(){\n// When all pairs are selected (pairCounter === maxPair, based on mode)\n if (pairCounter === maxPair){\n endTime = new Date();\n console.log('End Time:', endTime);\n }\n // Once the end time is captured, a 'score' is deduced by extracting and comparing time codes and converting from milliseconds to seconds. That value in seconds is added to the userData object\n if (endTime) {\n var numStartTime = startTime.getTime();\n var numEndTime = endTime.getTime();\n var elapsedTime = numEndTime-numStartTime;\n var timeInSec = elapsedTime/1000;\n console.log('Elapsed Time:', timeInSec);\n userData.finalTimes.push(timeInSec);\n // At this point, we have updated all necessary userData information and are ready to re-stringify it and send it back to local storage\n stringyUser = JSON.stringify(userData);\n localStorage.setItem('userData', stringyUser);\n // And now we send the user on to the About Me page to view their results\n window.location.href = 'about.html';\n }\n}","function checkForMatch() {\n if (firstCard.dataset.framework === secondCard.dataset.framework) {\n countMatch ++;\n // In case all of the matches are found ==> Congratulation you win the game\n if( countMatch === 8){\n //if the matches are 8 then popUp the messagge of win!\n congratulation();\n\n }\n disableCards();\n return;\n }\n\n unflipCards();\n }","isComplete() {\n if (!this.endTime) return false;\n if (this.now() > this.endTime) {\n return true;\n }\n else {\n return false;\n }\n \n }","allPlayersDone() {\n var showHostOffset = 0;\n var doneCount = 0;\n\n this.playerMap.doAll((player) => {\n if (player.isShowHost) {\n showHostOffset++;\n } else if (!player.hasFastestFingerChoicesLeft()) {\n doneCount++;\n }\n });\n\n return doneCount >= this.playerMap.getPlayerCount() - showHostOffset;\n }","async _checkRecords(index, record) {\n\t\tlet write = false;\n\n\t\tfor (const [index, record] of this.cache.records.entries()) {\n\t\t\tif (this.cache.currentIPv4 === record.recordContent || \n\t\t\t\tthis.cache.currentIPv6 === record.recordContent)\n\t\t\t\tcontinue;\n\t\n\t\t\tconsole.log(`Updating DNS record ${index} from ${record.recordContent} to ` +\n\t\t\t\t(record.ipv6 ? this.cache.currentIPv6 : this.cache.currentIPv4));\n\t\n\t\t\ttry {\n\t\t\t\tawait this._updateRecord(index);\n\t\t\t} catch (err) {\n\t\t\t\tconsole.error('Error updating DNS record:\\n' + err);\n\t\t\t\tprocess.exit();\n\t\t\t}\n\t\n\t\t\tconsole.log('DNS record is up to date.');\n\t\t\twrite = true;\n\t\t}\n\n\t\treturn write;\n\t}","if (didScheduleUpdateDuringPassiveEffects) {\n if (root === rootWithPassiveNestedUpdates) {\n nestedPassiveUpdateCount++;\n } else {\n nestedPassiveUpdateCount = 0;\n rootWithPassiveNestedUpdates = root;\n }\n }","function checkMatch() {\n if (app.firstCard.dataset.avenger === app.secondCard.dataset.avenger) {\n disableCards();\n cardMatchSound();\n app.matchedCards.push(app.firstCard.dataset.avenger);\n gameComplete();\n return;\n }\n unflipCards();\n}","async function storeCount () {\n console.log(\"storeCount starts\")\n var date = new Date();\n var obj = { \n date:date,\n cashtagCount:cashtagCount,\n errorCount:errorCount\n };\n counterStore.push(obj);\n cashtagCount = 0;\n errorCount = 0;\n runCount = runCount + 1;\n setTimeout(storeCount, 120000);\n }","function isMatch() {\n const openCard = document.getElementsByClassName(\"open show\");\n\n clickCounter++;\n\n //accesses the first and second cards as they're clicked\n const firstCard = openCard[0];\n const secondCard = openCard[1];\n\n /* compares everything about the cards to each other (comparing the node would\n * probably not be the best solution in the wild, but because the whole card * will be identical here, I think it's fine) */\n const matchedCards = firstCard.isEqualNode(secondCard);\n\n /* if the cards match, open & show classes are removed, match class is added\n * if the cards don't match, open & show classes are removed and the cards\n * can be accessed again */\n if (matchedCards) {\n firstCard.classList.remove(\"open\", \"show\");\n secondCard.classList.remove(\"open\", \"show\");\n firstCard.classList.add(\"match\");\n secondCard.classList.add(\"match\");\n\n clickCounter = 0;\n moves++;\n\n } else if (clickCounter === 2) {\n // closes both cards after a delay if they're not a match\n window.setTimeout(function() {\n firstCard.classList.remove(\"open\", \"show\");\n secondCard.classList.remove(\"open\", \"show\");\n }, 500);\n\n clickCounter = 0;\n moves++;\n\n } else {\n //// do nothing\n }\n\n /* victory condition which stops the timer and pops open a modal that\n * displays the player's stats */\n const allCardsMatched = document.querySelectorAll(\".match\");\n if (allCardsMatched.length === 16) {\n clearInterval(Interval);\n victoryModal();\n }\n}","function cardMatch() {\n if(cardSelections[0].firstElementChild.className === cardSelections[1].firstElementChild.className) {\n // If a match adds the match class to each card in array\n cardSelections.forEach(function(card){\n card.classList.add('match');\n });\n matchCount++;\n cardSelections = [];\n } else {\n // If no match sets timeout on card flipping via toggle.\n setTimeout(function() {\n displayCard(cardSelections[0]);\n displayCard(cardSelections[1]);\n cardSelections = [];\n }, 400 );\n }\n }","updateProtocolMatches() {\n log.trace('ProtocolEngine::updateProtocolMatches');\n\n // Clear all data currently in matchedProtocols\n this._clearMatchedProtocols();\n\n // For each study, find the matching protocols\n this.studies.forEach(study => {\n const matched = this.findMatchByStudy(study);\n\n // For each matched protocol, check if it is already in MatchedProtocols\n matched.forEach(matchedDetail => {\n const protocol = matchedDetail.protocol;\n if (!protocol) {\n return;\n }\n\n // If it is not already in the MatchedProtocols Collection, insert it with its score\n if (!this.matchedProtocols.has(protocol.id)) {\n log.trace(\n 'ProtocolEngine::updateProtocolMatches inserting protocol match',\n matchedDetail\n );\n this.matchedProtocols.set(protocol.id, protocol);\n this.matchedProtocolScores[protocol.id] = matchedDetail.score;\n }\n });\n });\n }","function checkMatch() {\n if (openedCards[0][0].firstChild.className == openedCards[1][0].firstChild.className) {\n console.log('This is a match!');\n openedCards[0].addClass('match');\n openedCards[1].addClass('match');\n clickOff();\n clearOpenCards();\n setTimeout(checkForWin, 900);\n } else {\n openedCards[0].toggleClass('open show').animateCss('flipInY');\n setTimeout(flipDelay, 600); //2nd card closes after the first\n clickOn();\n }\n}","getFrequencyMapping() {\n var mapping = [];\n for (const [name, midiFile] of Object.entries(this.midiFiles)) {\n var track = midiFile.track;\n track.forEach(function(midiEvent) {\n midiEvent.event.forEach(function(d) {\n if (d.type == 9 && d.data[1] > 0) {\n var find = Constants.NOTE_MAPPING[d.data[0]];\n var found = false;\n for (var i = 0; i < mapping.length && !found; i++) {\n if (mapping[i][\"name\"] == name && mapping[i][\"note\"] == find) {\n mapping[i][\"count\"] += 1;\n found = true;\n }\n }\n if (!found) {\n mapping.push({\n name: name,\n color: midiFile.color,\n note: find,\n count: 1\n });\n }\n }\n });\n });\n }\n\n // Identify mismatches and add match parameter\n const master = mapping.filter(item => item.name == mapping[0].name);\n const files = [...new Set(mapping.map(item => item.name))];\n master.forEach(function(d) {\n const notes = mapping.filter(item => item.note == d.note);\n const match = notes.every(item => item.count == notes[0].count);\n notes.forEach(item => (item.match = match));\n notes.forEach(item => (item.fileCount = files.length));\n });\n\n return mapping;\n }","async onMatchEnd(winner, duration) {\n this.stats.match += 1;\n this.stats.wins[winner] += 1;\n this.stats.lastDurations.push(duration);\n this.stats.matchTime = duration;\n\n await this.updateUi();\n this.stats.matchTime = 0;\n this.stats.matchFrame = 0;\n }"],"string":"[\n \"function track(match) {\\n return counters[match] = (counters[match] || 0) + 1;\\n }\",\n \"function incrementMatchCount() {\\n matchCount += 2;\\n}\",\n \"function checkIfCompleted() {\\n matchingCards++;\\n\\n if (matchingCards >= Math.floor(fieldSize / 2)) {\\n gameCompleted = true;\\n timerStop();\\n gratulation();\\n }\\n }\",\n \"function checkWordsRecord() {\\n console.log(\\\"Checking word scores\\\");\\n // Check for new words answered records\\n if ( window.wordsAnswered > window.highScores[window.gameMode]['words'] ) {\\n console.log(\\\"New high word score for \\\" + window.gameMode);\\n updateRecord(\\\"words\\\");\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\",\n \"function match() {\\n\\n\\tpairs++;\\n\\tcount = 0;\\n\\tdisableCards();\\n\\tresetCards();\\n\\tscoreKeeper();\\n\\n}\",\n \"writeMatches(pageClock) {\\n var dict = {};\\n dict[this.matchName] = pageClock.matches;\\n chrome.storage.local.set(dict, () => {\\n pageClock.debug.debug('Writing matches to storage...');\\n if (typeof chrome.runtime.lastError !== 'undefined') {\\n console.error(chrome.runtime.lastError);\\n }\\n });\\n }\",\n \"function _tr_align() {\\n\\t\\t send_bits(STATIC_TREES << 1, 3);\\n\\t\\t send_code(END_BLOCK, StaticTree.static_ltree);\\n\\t\\t bi_flush(); // Of the 10 bits for the empty block, we have already sent\\n\\t\\t // (10 - bi_valid) bits. The lookahead for the last real code (before\\n\\t\\t // the EOB of the previous block) was thus at least one plus the length\\n\\t\\t // of the EOB plus what we have just sent of the empty static block.\\n \\n\\t\\t if (1 + last_eob_len + 10 - bi_valid < 9) {\\n\\t\\t\\tsend_bits(STATIC_TREES << 1, 3);\\n\\t\\t\\tsend_code(END_BLOCK, StaticTree.static_ltree);\\n\\t\\t\\tbi_flush();\\n\\t\\t }\\n \\n\\t\\t last_eob_len = 7;\\n\\t\\t} // Save the match info and tally the frequency counts. Return true if\",\n \"function afterMatchFound(result, ctx) {\\n\\n if(ctx.friendlies.indexOf(result.user.toLowerCase()) > -1) {\\n result.relevance += ((1.0 - result.relevance) * 0.5); // up the relevance because it comes from a friendly\\n }\\n\\n if(result.tags.length > 0) { // result.relevance\\n console.debug(\\\"Found relevant match\\\" + (result.volatile ? \\\" [VOLATILE]\\\" : \\\"\\\") + \\\".\\\");\\n console.debug(result.tweetid + \\\" [\\\"+result.relevance+\\\"]: \\\" + JSON.stringify(result.tags));\\n // send through to InfluxDB\\n saveTweetToInflux(result)\\n } else {\\n console.debug(\\\"Event not found to be relevant.\\\");\\n }\\n}\",\n \"function C007_LunchBreak_Natalie_EatGoodMatch() {\\r\\n C007_LunchBreak_Natalie_MatchCount++;\\r\\n C007_LunchBreak_Natalie_CalcParams();\\r\\n CurrentTime = CurrentTime + 300000;\\r\\n}\",\n \"checkMatch () {\\n this.attempts++\\n if (this.first === this.second) {\\n this.hits++\\n this.gameTimer.stopTimerOne()\\n this.counter = 0\\n this.firstIsflipped = false\\n this.secondIsFlipped = false\\n this.timerOneIsOn = false\\n this.removeTwoPieces()\\n this.flipped = 0\\n this.first = ''\\n this.second = '*'\\n if (this.hits === this.max) {\\n this.gameTimer.stopGameTimer()\\n this.remove(this.max * 2)\\n this.button.style.display = 'block'\\n this.timeField.textContent = 'Congrats, you have made ' +\\n this.attempts + ' attempts and won in ' + (++this.time) + this.seconds\\n } else {\\n this.focus(0, 100, true)\\n }\\n }\\n }\",\n \"function updateMatchIds() {\\n this.matchIds = [];\\n\\n var i, len;\\n for (i = 0, len = this.blockCounts.length; i < len; i++) {\\n if (this.blockCounts[i] === 0) {\\n this.matchIds.push(i);\\n }\\n }\\n }\",\n \"hasData() {\\n const keys = this.keystrokeCount\\n ? Object.keys(this.keystrokeCount.source)\\n : null;\\n if (!keys || keys.length === 0) {\\n return false;\\n }\\n\\n // delete files that don't have any kpm data\\n let foundKpmData = false;\\n if (this.keystrokeCount.keystrokes > 0) {\\n foundKpmData = true;\\n }\\n\\n // Now remove files that don't have any keystrokes that only\\n // have an open or close associated with them. If they have\\n // open AND close then it's ok, keep it.\\n let keystrokesTally = 0;\\n keys.forEach(key => {\\n const data = this.keystrokeCount.source[key];\\n\\n const hasOpen = data.open > 0;\\n const hasClose = data.close > 0;\\n const hasKeystrokes = data.keystrokes > 0;\\n keystrokesTally += data.keystrokes;\\n if (\\n (hasOpen && !hasClose && !hasKeystrokes) ||\\n (hasClose && !hasOpen && !hasKeystrokes)\\n ) {\\n // delete it, no keystrokes and only an open\\n delete this.keystrokeCount.source[key];\\n } else if (!foundKpmData && hasOpen && hasClose) {\\n foundKpmData = true;\\n }\\n });\\n\\n if (\\n keystrokesTally > 0 &&\\n keystrokesTally !== this.keystrokeCount.keystrokes\\n ) {\\n // use the keystrokes tally\\n foundKpmData = true;\\n this.keystrokeCount.keystrokes = keystrokesTally;\\n }\\n return foundKpmData;\\n }\",\n \"function isAllMatched(){\\n \\n if(allMatchedCards==16){\\n clearInterval(interval);\\n var grade= starRating(movesCounter);\\n showInfo(grade); \\n }\\n}\",\n \"function isLastMatchingPair() {\\n return memoryGrid.querySelectorAll('.' + MATCH).length === 16;\\n }\",\n \"function checkForMatch() {\\n let isMatch = firstCardFlip.dataset.name === secondCardFlip.dataset.name;\\n isMatch ? disableCards() : unflipCards();\\n if (isMatch) {\\n counter++;\\n console.log(\\\"isMatch: \\\", counter);\\n if (counter === levelMatches) {\\n window.location = nextUrl;\\n }\\n disableCards();\\n } else {\\n console.log(\\\"notMatch: \\\", counter);\\n }\\n\\n}\",\n \"function checkPointsRecord() {\\n console.log(\\\"Checking point scores\\\");\\n\\n // Check new points records\\n if ( window.currentScore > window.highScores[window.gameMode]['points'] ) {\\n console.log(\\\"New high point score for \\\" + window.gameMode);\\n updateRecord(\\\"points\\\");\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\",\n \"function isSameCountCheck(mac,count){\\n\\t\\n\\tvar tag = count_map[mac];\\n\\n\\tif(tag === undefined){\\n\\t\\ttag = -1;\\n\\t}\\n\\n\\tif (tag === count){\\n\\t\\tconsole.log('count:' + count + '(mac:' +mac + '):tag='+tag+'is same #### drop');\\n\\t\\treturn true;\\n\\t}else{\\n\\t\\tcount_map[mac] = count;\\n\\t\\tconsole.log('count:' + count + '(mac:' +mac + '):tag='+tag +' @@@@ save' );\\n\\t\\treturn false;\\n\\t}\\n}\",\n \"function matched() {\\n deck.find('.open').addClass('match');\\n setTimeout(function() {\\n deck.find('.match').removeClass('open');\\n }, 500);\\n matchCards++;\\n matchedCards = [];\\n}\",\n \"function matchSuccess() {\\n matchCard1.addClass(\\\"animated pulse matched\\\");\\n matchCard2.addClass(\\\"animated pulse matched\\\");\\n matches++;\\n if (matches === pairs) {\\n setTimeout(gameOver, 500);\\n }\\n }\",\n \"function quiescent() {\\n return Object.keys(self.persistences).length ===\\n self.lastObservedSize;\\n }\",\n \"function saveDoneBlock() {\\n\\n let blockAlreadyInserted = false;\\n for (let i = 0; i < playerLevelEnvironment.listOfBlocksInThePlayingArea.length; i++) {\\n if (playerLevelEnvironment.listOfBlocksInThePlayingArea[i].blockCounter === playerLevelEnvironment.blockCounter) {\\n blockAlreadyInserted = true;\\n }\\n }\\n\\n if (blockAlreadyInserted === false) {\\n try {\\n playerLevelEnvironment.listOfBlocksInThePlayingArea.push({\\n blockMap: blockMap[playerLevelEnvironment.blockIndex][playerLevelEnvironment.rotationIndex][playerLevelEnvironment.rotationIndex],\\n blockIndex: playerLevelEnvironment.blockIndex,\\n blockX: Math.floor(playerLevelEnvironment.xPlayArea / gameLevelEnvironment.pixelSize),\\n blockY: Math.floor(playerLevelEnvironment.yPlayArea / gameLevelEnvironment.pixelSize) - 1,\\n blockCounter: playerLevelEnvironment.blockCounter,\\n wasChecked: false\\n });\\n } catch(error) {\\n }\\n }\\n }\",\n \"function flush_block(eof) { // true if this is the last block for a file\\n\\t\\tvar opt_lenb, static_lenb, // opt_len and static_len in bytes\\n\\t\\t\\tmax_blindex, // index of last bit length code of non zero freq\\n\\t\\t\\tstored_len, // length of input block\\n\\t\\t\\ti;\\n\\n\\t\\tstored_len = strstart - block_start;\\n\\t\\tflag_buf[last_flags] = flags; // Save the flags for the last 8 items\\n\\n\\t\\t// Construct the literal and distance trees\\n\\t\\tbuild_tree(l_desc);\\n\\t\\t// Tracev((stderr, \\\"\\\\nlit data: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\n\\t\\tbuild_tree(d_desc);\\n\\t\\t// Tracev((stderr, \\\"\\\\ndist data: dyn %ld, stat %ld\\\",\\n\\t\\t// encoder->opt_len, encoder->static_len));\\n\\t\\t// At this point, opt_len and static_len are the total bit lengths of\\n\\t\\t// the compressed block data, excluding the tree representations.\\n\\n\\t\\t// Build the bit length tree for the above two trees, and get the index\\n\\t\\t// in bl_order of the last bit length code to send.\\n\\t\\tmax_blindex = build_bl_tree();\\n\\n\\t // Determine the best encoding. Compute first the block length in bytes\\n\\t\\topt_lenb = (opt_len + 3 + 7) >> 3;\\n\\t\\tstatic_lenb = (static_len + 3 + 7) >> 3;\\n\\n\\t// Trace((stderr, \\\"\\\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u \\\", opt_lenb, encoder->opt_len, static_lenb, encoder->static_len, stored_len, encoder->last_lit, encoder->last_dist));\\n\\n\\t\\tif (static_lenb <= opt_lenb) {\\n\\t\\t\\topt_lenb = static_lenb;\\n\\t\\t}\\n\\t\\tif (stored_len + 4 <= opt_lenb && block_start >= 0) { // 4: two words for the lengths\\n\\t\\t\\t// The test buf !== NULL is only necessary if LIT_BUFSIZE > WSIZE.\\n\\t\\t\\t// Otherwise we can't have processed more than WSIZE input bytes since\\n\\t\\t\\t// the last block flush, because compression would have been\\n\\t\\t\\t// successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\\n\\t\\t\\t// transform a block into a stored block.\\n\\t\\t\\tsend_bits((STORED_BLOCK << 1) + eof, 3); /* send block type */\\n\\t\\t\\tbi_windup(); /* align on byte boundary */\\n\\t\\t\\tput_short(stored_len);\\n\\t\\t\\tput_short(~stored_len);\\n\\n\\t\\t\\t// copy block\\n\\t\\t\\t/*\\n\\t\\t\\t\\tp = &window[block_start];\\n\\t\\t\\t\\tfor (i = 0; i < stored_len; i++) {\\n\\t\\t\\t\\t\\tput_byte(p[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t\\tfor (i = 0; i < stored_len; i++) {\\n\\t\\t\\t\\tput_byte(window[block_start + i]);\\n\\t\\t\\t}\\n\\t\\t} else if (static_lenb === opt_lenb) {\\n\\t\\t\\tsend_bits((STATIC_TREES << 1) + eof, 3);\\n\\t\\t\\tcompress_block(static_ltree, static_dtree);\\n\\t\\t} else {\\n\\t\\t\\tsend_bits((DYN_TREES << 1) + eof, 3);\\n\\t\\t\\tsend_all_trees(l_desc.max_code + 1, d_desc.max_code + 1, max_blindex + 1);\\n\\t\\t\\tcompress_block(dyn_ltree, dyn_dtree);\\n\\t\\t}\\n\\n\\t\\tinit_block();\\n\\n\\t\\tif (eof !== 0) {\\n\\t\\t\\tbi_windup();\\n\\t\\t}\\n\\t}\",\n \"function checkIfCompleted() {\\n if (_progress > 102) {\\n _recording = false;\\n $(\\\"#overLayMessage\\\").text(\\\"YOU CREATED A LEVEL\\\");\\n $(\\\"#recordButt\\\").css(\\\"visibility\\\", \\\"hidden\\\");\\n $(\\\"#restartButt2\\\").css(\\\"display\\\", \\\"block\\\");\\n $(\\\"#saveButt\\\").css(\\\"display\\\", \\\"block\\\");\\n console.log(_keyStrokes.length);\\n }\\n }\",\n \"function resetMatchCount() {\\n matchCount = 0;\\n}\",\n \"function isMatch () {\\n\\n\\tif(cardsInPlay[0] === cardsInPlay[1])\\n\\t\\t{\\n\\t\\talert('You found a match');\\n\\t\\tscore=score+1;\\n\\t\\tnumberOfLives=numberOfLives-1;\\n\\t\\tupdateLives();\\n\\t\\tupdateScore(score);\\n\\t\\tsetTimeout(clearCard(),10000);\\n\\t\\t\\n\\t\\t}\\n\\telse {\\n\\t\\talert('Sorry Try Again');\\n\\t\\tsetTimeout(clearCard(),10000);\\n\\t\\tnumberOfLives=numberOfLives-1;\\n\\t\\tupdateLives();\\n\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"update() {\\n this._updated = true;\\n let now = new Date().getTime();\\n if (now > this._lastDumpTime + this._interval) {\\n try {\\n this.dump();\\n }\\n catch (ex) {\\n // Todo: decide what to do\\n }\\n }\\n }\",\n \"function GotEverything() {\\n return entryInfo.entries.length >= entryInfo.totalCount;\\n }\",\n \"function saveMatchFile()\\n{\\n var fileData = header;\\n \\n for(var allianceIndex = 0; allianceIndex < $alliance.length; allianceIndex++)\\n {\\n for(var teamIndex = 0; teamIndex < $alliance[allianceIndex].length; teamIndex++)\\n {\\n // Team number\\n fileData += $alliance[allianceIndex][teamIndex].value + \\\",\\\";\\n \\n // Auto data\\n fileData += autoData[allianceIndex][teamIndex].high + \\\",\\\";\\n fileData += autoData[allianceIndex][teamIndex].low + \\\",\\\";\\n fileData += autoData[allianceIndex][teamIndex].hotHigh + \\\",\\\";\\n fileData += autoData[allianceIndex][teamIndex].hotLow + \\\",\\\";\\n fileData += autoData[allianceIndex][teamIndex].highAttempts + \\\",\\\";\\n \\n // Teleop data\\n fileData += teleopData[allianceIndex][teamIndex].high + \\\",\\\";\\n fileData += teleopData[allianceIndex][teamIndex].low + \\\",\\\";\\n fileData += teleopData[allianceIndex][teamIndex].passes + \\\",\\\";\\n fileData += teleopData[allianceIndex][teamIndex].truss + \\\",\\\";\\n fileData += teleopData[allianceIndex][teamIndex].highAttempts + \\\",\\\";\\n fileData += teleopData[allianceIndex][teamIndex].trussAttempts + \\\",\\\";\\n \\n // Tag data\\n fileData += tags[allianceIndex][teamIndex].offensive + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].offensiveSuccess + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].defensive + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].defensiveSuccess + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].broken + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].canCatch + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].looseGrip + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].twoBallAuto + \\\",\\\";\\n fileData += tags[allianceIndex][teamIndex].goodWithYou + \\\",\\\";\\n \\n // Comments\\n fileData += comments[allianceIndex][teamIndex] + \\\"\\\\n\\\";\\n }\\n }\\n \\n writeToFile(fileData, \\\"Match \\\" + $matchNumber.value + \\\".csv\\\");\\n reset();\\n}\",\n \"function deflate_stored(flush) {\\n\\t\\t // Stored blocks are limited to 0xffff bytes, pending_buf is limited\\n\\t\\t // to pending_buf_size, and each stored block has a 5 byte header:\\n\\t\\t var max_block_size = 0xffff;\\n\\t\\t var max_start;\\n \\n\\t\\t if (max_block_size > pending_buf_size - 5) {\\n\\t\\t\\tmax_block_size = pending_buf_size - 5;\\n\\t\\t } // Copy as much as possible from input to output:\\n \\n \\n\\t\\t while (true) {\\n\\t\\t\\t// Fill the window as much as possible:\\n\\t\\t\\tif (lookahead <= 1) {\\n\\t\\t\\t fill_window();\\n\\t\\t\\t if (lookahead === 0 && flush == Z_NO_FLUSH) return NeedMore;\\n\\t\\t\\t if (lookahead === 0) break; // flush the current block\\n\\t\\t\\t}\\n \\n\\t\\t\\tstrstart += lookahead;\\n\\t\\t\\tlookahead = 0; // Emit a stored block if pending_buf will be full:\\n \\n\\t\\t\\tmax_start = block_start + max_block_size;\\n \\n\\t\\t\\tif (strstart === 0 || strstart >= max_start) {\\n\\t\\t\\t // strstart === 0 is possible when wraparound on 16-bit machine\\n\\t\\t\\t lookahead = strstart - max_start;\\n\\t\\t\\t strstart = max_start;\\n\\t\\t\\t flush_block_only(false);\\n\\t\\t\\t if (strm.avail_out === 0) return NeedMore;\\n\\t\\t\\t} // Flush if we may have to slide, otherwise block_start may become\\n\\t\\t\\t// negative and the data will be gone:\\n \\n \\n\\t\\t\\tif (strstart - block_start >= w_size - MIN_LOOKAHEAD) {\\n\\t\\t\\t flush_block_only(false);\\n\\t\\t\\t if (strm.avail_out === 0) return NeedMore;\\n\\t\\t\\t}\\n\\t\\t }\\n \\n\\t\\t flush_block_only(flush == Z_FINISH);\\n\\t\\t if (strm.avail_out === 0) return flush == Z_FINISH ? FinishStarted : NeedMore;\\n\\t\\t return flush == Z_FINISH ? FinishDone : BlockDone;\\n\\t\\t}\",\n \"match(order, priceLevel) {\\n const matchingEventList = [];\\n let volume = 0;\\n\\n while (true) {\\n const tmpLLOE = this.orderMap.getFirstElementOfPriceLevel(priceLevel);\\n if (!tmpLLOE) break; // all orders at this price level are matched\\n\\n const tradedQuantity = Math.min(order.remainingQuantity(), tmpLLOE.order.remainingQuantity());\\n volume += tradedQuantity;\\n logger.info(`orderbookside.js: match(): matches counter order id=${tmpLLOE.order._id} with trade quantity=${tradedQuantity}`);\\n\\n tmpLLOE.order.filledQuantity += tradedQuantity;\\n order.filledQuantity += tradedQuantity;\\n\\n if (tmpLLOE.order.remainingQuantity() <= ZERO) tmpLLOE.order.filledQuantity = tmpLLOE.order.quantity;\\n if (order.remainingQuantity() <= ZERO) order.filledQuantity = order.quantity;\\n\\n matchingEventList.push(OrderBookEvent.createNewMatchObject(tmpLLOE.order, tradedQuantity, tmpLLOE.order.remainingQuantity() <= ZERO));\\n\\n if (tmpLLOE.order.remainingQuantity() <= ZERO) this.orderMap.removeOrder(tmpLLOE.order);\\n if (order.remainingQuantity() <= ZERO) break;\\n }\\n\\n return {\\n matchingEventList,\\n volume,\\n };\\n }\",\n \"function matchCheck() {\\n\\tif (openedCard[0].lastElementChild.classList.item(1) === openedCard[1].lastElementChild.classList.item(1)){\\n\\t\\topenedCard[0].classList.add('match');\\n\\t\\topenedCard[1].classList.add('match');\\n\\t\\tmatchedCount++;\\n\\t\\topenedCard = []; //to clear the openedCard array...\\n\\t\\tanimationFinished = true;\\n\\t\\t\\n\\t\\tif (matchedCount == 8) {\\n\\t\\tsetTimeout(function(){gameWon()},400); //you won...\\n\\t\\t}\\n\\t} else {\\n\\t\\tfailedCount ++;\\n\\t\\tstars();\\n\\t\\tsetTimeout(function() {turnBack()},500); //to delay time to turn the card...\\n\\t}\\n}\",\n \"count(value) {\\n let currentState;\\n if (this.currentTransactionIndex > -1) {\\n currentState = this.applyTransactions();\\n } else {\\n currentState = this.db;\\n }\\n\\n const keys = Object.keys(currentState);\\n let count = 0;\\n for (let i = 0; i < keys.length; i++) {\\n if (currentState[keys[i]] === value) {\\n count++;\\n }\\n }\\n\\n if (debug) {\\n console.log('db: ', currentState, '\\\\n');\\n }\\n return count;\\n }\",\n \"function ifMatching() {\\n playAudio(doubleWhip);\\n // add match class to both cards\\n for (c of open) {\\n c.card.classList.add('match', `level${currentLevel}`); // keep cards face up\\n }\\n matchedPairs += 1;\\n // if all pairs are matched, end level with popup\\n if (matchedPairs === iconCollections[currentLevel - 1].length) {\\n window.clearInterval(interval); // stop timer\\n setTimeout(congratsPopup, 700); // delay 0.7 seconds before popup\\n }\\n resetOpen();\\n}\",\n \"function scoreKeeper() {\\n for (i = 0; i < storeAnswers.length; i++) {\\n if (storeAnswers[i] === questionsArray[i].answer) {\\n correct++;\\n console.log(correct);\\n } else {\\n incorrect++;\\n }\\n }\\n }\",\n \"function checkStatus() {\\n\\n for (let card of cards) {\\n if (card.classList.contains('match')) {\\n counter++;\\n console.log(\\\"counter = \\\" + counter);\\n break;\\n }\\n }\\n if (counter == 8) {\\n saveScore();\\n displayScore();\\n }\\n }\",\n \"function checkMatch(){\\n\\t\\tplay = false;\\n\\t\\tif (checking[0] == checking[1]){\\n\\t\\t\\tlet t1 = setTimeout(function(){\\n\\t\\t\\t\\topenMatched();\\n\\t\\t\\t\\tplay = true;\\n\\t\\t\\t}, 500);\\n\\t\\t\\tif (matches <= 7){\\n\\t\\t\\t\\tmatches++;\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif (matches == 8){\\n\\t\\t\\t\\tlet t2 = setTimeout(function(){\\n\\t\\t\\t\\t\\talert(\\\"Well Done. Please Play Again!! \\\\nYou have won in \\\" + total_time + '\\\\nUsing ' + moves + ' Moves' + '\\\\nHaving ' + gstars + ' Stars');\\n\\t\\t\\t\\t\\tupdateCards();\\n\\t\\t\\t\\t\\tplay = true;\\n\\t\\t\\t\\t}, 500);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tlet t3 = setTimeout(function(){\\n\\t\\t\\t\\tparents[0].className = 'card';\\n\\t\\t\\t\\tif (parents[1] != null || parents[1] == undefined){\\n\\t\\t\\t\\t\\tparents[1].className = 'card';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tplay = true;\\n\\t\\t\\t}, 500);\\n\\t\\t}\\n}\",\n \"shouldFlush(sizes, buffer) {\\r\\n\\t\\tvar result = \\r\\n\\t\\t\\t(sizes.vertices + (buffer != null ? buffer.positionsIndex : 0) > this.MAX_BUFFER_SIZE) || \\r\\n\\t\\t\\t(sizes.indices + (buffer != null ? buffer.indicesIndex : 0) > this.MAX_BUFFER_SIZE * this.indicesVerticesFactor) ||\\r\\n\\t\\t\\t(sizes.lineIndices + (buffer != null ? buffer.lineIndicesIndex : 0) > this.MAX_BUFFER_SIZE * this.indicesVerticesFactor) ||\\r\\n\\t\\t\\t(sizes.pickColors + (buffer != null ? buffer.pickColorsIndex : 0) > this.MAX_BUFFER_SIZE * this.colorBufferFactor);\\r\\n\\t\\t\\r\\n\\t\\t// Not storing the results in a variable resulted in this always returning something that evaluates to false...\\r\\n\\t\\t\\r\\n\\t\\treturn result;\\r\\n\\t}\",\n \"function decodeMatch(match, data) {\\n rowProcessed = 0; // For debugging\\n togglePlayer = 0; // To toggle players between the games.\\n var score = [0, 0];\\n while(data.length > 0) {\\n var set = new Set();\\n if (!decodeSet(set, data)) {\\n return false;\\n }\\n // Store the set and the score before the win.\\n match.sets.push([[score[0], score[1]], set]);\\n score[set.winner]++;\\n if (score[0] == 3) {\\n match.winner = match.players[0];\\n return true;\\n } else if (score[1] == 3) {\\n match.winner = match.players[1];\\n return true;\\n }\\n }\\n // When run out of data, the set winner is the winner of the last set.\\n // In case this is a smaller 3 set match.\\n match.winner = match.players[match.sets[match.sets.length - 1][1].winner];\\n return true;\\n}\",\n \"calculateTrack () {\\n if (!this.prevTest.exists) {\\n return false;\\n }\\n\\n if (this.prevTest.data().shouldtrack) {\\n if (this.testCase.successful) {\\n // check how many subsequent passes there have been\\n if (this.prevTest.data().subsequentpasses < RESET_SUCCESS_COUNT) {\\n return true;\\n } else {\\n return false;\\n }\\n } else {\\n // the test was previously being tracked and failed, so continue tracking\\n return true;\\n }\\n } else {\\n if (this.testCase.successful) {\\n // the test is successful and previously untracked, so no need to track\\n return false;\\n } else if (this.prevTest.data().hasfailed && this.prevTest.data().passed) {\\n // the test is currently failing and has failed in a prior run, so track it\\n return true;\\n } else {\\n // this is the first time that the test is failing, so no need to track yet\\n return false;\\n }\\n }\\n }\",\n \"function checkMatch(){\\n if(flipOne == flipTwo){\\n points += 36;\\n console.log('Match!');\\n match++;\\n }\\n else{\\n timer = setTimeout(function(){\\n eventTarget1.style.transform = 'rotateY(0deg)';\\n eventTarget2.style.transform = 'rotateY(0deg)';\\n }, 750);\\n totalFlips--;\\n }\\n document.getElementById('points').innerHTML = ' ' + points;\\n document.getElementById('attempts').innerHTML = ' ' + totalFlips;\\n if(match == totalMatches){\\n document.getElementById('id02').style.display = 'block';\\n }\\n if(totalFlips == 0){\\n document.getElementById('id03').style.display = 'block';\\n }\\n}\",\n \"function whenSantaFirstEntersBasement() { \\n console.time('q = 2 santa-time');\\n fs.readFile('./data.txt', (err, data) => {\\n const directions = data.toString();\\n const directionsArray = directions.split('');\\n let accumalator = 0\\n let counter = 0\\n const answer = directionsArray.some((currentItem) => { \\n if(currentItem === '(') { \\n accumalator += 1\\n } else if(currentItem === ')') { \\n accumalator -=1\\n }\\n counter ++\\n return accumalator < 0;\\n })\\n console.timeEnd('q = 2 santa-time');\\n console.log('basement entered at: ',counter);\\n })\\n}\",\n \"function checkForPlayed() { // Function that resets the \\\"played\\\" counter\\n let playedCount = 0; // if all movies are \\\"played\\\"\\n\\n for(i=0; i!=keys.length; i++) {\\n if(db[keys[i]].played == true) {\\n playedCount++;\\n }\\n }\\n\\n if(playedCount == keys.length) {\\n for(i=0; i!=keys.length; i++) {\\n db[keys[i]].played = false;\\n }\\n }\\n}\",\n \"function matchCheck(){\\n return (points == match);\\n }\",\n \"function deflate_fast(flush) {\\n\\t\\t // short hash_head = 0; // head of the hash chain\\n\\t\\t var hash_head = 0; // head of the hash chain\\n \\n\\t\\t var bflush; // set if current block must be flushed\\n \\n\\t\\t while (true) {\\n\\t\\t\\t// Make sure that we always have enough lookahead, except\\n\\t\\t\\t// at the end of the input file. We need MAX_MATCH bytes\\n\\t\\t\\t// for the next match, plus MIN_MATCH bytes to insert the\\n\\t\\t\\t// string following the next match.\\n\\t\\t\\tif (lookahead < MIN_LOOKAHEAD) {\\n\\t\\t\\t fill_window();\\n \\n\\t\\t\\t if (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\\n\\t\\t\\t\\treturn NeedMore;\\n\\t\\t\\t }\\n \\n\\t\\t\\t if (lookahead === 0) break; // flush the current block\\n\\t\\t\\t} // Insert the string window[strstart .. strstart+2] in the\\n\\t\\t\\t// dictionary, and set hash_head to the head of the hash chain:\\n \\n \\n\\t\\t\\tif (lookahead >= MIN_MATCH) {\\n\\t\\t\\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\\n \\n\\t\\t\\t hash_head = head[ins_h] & 0xffff;\\n\\t\\t\\t prev[strstart & w_mask] = head[ins_h];\\n\\t\\t\\t head[ins_h] = strstart;\\n\\t\\t\\t} // Find the longest match, discarding those <= prev_length.\\n\\t\\t\\t// At this point we have always match_length < MIN_MATCH\\n \\n \\n\\t\\t\\tif (hash_head !== 0 && (strstart - hash_head & 0xffff) <= w_size - MIN_LOOKAHEAD) {\\n\\t\\t\\t // To simplify the code, we prevent matches with the string\\n\\t\\t\\t // of window index 0 (in particular we have to avoid a match\\n\\t\\t\\t // of the string with itself at the start of the input file).\\n\\t\\t\\t if (strategy != Z_HUFFMAN_ONLY) {\\n\\t\\t\\t\\tmatch_length = longest_match(hash_head);\\n\\t\\t\\t } // longest_match() sets match_start\\n \\n\\t\\t\\t}\\n \\n\\t\\t\\tif (match_length >= MIN_MATCH) {\\n\\t\\t\\t // check_match(strstart, match_start, match_length);\\n\\t\\t\\t bflush = _tr_tally(strstart - match_start, match_length - MIN_MATCH);\\n\\t\\t\\t lookahead -= match_length; // Insert new strings in the hash table only if the match length\\n\\t\\t\\t // is not too large. This saves time but degrades compression.\\n \\n\\t\\t\\t if (match_length <= max_lazy_match && lookahead >= MIN_MATCH) {\\n\\t\\t\\t\\tmatch_length--; // string at strstart already in hash table\\n \\n\\t\\t\\t\\tdo {\\n\\t\\t\\t\\t strstart++;\\n\\t\\t\\t\\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\\n \\n\\t\\t\\t\\t hash_head = head[ins_h] & 0xffff;\\n\\t\\t\\t\\t prev[strstart & w_mask] = head[ins_h];\\n\\t\\t\\t\\t head[ins_h] = strstart; // strstart never exceeds WSIZE-MAX_MATCH, so there are\\n\\t\\t\\t\\t // always MIN_MATCH bytes ahead.\\n\\t\\t\\t\\t} while (--match_length !== 0);\\n \\n\\t\\t\\t\\tstrstart++;\\n\\t\\t\\t } else {\\n\\t\\t\\t\\tstrstart += match_length;\\n\\t\\t\\t\\tmatch_length = 0;\\n\\t\\t\\t\\tins_h = window[strstart] & 0xff;\\n\\t\\t\\t\\tins_h = (ins_h << hash_shift ^ window[strstart + 1] & 0xff) & hash_mask; // If lookahead < MIN_MATCH, ins_h is garbage, but it does\\n\\t\\t\\t\\t// not\\n\\t\\t\\t\\t// matter since it will be recomputed at next deflate call.\\n\\t\\t\\t }\\n\\t\\t\\t} else {\\n\\t\\t\\t // No match, output a literal byte\\n\\t\\t\\t bflush = _tr_tally(0, window[strstart] & 0xff);\\n\\t\\t\\t lookahead--;\\n\\t\\t\\t strstart++;\\n\\t\\t\\t}\\n \\n\\t\\t\\tif (bflush) {\\n\\t\\t\\t flush_block_only(false);\\n\\t\\t\\t if (strm.avail_out === 0) return NeedMore;\\n\\t\\t\\t}\\n\\t\\t }\\n \\n\\t\\t flush_block_only(flush == Z_FINISH);\\n \\n\\t\\t if (strm.avail_out === 0) {\\n\\t\\t\\tif (flush == Z_FINISH) return FinishStarted;else return NeedMore;\\n\\t\\t }\\n \\n\\t\\t return flush == Z_FINISH ? FinishDone : BlockDone;\\n\\t\\t} // Same as above, but achieves better compression. We use a lazy\",\n \"function is_matched(k, v) {\\n $('.restart').attr(\\\"disabled\\\", false);\\n counter += 1;\\n if (counter == 1) {\\n timer();\\n }\\n $('.moves').html(counter);\\n if (matched_cards.length < 2) {\\n // change front img with img to compare\\n $('#' + k.id).children().attr('src', 'img/' + v + '.png');\\n if (matched_cards.length == 0) {\\n matched_cards.push(v);\\n memory.push(k.id);\\n }\\n else if (matched_cards.length == 1) {\\n matched_cards.push(v);\\n memory.push(k.id);\\n if (matched_cards[0] == matched_cards[1]) {\\n no_of_matches += 2;\\n matched_cards = [];\\n memory = [];\\n // if all cards are flipped\\n if (no_of_matches == cards.length) {\\n rating();\\n $('.modal').fadeIn().show();\\n $('.overlay').show();\\n clearInterval(interval);\\n }\\n }\\n //if 2 cards unmatched\\n else {\\n $('#' + k.id).children().attr('src', 'img/' + matched_cards[1] + '.png');\\n setTimeout(rest_unmatched, 1000);\\n }\\n }\\n \\n }\\n console.log(no_of_matches);\\n console.log(counter);\\n}\",\n \"async checkSaves(whisper = false) {\\n\\t\\tthis.saves = new Set();\\n\\t\\tthis.failedSaves = this.item?.hasAttack ? new Set(this.hitTargets) : new Set(this.targets);\\n\\t\\tthis.advantageSaves = new Set();\\n\\t\\tthis.disadvantageSaves = new Set();\\n\\t\\tthis.saveDisplayData = [];\\n\\t\\tif (debugEnabled > 1)\\n\\t\\t\\tdebug(`checkSaves: whisper ${whisper} hit targets ${this.hitTargets}`);\\n\\t\\tif (this.hitTargets.size <= 0) {\\n\\t\\t\\tthis.saveDisplayFlavor = `${i18n(\\\"midi-qol-relics.noSaveTargets\\\")}`;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tlet rollDC = this.saveItem.data.data.save.DC;\\n\\t\\tif (this.saveItem.getSaveDC) {\\n\\t\\t\\trollDC = this.saveItem.getSaveDC(); // TODO see if I need to do this for ammo as well\\n\\t\\t}\\n\\t\\tlet rollAbility = this.saveItem.data.data.save.ability;\\n\\t\\tlet promises = [];\\n\\t\\t//@ts-ignore actor.rollAbilitySave\\n\\t\\tvar rollAction = CONFIG.Actor.documentClass.prototype.rollAbilitySave;\\n\\t\\tvar rollType = \\\"save\\\";\\n\\t\\tif (this.saveItem.data.data.actionType === \\\"abil\\\") {\\n\\t\\t\\trollType = \\\"abil\\\";\\n\\t\\t\\t//@ts-ignore actor.rollAbilityTest\\n\\t\\t\\trollAction = CONFIG.Actor.documentClass.prototype.rollAbilityTest;\\n\\t\\t}\\n\\t\\t// make sure saving throws are renabled.\\n\\t\\tconst playerMonksTB = installedModules.get(\\\"monks-tokenbar\\\") && configSettings.playerRollSaves === \\\"mtb\\\";\\n\\t\\tlet monkRequests = [];\\n\\t\\tlet showRoll = configSettings.autoCheckSaves === \\\"allShow\\\";\\n\\t\\ttry {\\n\\t\\t\\tfor (let target of this.hitTargets) {\\n\\t\\t\\t\\tif (!target.actor)\\n\\t\\t\\t\\t\\tcontinue; // no actor means multi levels or bugged actor - but we won't roll a save\\n\\t\\t\\t\\tlet advantage = undefined;\\n\\t\\t\\t\\t// If spell, check for magic resistance\\n\\t\\t\\t\\tif (this.item.data.type === \\\"spell\\\") {\\n\\t\\t\\t\\t\\t// check magic resistance in custom damage reduction traits\\n\\t\\t\\t\\t\\t//@ts-ignore traits\\n\\t\\t\\t\\t\\tadvantage = (target?.actor?.data.data.traits?.dr?.custom || \\\"\\\").includes(i18n(\\\"midi-qol-relics.MagicResistant\\\"));\\n\\t\\t\\t\\t\\t// check magic resistance as a feature (based on the SRD name as provided by the Relics system)\\n\\t\\t\\t\\t\\tadvantage = advantage || target?.actor?.data.items.find(a => a.type === \\\"feat\\\" && a.name === i18n(\\\"midi-qol-relics.MagicResistanceFeat\\\")) !== undefined;\\n\\t\\t\\t\\t\\tif (advantage)\\n\\t\\t\\t\\t\\t\\tthis.advantageSaves.add(target);\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tadvantage = undefined;\\n\\t\\t\\t\\t\\tif (debugEnabled > 1)\\n\\t\\t\\t\\t\\t\\tdebug(`${target.actor.name} resistant to magic : ${advantage}`);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (this.saveItem.data.flags[\\\"midi-qol-relics\\\"]?.isConcentrationCheck) {\\n\\t\\t\\t\\t\\tif (getProperty(target.actor.data.flags, \\\"midi-qol-relics.advantage.concentration\\\")) {\\n\\t\\t\\t\\t\\t\\tadvantage = true;\\n\\t\\t\\t\\t\\t\\tthis.advantageSaves.add(target);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (getProperty(target.actor.data.flags, \\\"midi-qol-relics.disadvantage.concentration\\\")) {\\n\\t\\t\\t\\t\\t\\tadvantage = false;\\n\\t\\t\\t\\t\\t\\tthis.disadvantageSaves.add(target);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tvar player = playerFor(target);\\n\\t\\t\\t\\tif (!player)\\n\\t\\t\\t\\t\\tplayer = ChatMessage.getWhisperRecipients(\\\"GM\\\").find(u => u.active);\\n\\t\\t\\t\\tlet promptPlayer = (!player?.isGM && configSettings.playerRollSaves !== \\\"none\\\");\\n\\t\\t\\t\\tlet GMprompt;\\n\\t\\t\\t\\tlet gmMonksTB;\\n\\t\\t\\t\\tif (player?.isGM) {\\n\\t\\t\\t\\t\\tconst monksTBSetting = target.document.isLinked ? configSettings.rollNPCLinkedSaves === \\\"mtb\\\" : configSettings.rollNPCSaves === \\\"mtb\\\";\\n\\t\\t\\t\\t\\tgmMonksTB = installedModules.get(\\\"monks-tokenbar\\\") && monksTBSetting;\\n\\t\\t\\t\\t\\tGMprompt = (target.document.isLinked ? configSettings.rollNPCLinkedSaves : configSettings.rollNPCSaves);\\n\\t\\t\\t\\t\\tpromptPlayer = GMprompt !== \\\"auto\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif ((!player?.isGM && playerMonksTB) || (player?.isGM && gmMonksTB)) {\\n\\t\\t\\t\\t\\tpromises.push(new Promise((resolve) => {\\n\\t\\t\\t\\t\\t\\tlet requestId = target.id;\\n\\t\\t\\t\\t\\t\\tthis.saveRequests[requestId] = resolve;\\n\\t\\t\\t\\t\\t}));\\n\\t\\t\\t\\t\\t// record the targes to save.\\n\\t\\t\\t\\t\\tmonkRequests.push(target);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (promptPlayer && player?.active) {\\n\\t\\t\\t\\t\\t//@ts-ignore CONFIG.RELICS\\n\\t\\t\\t\\t\\tif (debugEnabled > 0)\\n\\t\\t\\t\\t\\t\\twarn(`Player ${player?.name} controls actor ${target.actor.name} - requesting ${CONFIG.RELICS.abilities[this.saveItem.data.data.save.ability]} save`);\\n\\t\\t\\t\\t\\tpromises.push(new Promise((resolve) => {\\n\\t\\t\\t\\t\\t\\tlet requestId = target.actor?.id ?? randomID();\\n\\t\\t\\t\\t\\t\\tconst playerId = player?.id;\\n\\t\\t\\t\\t\\t\\tif ([\\\"letme\\\", \\\"letmeQuery\\\"].includes(configSettings.playerRollSaves) && installedModules.get(\\\"lmrtfy\\\"))\\n\\t\\t\\t\\t\\t\\t\\trequestId = randomID();\\n\\t\\t\\t\\t\\t\\tif ([\\\"letme\\\", \\\"letmeQuery\\\"].includes(GMprompt) && installedModules.get(\\\"lmrtfy\\\"))\\n\\t\\t\\t\\t\\t\\t\\trequestId = randomID();\\n\\t\\t\\t\\t\\t\\tthis.saveRequests[requestId] = resolve;\\n\\t\\t\\t\\t\\t\\trequestPCSave(this.saveItem.data.data.save.ability, rollType, player, target.actor, advantage, this.saveItem.name, rollDC, requestId, GMprompt);\\n\\t\\t\\t\\t\\t\\t// set a timeout for taking over the roll\\n\\t\\t\\t\\t\\t\\tif (configSettings.playerSaveTimeout > 0) {\\n\\t\\t\\t\\t\\t\\t\\tthis.saveTimeouts[requestId] = setTimeout(async () => {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (this.saveRequests[requestId]) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdelete this.saveRequests[requestId];\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdelete this.saveTimeouts[requestId];\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tlet result;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!game.user?.isGM && configSettings.autoCheckSaves === \\\"allShow\\\") {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// non-gm users don't have permission to create chat cards impersonating the GM so hand the role to a GM client\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tresult = await socketlibSocket.executeAsGM(\\\"rollAbility\\\", {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\ttargetUuid: target.actor?.uuid ?? \\\"\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\trequest: rollType,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tability: this.saveItem.data.data.save.ability,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tshowRoll,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\toptions: { messageData: { user: playerId }, chatMessage: showRoll, mapKeys: false, advantage: advantage === true, disadvantage: advantage === false, fastForward: true },\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tresult = await rollAction.bind(target.actor)(this.saveItem.data.data.save.ability, { messageData: { user: playerId }, chatMessage: showRoll, mapKeys: false, advantage: advantage === true, disadvantage: advantage === false, fastForward: true });\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tresolve(result);\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}, (configSettings.playerSaveTimeout || 1) * 1000);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse { // GM to roll save\\n\\t\\t\\t\\t\\t// Find a player owner for the roll if possible\\n\\t\\t\\t\\t\\tlet owner = playerFor(target);\\n\\t\\t\\t\\t\\tif (owner)\\n\\t\\t\\t\\t\\t\\tshowRoll = true; // Always show player save rolls\\n\\t\\t\\t\\t\\t// If no player owns the token, find an active GM\\n\\t\\t\\t\\t\\tif (!owner)\\n\\t\\t\\t\\t\\t\\towner = game.users?.find((u) => u.isGM && u.active);\\n\\t\\t\\t\\t\\t// Fall back to rolling as the current user\\n\\t\\t\\t\\t\\tif (!owner)\\n\\t\\t\\t\\t\\t\\towner = game.user ?? undefined;\\n\\t\\t\\t\\t\\tpromises.push(socketlibSocket.executeAsUser(\\\"rollAbility\\\", owner?.id, {\\n\\t\\t\\t\\t\\t\\ttargetUuid: target.actor.uuid,\\n\\t\\t\\t\\t\\t\\trequest: rollType,\\n\\t\\t\\t\\t\\t\\tability: this.saveItem.data.data.save.ability,\\n\\t\\t\\t\\t\\t\\tshowRoll,\\n\\t\\t\\t\\t\\t\\toptions: { messageData: { user: owner?.id }, chatMessage: showRoll, mapKeys: false, advantage: advantage === true, disadvantage: advantage === false, fastForward: true },\\n\\t\\t\\t\\t\\t}));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcatch (err) {\\n\\t\\t\\tconsole.warn(err);\\n\\t\\t}\\n\\t\\tfinally {\\n\\t\\t}\\n\\t\\tif (monkRequests.length > 0) {\\n\\t\\t\\tsocketlibSocket.executeAsGM(\\\"monksTokenBarSaves\\\", {\\n\\t\\t\\t\\ttokens: monkRequests.map(t => t.document.uuid),\\n\\t\\t\\t\\trequest: `save:${this.saveItem.data.data.save.ability}`,\\n\\t\\t\\t\\tsilent: true,\\n\\t\\t\\t\\trollMode: \\\"gmroll\\\"\\n\\t\\t\\t});\\n\\t\\t}\\n\\t\\t;\\n\\t\\tif (debugEnabled > 1)\\n\\t\\t\\tdebug(\\\"check saves: requests are \\\", this.saveRequests);\\n\\t\\tvar results = await Promise.all(promises);\\n\\t\\tthis.saveResults = results;\\n\\t\\tlet i = 0;\\n\\t\\tfor (let target of this.hitTargets) {\\n\\t\\t\\tif (!target.actor)\\n\\t\\t\\t\\tcontinue; // these were skipped when doing the rolls so they can be skipped now\\n\\t\\t\\tif (!results[i])\\n\\t\\t\\t\\terror(\\\"Token \\\", target, \\\"could not roll save/check assuming 0\\\");\\n\\t\\t\\tconst result = results[i];\\n\\t\\t\\tlet rollTotal = results[i]?.total || 0;\\n\\t\\t\\tlet rollDetail = results[i];\\n\\t\\t\\tif (result?.terms[0]?.options?.advantage)\\n\\t\\t\\t\\tthis.advantageSaves.add(target);\\n\\t\\t\\tif (result?.terms[0]?.options?.disadvantage)\\n\\t\\t\\t\\tthis.disadvantageSaves.add(target);\\n\\t\\t\\tlet isFumble = false;\\n\\t\\t\\tlet isCritical = false;\\n\\t\\t\\tif (rollDetail.terms && checkRule(\\\"criticalSaves\\\") && rollDetail.terms[0] instanceof DiceTerm) { // normal d20 roll/lmrtfy/monks roll\\n\\t\\t\\t\\tconst dterm = rollDetail.terms[0];\\n\\t\\t\\t\\t//@ts-ignore\\n\\t\\t\\t\\tisFumble = dterm.total <= (dterm.options?.fumble ?? 1);\\n\\t\\t\\t\\t//@ts-ignore\\n\\t\\t\\t\\tisCritical = dterm.total >= (dterm.options?.critical ?? 20);\\n\\t\\t\\t}\\n\\t\\t\\telse if (result.isBR && checkRule(\\\"criticalSaves\\\"))\\n\\t\\t\\t\\tisCritical = result.isCritical;\\n\\t\\t\\tlet saved = (isCritical || rollTotal >= rollDC) && !isFumble;\\n\\t\\t\\tif (this.checkSuperSaver(target.actor, this.saveItem.data.data.save.ability))\\n\\t\\t\\t\\tthis.superSavers.add(target);\\n\\t\\t\\tif (this.item.data.flags[\\\"midi-qol-relics\\\"]?.isConcentrationCheck) {\\n\\t\\t\\t\\tconst checkBonus = getProperty(target, \\\"actor.data.flags.midi-qol-relics.concentrationSaveBonus\\\");\\n\\t\\t\\t\\tif (checkBonus) {\\n\\t\\t\\t\\t\\tconst rollBonus = (await new Roll(checkBonus, target.actor?.getRollData()).evaluate({ async: true })).total;\\n\\t\\t\\t\\t\\trollTotal += rollBonus;\\n\\t\\t\\t\\t\\trollDetail = (await new Roll(`${rollDetail.result} + ${rollBonus}`).evaluate({ async: true }));\\n\\t\\t\\t\\t\\tsaved = (isCritical || rollTotal >= rollDC) && !isFumble; //TODO see if bonus can change critical/fumble\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (saved) {\\n\\t\\t\\t\\tthis.saves.add(target);\\n\\t\\t\\t\\tthis.failedSaves.delete(target);\\n\\t\\t\\t}\\n\\t\\t\\tif (game.user?.isGM)\\n\\t\\t\\t\\tlog(`Ability save/check: ${target.name} rolled ${rollTotal} vs ${rollAbility} DC ${rollDC}`);\\n\\t\\t\\tlet saveString = i18n(saved ? \\\"midi-qol-relics.save-success\\\" : \\\"midi-qol-relics.save-failure\\\");\\n\\t\\t\\tlet adv = this.advantageSaves.has(target) ? `(${i18n(\\\"RELICS.Advantage\\\")})` : \\\"\\\";\\n\\t\\t\\tif (this.disadvantageSaves.has(target))\\n\\t\\t\\t\\tadv = `(${i18n(\\\"RELICS.Disadvantage\\\")})`;\\n\\t\\t\\tif (game.system.id === \\\"sw5e\\\") {\\n\\t\\t\\t\\tadv = this.advantageSaves.has(target) ? `(${i18n(\\\"SW5E.Advantage\\\")})` : \\\"\\\";\\n\\t\\t\\t\\tif (this.disadvantageSaves.has(target))\\n\\t\\t\\t\\t\\tadv = `(${i18n(\\\"SW5E.Disadvantage\\\")})`;\\n\\t\\t\\t}\\n\\t\\t\\tlet img = target.data.img ?? target.actor.img ?? \\\"\\\";\\n\\t\\t\\tif (configSettings.usePlayerPortrait && target.actor.data.type === \\\"character\\\")\\n\\t\\t\\t\\timg = target.actor?.img ?? target.data.img ?? \\\"\\\";\\n\\t\\t\\tif (VideoHelper.hasVideoExtension(img)) {\\n\\t\\t\\t\\timg = await game.video.createThumbnail(img, { width: 100, height: 100 });\\n\\t\\t\\t}\\n\\t\\t\\tlet isPlayerOwned = target.actor.hasPlayerOwner;\\n\\t\\t\\tthis.saveDisplayData.push({\\n\\t\\t\\t\\tgmName: target.name,\\n\\t\\t\\t\\tplayerName: getTokenPlayerName(target),\\n\\t\\t\\t\\timg,\\n\\t\\t\\t\\tisPC: isPlayerOwned,\\n\\t\\t\\t\\ttarget,\\n\\t\\t\\t\\tsaveString,\\n\\t\\t\\t\\trollTotal,\\n\\t\\t\\t\\trollDetail,\\n\\t\\t\\t\\tid: target.id,\\n\\t\\t\\t\\tadv\\n\\t\\t\\t});\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\t\\tif (this.item.data.data.actionType !== \\\"abil\\\")\\n\\t\\t\\t//@ts-ignore CONFIG.RELICS\\n\\t\\t\\tthis.saveDisplayFlavor = `${this.item.name} ${CONFIG.RELICS.abilities[rollAbility]} ${i18n(this.hitTargets.size > 1 ? \\\"midi-qol-relics.saving-throws\\\" : \\\"midi-qol-relics.saving-throw\\\")}:`;\\n\\t\\telse\\n\\t\\t\\t//@ts-ignore CONFIG.RELICS\\n\\t\\t\\tthis.saveDisplayFlavor = `${this.item.name} ${CONFIG.RELICS.abilities[rollAbility]} ${i18n(this.hitTargets.size > 1 ? \\\"midi-qol-relics.ability-checks\\\" : \\\"midi-qol-relics.ability-check\\\")}:`;\\n\\t}\",\n \"function testFlush(suitArray){\\n let findSame1 = 0;\\n for(let i = 0; i < suitArray.length - 1; i++){\\n if(suitArray[i] === suitArray[i + 1]){\\n findSame1 += 1;\\n }\\n }\\n return findSame1 === 4;\\n }\",\n \"finished() {\\n const target = Game.getObjectById(this.params.targetId);\\n if (target.hits <= 0) {\\n return true;\\n }\\n }\",\n \"function addHitAndCheckWin() {\\n numHits++;\\n console.log(numHits);\\n return numHits >= maxHits;\\n}\",\n \"function countSave(count) {\\n saveAll += count;\\n countAllSavings();\\n }\",\n \"function checkWin() {\\n match_found += 1;\\n if (match_found === 8) {\\n showResults();\\n }\\n}\",\n \"function checkForMatch() {\\n\\tif (\\n\\t\\ttoggledCards[0].firstElementChild.className === toggledCards[1].firstElementChild.className\\n\\t) {\\n\\t\\t// if the cards do match, lock the cards in the open position (put this functionality in another function that you call from this one)\\n\\t\\ttoggleMatchCard(toggledCards[0]);\\n\\t\\ttoggleMatchCard(toggledCards[1]);\\n\\t\\ttoggledCards = [];\\n\\t\\tmatched++;\\n\\t\\t// stop the game if TOTAL_PAIRS reached with a timeout of 1000\\n\\t\\tsetTimeout(() => {\\n\\t\\t\\tif (matched === TOTAL_PAIRS) {\\n\\t\\t\\t\\tgameOver();\\n\\t\\t\\t}\\n\\t\\t}, 1000);\\n\\t}else{\\n\\t\\t//setTimeOut is a callback function that runs after the designated time expires.\\n\\t\\tsetTimeout(() => {\\n\\t\\t\\t// if the cards do not match, remove the cards from the list and hide the card's symbol (put this functionality in another function that you call from this one)\\n\\t\\t\\ttoggleCard(toggledCards[0]);\\n\\t\\t\\ttoggleCard(toggledCards[1]);\\n\\t\\t\\ttoggledCards = [];\\n\\t\\t}, 1000);\\n\\n\\t}\\n}\",\n \"function checkAllAFK(match, teamId, row) {\\n\\n /*\\n We define AFK to be having 35% or less XP than the average\\n Where the average doesn't consider non-zero entities\\n NOTE: We are testing 35% right now based on a a previous game to see if it breaks anything by being that high\\n There was a game I got crushed in but I still had 52%, I expect as high as 40% is okay\\n 47% definitely broke it\\n 35% broke it and the value it broke on was 28%\\n I'm leaving it at 35 but if I publish, 25% is a better value\\n */\\n var deltas = [];\\n var deltaTimes = ['0-10', '10-20', '20-30', '30-end'];\\n var myAFK = 0;\\n var theirAFK = 0;\\n var afk = false;\\n for(var i = 0; i < 10; i++) {\\n deltas.push(getXPPerMinuteDelta(match['participants'][i]));\\n }\\n var averageDeltas = getAverageDeltas(deltas, deltaTimes);\\n for(var i = 0; i < deltas.length; i++) {\\n for(var j = 0; j < deltaTimes.length; j++) {\\n if(deltas[i][deltaTimes[j]] <= (averageDeltas[deltaTimes[j]] * 0.35)) {\\n if(match['participants'][i]['teamId'] == teamId) {\\n myAFK++;\\n }\\n else {\\n theirAFK++;\\n }\\n break;\\n }\\n }\\n }\\n setCell('My AFK', row, myAFK);\\n setCell('Their AFK', row, theirAFK);\\n}\",\n \"function checkMatch() {\\n const firstCardClass = openCards[0].firstElementChild.className;\\n const secondCardClass = openCards[1].firstElementChild.className;\\n if (firstCardClass === secondCardClass) {\\n //locks cards in open position\\n doMatch();\\n } else {\\n //flips cards over again\\n setTimeout(removeCards, 1000);\\n }\\n //increases move and star counter\\n moveCount();\\n starCount();\\n}\",\n \"async _saveLastSeqIfNeeded() {\\n // Is it time to save the lastSeq again?\\n if (new Date().getTime() - this._seqLastSaved.getTime() >= this._saveSeqAfterSeconds * 1000) {\\n await this._saveLastSeq()\\n }\\n }\",\n \"function quest2() {\\n fs.readFile('./santa.txt', (err, data) => {\\n console.time('santaTime');\\n const directions = data.toString();\\n const directionsArray = directions.split('');\\n let accumulator = 0\\n let counter = 0\\n const answer = directionsArray.some((currentItem) => {\\n if (currentItem === '(') {\\n accumulator += 1\\n } else if (currentItem === ')') {\\n accumulator -= 1\\n }\\n counter ++\\n return accumulator <0; //ends the function when 0 is reached\\n })\\n console.timeEnd('santaTime');\\n console.log('basement entry at: ', counter);\\n })\\n}\",\n \"record(count) {\\n\\t\\tvar score = acc_helper(global.barCoords[this.state.target_index].rot, this.state.user_rotation);\\n\\t\\tvar url = 'https://filtergraph.com/aiw/default/log_scores?';\\n\\t\\turl += 'score=' + String(score) + '&';\\n\\t\\turl += 'test_name=' + this.state.test_name + '&';\\n\\t\\turl += 'user_ID=' + global.user_ID + '&';\\n\\t\\turl += 'test_ID=' + global.test_ID + '&';\\n\\t\\turl += 'key=' + global.key;\\n\\t\\tfetch(url)\\n\\t\\t\\t.then((response) => response.text())\\n\\t\\t\\t.then((responseText) => {\\n\\t\\t\\t\\tconsole.log(\\\"backend receipt: \\\" + this.state.test_name + \\\", screen \\\"\\n\\t\\t\\t\\t+ String(count) + \\\", score \\\" + String(score) + ': ' + responseText);\\n\\t\\t\\t})\\n\\t\\t\\t.catch((error) => {\\n\\t\\t\\t\\tconsole.error(error);\\n\\t\\t\\t\\tAlert(\\\"Something went wrong. Please check your connection.\\\");\\n\\t\\t\\t});\\n\\t\\treturn score;\\n\\t}\",\n \"function checkForMatch(){\\n\\tif (toggledCards[0].firstElementChild.className === toggledCards[1].firstElementChild.className){\\t\\t\\n\\t\\tconsole.log('Matched');\\n\\t\\ttoggledCards[0].classList.toggle('match')\\n\\t\\ttoggledCards[1].classList.toggle('match')\\n\\t\\ttoggledCards = [];\\n\\t\\tmatched++;\\n\\t\\tconsole.log(matched);\\n\\t} else {\\n\\t setTimeout(() => {\\n\\t\\tconsole.log('No Match');\\n\\t\\ttoggleCard(toggledCards[0]);\\n\\t\\ttoggleCard(toggledCards[1]);\\n\\t\\ttoggledCards = [];\\n\\t }, 1000);\\n }\\n if (matched === 8) {\\n gameOver();\\n }\\n}\",\n \"flush() {\\n if (!this._replay || !this._replay.isEnabled()) {\\n return;\\n }\\n\\n return this._replay.flushImmediate();\\n }\",\n \"function matcher (record) {\\n this.depth = this.depth || 1 // depth tracking starts at level 1\\n this.tracker = this.tracker || 0 // for basic sums, start counter at 0\\n const subTotal = this.tracker + record\\n // Found a match in the specified with desired qty of results, don't keep searching!\\n if (subTotal === this.target && this.depth >= goal) {\\n results.push(record)\\n return true\\n }\\n // When subtotal exceeds target, return immediately and don't waste time\\n // on more loops that won't get results\\n if (subTotal > this.target) {\\n return false\\n }\\n // If we're already at max depth, don't waste time on more loops\\n if (this.depth >= this.maxDepth) {\\n return false\\n }\\n // Check the next level down\\n const res = records.find(matcher, {\\n maxDepth: this.maxDepth,\\n target: this.target,\\n depth: this.depth + 1,\\n tracker: this.tracker + record\\n })\\n // Propogate maches back up the recursion chain, capturing each\\n if (res) {\\n results.push(record)\\n return true\\n }\\n // Nothing found with this combo, step to the next sibling\\n return false\\n }\",\n \"function registerFrequency(frequency){\\n\\n\\t// need to store frequency in a data structure that allows O(1) look up on the phase and\\n\\t// the counts of repeats, there are two separate JS objects being used to achieve this.\\n\\t// There is an inherent need to ensure that these two data structures are kept in sync for\\n\\t// the relationships between them to remain true.\\n\\n\\t// Does the passed frequency exist in the store yet?\\n\\tif (frequenciesSeen[frequency]) {\\n\\n\\t\\tlet countPassedFrequencySeen = frequenciesSeen[frequency];\\n\\n\\t\\t// Remove the frequency from the repeatsOfFrequencies Object for the current frequency count\\n\\t\\t\\n\\t\\t// If present in the repeatsOfFrequencies object already remove it\\n\\t\\tif (repeatsOfFrequencies[countPassedFrequencySeen] && repeatsOfFrequencies[countPassedFrequencySeen][frequency]) {\\n\\t\\t\\tdelete repeatsOfFrequencies[countPassedFrequencySeen][frequency]\\n\\t\\t}\\n\\n\\t\\t// Increment the value for passed frequency in the store\\n\\t\\tfrequenciesSeen[frequency] = frequenciesSeen[frequency] + 1;\\n\\n\\n // Create object for the current count if it does not exist\\n if (!repeatsOfFrequencies[countPassedFrequencySeen]) {\\n repeatsOfFrequencies[countPassedFrequencySeen] = {};\\n }\\n\\n // Add to repeatsOfFrequencies object\\n\\t\\trepeatsOfFrequencies[countPassedFrequencySeen][frequency] = {egg: true};\\n\\n console.log(`seen ${frequency} at least twice now...`)\\n\\n\\t} else {\\n\\t\\t// Add passed frequency to the store\\n\\t\\tfrequenciesSeen[frequency] = 1;\\n\\n\\t\\t\\n\\n\\t}\\n\\n}\",\n \"function checkMatches(drawData) {\\n const { winningNumbers, drawedSets} = drawData;\\n //const numAmount = winningNumbers.size;\\n for (set of drawedSets) {\\n set.match = 0;\\n for (let num of set.numbers) {\\n if (winningNumbers.includes(num)) {\\n set.match++;\\n }\\n }\\n }\\n //console.log(winningNumbers, drawedSets);\\n}\",\n \"function checkForWin() {\\n matchesFound += 1;\\n if (matchesFound == 8) {\\n showResults();\\n }\\n}\",\n \"markOpenCardsAsMatch() {\\n this.matchedCards.push(this.openCards[0], this.openCards[1]);\\n this.openCards.forEach((card) => {\\n setTimeout(this.markCardAsMatch.bind(this, card), 500);\\n });\\n if (this.matchedCards.length === 16) {\\n setTimeout(() => {\\n this.hideDeck();\\n this.displaySuccessMessage();\\n }, 2000);\\n this.scoringHandler.stopTimer();\\n }\\n\\n this.openCards = [];\\n }\",\n \"_attemptToMatchHash() {\\n attemptToMatchHash(this, this.savedHash, defaultSuccessHandler);\\n }\",\n \"function countUpdate() {\\n\\n\\tconsole.log('\\\\nnew call');\\n\\n \\t// if we should block, count blocked time\\n\\tvar blocked = JSON.parse(localStorage[\\\"blockVar\\\"]);\\n\\tif (blocked) {\\n\\t\\tcheckBlock();\\n\\t\\treturn;\\n\\t}\\n\\n\\tchrome.idle.queryState(30, function (state) {\\n \\tchrome.windows.getCurrent(function (current) {\\n\\n \\t\\t// count time is browser is in use\\n\\t\\t\\tif (state === \\\"active\\\" || current.state === \\\"fullscreen\\\") {\\n \\t\\t\\t\\tchrome.tabs.query({active: true, currentWindow: true}, \\n \\t\\t\\t\\t\\tfunction (tabs) {\\n\\n\\n\\t\\t\\t\\t\\t// if we shouldn't block, count wasted time\\n\\t\\t\\t\\t\\tif (tabs.length === 0) return;\\n\\n\\t\\t\\t\\t\\tvar tab = tabs[0];\\n\\t\\t\\t\\t\\t// get current Domain\\n\\t\\t\\t\\t\\tvar current = getDomain(tab.url);\\t\\n\\n\\t\\t\\t\\t\\t// a problem cause undefined\\n\\t\\t\\t\\t\\tconsole.log(localStorage[\\\"domHash\\\"]);\\n \\t\\t\\t\\t\\tvar dH = JSON.parse(localStorage[\\\"domHash\\\"]);\\n \\t\\t\\tif (dH !== undefined) {\\n\\t\\t\\t\\t\\t\\tconsole.log('domHash got');\\n\\t\\t\\t\\t\\t\\tconsole.log('current domain is ' + current);\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t// get the hashed domain\\n\\t\\t\\t\\t\\t\\tvar found = 'false';\\n\\t\\t\\t\\t\\t\\tfor (var k in dH) {\\n \\t\\t\\t\\t\\t\\tif (k === current) {\\n \\t\\t\\t\\t\\t\\t\\tconsole.log('match found!');\\n \\t\\t\\t\\t\\t\\t\\tdH[k] += UPDATE_SECONDS;\\n \\t\\t\\t\\t\\t\\t\\t\\tconsole.log(dH);\\n\\t\\t\\t\\t\\t\\t\\t\\tfound = 'true';\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (found === 'true') {\\n\\t\\t\\t\\t\\t\\t\\tconsole.log(' updating...');\\n\\t\\t\\t\\t\\t\\t\\tlocalStorage[\\\"domHash\\\"] = JSON.stringify(dH);\\n\\t\\t\\t\\t\\t\\t\\tconsole.log(\\\"domHash updated!\\\");\\n\\t\\t\\t\\t\\t\\t\\tcountSum();\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse console.log('no change needed');\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse console.log('PANIC: Hash table does not exist!');\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t\\telse console.log('state inactive; no update needed.');\\n\\t\\t});\\n\\t});\\n}\",\n \"countTracked() {\\n return(Object.keys(tTracked).length)\\n }\",\n \"function isCompleted() {\\n return cards.length === matchedCards.length;\\n}\",\n \"async function matchCollector() {\\n // retrieve all active challenges\\n console.log('**** Match Collector ****');\\n let challengeCount = await codbets_reader.challengeCount();\\n challengeCount = ethers.BigNumber.from(challengeCount).toNumber();\\n console.log(`Current challenge count is ${challengeCount}`);\\n\\n if (challengeCount == 0) return;\\n // Loop through all existing challenge Ids\\n for (let challengeId = 1; challengeId <= challengeCount; challengeId++) {\\n // - retrieve the challenge struct\\n challenge = await codbets_reader.challenges(challengeId);\\n\\n if (challenge.settled) continue;\\n if (!challenge.accepted) continue;\\n\\n // - call matchFinder()\\n const matchId = await matchFinder(challenge.gamertag1, challenge.gamertag2);\\n // - with return matchId, call fetchWinner(matchId, gamertag1, gamertag2, challengeId)\\n if (matchId) {\\n console.log(`Match Id ${matchId} found for Challenge id ${challengeId}`);\\n await codbets_writer.fetchWinner(\\n matchId,\\n challenge.gamertag1,\\n challenge.gamertag2,\\n challengeId\\n );\\n } else {\\n console.log(`No matches found for Challenge id ${challengeId}`);\\n }\\n }\\n //\\n}\",\n \"isFree() {\\n return this.track === FREE;\\n }\",\n \"function deflate_slow(flush) {\\n\\t\\t // short hash_head = 0; // head of hash chain\\n\\t\\t var hash_head = 0; // head of hash chain\\n \\n\\t\\t var bflush; // set if current block must be flushed\\n \\n\\t\\t var max_insert; // Process the input block.\\n \\n\\t\\t while (true) {\\n\\t\\t\\t// Make sure that we always have enough lookahead, except\\n\\t\\t\\t// at the end of the input file. We need MAX_MATCH bytes\\n\\t\\t\\t// for the next match, plus MIN_MATCH bytes to insert the\\n\\t\\t\\t// string following the next match.\\n\\t\\t\\tif (lookahead < MIN_LOOKAHEAD) {\\n\\t\\t\\t fill_window();\\n \\n\\t\\t\\t if (lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {\\n\\t\\t\\t\\treturn NeedMore;\\n\\t\\t\\t }\\n \\n\\t\\t\\t if (lookahead === 0) break; // flush the current block\\n\\t\\t\\t} // Insert the string window[strstart .. strstart+2] in the\\n\\t\\t\\t// dictionary, and set hash_head to the head of the hash chain:\\n \\n \\n\\t\\t\\tif (lookahead >= MIN_MATCH) {\\n\\t\\t\\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\\n \\n\\t\\t\\t hash_head = head[ins_h] & 0xffff;\\n\\t\\t\\t prev[strstart & w_mask] = head[ins_h];\\n\\t\\t\\t head[ins_h] = strstart;\\n\\t\\t\\t} // Find the longest match, discarding those <= prev_length.\\n \\n \\n\\t\\t\\tprev_length = match_length;\\n\\t\\t\\tprev_match = match_start;\\n\\t\\t\\tmatch_length = MIN_MATCH - 1;\\n \\n\\t\\t\\tif (hash_head !== 0 && prev_length < max_lazy_match && (strstart - hash_head & 0xffff) <= w_size - MIN_LOOKAHEAD) {\\n\\t\\t\\t // To simplify the code, we prevent matches with the string\\n\\t\\t\\t // of window index 0 (in particular we have to avoid a match\\n\\t\\t\\t // of the string with itself at the start of the input file).\\n\\t\\t\\t if (strategy != Z_HUFFMAN_ONLY) {\\n\\t\\t\\t\\tmatch_length = longest_match(hash_head);\\n\\t\\t\\t } // longest_match() sets match_start\\n \\n \\n\\t\\t\\t if (match_length <= 5 && (strategy == Z_FILTERED || match_length == MIN_MATCH && strstart - match_start > 4096)) {\\n\\t\\t\\t\\t// If prev_match is also MIN_MATCH, match_start is garbage\\n\\t\\t\\t\\t// but we will ignore the current match anyway.\\n\\t\\t\\t\\tmatch_length = MIN_MATCH - 1;\\n\\t\\t\\t }\\n\\t\\t\\t} // If there was a match at the previous step and the current\\n\\t\\t\\t// match is not better, output the previous match:\\n \\n \\n\\t\\t\\tif (prev_length >= MIN_MATCH && match_length <= prev_length) {\\n\\t\\t\\t max_insert = strstart + lookahead - MIN_MATCH; // Do not insert strings in hash table beyond this.\\n\\t\\t\\t // check_match(strstart-1, prev_match, prev_length);\\n \\n\\t\\t\\t bflush = _tr_tally(strstart - 1 - prev_match, prev_length - MIN_MATCH); // Insert in hash table all strings up to the end of the match.\\n\\t\\t\\t // strstart-1 and strstart are already inserted. If there is not\\n\\t\\t\\t // enough lookahead, the last two strings are not inserted in\\n\\t\\t\\t // the hash table.\\n \\n\\t\\t\\t lookahead -= prev_length - 1;\\n\\t\\t\\t prev_length -= 2;\\n \\n\\t\\t\\t do {\\n\\t\\t\\t\\tif (++strstart <= max_insert) {\\n\\t\\t\\t\\t ins_h = (ins_h << hash_shift ^ window[strstart + (MIN_MATCH - 1)] & 0xff) & hash_mask; // prev[strstart&w_mask]=hash_head=head[ins_h];\\n \\n\\t\\t\\t\\t hash_head = head[ins_h] & 0xffff;\\n\\t\\t\\t\\t prev[strstart & w_mask] = head[ins_h];\\n\\t\\t\\t\\t head[ins_h] = strstart;\\n\\t\\t\\t\\t}\\n\\t\\t\\t } while (--prev_length !== 0);\\n \\n\\t\\t\\t match_available = 0;\\n\\t\\t\\t match_length = MIN_MATCH - 1;\\n\\t\\t\\t strstart++;\\n \\n\\t\\t\\t if (bflush) {\\n\\t\\t\\t\\tflush_block_only(false);\\n\\t\\t\\t\\tif (strm.avail_out === 0) return NeedMore;\\n\\t\\t\\t }\\n\\t\\t\\t} else if (match_available !== 0) {\\n\\t\\t\\t // If there was no match at the previous position, output a\\n\\t\\t\\t // single literal. If there was a match but the current match\\n\\t\\t\\t // is longer, truncate the previous match to a single literal.\\n\\t\\t\\t bflush = _tr_tally(0, window[strstart - 1] & 0xff);\\n \\n\\t\\t\\t if (bflush) {\\n\\t\\t\\t\\tflush_block_only(false);\\n\\t\\t\\t }\\n \\n\\t\\t\\t strstart++;\\n\\t\\t\\t lookahead--;\\n\\t\\t\\t if (strm.avail_out === 0) return NeedMore;\\n\\t\\t\\t} else {\\n\\t\\t\\t // There is no previous match to compare with, wait for\\n\\t\\t\\t // the next step to decide.\\n\\t\\t\\t match_available = 1;\\n\\t\\t\\t strstart++;\\n\\t\\t\\t lookahead--;\\n\\t\\t\\t}\\n\\t\\t }\\n \\n\\t\\t if (match_available !== 0) {\\n\\t\\t\\tbflush = _tr_tally(0, window[strstart - 1] & 0xff);\\n\\t\\t\\tmatch_available = 0;\\n\\t\\t }\\n \\n\\t\\t flush_block_only(flush == Z_FINISH);\\n \\n\\t\\t if (strm.avail_out === 0) {\\n\\t\\t\\tif (flush == Z_FINISH) return FinishStarted;else return NeedMore;\\n\\t\\t }\\n \\n\\t\\t return flush == Z_FINISH ? FinishDone : BlockDone;\\n\\t\\t}\",\n \"checkAutomaticMatch() {\\n TweenMax.delayedCall(0.5, () => {\\n let matches = this.checkGridForMatches();\\n if (matches.length > 0) {\\n this.gatherMatchingBlocks(matches);\\n this.increaseCardsPointsAfterMatch(matches);\\n } else {\\n this.checkPossibleMove();\\n }\\n })\\n }\",\n \"function setMatch() {\\n open.forEach(function(card) {\\n card.addClass('match');\\n });\\n open = [];\\n matched += 2;\\n if (Won()) {\\n stopTimer();\\n gameOver();\\n }\\n}\",\n \"function doTF(tf)\\r\\n{\\r\\n termfrequency = {};\\r\\n var word = tf.split(' '); // individual words\\r\\n var count=0;\\r\\n \\r\\n for(var i = 0;i 0 && quantifierRecurse !== true) ? ndxInitializer.shift() : 0; (qndx < (isNaN(qt.quantifier.max) ? qndx + 1 : qt.quantifier.max)) && testPos <= pos; qndx++) {\\n var tokenGroup = maskToken.matches[maskToken.matches.indexOf(qt) - 1];\\n match = handleMatch(tokenGroup, [qndx].concat(loopNdx), true);\\n if (match) {\\n //get latest match\\n var latestMatch = matches[matches.length - 1][\\\"match\\\"];\\n if (qndx > qt.quantifier.min - 1) { //mark optionality\\n latestMatch.optionalQuantifier = true;\\n }\\n var isFirstMatch = (tokenGroup.matches.indexOf(latestMatch) == 0);\\n if (isFirstMatch) { //search for next possible match\\n if (qndx > qt.quantifier.min - 1) {\\n insertStop = true;\\n testPos = pos; //match the position after the group\\n break; //stop quantifierloop\\n } else return true;\\n } else {\\n return true;\\n }\\n }\\n }\\n } else {\\n match = ResolveTestFromToken(match, ndxInitializer, loopNdx, quantifierRecurse);\\n if (match)\\n return true;\\n }\\n } else testPos++;\\n }\",\n \"postrender() {\\n this.count++;\\n if (this.mode === settings_1.settings.GC_MODES.MANUAL) {\\n return;\\n }\\n this.checkCount++;\\n if (this.checkCount > this.checkCountMax) {\\n this.checkCount = 0;\\n this.run();\\n }\\n }\",\n \"function isMatch() {\\n if (cardOne.dataset.title === cardTwo.dataset.title) {\\n keepShowing();\\n pairs = pairs + 1;\\n checkIfWon();\\n return;\\n }\\n unflipCards();\\n decreaseHealth();\\n}\",\n \"function handleMatch(match, loopNdx, quantifierRecurse) {\\n\\t function isFirstMatch(latestMatch, tokenGroup) {\\n\\t var firstMatch = $.inArray(latestMatch, tokenGroup.matches) === 0;\\n\\t if (!firstMatch) {\\n\\t $.each(tokenGroup.matches, function (ndx, match) {\\n\\t if (match.isQuantifier === true) {\\n\\t firstMatch = isFirstMatch(latestMatch, tokenGroup.matches[ndx - 1]);\\n\\t if (firstMatch) return false;\\n\\t }\\n\\t });\\n\\t }\\n\\t return firstMatch;\\n\\t }\\n\\n\\t function resolveNdxInitializer(pos, alternateNdx) {\\n\\t var bestMatch = selectBestMatch(pos, alternateNdx);\\n\\t return bestMatch ? bestMatch.locator.slice(bestMatch.alternation + 1) : [];\\n\\t }\\n\\t if (testPos > 10000) {\\n\\t throw \\\"Inputmask: There is probably an error in your mask definition or in the code. Create an issue on github with an example of the mask you are using. \\\" + getMaskSet().mask;\\n\\t }\\n\\t if (testPos === pos && match.matches === undefined) {\\n\\t matches.push({\\n\\t \\\"match\\\": match,\\n\\t \\\"locator\\\": loopNdx.reverse(),\\n\\t \\\"cd\\\": cacheDependency\\n\\t });\\n\\t return true;\\n\\t } else if (match.matches !== undefined) {\\n\\t if (match.isGroup && quantifierRecurse !== match) { //when a group pass along to the quantifier\\n\\t match = handleMatch(maskToken.matches[$.inArray(match, maskToken.matches) + 1], loopNdx);\\n\\t if (match) return true;\\n\\t } else if (match.isOptional) {\\n\\t var optionalToken = match;\\n\\t match = resolveTestFromToken(match, ndxInitializer, loopNdx, quantifierRecurse);\\n\\t if (match) {\\n\\t latestMatch = matches[matches.length - 1].match;\\n\\t if (isFirstMatch(latestMatch, optionalToken)) {\\n\\t insertStop = true; //insert a stop\\n\\t testPos = pos; //match the position after the group\\n\\t } else return true;\\n\\t }\\n\\t } else if (match.isAlternator) {\\n\\t var alternateToken = match,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmalternateMatches = [],\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmaltMatches,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tcurrentMatches = matches.slice(),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tloopNdxCnt = loopNdx.length;\\n\\t var altIndex = ndxInitializer.length > 0 ? ndxInitializer.shift() : -1;\\n\\t if (altIndex === -1 || typeof altIndex === \\\"string\\\") {\\n\\t var currentPos = testPos,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tndxInitializerClone = ndxInitializer.slice(),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\taltIndexArr = [],\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tamndx;\\n\\t if (typeof altIndex == \\\"string\\\") {\\n\\t altIndexArr = altIndex.split(\\\",\\\");\\n\\t } else {\\n\\t for (amndx = 0; amndx < alternateToken.matches.length; amndx++) {\\n\\t altIndexArr.push(amndx);\\n\\t }\\n\\t }\\n\\t for (var ndx = 0; ndx < altIndexArr.length; ndx++) {\\n\\t amndx = parseInt(altIndexArr[ndx]);\\n\\t matches = [];\\n\\t //set the correct ndxInitializer\\n\\t ndxInitializer = resolveNdxInitializer(testPos, amndx);\\n\\t match = handleMatch(alternateToken.matches[amndx] || maskToken.matches[amndx], [amndx].concat(loopNdx), quantifierRecurse) || match;\\n\\t if (match !== true && match !== undefined && (altIndexArr[altIndexArr.length - 1] < alternateToken.matches.length)) { //no match in the alternations (length mismatch) => look further\\n\\t var ntndx = maskToken.matches.indexOf(match) + 1;\\n\\t if (maskToken.matches.length > ntndx) {\\n\\t match = handleMatch(maskToken.matches[ntndx], [ntndx].concat(loopNdx.slice(1, loopNdx.length)), quantifierRecurse);\\n\\t if (match) {\\n\\t altIndexArr.push(ntndx.toString());\\n\\t $.each(matches, function (ndx, lmnt) {\\n\\t lmnt.alternation = loopNdx.length - 1;\\n\\t });\\n\\t }\\n\\t }\\n\\t }\\n\\t maltMatches = matches.slice();\\n\\t testPos = currentPos;\\n\\t matches = [];\\n\\t //cloneback\\n\\t for (var i = 0; i < ndxInitializerClone.length; i++) {\\n\\t ndxInitializer[i] = ndxInitializerClone[i];\\n\\t }\\n\\t //fuzzy merge matches\\n\\t for (var ndx1 = 0; ndx1 < maltMatches.length; ndx1++) {\\n\\t var altMatch = maltMatches[ndx1];\\n\\t altMatch.alternation = altMatch.alternation || loopNdxCnt;\\n\\t for (var ndx2 = 0; ndx2 < malternateMatches.length; ndx2++) {\\n\\t var altMatch2 = malternateMatches[ndx2];\\n\\t //verify equality\\n\\t if (altMatch.match.def === altMatch2.match.def && (typeof altIndex !== \\\"string\\\" || $.inArray(altMatch.locator[altMatch.alternation].toString(), altIndexArr) !== -1)) {\\n\\t if (altMatch.match.mask === altMatch2.match.mask) {\\n\\t maltMatches.splice(ndx1, 1);\\n\\t ndx1--;\\n\\t }\\n\\t if (altMatch2.locator[altMatch.alternation].toString().indexOf(altMatch.locator[altMatch.alternation]) === -1) {\\n\\t altMatch2.locator[altMatch.alternation] = altMatch2.locator[altMatch.alternation] + \\\",\\\" + altMatch.locator[altMatch.alternation];\\n\\t altMatch2.alternation = altMatch.alternation; //we pass the alternation index => used in determineLastRequiredPosition\\n\\t }\\n\\t break;\\n\\t }\\n\\t }\\n\\t }\\n\\t malternateMatches = malternateMatches.concat(maltMatches);\\n\\t }\\n\\n\\t if (typeof altIndex == \\\"string\\\") { //filter matches\\n\\t malternateMatches = $.map(malternateMatches, function (lmnt, ndx) {\\n\\t if (isFinite(ndx)) {\\n\\t var mamatch,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\talternation = lmnt.alternation,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\taltLocArr = lmnt.locator[alternation].toString().split(\\\",\\\");\\n\\t lmnt.locator[alternation] = undefined;\\n\\t lmnt.alternation = undefined;\\n\\t for (var alndx = 0; alndx < altLocArr.length; alndx++) {\\n\\t mamatch = $.inArray(altLocArr[alndx], altIndexArr) !== -1;\\n\\t if (mamatch) { //rebuild the locator with valid entries\\n\\t if (lmnt.locator[alternation] !== undefined) {\\n\\t lmnt.locator[alternation] += \\\",\\\";\\n\\t lmnt.locator[alternation] += altLocArr[alndx];\\n\\t } else lmnt.locator[alternation] = parseInt(altLocArr[alndx]);\\n\\n\\t lmnt.alternation = alternation;\\n\\t }\\n\\t }\\n\\t if (lmnt.locator[alternation] !== undefined) return lmnt;\\n\\t }\\n\\t });\\n\\t }\\n\\n\\t matches = currentMatches.concat(malternateMatches);\\n\\t testPos = pos;\\n\\t insertStop = matches.length > 0; //insert a stopelemnt when there is an alternate - needed for non-greedy option\\n\\t } else {\\n\\t // if (alternateToken.matches[altIndex]) { //if not in the initial alternation => look further\\n\\t match = handleMatch(alternateToken.matches[altIndex] || maskToken.matches[altIndex], [altIndex].concat(loopNdx), quantifierRecurse);\\n\\t // } else match = false;\\n\\t }\\n\\t if (match) return true;\\n\\t } else if (match.isQuantifier && quantifierRecurse !== maskToken.matches[$.inArray(match, maskToken.matches) - 1]) {\\n\\t var qt = match;\\n\\t for (var qndx = (ndxInitializer.length > 0) ? ndxInitializer.shift() : 0;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t(qndx < (isNaN(qt.quantifier.max) ? qndx + 1 : qt.quantifier.max)) && testPos <= pos; qndx++) {\\n\\t var tokenGroup = maskToken.matches[$.inArray(qt, maskToken.matches) - 1];\\n\\t match = handleMatch(tokenGroup, [qndx].concat(loopNdx), tokenGroup); //set the tokenGroup as quantifierRecurse marker\\n\\t if (match) {\\n\\t //get latest match\\n\\t latestMatch = matches[matches.length - 1].match;\\n\\t latestMatch.optionalQuantifier = qndx > (qt.quantifier.min - 1);\\n\\t if (isFirstMatch(latestMatch, tokenGroup)) { //search for next possible match\\n\\t if (qndx > (qt.quantifier.min - 1)) {\\n\\t insertStop = true;\\n\\t testPos = pos; //match the position after the group\\n\\t break; //stop quantifierloop\\n\\t } else return true;\\n\\t } else {\\n\\t return true;\\n\\t }\\n\\t }\\n\\t }\\n\\t } else {\\n\\t match = resolveTestFromToken(match, ndxInitializer, loopNdx, quantifierRecurse);\\n\\t if (match) return true;\\n\\t }\\n\\t } else testPos++;\\n\\t }\",\n \"function saveEntireAmtStateDone() {\\r\\n if (--IntelAmtEntireStateCalls != 0) return;\\r\\n var out = fs.openSync(settings.output, 'w');\\r\\n fs.writeSync(out, Buffer.from(JSON.stringify(IntelAmtEntireState)));\\r\\n fs.closeSync(out);\\r\\n console.log('Done, results written to ' + settings.output + '.');\\r\\n exit(1);\\r\\n}\",\n \"function checkBlock() {\\n\\t\\n\\t// get/update block time and duration in seconds\\n\\tvar count = JSON.parse(localStorage[\\\"blockCount\\\"]);\\n\\tcount += UPDATE_SECONDS;\\n\\t\\n\\tvar blockDur = localStorage[\\\"blockDuration\\\"];\\n\\tblockDur = blockDur * 3600;\\n\\tconsole.log(count + \\\" seconds of \\\" + blockDur + \\\" second sentence served\\\");\\n\\t// remove block if duration exceeded\\n\\tif (count >= blockDur) {\\n \\tlocalStorage[\\\"blockVar\\\"] = \\\"false\\\";\\n \\tlocalStorage[\\\"target\\\"] = 0;\\n \\tlocalStorage[\\\"blockCount\\\"] = 0;\\n \\t\\tconsole.log(\\\"you did great. the block is coming down\\\");\\n\\t}\\n\\telse {\\n\\t\\tlocalStorage[\\\"blockCount\\\"] = count;\\n\\t}\\n}\",\n \"function checkMatch() {\\n if (facedCards[0].firstElementChild.className == facedCards[1].firstElementChild.className) {\\n for (let card of facedCards) {\\n card.classList.add(\\\"match\\\");\\n }\\n /*Once match is made facedCards array is emptied. */\\n facedCards = [];\\n /*Match is added to match total*/\\n matches++;\\n /*Updates the wait variable to false so that users can click cards for the next try*/\\n wait = false;\\n } else {\\n /*Flips cards that are not a match back over after a short delay. */\\n setTimeout(clearFacedCards, 1000);\\n }\\n}\",\n \"function checkIfcurrentFilterMatchSave() {\\r\\n\\r\\n\\tfor (var i=0; i<9; i++) {\\r\\n\\t\\r\\n\\t\\tif (assistsFilter[i] != assistsFilterBackup[i]) {\\r\\n\\t\\t\\tsaveFilterButton.disabled = false;\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\t\\r\\n\\tfor (var i=0; i<7; i++) {\\r\\n\\t\\r\\n\\t\\tif (gameSettingsFilter[i] != gameSettingsFilterBackup[i]) {\\r\\n\\t\\t\\tsaveFilterButton.disabled = false;\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\t\\r\\n\\tsaveFilterButton.disabled = true;\\r\\n}\",\n \"function match() {\\n\\t\\tfor(card of chosenCards) {\\n\\t\\t\\t\\tcard.classList.add('match');\\n\\t\\t\\t\\tgotRight(card);\\n\\t\\t};\\n\\t\\tpairsRemain--;\\n\\t\\tcheckWin();\\n\\t\\tempty();\\n}\",\n \"function checkWinCondition(){\\n// When all pairs are selected (pairCounter === maxPair, based on mode)\\n if (pairCounter === maxPair){\\n endTime = new Date();\\n console.log('End Time:', endTime);\\n }\\n // Once the end time is captured, a 'score' is deduced by extracting and comparing time codes and converting from milliseconds to seconds. That value in seconds is added to the userData object\\n if (endTime) {\\n var numStartTime = startTime.getTime();\\n var numEndTime = endTime.getTime();\\n var elapsedTime = numEndTime-numStartTime;\\n var timeInSec = elapsedTime/1000;\\n console.log('Elapsed Time:', timeInSec);\\n userData.finalTimes.push(timeInSec);\\n // At this point, we have updated all necessary userData information and are ready to re-stringify it and send it back to local storage\\n stringyUser = JSON.stringify(userData);\\n localStorage.setItem('userData', stringyUser);\\n // And now we send the user on to the About Me page to view their results\\n window.location.href = 'about.html';\\n }\\n}\",\n \"function checkForMatch() {\\n if (firstCard.dataset.framework === secondCard.dataset.framework) {\\n countMatch ++;\\n // In case all of the matches are found ==> Congratulation you win the game\\n if( countMatch === 8){\\n //if the matches are 8 then popUp the messagge of win!\\n congratulation();\\n\\n }\\n disableCards();\\n return;\\n }\\n\\n unflipCards();\\n }\",\n \"isComplete() {\\n if (!this.endTime) return false;\\n if (this.now() > this.endTime) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n \\n }\",\n \"allPlayersDone() {\\n var showHostOffset = 0;\\n var doneCount = 0;\\n\\n this.playerMap.doAll((player) => {\\n if (player.isShowHost) {\\n showHostOffset++;\\n } else if (!player.hasFastestFingerChoicesLeft()) {\\n doneCount++;\\n }\\n });\\n\\n return doneCount >= this.playerMap.getPlayerCount() - showHostOffset;\\n }\",\n \"async _checkRecords(index, record) {\\n\\t\\tlet write = false;\\n\\n\\t\\tfor (const [index, record] of this.cache.records.entries()) {\\n\\t\\t\\tif (this.cache.currentIPv4 === record.recordContent || \\n\\t\\t\\t\\tthis.cache.currentIPv6 === record.recordContent)\\n\\t\\t\\t\\tcontinue;\\n\\t\\n\\t\\t\\tconsole.log(`Updating DNS record ${index} from ${record.recordContent} to ` +\\n\\t\\t\\t\\t(record.ipv6 ? this.cache.currentIPv6 : this.cache.currentIPv4));\\n\\t\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tawait this._updateRecord(index);\\n\\t\\t\\t} catch (err) {\\n\\t\\t\\t\\tconsole.error('Error updating DNS record:\\\\n' + err);\\n\\t\\t\\t\\tprocess.exit();\\n\\t\\t\\t}\\n\\t\\n\\t\\t\\tconsole.log('DNS record is up to date.');\\n\\t\\t\\twrite = true;\\n\\t\\t}\\n\\n\\t\\treturn write;\\n\\t}\",\n \"if (didScheduleUpdateDuringPassiveEffects) {\\n if (root === rootWithPassiveNestedUpdates) {\\n nestedPassiveUpdateCount++;\\n } else {\\n nestedPassiveUpdateCount = 0;\\n rootWithPassiveNestedUpdates = root;\\n }\\n }\",\n \"function checkMatch() {\\n if (app.firstCard.dataset.avenger === app.secondCard.dataset.avenger) {\\n disableCards();\\n cardMatchSound();\\n app.matchedCards.push(app.firstCard.dataset.avenger);\\n gameComplete();\\n return;\\n }\\n unflipCards();\\n}\",\n \"async function storeCount () {\\n console.log(\\\"storeCount starts\\\")\\n var date = new Date();\\n var obj = { \\n date:date,\\n cashtagCount:cashtagCount,\\n errorCount:errorCount\\n };\\n counterStore.push(obj);\\n cashtagCount = 0;\\n errorCount = 0;\\n runCount = runCount + 1;\\n setTimeout(storeCount, 120000);\\n }\",\n \"function isMatch() {\\n const openCard = document.getElementsByClassName(\\\"open show\\\");\\n\\n clickCounter++;\\n\\n //accesses the first and second cards as they're clicked\\n const firstCard = openCard[0];\\n const secondCard = openCard[1];\\n\\n /* compares everything about the cards to each other (comparing the node would\\n * probably not be the best solution in the wild, but because the whole card * will be identical here, I think it's fine) */\\n const matchedCards = firstCard.isEqualNode(secondCard);\\n\\n /* if the cards match, open & show classes are removed, match class is added\\n * if the cards don't match, open & show classes are removed and the cards\\n * can be accessed again */\\n if (matchedCards) {\\n firstCard.classList.remove(\\\"open\\\", \\\"show\\\");\\n secondCard.classList.remove(\\\"open\\\", \\\"show\\\");\\n firstCard.classList.add(\\\"match\\\");\\n secondCard.classList.add(\\\"match\\\");\\n\\n clickCounter = 0;\\n moves++;\\n\\n } else if (clickCounter === 2) {\\n // closes both cards after a delay if they're not a match\\n window.setTimeout(function() {\\n firstCard.classList.remove(\\\"open\\\", \\\"show\\\");\\n secondCard.classList.remove(\\\"open\\\", \\\"show\\\");\\n }, 500);\\n\\n clickCounter = 0;\\n moves++;\\n\\n } else {\\n //// do nothing\\n }\\n\\n /* victory condition which stops the timer and pops open a modal that\\n * displays the player's stats */\\n const allCardsMatched = document.querySelectorAll(\\\".match\\\");\\n if (allCardsMatched.length === 16) {\\n clearInterval(Interval);\\n victoryModal();\\n }\\n}\",\n \"function cardMatch() {\\n if(cardSelections[0].firstElementChild.className === cardSelections[1].firstElementChild.className) {\\n // If a match adds the match class to each card in array\\n cardSelections.forEach(function(card){\\n card.classList.add('match');\\n });\\n matchCount++;\\n cardSelections = [];\\n } else {\\n // If no match sets timeout on card flipping via toggle.\\n setTimeout(function() {\\n displayCard(cardSelections[0]);\\n displayCard(cardSelections[1]);\\n cardSelections = [];\\n }, 400 );\\n }\\n }\",\n \"updateProtocolMatches() {\\n log.trace('ProtocolEngine::updateProtocolMatches');\\n\\n // Clear all data currently in matchedProtocols\\n this._clearMatchedProtocols();\\n\\n // For each study, find the matching protocols\\n this.studies.forEach(study => {\\n const matched = this.findMatchByStudy(study);\\n\\n // For each matched protocol, check if it is already in MatchedProtocols\\n matched.forEach(matchedDetail => {\\n const protocol = matchedDetail.protocol;\\n if (!protocol) {\\n return;\\n }\\n\\n // If it is not already in the MatchedProtocols Collection, insert it with its score\\n if (!this.matchedProtocols.has(protocol.id)) {\\n log.trace(\\n 'ProtocolEngine::updateProtocolMatches inserting protocol match',\\n matchedDetail\\n );\\n this.matchedProtocols.set(protocol.id, protocol);\\n this.matchedProtocolScores[protocol.id] = matchedDetail.score;\\n }\\n });\\n });\\n }\",\n \"function checkMatch() {\\n if (openedCards[0][0].firstChild.className == openedCards[1][0].firstChild.className) {\\n console.log('This is a match!');\\n openedCards[0].addClass('match');\\n openedCards[1].addClass('match');\\n clickOff();\\n clearOpenCards();\\n setTimeout(checkForWin, 900);\\n } else {\\n openedCards[0].toggleClass('open show').animateCss('flipInY');\\n setTimeout(flipDelay, 600); //2nd card closes after the first\\n clickOn();\\n }\\n}\",\n \"getFrequencyMapping() {\\n var mapping = [];\\n for (const [name, midiFile] of Object.entries(this.midiFiles)) {\\n var track = midiFile.track;\\n track.forEach(function(midiEvent) {\\n midiEvent.event.forEach(function(d) {\\n if (d.type == 9 && d.data[1] > 0) {\\n var find = Constants.NOTE_MAPPING[d.data[0]];\\n var found = false;\\n for (var i = 0; i < mapping.length && !found; i++) {\\n if (mapping[i][\\\"name\\\"] == name && mapping[i][\\\"note\\\"] == find) {\\n mapping[i][\\\"count\\\"] += 1;\\n found = true;\\n }\\n }\\n if (!found) {\\n mapping.push({\\n name: name,\\n color: midiFile.color,\\n note: find,\\n count: 1\\n });\\n }\\n }\\n });\\n });\\n }\\n\\n // Identify mismatches and add match parameter\\n const master = mapping.filter(item => item.name == mapping[0].name);\\n const files = [...new Set(mapping.map(item => item.name))];\\n master.forEach(function(d) {\\n const notes = mapping.filter(item => item.note == d.note);\\n const match = notes.every(item => item.count == notes[0].count);\\n notes.forEach(item => (item.match = match));\\n notes.forEach(item => (item.fileCount = files.length));\\n });\\n\\n return mapping;\\n }\",\n \"async onMatchEnd(winner, duration) {\\n this.stats.match += 1;\\n this.stats.wins[winner] += 1;\\n this.stats.lastDurations.push(duration);\\n this.stats.matchTime = duration;\\n\\n await this.updateUi();\\n this.stats.matchTime = 0;\\n this.stats.matchFrame = 0;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.57499295","0.5212014","0.51859707","0.5111995","0.5039224","0.50121415","0.49712586","0.49325344","0.48576874","0.4847375","0.48212865","0.48212302","0.48096582","0.4798437","0.47001162","0.46869558","0.46755353","0.46664038","0.4647019","0.46444625","0.46365","0.46253917","0.46242842","0.46181378","0.46150774","0.4613607","0.45957497","0.45921835","0.45465726","0.4546422","0.45179403","0.45174104","0.45035866","0.44984153","0.44980368","0.4491529","0.44791394","0.44776556","0.44771263","0.44669446","0.44636995","0.44633877","0.4463346","0.44618818","0.44612062","0.44603238","0.4458306","0.4444376","0.44433415","0.44403234","0.44239703","0.4423836","0.44230318","0.44196144","0.4412893","0.44076797","0.44059494","0.43961883","0.4391127","0.4386834","0.4377882","0.43648812","0.43636805","0.43591544","0.4358113","0.43566236","0.43538693","0.4352099","0.43443397","0.43409598","0.43371508","0.43331012","0.43302158","0.43270805","0.43248296","0.43227223","0.43210244","0.43181536","0.43157497","0.43096292","0.43075186","0.43044826","0.4298589","0.42930126","0.42872915","0.42854756","0.42811003","0.42804268","0.42784595","0.42767316","0.42690095","0.4268347","0.42659178","0.42627847","0.42593667","0.42590615","0.42567807","0.42549613","0.42481592","0.42431068","0.42430156"],"string":"[\n \"0.57499295\",\n \"0.5212014\",\n \"0.51859707\",\n \"0.5111995\",\n \"0.5039224\",\n \"0.50121415\",\n \"0.49712586\",\n \"0.49325344\",\n \"0.48576874\",\n \"0.4847375\",\n \"0.48212865\",\n \"0.48212302\",\n \"0.48096582\",\n \"0.4798437\",\n \"0.47001162\",\n \"0.46869558\",\n \"0.46755353\",\n \"0.46664038\",\n \"0.4647019\",\n \"0.46444625\",\n \"0.46365\",\n \"0.46253917\",\n \"0.46242842\",\n \"0.46181378\",\n \"0.46150774\",\n \"0.4613607\",\n \"0.45957497\",\n \"0.45921835\",\n \"0.45465726\",\n \"0.4546422\",\n \"0.45179403\",\n \"0.45174104\",\n \"0.45035866\",\n \"0.44984153\",\n \"0.44980368\",\n \"0.4491529\",\n \"0.44791394\",\n \"0.44776556\",\n \"0.44771263\",\n \"0.44669446\",\n \"0.44636995\",\n \"0.44633877\",\n \"0.4463346\",\n \"0.44618818\",\n \"0.44612062\",\n \"0.44603238\",\n \"0.4458306\",\n \"0.4444376\",\n \"0.44433415\",\n \"0.44403234\",\n \"0.44239703\",\n \"0.4423836\",\n \"0.44230318\",\n \"0.44196144\",\n \"0.4412893\",\n \"0.44076797\",\n \"0.44059494\",\n \"0.43961883\",\n \"0.4391127\",\n \"0.4386834\",\n \"0.4377882\",\n \"0.43648812\",\n \"0.43636805\",\n \"0.43591544\",\n \"0.4358113\",\n \"0.43566236\",\n \"0.43538693\",\n \"0.4352099\",\n \"0.43443397\",\n \"0.43409598\",\n \"0.43371508\",\n \"0.43331012\",\n \"0.43302158\",\n \"0.43270805\",\n \"0.43248296\",\n \"0.43227223\",\n \"0.43210244\",\n \"0.43181536\",\n \"0.43157497\",\n \"0.43096292\",\n \"0.43075186\",\n \"0.43044826\",\n \"0.4298589\",\n \"0.42930126\",\n \"0.42872915\",\n \"0.42854756\",\n \"0.42811003\",\n \"0.42804268\",\n \"0.42784595\",\n \"0.42767316\",\n \"0.42690095\",\n \"0.4268347\",\n \"0.42659178\",\n \"0.42627847\",\n \"0.42593667\",\n \"0.42590615\",\n \"0.42567807\",\n \"0.42549613\",\n \"0.42481592\",\n \"0.42431068\",\n \"0.42430156\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81762,"cells":{"query":{"kind":"string","value":"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."},"document":{"kind":"string","value":"function EventEmitter() {\n this._events = this._events || {};\n this._maxListeners = this._maxListeners || undefined;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function me(e,t,a,s){var n,i=arguments.length,r=i<3?t:null===s?s=Object.getOwnPropertyDescriptor(t,a):s;if(\"object\"==typeof Reflect&&\"function\"==typeof Reflect.decorate)r=Reflect.decorate(e,t,a,s);else for(var d=e.length-1;d>=0;d--)(n=e[d])&&(r=(i<3?n(r):i>3?n(t,a,r):n(t,a))||r);return i>3&&r&&Object.defineProperty(t,a,r),r\n/**\n * @license\n * Copyright 2016 Google Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */}","function n(r){return!!r.constructor&&typeof r.constructor.isBuffer==\"function\"&&r.constructor.isBuffer(r)}","function Generator() {} // 80","function r() {}","function r() {}","function r() {}","function i(e){var t=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),n=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),r=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),i=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),a=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),s=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),c=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),d=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),f=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),m=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),v=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),y=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),g=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),_=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),b=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),w=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),T=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),E=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),S=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),x=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),k=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),C=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),A=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),N=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),I=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x);(0,o.default)(e,{0:t,NetworkOrCORSError:t,400:n,BadRequest:n,401:r,Unauthorized:r,402:i,PaymentRequired:i,403:a,Forbidden:a,404:s,NotFound:s,405:c,MethodNotAllowed:c,406:d,NotAcceptable:d,407:f,ProxyAuthenticationRequired:f,408:m,RequestTimeout:m,409:v,Conflict:v,410:y,Gone:y,411:g,LengthRequired:g,412:_,PreconditionFailed:_,413:b,RequestEntityTooLarge:b,414:w,RequestUriTooLong:w,415:T,UnsupportedMediaType:T,416:E,RequestRangeNotSatisfiable:E,417:S,ExpectationFailed:S,500:x,InternalServerError:x,501:k,NotImplemented:k,502:C,BadGateway:C,503:A,ServiceUnavailable:A,504:N,GatewayTimeout:N,505:I,HttpVersionNotSupported:I,select:function(t){if(void 0===t||null===t)return e;t=t.statusCode||t;var n=e[t];return n||(t=t.toString().split(\"\").shift()+\"00\",t=parseInt(t,10),e[t]||e)}})}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\"function\"&&n.constructor.isBuffer(n)}","function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}","function Generator() {} // 84","function require() { return {}; }","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(){}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function r(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function Util() {}","function n(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function lt(t,i){return t(i={exports:{}},i.exports),i.exports}","function c(e,t,n){Array.isArray(e)?(n=t,t=e,e=void 0):\"string\"!=typeof e&&(n=e,e=t=void 0),t&&!Array.isArray(t)&&(n=t,t=void 0),t||(t=[\"require\",\"exports\",\"module\"]),\n//Set up properties for this module. If an ID, then use\n//internal cache. If no ID, then use the external variables\n//for this node module.\ne?\n//Put the module in deep freeze until there is a\n//require call for it.\nd[e]=[e,t,n]:l(e,t,n)}","private public function m246() {}","function t(e){return!!e.constructor&&'function'==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function universalModule() {\n\t\t var $Object = Object;\n\n\t\tfunction createClass(ctor, methods, staticMethods, superClass) {\n\t\t var proto;\n\t\t if (superClass) {\n\t\t var superProto = superClass.prototype;\n\t\t proto = $Object.create(superProto);\n\t\t } else {\n\t\t proto = ctor.prototype;\n\t\t }\n\t\t $Object.keys(methods).forEach(function (key) {\n\t\t proto[key] = methods[key];\n\t\t });\n\t\t $Object.keys(staticMethods).forEach(function (key) {\n\t\t ctor[key] = staticMethods[key];\n\t\t });\n\t\t proto.constructor = ctor;\n\t\t ctor.prototype = proto;\n\t\t return ctor;\n\t\t}\n\n\t\tfunction superCall(self, proto, name, args) {\n\t\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\n\t\t}\n\n\t\tfunction defaultSuperCall(self, proto, args) {\n\t\t superCall(self, proto, 'constructor', args);\n\t\t}\n\n\t\tvar $traceurRuntime = {};\n\t\t$traceurRuntime.createClass = createClass;\n\t\t$traceurRuntime.superCall = superCall;\n\t\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\n\t\t\"use strict\";\n\t\tfunction is(valueA, valueB) {\n\t\t if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n\t\t return true;\n\t\t }\n\t\t if (!valueA || !valueB) {\n\t\t return false;\n\t\t }\n\t\t if (typeof valueA.valueOf === 'function' && typeof valueB.valueOf === 'function') {\n\t\t valueA = valueA.valueOf();\n\t\t valueB = valueB.valueOf();\n\t\t }\n\t\t return typeof valueA.equals === 'function' && typeof valueB.equals === 'function' ? valueA.equals(valueB) : valueA === valueB || (valueA !== valueA && valueB !== valueB);\n\t\t}\n\t\tfunction invariant(condition, error) {\n\t\t if (!condition)\n\t\t throw new Error(error);\n\t\t}\n\t\tvar DELETE = 'delete';\n\t\tvar SHIFT = 5;\n\t\tvar SIZE = 1 << SHIFT;\n\t\tvar MASK = SIZE - 1;\n\t\tvar NOT_SET = {};\n\t\tvar CHANGE_LENGTH = {value: false};\n\t\tvar DID_ALTER = {value: false};\n\t\tfunction MakeRef(ref) {\n\t\t ref.value = false;\n\t\t return ref;\n\t\t}\n\t\tfunction SetRef(ref) {\n\t\t ref && (ref.value = true);\n\t\t}\n\t\tfunction OwnerID() {}\n\t\tfunction arrCopy(arr, offset) {\n\t\t offset = offset || 0;\n\t\t var len = Math.max(0, arr.length - offset);\n\t\t var newArr = new Array(len);\n\t\t for (var ii = 0; ii < len; ii++) {\n\t\t newArr[ii] = arr[ii + offset];\n\t\t }\n\t\t return newArr;\n\t\t}\n\t\tfunction assertNotInfinite(size) {\n\t\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\n\t\t}\n\t\tfunction ensureSize(iter) {\n\t\t if (iter.size === undefined) {\n\t\t iter.size = iter.__iterate(returnTrue);\n\t\t }\n\t\t return iter.size;\n\t\t}\n\t\tfunction wrapIndex(iter, index) {\n\t\t return index >= 0 ? (+index) : ensureSize(iter) + (+index);\n\t\t}\n\t\tfunction returnTrue() {\n\t\t return true;\n\t\t}\n\t\tfunction wholeSlice(begin, end, size) {\n\t\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\n\t\t}\n\t\tfunction resolveBegin(begin, size) {\n\t\t return resolveIndex(begin, size, 0);\n\t\t}\n\t\tfunction resolveEnd(end, size) {\n\t\t return resolveIndex(end, size, size);\n\t\t}\n\t\tfunction resolveIndex(index, size, defaultIndex) {\n\t\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\n\t\t}\n\t\tvar imul = typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ? Math.imul : function imul(a, b) {\n\t\t a = a | 0;\n\t\t b = b | 0;\n\t\t var c = a & 0xffff;\n\t\t var d = b & 0xffff;\n\t\t return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0;\n\t\t};\n\t\tfunction smi(i32) {\n\t\t return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\n\t\t}\n\t\tfunction hash(o) {\n\t\t if (o === false || o === null || o === undefined) {\n\t\t return 0;\n\t\t }\n\t\t if (typeof o.valueOf === 'function') {\n\t\t o = o.valueOf();\n\t\t if (o === false || o === null || o === undefined) {\n\t\t return 0;\n\t\t }\n\t\t }\n\t\t if (o === true) {\n\t\t return 1;\n\t\t }\n\t\t var type = typeof o;\n\t\t if (type === 'number') {\n\t\t var h = o | 0;\n\t\t while (o > 0xFFFFFFFF) {\n\t\t o /= 0xFFFFFFFF;\n\t\t h ^= o;\n\t\t }\n\t\t return smi(h);\n\t\t }\n\t\t if (type === 'string') {\n\t\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n\t\t }\n\t\t if (typeof o.hashCode === 'function') {\n\t\t return o.hashCode();\n\t\t }\n\t\t return hashJSObj(o);\n\t\t}\n\t\tfunction cachedHashString(string) {\n\t\t var hash = stringHashCache[string];\n\t\t if (hash === undefined) {\n\t\t hash = hashString(string);\n\t\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n\t\t STRING_HASH_CACHE_SIZE = 0;\n\t\t stringHashCache = {};\n\t\t }\n\t\t STRING_HASH_CACHE_SIZE++;\n\t\t stringHashCache[string] = hash;\n\t\t }\n\t\t return hash;\n\t\t}\n\t\tfunction hashString(string) {\n\t\t var hash = 0;\n\t\t for (var ii = 0; ii < string.length; ii++) {\n\t\t hash = 31 * hash + string.charCodeAt(ii) | 0;\n\t\t }\n\t\t return smi(hash);\n\t\t}\n\t\tfunction hashJSObj(obj) {\n\t\t var hash = weakMap && weakMap.get(obj);\n\t\t if (hash)\n\t\t return hash;\n\t\t hash = obj[UID_HASH_KEY];\n\t\t if (hash)\n\t\t return hash;\n\t\t if (!canDefineProperty) {\n\t\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n\t\t if (hash)\n\t\t return hash;\n\t\t hash = getIENodeHash(obj);\n\t\t if (hash)\n\t\t return hash;\n\t\t }\n\t\t if (Object.isExtensible && !Object.isExtensible(obj)) {\n\t\t throw new Error('Non-extensible objects are not allowed as keys.');\n\t\t }\n\t\t hash = ++objHashUID;\n\t\t if (objHashUID & 0x40000000) {\n\t\t objHashUID = 0;\n\t\t }\n\t\t if (weakMap) {\n\t\t weakMap.set(obj, hash);\n\t\t } else if (canDefineProperty) {\n\t\t Object.defineProperty(obj, UID_HASH_KEY, {\n\t\t 'enumerable': false,\n\t\t 'configurable': false,\n\t\t 'writable': false,\n\t\t 'value': hash\n\t\t });\n\t\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n\t\t obj.propertyIsEnumerable = function() {\n\t\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n\t\t };\n\t\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n\t\t } else if (obj.nodeType) {\n\t\t obj[UID_HASH_KEY] = hash;\n\t\t } else {\n\t\t throw new Error('Unable to set a non-enumerable property on object.');\n\t\t }\n\t\t return hash;\n\t\t}\n\t\tvar canDefineProperty = (function() {\n\t\t try {\n\t\t Object.defineProperty({}, 'x', {});\n\t\t return true;\n\t\t } catch (e) {\n\t\t return false;\n\t\t }\n\t\t}());\n\t\tfunction getIENodeHash(node) {\n\t\t if (node && node.nodeType > 0) {\n\t\t switch (node.nodeType) {\n\t\t case 1:\n\t\t return node.uniqueID;\n\t\t case 9:\n\t\t return node.documentElement && node.documentElement.uniqueID;\n\t\t }\n\t\t }\n\t\t}\n\t\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\n\t\tvar objHashUID = 0;\n\t\tvar UID_HASH_KEY = '__immutablehash__';\n\t\tif (typeof Symbol === 'function') {\n\t\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\n\t\t}\n\t\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\n\t\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\n\t\tvar STRING_HASH_CACHE_SIZE = 0;\n\t\tvar stringHashCache = {};\n\t\tvar ITERATE_KEYS = 0;\n\t\tvar ITERATE_VALUES = 1;\n\t\tvar ITERATE_ENTRIES = 2;\n\t\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\n\t\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n\t\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\t\tvar Iterator = function Iterator(next) {\n\t\t this.next = next;\n\t\t};\n\t\t($traceurRuntime.createClass)(Iterator, {toString: function() {\n\t\t return '[Iterator]';\n\t\t }}, {});\n\t\tIterator.KEYS = ITERATE_KEYS;\n\t\tIterator.VALUES = ITERATE_VALUES;\n\t\tIterator.ENTRIES = ITERATE_ENTRIES;\n\t\tvar IteratorPrototype = Iterator.prototype;\n\t\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\n\t\t return this.toString();\n\t\t};\n\t\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\n\t\t return this;\n\t\t};\n\t\tfunction iteratorValue(type, k, v, iteratorResult) {\n\t\t var value = type === 0 ? k : type === 1 ? v : [k, v];\n\t\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n\t\t value: value,\n\t\t done: false\n\t\t });\n\t\t return iteratorResult;\n\t\t}\n\t\tfunction iteratorDone() {\n\t\t return {\n\t\t value: undefined,\n\t\t done: true\n\t\t };\n\t\t}\n\t\tfunction hasIterator(maybeIterable) {\n\t\t return !!_iteratorFn(maybeIterable);\n\t\t}\n\t\tfunction isIterator(maybeIterator) {\n\t\t return maybeIterator && typeof maybeIterator.next === 'function';\n\t\t}\n\t\tfunction getIterator(iterable) {\n\t\t var iteratorFn = _iteratorFn(iterable);\n\t\t return iteratorFn && iteratorFn.call(iterable);\n\t\t}\n\t\tfunction _iteratorFn(iterable) {\n\t\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\n\t\t if (typeof iteratorFn === 'function') {\n\t\t return iteratorFn;\n\t\t }\n\t\t}\n\t\tvar Iterable = function Iterable(value) {\n\t\t return isIterable(value) ? value : Seq(value);\n\t\t};\n\t\tvar $Iterable = Iterable;\n\t\t($traceurRuntime.createClass)(Iterable, {\n\t\t toArray: function() {\n\t\t assertNotInfinite(this.size);\n\t\t var array = new Array(this.size || 0);\n\t\t this.valueSeq().__iterate((function(v, i) {\n\t\t array[i] = v;\n\t\t }));\n\t\t return array;\n\t\t },\n\t\t toIndexedSeq: function() {\n\t\t return new ToIndexedSequence(this);\n\t\t },\n\t\t toJS: function() {\n\t\t return this.toSeq().map((function(value) {\n\t\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\n\t\t })).__toJS();\n\t\t },\n\t\t toKeyedSeq: function() {\n\t\t return new ToKeyedSequence(this, true);\n\t\t },\n\t\t toMap: function() {\n\t\t return Map(this.toKeyedSeq());\n\t\t },\n\t\t toObject: function() {\n\t\t assertNotInfinite(this.size);\n\t\t var object = {};\n\t\t this.__iterate((function(v, k) {\n\t\t object[k] = v;\n\t\t }));\n\t\t return object;\n\t\t },\n\t\t toOrderedMap: function() {\n\t\t return OrderedMap(this.toKeyedSeq());\n\t\t },\n\t\t toOrderedSet: function() {\n\t\t return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toSet: function() {\n\t\t return Set(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toSetSeq: function() {\n\t\t return new ToSetSequence(this);\n\t\t },\n\t\t toSeq: function() {\n\t\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\n\t\t },\n\t\t toStack: function() {\n\t\t return Stack(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toList: function() {\n\t\t return List(isKeyed(this) ? this.valueSeq() : this);\n\t\t },\n\t\t toString: function() {\n\t\t return '[Iterable]';\n\t\t },\n\t\t __toString: function(head, tail) {\n\t\t if (this.size === 0) {\n\t\t return head + tail;\n\t\t }\n\t\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n\t\t },\n\t\t concat: function() {\n\t\t for (var values = [],\n\t\t $__2 = 0; $__2 < arguments.length; $__2++)\n\t\t values[$__2] = arguments[$__2];\n\t\t return reify(this, concatFactory(this, values));\n\t\t },\n\t\t contains: function(searchValue) {\n\t\t return this.some((function(value) {\n\t\t return is(value, searchValue);\n\t\t }));\n\t\t },\n\t\t entries: function() {\n\t\t return this.__iterator(ITERATE_ENTRIES);\n\t\t },\n\t\t every: function(predicate, context) {\n\t\t assertNotInfinite(this.size);\n\t\t var returnValue = true;\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (!predicate.call(context, v, k, c)) {\n\t\t returnValue = false;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return returnValue;\n\t\t },\n\t\t filter: function(predicate, context) {\n\t\t return reify(this, filterFactory(this, predicate, context, true));\n\t\t },\n\t\t find: function(predicate, context, notSetValue) {\n\t\t var foundValue = notSetValue;\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (predicate.call(context, v, k, c)) {\n\t\t foundValue = v;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return foundValue;\n\t\t },\n\t\t forEach: function(sideEffect, context) {\n\t\t assertNotInfinite(this.size);\n\t\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n\t\t },\n\t\t join: function(separator) {\n\t\t assertNotInfinite(this.size);\n\t\t separator = separator !== undefined ? '' + separator : ',';\n\t\t var joined = '';\n\t\t var isFirst = true;\n\t\t this.__iterate((function(v) {\n\t\t isFirst ? (isFirst = false) : (joined += separator);\n\t\t joined += v !== null && v !== undefined ? v : '';\n\t\t }));\n\t\t return joined;\n\t\t },\n\t\t keys: function() {\n\t\t return this.__iterator(ITERATE_KEYS);\n\t\t },\n\t\t map: function(mapper, context) {\n\t\t return reify(this, mapFactory(this, mapper, context));\n\t\t },\n\t\t reduce: function(reducer, initialReduction, context) {\n\t\t assertNotInfinite(this.size);\n\t\t var reduction;\n\t\t var useFirst;\n\t\t if (arguments.length < 2) {\n\t\t useFirst = true;\n\t\t } else {\n\t\t reduction = initialReduction;\n\t\t }\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (useFirst) {\n\t\t useFirst = false;\n\t\t reduction = v;\n\t\t } else {\n\t\t reduction = reducer.call(context, reduction, v, k, c);\n\t\t }\n\t\t }));\n\t\t return reduction;\n\t\t },\n\t\t reduceRight: function(reducer, initialReduction, context) {\n\t\t var reversed = this.toKeyedSeq().reverse();\n\t\t return reversed.reduce.apply(reversed, arguments);\n\t\t },\n\t\t reverse: function() {\n\t\t return reify(this, reverseFactory(this, true));\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t if (wholeSlice(begin, end, this.size)) {\n\t\t return this;\n\t\t }\n\t\t var resolvedBegin = resolveBegin(begin, this.size);\n\t\t var resolvedEnd = resolveEnd(end, this.size);\n\t\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n\t\t return this.toSeq().cacheResult().slice(begin, end);\n\t\t }\n\t\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\n\t\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\n\t\t },\n\t\t some: function(predicate, context) {\n\t\t return !this.every(not(predicate), context);\n\t\t },\n\t\t sort: function(comparator) {\n\t\t return reify(this, sortFactory(this, comparator));\n\t\t },\n\t\t values: function() {\n\t\t return this.__iterator(ITERATE_VALUES);\n\t\t },\n\t\t butLast: function() {\n\t\t return this.slice(0, -1);\n\t\t },\n\t\t count: function(predicate, context) {\n\t\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\n\t\t },\n\t\t countBy: function(grouper, context) {\n\t\t return countByFactory(this, grouper, context);\n\t\t },\n\t\t equals: function(other) {\n\t\t return deepEqual(this, other);\n\t\t },\n\t\t entrySeq: function() {\n\t\t var iterable = this;\n\t\t if (iterable._cache) {\n\t\t return new ArraySeq(iterable._cache);\n\t\t }\n\t\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n\t\t entriesSequence.fromEntrySeq = (function() {\n\t\t return iterable.toSeq();\n\t\t });\n\t\t return entriesSequence;\n\t\t },\n\t\t filterNot: function(predicate, context) {\n\t\t return this.filter(not(predicate), context);\n\t\t },\n\t\t findLast: function(predicate, context, notSetValue) {\n\t\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n\t\t },\n\t\t first: function() {\n\t\t return this.find(returnTrue);\n\t\t },\n\t\t flatMap: function(mapper, context) {\n\t\t return reify(this, flatMapFactory(this, mapper, context));\n\t\t },\n\t\t flatten: function(depth) {\n\t\t return reify(this, flattenFactory(this, depth, true));\n\t\t },\n\t\t fromEntrySeq: function() {\n\t\t return new FromEntriesSequence(this);\n\t\t },\n\t\t get: function(searchKey, notSetValue) {\n\t\t return this.find((function(_, key) {\n\t\t return is(key, searchKey);\n\t\t }), undefined, notSetValue);\n\t\t },\n\t\t getIn: function(searchKeyPath, notSetValue) {\n\t\t var nested = this;\n\t\t if (searchKeyPath) {\n\t\t var iter = getIterator(searchKeyPath) || getIterator($Iterable(searchKeyPath));\n\t\t var step;\n\t\t while (!(step = iter.next()).done) {\n\t\t var key = step.value;\n\t\t nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\n\t\t if (nested === NOT_SET) {\n\t\t return notSetValue;\n\t\t }\n\t\t }\n\t\t }\n\t\t return nested;\n\t\t },\n\t\t groupBy: function(grouper, context) {\n\t\t return groupByFactory(this, grouper, context);\n\t\t },\n\t\t has: function(searchKey) {\n\t\t return this.get(searchKey, NOT_SET) !== NOT_SET;\n\t\t },\n\t\t hasIn: function(searchKeyPath) {\n\t\t return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\n\t\t },\n\t\t isSubset: function(iter) {\n\t\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\n\t\t return this.every((function(value) {\n\t\t return iter.contains(value);\n\t\t }));\n\t\t },\n\t\t isSuperset: function(iter) {\n\t\t return iter.isSubset(this);\n\t\t },\n\t\t keySeq: function() {\n\t\t return this.toSeq().map(keyMapper).toIndexedSeq();\n\t\t },\n\t\t last: function() {\n\t\t return this.toSeq().reverse().first();\n\t\t },\n\t\t max: function(comparator) {\n\t\t return maxFactory(this, comparator);\n\t\t },\n\t\t maxBy: function(mapper, comparator) {\n\t\t return maxFactory(this, comparator, mapper);\n\t\t },\n\t\t min: function(comparator) {\n\t\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\n\t\t },\n\t\t minBy: function(mapper, comparator) {\n\t\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\n\t\t },\n\t\t rest: function() {\n\t\t return this.slice(1);\n\t\t },\n\t\t skip: function(amount) {\n\t\t return reify(this, skipFactory(this, amount, true));\n\t\t },\n\t\t skipLast: function(amount) {\n\t\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\n\t\t },\n\t\t skipWhile: function(predicate, context) {\n\t\t return reify(this, skipWhileFactory(this, predicate, context, true));\n\t\t },\n\t\t skipUntil: function(predicate, context) {\n\t\t return this.skipWhile(not(predicate), context);\n\t\t },\n\t\t sortBy: function(mapper, comparator) {\n\t\t return reify(this, sortFactory(this, comparator, mapper));\n\t\t },\n\t\t take: function(amount) {\n\t\t return reify(this, takeFactory(this, amount));\n\t\t },\n\t\t takeLast: function(amount) {\n\t\t return reify(this, this.toSeq().reverse().take(amount).reverse());\n\t\t },\n\t\t takeWhile: function(predicate, context) {\n\t\t return reify(this, takeWhileFactory(this, predicate, context));\n\t\t },\n\t\t takeUntil: function(predicate, context) {\n\t\t return this.takeWhile(not(predicate), context);\n\t\t },\n\t\t valueSeq: function() {\n\t\t return this.toIndexedSeq();\n\t\t },\n\t\t hashCode: function() {\n\t\t return this.__hash || (this.__hash = hashIterable(this));\n\t\t }\n\t\t}, {});\n\t\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n\t\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n\t\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n\t\tvar IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\t\tvar IterablePrototype = Iterable.prototype;\n\t\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\n\t\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n\t\tIterablePrototype.toJSON = IterablePrototype.toJS;\n\t\tIterablePrototype.__toJS = IterablePrototype.toArray;\n\t\tIterablePrototype.__toStringMapper = quoteString;\n\t\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\n\t\t return this.toString();\n\t\t};\n\t\tIterablePrototype.chain = IterablePrototype.flatMap;\n\t\t(function() {\n\t\t try {\n\t\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\n\t\t if (!Iterable.noLengthWarning) {\n\t\t var stack;\n\t\t try {\n\t\t throw new Error();\n\t\t } catch (error) {\n\t\t stack = error.stack;\n\t\t }\n\t\t if (stack.indexOf('_wrapObject') === -1) {\n\t\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\n\t\t return this.size;\n\t\t }\n\t\t }\n\t\t }});\n\t\t } catch (e) {}\n\t\t})();\n\t\tvar KeyedIterable = function KeyedIterable(value) {\n\t\t return isKeyed(value) ? value : KeyedSeq(value);\n\t\t};\n\t\t($traceurRuntime.createClass)(KeyedIterable, {\n\t\t flip: function() {\n\t\t return reify(this, flipFactory(this));\n\t\t },\n\t\t findKey: function(predicate, context) {\n\t\t var foundKey;\n\t\t this.__iterate((function(v, k, c) {\n\t\t if (predicate.call(context, v, k, c)) {\n\t\t foundKey = k;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return foundKey;\n\t\t },\n\t\t findLastKey: function(predicate, context) {\n\t\t return this.toSeq().reverse().findKey(predicate, context);\n\t\t },\n\t\t keyOf: function(searchValue) {\n\t\t return this.findKey((function(value) {\n\t\t return is(value, searchValue);\n\t\t }));\n\t\t },\n\t\t lastKeyOf: function(searchValue) {\n\t\t return this.toSeq().reverse().keyOf(searchValue);\n\t\t },\n\t\t mapEntries: function(mapper, context) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t return reify(this, this.toSeq().map((function(v, k) {\n\t\t return mapper.call(context, [k, v], iterations++, $__0);\n\t\t })).fromEntrySeq());\n\t\t },\n\t\t mapKeys: function(mapper, context) {\n\t\t var $__0 = this;\n\t\t return reify(this, this.toSeq().flip().map((function(k, v) {\n\t\t return mapper.call(context, k, v, $__0);\n\t\t })).flip());\n\t\t }\n\t\t}, {}, Iterable);\n\t\tvar KeyedIterablePrototype = KeyedIterable.prototype;\n\t\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n\t\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n\t\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n\t\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\n\t\t return k + ': ' + quoteString(v);\n\t\t});\n\t\tvar IndexedIterable = function IndexedIterable(value) {\n\t\t return isIndexed(value) ? value : IndexedSeq(value);\n\t\t};\n\t\t($traceurRuntime.createClass)(IndexedIterable, {\n\t\t toKeyedSeq: function() {\n\t\t return new ToKeyedSequence(this, false);\n\t\t },\n\t\t filter: function(predicate, context) {\n\t\t return reify(this, filterFactory(this, predicate, context, false));\n\t\t },\n\t\t findIndex: function(predicate, context) {\n\t\t var key = this.toKeyedSeq().findKey(predicate, context);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t indexOf: function(searchValue) {\n\t\t var key = this.toKeyedSeq().keyOf(searchValue);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t lastIndexOf: function(searchValue) {\n\t\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t reverse: function() {\n\t\t return reify(this, reverseFactory(this, false));\n\t\t },\n\t\t splice: function(index, removeNum) {\n\t\t var numArgs = arguments.length;\n\t\t removeNum = Math.max(removeNum | 0, 0);\n\t\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n\t\t return this;\n\t\t }\n\t\t index = resolveBegin(index, this.size);\n\t\t var spliced = this.slice(0, index);\n\t\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\n\t\t },\n\t\t findLastIndex: function(predicate, context) {\n\t\t var key = this.toKeyedSeq().findLastKey(predicate, context);\n\t\t return key === undefined ? -1 : key;\n\t\t },\n\t\t first: function() {\n\t\t return this.get(0);\n\t\t },\n\t\t flatten: function(depth) {\n\t\t return reify(this, flattenFactory(this, depth, false));\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\n\t\t return key === index;\n\t\t }), undefined, notSetValue);\n\t\t },\n\t\t has: function(index) {\n\t\t index = wrapIndex(this, index);\n\t\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\n\t\t },\n\t\t interpose: function(separator) {\n\t\t return reify(this, interposeFactory(this, separator));\n\t\t },\n\t\t last: function() {\n\t\t return this.get(-1);\n\t\t },\n\t\t skip: function(amount) {\n\t\t var iter = this;\n\t\t var skipSeq = skipFactory(iter, amount, false);\n\t\t if (isSeq(iter) && skipSeq !== iter) {\n\t\t skipSeq.get = function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\n\t\t };\n\t\t }\n\t\t return reify(this, skipSeq);\n\t\t },\n\t\t skipWhile: function(predicate, context) {\n\t\t return reify(this, skipWhileFactory(this, predicate, context, false));\n\t\t },\n\t\t take: function(amount) {\n\t\t var iter = this;\n\t\t var takeSeq = takeFactory(iter, amount);\n\t\t if (isSeq(iter) && takeSeq !== iter) {\n\t\t takeSeq.get = function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\n\t\t };\n\t\t }\n\t\t return reify(this, takeSeq);\n\t\t }\n\t\t}, {}, Iterable);\n\t\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n\t\tIndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tvar SetIterable = function SetIterable(value) {\n\t\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n\t\t};\n\t\t($traceurRuntime.createClass)(SetIterable, {\n\t\t get: function(value, notSetValue) {\n\t\t return this.has(value) ? value : notSetValue;\n\t\t },\n\t\t contains: function(value) {\n\t\t return this.has(value);\n\t\t },\n\t\t keySeq: function() {\n\t\t return this.valueSeq();\n\t\t }\n\t\t}, {}, Iterable);\n\t\tSetIterable.prototype.has = IterablePrototype.contains;\n\t\tfunction isIterable(maybeIterable) {\n\t\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n\t\t}\n\t\tfunction isKeyed(maybeKeyed) {\n\t\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n\t\t}\n\t\tfunction isIndexed(maybeIndexed) {\n\t\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n\t\t}\n\t\tfunction isAssociative(maybeAssociative) {\n\t\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n\t\t}\n\t\tfunction isOrdered(maybeOrdered) {\n\t\t return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\n\t\t}\n\t\tIterable.isIterable = isIterable;\n\t\tIterable.isKeyed = isKeyed;\n\t\tIterable.isIndexed = isIndexed;\n\t\tIterable.isAssociative = isAssociative;\n\t\tIterable.isOrdered = isOrdered;\n\t\tIterable.Keyed = KeyedIterable;\n\t\tIterable.Indexed = IndexedIterable;\n\t\tIterable.Set = SetIterable;\n\t\tIterable.Iterator = Iterator;\n\t\tfunction keyMapper(v, k) {\n\t\t return k;\n\t\t}\n\t\tfunction entryMapper(v, k) {\n\t\t return [k, v];\n\t\t}\n\t\tfunction not(predicate) {\n\t\t return function() {\n\t\t return !predicate.apply(this, arguments);\n\t\t };\n\t\t}\n\t\tfunction neg(predicate) {\n\t\t return function() {\n\t\t return -predicate.apply(this, arguments);\n\t\t };\n\t\t}\n\t\tfunction quoteString(value) {\n\t\t return typeof value === 'string' ? JSON.stringify(value) : value;\n\t\t}\n\t\tfunction defaultNegComparator(a, b) {\n\t\t return a < b ? 1 : a > b ? -1 : 0;\n\t\t}\n\t\tfunction deepEqual(a, b) {\n\t\t if (a === b) {\n\t\t return true;\n\t\t }\n\t\t if (!isIterable(b) || a.size !== undefined && b.size !== undefined && a.size !== b.size || a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash || isKeyed(a) !== isKeyed(b) || isIndexed(a) !== isIndexed(b) || isOrdered(a) !== isOrdered(b)) {\n\t\t return false;\n\t\t }\n\t\t if (a.size === 0 && b.size === 0) {\n\t\t return true;\n\t\t }\n\t\t var notAssociative = !isAssociative(a);\n\t\t if (isOrdered(a)) {\n\t\t var entries = a.entries();\n\t\t return b.every((function(v, k) {\n\t\t var entry = entries.next().value;\n\t\t return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\n\t\t })) && entries.next().done;\n\t\t }\n\t\t var flipped = false;\n\t\t if (a.size === undefined) {\n\t\t if (b.size === undefined) {\n\t\t a.cacheResult();\n\t\t } else {\n\t\t flipped = true;\n\t\t var _ = a;\n\t\t a = b;\n\t\t b = _;\n\t\t }\n\t\t }\n\t\t var allEqual = true;\n\t\t var bSize = b.__iterate((function(v, k) {\n\t\t if (notAssociative ? !a.has(v) : flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\n\t\t allEqual = false;\n\t\t return false;\n\t\t }\n\t\t }));\n\t\t return allEqual && a.size === bSize;\n\t\t}\n\t\tfunction hashIterable(iterable) {\n\t\t if (iterable.size === Infinity) {\n\t\t return 0;\n\t\t }\n\t\t var ordered = isOrdered(iterable);\n\t\t var keyed = isKeyed(iterable);\n\t\t var h = ordered ? 1 : 0;\n\t\t var size = iterable.__iterate(keyed ? ordered ? (function(v, k) {\n\t\t h = 31 * h + hashMerge(hash(v), hash(k)) | 0;\n\t\t }) : (function(v, k) {\n\t\t h = h + hashMerge(hash(v), hash(k)) | 0;\n\t\t }) : ordered ? (function(v) {\n\t\t h = 31 * h + hash(v) | 0;\n\t\t }) : (function(v) {\n\t\t h = h + hash(v) | 0;\n\t\t }));\n\t\t return murmurHashOfSize(size, h);\n\t\t}\n\t\tfunction murmurHashOfSize(size, h) {\n\t\t h = imul(h, 0xCC9E2D51);\n\t\t h = imul(h << 15 | h >>> -15, 0x1B873593);\n\t\t h = imul(h << 13 | h >>> -13, 5);\n\t\t h = (h + 0xE6546B64 | 0) ^ size;\n\t\t h = imul(h ^ h >>> 16, 0x85EBCA6B);\n\t\t h = imul(h ^ h >>> 13, 0xC2B2AE35);\n\t\t h = smi(h ^ h >>> 16);\n\t\t return h;\n\t\t}\n\t\tfunction hashMerge(a, b) {\n\t\t return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0;\n\t\t}\n\t\tfunction mixin(ctor, methods) {\n\t\t var proto = ctor.prototype;\n\t\t var keyCopier = (function(key) {\n\t\t proto[key] = methods[key];\n\t\t });\n\t\t Object.keys(methods).forEach(keyCopier);\n\t\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n\t\t return ctor;\n\t\t}\n\t\tvar Seq = function Seq(value) {\n\t\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\n\t\t};\n\t\tvar $Seq = Seq;\n\t\t($traceurRuntime.createClass)(Seq, {\n\t\t toSeq: function() {\n\t\t return this;\n\t\t },\n\t\t toString: function() {\n\t\t return this.__toString('Seq {', '}');\n\t\t },\n\t\t cacheResult: function() {\n\t\t if (!this._cache && this.__iterateUncached) {\n\t\t this._cache = this.entrySeq().toArray();\n\t\t this.size = this._cache.length;\n\t\t }\n\t\t return this;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t return seqIterate(this, fn, reverse, true);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return seqIterator(this, type, reverse, true);\n\t\t }\n\t\t}, {of: function() {\n\t\t return $Seq(arguments);\n\t\t }}, Iterable);\n\t\tvar KeyedSeq = function KeyedSeq(value) {\n\t\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\n\t\t};\n\t\tvar $KeyedSeq = KeyedSeq;\n\t\t($traceurRuntime.createClass)(KeyedSeq, {\n\t\t toKeyedSeq: function() {\n\t\t return this;\n\t\t },\n\t\t toSeq: function() {\n\t\t return this;\n\t\t }\n\t\t}, {of: function() {\n\t\t return $KeyedSeq(arguments);\n\t\t }}, Seq);\n\t\tmixin(KeyedSeq, KeyedIterable.prototype);\n\t\tvar IndexedSeq = function IndexedSeq(value) {\n\t\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n\t\t};\n\t\tvar $IndexedSeq = IndexedSeq;\n\t\t($traceurRuntime.createClass)(IndexedSeq, {\n\t\t toIndexedSeq: function() {\n\t\t return this;\n\t\t },\n\t\t toString: function() {\n\t\t return this.__toString('Seq [', ']');\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t return seqIterate(this, fn, reverse, false);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return seqIterator(this, type, reverse, false);\n\t\t }\n\t\t}, {of: function() {\n\t\t return $IndexedSeq(arguments);\n\t\t }}, Seq);\n\t\tmixin(IndexedSeq, IndexedIterable.prototype);\n\t\tvar SetSeq = function SetSeq(value) {\n\t\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\n\t\t};\n\t\tvar $SetSeq = SetSeq;\n\t\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\n\t\t return this;\n\t\t }}, {of: function() {\n\t\t return $SetSeq(arguments);\n\t\t }}, Seq);\n\t\tmixin(SetSeq, SetIterable.prototype);\n\t\tSeq.isSeq = isSeq;\n\t\tSeq.Keyed = KeyedSeq;\n\t\tSeq.Set = SetSeq;\n\t\tSeq.Indexed = IndexedSeq;\n\t\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\t\tSeq.prototype[IS_SEQ_SENTINEL] = true;\n\t\tvar ArraySeq = function ArraySeq(array) {\n\t\t this._array = array;\n\t\t this.size = array.length;\n\t\t};\n\t\t($traceurRuntime.createClass)(ArraySeq, {\n\t\t get: function(index, notSetValue) {\n\t\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var array = this._array;\n\t\t var maxIndex = array.length - 1;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var array = this._array;\n\t\t var maxIndex = array.length - 1;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar ObjectSeq = function ObjectSeq(object) {\n\t\t var keys = Object.keys(object);\n\t\t this._object = object;\n\t\t this._keys = keys;\n\t\t this.size = keys.length;\n\t\t};\n\t\t($traceurRuntime.createClass)(ObjectSeq, {\n\t\t get: function(key, notSetValue) {\n\t\t if (notSetValue !== undefined && !this.has(key)) {\n\t\t return notSetValue;\n\t\t }\n\t\t return this._object[key];\n\t\t },\n\t\t has: function(key) {\n\t\t return this._object.hasOwnProperty(key);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var object = this._object;\n\t\t var keys = this._keys;\n\t\t var maxIndex = keys.length - 1;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t var key = keys[reverse ? maxIndex - ii : ii];\n\t\t if (fn(object[key], key, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var object = this._object;\n\t\t var keys = this._keys;\n\t\t var maxIndex = keys.length - 1;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t var key = keys[reverse ? maxIndex - ii : ii];\n\t\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\n\t\t }));\n\t\t }\n\t\t}, {}, KeyedSeq);\n\t\tObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tvar IterableSeq = function IterableSeq(iterable) {\n\t\t this._iterable = iterable;\n\t\t this.size = iterable.length || iterable.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(IterableSeq, {\n\t\t __iterateUncached: function(fn, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterable = this._iterable;\n\t\t var iterator = getIterator(iterable);\n\t\t var iterations = 0;\n\t\t if (isIterator(iterator)) {\n\t\t var step;\n\t\t while (!(step = iterator.next()).done) {\n\t\t if (fn(step.value, iterations++, this) === false) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t }\n\t\t return iterations;\n\t\t },\n\t\t __iteratorUncached: function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterable = this._iterable;\n\t\t var iterator = getIterator(iterable);\n\t\t if (!isIterator(iterator)) {\n\t\t return new Iterator(iteratorDone);\n\t\t }\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, iterations++, step.value);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar IteratorSeq = function IteratorSeq(iterator) {\n\t\t this._iterator = iterator;\n\t\t this._iteratorCache = [];\n\t\t};\n\t\t($traceurRuntime.createClass)(IteratorSeq, {\n\t\t __iterateUncached: function(fn, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterator = this._iterator;\n\t\t var cache = this._iteratorCache;\n\t\t var iterations = 0;\n\t\t while (iterations < cache.length) {\n\t\t if (fn(cache[iterations], iterations++, this) === false) {\n\t\t return iterations;\n\t\t }\n\t\t }\n\t\t var step;\n\t\t while (!(step = iterator.next()).done) {\n\t\t var val = step.value;\n\t\t cache[iterations] = val;\n\t\t if (fn(val, iterations++, this) === false) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t return iterations;\n\t\t },\n\t\t __iteratorUncached: function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = this._iterator;\n\t\t var cache = this._iteratorCache;\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t if (iterations >= cache.length) {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t cache[iterations] = step.value;\n\t\t }\n\t\t return iteratorValue(type, iterations, cache[iterations++]);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tfunction isSeq(maybeSeq) {\n\t\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n\t\t}\n\t\tvar EMPTY_SEQ;\n\t\tfunction emptySequence() {\n\t\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n\t\t}\n\t\tfunction keyedSeqFromValue(value) {\n\t\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\n\t\t if (!seq) {\n\t\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\n\t\t }\n\t\t return seq;\n\t\t}\n\t\tfunction indexedSeqFromValue(value) {\n\t\t var seq = maybeIndexedSeqFromValue(value);\n\t\t if (!seq) {\n\t\t throw new TypeError('Expected Array or iterable object of values: ' + value);\n\t\t }\n\t\t return seq;\n\t\t}\n\t\tfunction seqFromValue(value) {\n\t\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\n\t\t if (!seq) {\n\t\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\n\t\t }\n\t\t return seq;\n\t\t}\n\t\tfunction maybeIndexedSeqFromValue(value) {\n\t\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\n\t\t}\n\t\tfunction isArrayLike(value) {\n\t\t return value && typeof value.length === 'number';\n\t\t}\n\t\tfunction seqIterate(seq, fn, reverse, useKeys) {\n\t\t var cache = seq._cache;\n\t\t if (cache) {\n\t\t var maxIndex = cache.length - 1;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t }\n\t\t return seq.__iterateUncached(fn, reverse);\n\t\t}\n\t\tfunction seqIterator(seq, type, reverse, useKeys) {\n\t\t var cache = seq._cache;\n\t\t if (cache) {\n\t\t var maxIndex = cache.length - 1;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n\t\t }));\n\t\t }\n\t\t return seq.__iteratorUncached(type, reverse);\n\t\t}\n\t\tfunction fromJS(json, converter) {\n\t\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\n\t\t}\n\t\tfunction _fromJSWith(converter, json, key, parentJSON) {\n\t\t if (Array.isArray(json)) {\n\t\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\n\t\t return _fromJSWith(converter, v, k, json);\n\t\t })));\n\t\t }\n\t\t if (isPlainObj(json)) {\n\t\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\n\t\t return _fromJSWith(converter, v, k, json);\n\t\t })));\n\t\t }\n\t\t return json;\n\t\t}\n\t\tfunction _fromJSDefault(json) {\n\t\t if (Array.isArray(json)) {\n\t\t return IndexedSeq(json).map(_fromJSDefault).toList();\n\t\t }\n\t\t if (isPlainObj(json)) {\n\t\t return KeyedSeq(json).map(_fromJSDefault).toMap();\n\t\t }\n\t\t return json;\n\t\t}\n\t\tfunction isPlainObj(value) {\n\t\t return value && value.constructor === Object;\n\t\t}\n\t\tvar Collection = function Collection() {\n\t\t throw TypeError('Abstract');\n\t\t};\n\t\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\n\t\tvar KeyedCollection = function KeyedCollection() {\n\t\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\n\t\t};\n\t\tvar $KeyedCollection = KeyedCollection;\n\t\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\n\t\tmixin(KeyedCollection, KeyedIterable.prototype);\n\t\tvar IndexedCollection = function IndexedCollection() {\n\t\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\n\t\t};\n\t\tvar $IndexedCollection = IndexedCollection;\n\t\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\n\t\tmixin(IndexedCollection, IndexedIterable.prototype);\n\t\tvar SetCollection = function SetCollection() {\n\t\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\n\t\t};\n\t\tvar $SetCollection = SetCollection;\n\t\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\n\t\tmixin(SetCollection, SetIterable.prototype);\n\t\tCollection.Keyed = KeyedCollection;\n\t\tCollection.Indexed = IndexedCollection;\n\t\tCollection.Set = SetCollection;\n\t\tvar Map = function Map(value) {\n\t\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().withMutations((function(map) {\n\t\t var iter = KeyedIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v, k) {\n\t\t return map.set(k, v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(Map, {\n\t\t toString: function() {\n\t\t return this.__toString('Map {', '}');\n\t\t },\n\t\t get: function(k, notSetValue) {\n\t\t return this._root ? this._root.get(0, undefined, k, notSetValue) : notSetValue;\n\t\t },\n\t\t set: function(k, v) {\n\t\t return updateMap(this, k, v);\n\t\t },\n\t\t setIn: function(keyPath, v) {\n\t\t return this.updateIn(keyPath, NOT_SET, (function() {\n\t\t return v;\n\t\t }));\n\t\t },\n\t\t remove: function(k) {\n\t\t return updateMap(this, k, NOT_SET);\n\t\t },\n\t\t deleteIn: function(keyPath) {\n\t\t return this.updateIn(keyPath, (function() {\n\t\t return NOT_SET;\n\t\t }));\n\t\t },\n\t\t update: function(k, notSetValue, updater) {\n\t\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\n\t\t },\n\t\t updateIn: function(keyPath, notSetValue, updater) {\n\t\t if (!updater) {\n\t\t updater = notSetValue;\n\t\t notSetValue = undefined;\n\t\t }\n\t\t var updatedValue = updateInDeepMap(this, getIterator(keyPath) || getIterator(Iterable(keyPath)), notSetValue, updater);\n\t\t return updatedValue === NOT_SET ? undefined : updatedValue;\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = 0;\n\t\t this._root = null;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return emptyMap();\n\t\t },\n\t\t merge: function() {\n\t\t return mergeIntoMapWith(this, undefined, arguments);\n\t\t },\n\t\t mergeWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__3 = 1; $__3 < arguments.length; $__3++)\n\t\t iters[$__3 - 1] = arguments[$__3];\n\t\t return mergeIntoMapWith(this, merger, iters);\n\t\t },\n\t\t mergeIn: function(keyPath) {\n\t\t for (var iters = [],\n\t\t $__4 = 1; $__4 < arguments.length; $__4++)\n\t\t iters[$__4 - 1] = arguments[$__4];\n\t\t return this.updateIn(keyPath, emptyMap(), (function(m) {\n\t\t return m.merge.apply(m, iters);\n\t\t }));\n\t\t },\n\t\t mergeDeep: function() {\n\t\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\n\t\t },\n\t\t mergeDeepWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__5 = 1; $__5 < arguments.length; $__5++)\n\t\t iters[$__5 - 1] = arguments[$__5];\n\t\t return mergeIntoMapWith(this, deepMerger(merger), iters);\n\t\t },\n\t\t mergeDeepIn: function(keyPath) {\n\t\t for (var iters = [],\n\t\t $__6 = 1; $__6 < arguments.length; $__6++)\n\t\t iters[$__6 - 1] = arguments[$__6];\n\t\t return this.updateIn(keyPath, emptyMap(), (function(m) {\n\t\t return m.mergeDeep.apply(m, iters);\n\t\t }));\n\t\t },\n\t\t sort: function(comparator) {\n\t\t return OrderedMap(sortFactory(this, comparator));\n\t\t },\n\t\t sortBy: function(mapper, comparator) {\n\t\t return OrderedMap(sortFactory(this, comparator, mapper));\n\t\t },\n\t\t withMutations: function(fn) {\n\t\t var mutable = this.asMutable();\n\t\t fn(mutable);\n\t\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n\t\t },\n\t\t asMutable: function() {\n\t\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n\t\t },\n\t\t asImmutable: function() {\n\t\t return this.__ensureOwner();\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this.__altered;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return new MapIterator(this, type, reverse);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t this._root && this._root.iterate((function(entry) {\n\t\t iterations++;\n\t\t return fn(entry[1], entry[0], $__0);\n\t\t }), reverse);\n\t\t return iterations;\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this.__altered = false;\n\t\t return this;\n\t\t }\n\t\t return makeMap(this.size, this._root, ownerID, this.__hash);\n\t\t }\n\t\t}, {}, KeyedCollection);\n\t\tfunction isMap(maybeMap) {\n\t\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n\t\t}\n\t\tMap.isMap = isMap;\n\t\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\t\tvar MapPrototype = Map.prototype;\n\t\tMapPrototype[IS_MAP_SENTINEL] = true;\n\t\tMapPrototype[DELETE] = MapPrototype.remove;\n\t\tMapPrototype.removeIn = MapPrototype.deleteIn;\n\t\tvar ArrayMapNode = function ArrayMapNode(ownerID, entries) {\n\t\t this.ownerID = ownerID;\n\t\t this.entries = entries;\n\t\t};\n\t\tvar $ArrayMapNode = ArrayMapNode;\n\t\t($traceurRuntime.createClass)(ArrayMapNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t var entries = this.entries;\n\t\t for (var ii = 0,\n\t\t len = entries.length; ii < len; ii++) {\n\t\t if (is(key, entries[ii][0])) {\n\t\t return entries[ii][1];\n\t\t }\n\t\t }\n\t\t return notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t var removed = value === NOT_SET;\n\t\t var entries = this.entries;\n\t\t var idx = 0;\n\t\t for (var len = entries.length; idx < len; idx++) {\n\t\t if (is(key, entries[idx][0])) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t var exists = idx < len;\n\t\t if (exists ? entries[idx][1] === value : removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t (removed || !exists) && SetRef(didChangeSize);\n\t\t if (removed && entries.length === 1) {\n\t\t return;\n\t\t }\n\t\t if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\n\t\t return createNodes(ownerID, entries, key, value);\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newEntries = isEditable ? entries : arrCopy(entries);\n\t\t if (exists) {\n\t\t if (removed) {\n\t\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n\t\t } else {\n\t\t newEntries[idx] = [key, value];\n\t\t }\n\t\t } else {\n\t\t newEntries.push([key, value]);\n\t\t }\n\t\t if (isEditable) {\n\t\t this.entries = newEntries;\n\t\t return this;\n\t\t }\n\t\t return new $ArrayMapNode(ownerID, newEntries);\n\t\t }\n\t\t}, {});\n\t\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\n\t\t this.ownerID = ownerID;\n\t\t this.bitmap = bitmap;\n\t\t this.nodes = nodes;\n\t\t};\n\t\tvar $BitmapIndexedNode = BitmapIndexedNode;\n\t\t($traceurRuntime.createClass)(BitmapIndexedNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\n\t\t var bitmap = this.bitmap;\n\t\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var bit = 1 << keyHashFrag;\n\t\t var bitmap = this.bitmap;\n\t\t var exists = (bitmap & bit) !== 0;\n\t\t if (!exists && value === NOT_SET) {\n\t\t return this;\n\t\t }\n\t\t var idx = popCount(bitmap & (bit - 1));\n\t\t var nodes = this.nodes;\n\t\t var node = exists ? nodes[idx] : undefined;\n\t\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\t\t if (newNode === node) {\n\t\t return this;\n\t\t }\n\t\t if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\n\t\t return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\n\t\t }\n\t\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n\t\t return nodes[idx ^ 1];\n\t\t }\n\t\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n\t\t return newNode;\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n\t\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\n\t\t if (isEditable) {\n\t\t this.bitmap = newBitmap;\n\t\t this.nodes = newNodes;\n\t\t return this;\n\t\t }\n\t\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\n\t\t }\n\t\t}, {});\n\t\tvar HashArrayMapNode = function HashArrayMapNode(ownerID, count, nodes) {\n\t\t this.ownerID = ownerID;\n\t\t this.count = count;\n\t\t this.nodes = nodes;\n\t\t};\n\t\tvar $HashArrayMapNode = HashArrayMapNode;\n\t\t($traceurRuntime.createClass)(HashArrayMapNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var node = this.nodes[idx];\n\t\t return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var removed = value === NOT_SET;\n\t\t var nodes = this.nodes;\n\t\t var node = nodes[idx];\n\t\t if (removed && !node) {\n\t\t return this;\n\t\t }\n\t\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\t\t if (newNode === node) {\n\t\t return this;\n\t\t }\n\t\t var newCount = this.count;\n\t\t if (!node) {\n\t\t newCount++;\n\t\t } else if (!newNode) {\n\t\t newCount--;\n\t\t if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\n\t\t return packNodes(ownerID, nodes, newCount, idx);\n\t\t }\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newNodes = setIn(nodes, idx, newNode, isEditable);\n\t\t if (isEditable) {\n\t\t this.count = newCount;\n\t\t this.nodes = newNodes;\n\t\t return this;\n\t\t }\n\t\t return new $HashArrayMapNode(ownerID, newCount, newNodes);\n\t\t }\n\t\t}, {});\n\t\tvar HashCollisionNode = function HashCollisionNode(ownerID, keyHash, entries) {\n\t\t this.ownerID = ownerID;\n\t\t this.keyHash = keyHash;\n\t\t this.entries = entries;\n\t\t};\n\t\tvar $HashCollisionNode = HashCollisionNode;\n\t\t($traceurRuntime.createClass)(HashCollisionNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t var entries = this.entries;\n\t\t for (var ii = 0,\n\t\t len = entries.length; ii < len; ii++) {\n\t\t if (is(key, entries[ii][0])) {\n\t\t return entries[ii][1];\n\t\t }\n\t\t }\n\t\t return notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (keyHash === undefined) {\n\t\t keyHash = hash(key);\n\t\t }\n\t\t var removed = value === NOT_SET;\n\t\t if (keyHash !== this.keyHash) {\n\t\t if (removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t SetRef(didChangeSize);\n\t\t return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\n\t\t }\n\t\t var entries = this.entries;\n\t\t var idx = 0;\n\t\t for (var len = entries.length; idx < len; idx++) {\n\t\t if (is(key, entries[idx][0])) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t var exists = idx < len;\n\t\t if (exists ? entries[idx][1] === value : removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t (removed || !exists) && SetRef(didChangeSize);\n\t\t if (removed && len === 2) {\n\t\t return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\n\t\t }\n\t\t var isEditable = ownerID && ownerID === this.ownerID;\n\t\t var newEntries = isEditable ? entries : arrCopy(entries);\n\t\t if (exists) {\n\t\t if (removed) {\n\t\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n\t\t } else {\n\t\t newEntries[idx] = [key, value];\n\t\t }\n\t\t } else {\n\t\t newEntries.push([key, value]);\n\t\t }\n\t\t if (isEditable) {\n\t\t this.entries = newEntries;\n\t\t return this;\n\t\t }\n\t\t return new $HashCollisionNode(ownerID, this.keyHash, newEntries);\n\t\t }\n\t\t}, {});\n\t\tvar ValueNode = function ValueNode(ownerID, keyHash, entry) {\n\t\t this.ownerID = ownerID;\n\t\t this.keyHash = keyHash;\n\t\t this.entry = entry;\n\t\t};\n\t\tvar $ValueNode = ValueNode;\n\t\t($traceurRuntime.createClass)(ValueNode, {\n\t\t get: function(shift, keyHash, key, notSetValue) {\n\t\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n\t\t },\n\t\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t var removed = value === NOT_SET;\n\t\t var keyMatch = is(key, this.entry[0]);\n\t\t if (keyMatch ? value === this.entry[1] : removed) {\n\t\t return this;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t if (removed) {\n\t\t SetRef(didChangeSize);\n\t\t return;\n\t\t }\n\t\t if (keyMatch) {\n\t\t if (ownerID && ownerID === this.ownerID) {\n\t\t this.entry[1] = value;\n\t\t return this;\n\t\t }\n\t\t return new $ValueNode(ownerID, this.keyHash, [key, value]);\n\t\t }\n\t\t SetRef(didChangeSize);\n\t\t return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\n\t\t }\n\t\t}, {});\n\t\tArrayMapNode.prototype.iterate = HashCollisionNode.prototype.iterate = function(fn, reverse) {\n\t\t var entries = this.entries;\n\t\t for (var ii = 0,\n\t\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n\t\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n\t\t return false;\n\t\t }\n\t\t }\n\t\t};\n\t\tBitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate = function(fn, reverse) {\n\t\t var nodes = this.nodes;\n\t\t for (var ii = 0,\n\t\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n\t\t var node = nodes[reverse ? maxIndex - ii : ii];\n\t\t if (node && node.iterate(fn, reverse) === false) {\n\t\t return false;\n\t\t }\n\t\t }\n\t\t};\n\t\tValueNode.prototype.iterate = function(fn, reverse) {\n\t\t return fn(this.entry);\n\t\t};\n\t\tvar MapIterator = function MapIterator(map, type, reverse) {\n\t\t this._type = type;\n\t\t this._reverse = reverse;\n\t\t this._stack = map._root && mapIteratorFrame(map._root);\n\t\t};\n\t\t($traceurRuntime.createClass)(MapIterator, {next: function() {\n\t\t var type = this._type;\n\t\t var stack = this._stack;\n\t\t while (stack) {\n\t\t var node = stack.node;\n\t\t var index = stack.index++;\n\t\t var maxIndex;\n\t\t if (node.entry) {\n\t\t if (index === 0) {\n\t\t return mapIteratorValue(type, node.entry);\n\t\t }\n\t\t } else if (node.entries) {\n\t\t maxIndex = node.entries.length - 1;\n\t\t if (index <= maxIndex) {\n\t\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n\t\t }\n\t\t } else {\n\t\t maxIndex = node.nodes.length - 1;\n\t\t if (index <= maxIndex) {\n\t\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n\t\t if (subNode) {\n\t\t if (subNode.entry) {\n\t\t return mapIteratorValue(type, subNode.entry);\n\t\t }\n\t\t stack = this._stack = mapIteratorFrame(subNode, stack);\n\t\t }\n\t\t continue;\n\t\t }\n\t\t }\n\t\t stack = this._stack = this._stack.__prev;\n\t\t }\n\t\t return iteratorDone();\n\t\t }}, {}, Iterator);\n\t\tfunction mapIteratorValue(type, entry) {\n\t\t return iteratorValue(type, entry[0], entry[1]);\n\t\t}\n\t\tfunction mapIteratorFrame(node, prev) {\n\t\t return {\n\t\t node: node,\n\t\t index: 0,\n\t\t __prev: prev\n\t\t };\n\t\t}\n\t\tfunction makeMap(size, root, ownerID, hash) {\n\t\t var map = Object.create(MapPrototype);\n\t\t map.size = size;\n\t\t map._root = root;\n\t\t map.__ownerID = ownerID;\n\t\t map.__hash = hash;\n\t\t map.__altered = false;\n\t\t return map;\n\t\t}\n\t\tvar EMPTY_MAP;\n\t\tfunction emptyMap() {\n\t\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n\t\t}\n\t\tfunction updateMap(map, k, v) {\n\t\t var newRoot;\n\t\t var newSize;\n\t\t if (!map._root) {\n\t\t if (v === NOT_SET) {\n\t\t return map;\n\t\t }\n\t\t newSize = 1;\n\t\t newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\n\t\t } else {\n\t\t var didChangeSize = MakeRef(CHANGE_LENGTH);\n\t\t var didAlter = MakeRef(DID_ALTER);\n\t\t newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\n\t\t if (!didAlter.value) {\n\t\t return map;\n\t\t }\n\t\t newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n\t\t }\n\t\t if (map.__ownerID) {\n\t\t map.size = newSize;\n\t\t map._root = newRoot;\n\t\t map.__hash = undefined;\n\t\t map.__altered = true;\n\t\t return map;\n\t\t }\n\t\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n\t\t}\n\t\tfunction updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n\t\t if (!node) {\n\t\t if (value === NOT_SET) {\n\t\t return node;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t SetRef(didChangeSize);\n\t\t return new ValueNode(ownerID, keyHash, [key, value]);\n\t\t }\n\t\t return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\n\t\t}\n\t\tfunction isLeafNode(node) {\n\t\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n\t\t}\n\t\tfunction mergeIntoNode(node, ownerID, shift, keyHash, entry) {\n\t\t if (node.keyHash === keyHash) {\n\t\t return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\n\t\t }\n\t\t var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\n\t\t var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\t\t var newNode;\n\t\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] : ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\t\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n\t\t}\n\t\tfunction createNodes(ownerID, entries, key, value) {\n\t\t if (!ownerID) {\n\t\t ownerID = new OwnerID();\n\t\t }\n\t\t var node = new ValueNode(ownerID, hash(key), [key, value]);\n\t\t for (var ii = 0; ii < entries.length; ii++) {\n\t\t var entry = entries[ii];\n\t\t node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\n\t\t }\n\t\t return node;\n\t\t}\n\t\tfunction packNodes(ownerID, nodes, count, excluding) {\n\t\t var bitmap = 0;\n\t\t var packedII = 0;\n\t\t var packedNodes = new Array(count);\n\t\t for (var ii = 0,\n\t\t bit = 1,\n\t\t len = nodes.length; ii < len; ii++, bit <<= 1) {\n\t\t var node = nodes[ii];\n\t\t if (node !== undefined && ii !== excluding) {\n\t\t bitmap |= bit;\n\t\t packedNodes[packedII++] = node;\n\t\t }\n\t\t }\n\t\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n\t\t}\n\t\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\n\t\t var count = 0;\n\t\t var expandedNodes = new Array(SIZE);\n\t\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n\t\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n\t\t }\n\t\t expandedNodes[including] = node;\n\t\t return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\n\t\t}\n\t\tfunction mergeIntoMapWith(map, merger, iterables) {\n\t\t var iters = [];\n\t\t for (var ii = 0; ii < iterables.length; ii++) {\n\t\t var value = iterables[ii];\n\t\t var iter = KeyedIterable(value);\n\t\t if (!isIterable(value)) {\n\t\t iter = iter.map((function(v) {\n\t\t return fromJS(v);\n\t\t }));\n\t\t }\n\t\t iters.push(iter);\n\t\t }\n\t\t return mergeIntoCollectionWith(map, merger, iters);\n\t\t}\n\t\tfunction deepMerger(merger) {\n\t\t return (function(existing, value) {\n\t\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\n\t\t });\n\t\t}\n\t\tfunction mergeIntoCollectionWith(collection, merger, iters) {\n\t\t iters = iters.filter((function(x) {\n\t\t return x.size !== 0;\n\t\t }));\n\t\t if (iters.length === 0) {\n\t\t return collection;\n\t\t }\n\t\t if (collection.size === 0 && iters.length === 1) {\n\t\t return collection.constructor(iters[0]);\n\t\t }\n\t\t return collection.withMutations((function(collection) {\n\t\t var mergeIntoMap = merger ? (function(value, key) {\n\t\t collection.update(key, NOT_SET, (function(existing) {\n\t\t return existing === NOT_SET ? value : merger(existing, value);\n\t\t }));\n\t\t }) : (function(value, key) {\n\t\t collection.set(key, value);\n\t\t });\n\t\t for (var ii = 0; ii < iters.length; ii++) {\n\t\t iters[ii].forEach(mergeIntoMap);\n\t\t }\n\t\t }));\n\t\t}\n\t\tfunction updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\n\t\t var isNotSet = existing === NOT_SET;\n\t\t var step = keyPathIter.next();\n\t\t if (step.done) {\n\t\t var existingValue = isNotSet ? notSetValue : existing;\n\t\t var newValue = updater(existingValue);\n\t\t return newValue === existingValue ? existing : newValue;\n\t\t }\n\t\t invariant(isNotSet || (existing && existing.set), 'invalid keyPath');\n\t\t var key = step.value;\n\t\t var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\n\t\t var nextUpdated = updateInDeepMap(nextExisting, keyPathIter, notSetValue, updater);\n\t\t return nextUpdated === nextExisting ? existing : nextUpdated === NOT_SET ? existing.remove(key) : (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\n\t\t}\n\t\tfunction popCount(x) {\n\t\t x = x - ((x >> 1) & 0x55555555);\n\t\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n\t\t x = (x + (x >> 4)) & 0x0f0f0f0f;\n\t\t x = x + (x >> 8);\n\t\t x = x + (x >> 16);\n\t\t return x & 0x7f;\n\t\t}\n\t\tfunction setIn(array, idx, val, canEdit) {\n\t\t var newArray = canEdit ? array : arrCopy(array);\n\t\t newArray[idx] = val;\n\t\t return newArray;\n\t\t}\n\t\tfunction spliceIn(array, idx, val, canEdit) {\n\t\t var newLen = array.length + 1;\n\t\t if (canEdit && idx + 1 === newLen) {\n\t\t array[idx] = val;\n\t\t return array;\n\t\t }\n\t\t var newArray = new Array(newLen);\n\t\t var after = 0;\n\t\t for (var ii = 0; ii < newLen; ii++) {\n\t\t if (ii === idx) {\n\t\t newArray[ii] = val;\n\t\t after = -1;\n\t\t } else {\n\t\t newArray[ii] = array[ii + after];\n\t\t }\n\t\t }\n\t\t return newArray;\n\t\t}\n\t\tfunction spliceOut(array, idx, canEdit) {\n\t\t var newLen = array.length - 1;\n\t\t if (canEdit && idx === newLen) {\n\t\t array.pop();\n\t\t return array;\n\t\t }\n\t\t var newArray = new Array(newLen);\n\t\t var after = 0;\n\t\t for (var ii = 0; ii < newLen; ii++) {\n\t\t if (ii === idx) {\n\t\t after = 1;\n\t\t }\n\t\t newArray[ii] = array[ii + after];\n\t\t }\n\t\t return newArray;\n\t\t}\n\t\tvar MAX_ARRAY_MAP_SIZE = SIZE / 4;\n\t\tvar MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\n\t\tvar MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\n\t\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\n\t\t this._iter = indexed;\n\t\t this._useKeys = useKeys;\n\t\t this.size = indexed.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(ToKeyedSequence, {\n\t\t get: function(key, notSetValue) {\n\t\t return this._iter.get(key, notSetValue);\n\t\t },\n\t\t has: function(key) {\n\t\t return this._iter.has(key);\n\t\t },\n\t\t valueSeq: function() {\n\t\t return this._iter.valueSeq();\n\t\t },\n\t\t reverse: function() {\n\t\t var $__0 = this;\n\t\t var reversedSequence = reverseFactory(this, true);\n\t\t if (!this._useKeys) {\n\t\t reversedSequence.valueSeq = (function() {\n\t\t return $__0._iter.toSeq().reverse();\n\t\t });\n\t\t }\n\t\t return reversedSequence;\n\t\t },\n\t\t map: function(mapper, context) {\n\t\t var $__0 = this;\n\t\t var mappedSequence = mapFactory(this, mapper, context);\n\t\t if (!this._useKeys) {\n\t\t mappedSequence.valueSeq = (function() {\n\t\t return $__0._iter.toSeq().map(mapper, context);\n\t\t });\n\t\t }\n\t\t return mappedSequence;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var ii;\n\t\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\n\t\t return fn(v, k, $__0);\n\t\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\n\t\t return fn(v, reverse ? --ii : ii++, $__0);\n\t\t })), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t if (this._useKeys) {\n\t\t return this._iter.__iterator(type, reverse);\n\t\t }\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t var ii = reverse ? resolveSize(this) : 0;\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n\t\t }));\n\t\t }\n\t\t}, {}, KeyedSeq);\n\t\tToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\n\t\t this._iter = iter;\n\t\t this.size = iter.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(ToIndexedSequence, {\n\t\t contains: function(value) {\n\t\t return this._iter.contains(value);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t return this._iter.__iterate((function(v) {\n\t\t return fn(v, iterations++, $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\n\t\t }));\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar ToSetSequence = function ToSetSequence(iter) {\n\t\t this._iter = iter;\n\t\t this.size = iter.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(ToSetSequence, {\n\t\t has: function(key) {\n\t\t return this._iter.contains(key);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._iter.__iterate((function(v) {\n\t\t return fn(v, v, $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\n\t\t }));\n\t\t }\n\t\t}, {}, SetSeq);\n\t\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\n\t\t this._iter = entries;\n\t\t this.size = entries.size;\n\t\t};\n\t\t($traceurRuntime.createClass)(FromEntriesSequence, {\n\t\t entrySeq: function() {\n\t\t return this._iter.toSeq();\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._iter.__iterate((function(entry) {\n\t\t if (entry) {\n\t\t validateEntry(entry);\n\t\t return fn(entry[1], entry[0], $__0);\n\t\t }\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t\t return new Iterator((function() {\n\t\t while (true) {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t if (entry) {\n\t\t validateEntry(entry);\n\t\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\n\t\t }\n\t\t }\n\t\t }));\n\t\t }\n\t\t}, {}, KeyedSeq);\n\t\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\n\t\tfunction flipFactory(iterable) {\n\t\t var flipSequence = makeSequence(iterable);\n\t\t flipSequence._iter = iterable;\n\t\t flipSequence.size = iterable.size;\n\t\t flipSequence.flip = (function() {\n\t\t return iterable;\n\t\t });\n\t\t flipSequence.reverse = function() {\n\t\t var reversedSequence = iterable.reverse.apply(this);\n\t\t reversedSequence.flip = (function() {\n\t\t return iterable.reverse();\n\t\t });\n\t\t return reversedSequence;\n\t\t };\n\t\t flipSequence.has = (function(key) {\n\t\t return iterable.contains(key);\n\t\t });\n\t\t flipSequence.contains = (function(key) {\n\t\t return iterable.has(key);\n\t\t });\n\t\t flipSequence.cacheResult = cacheResultThrough;\n\t\t flipSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return iterable.__iterate((function(v, k) {\n\t\t return fn(k, v, $__0) !== false;\n\t\t }), reverse);\n\t\t };\n\t\t flipSequence.__iteratorUncached = function(type, reverse) {\n\t\t if (type === ITERATE_ENTRIES) {\n\t\t var iterator = iterable.__iterator(type, reverse);\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t if (!step.done) {\n\t\t var k = step.value[0];\n\t\t step.value[0] = step.value[1];\n\t\t step.value[1] = k;\n\t\t }\n\t\t return step;\n\t\t }));\n\t\t }\n\t\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\n\t\t };\n\t\t return flipSequence;\n\t\t}\n\t\tfunction mapFactory(iterable, mapper, context) {\n\t\t var mappedSequence = makeSequence(iterable);\n\t\t mappedSequence.size = iterable.size;\n\t\t mappedSequence.has = (function(key) {\n\t\t return iterable.has(key);\n\t\t });\n\t\t mappedSequence.get = (function(key, notSetValue) {\n\t\t var v = iterable.get(key, NOT_SET);\n\t\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\n\t\t });\n\t\t mappedSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return iterable.__iterate((function(v, k, c) {\n\t\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\n\t\t }), reverse);\n\t\t };\n\t\t mappedSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t return new Iterator((function() {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t var key = entry[0];\n\t\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\n\t\t }));\n\t\t };\n\t\t return mappedSequence;\n\t\t}\n\t\tfunction reverseFactory(iterable, useKeys) {\n\t\t var reversedSequence = makeSequence(iterable);\n\t\t reversedSequence._iter = iterable;\n\t\t reversedSequence.size = iterable.size;\n\t\t reversedSequence.reverse = (function() {\n\t\t return iterable;\n\t\t });\n\t\t if (iterable.flip) {\n\t\t reversedSequence.flip = function() {\n\t\t var flipSequence = flipFactory(iterable);\n\t\t flipSequence.reverse = (function() {\n\t\t return iterable.flip();\n\t\t });\n\t\t return flipSequence;\n\t\t };\n\t\t }\n\t\t reversedSequence.get = (function(key, notSetValue) {\n\t\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\n\t\t });\n\t\t reversedSequence.has = (function(key) {\n\t\t return iterable.has(useKeys ? key : -1 - key);\n\t\t });\n\t\t reversedSequence.contains = (function(value) {\n\t\t return iterable.contains(value);\n\t\t });\n\t\t reversedSequence.cacheResult = cacheResultThrough;\n\t\t reversedSequence.__iterate = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return iterable.__iterate((function(v, k) {\n\t\t return fn(v, k, $__0);\n\t\t }), !reverse);\n\t\t };\n\t\t reversedSequence.__iterator = (function(type, reverse) {\n\t\t return iterable.__iterator(type, !reverse);\n\t\t });\n\t\t return reversedSequence;\n\t\t}\n\t\tfunction filterFactory(iterable, predicate, context, useKeys) {\n\t\t var filterSequence = makeSequence(iterable);\n\t\t if (useKeys) {\n\t\t filterSequence.has = (function(key) {\n\t\t var v = iterable.get(key, NOT_SET);\n\t\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n\t\t });\n\t\t filterSequence.get = (function(key, notSetValue) {\n\t\t var v = iterable.get(key, NOT_SET);\n\t\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\n\t\t });\n\t\t }\n\t\t filterSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k, c) {\n\t\t if (predicate.call(context, v, k, c)) {\n\t\t iterations++;\n\t\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t\t }\n\t\t }), reverse);\n\t\t return iterations;\n\t\t };\n\t\t filterSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t while (true) {\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t var key = entry[0];\n\t\t var value = entry[1];\n\t\t if (predicate.call(context, value, key, iterable)) {\n\t\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\n\t\t }\n\t\t }\n\t\t }));\n\t\t };\n\t\t return filterSequence;\n\t\t}\n\t\tfunction countByFactory(iterable, grouper, context) {\n\t\t var groups = Map().asMutable();\n\t\t iterable.__iterate((function(v, k) {\n\t\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\n\t\t return a + 1;\n\t\t }));\n\t\t }));\n\t\t return groups.asImmutable();\n\t\t}\n\t\tfunction groupByFactory(iterable, grouper, context) {\n\t\t var isKeyedIter = isKeyed(iterable);\n\t\t var groups = Map().asMutable();\n\t\t iterable.__iterate((function(v, k) {\n\t\t groups.update(grouper.call(context, v, k, iterable), (function(a) {\n\t\t return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a);\n\t\t }));\n\t\t }));\n\t\t var coerce = iterableClass(iterable);\n\t\t return groups.map((function(arr) {\n\t\t return reify(iterable, coerce(arr));\n\t\t }));\n\t\t}\n\t\tfunction takeFactory(iterable, amount) {\n\t\t if (amount > iterable.size) {\n\t\t return iterable;\n\t\t }\n\t\t if (amount < 0) {\n\t\t amount = 0;\n\t\t }\n\t\t var takeSequence = makeSequence(iterable);\n\t\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\n\t\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (amount === 0) {\n\t\t return 0;\n\t\t }\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k) {\n\t\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = amount && iterable.__iterator(type, reverse);\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t if (iterations++ > amount) {\n\t\t return iteratorDone();\n\t\t }\n\t\t return iterator.next();\n\t\t }));\n\t\t };\n\t\t return takeSequence;\n\t\t}\n\t\tfunction takeWhileFactory(iterable, predicate, context) {\n\t\t var takeSequence = makeSequence(iterable);\n\t\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k, c) {\n\t\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t var iterating = true;\n\t\t return new Iterator((function() {\n\t\t if (!iterating) {\n\t\t return iteratorDone();\n\t\t }\n\t\t var step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t var entry = step.value;\n\t\t var k = entry[0];\n\t\t var v = entry[1];\n\t\t if (!predicate.call(context, v, k, $__0)) {\n\t\t iterating = false;\n\t\t return iteratorDone();\n\t\t }\n\t\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t\t }));\n\t\t };\n\t\t return takeSequence;\n\t\t}\n\t\tfunction skipFactory(iterable, amount, useKeys) {\n\t\t if (amount <= 0) {\n\t\t return iterable;\n\t\t }\n\t\t var skipSequence = makeSequence(iterable);\n\t\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\n\t\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var skipped = 0;\n\t\t var isSkipping = true;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k) {\n\t\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\n\t\t iterations++;\n\t\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t\t }\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = amount && iterable.__iterator(type, reverse);\n\t\t var skipped = 0;\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t while (skipped < amount) {\n\t\t skipped++;\n\t\t iterator.next();\n\t\t }\n\t\t var step = iterator.next();\n\t\t if (useKeys || type === ITERATE_VALUES) {\n\t\t return step;\n\t\t } else if (type === ITERATE_KEYS) {\n\t\t return iteratorValue(type, iterations++, undefined, step);\n\t\t } else {\n\t\t return iteratorValue(type, iterations++, step.value[1], step);\n\t\t }\n\t\t }));\n\t\t };\n\t\t return skipSequence;\n\t\t}\n\t\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\n\t\t var skipSequence = makeSequence(iterable);\n\t\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterate(fn, reverse);\n\t\t }\n\t\t var isSkipping = true;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k, c) {\n\t\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n\t\t iterations++;\n\t\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t\t }\n\t\t }));\n\t\t return iterations;\n\t\t };\n\t\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t\t var $__0 = this;\n\t\t if (reverse) {\n\t\t return this.cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t\t var skipping = true;\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t var step,\n\t\t k,\n\t\t v;\n\t\t do {\n\t\t step = iterator.next();\n\t\t if (step.done) {\n\t\t if (useKeys || type === ITERATE_VALUES) {\n\t\t return step;\n\t\t } else if (type === ITERATE_KEYS) {\n\t\t return iteratorValue(type, iterations++, undefined, step);\n\t\t } else {\n\t\t return iteratorValue(type, iterations++, step.value[1], step);\n\t\t }\n\t\t }\n\t\t var entry = step.value;\n\t\t k = entry[0];\n\t\t v = entry[1];\n\t\t skipping && (skipping = predicate.call(context, v, k, $__0));\n\t\t } while (skipping);\n\t\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t\t }));\n\t\t };\n\t\t return skipSequence;\n\t\t}\n\t\tfunction concatFactory(iterable, values) {\n\t\t var isKeyedIterable = isKeyed(iterable);\n\t\t var iters = [iterable].concat(values).map((function(v) {\n\t\t if (!isIterable(v)) {\n\t\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n\t\t } else if (isKeyedIterable) {\n\t\t v = KeyedIterable(v);\n\t\t }\n\t\t return v;\n\t\t })).filter((function(v) {\n\t\t return v.size !== 0;\n\t\t }));\n\t\t if (iters.length === 0) {\n\t\t return iterable;\n\t\t }\n\t\t if (iters.length === 1) {\n\t\t var singleton = iters[0];\n\t\t if (singleton === iterable || isKeyedIterable && isKeyed(singleton) || isIndexed(iterable) && isIndexed(singleton)) {\n\t\t return singleton;\n\t\t }\n\t\t }\n\t\t var concatSeq = new ArraySeq(iters);\n\t\t if (isKeyedIterable) {\n\t\t concatSeq = concatSeq.toKeyedSeq();\n\t\t } else if (!isIndexed(iterable)) {\n\t\t concatSeq = concatSeq.toSetSeq();\n\t\t }\n\t\t concatSeq = concatSeq.flatten(true);\n\t\t concatSeq.size = iters.reduce((function(sum, seq) {\n\t\t if (sum !== undefined) {\n\t\t var size = seq.size;\n\t\t if (size !== undefined) {\n\t\t return sum + size;\n\t\t }\n\t\t }\n\t\t }), 0);\n\t\t return concatSeq;\n\t\t}\n\t\tfunction flattenFactory(iterable, depth, useKeys) {\n\t\t var flatSequence = makeSequence(iterable);\n\t\t flatSequence.__iterateUncached = function(fn, reverse) {\n\t\t var iterations = 0;\n\t\t var stopped = false;\n\t\t function flatDeep(iter, currentDepth) {\n\t\t var $__0 = this;\n\t\t iter.__iterate((function(v, k) {\n\t\t if ((!depth || currentDepth < depth) && isIterable(v)) {\n\t\t flatDeep(v, currentDepth + 1);\n\t\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\n\t\t stopped = true;\n\t\t }\n\t\t return !stopped;\n\t\t }), reverse);\n\t\t }\n\t\t flatDeep(iterable, 0);\n\t\t return iterations;\n\t\t };\n\t\t flatSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(type, reverse);\n\t\t var stack = [];\n\t\t var iterations = 0;\n\t\t return new Iterator((function() {\n\t\t while (iterator) {\n\t\t var step = iterator.next();\n\t\t if (step.done !== false) {\n\t\t iterator = stack.pop();\n\t\t continue;\n\t\t }\n\t\t var v = step.value;\n\t\t if (type === ITERATE_ENTRIES) {\n\t\t v = v[1];\n\t\t }\n\t\t if ((!depth || stack.length < depth) && isIterable(v)) {\n\t\t stack.push(iterator);\n\t\t iterator = v.__iterator(type, reverse);\n\t\t } else {\n\t\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\n\t\t }\n\t\t }\n\t\t return iteratorDone();\n\t\t }));\n\t\t };\n\t\t return flatSequence;\n\t\t}\n\t\tfunction flatMapFactory(iterable, mapper, context) {\n\t\t var coerce = iterableClass(iterable);\n\t\t return iterable.toSeq().map((function(v, k) {\n\t\t return coerce(mapper.call(context, v, k, iterable));\n\t\t })).flatten(true);\n\t\t}\n\t\tfunction interposeFactory(iterable, separator) {\n\t\t var interposedSequence = makeSequence(iterable);\n\t\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\n\t\t interposedSequence.__iterateUncached = function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t var iterations = 0;\n\t\t iterable.__iterate((function(v, k) {\n\t\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\n\t\t }), reverse);\n\t\t return iterations;\n\t\t };\n\t\t interposedSequence.__iteratorUncached = function(type, reverse) {\n\t\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n\t\t var iterations = 0;\n\t\t var step;\n\t\t return new Iterator((function() {\n\t\t if (!step || iterations % 2) {\n\t\t step = iterator.next();\n\t\t if (step.done) {\n\t\t return step;\n\t\t }\n\t\t }\n\t\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\n\t\t }));\n\t\t };\n\t\t return interposedSequence;\n\t\t}\n\t\tfunction sortFactory(iterable, comparator, mapper) {\n\t\t if (!comparator) {\n\t\t comparator = defaultComparator;\n\t\t }\n\t\t var isKeyedIterable = isKeyed(iterable);\n\t\t var index = 0;\n\t\t var entries = iterable.toSeq().map((function(v, k) {\n\t\t return [k, v, index++, mapper ? mapper(v, k, iterable) : v];\n\t\t })).toArray();\n\t\t entries.sort((function(a, b) {\n\t\t return comparator(a[3], b[3]) || a[2] - b[2];\n\t\t })).forEach(isKeyedIterable ? (function(v, i) {\n\t\t entries[i].length = 2;\n\t\t }) : (function(v, i) {\n\t\t entries[i] = v[1];\n\t\t }));\n\t\t return isKeyedIterable ? KeyedSeq(entries) : isIndexed(iterable) ? IndexedSeq(entries) : SetSeq(entries);\n\t\t}\n\t\tfunction maxFactory(iterable, comparator, mapper) {\n\t\t if (!comparator) {\n\t\t comparator = defaultComparator;\n\t\t }\n\t\t if (mapper) {\n\t\t var entry = iterable.toSeq().map((function(v, k) {\n\t\t return [v, mapper(v, k, iterable)];\n\t\t })).reduce((function(a, b) {\n\t\t return _maxCompare(comparator, a[1], b[1]) ? b : a;\n\t\t }));\n\t\t return entry && entry[0];\n\t\t } else {\n\t\t return iterable.reduce((function(a, b) {\n\t\t return _maxCompare(comparator, a, b) ? b : a;\n\t\t }));\n\t\t }\n\t\t}\n\t\tfunction _maxCompare(comparator, a, b) {\n\t\t var comp = comparator(b, a);\n\t\t return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\n\t\t}\n\t\tfunction reify(iter, seq) {\n\t\t return isSeq(iter) ? seq : iter.constructor(seq);\n\t\t}\n\t\tfunction validateEntry(entry) {\n\t\t if (entry !== Object(entry)) {\n\t\t throw new TypeError('Expected [K, V] tuple: ' + entry);\n\t\t }\n\t\t}\n\t\tfunction resolveSize(iter) {\n\t\t assertNotInfinite(iter.size);\n\t\t return ensureSize(iter);\n\t\t}\n\t\tfunction iterableClass(iterable) {\n\t\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\n\t\t}\n\t\tfunction makeSequence(iterable) {\n\t\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\n\t\t}\n\t\tfunction cacheResultThrough() {\n\t\t if (this._iter.cacheResult) {\n\t\t this._iter.cacheResult();\n\t\t this.size = this._iter.size;\n\t\t return this;\n\t\t } else {\n\t\t return Seq.prototype.cacheResult.call(this);\n\t\t }\n\t\t}\n\t\tfunction defaultComparator(a, b) {\n\t\t return a > b ? 1 : a < b ? -1 : 0;\n\t\t}\n\t\tvar List = function List(value) {\n\t\t var empty = emptyList();\n\t\t if (value === null || value === undefined) {\n\t\t return empty;\n\t\t }\n\t\t if (isList(value)) {\n\t\t return value;\n\t\t }\n\t\t var iter = IndexedIterable(value);\n\t\t var size = iter.size;\n\t\t if (size === 0) {\n\t\t return empty;\n\t\t }\n\t\t assertNotInfinite(size);\n\t\t if (size > 0 && size < SIZE) {\n\t\t return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\n\t\t }\n\t\t return empty.withMutations((function(list) {\n\t\t list.setSize(size);\n\t\t iter.forEach((function(v, i) {\n\t\t return list.set(i, v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(List, {\n\t\t toString: function() {\n\t\t return this.__toString('List [', ']');\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t index = wrapIndex(this, index);\n\t\t if (index < 0 || index >= this.size) {\n\t\t return notSetValue;\n\t\t }\n\t\t index += this._origin;\n\t\t var node = listNodeFor(this, index);\n\t\t return node && node.array[index & MASK];\n\t\t },\n\t\t set: function(index, value) {\n\t\t return updateList(this, index, value);\n\t\t },\n\t\t remove: function(index) {\n\t\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = this._origin = this._capacity = 0;\n\t\t this._level = SHIFT;\n\t\t this._root = this._tail = null;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return emptyList();\n\t\t },\n\t\t push: function() {\n\t\t var values = arguments;\n\t\t var oldSize = this.size;\n\t\t return this.withMutations((function(list) {\n\t\t setListBounds(list, 0, oldSize + values.length);\n\t\t for (var ii = 0; ii < values.length; ii++) {\n\t\t list.set(oldSize + ii, values[ii]);\n\t\t }\n\t\t }));\n\t\t },\n\t\t pop: function() {\n\t\t return setListBounds(this, 0, -1);\n\t\t },\n\t\t unshift: function() {\n\t\t var values = arguments;\n\t\t return this.withMutations((function(list) {\n\t\t setListBounds(list, -values.length);\n\t\t for (var ii = 0; ii < values.length; ii++) {\n\t\t list.set(ii, values[ii]);\n\t\t }\n\t\t }));\n\t\t },\n\t\t shift: function() {\n\t\t return setListBounds(this, 1);\n\t\t },\n\t\t merge: function() {\n\t\t return mergeIntoListWith(this, undefined, arguments);\n\t\t },\n\t\t mergeWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__7 = 1; $__7 < arguments.length; $__7++)\n\t\t iters[$__7 - 1] = arguments[$__7];\n\t\t return mergeIntoListWith(this, merger, iters);\n\t\t },\n\t\t mergeDeep: function() {\n\t\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\n\t\t },\n\t\t mergeDeepWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__8 = 1; $__8 < arguments.length; $__8++)\n\t\t iters[$__8 - 1] = arguments[$__8];\n\t\t return mergeIntoListWith(this, deepMerger(merger), iters);\n\t\t },\n\t\t setSize: function(size) {\n\t\t return setListBounds(this, 0, size);\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t var size = this.size;\n\t\t if (wholeSlice(begin, end, size)) {\n\t\t return this;\n\t\t }\n\t\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var index = 0;\n\t\t var values = iterateList(this, reverse);\n\t\t return new Iterator((function() {\n\t\t var value = values();\n\t\t return value === DONE ? iteratorDone() : iteratorValue(type, index++, value);\n\t\t }));\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var index = 0;\n\t\t var values = iterateList(this, reverse);\n\t\t var value;\n\t\t while ((value = values()) !== DONE) {\n\t\t if (fn(value, index++, this) === false) {\n\t\t break;\n\t\t }\n\t\t }\n\t\t return index;\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t return this;\n\t\t }\n\t\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n\t\t }\n\t\t}, {of: function() {\n\t\t return this(arguments);\n\t\t }}, IndexedCollection);\n\t\tfunction isList(maybeList) {\n\t\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n\t\t}\n\t\tList.isList = isList;\n\t\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\t\tvar ListPrototype = List.prototype;\n\t\tListPrototype[IS_LIST_SENTINEL] = true;\n\t\tListPrototype[DELETE] = ListPrototype.remove;\n\t\tListPrototype.setIn = MapPrototype.setIn;\n\t\tListPrototype.deleteIn = ListPrototype.removeIn = MapPrototype.removeIn;\n\t\tListPrototype.update = MapPrototype.update;\n\t\tListPrototype.updateIn = MapPrototype.updateIn;\n\t\tListPrototype.mergeIn = MapPrototype.mergeIn;\n\t\tListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n\t\tListPrototype.withMutations = MapPrototype.withMutations;\n\t\tListPrototype.asMutable = MapPrototype.asMutable;\n\t\tListPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tListPrototype.wasAltered = MapPrototype.wasAltered;\n\t\tvar VNode = function VNode(array, ownerID) {\n\t\t this.array = array;\n\t\t this.ownerID = ownerID;\n\t\t};\n\t\tvar $VNode = VNode;\n\t\t($traceurRuntime.createClass)(VNode, {\n\t\t removeBefore: function(ownerID, level, index) {\n\t\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t\t return this;\n\t\t }\n\t\t var originIndex = (index >>> level) & MASK;\n\t\t if (originIndex >= this.array.length) {\n\t\t return new $VNode([], ownerID);\n\t\t }\n\t\t var removingFirst = originIndex === 0;\n\t\t var newChild;\n\t\t if (level > 0) {\n\t\t var oldChild = this.array[originIndex];\n\t\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n\t\t if (newChild === oldChild && removingFirst) {\n\t\t return this;\n\t\t }\n\t\t }\n\t\t if (removingFirst && !newChild) {\n\t\t return this;\n\t\t }\n\t\t var editable = editableVNode(this, ownerID);\n\t\t if (!removingFirst) {\n\t\t for (var ii = 0; ii < originIndex; ii++) {\n\t\t editable.array[ii] = undefined;\n\t\t }\n\t\t }\n\t\t if (newChild) {\n\t\t editable.array[originIndex] = newChild;\n\t\t }\n\t\t return editable;\n\t\t },\n\t\t removeAfter: function(ownerID, level, index) {\n\t\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t\t return this;\n\t\t }\n\t\t var sizeIndex = ((index - 1) >>> level) & MASK;\n\t\t if (sizeIndex >= this.array.length) {\n\t\t return this;\n\t\t }\n\t\t var removingLast = sizeIndex === this.array.length - 1;\n\t\t var newChild;\n\t\t if (level > 0) {\n\t\t var oldChild = this.array[sizeIndex];\n\t\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n\t\t if (newChild === oldChild && removingLast) {\n\t\t return this;\n\t\t }\n\t\t }\n\t\t if (removingLast && !newChild) {\n\t\t return this;\n\t\t }\n\t\t var editable = editableVNode(this, ownerID);\n\t\t if (!removingLast) {\n\t\t editable.array.pop();\n\t\t }\n\t\t if (newChild) {\n\t\t editable.array[sizeIndex] = newChild;\n\t\t }\n\t\t return editable;\n\t\t }\n\t\t}, {});\n\t\tvar DONE = {};\n\t\tfunction iterateList(list, reverse) {\n\t\t var left = list._origin;\n\t\t var right = list._capacity;\n\t\t var tailPos = getTailOffset(right);\n\t\t var tail = list._tail;\n\t\t return iterateNodeOrLeaf(list._root, list._level, 0);\n\t\t function iterateNodeOrLeaf(node, level, offset) {\n\t\t return level === 0 ? iterateLeaf(node, offset) : iterateNode(node, level, offset);\n\t\t }\n\t\t function iterateLeaf(node, offset) {\n\t\t var array = offset === tailPos ? tail && tail.array : node && node.array;\n\t\t var from = offset > left ? 0 : left - offset;\n\t\t var to = right - offset;\n\t\t if (to > SIZE) {\n\t\t to = SIZE;\n\t\t }\n\t\t return (function() {\n\t\t if (from === to) {\n\t\t return DONE;\n\t\t }\n\t\t var idx = reverse ? --to : from++;\n\t\t return array && array[idx];\n\t\t });\n\t\t }\n\t\t function iterateNode(node, level, offset) {\n\t\t var values;\n\t\t var array = node && node.array;\n\t\t var from = offset > left ? 0 : (left - offset) >> level;\n\t\t var to = ((right - offset) >> level) + 1;\n\t\t if (to > SIZE) {\n\t\t to = SIZE;\n\t\t }\n\t\t return (function() {\n\t\t do {\n\t\t if (values) {\n\t\t var value = values();\n\t\t if (value !== DONE) {\n\t\t return value;\n\t\t }\n\t\t values = null;\n\t\t }\n\t\t if (from === to) {\n\t\t return DONE;\n\t\t }\n\t\t var idx = reverse ? --to : from++;\n\t\t values = iterateNodeOrLeaf(array && array[idx], level - SHIFT, offset + (idx << level));\n\t\t } while (true);\n\t\t });\n\t\t }\n\t\t}\n\t\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\n\t\t var list = Object.create(ListPrototype);\n\t\t list.size = capacity - origin;\n\t\t list._origin = origin;\n\t\t list._capacity = capacity;\n\t\t list._level = level;\n\t\t list._root = root;\n\t\t list._tail = tail;\n\t\t list.__ownerID = ownerID;\n\t\t list.__hash = hash;\n\t\t list.__altered = false;\n\t\t return list;\n\t\t}\n\t\tvar EMPTY_LIST;\n\t\tfunction emptyList() {\n\t\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n\t\t}\n\t\tfunction updateList(list, index, value) {\n\t\t index = wrapIndex(list, index);\n\t\t if (index >= list.size || index < 0) {\n\t\t return list.withMutations((function(list) {\n\t\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\n\t\t }));\n\t\t }\n\t\t index += list._origin;\n\t\t var newTail = list._tail;\n\t\t var newRoot = list._root;\n\t\t var didAlter = MakeRef(DID_ALTER);\n\t\t if (index >= getTailOffset(list._capacity)) {\n\t\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n\t\t } else {\n\t\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n\t\t }\n\t\t if (!didAlter.value) {\n\t\t return list;\n\t\t }\n\t\t if (list.__ownerID) {\n\t\t list._root = newRoot;\n\t\t list._tail = newTail;\n\t\t list.__hash = undefined;\n\t\t list.__altered = true;\n\t\t return list;\n\t\t }\n\t\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n\t\t}\n\t\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\n\t\t var idx = (index >>> level) & MASK;\n\t\t var nodeHas = node && idx < node.array.length;\n\t\t if (!nodeHas && value === undefined) {\n\t\t return node;\n\t\t }\n\t\t var newNode;\n\t\t if (level > 0) {\n\t\t var lowerNode = node && node.array[idx];\n\t\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n\t\t if (newLowerNode === lowerNode) {\n\t\t return node;\n\t\t }\n\t\t newNode = editableVNode(node, ownerID);\n\t\t newNode.array[idx] = newLowerNode;\n\t\t return newNode;\n\t\t }\n\t\t if (nodeHas && node.array[idx] === value) {\n\t\t return node;\n\t\t }\n\t\t SetRef(didAlter);\n\t\t newNode = editableVNode(node, ownerID);\n\t\t if (value === undefined && idx === newNode.array.length - 1) {\n\t\t newNode.array.pop();\n\t\t } else {\n\t\t newNode.array[idx] = value;\n\t\t }\n\t\t return newNode;\n\t\t}\n\t\tfunction editableVNode(node, ownerID) {\n\t\t if (ownerID && node && ownerID === node.ownerID) {\n\t\t return node;\n\t\t }\n\t\t return new VNode(node ? node.array.slice() : [], ownerID);\n\t\t}\n\t\tfunction listNodeFor(list, rawIndex) {\n\t\t if (rawIndex >= getTailOffset(list._capacity)) {\n\t\t return list._tail;\n\t\t }\n\t\t if (rawIndex < 1 << (list._level + SHIFT)) {\n\t\t var node = list._root;\n\t\t var level = list._level;\n\t\t while (node && level > 0) {\n\t\t node = node.array[(rawIndex >>> level) & MASK];\n\t\t level -= SHIFT;\n\t\t }\n\t\t return node;\n\t\t }\n\t\t}\n\t\tfunction setListBounds(list, begin, end) {\n\t\t var owner = list.__ownerID || new OwnerID();\n\t\t var oldOrigin = list._origin;\n\t\t var oldCapacity = list._capacity;\n\t\t var newOrigin = oldOrigin + begin;\n\t\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n\t\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n\t\t return list;\n\t\t }\n\t\t if (newOrigin >= newCapacity) {\n\t\t return list.clear();\n\t\t }\n\t\t var newLevel = list._level;\n\t\t var newRoot = list._root;\n\t\t var offsetShift = 0;\n\t\t while (newOrigin + offsetShift < 0) {\n\t\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n\t\t newLevel += SHIFT;\n\t\t offsetShift += 1 << newLevel;\n\t\t }\n\t\t if (offsetShift) {\n\t\t newOrigin += offsetShift;\n\t\t oldOrigin += offsetShift;\n\t\t newCapacity += offsetShift;\n\t\t oldCapacity += offsetShift;\n\t\t }\n\t\t var oldTailOffset = getTailOffset(oldCapacity);\n\t\t var newTailOffset = getTailOffset(newCapacity);\n\t\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n\t\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n\t\t newLevel += SHIFT;\n\t\t }\n\t\t var oldTail = list._tail;\n\t\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\t\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n\t\t newRoot = editableVNode(newRoot, owner);\n\t\t var node = newRoot;\n\t\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n\t\t var idx = (oldTailOffset >>> level) & MASK;\n\t\t node = node.array[idx] = editableVNode(node.array[idx], owner);\n\t\t }\n\t\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n\t\t }\n\t\t if (newCapacity < oldCapacity) {\n\t\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n\t\t }\n\t\t if (newOrigin >= newTailOffset) {\n\t\t newOrigin -= newTailOffset;\n\t\t newCapacity -= newTailOffset;\n\t\t newLevel = SHIFT;\n\t\t newRoot = null;\n\t\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\t\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n\t\t offsetShift = 0;\n\t\t while (newRoot) {\n\t\t var beginIndex = (newOrigin >>> newLevel) & MASK;\n\t\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n\t\t break;\n\t\t }\n\t\t if (beginIndex) {\n\t\t offsetShift += (1 << newLevel) * beginIndex;\n\t\t }\n\t\t newLevel -= SHIFT;\n\t\t newRoot = newRoot.array[beginIndex];\n\t\t }\n\t\t if (newRoot && newOrigin > oldOrigin) {\n\t\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n\t\t }\n\t\t if (newRoot && newTailOffset < oldTailOffset) {\n\t\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n\t\t }\n\t\t if (offsetShift) {\n\t\t newOrigin -= offsetShift;\n\t\t newCapacity -= offsetShift;\n\t\t }\n\t\t }\n\t\t if (list.__ownerID) {\n\t\t list.size = newCapacity - newOrigin;\n\t\t list._origin = newOrigin;\n\t\t list._capacity = newCapacity;\n\t\t list._level = newLevel;\n\t\t list._root = newRoot;\n\t\t list._tail = newTail;\n\t\t list.__hash = undefined;\n\t\t list.__altered = true;\n\t\t return list;\n\t\t }\n\t\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n\t\t}\n\t\tfunction mergeIntoListWith(list, merger, iterables) {\n\t\t var iters = [];\n\t\t var maxSize = 0;\n\t\t for (var ii = 0; ii < iterables.length; ii++) {\n\t\t var value = iterables[ii];\n\t\t var iter = IndexedIterable(value);\n\t\t if (iter.size > maxSize) {\n\t\t maxSize = iter.size;\n\t\t }\n\t\t if (!isIterable(value)) {\n\t\t iter = iter.map((function(v) {\n\t\t return fromJS(v);\n\t\t }));\n\t\t }\n\t\t iters.push(iter);\n\t\t }\n\t\t if (maxSize > list.size) {\n\t\t list = list.setSize(maxSize);\n\t\t }\n\t\t return mergeIntoCollectionWith(list, merger, iters);\n\t\t}\n\t\tfunction getTailOffset(size) {\n\t\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n\t\t}\n\t\tvar OrderedMap = function OrderedMap(value) {\n\t\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().withMutations((function(map) {\n\t\t var iter = KeyedIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v, k) {\n\t\t return map.set(k, v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(OrderedMap, {\n\t\t toString: function() {\n\t\t return this.__toString('OrderedMap {', '}');\n\t\t },\n\t\t get: function(k, notSetValue) {\n\t\t var index = this._map.get(k);\n\t\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = 0;\n\t\t this._map.clear();\n\t\t this._list.clear();\n\t\t return this;\n\t\t }\n\t\t return emptyOrderedMap();\n\t\t },\n\t\t set: function(k, v) {\n\t\t return updateOrderedMap(this, k, v);\n\t\t },\n\t\t remove: function(k) {\n\t\t return updateOrderedMap(this, k, NOT_SET);\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this._map.wasAltered() || this._list.wasAltered();\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._list.__iterate((function(entry) {\n\t\t return entry && fn(entry[1], entry[0], $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return this._list.fromEntrySeq().__iterator(type, reverse);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map.__ensureOwner(ownerID);\n\t\t var newList = this._list.__ensureOwner(ownerID);\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this._map = newMap;\n\t\t this._list = newList;\n\t\t return this;\n\t\t }\n\t\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n\t\t }\n\t\t}, {of: function() {\n\t\t return this(arguments);\n\t\t }}, Map);\n\t\tfunction isOrderedMap(maybeOrderedMap) {\n\t\t return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\n\t\t}\n\t\tOrderedMap.isOrderedMap = isOrderedMap;\n\t\tOrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\n\t\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\t\tfunction makeOrderedMap(map, list, ownerID, hash) {\n\t\t var omap = Object.create(OrderedMap.prototype);\n\t\t omap.size = map ? map.size : 0;\n\t\t omap._map = map;\n\t\t omap._list = list;\n\t\t omap.__ownerID = ownerID;\n\t\t omap.__hash = hash;\n\t\t return omap;\n\t\t}\n\t\tvar EMPTY_ORDERED_MAP;\n\t\tfunction emptyOrderedMap() {\n\t\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n\t\t}\n\t\tfunction updateOrderedMap(omap, k, v) {\n\t\t var map = omap._map;\n\t\t var list = omap._list;\n\t\t var i = map.get(k);\n\t\t var has = i !== undefined;\n\t\t var newMap;\n\t\t var newList;\n\t\t if (v === NOT_SET) {\n\t\t if (!has) {\n\t\t return omap;\n\t\t }\n\t\t if (list.size >= SIZE && list.size >= map.size * 2) {\n\t\t newList = list.filter((function(entry, idx) {\n\t\t return entry !== undefined && i !== idx;\n\t\t }));\n\t\t newMap = newList.toKeyedSeq().map((function(entry) {\n\t\t return entry[0];\n\t\t })).flip().toMap();\n\t\t if (omap.__ownerID) {\n\t\t newMap.__ownerID = newList.__ownerID = omap.__ownerID;\n\t\t }\n\t\t } else {\n\t\t newMap = map.remove(k);\n\t\t newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\n\t\t }\n\t\t } else {\n\t\t if (has) {\n\t\t if (v === list.get(i)[1]) {\n\t\t return omap;\n\t\t }\n\t\t newMap = map;\n\t\t newList = list.set(i, [k, v]);\n\t\t } else {\n\t\t newMap = map.set(k, list.size);\n\t\t newList = list.set(list.size, [k, v]);\n\t\t }\n\t\t }\n\t\t if (omap.__ownerID) {\n\t\t omap.size = newMap.size;\n\t\t omap._map = newMap;\n\t\t omap._list = newList;\n\t\t omap.__hash = undefined;\n\t\t return omap;\n\t\t }\n\t\t return makeOrderedMap(newMap, newList);\n\t\t}\n\t\tvar Stack = function Stack(value) {\n\t\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\n\t\t};\n\t\tvar $Stack = Stack;\n\t\t($traceurRuntime.createClass)(Stack, {\n\t\t toString: function() {\n\t\t return this.__toString('Stack [', ']');\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t var head = this._head;\n\t\t while (head && index--) {\n\t\t head = head.next;\n\t\t }\n\t\t return head ? head.value : notSetValue;\n\t\t },\n\t\t peek: function() {\n\t\t return this._head && this._head.value;\n\t\t },\n\t\t push: function() {\n\t\t if (arguments.length === 0) {\n\t\t return this;\n\t\t }\n\t\t var newSize = this.size + arguments.length;\n\t\t var head = this._head;\n\t\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\n\t\t head = {\n\t\t value: arguments[ii],\n\t\t next: head\n\t\t };\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = newSize;\n\t\t this._head = head;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return makeStack(newSize, head);\n\t\t },\n\t\t pushAll: function(iter) {\n\t\t iter = IndexedIterable(iter);\n\t\t if (iter.size === 0) {\n\t\t return this;\n\t\t }\n\t\t assertNotInfinite(iter.size);\n\t\t var newSize = this.size;\n\t\t var head = this._head;\n\t\t iter.reverse().forEach((function(value) {\n\t\t newSize++;\n\t\t head = {\n\t\t value: value,\n\t\t next: head\n\t\t };\n\t\t }));\n\t\t if (this.__ownerID) {\n\t\t this.size = newSize;\n\t\t this._head = head;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return makeStack(newSize, head);\n\t\t },\n\t\t pop: function() {\n\t\t return this.slice(1);\n\t\t },\n\t\t unshift: function() {\n\t\t return this.push.apply(this, arguments);\n\t\t },\n\t\t unshiftAll: function(iter) {\n\t\t return this.pushAll(iter);\n\t\t },\n\t\t shift: function() {\n\t\t return this.pop.apply(this, arguments);\n\t\t },\n\t\t clear: function() {\n\t\t if (this.size === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = 0;\n\t\t this._head = undefined;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return emptyStack();\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t if (wholeSlice(begin, end, this.size)) {\n\t\t return this;\n\t\t }\n\t\t var resolvedBegin = resolveBegin(begin, this.size);\n\t\t var resolvedEnd = resolveEnd(end, this.size);\n\t\t if (resolvedEnd !== this.size) {\n\t\t return $traceurRuntime.superCall(this, $Stack.prototype, \"slice\", [begin, end]);\n\t\t }\n\t\t var newSize = this.size - resolvedBegin;\n\t\t var head = this._head;\n\t\t while (resolvedBegin--) {\n\t\t head = head.next;\n\t\t }\n\t\t if (this.__ownerID) {\n\t\t this.size = newSize;\n\t\t this._head = head;\n\t\t this.__hash = undefined;\n\t\t this.__altered = true;\n\t\t return this;\n\t\t }\n\t\t return makeStack(newSize, head);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this.__altered = false;\n\t\t return this;\n\t\t }\n\t\t return makeStack(this.size, this._head, ownerID, this.__hash);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t if (reverse) {\n\t\t return this.toSeq().cacheResult.__iterate(fn, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t var node = this._head;\n\t\t while (node) {\n\t\t if (fn(node.value, iterations++, this) === false) {\n\t\t break;\n\t\t }\n\t\t node = node.next;\n\t\t }\n\t\t return iterations;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t if (reverse) {\n\t\t return this.toSeq().cacheResult().__iterator(type, reverse);\n\t\t }\n\t\t var iterations = 0;\n\t\t var node = this._head;\n\t\t return new Iterator((function() {\n\t\t if (node) {\n\t\t var value = node.value;\n\t\t node = node.next;\n\t\t return iteratorValue(type, iterations++, value);\n\t\t }\n\t\t return iteratorDone();\n\t\t }));\n\t\t }\n\t\t}, {of: function() {\n\t\t return this(arguments);\n\t\t }}, IndexedCollection);\n\t\tfunction isStack(maybeStack) {\n\t\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n\t\t}\n\t\tStack.isStack = isStack;\n\t\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\t\tvar StackPrototype = Stack.prototype;\n\t\tStackPrototype[IS_STACK_SENTINEL] = true;\n\t\tStackPrototype.withMutations = MapPrototype.withMutations;\n\t\tStackPrototype.asMutable = MapPrototype.asMutable;\n\t\tStackPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tStackPrototype.wasAltered = MapPrototype.wasAltered;\n\t\tfunction makeStack(size, head, ownerID, hash) {\n\t\t var map = Object.create(StackPrototype);\n\t\t map.size = size;\n\t\t map._head = head;\n\t\t map.__ownerID = ownerID;\n\t\t map.__hash = hash;\n\t\t map.__altered = false;\n\t\t return map;\n\t\t}\n\t\tvar EMPTY_STACK;\n\t\tfunction emptyStack() {\n\t\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n\t\t}\n\t\tvar Set = function Set(value) {\n\t\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().withMutations((function(set) {\n\t\t var iter = SetIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v) {\n\t\t return set.add(v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(Set, {\n\t\t toString: function() {\n\t\t return this.__toString('Set {', '}');\n\t\t },\n\t\t has: function(value) {\n\t\t return this._map.has(value);\n\t\t },\n\t\t add: function(value) {\n\t\t return updateSet(this, this._map.set(value, true));\n\t\t },\n\t\t remove: function(value) {\n\t\t return updateSet(this, this._map.remove(value));\n\t\t },\n\t\t clear: function() {\n\t\t return updateSet(this, this._map.clear());\n\t\t },\n\t\t union: function() {\n\t\t for (var iters = [],\n\t\t $__9 = 0; $__9 < arguments.length; $__9++)\n\t\t iters[$__9] = arguments[$__9];\n\t\t iters = iters.filter((function(x) {\n\t\t return x.size !== 0;\n\t\t }));\n\t\t if (iters.length === 0) {\n\t\t return this;\n\t\t }\n\t\t if (this.size === 0 && iters.length === 1) {\n\t\t return this.constructor(iters[0]);\n\t\t }\n\t\t return this.withMutations((function(set) {\n\t\t for (var ii = 0; ii < iters.length; ii++) {\n\t\t SetIterable(iters[ii]).forEach((function(value) {\n\t\t return set.add(value);\n\t\t }));\n\t\t }\n\t\t }));\n\t\t },\n\t\t intersect: function() {\n\t\t for (var iters = [],\n\t\t $__10 = 0; $__10 < arguments.length; $__10++)\n\t\t iters[$__10] = arguments[$__10];\n\t\t if (iters.length === 0) {\n\t\t return this;\n\t\t }\n\t\t iters = iters.map((function(iter) {\n\t\t return SetIterable(iter);\n\t\t }));\n\t\t var originalSet = this;\n\t\t return this.withMutations((function(set) {\n\t\t originalSet.forEach((function(value) {\n\t\t if (!iters.every((function(iter) {\n\t\t return iter.contains(value);\n\t\t }))) {\n\t\t set.remove(value);\n\t\t }\n\t\t }));\n\t\t }));\n\t\t },\n\t\t subtract: function() {\n\t\t for (var iters = [],\n\t\t $__11 = 0; $__11 < arguments.length; $__11++)\n\t\t iters[$__11] = arguments[$__11];\n\t\t if (iters.length === 0) {\n\t\t return this;\n\t\t }\n\t\t iters = iters.map((function(iter) {\n\t\t return SetIterable(iter);\n\t\t }));\n\t\t var originalSet = this;\n\t\t return this.withMutations((function(set) {\n\t\t originalSet.forEach((function(value) {\n\t\t if (iters.some((function(iter) {\n\t\t return iter.contains(value);\n\t\t }))) {\n\t\t set.remove(value);\n\t\t }\n\t\t }));\n\t\t }));\n\t\t },\n\t\t merge: function() {\n\t\t return this.union.apply(this, arguments);\n\t\t },\n\t\t mergeWith: function(merger) {\n\t\t for (var iters = [],\n\t\t $__12 = 1; $__12 < arguments.length; $__12++)\n\t\t iters[$__12 - 1] = arguments[$__12];\n\t\t return this.union.apply(this, iters);\n\t\t },\n\t\t sort: function(comparator) {\n\t\t return OrderedSet(sortFactory(this, comparator));\n\t\t },\n\t\t sortBy: function(mapper, comparator) {\n\t\t return OrderedSet(sortFactory(this, comparator, mapper));\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this._map.wasAltered();\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return this._map.__iterate((function(_, k) {\n\t\t return fn(k, k, $__0);\n\t\t }), reverse);\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t return this._map.map((function(_, k) {\n\t\t return k;\n\t\t })).__iterator(type, reverse);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map.__ensureOwner(ownerID);\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this._map = newMap;\n\t\t return this;\n\t\t }\n\t\t return this.__make(newMap, ownerID);\n\t\t }\n\t\t}, {\n\t\t of: function() {\n\t\t return this(arguments);\n\t\t },\n\t\t fromKeys: function(value) {\n\t\t return this(KeyedIterable(value).keySeq());\n\t\t }\n\t\t}, SetCollection);\n\t\tfunction isSet(maybeSet) {\n\t\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n\t\t}\n\t\tSet.isSet = isSet;\n\t\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\t\tvar SetPrototype = Set.prototype;\n\t\tSetPrototype[IS_SET_SENTINEL] = true;\n\t\tSetPrototype[DELETE] = SetPrototype.remove;\n\t\tSetPrototype.mergeDeep = SetPrototype.merge;\n\t\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n\t\tSetPrototype.withMutations = MapPrototype.withMutations;\n\t\tSetPrototype.asMutable = MapPrototype.asMutable;\n\t\tSetPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tSetPrototype.__empty = emptySet;\n\t\tSetPrototype.__make = makeSet;\n\t\tfunction updateSet(set, newMap) {\n\t\t if (set.__ownerID) {\n\t\t set.size = newMap.size;\n\t\t set._map = newMap;\n\t\t return set;\n\t\t }\n\t\t return newMap === set._map ? set : newMap.size === 0 ? set.__empty() : set.__make(newMap);\n\t\t}\n\t\tfunction makeSet(map, ownerID) {\n\t\t var set = Object.create(SetPrototype);\n\t\t set.size = map ? map.size : 0;\n\t\t set._map = map;\n\t\t set.__ownerID = ownerID;\n\t\t return set;\n\t\t}\n\t\tvar EMPTY_SET;\n\t\tfunction emptySet() {\n\t\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n\t\t}\n\t\tvar OrderedSet = function OrderedSet(value) {\n\t\t return value === null || value === undefined ? emptyOrderedSet() : isOrderedSet(value) ? value : emptyOrderedSet().withMutations((function(set) {\n\t\t var iter = SetIterable(value);\n\t\t assertNotInfinite(iter.size);\n\t\t iter.forEach((function(v) {\n\t\t return set.add(v);\n\t\t }));\n\t\t }));\n\t\t};\n\t\t($traceurRuntime.createClass)(OrderedSet, {toString: function() {\n\t\t return this.__toString('OrderedSet {', '}');\n\t\t }}, {\n\t\t of: function() {\n\t\t return this(arguments);\n\t\t },\n\t\t fromKeys: function(value) {\n\t\t return this(KeyedIterable(value).keySeq());\n\t\t }\n\t\t}, Set);\n\t\tfunction isOrderedSet(maybeOrderedSet) {\n\t\t return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\n\t\t}\n\t\tOrderedSet.isOrderedSet = isOrderedSet;\n\t\tvar OrderedSetPrototype = OrderedSet.prototype;\n\t\tOrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\n\t\tOrderedSetPrototype.__empty = emptyOrderedSet;\n\t\tOrderedSetPrototype.__make = makeOrderedSet;\n\t\tfunction makeOrderedSet(map, ownerID) {\n\t\t var set = Object.create(OrderedSetPrototype);\n\t\t set.size = map ? map.size : 0;\n\t\t set._map = map;\n\t\t set.__ownerID = ownerID;\n\t\t return set;\n\t\t}\n\t\tvar EMPTY_ORDERED_SET;\n\t\tfunction emptyOrderedSet() {\n\t\t return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\n\t\t}\n\t\tvar Record = function Record(defaultValues, name) {\n\t\t var RecordType = function Record(values) {\n\t\t if (!(this instanceof RecordType)) {\n\t\t return new RecordType(values);\n\t\t }\n\t\t this._map = Map(values);\n\t\t };\n\t\t var keys = Object.keys(defaultValues);\n\t\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n\t\t RecordTypePrototype.constructor = RecordType;\n\t\t name && (RecordTypePrototype._name = name);\n\t\t RecordTypePrototype._defaultValues = defaultValues;\n\t\t RecordTypePrototype._keys = keys;\n\t\t RecordTypePrototype.size = keys.length;\n\t\t try {\n\t\t keys.forEach((function(key) {\n\t\t Object.defineProperty(RecordType.prototype, key, {\n\t\t get: function() {\n\t\t return this.get(key);\n\t\t },\n\t\t set: function(value) {\n\t\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\n\t\t this.set(key, value);\n\t\t }\n\t\t });\n\t\t }));\n\t\t } catch (error) {}\n\t\t return RecordType;\n\t\t};\n\t\t($traceurRuntime.createClass)(Record, {\n\t\t toString: function() {\n\t\t return this.__toString(recordName(this) + ' {', '}');\n\t\t },\n\t\t has: function(k) {\n\t\t return this._defaultValues.hasOwnProperty(k);\n\t\t },\n\t\t get: function(k, notSetValue) {\n\t\t if (!this.has(k)) {\n\t\t return notSetValue;\n\t\t }\n\t\t var defaultVal = this._defaultValues[k];\n\t\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\n\t\t },\n\t\t clear: function() {\n\t\t if (this.__ownerID) {\n\t\t this._map && this._map.clear();\n\t\t return this;\n\t\t }\n\t\t var SuperRecord = Object.getPrototypeOf(this).constructor;\n\t\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\n\t\t },\n\t\t set: function(k, v) {\n\t\t if (!this.has(k)) {\n\t\t throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n\t\t }\n\t\t var newMap = this._map && this._map.set(k, v);\n\t\t if (this.__ownerID || newMap === this._map) {\n\t\t return this;\n\t\t }\n\t\t return makeRecord(this, newMap);\n\t\t },\n\t\t remove: function(k) {\n\t\t if (!this.has(k)) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map && this._map.remove(k);\n\t\t if (this.__ownerID || newMap === this._map) {\n\t\t return this;\n\t\t }\n\t\t return makeRecord(this, newMap);\n\t\t },\n\t\t wasAltered: function() {\n\t\t return this._map.wasAltered();\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var $__0 = this;\n\t\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t\t return $__0.get(k);\n\t\t })).__iterator(type, reverse);\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var $__0 = this;\n\t\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t\t return $__0.get(k);\n\t\t })).__iterate(fn, reverse);\n\t\t },\n\t\t __ensureOwner: function(ownerID) {\n\t\t if (ownerID === this.__ownerID) {\n\t\t return this;\n\t\t }\n\t\t var newMap = this._map && this._map.__ensureOwner(ownerID);\n\t\t if (!ownerID) {\n\t\t this.__ownerID = ownerID;\n\t\t this._map = newMap;\n\t\t return this;\n\t\t }\n\t\t return makeRecord(this, newMap, ownerID);\n\t\t }\n\t\t}, {}, KeyedCollection);\n\t\tvar RecordPrototype = Record.prototype;\n\t\tRecordPrototype[DELETE] = RecordPrototype.remove;\n\t\tRecordPrototype.deleteIn = RecordPrototype.removeIn = MapPrototype.removeIn;\n\t\tRecordPrototype.merge = MapPrototype.merge;\n\t\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\n\t\tRecordPrototype.mergeIn = MapPrototype.mergeIn;\n\t\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n\t\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n\t\tRecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n\t\tRecordPrototype.setIn = MapPrototype.setIn;\n\t\tRecordPrototype.update = MapPrototype.update;\n\t\tRecordPrototype.updateIn = MapPrototype.updateIn;\n\t\tRecordPrototype.withMutations = MapPrototype.withMutations;\n\t\tRecordPrototype.asMutable = MapPrototype.asMutable;\n\t\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\n\t\tfunction makeRecord(likeRecord, map, ownerID) {\n\t\t var record = Object.create(Object.getPrototypeOf(likeRecord));\n\t\t record._map = map;\n\t\t record.__ownerID = ownerID;\n\t\t return record;\n\t\t}\n\t\tfunction recordName(record) {\n\t\t return record._name || record.constructor.name;\n\t\t}\n\t\tvar Range = function Range(start, end, step) {\n\t\t if (!(this instanceof $Range)) {\n\t\t return new $Range(start, end, step);\n\t\t }\n\t\t invariant(step !== 0, 'Cannot step a Range by 0');\n\t\t start = start || 0;\n\t\t if (end === undefined) {\n\t\t end = Infinity;\n\t\t }\n\t\t if (start === end && __EMPTY_RANGE) {\n\t\t return __EMPTY_RANGE;\n\t\t }\n\t\t step = step === undefined ? 1 : Math.abs(step);\n\t\t if (end < start) {\n\t\t step = -step;\n\t\t }\n\t\t this._start = start;\n\t\t this._end = end;\n\t\t this._step = step;\n\t\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n\t\t};\n\t\tvar $Range = Range;\n\t\t($traceurRuntime.createClass)(Range, {\n\t\t toString: function() {\n\t\t if (this.size === 0) {\n\t\t return 'Range []';\n\t\t }\n\t\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\n\t\t },\n\t\t contains: function(searchValue) {\n\t\t var possibleIndex = (searchValue - this._start) / this._step;\n\t\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t if (wholeSlice(begin, end, this.size)) {\n\t\t return this;\n\t\t }\n\t\t begin = resolveBegin(begin, this.size);\n\t\t end = resolveEnd(end, this.size);\n\t\t if (end <= begin) {\n\t\t return __EMPTY_RANGE;\n\t\t }\n\t\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n\t\t },\n\t\t indexOf: function(searchValue) {\n\t\t var offsetValue = searchValue - this._start;\n\t\t if (offsetValue % this._step === 0) {\n\t\t var index = offsetValue / this._step;\n\t\t if (index >= 0 && index < this.size) {\n\t\t return index;\n\t\t }\n\t\t }\n\t\t return -1;\n\t\t },\n\t\t lastIndexOf: function(searchValue) {\n\t\t return this.indexOf(searchValue);\n\t\t },\n\t\t take: function(amount) {\n\t\t return this.slice(0, Math.max(0, amount));\n\t\t },\n\t\t skip: function(amount) {\n\t\t return this.slice(Math.max(0, amount));\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t var maxIndex = this.size - 1;\n\t\t var step = this._step;\n\t\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t\t if (fn(value, ii, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t value += reverse ? -step : step;\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var maxIndex = this.size - 1;\n\t\t var step = this._step;\n\t\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t var v = value;\n\t\t value += reverse ? -step : step;\n\t\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n\t\t }));\n\t\t },\n\t\t equals: function(other) {\n\t\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : deepEqual(this, other);\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar RangePrototype = Range.prototype;\n\t\tRangePrototype.__toJS = RangePrototype.toArray;\n\t\tRangePrototype.first = ListPrototype.first;\n\t\tRangePrototype.last = ListPrototype.last;\n\t\tvar __EMPTY_RANGE = Range(0, 0);\n\t\tvar Repeat = function Repeat(value, times) {\n\t\t if (times <= 0 && EMPTY_REPEAT) {\n\t\t return EMPTY_REPEAT;\n\t\t }\n\t\t if (!(this instanceof $Repeat)) {\n\t\t return new $Repeat(value, times);\n\t\t }\n\t\t this._value = value;\n\t\t this.size = times === undefined ? Infinity : Math.max(0, times);\n\t\t if (this.size === 0) {\n\t\t EMPTY_REPEAT = this;\n\t\t }\n\t\t};\n\t\tvar $Repeat = Repeat;\n\t\t($traceurRuntime.createClass)(Repeat, {\n\t\t toString: function() {\n\t\t if (this.size === 0) {\n\t\t return 'Repeat []';\n\t\t }\n\t\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n\t\t },\n\t\t get: function(index, notSetValue) {\n\t\t return this.has(index) ? this._value : notSetValue;\n\t\t },\n\t\t contains: function(searchValue) {\n\t\t return is(this._value, searchValue);\n\t\t },\n\t\t slice: function(begin, end) {\n\t\t var size = this.size;\n\t\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n\t\t },\n\t\t reverse: function() {\n\t\t return this;\n\t\t },\n\t\t indexOf: function(searchValue) {\n\t\t if (is(this._value, searchValue)) {\n\t\t return 0;\n\t\t }\n\t\t return -1;\n\t\t },\n\t\t lastIndexOf: function(searchValue) {\n\t\t if (is(this._value, searchValue)) {\n\t\t return this.size;\n\t\t }\n\t\t return -1;\n\t\t },\n\t\t __iterate: function(fn, reverse) {\n\t\t for (var ii = 0; ii < this.size; ii++) {\n\t\t if (fn(this._value, ii, this) === false) {\n\t\t return ii + 1;\n\t\t }\n\t\t }\n\t\t return ii;\n\t\t },\n\t\t __iterator: function(type, reverse) {\n\t\t var $__0 = this;\n\t\t var ii = 0;\n\t\t return new Iterator((function() {\n\t\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\n\t\t }));\n\t\t },\n\t\t equals: function(other) {\n\t\t return other instanceof $Repeat ? is(this._value, other._value) : deepEqual(other);\n\t\t }\n\t\t}, {}, IndexedSeq);\n\t\tvar RepeatPrototype = Repeat.prototype;\n\t\tRepeatPrototype.last = RepeatPrototype.first;\n\t\tRepeatPrototype.has = RangePrototype.has;\n\t\tRepeatPrototype.take = RangePrototype.take;\n\t\tRepeatPrototype.skip = RangePrototype.skip;\n\t\tRepeatPrototype.__toJS = RangePrototype.__toJS;\n\t\tvar EMPTY_REPEAT;\n\t\tvar Immutable = {\n\t\t Iterable: Iterable,\n\t\t Seq: Seq,\n\t\t Collection: Collection,\n\t\t Map: Map,\n\t\t OrderedMap: OrderedMap,\n\t\t List: List,\n\t\t Stack: Stack,\n\t\t Set: Set,\n\t\t OrderedSet: OrderedSet,\n\t\t Record: Record,\n\t\t Range: Range,\n\t\t Repeat: Repeat,\n\t\t is: is,\n\t\t fromJS: fromJS\n\t\t};\n\n\t\t return Immutable;\n\t\t}","function Module(stdlib, imports, buffer) {\n \"use asm\";\n\n function f() {\n return 281474976710655 * 1048575 | 0;\n }\n\n return {\n f: f\n };\n}","function v7(v8,v9) {\n const v10 = gc;\n // v10 = .function([] => .undefined)\n let v13 = 0;\n const v16 = [13.37,13.37,13.37,13.37];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = [1337,1337,1337,1337];\n // v18 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v19 = [3697200800,v16,v18];\n // v19 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v20 = v6[0];\n // v20 = .unknown\n const v21 = Symbol;\n // v21 = .object(ofGroup: SymbolConstructor, withProperties: [\"match\", \"asyncIterator\", \"search\", \"iterator\", \"replace\", \"isConcatSpreadable\", \"toStringTag\", \"split\", \"toPrimitive\", \"matchAll\", \"hasInstance\", \"unscopable\", \"species\"], withMethods: [\"for\", \"keyFor\"]) + .function([.string] => .object(ofGroup: Symbol, withProperties: [\"__proto__\", \"description\"]))\n for (let v25 = 0; v25 < 4; v25 = v25 + 1) {\n }\n function v27(v28,v29) {\n }\n do {\n const v31 = [13.37,13.37,13.37,13.37];\n // v31 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v34 = [1337,1337,Function,1337];\n // v34 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v35 = {__proto__:v34,a:v31,c:1337,d:Function,e:v34,toString:Function};\n // v35 = .object(ofGroup: Object, withProperties: [\"a\", \"__proto__\", \"toString\", \"d\", \"c\", \"e\"])\n let v39 = 0;\n while (v39 < 1337) {\n const v40 = v39 + 1;\n // v40 = .primitive\n v39 = v40;\n }\n const v41 = [13.37,13.37,13.37,13.37];\n // v41 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v43 = [1337,1337,1337,1337];\n // v43 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v44 = [3697200800,v41,v43];\n // v44 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v45 = v13 + 1;\n // v45 = .primitive\n function v48(v49,v50) {\n return v44;\n }\n const v51 = [1337,1337,1337,1337];\n // v51 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n for (let v54 = 0; v54 < 100; v54 = v54 + 100) {\n }\n const v55 = {__proto__:v51,a:1337,c:1337,d:Function,e:v51,toString:Function};\n // v55 = .object(ofGroup: Object, withProperties: [\"e\", \"c\", \"__proto__\", \"toString\", \"d\", \"a\"])\n const v56 = v48(1337,v41,...v55);\n // v56 = .unknown\n v13 = v45;\n } while (v13 < 7);\n return v3;\n}","function e(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function universalModule() {\n\t var $Object = Object;\n\n\tfunction createClass(ctor, methods, staticMethods, superClass) {\n\t var proto;\n\t if (superClass) {\n\t var superProto = superClass.prototype;\n\t proto = $Object.create(superProto);\n\t } else {\n\t proto = ctor.prototype;\n\t }\n\t $Object.keys(methods).forEach(function (key) {\n\t proto[key] = methods[key];\n\t });\n\t $Object.keys(staticMethods).forEach(function (key) {\n\t ctor[key] = staticMethods[key];\n\t });\n\t proto.constructor = ctor;\n\t ctor.prototype = proto;\n\t return ctor;\n\t}\n\n\tfunction superCall(self, proto, name, args) {\n\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\n\t}\n\n\tfunction defaultSuperCall(self, proto, args) {\n\t superCall(self, proto, 'constructor', args);\n\t}\n\n\tvar $traceurRuntime = {};\n\t$traceurRuntime.createClass = createClass;\n\t$traceurRuntime.superCall = superCall;\n\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\n\t\"use strict\";\n\tfunction is(first, second) {\n\t if (first === second) {\n\t return first !== 0 || second !== 0 || 1 / first === 1 / second;\n\t }\n\t if (first !== first) {\n\t return second !== second;\n\t }\n\t if (first && typeof first.equals === 'function') {\n\t return first.equals(second);\n\t }\n\t return false;\n\t}\n\tfunction invariant(condition, error) {\n\t if (!condition)\n\t throw new Error(error);\n\t}\n\tvar DELETE = 'delete';\n\tvar SHIFT = 5;\n\tvar SIZE = 1 << SHIFT;\n\tvar MASK = SIZE - 1;\n\tvar NOT_SET = {};\n\tvar CHANGE_LENGTH = {value: false};\n\tvar DID_ALTER = {value: false};\n\tfunction MakeRef(ref) {\n\t ref.value = false;\n\t return ref;\n\t}\n\tfunction SetRef(ref) {\n\t ref && (ref.value = true);\n\t}\n\tfunction OwnerID() {}\n\tfunction arrCopy(arr, offset) {\n\t offset = offset || 0;\n\t var len = Math.max(0, arr.length - offset);\n\t var newArr = new Array(len);\n\t for (var ii = 0; ii < len; ii++) {\n\t newArr[ii] = arr[ii + offset];\n\t }\n\t return newArr;\n\t}\n\tfunction assertNotInfinite(size) {\n\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\n\t}\n\tfunction ensureSize(iter) {\n\t if (iter.size === undefined) {\n\t iter.size = iter.__iterate(returnTrue);\n\t }\n\t return iter.size;\n\t}\n\tfunction wrapIndex(iter, index) {\n\t return index >= 0 ? index : ensureSize(iter) + index;\n\t}\n\tfunction returnTrue() {\n\t return true;\n\t}\n\tfunction wholeSlice(begin, end, size) {\n\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\n\t}\n\tfunction resolveBegin(begin, size) {\n\t return resolveIndex(begin, size, 0);\n\t}\n\tfunction resolveEnd(end, size) {\n\t return resolveIndex(end, size, size);\n\t}\n\tfunction resolveIndex(index, size, defaultIndex) {\n\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\n\t}\n\tfunction hash(o) {\n\t if (!o) {\n\t return 0;\n\t }\n\t if (o === true) {\n\t return 1;\n\t }\n\t var type = typeof o;\n\t if (type === 'number') {\n\t if ((o | 0) === o) {\n\t return o & HASH_MAX_VAL;\n\t }\n\t o = '' + o;\n\t type = 'string';\n\t }\n\t if (type === 'string') {\n\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n\t }\n\t if (o.hashCode) {\n\t return hash(typeof o.hashCode === 'function' ? o.hashCode() : o.hashCode);\n\t }\n\t return hashJSObj(o);\n\t}\n\tfunction cachedHashString(string) {\n\t var hash = stringHashCache[string];\n\t if (hash === undefined) {\n\t hash = hashString(string);\n\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n\t STRING_HASH_CACHE_SIZE = 0;\n\t stringHashCache = {};\n\t }\n\t STRING_HASH_CACHE_SIZE++;\n\t stringHashCache[string] = hash;\n\t }\n\t return hash;\n\t}\n\tfunction hashString(string) {\n\t var hash = 0;\n\t for (var ii = 0; ii < string.length; ii++) {\n\t hash = (31 * hash + string.charCodeAt(ii)) & HASH_MAX_VAL;\n\t }\n\t return hash;\n\t}\n\tfunction hashJSObj(obj) {\n\t var hash = weakMap && weakMap.get(obj);\n\t if (hash)\n\t return hash;\n\t hash = obj[UID_HASH_KEY];\n\t if (hash)\n\t return hash;\n\t if (!canDefineProperty) {\n\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n\t if (hash)\n\t return hash;\n\t hash = getIENodeHash(obj);\n\t if (hash)\n\t return hash;\n\t }\n\t if (Object.isExtensible && !Object.isExtensible(obj)) {\n\t throw new Error('Non-extensible objects are not allowed as keys.');\n\t }\n\t hash = ++objHashUID & HASH_MAX_VAL;\n\t if (weakMap) {\n\t weakMap.set(obj, hash);\n\t } else if (canDefineProperty) {\n\t Object.defineProperty(obj, UID_HASH_KEY, {\n\t 'enumerable': false,\n\t 'configurable': false,\n\t 'writable': false,\n\t 'value': hash\n\t });\n\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n\t obj.propertyIsEnumerable = function() {\n\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n\t };\n\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n\t } else if (obj.nodeType) {\n\t obj[UID_HASH_KEY] = hash;\n\t } else {\n\t throw new Error('Unable to set a non-enumerable property on object.');\n\t }\n\t return hash;\n\t}\n\tvar canDefineProperty = (function() {\n\t try {\n\t Object.defineProperty({}, 'x', {});\n\t return true;\n\t } catch (e) {\n\t return false;\n\t }\n\t}());\n\tfunction getIENodeHash(node) {\n\t if (node && node.nodeType > 0) {\n\t switch (node.nodeType) {\n\t case 1:\n\t return node.uniqueID;\n\t case 9:\n\t return node.documentElement && node.documentElement.uniqueID;\n\t }\n\t }\n\t}\n\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\n\tvar HASH_MAX_VAL = 0x7FFFFFFF;\n\tvar objHashUID = 0;\n\tvar UID_HASH_KEY = '__immutablehash__';\n\tif (typeof Symbol === 'function') {\n\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\n\t}\n\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\n\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\n\tvar STRING_HASH_CACHE_SIZE = 0;\n\tvar stringHashCache = {};\n\tvar ITERATE_KEYS = 0;\n\tvar ITERATE_VALUES = 1;\n\tvar ITERATE_ENTRIES = 2;\n\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\n\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\tvar Iterator = function Iterator(next) {\n\t this.next = next;\n\t};\n\t($traceurRuntime.createClass)(Iterator, {toString: function() {\n\t return '[Iterator]';\n\t }}, {});\n\tIterator.KEYS = ITERATE_KEYS;\n\tIterator.VALUES = ITERATE_VALUES;\n\tIterator.ENTRIES = ITERATE_ENTRIES;\n\tvar IteratorPrototype = Iterator.prototype;\n\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\n\t return this.toString();\n\t};\n\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\n\t return this;\n\t};\n\tfunction iteratorValue(type, k, v, iteratorResult) {\n\t var value = type === 0 ? k : type === 1 ? v : [k, v];\n\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n\t value: value,\n\t done: false\n\t });\n\t return iteratorResult;\n\t}\n\tfunction iteratorDone() {\n\t return {\n\t value: undefined,\n\t done: true\n\t };\n\t}\n\tfunction hasIterator(maybeIterable) {\n\t return !!_iteratorFn(maybeIterable);\n\t}\n\tfunction isIterator(maybeIterator) {\n\t return maybeIterator && typeof maybeIterator.next === 'function';\n\t}\n\tfunction getIterator(iterable) {\n\t var iteratorFn = _iteratorFn(iterable);\n\t return iteratorFn && iteratorFn.call(iterable);\n\t}\n\tfunction _iteratorFn(iterable) {\n\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\n\t if (typeof iteratorFn === 'function') {\n\t return iteratorFn;\n\t }\n\t}\n\tvar Iterable = function Iterable(value) {\n\t return isIterable(value) ? value : Seq(value);\n\t};\n\tvar $Iterable = Iterable;\n\t($traceurRuntime.createClass)(Iterable, {\n\t toArray: function() {\n\t assertNotInfinite(this.size);\n\t var array = new Array(this.size || 0);\n\t this.valueSeq().__iterate((function(v, i) {\n\t array[i] = v;\n\t }));\n\t return array;\n\t },\n\t toIndexedSeq: function() {\n\t return new ToIndexedSequence(this);\n\t },\n\t toJS: function() {\n\t return this.toSeq().map((function(value) {\n\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\n\t })).__toJS();\n\t },\n\t toKeyedSeq: function() {\n\t return new ToKeyedSequence(this, true);\n\t },\n\t toMap: function() {\n\t assertNotInfinite(this.size);\n\t return Map(this.toKeyedSeq());\n\t },\n\t toObject: function() {\n\t assertNotInfinite(this.size);\n\t var object = {};\n\t this.__iterate((function(v, k) {\n\t object[k] = v;\n\t }));\n\t return object;\n\t },\n\t toOrderedMap: function() {\n\t assertNotInfinite(this.size);\n\t return OrderedMap(this.toKeyedSeq());\n\t },\n\t toSet: function() {\n\t assertNotInfinite(this.size);\n\t return Set(isKeyed(this) ? this.valueSeq() : this);\n\t },\n\t toSetSeq: function() {\n\t return new ToSetSequence(this);\n\t },\n\t toSeq: function() {\n\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\n\t },\n\t toStack: function() {\n\t assertNotInfinite(this.size);\n\t return Stack(isKeyed(this) ? this.valueSeq() : this);\n\t },\n\t toList: function() {\n\t assertNotInfinite(this.size);\n\t return List(isKeyed(this) ? this.valueSeq() : this);\n\t },\n\t toString: function() {\n\t return '[Iterable]';\n\t },\n\t __toString: function(head, tail) {\n\t if (this.size === 0) {\n\t return head + tail;\n\t }\n\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n\t },\n\t concat: function() {\n\t for (var values = [],\n\t $__2 = 0; $__2 < arguments.length; $__2++)\n\t values[$__2] = arguments[$__2];\n\t return reify(this, concatFactory(this, values));\n\t },\n\t contains: function(searchValue) {\n\t return this.some((function(value) {\n\t return is(value, searchValue);\n\t }));\n\t },\n\t entries: function() {\n\t return this.__iterator(ITERATE_ENTRIES);\n\t },\n\t every: function(predicate, context) {\n\t var returnValue = true;\n\t this.__iterate((function(v, k, c) {\n\t if (!predicate.call(context, v, k, c)) {\n\t returnValue = false;\n\t return false;\n\t }\n\t }));\n\t return returnValue;\n\t },\n\t filter: function(predicate, context) {\n\t return reify(this, filterFactory(this, predicate, context, true));\n\t },\n\t find: function(predicate, context, notSetValue) {\n\t var foundValue = notSetValue;\n\t this.__iterate((function(v, k, c) {\n\t if (predicate.call(context, v, k, c)) {\n\t foundValue = v;\n\t return false;\n\t }\n\t }));\n\t return foundValue;\n\t },\n\t forEach: function(sideEffect, context) {\n\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n\t },\n\t join: function(separator) {\n\t separator = separator !== undefined ? '' + separator : ',';\n\t var joined = '';\n\t var isFirst = true;\n\t this.__iterate((function(v) {\n\t isFirst ? (isFirst = false) : (joined += separator);\n\t joined += v !== null && v !== undefined ? v : '';\n\t }));\n\t return joined;\n\t },\n\t keys: function() {\n\t return this.__iterator(ITERATE_KEYS);\n\t },\n\t map: function(mapper, context) {\n\t return reify(this, mapFactory(this, mapper, context));\n\t },\n\t reduce: function(reducer, initialReduction, context) {\n\t var reduction;\n\t var useFirst;\n\t if (arguments.length < 2) {\n\t useFirst = true;\n\t } else {\n\t reduction = initialReduction;\n\t }\n\t this.__iterate((function(v, k, c) {\n\t if (useFirst) {\n\t useFirst = false;\n\t reduction = v;\n\t } else {\n\t reduction = reducer.call(context, reduction, v, k, c);\n\t }\n\t }));\n\t return reduction;\n\t },\n\t reduceRight: function(reducer, initialReduction, context) {\n\t var reversed = this.toKeyedSeq().reverse();\n\t return reversed.reduce.apply(reversed, arguments);\n\t },\n\t reverse: function() {\n\t return reify(this, reverseFactory(this, true));\n\t },\n\t slice: function(begin, end) {\n\t if (wholeSlice(begin, end, this.size)) {\n\t return this;\n\t }\n\t var resolvedBegin = resolveBegin(begin, this.size);\n\t var resolvedEnd = resolveEnd(end, this.size);\n\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n\t return this.toSeq().cacheResult().slice(begin, end);\n\t }\n\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\n\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\n\t },\n\t some: function(predicate, context) {\n\t return !this.every(not(predicate), context);\n\t },\n\t sort: function(comparator) {\n\t return this.sortBy(valueMapper, comparator);\n\t },\n\t values: function() {\n\t return this.__iterator(ITERATE_VALUES);\n\t },\n\t butLast: function() {\n\t return this.slice(0, -1);\n\t },\n\t count: function(predicate, context) {\n\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\n\t },\n\t countBy: function(grouper, context) {\n\t return countByFactory(this, grouper, context);\n\t },\n\t equals: function(other) {\n\t if (this === other) {\n\t return true;\n\t }\n\t if (!other || typeof other.equals !== 'function') {\n\t return false;\n\t }\n\t if (this.size !== undefined && other.size !== undefined) {\n\t if (this.size !== other.size) {\n\t return false;\n\t }\n\t if (this.size === 0 && other.size === 0) {\n\t return true;\n\t }\n\t }\n\t if (this.__hash !== undefined && other.__hash !== undefined && this.__hash !== other.__hash) {\n\t return false;\n\t }\n\t return this.__deepEquals(other);\n\t },\n\t __deepEquals: function(other) {\n\t var entries = this.entries();\n\t return typeof other.every === 'function' && other.every((function(v, k) {\n\t var entry = entries.next().value;\n\t return entry && is(entry[0], k) && is(entry[1], v);\n\t })) && entries.next().done;\n\t },\n\t entrySeq: function() {\n\t var iterable = this;\n\t if (iterable._cache) {\n\t return new ArraySeq(iterable._cache);\n\t }\n\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n\t entriesSequence.fromEntrySeq = (function() {\n\t return iterable.toSeq();\n\t });\n\t return entriesSequence;\n\t },\n\t filterNot: function(predicate, context) {\n\t return this.filter(not(predicate), context);\n\t },\n\t findLast: function(predicate, context, notSetValue) {\n\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n\t },\n\t first: function() {\n\t return this.find(returnTrue);\n\t },\n\t flatMap: function(mapper, context) {\n\t return reify(this, flatMapFactory(this, mapper, context));\n\t },\n\t flatten: function(depth) {\n\t return reify(this, flattenFactory(this, depth, true));\n\t },\n\t fromEntrySeq: function() {\n\t return new FromEntriesSequence(this);\n\t },\n\t get: function(searchKey, notSetValue) {\n\t return this.find((function(_, key) {\n\t return is(key, searchKey);\n\t }), undefined, notSetValue);\n\t },\n\t getIn: function(searchKeyPath, notSetValue) {\n\t var nested = this;\n\t if (searchKeyPath) {\n\t for (var ii = 0; ii < searchKeyPath.length; ii++) {\n\t nested = nested && nested.get ? nested.get(searchKeyPath[ii], NOT_SET) : NOT_SET;\n\t if (nested === NOT_SET) {\n\t return notSetValue;\n\t }\n\t }\n\t }\n\t return nested;\n\t },\n\t groupBy: function(grouper, context) {\n\t return groupByFactory(this, grouper, context);\n\t },\n\t has: function(searchKey) {\n\t return this.get(searchKey, NOT_SET) !== NOT_SET;\n\t },\n\t isSubset: function(iter) {\n\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\n\t return this.every((function(value) {\n\t return iter.contains(value);\n\t }));\n\t },\n\t isSuperset: function(iter) {\n\t return iter.isSubset(this);\n\t },\n\t keySeq: function() {\n\t return this.toSeq().map(keyMapper).toIndexedSeq();\n\t },\n\t last: function() {\n\t return this.toSeq().reverse().first();\n\t },\n\t max: function(comparator) {\n\t return this.maxBy(valueMapper, comparator);\n\t },\n\t maxBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t var maxEntry = this.entrySeq().reduce((function(max, next) {\n\t return comparator(mapper(next[1], next[0], $__0), mapper(max[1], max[0], $__0)) > 0 ? next : max;\n\t }));\n\t return maxEntry && maxEntry[1];\n\t },\n\t min: function(comparator) {\n\t return this.minBy(valueMapper, comparator);\n\t },\n\t minBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t var minEntry = this.entrySeq().reduce((function(min, next) {\n\t return comparator(mapper(next[1], next[0], $__0), mapper(min[1], min[0], $__0)) < 0 ? next : min;\n\t }));\n\t return minEntry && minEntry[1];\n\t },\n\t rest: function() {\n\t return this.slice(1);\n\t },\n\t skip: function(amount) {\n\t return reify(this, skipFactory(this, amount, true));\n\t },\n\t skipLast: function(amount) {\n\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\n\t },\n\t skipWhile: function(predicate, context) {\n\t return reify(this, skipWhileFactory(this, predicate, context, true));\n\t },\n\t skipUntil: function(predicate, context) {\n\t return this.skipWhile(not(predicate), context);\n\t },\n\t sortBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t return reify(this, new ArraySeq(this.entrySeq().entrySeq().toArray().sort((function(a, b) {\n\t return comparator(mapper(a[1][1], a[1][0], $__0), mapper(b[1][1], b[1][0], $__0)) || a[0] - b[0];\n\t }))).fromEntrySeq().valueSeq().fromEntrySeq());\n\t },\n\t take: function(amount) {\n\t return reify(this, takeFactory(this, amount));\n\t },\n\t takeLast: function(amount) {\n\t return reify(this, this.toSeq().reverse().take(amount).reverse());\n\t },\n\t takeWhile: function(predicate, context) {\n\t return reify(this, takeWhileFactory(this, predicate, context));\n\t },\n\t takeUntil: function(predicate, context) {\n\t return this.takeWhile(not(predicate), context);\n\t },\n\t valueSeq: function() {\n\t return this.toIndexedSeq();\n\t },\n\t hashCode: function() {\n\t return this.__hash || (this.__hash = this.size === Infinity ? 0 : this.reduce((function(h, v, k) {\n\t return (h + (hash(v) ^ (v === k ? 0 : hash(k)))) & HASH_MAX_VAL;\n\t }), 0));\n\t }\n\t}, {});\n\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n\tvar IterablePrototype = Iterable.prototype;\n\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\n\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n\tIterablePrototype.toJSON = IterablePrototype.toJS;\n\tIterablePrototype.__toJS = IterablePrototype.toArray;\n\tIterablePrototype.__toStringMapper = quoteString;\n\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\n\t return this.toString();\n\t};\n\tIterablePrototype.chain = IterablePrototype.flatMap;\n\t(function() {\n\t try {\n\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\n\t if (!Iterable.noLengthWarning) {\n\t var stack;\n\t try {\n\t throw new Error();\n\t } catch (error) {\n\t stack = error.stack;\n\t }\n\t if (stack.indexOf('_wrapObject') === -1) {\n\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\n\t return this.size;\n\t }\n\t }\n\t }});\n\t } catch (e) {}\n\t})();\n\tvar KeyedIterable = function KeyedIterable(value) {\n\t return isKeyed(value) ? value : KeyedSeq(value);\n\t};\n\t($traceurRuntime.createClass)(KeyedIterable, {\n\t flip: function() {\n\t return reify(this, flipFactory(this));\n\t },\n\t findKey: function(predicate, context) {\n\t var foundKey;\n\t this.__iterate((function(v, k, c) {\n\t if (predicate.call(context, v, k, c)) {\n\t foundKey = k;\n\t return false;\n\t }\n\t }));\n\t return foundKey;\n\t },\n\t findLastKey: function(predicate, context) {\n\t return this.toSeq().reverse().findKey(predicate, context);\n\t },\n\t keyOf: function(searchValue) {\n\t return this.findKey((function(value) {\n\t return is(value, searchValue);\n\t }));\n\t },\n\t lastKeyOf: function(searchValue) {\n\t return this.toSeq().reverse().keyOf(searchValue);\n\t },\n\t mapEntries: function(mapper, context) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t return reify(this, this.toSeq().map((function(v, k) {\n\t return mapper.call(context, [k, v], iterations++, $__0);\n\t })).fromEntrySeq());\n\t },\n\t mapKeys: function(mapper, context) {\n\t var $__0 = this;\n\t return reify(this, this.toSeq().flip().map((function(k, v) {\n\t return mapper.call(context, k, v, $__0);\n\t })).flip());\n\t }\n\t}, {}, Iterable);\n\tvar KeyedIterablePrototype = KeyedIterable.prototype;\n\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\n\t return k + ': ' + quoteString(v);\n\t});\n\tvar IndexedIterable = function IndexedIterable(value) {\n\t return isIndexed(value) ? value : IndexedSeq(value);\n\t};\n\t($traceurRuntime.createClass)(IndexedIterable, {\n\t toKeyedSeq: function() {\n\t return new ToKeyedSequence(this, false);\n\t },\n\t filter: function(predicate, context) {\n\t return reify(this, filterFactory(this, predicate, context, false));\n\t },\n\t findIndex: function(predicate, context) {\n\t var key = this.toKeyedSeq().findKey(predicate, context);\n\t return key === undefined ? -1 : key;\n\t },\n\t indexOf: function(searchValue) {\n\t var key = this.toKeyedSeq().keyOf(searchValue);\n\t return key === undefined ? -1 : key;\n\t },\n\t lastIndexOf: function(searchValue) {\n\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\n\t return key === undefined ? -1 : key;\n\t },\n\t reverse: function() {\n\t return reify(this, reverseFactory(this, false));\n\t },\n\t splice: function(index, removeNum) {\n\t var numArgs = arguments.length;\n\t removeNum = Math.max(removeNum | 0, 0);\n\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n\t return this;\n\t }\n\t index = resolveBegin(index, this.size);\n\t var spliced = this.slice(0, index);\n\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\n\t },\n\t findLastIndex: function(predicate, context) {\n\t var key = this.toKeyedSeq().findLastKey(predicate, context);\n\t return key === undefined ? -1 : key;\n\t },\n\t first: function() {\n\t return this.get(0);\n\t },\n\t flatten: function(depth) {\n\t return reify(this, flattenFactory(this, depth, false));\n\t },\n\t get: function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\n\t return key === index;\n\t }), undefined, notSetValue);\n\t },\n\t has: function(index) {\n\t index = wrapIndex(this, index);\n\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\n\t },\n\t interpose: function(separator) {\n\t return reify(this, interposeFactory(this, separator));\n\t },\n\t last: function() {\n\t return this.get(-1);\n\t },\n\t skip: function(amount) {\n\t var iter = this;\n\t var skipSeq = skipFactory(iter, amount, false);\n\t if (isSeq(iter) && skipSeq !== iter) {\n\t skipSeq.get = function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\n\t };\n\t }\n\t return reify(this, skipSeq);\n\t },\n\t skipWhile: function(predicate, context) {\n\t return reify(this, skipWhileFactory(this, predicate, context, false));\n\t },\n\t sortBy: function(mapper, comparator) {\n\t var $__0 = this;\n\t comparator = comparator || defaultComparator;\n\t return reify(this, new ArraySeq(this.entrySeq().toArray().sort((function(a, b) {\n\t return comparator(mapper(a[1], a[0], $__0), mapper(b[1], b[0], $__0)) || a[0] - b[0];\n\t }))).fromEntrySeq().valueSeq());\n\t },\n\t take: function(amount) {\n\t var iter = this;\n\t var takeSeq = takeFactory(iter, amount);\n\t if (isSeq(iter) && takeSeq !== iter) {\n\t takeSeq.get = function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\n\t };\n\t }\n\t return reify(this, takeSeq);\n\t }\n\t}, {}, Iterable);\n\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n\tvar SetIterable = function SetIterable(value) {\n\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n\t};\n\t($traceurRuntime.createClass)(SetIterable, {\n\t get: function(value, notSetValue) {\n\t return this.has(value) ? value : notSetValue;\n\t },\n\t contains: function(value) {\n\t return this.has(value);\n\t },\n\t keySeq: function() {\n\t return this.valueSeq();\n\t }\n\t}, {}, Iterable);\n\tSetIterable.prototype.has = IterablePrototype.contains;\n\tfunction isIterable(maybeIterable) {\n\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n\t}\n\tfunction isKeyed(maybeKeyed) {\n\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n\t}\n\tfunction isIndexed(maybeIndexed) {\n\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n\t}\n\tfunction isAssociative(maybeAssociative) {\n\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n\t}\n\tIterable.isIterable = isIterable;\n\tIterable.isKeyed = isKeyed;\n\tIterable.isIndexed = isIndexed;\n\tIterable.isAssociative = isAssociative;\n\tIterable.Keyed = KeyedIterable;\n\tIterable.Indexed = IndexedIterable;\n\tIterable.Set = SetIterable;\n\tIterable.Iterator = Iterator;\n\tfunction valueMapper(v) {\n\t return v;\n\t}\n\tfunction keyMapper(v, k) {\n\t return k;\n\t}\n\tfunction entryMapper(v, k) {\n\t return [k, v];\n\t}\n\tfunction not(predicate) {\n\t return function() {\n\t return !predicate.apply(this, arguments);\n\t };\n\t}\n\tfunction quoteString(value) {\n\t return typeof value === 'string' ? JSON.stringify(value) : value;\n\t}\n\tfunction defaultComparator(a, b) {\n\t return a > b ? 1 : a < b ? -1 : 0;\n\t}\n\tfunction mixin(ctor, methods) {\n\t var proto = ctor.prototype;\n\t var keyCopier = (function(key) {\n\t proto[key] = methods[key];\n\t });\n\t Object.keys(methods).forEach(keyCopier);\n\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n\t return ctor;\n\t}\n\tvar Seq = function Seq(value) {\n\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\n\t};\n\tvar $Seq = Seq;\n\t($traceurRuntime.createClass)(Seq, {\n\t toSeq: function() {\n\t return this;\n\t },\n\t toString: function() {\n\t return this.__toString('Seq {', '}');\n\t },\n\t cacheResult: function() {\n\t if (!this._cache && this.__iterateUncached) {\n\t this._cache = this.entrySeq().toArray();\n\t this.size = this._cache.length;\n\t }\n\t return this;\n\t },\n\t __iterate: function(fn, reverse) {\n\t return seqIterate(this, fn, reverse, true);\n\t },\n\t __iterator: function(type, reverse) {\n\t return seqIterator(this, type, reverse, true);\n\t }\n\t}, {of: function() {\n\t return $Seq(arguments);\n\t }}, Iterable);\n\tvar KeyedSeq = function KeyedSeq(value) {\n\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\n\t};\n\tvar $KeyedSeq = KeyedSeq;\n\t($traceurRuntime.createClass)(KeyedSeq, {\n\t toKeyedSeq: function() {\n\t return this;\n\t },\n\t toSeq: function() {\n\t return this;\n\t }\n\t}, {of: function() {\n\t return $KeyedSeq(arguments);\n\t }}, Seq);\n\tmixin(KeyedSeq, KeyedIterable.prototype);\n\tvar IndexedSeq = function IndexedSeq(value) {\n\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n\t};\n\tvar $IndexedSeq = IndexedSeq;\n\t($traceurRuntime.createClass)(IndexedSeq, {\n\t toIndexedSeq: function() {\n\t return this;\n\t },\n\t toString: function() {\n\t return this.__toString('Seq [', ']');\n\t },\n\t __iterate: function(fn, reverse) {\n\t return seqIterate(this, fn, reverse, false);\n\t },\n\t __iterator: function(type, reverse) {\n\t return seqIterator(this, type, reverse, false);\n\t }\n\t}, {of: function() {\n\t return $IndexedSeq(arguments);\n\t }}, Seq);\n\tmixin(IndexedSeq, IndexedIterable.prototype);\n\tvar SetSeq = function SetSeq(value) {\n\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\n\t};\n\tvar $SetSeq = SetSeq;\n\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\n\t return this;\n\t }}, {of: function() {\n\t return $SetSeq(arguments);\n\t }}, Seq);\n\tmixin(SetSeq, SetIterable.prototype);\n\tSeq.isSeq = isSeq;\n\tSeq.Keyed = KeyedSeq;\n\tSeq.Set = SetSeq;\n\tSeq.Indexed = IndexedSeq;\n\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\tSeq.prototype[IS_SEQ_SENTINEL] = true;\n\tvar ArraySeq = function ArraySeq(array) {\n\t this._array = array;\n\t this.size = array.length;\n\t};\n\t($traceurRuntime.createClass)(ArraySeq, {\n\t get: function(index, notSetValue) {\n\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n\t },\n\t __iterate: function(fn, reverse) {\n\t var array = this._array;\n\t var maxIndex = array.length - 1;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var array = this._array;\n\t var maxIndex = array.length - 1;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tvar ObjectSeq = function ObjectSeq(object) {\n\t var keys = Object.keys(object);\n\t this._object = object;\n\t this._keys = keys;\n\t this.size = keys.length;\n\t};\n\t($traceurRuntime.createClass)(ObjectSeq, {\n\t get: function(key, notSetValue) {\n\t if (notSetValue !== undefined && !this.has(key)) {\n\t return notSetValue;\n\t }\n\t return this._object[key];\n\t },\n\t has: function(key) {\n\t return this._object.hasOwnProperty(key);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var object = this._object;\n\t var keys = this._keys;\n\t var maxIndex = keys.length - 1;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t var key = keys[reverse ? maxIndex - ii : ii];\n\t if (fn(object[key], key, this) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var object = this._object;\n\t var keys = this._keys;\n\t var maxIndex = keys.length - 1;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t var key = keys[reverse ? maxIndex - ii : ii];\n\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\n\t }));\n\t }\n\t}, {}, KeyedSeq);\n\tvar IterableSeq = function IterableSeq(iterable) {\n\t this._iterable = iterable;\n\t this.size = iterable.length || iterable.size;\n\t};\n\t($traceurRuntime.createClass)(IterableSeq, {\n\t __iterateUncached: function(fn, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterable = this._iterable;\n\t var iterator = getIterator(iterable);\n\t var iterations = 0;\n\t if (isIterator(iterator)) {\n\t var step;\n\t while (!(step = iterator.next()).done) {\n\t if (fn(step.value, iterations++, this) === false) {\n\t break;\n\t }\n\t }\n\t }\n\t return iterations;\n\t },\n\t __iteratorUncached: function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterable = this._iterable;\n\t var iterator = getIterator(iterable);\n\t if (!isIterator(iterator)) {\n\t return new Iterator(iteratorDone);\n\t }\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, iterations++, step.value);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tvar IteratorSeq = function IteratorSeq(iterator) {\n\t this._iterator = iterator;\n\t this._iteratorCache = [];\n\t};\n\t($traceurRuntime.createClass)(IteratorSeq, {\n\t __iterateUncached: function(fn, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterator = this._iterator;\n\t var cache = this._iteratorCache;\n\t var iterations = 0;\n\t while (iterations < cache.length) {\n\t if (fn(cache[iterations], iterations++, this) === false) {\n\t return iterations;\n\t }\n\t }\n\t var step;\n\t while (!(step = iterator.next()).done) {\n\t var val = step.value;\n\t cache[iterations] = val;\n\t if (fn(val, iterations++, this) === false) {\n\t break;\n\t }\n\t }\n\t return iterations;\n\t },\n\t __iteratorUncached: function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = this._iterator;\n\t var cache = this._iteratorCache;\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t if (iterations >= cache.length) {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t cache[iterations] = step.value;\n\t }\n\t return iteratorValue(type, iterations, cache[iterations++]);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tfunction isSeq(maybeSeq) {\n\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n\t}\n\tvar EMPTY_SEQ;\n\tfunction emptySequence() {\n\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n\t}\n\tfunction keyedSeqFromValue(value) {\n\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\n\t if (!seq) {\n\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\n\t }\n\t return seq;\n\t}\n\tfunction indexedSeqFromValue(value) {\n\t var seq = maybeIndexedSeqFromValue(value);\n\t if (!seq) {\n\t throw new TypeError('Expected Array or iterable object of values: ' + value);\n\t }\n\t return seq;\n\t}\n\tfunction seqFromValue(value) {\n\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\n\t if (!seq) {\n\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\n\t }\n\t return seq;\n\t}\n\tfunction maybeIndexedSeqFromValue(value) {\n\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\n\t}\n\tfunction isArrayLike(value) {\n\t return value && typeof value.length === 'number';\n\t}\n\tfunction seqIterate(seq, fn, reverse, useKeys) {\n\t assertNotInfinite(seq.size);\n\t var cache = seq._cache;\n\t if (cache) {\n\t var maxIndex = cache.length - 1;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t }\n\t return seq.__iterateUncached(fn, reverse);\n\t}\n\tfunction seqIterator(seq, type, reverse, useKeys) {\n\t var cache = seq._cache;\n\t if (cache) {\n\t var maxIndex = cache.length - 1;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t var entry = cache[reverse ? maxIndex - ii : ii];\n\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n\t }));\n\t }\n\t return seq.__iteratorUncached(type, reverse);\n\t}\n\tfunction fromJS(json, converter) {\n\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\n\t}\n\tfunction _fromJSWith(converter, json, key, parentJSON) {\n\t if (Array.isArray(json)) {\n\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\n\t return _fromJSWith(converter, v, k, json);\n\t })));\n\t }\n\t if (isPlainObj(json)) {\n\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\n\t return _fromJSWith(converter, v, k, json);\n\t })));\n\t }\n\t return json;\n\t}\n\tfunction _fromJSDefault(json) {\n\t if (Array.isArray(json)) {\n\t return IndexedSeq(json).map(_fromJSDefault).toList();\n\t }\n\t if (isPlainObj(json)) {\n\t return KeyedSeq(json).map(_fromJSDefault).toMap();\n\t }\n\t return json;\n\t}\n\tfunction isPlainObj(value) {\n\t return value && value.constructor === Object;\n\t}\n\tvar Collection = function Collection() {\n\t throw TypeError('Abstract');\n\t};\n\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\n\tvar KeyedCollection = function KeyedCollection() {\n\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\n\t};\n\tvar $KeyedCollection = KeyedCollection;\n\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\n\tmixin(KeyedCollection, KeyedIterable.prototype);\n\tvar IndexedCollection = function IndexedCollection() {\n\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\n\t};\n\tvar $IndexedCollection = IndexedCollection;\n\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\n\tmixin(IndexedCollection, IndexedIterable.prototype);\n\tvar SetCollection = function SetCollection() {\n\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\n\t};\n\tvar $SetCollection = SetCollection;\n\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\n\tmixin(SetCollection, SetIterable.prototype);\n\tCollection.Keyed = KeyedCollection;\n\tCollection.Indexed = IndexedCollection;\n\tCollection.Set = SetCollection;\n\tvar Map = function Map(value) {\n\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().merge(KeyedIterable(value));\n\t};\n\t($traceurRuntime.createClass)(Map, {\n\t toString: function() {\n\t return this.__toString('Map {', '}');\n\t },\n\t get: function(k, notSetValue) {\n\t return this._root ? this._root.get(0, hash(k), k, notSetValue) : notSetValue;\n\t },\n\t set: function(k, v) {\n\t return updateMap(this, k, v);\n\t },\n\t setIn: function(keyPath, v) {\n\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\n\t return this.updateIn(keyPath, (function() {\n\t return v;\n\t }));\n\t },\n\t remove: function(k) {\n\t return updateMap(this, k, NOT_SET);\n\t },\n\t removeIn: function(keyPath) {\n\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\n\t return this.updateIn(keyPath, (function() {\n\t return NOT_SET;\n\t }));\n\t },\n\t update: function(k, notSetValue, updater) {\n\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\n\t },\n\t updateIn: function(keyPath, notSetValue, updater) {\n\t if (!updater) {\n\t updater = notSetValue;\n\t notSetValue = undefined;\n\t }\n\t return keyPath.length === 0 ? updater(this) : updateInDeepMap(this, keyPath, notSetValue, updater, 0);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._root = null;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return emptyMap();\n\t },\n\t merge: function() {\n\t return mergeIntoMapWith(this, undefined, arguments);\n\t },\n\t mergeWith: function(merger) {\n\t for (var iters = [],\n\t $__3 = 1; $__3 < arguments.length; $__3++)\n\t iters[$__3 - 1] = arguments[$__3];\n\t return mergeIntoMapWith(this, merger, iters);\n\t },\n\t mergeDeep: function() {\n\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\n\t },\n\t mergeDeepWith: function(merger) {\n\t for (var iters = [],\n\t $__4 = 1; $__4 < arguments.length; $__4++)\n\t iters[$__4 - 1] = arguments[$__4];\n\t return mergeIntoMapWith(this, deepMerger(merger), iters);\n\t },\n\t withMutations: function(fn) {\n\t var mutable = this.asMutable();\n\t fn(mutable);\n\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n\t },\n\t asMutable: function() {\n\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n\t },\n\t asImmutable: function() {\n\t return this.__ensureOwner();\n\t },\n\t wasAltered: function() {\n\t return this.__altered;\n\t },\n\t __iterator: function(type, reverse) {\n\t return new MapIterator(this, type, reverse);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t this._root && this._root.iterate((function(entry) {\n\t iterations++;\n\t return fn(entry[1], entry[0], $__0);\n\t }), reverse);\n\t return iterations;\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this.__altered = false;\n\t return this;\n\t }\n\t return makeMap(this.size, this._root, ownerID, this.__hash);\n\t }\n\t}, {}, KeyedCollection);\n\tfunction isMap(maybeMap) {\n\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n\t}\n\tMap.isMap = isMap;\n\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\tvar MapPrototype = Map.prototype;\n\tMapPrototype[IS_MAP_SENTINEL] = true;\n\tMapPrototype[DELETE] = MapPrototype.remove;\n\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\n\t this.ownerID = ownerID;\n\t this.bitmap = bitmap;\n\t this.nodes = nodes;\n\t};\n\tvar $BitmapIndexedNode = BitmapIndexedNode;\n\t($traceurRuntime.createClass)(BitmapIndexedNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t var bit = (1 << ((shift === 0 ? hash : hash >>> shift) & MASK));\n\t var bitmap = this.bitmap;\n\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, hash, key, notSetValue);\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var hashFrag = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var bit = 1 << hashFrag;\n\t var bitmap = this.bitmap;\n\t var exists = (bitmap & bit) !== 0;\n\t if (!exists && value === NOT_SET) {\n\t return this;\n\t }\n\t var idx = popCount(bitmap & (bit - 1));\n\t var nodes = this.nodes;\n\t var node = exists ? nodes[idx] : undefined;\n\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\n\t if (newNode === node) {\n\t return this;\n\t }\n\t if (!exists && newNode && nodes.length >= MAX_BITMAP_SIZE) {\n\t return expandNodes(ownerID, nodes, bitmap, hashFrag, newNode);\n\t }\n\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n\t return nodes[idx ^ 1];\n\t }\n\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n\t return newNode;\n\t }\n\t var isEditable = ownerID && ownerID === this.ownerID;\n\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\n\t if (isEditable) {\n\t this.bitmap = newBitmap;\n\t this.nodes = newNodes;\n\t return this;\n\t }\n\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\n\t },\n\t iterate: function(fn, reverse) {\n\t var nodes = this.nodes;\n\t for (var ii = 0,\n\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n\t if (nodes[reverse ? maxIndex - ii : ii].iterate(fn, reverse) === false) {\n\t return false;\n\t }\n\t }\n\t }\n\t}, {});\n\tvar ArrayNode = function ArrayNode(ownerID, count, nodes) {\n\t this.ownerID = ownerID;\n\t this.count = count;\n\t this.nodes = nodes;\n\t};\n\tvar $ArrayNode = ArrayNode;\n\t($traceurRuntime.createClass)(ArrayNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var node = this.nodes[idx];\n\t return node ? node.get(shift + SHIFT, hash, key, notSetValue) : notSetValue;\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var removed = value === NOT_SET;\n\t var nodes = this.nodes;\n\t var node = nodes[idx];\n\t if (removed && !node) {\n\t return this;\n\t }\n\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\n\t if (newNode === node) {\n\t return this;\n\t }\n\t var newCount = this.count;\n\t if (!node) {\n\t newCount++;\n\t } else if (!newNode) {\n\t newCount--;\n\t if (newCount < MIN_ARRAY_SIZE) {\n\t return packNodes(ownerID, nodes, newCount, idx);\n\t }\n\t }\n\t var isEditable = ownerID && ownerID === this.ownerID;\n\t var newNodes = setIn(nodes, idx, newNode, isEditable);\n\t if (isEditable) {\n\t this.count = newCount;\n\t this.nodes = newNodes;\n\t return this;\n\t }\n\t return new $ArrayNode(ownerID, newCount, newNodes);\n\t },\n\t iterate: function(fn, reverse) {\n\t var nodes = this.nodes;\n\t for (var ii = 0,\n\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n\t var node = nodes[reverse ? maxIndex - ii : ii];\n\t if (node && node.iterate(fn, reverse) === false) {\n\t return false;\n\t }\n\t }\n\t }\n\t}, {});\n\tvar HashCollisionNode = function HashCollisionNode(ownerID, hash, entries) {\n\t this.ownerID = ownerID;\n\t this.hash = hash;\n\t this.entries = entries;\n\t};\n\tvar $HashCollisionNode = HashCollisionNode;\n\t($traceurRuntime.createClass)(HashCollisionNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t var entries = this.entries;\n\t for (var ii = 0,\n\t len = entries.length; ii < len; ii++) {\n\t if (is(key, entries[ii][0])) {\n\t return entries[ii][1];\n\t }\n\t }\n\t return notSetValue;\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var removed = value === NOT_SET;\n\t if (hash !== this.hash) {\n\t if (removed) {\n\t return this;\n\t }\n\t SetRef(didAlter);\n\t SetRef(didChangeSize);\n\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\n\t }\n\t var entries = this.entries;\n\t var idx = 0;\n\t for (var len = entries.length; idx < len; idx++) {\n\t if (is(key, entries[idx][0])) {\n\t break;\n\t }\n\t }\n\t var exists = idx < len;\n\t if (removed && !exists) {\n\t return this;\n\t }\n\t SetRef(didAlter);\n\t (removed || !exists) && SetRef(didChangeSize);\n\t if (removed && len === 2) {\n\t return new ValueNode(ownerID, this.hash, entries[idx ^ 1]);\n\t }\n\t var isEditable = ownerID && ownerID === this.ownerID;\n\t var newEntries = isEditable ? entries : arrCopy(entries);\n\t if (exists) {\n\t if (removed) {\n\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n\t } else {\n\t newEntries[idx] = [key, value];\n\t }\n\t } else {\n\t newEntries.push([key, value]);\n\t }\n\t if (isEditable) {\n\t this.entries = newEntries;\n\t return this;\n\t }\n\t return new $HashCollisionNode(ownerID, this.hash, newEntries);\n\t },\n\t iterate: function(fn, reverse) {\n\t var entries = this.entries;\n\t for (var ii = 0,\n\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n\t return false;\n\t }\n\t }\n\t }\n\t}, {});\n\tvar ValueNode = function ValueNode(ownerID, hash, entry) {\n\t this.ownerID = ownerID;\n\t this.hash = hash;\n\t this.entry = entry;\n\t};\n\tvar $ValueNode = ValueNode;\n\t($traceurRuntime.createClass)(ValueNode, {\n\t get: function(shift, hash, key, notSetValue) {\n\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n\t },\n\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t var removed = value === NOT_SET;\n\t var keyMatch = is(key, this.entry[0]);\n\t if (keyMatch ? value === this.entry[1] : removed) {\n\t return this;\n\t }\n\t SetRef(didAlter);\n\t if (removed) {\n\t SetRef(didChangeSize);\n\t return;\n\t }\n\t if (keyMatch) {\n\t if (ownerID && ownerID === this.ownerID) {\n\t this.entry[1] = value;\n\t return this;\n\t }\n\t return new $ValueNode(ownerID, hash, [key, value]);\n\t }\n\t SetRef(didChangeSize);\n\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\n\t },\n\t iterate: function(fn) {\n\t return fn(this.entry);\n\t }\n\t}, {});\n\tvar MapIterator = function MapIterator(map, type, reverse) {\n\t this._type = type;\n\t this._reverse = reverse;\n\t this._stack = map._root && mapIteratorFrame(map._root);\n\t};\n\t($traceurRuntime.createClass)(MapIterator, {next: function() {\n\t var type = this._type;\n\t var stack = this._stack;\n\t while (stack) {\n\t var node = stack.node;\n\t var index = stack.index++;\n\t var maxIndex;\n\t if (node.entry) {\n\t if (index === 0) {\n\t return mapIteratorValue(type, node.entry);\n\t }\n\t } else if (node.entries) {\n\t maxIndex = node.entries.length - 1;\n\t if (index <= maxIndex) {\n\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n\t }\n\t } else {\n\t maxIndex = node.nodes.length - 1;\n\t if (index <= maxIndex) {\n\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n\t if (subNode) {\n\t if (subNode.entry) {\n\t return mapIteratorValue(type, subNode.entry);\n\t }\n\t stack = this._stack = mapIteratorFrame(subNode, stack);\n\t }\n\t continue;\n\t }\n\t }\n\t stack = this._stack = this._stack.__prev;\n\t }\n\t return iteratorDone();\n\t }}, {}, Iterator);\n\tfunction mapIteratorValue(type, entry) {\n\t return iteratorValue(type, entry[0], entry[1]);\n\t}\n\tfunction mapIteratorFrame(node, prev) {\n\t return {\n\t node: node,\n\t index: 0,\n\t __prev: prev\n\t };\n\t}\n\tfunction makeMap(size, root, ownerID, hash) {\n\t var map = Object.create(MapPrototype);\n\t map.size = size;\n\t map._root = root;\n\t map.__ownerID = ownerID;\n\t map.__hash = hash;\n\t map.__altered = false;\n\t return map;\n\t}\n\tvar EMPTY_MAP;\n\tfunction emptyMap() {\n\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n\t}\n\tfunction updateMap(map, k, v) {\n\t var didChangeSize = MakeRef(CHANGE_LENGTH);\n\t var didAlter = MakeRef(DID_ALTER);\n\t var newRoot = updateNode(map._root, map.__ownerID, 0, hash(k), k, v, didChangeSize, didAlter);\n\t if (!didAlter.value) {\n\t return map;\n\t }\n\t var newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n\t if (map.__ownerID) {\n\t map.size = newSize;\n\t map._root = newRoot;\n\t map.__hash = undefined;\n\t map.__altered = true;\n\t return map;\n\t }\n\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n\t}\n\tfunction updateNode(node, ownerID, shift, hash, key, value, didChangeSize, didAlter) {\n\t if (!node) {\n\t if (value === NOT_SET) {\n\t return node;\n\t }\n\t SetRef(didAlter);\n\t SetRef(didChangeSize);\n\t return new ValueNode(ownerID, hash, [key, value]);\n\t }\n\t return node.update(ownerID, shift, hash, key, value, didChangeSize, didAlter);\n\t}\n\tfunction isLeafNode(node) {\n\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n\t}\n\tfunction mergeIntoNode(node, ownerID, shift, hash, entry) {\n\t if (node.hash === hash) {\n\t return new HashCollisionNode(ownerID, hash, [node.entry, entry]);\n\t }\n\t var idx1 = (shift === 0 ? node.hash : node.hash >>> shift) & MASK;\n\t var idx2 = (shift === 0 ? hash : hash >>> shift) & MASK;\n\t var newNode;\n\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, hash, entry)] : ((newNode = new ValueNode(ownerID, hash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n\t}\n\tfunction packNodes(ownerID, nodes, count, excluding) {\n\t var bitmap = 0;\n\t var packedII = 0;\n\t var packedNodes = new Array(count);\n\t for (var ii = 0,\n\t bit = 1,\n\t len = nodes.length; ii < len; ii++, bit <<= 1) {\n\t var node = nodes[ii];\n\t if (node !== undefined && ii !== excluding) {\n\t bitmap |= bit;\n\t packedNodes[packedII++] = node;\n\t }\n\t }\n\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n\t}\n\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\n\t var count = 0;\n\t var expandedNodes = new Array(SIZE);\n\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n\t }\n\t expandedNodes[including] = node;\n\t return new ArrayNode(ownerID, count + 1, expandedNodes);\n\t}\n\tfunction mergeIntoMapWith(map, merger, iterables) {\n\t var iters = [];\n\t for (var ii = 0; ii < iterables.length; ii++) {\n\t var value = iterables[ii];\n\t var iter = KeyedIterable(value);\n\t if (!isIterable(value)) {\n\t iter = iter.map((function(v) {\n\t return fromJS(v);\n\t }));\n\t }\n\t iters.push(iter);\n\t }\n\t return mergeIntoCollectionWith(map, merger, iters);\n\t}\n\tfunction deepMerger(merger) {\n\t return (function(existing, value) {\n\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\n\t });\n\t}\n\tfunction mergeIntoCollectionWith(collection, merger, iters) {\n\t if (iters.length === 0) {\n\t return collection;\n\t }\n\t return collection.withMutations((function(collection) {\n\t var mergeIntoMap = merger ? (function(value, key) {\n\t collection.update(key, NOT_SET, (function(existing) {\n\t return existing === NOT_SET ? value : merger(existing, value);\n\t }));\n\t }) : (function(value, key) {\n\t collection.set(key, value);\n\t });\n\t for (var ii = 0; ii < iters.length; ii++) {\n\t iters[ii].forEach(mergeIntoMap);\n\t }\n\t }));\n\t}\n\tfunction updateInDeepMap(collection, keyPath, notSetValue, updater, offset) {\n\t invariant(!collection || collection.set, 'updateIn with invalid keyPath');\n\t var key = keyPath[offset];\n\t var existing = collection ? collection.get(key, NOT_SET) : NOT_SET;\n\t var existingValue = existing === NOT_SET ? undefined : existing;\n\t var value = offset === keyPath.length - 1 ? updater(existing === NOT_SET ? notSetValue : existing) : updateInDeepMap(existingValue, keyPath, notSetValue, updater, offset + 1);\n\t return value === existingValue ? collection : value === NOT_SET ? collection && collection.remove(key) : (collection || emptyMap()).set(key, value);\n\t}\n\tfunction popCount(x) {\n\t x = x - ((x >> 1) & 0x55555555);\n\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n\t x = (x + (x >> 4)) & 0x0f0f0f0f;\n\t x = x + (x >> 8);\n\t x = x + (x >> 16);\n\t return x & 0x7f;\n\t}\n\tfunction setIn(array, idx, val, canEdit) {\n\t var newArray = canEdit ? array : arrCopy(array);\n\t newArray[idx] = val;\n\t return newArray;\n\t}\n\tfunction spliceIn(array, idx, val, canEdit) {\n\t var newLen = array.length + 1;\n\t if (canEdit && idx + 1 === newLen) {\n\t array[idx] = val;\n\t return array;\n\t }\n\t var newArray = new Array(newLen);\n\t var after = 0;\n\t for (var ii = 0; ii < newLen; ii++) {\n\t if (ii === idx) {\n\t newArray[ii] = val;\n\t after = -1;\n\t } else {\n\t newArray[ii] = array[ii + after];\n\t }\n\t }\n\t return newArray;\n\t}\n\tfunction spliceOut(array, idx, canEdit) {\n\t var newLen = array.length - 1;\n\t if (canEdit && idx === newLen) {\n\t array.pop();\n\t return array;\n\t }\n\t var newArray = new Array(newLen);\n\t var after = 0;\n\t for (var ii = 0; ii < newLen; ii++) {\n\t if (ii === idx) {\n\t after = 1;\n\t }\n\t newArray[ii] = array[ii + after];\n\t }\n\t return newArray;\n\t}\n\tvar MAX_BITMAP_SIZE = SIZE / 2;\n\tvar MIN_ARRAY_SIZE = SIZE / 4;\n\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\n\t this._iter = indexed;\n\t this._useKeys = useKeys;\n\t this.size = indexed.size;\n\t};\n\t($traceurRuntime.createClass)(ToKeyedSequence, {\n\t get: function(key, notSetValue) {\n\t return this._iter.get(key, notSetValue);\n\t },\n\t has: function(key) {\n\t return this._iter.has(key);\n\t },\n\t valueSeq: function() {\n\t return this._iter.valueSeq();\n\t },\n\t reverse: function() {\n\t var $__0 = this;\n\t var reversedSequence = reverseFactory(this, true);\n\t if (!this._useKeys) {\n\t reversedSequence.valueSeq = (function() {\n\t return $__0._iter.toSeq().reverse();\n\t });\n\t }\n\t return reversedSequence;\n\t },\n\t map: function(mapper, context) {\n\t var $__0 = this;\n\t var mappedSequence = mapFactory(this, mapper, context);\n\t if (!this._useKeys) {\n\t mappedSequence.valueSeq = (function() {\n\t return $__0._iter.toSeq().map(mapper, context);\n\t });\n\t }\n\t return mappedSequence;\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var ii;\n\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\n\t return fn(v, k, $__0);\n\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\n\t return fn(v, reverse ? --ii : ii++, $__0);\n\t })), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t if (this._useKeys) {\n\t return this._iter.__iterator(type, reverse);\n\t }\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t var ii = reverse ? resolveSize(this) : 0;\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n\t }));\n\t }\n\t}, {}, KeyedSeq);\n\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\n\t this._iter = iter;\n\t this.size = iter.size;\n\t};\n\t($traceurRuntime.createClass)(ToIndexedSequence, {\n\t contains: function(value) {\n\t return this._iter.contains(value);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t return this._iter.__iterate((function(v) {\n\t return fn(v, iterations++, $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\n\t }));\n\t }\n\t}, {}, IndexedSeq);\n\tvar ToSetSequence = function ToSetSequence(iter) {\n\t this._iter = iter;\n\t this.size = iter.size;\n\t};\n\t($traceurRuntime.createClass)(ToSetSequence, {\n\t has: function(key) {\n\t return this._iter.contains(key);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._iter.__iterate((function(v) {\n\t return fn(v, v, $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\n\t }));\n\t }\n\t}, {}, SetSeq);\n\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\n\t this._iter = entries;\n\t this.size = entries.size;\n\t};\n\t($traceurRuntime.createClass)(FromEntriesSequence, {\n\t entrySeq: function() {\n\t return this._iter.toSeq();\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._iter.__iterate((function(entry) {\n\t if (entry) {\n\t validateEntry(entry);\n\t return fn(entry[1], entry[0], $__0);\n\t }\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n\t return new Iterator((function() {\n\t while (true) {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t if (entry) {\n\t validateEntry(entry);\n\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\n\t }\n\t }\n\t }));\n\t }\n\t}, {}, KeyedSeq);\n\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\n\tfunction flipFactory(iterable) {\n\t var flipSequence = makeSequence(iterable);\n\t flipSequence._iter = iterable;\n\t flipSequence.size = iterable.size;\n\t flipSequence.flip = (function() {\n\t return iterable;\n\t });\n\t flipSequence.reverse = function() {\n\t var reversedSequence = iterable.reverse.apply(this);\n\t reversedSequence.flip = (function() {\n\t return iterable.reverse();\n\t });\n\t return reversedSequence;\n\t };\n\t flipSequence.has = (function(key) {\n\t return iterable.contains(key);\n\t });\n\t flipSequence.contains = (function(key) {\n\t return iterable.has(key);\n\t });\n\t flipSequence.cacheResult = cacheResultThrough;\n\t flipSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t return iterable.__iterate((function(v, k) {\n\t return fn(k, v, $__0) !== false;\n\t }), reverse);\n\t };\n\t flipSequence.__iteratorUncached = function(type, reverse) {\n\t if (type === ITERATE_ENTRIES) {\n\t var iterator = iterable.__iterator(type, reverse);\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t if (!step.done) {\n\t var k = step.value[0];\n\t step.value[0] = step.value[1];\n\t step.value[1] = k;\n\t }\n\t return step;\n\t }));\n\t }\n\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\n\t };\n\t return flipSequence;\n\t}\n\tfunction mapFactory(iterable, mapper, context) {\n\t var mappedSequence = makeSequence(iterable);\n\t mappedSequence.size = iterable.size;\n\t mappedSequence.has = (function(key) {\n\t return iterable.has(key);\n\t });\n\t mappedSequence.get = (function(key, notSetValue) {\n\t var v = iterable.get(key, NOT_SET);\n\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\n\t });\n\t mappedSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t return iterable.__iterate((function(v, k, c) {\n\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\n\t }), reverse);\n\t };\n\t mappedSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t return new Iterator((function() {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t var key = entry[0];\n\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\n\t }));\n\t };\n\t return mappedSequence;\n\t}\n\tfunction reverseFactory(iterable, useKeys) {\n\t var reversedSequence = makeSequence(iterable);\n\t reversedSequence._iter = iterable;\n\t reversedSequence.size = iterable.size;\n\t reversedSequence.reverse = (function() {\n\t return iterable;\n\t });\n\t if (iterable.flip) {\n\t reversedSequence.flip = function() {\n\t var flipSequence = flipFactory(iterable);\n\t flipSequence.reverse = (function() {\n\t return iterable.flip();\n\t });\n\t return flipSequence;\n\t };\n\t }\n\t reversedSequence.get = (function(key, notSetValue) {\n\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\n\t });\n\t reversedSequence.has = (function(key) {\n\t return iterable.has(useKeys ? key : -1 - key);\n\t });\n\t reversedSequence.contains = (function(value) {\n\t return iterable.contains(value);\n\t });\n\t reversedSequence.cacheResult = cacheResultThrough;\n\t reversedSequence.__iterate = function(fn, reverse) {\n\t var $__0 = this;\n\t return iterable.__iterate((function(v, k) {\n\t return fn(v, k, $__0);\n\t }), !reverse);\n\t };\n\t reversedSequence.__iterator = (function(type, reverse) {\n\t return iterable.__iterator(type, !reverse);\n\t });\n\t return reversedSequence;\n\t}\n\tfunction filterFactory(iterable, predicate, context, useKeys) {\n\t var filterSequence = makeSequence(iterable);\n\t if (useKeys) {\n\t filterSequence.has = (function(key) {\n\t var v = iterable.get(key, NOT_SET);\n\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n\t });\n\t filterSequence.get = (function(key, notSetValue) {\n\t var v = iterable.get(key, NOT_SET);\n\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\n\t });\n\t }\n\t filterSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k, c) {\n\t if (predicate.call(context, v, k, c)) {\n\t iterations++;\n\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t }\n\t }), reverse);\n\t return iterations;\n\t };\n\t filterSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t while (true) {\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t var key = entry[0];\n\t var value = entry[1];\n\t if (predicate.call(context, value, key, iterable)) {\n\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\n\t }\n\t }\n\t }));\n\t };\n\t return filterSequence;\n\t}\n\tfunction countByFactory(iterable, grouper, context) {\n\t var groups = Map().asMutable();\n\t iterable.__iterate((function(v, k) {\n\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\n\t return a + 1;\n\t }));\n\t }));\n\t return groups.asImmutable();\n\t}\n\tfunction groupByFactory(iterable, grouper, context) {\n\t var isKeyedIter = isKeyed(iterable);\n\t var groups = Map().asMutable();\n\t iterable.__iterate((function(v, k) {\n\t groups.update(grouper.call(context, v, k, iterable), [], (function(a) {\n\t return (a.push(isKeyedIter ? [k, v] : v), a);\n\t }));\n\t }));\n\t var coerce = iterableClass(iterable);\n\t return groups.map((function(arr) {\n\t return reify(iterable, coerce(arr));\n\t }));\n\t}\n\tfunction takeFactory(iterable, amount) {\n\t if (amount > iterable.size) {\n\t return iterable;\n\t }\n\t if (amount < 0) {\n\t amount = 0;\n\t }\n\t var takeSequence = makeSequence(iterable);\n\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\n\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (amount === 0) {\n\t return 0;\n\t }\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k) {\n\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\n\t }));\n\t return iterations;\n\t };\n\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = amount && iterable.__iterator(type, reverse);\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t if (iterations++ > amount) {\n\t return iteratorDone();\n\t }\n\t return iterator.next();\n\t }));\n\t };\n\t return takeSequence;\n\t}\n\tfunction takeWhileFactory(iterable, predicate, context) {\n\t var takeSequence = makeSequence(iterable);\n\t takeSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k, c) {\n\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\n\t }));\n\t return iterations;\n\t };\n\t takeSequence.__iteratorUncached = function(type, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t var iterating = true;\n\t return new Iterator((function() {\n\t if (!iterating) {\n\t return iteratorDone();\n\t }\n\t var step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t var entry = step.value;\n\t var k = entry[0];\n\t var v = entry[1];\n\t if (!predicate.call(context, v, k, $__0)) {\n\t iterating = false;\n\t return iteratorDone();\n\t }\n\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t }));\n\t };\n\t return takeSequence;\n\t}\n\tfunction skipFactory(iterable, amount, useKeys) {\n\t if (amount <= 0) {\n\t return iterable;\n\t }\n\t var skipSequence = makeSequence(iterable);\n\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\n\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var skipped = 0;\n\t var isSkipping = true;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k) {\n\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\n\t iterations++;\n\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t }\n\t }));\n\t return iterations;\n\t };\n\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = amount && iterable.__iterator(type, reverse);\n\t var skipped = 0;\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t while (skipped < amount) {\n\t skipped++;\n\t iterator.next();\n\t }\n\t var step = iterator.next();\n\t if (useKeys || type === ITERATE_VALUES) {\n\t return step;\n\t } else if (type === ITERATE_KEYS) {\n\t return iteratorValue(type, iterations++, undefined, step);\n\t } else {\n\t return iteratorValue(type, iterations++, step.value[1], step);\n\t }\n\t }));\n\t };\n\t return skipSequence;\n\t}\n\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\n\t var skipSequence = makeSequence(iterable);\n\t skipSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterate(fn, reverse);\n\t }\n\t var isSkipping = true;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k, c) {\n\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n\t iterations++;\n\t return fn(v, useKeys ? k : iterations - 1, $__0);\n\t }\n\t }));\n\t return iterations;\n\t };\n\t skipSequence.__iteratorUncached = function(type, reverse) {\n\t var $__0 = this;\n\t if (reverse) {\n\t return this.cacheResult().__iterator(type, reverse);\n\t }\n\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n\t var skipping = true;\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t var step,\n\t k,\n\t v;\n\t do {\n\t step = iterator.next();\n\t if (step.done) {\n\t if (useKeys || type === ITERATE_VALUES) {\n\t return step;\n\t } else if (type === ITERATE_KEYS) {\n\t return iteratorValue(type, iterations++, undefined, step);\n\t } else {\n\t return iteratorValue(type, iterations++, step.value[1], step);\n\t }\n\t }\n\t var entry = step.value;\n\t k = entry[0];\n\t v = entry[1];\n\t skipping && (skipping = predicate.call(context, v, k, $__0));\n\t } while (skipping);\n\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\n\t }));\n\t };\n\t return skipSequence;\n\t}\n\tfunction concatFactory(iterable, values) {\n\t var isKeyedIterable = isKeyed(iterable);\n\t var iters = new ArraySeq([iterable].concat(values)).map((function(v) {\n\t if (!isIterable(v)) {\n\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n\t } else if (isKeyedIterable) {\n\t v = KeyedIterable(v);\n\t }\n\t return v;\n\t }));\n\t if (isKeyedIterable) {\n\t iters = iters.toKeyedSeq();\n\t } else if (!isIndexed(iterable)) {\n\t iters = iters.toSetSeq();\n\t }\n\t var flat = iters.flatten(true);\n\t flat.size = iters.reduce((function(sum, seq) {\n\t if (sum !== undefined) {\n\t var size = seq.size;\n\t if (size !== undefined) {\n\t return sum + size;\n\t }\n\t }\n\t }), 0);\n\t return flat;\n\t}\n\tfunction flattenFactory(iterable, depth, useKeys) {\n\t var flatSequence = makeSequence(iterable);\n\t flatSequence.__iterateUncached = function(fn, reverse) {\n\t var iterations = 0;\n\t var stopped = false;\n\t function flatDeep(iter, currentDepth) {\n\t var $__0 = this;\n\t iter.__iterate((function(v, k) {\n\t if ((!depth || currentDepth < depth) && isIterable(v)) {\n\t flatDeep(v, currentDepth + 1);\n\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\n\t stopped = true;\n\t }\n\t return !stopped;\n\t }), reverse);\n\t }\n\t flatDeep(iterable, 0);\n\t return iterations;\n\t };\n\t flatSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(type, reverse);\n\t var stack = [];\n\t var iterations = 0;\n\t return new Iterator((function() {\n\t while (iterator) {\n\t var step = iterator.next();\n\t if (step.done !== false) {\n\t iterator = stack.pop();\n\t continue;\n\t }\n\t var v = step.value;\n\t if (type === ITERATE_ENTRIES) {\n\t v = v[1];\n\t }\n\t if ((!depth || stack.length < depth) && isIterable(v)) {\n\t stack.push(iterator);\n\t iterator = v.__iterator(type, reverse);\n\t } else {\n\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\n\t }\n\t }\n\t return iteratorDone();\n\t }));\n\t };\n\t return flatSequence;\n\t}\n\tfunction flatMapFactory(iterable, mapper, context) {\n\t var coerce = iterableClass(iterable);\n\t return iterable.toSeq().map((function(v, k) {\n\t return coerce(mapper.call(context, v, k, iterable));\n\t })).flatten(true);\n\t}\n\tfunction interposeFactory(iterable, separator) {\n\t var interposedSequence = makeSequence(iterable);\n\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\n\t interposedSequence.__iterateUncached = function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t iterable.__iterate((function(v, k) {\n\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\n\t }), reverse);\n\t return iterations;\n\t };\n\t interposedSequence.__iteratorUncached = function(type, reverse) {\n\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n\t var iterations = 0;\n\t var step;\n\t return new Iterator((function() {\n\t if (!step || iterations % 2) {\n\t step = iterator.next();\n\t if (step.done) {\n\t return step;\n\t }\n\t }\n\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\n\t }));\n\t };\n\t return interposedSequence;\n\t}\n\tfunction reify(iter, seq) {\n\t return isSeq(iter) ? seq : iter.constructor(seq);\n\t}\n\tfunction validateEntry(entry) {\n\t if (entry !== Object(entry)) {\n\t throw new TypeError('Expected [K, V] tuple: ' + entry);\n\t }\n\t}\n\tfunction resolveSize(iter) {\n\t assertNotInfinite(iter.size);\n\t return ensureSize(iter);\n\t}\n\tfunction iterableClass(iterable) {\n\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\n\t}\n\tfunction makeSequence(iterable) {\n\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\n\t}\n\tfunction cacheResultThrough() {\n\t if (this._iter.cacheResult) {\n\t this._iter.cacheResult();\n\t this.size = this._iter.size;\n\t return this;\n\t } else {\n\t return Seq.prototype.cacheResult.call(this);\n\t }\n\t}\n\tvar List = function List(value) {\n\t var empty = emptyList();\n\t if (value === null || value === undefined) {\n\t return empty;\n\t }\n\t if (isList(value)) {\n\t return value;\n\t }\n\t value = IndexedIterable(value);\n\t var size = value.size;\n\t if (size === 0) {\n\t return empty;\n\t }\n\t if (size > 0 && size < SIZE) {\n\t return makeList(0, size, SHIFT, null, new VNode(value.toArray()));\n\t }\n\t return empty.merge(value);\n\t};\n\t($traceurRuntime.createClass)(List, {\n\t toString: function() {\n\t return this.__toString('List [', ']');\n\t },\n\t get: function(index, notSetValue) {\n\t index = wrapIndex(this, index);\n\t if (index < 0 || index >= this.size) {\n\t return notSetValue;\n\t }\n\t index += this._origin;\n\t var node = listNodeFor(this, index);\n\t return node && node.array[index & MASK];\n\t },\n\t set: function(index, value) {\n\t return updateList(this, index, value);\n\t },\n\t remove: function(index) {\n\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = this._origin = this._capacity = 0;\n\t this._level = SHIFT;\n\t this._root = this._tail = null;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return emptyList();\n\t },\n\t push: function() {\n\t var values = arguments;\n\t var oldSize = this.size;\n\t return this.withMutations((function(list) {\n\t setListBounds(list, 0, oldSize + values.length);\n\t for (var ii = 0; ii < values.length; ii++) {\n\t list.set(oldSize + ii, values[ii]);\n\t }\n\t }));\n\t },\n\t pop: function() {\n\t return setListBounds(this, 0, -1);\n\t },\n\t unshift: function() {\n\t var values = arguments;\n\t return this.withMutations((function(list) {\n\t setListBounds(list, -values.length);\n\t for (var ii = 0; ii < values.length; ii++) {\n\t list.set(ii, values[ii]);\n\t }\n\t }));\n\t },\n\t shift: function() {\n\t return setListBounds(this, 1);\n\t },\n\t merge: function() {\n\t return mergeIntoListWith(this, undefined, arguments);\n\t },\n\t mergeWith: function(merger) {\n\t for (var iters = [],\n\t $__5 = 1; $__5 < arguments.length; $__5++)\n\t iters[$__5 - 1] = arguments[$__5];\n\t return mergeIntoListWith(this, merger, iters);\n\t },\n\t mergeDeep: function() {\n\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\n\t },\n\t mergeDeepWith: function(merger) {\n\t for (var iters = [],\n\t $__6 = 1; $__6 < arguments.length; $__6++)\n\t iters[$__6 - 1] = arguments[$__6];\n\t return mergeIntoListWith(this, deepMerger(merger), iters);\n\t },\n\t setSize: function(size) {\n\t return setListBounds(this, 0, size);\n\t },\n\t slice: function(begin, end) {\n\t var size = this.size;\n\t if (wholeSlice(begin, end, size)) {\n\t return this;\n\t }\n\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\n\t },\n\t __iterator: function(type, reverse) {\n\t return new ListIterator(this, type, reverse);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t var iterations = 0;\n\t var eachFn = (function(v) {\n\t return fn(v, iterations++, $__0);\n\t });\n\t var tailOffset = getTailOffset(this._capacity);\n\t if (reverse) {\n\t iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse) && iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse);\n\t } else {\n\t iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse) && iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse);\n\t }\n\t return iterations;\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t return this;\n\t }\n\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n\t }\n\t}, {of: function() {\n\t return this(arguments);\n\t }}, IndexedCollection);\n\tfunction isList(maybeList) {\n\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n\t}\n\tList.isList = isList;\n\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\tvar ListPrototype = List.prototype;\n\tListPrototype[IS_LIST_SENTINEL] = true;\n\tListPrototype[DELETE] = ListPrototype.remove;\n\tListPrototype.setIn = MapPrototype.setIn;\n\tListPrototype.removeIn = MapPrototype.removeIn;\n\tListPrototype.update = MapPrototype.update;\n\tListPrototype.updateIn = MapPrototype.updateIn;\n\tListPrototype.withMutations = MapPrototype.withMutations;\n\tListPrototype.asMutable = MapPrototype.asMutable;\n\tListPrototype.asImmutable = MapPrototype.asImmutable;\n\tListPrototype.wasAltered = MapPrototype.wasAltered;\n\tvar VNode = function VNode(array, ownerID) {\n\t this.array = array;\n\t this.ownerID = ownerID;\n\t};\n\tvar $VNode = VNode;\n\t($traceurRuntime.createClass)(VNode, {\n\t removeBefore: function(ownerID, level, index) {\n\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t return this;\n\t }\n\t var originIndex = (index >>> level) & MASK;\n\t if (originIndex >= this.array.length) {\n\t return new $VNode([], ownerID);\n\t }\n\t var removingFirst = originIndex === 0;\n\t var newChild;\n\t if (level > 0) {\n\t var oldChild = this.array[originIndex];\n\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n\t if (newChild === oldChild && removingFirst) {\n\t return this;\n\t }\n\t }\n\t if (removingFirst && !newChild) {\n\t return this;\n\t }\n\t var editable = editableVNode(this, ownerID);\n\t if (!removingFirst) {\n\t for (var ii = 0; ii < originIndex; ii++) {\n\t editable.array[ii] = undefined;\n\t }\n\t }\n\t if (newChild) {\n\t editable.array[originIndex] = newChild;\n\t }\n\t return editable;\n\t },\n\t removeAfter: function(ownerID, level, index) {\n\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\n\t return this;\n\t }\n\t var sizeIndex = ((index - 1) >>> level) & MASK;\n\t if (sizeIndex >= this.array.length) {\n\t return this;\n\t }\n\t var removingLast = sizeIndex === this.array.length - 1;\n\t var newChild;\n\t if (level > 0) {\n\t var oldChild = this.array[sizeIndex];\n\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n\t if (newChild === oldChild && removingLast) {\n\t return this;\n\t }\n\t }\n\t if (removingLast && !newChild) {\n\t return this;\n\t }\n\t var editable = editableVNode(this, ownerID);\n\t if (!removingLast) {\n\t editable.array.pop();\n\t }\n\t if (newChild) {\n\t editable.array[sizeIndex] = newChild;\n\t }\n\t return editable;\n\t }\n\t}, {});\n\tfunction iterateVNode(node, level, offset, max, fn, reverse) {\n\t var ii;\n\t var array = node && node.array;\n\t if (level === 0) {\n\t var from = offset < 0 ? -offset : 0;\n\t var to = max - offset;\n\t if (to > SIZE) {\n\t to = SIZE;\n\t }\n\t for (ii = from; ii < to; ii++) {\n\t if (fn(array && array[reverse ? from + to - 1 - ii : ii]) === false) {\n\t return false;\n\t }\n\t }\n\t } else {\n\t var step = 1 << level;\n\t var newLevel = level - SHIFT;\n\t for (ii = 0; ii <= MASK; ii++) {\n\t var levelIndex = reverse ? MASK - ii : ii;\n\t var newOffset = offset + (levelIndex << level);\n\t if (newOffset < max && newOffset + step > 0) {\n\t var nextNode = array && array[levelIndex];\n\t if (!iterateVNode(nextNode, newLevel, newOffset, max, fn, reverse)) {\n\t return false;\n\t }\n\t }\n\t }\n\t }\n\t return true;\n\t}\n\tvar ListIterator = function ListIterator(list, type, reverse) {\n\t this._type = type;\n\t this._reverse = !!reverse;\n\t this._maxIndex = list.size - 1;\n\t var tailOffset = getTailOffset(list._capacity);\n\t var rootStack = listIteratorFrame(list._root && list._root.array, list._level, -list._origin, tailOffset - list._origin - 1);\n\t var tailStack = listIteratorFrame(list._tail && list._tail.array, 0, tailOffset - list._origin, list._capacity - list._origin - 1);\n\t this._stack = reverse ? tailStack : rootStack;\n\t this._stack.__prev = reverse ? rootStack : tailStack;\n\t};\n\t($traceurRuntime.createClass)(ListIterator, {next: function() {\n\t var stack = this._stack;\n\t while (stack) {\n\t var array = stack.array;\n\t var rawIndex = stack.index++;\n\t if (this._reverse) {\n\t rawIndex = MASK - rawIndex;\n\t if (rawIndex > stack.rawMax) {\n\t rawIndex = stack.rawMax;\n\t stack.index = SIZE - rawIndex;\n\t }\n\t }\n\t if (rawIndex >= 0 && rawIndex < SIZE && rawIndex <= stack.rawMax) {\n\t var value = array && array[rawIndex];\n\t if (stack.level === 0) {\n\t var type = this._type;\n\t var index;\n\t if (type !== 1) {\n\t index = stack.offset + (rawIndex << stack.level);\n\t if (this._reverse) {\n\t index = this._maxIndex - index;\n\t }\n\t }\n\t return iteratorValue(type, index, value);\n\t } else {\n\t this._stack = stack = listIteratorFrame(value && value.array, stack.level - SHIFT, stack.offset + (rawIndex << stack.level), stack.max, stack);\n\t }\n\t continue;\n\t }\n\t stack = this._stack = this._stack.__prev;\n\t }\n\t return iteratorDone();\n\t }}, {}, Iterator);\n\tfunction listIteratorFrame(array, level, offset, max, prevFrame) {\n\t return {\n\t array: array,\n\t level: level,\n\t offset: offset,\n\t max: max,\n\t rawMax: ((max - offset) >> level),\n\t index: 0,\n\t __prev: prevFrame\n\t };\n\t}\n\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\n\t var list = Object.create(ListPrototype);\n\t list.size = capacity - origin;\n\t list._origin = origin;\n\t list._capacity = capacity;\n\t list._level = level;\n\t list._root = root;\n\t list._tail = tail;\n\t list.__ownerID = ownerID;\n\t list.__hash = hash;\n\t list.__altered = false;\n\t return list;\n\t}\n\tvar EMPTY_LIST;\n\tfunction emptyList() {\n\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n\t}\n\tfunction updateList(list, index, value) {\n\t index = wrapIndex(list, index);\n\t if (index >= list.size || index < 0) {\n\t return list.withMutations((function(list) {\n\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\n\t }));\n\t }\n\t index += list._origin;\n\t var newTail = list._tail;\n\t var newRoot = list._root;\n\t var didAlter = MakeRef(DID_ALTER);\n\t if (index >= getTailOffset(list._capacity)) {\n\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n\t } else {\n\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n\t }\n\t if (!didAlter.value) {\n\t return list;\n\t }\n\t if (list.__ownerID) {\n\t list._root = newRoot;\n\t list._tail = newTail;\n\t list.__hash = undefined;\n\t list.__altered = true;\n\t return list;\n\t }\n\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n\t}\n\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\n\t var idx = (index >>> level) & MASK;\n\t var nodeHas = node && idx < node.array.length;\n\t if (!nodeHas && value === undefined) {\n\t return node;\n\t }\n\t var newNode;\n\t if (level > 0) {\n\t var lowerNode = node && node.array[idx];\n\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n\t if (newLowerNode === lowerNode) {\n\t return node;\n\t }\n\t newNode = editableVNode(node, ownerID);\n\t newNode.array[idx] = newLowerNode;\n\t return newNode;\n\t }\n\t if (nodeHas && node.array[idx] === value) {\n\t return node;\n\t }\n\t SetRef(didAlter);\n\t newNode = editableVNode(node, ownerID);\n\t if (value === undefined && idx === newNode.array.length - 1) {\n\t newNode.array.pop();\n\t } else {\n\t newNode.array[idx] = value;\n\t }\n\t return newNode;\n\t}\n\tfunction editableVNode(node, ownerID) {\n\t if (ownerID && node && ownerID === node.ownerID) {\n\t return node;\n\t }\n\t return new VNode(node ? node.array.slice() : [], ownerID);\n\t}\n\tfunction listNodeFor(list, rawIndex) {\n\t if (rawIndex >= getTailOffset(list._capacity)) {\n\t return list._tail;\n\t }\n\t if (rawIndex < 1 << (list._level + SHIFT)) {\n\t var node = list._root;\n\t var level = list._level;\n\t while (node && level > 0) {\n\t node = node.array[(rawIndex >>> level) & MASK];\n\t level -= SHIFT;\n\t }\n\t return node;\n\t }\n\t}\n\tfunction setListBounds(list, begin, end) {\n\t var owner = list.__ownerID || new OwnerID();\n\t var oldOrigin = list._origin;\n\t var oldCapacity = list._capacity;\n\t var newOrigin = oldOrigin + begin;\n\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n\t return list;\n\t }\n\t if (newOrigin >= newCapacity) {\n\t return list.clear();\n\t }\n\t var newLevel = list._level;\n\t var newRoot = list._root;\n\t var offsetShift = 0;\n\t while (newOrigin + offsetShift < 0) {\n\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n\t newLevel += SHIFT;\n\t offsetShift += 1 << newLevel;\n\t }\n\t if (offsetShift) {\n\t newOrigin += offsetShift;\n\t oldOrigin += offsetShift;\n\t newCapacity += offsetShift;\n\t oldCapacity += offsetShift;\n\t }\n\t var oldTailOffset = getTailOffset(oldCapacity);\n\t var newTailOffset = getTailOffset(newCapacity);\n\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n\t newLevel += SHIFT;\n\t }\n\t var oldTail = list._tail;\n\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n\t newRoot = editableVNode(newRoot, owner);\n\t var node = newRoot;\n\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n\t var idx = (oldTailOffset >>> level) & MASK;\n\t node = node.array[idx] = editableVNode(node.array[idx], owner);\n\t }\n\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n\t }\n\t if (newCapacity < oldCapacity) {\n\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n\t }\n\t if (newOrigin >= newTailOffset) {\n\t newOrigin -= newTailOffset;\n\t newCapacity -= newTailOffset;\n\t newLevel = SHIFT;\n\t newRoot = null;\n\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n\t offsetShift = 0;\n\t while (newRoot) {\n\t var beginIndex = (newOrigin >>> newLevel) & MASK;\n\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n\t break;\n\t }\n\t if (beginIndex) {\n\t offsetShift += (1 << newLevel) * beginIndex;\n\t }\n\t newLevel -= SHIFT;\n\t newRoot = newRoot.array[beginIndex];\n\t }\n\t if (newRoot && newOrigin > oldOrigin) {\n\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n\t }\n\t if (newRoot && newTailOffset < oldTailOffset) {\n\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n\t }\n\t if (offsetShift) {\n\t newOrigin -= offsetShift;\n\t newCapacity -= offsetShift;\n\t }\n\t }\n\t if (list.__ownerID) {\n\t list.size = newCapacity - newOrigin;\n\t list._origin = newOrigin;\n\t list._capacity = newCapacity;\n\t list._level = newLevel;\n\t list._root = newRoot;\n\t list._tail = newTail;\n\t list.__hash = undefined;\n\t list.__altered = true;\n\t return list;\n\t }\n\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n\t}\n\tfunction mergeIntoListWith(list, merger, iterables) {\n\t var iters = [];\n\t var maxSize = 0;\n\t for (var ii = 0; ii < iterables.length; ii++) {\n\t var value = iterables[ii];\n\t var iter = IndexedIterable(value);\n\t if (iter.size > maxSize) {\n\t maxSize = iter.size;\n\t }\n\t if (!isIterable(value)) {\n\t iter = iter.map((function(v) {\n\t return fromJS(v);\n\t }));\n\t }\n\t iters.push(iter);\n\t }\n\t if (maxSize > list.size) {\n\t list = list.setSize(maxSize);\n\t }\n\t return mergeIntoCollectionWith(list, merger, iters);\n\t}\n\tfunction getTailOffset(size) {\n\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n\t}\n\tvar Stack = function Stack(value) {\n\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\n\t};\n\tvar $Stack = Stack;\n\t($traceurRuntime.createClass)(Stack, {\n\t toString: function() {\n\t return this.__toString('Stack [', ']');\n\t },\n\t get: function(index, notSetValue) {\n\t var head = this._head;\n\t while (head && index--) {\n\t head = head.next;\n\t }\n\t return head ? head.value : notSetValue;\n\t },\n\t peek: function() {\n\t return this._head && this._head.value;\n\t },\n\t push: function() {\n\t if (arguments.length === 0) {\n\t return this;\n\t }\n\t var newSize = this.size + arguments.length;\n\t var head = this._head;\n\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\n\t head = {\n\t value: arguments[ii],\n\t next: head\n\t };\n\t }\n\t if (this.__ownerID) {\n\t this.size = newSize;\n\t this._head = head;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return makeStack(newSize, head);\n\t },\n\t pushAll: function(iter) {\n\t iter = IndexedIterable(iter);\n\t if (iter.size === 0) {\n\t return this;\n\t }\n\t var newSize = this.size;\n\t var head = this._head;\n\t iter.reverse().forEach((function(value) {\n\t newSize++;\n\t head = {\n\t value: value,\n\t next: head\n\t };\n\t }));\n\t if (this.__ownerID) {\n\t this.size = newSize;\n\t this._head = head;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return makeStack(newSize, head);\n\t },\n\t pop: function() {\n\t return this.slice(1);\n\t },\n\t unshift: function() {\n\t return this.push.apply(this, arguments);\n\t },\n\t unshiftAll: function(iter) {\n\t return this.pushAll(iter);\n\t },\n\t shift: function() {\n\t return this.pop.apply(this, arguments);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._head = undefined;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return emptyStack();\n\t },\n\t slice: function(begin, end) {\n\t if (wholeSlice(begin, end, this.size)) {\n\t return this;\n\t }\n\t var resolvedBegin = resolveBegin(begin, this.size);\n\t var resolvedEnd = resolveEnd(end, this.size);\n\t if (resolvedEnd !== this.size) {\n\t return $traceurRuntime.superCall(this, $Stack.prototype, \"slice\", [begin, end]);\n\t }\n\t var newSize = this.size - resolvedBegin;\n\t var head = this._head;\n\t while (resolvedBegin--) {\n\t head = head.next;\n\t }\n\t if (this.__ownerID) {\n\t this.size = newSize;\n\t this._head = head;\n\t this.__hash = undefined;\n\t this.__altered = true;\n\t return this;\n\t }\n\t return makeStack(newSize, head);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this.__altered = false;\n\t return this;\n\t }\n\t return makeStack(this.size, this._head, ownerID, this.__hash);\n\t },\n\t __iterate: function(fn, reverse) {\n\t if (reverse) {\n\t return this.toSeq().cacheResult.__iterate(fn, reverse);\n\t }\n\t var iterations = 0;\n\t var node = this._head;\n\t while (node) {\n\t if (fn(node.value, iterations++, this) === false) {\n\t break;\n\t }\n\t node = node.next;\n\t }\n\t return iterations;\n\t },\n\t __iterator: function(type, reverse) {\n\t if (reverse) {\n\t return this.toSeq().cacheResult().__iterator(type, reverse);\n\t }\n\t var iterations = 0;\n\t var node = this._head;\n\t return new Iterator((function() {\n\t if (node) {\n\t var value = node.value;\n\t node = node.next;\n\t return iteratorValue(type, iterations++, value);\n\t }\n\t return iteratorDone();\n\t }));\n\t }\n\t}, {of: function() {\n\t return this(arguments);\n\t }}, IndexedCollection);\n\tfunction isStack(maybeStack) {\n\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n\t}\n\tStack.isStack = isStack;\n\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\tvar StackPrototype = Stack.prototype;\n\tStackPrototype[IS_STACK_SENTINEL] = true;\n\tStackPrototype.withMutations = MapPrototype.withMutations;\n\tStackPrototype.asMutable = MapPrototype.asMutable;\n\tStackPrototype.asImmutable = MapPrototype.asImmutable;\n\tStackPrototype.wasAltered = MapPrototype.wasAltered;\n\tfunction makeStack(size, head, ownerID, hash) {\n\t var map = Object.create(StackPrototype);\n\t map.size = size;\n\t map._head = head;\n\t map.__ownerID = ownerID;\n\t map.__hash = hash;\n\t map.__altered = false;\n\t return map;\n\t}\n\tvar EMPTY_STACK;\n\tfunction emptyStack() {\n\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n\t}\n\tvar Set = function Set(value) {\n\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().union(value);\n\t};\n\t($traceurRuntime.createClass)(Set, {\n\t toString: function() {\n\t return this.__toString('Set {', '}');\n\t },\n\t has: function(value) {\n\t return this._map.has(value);\n\t },\n\t add: function(value) {\n\t var newMap = this._map.set(value, true);\n\t if (this.__ownerID) {\n\t this.size = newMap.size;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return newMap === this._map ? this : makeSet(newMap);\n\t },\n\t remove: function(value) {\n\t var newMap = this._map.remove(value);\n\t if (this.__ownerID) {\n\t this.size = newMap.size;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return newMap === this._map ? this : newMap.size === 0 ? emptySet() : makeSet(newMap);\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._map.clear();\n\t return this;\n\t }\n\t return emptySet();\n\t },\n\t union: function() {\n\t var iters = arguments;\n\t if (iters.length === 0) {\n\t return this;\n\t }\n\t return this.withMutations((function(set) {\n\t for (var ii = 0; ii < iters.length; ii++) {\n\t SetIterable(iters[ii]).forEach((function(value) {\n\t return set.add(value);\n\t }));\n\t }\n\t }));\n\t },\n\t intersect: function() {\n\t for (var iters = [],\n\t $__7 = 0; $__7 < arguments.length; $__7++)\n\t iters[$__7] = arguments[$__7];\n\t if (iters.length === 0) {\n\t return this;\n\t }\n\t iters = iters.map((function(iter) {\n\t return SetIterable(iter);\n\t }));\n\t var originalSet = this;\n\t return this.withMutations((function(set) {\n\t originalSet.forEach((function(value) {\n\t if (!iters.every((function(iter) {\n\t return iter.contains(value);\n\t }))) {\n\t set.remove(value);\n\t }\n\t }));\n\t }));\n\t },\n\t subtract: function() {\n\t for (var iters = [],\n\t $__8 = 0; $__8 < arguments.length; $__8++)\n\t iters[$__8] = arguments[$__8];\n\t if (iters.length === 0) {\n\t return this;\n\t }\n\t iters = iters.map((function(iter) {\n\t return SetIterable(iter);\n\t }));\n\t var originalSet = this;\n\t return this.withMutations((function(set) {\n\t originalSet.forEach((function(value) {\n\t if (iters.some((function(iter) {\n\t return iter.contains(value);\n\t }))) {\n\t set.remove(value);\n\t }\n\t }));\n\t }));\n\t },\n\t merge: function() {\n\t return this.union.apply(this, arguments);\n\t },\n\t mergeWith: function(merger) {\n\t for (var iters = [],\n\t $__9 = 1; $__9 < arguments.length; $__9++)\n\t iters[$__9 - 1] = arguments[$__9];\n\t return this.union.apply(this, iters);\n\t },\n\t wasAltered: function() {\n\t return this._map.wasAltered();\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._map.__iterate((function(_, k) {\n\t return fn(k, k, $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t return this._map.map((function(_, k) {\n\t return k;\n\t })).__iterator(type, reverse);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t var newMap = this._map.__ensureOwner(ownerID);\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return makeSet(newMap, ownerID);\n\t }\n\t}, {\n\t of: function() {\n\t return this(arguments);\n\t },\n\t fromKeys: function(value) {\n\t return this(KeyedSeq(value).flip().valueSeq());\n\t }\n\t}, SetCollection);\n\tfunction isSet(maybeSet) {\n\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n\t}\n\tSet.isSet = isSet;\n\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\tvar SetPrototype = Set.prototype;\n\tSetPrototype[IS_SET_SENTINEL] = true;\n\tSetPrototype[DELETE] = SetPrototype.remove;\n\tSetPrototype.mergeDeep = SetPrototype.merge;\n\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n\tSetPrototype.withMutations = MapPrototype.withMutations;\n\tSetPrototype.asMutable = MapPrototype.asMutable;\n\tSetPrototype.asImmutable = MapPrototype.asImmutable;\n\tfunction makeSet(map, ownerID) {\n\t var set = Object.create(SetPrototype);\n\t set.size = map ? map.size : 0;\n\t set._map = map;\n\t set.__ownerID = ownerID;\n\t return set;\n\t}\n\tvar EMPTY_SET;\n\tfunction emptySet() {\n\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n\t}\n\tvar OrderedMap = function OrderedMap(value) {\n\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().merge(KeyedIterable(value));\n\t};\n\t($traceurRuntime.createClass)(OrderedMap, {\n\t toString: function() {\n\t return this.__toString('OrderedMap {', '}');\n\t },\n\t get: function(k, notSetValue) {\n\t var index = this._map.get(k);\n\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\n\t },\n\t clear: function() {\n\t if (this.size === 0) {\n\t return this;\n\t }\n\t if (this.__ownerID) {\n\t this.size = 0;\n\t this._map.clear();\n\t this._list.clear();\n\t return this;\n\t }\n\t return emptyOrderedMap();\n\t },\n\t set: function(k, v) {\n\t return updateOrderedMap(this, k, v);\n\t },\n\t remove: function(k) {\n\t return updateOrderedMap(this, k, NOT_SET);\n\t },\n\t wasAltered: function() {\n\t return this._map.wasAltered() || this._list.wasAltered();\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return this._list.__iterate((function(entry) {\n\t return entry && fn(entry[1], entry[0], $__0);\n\t }), reverse);\n\t },\n\t __iterator: function(type, reverse) {\n\t return this._list.fromEntrySeq().__iterator(type, reverse);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t var newMap = this._map.__ensureOwner(ownerID);\n\t var newList = this._list.__ensureOwner(ownerID);\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this._map = newMap;\n\t this._list = newList;\n\t return this;\n\t }\n\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n\t }\n\t}, {of: function() {\n\t return this(arguments);\n\t }}, Map);\n\tfunction isOrderedMap(maybeOrderedMap) {\n\t return !!(maybeOrderedMap && maybeOrderedMap[IS_ORDERED_MAP_SENTINEL]);\n\t}\n\tOrderedMap.isOrderedMap = isOrderedMap;\n\tvar IS_ORDERED_MAP_SENTINEL = '@@__IMMUTABLE_ORDERED_MAP__@@';\n\tOrderedMap.prototype[IS_ORDERED_MAP_SENTINEL] = true;\n\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\tfunction makeOrderedMap(map, list, ownerID, hash) {\n\t var omap = Object.create(OrderedMap.prototype);\n\t omap.size = map ? map.size : 0;\n\t omap._map = map;\n\t omap._list = list;\n\t omap.__ownerID = ownerID;\n\t omap.__hash = hash;\n\t return omap;\n\t}\n\tvar EMPTY_ORDERED_MAP;\n\tfunction emptyOrderedMap() {\n\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n\t}\n\tfunction updateOrderedMap(omap, k, v) {\n\t var map = omap._map;\n\t var list = omap._list;\n\t var i = map.get(k);\n\t var has = i !== undefined;\n\t var removed = v === NOT_SET;\n\t if ((!has && removed) || (has && v === list.get(i)[1])) {\n\t return omap;\n\t }\n\t if (!has) {\n\t i = list.size;\n\t }\n\t var newMap = removed ? map.remove(k) : has ? map : map.set(k, i);\n\t var newList = removed ? list.set(i, undefined) : list.set(i, [k, v]);\n\t if (omap.__ownerID) {\n\t omap.size = newMap.size;\n\t omap._map = newMap;\n\t omap._list = newList;\n\t omap.__hash = undefined;\n\t return omap;\n\t }\n\t return makeOrderedMap(newMap, newList);\n\t}\n\tvar Record = function Record(defaultValues, name) {\n\t var RecordType = function Record(values) {\n\t if (!(this instanceof RecordType)) {\n\t return new RecordType(values);\n\t }\n\t this._map = Map(values);\n\t };\n\t var keys = Object.keys(defaultValues);\n\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n\t RecordTypePrototype.constructor = RecordType;\n\t name && (RecordTypePrototype._name = name);\n\t RecordTypePrototype._defaultValues = defaultValues;\n\t RecordTypePrototype._keys = keys;\n\t RecordTypePrototype.size = keys.length;\n\t try {\n\t keys.forEach((function(key) {\n\t Object.defineProperty(RecordType.prototype, key, {\n\t get: function() {\n\t return this.get(key);\n\t },\n\t set: function(value) {\n\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\n\t this.set(key, value);\n\t }\n\t });\n\t }));\n\t } catch (error) {}\n\t return RecordType;\n\t};\n\t($traceurRuntime.createClass)(Record, {\n\t toString: function() {\n\t return this.__toString(recordName(this) + ' {', '}');\n\t },\n\t has: function(k) {\n\t return this._defaultValues.hasOwnProperty(k);\n\t },\n\t get: function(k, notSetValue) {\n\t if (notSetValue !== undefined && !this.has(k)) {\n\t return notSetValue;\n\t }\n\t var defaultVal = this._defaultValues[k];\n\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\n\t },\n\t clear: function() {\n\t if (this.__ownerID) {\n\t this._map && this._map.clear();\n\t return this;\n\t }\n\t var SuperRecord = Object.getPrototypeOf(this).constructor;\n\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\n\t },\n\t set: function(k, v) {\n\t if (!this.has(k)) {\n\t throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n\t }\n\t var newMap = this._map && this._map.set(k, v);\n\t if (this.__ownerID || newMap === this._map) {\n\t return this;\n\t }\n\t return makeRecord(this, newMap);\n\t },\n\t remove: function(k) {\n\t if (!this.has(k)) {\n\t return this;\n\t }\n\t var newMap = this._map && this._map.remove(k);\n\t if (this.__ownerID || newMap === this._map) {\n\t return this;\n\t }\n\t return makeRecord(this, newMap);\n\t },\n\t wasAltered: function() {\n\t return this._map.wasAltered();\n\t },\n\t __iterator: function(type, reverse) {\n\t var $__0 = this;\n\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t return $__0.get(k);\n\t })).__iterator(type, reverse);\n\t },\n\t __iterate: function(fn, reverse) {\n\t var $__0 = this;\n\t return KeyedIterable(this._defaultValues).map((function(_, k) {\n\t return $__0.get(k);\n\t })).__iterate(fn, reverse);\n\t },\n\t __ensureOwner: function(ownerID) {\n\t if (ownerID === this.__ownerID) {\n\t return this;\n\t }\n\t var newMap = this._map && this._map.__ensureOwner(ownerID);\n\t if (!ownerID) {\n\t this.__ownerID = ownerID;\n\t this._map = newMap;\n\t return this;\n\t }\n\t return makeRecord(this, newMap, ownerID);\n\t }\n\t}, {}, KeyedCollection);\n\tvar RecordPrototype = Record.prototype;\n\tRecordPrototype[DELETE] = RecordPrototype.remove;\n\tRecordPrototype.merge = MapPrototype.merge;\n\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\n\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n\tRecordPrototype.update = MapPrototype.update;\n\tRecordPrototype.updateIn = MapPrototype.updateIn;\n\tRecordPrototype.withMutations = MapPrototype.withMutations;\n\tRecordPrototype.asMutable = MapPrototype.asMutable;\n\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\n\tfunction makeRecord(likeRecord, map, ownerID) {\n\t var record = Object.create(Object.getPrototypeOf(likeRecord));\n\t record._map = map;\n\t record.__ownerID = ownerID;\n\t return record;\n\t}\n\tfunction recordName(record) {\n\t return record._name || record.constructor.name;\n\t}\n\tvar Range = function Range(start, end, step) {\n\t if (!(this instanceof $Range)) {\n\t return new $Range(start, end, step);\n\t }\n\t invariant(step !== 0, 'Cannot step a Range by 0');\n\t start = start || 0;\n\t if (end === undefined) {\n\t end = Infinity;\n\t }\n\t if (start === end && __EMPTY_RANGE) {\n\t return __EMPTY_RANGE;\n\t }\n\t step = step === undefined ? 1 : Math.abs(step);\n\t if (end < start) {\n\t step = -step;\n\t }\n\t this._start = start;\n\t this._end = end;\n\t this._step = step;\n\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n\t};\n\tvar $Range = Range;\n\t($traceurRuntime.createClass)(Range, {\n\t toString: function() {\n\t if (this.size === 0) {\n\t return 'Range []';\n\t }\n\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\n\t },\n\t get: function(index, notSetValue) {\n\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\n\t },\n\t contains: function(searchValue) {\n\t var possibleIndex = (searchValue - this._start) / this._step;\n\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\n\t },\n\t slice: function(begin, end) {\n\t if (wholeSlice(begin, end, this.size)) {\n\t return this;\n\t }\n\t begin = resolveBegin(begin, this.size);\n\t end = resolveEnd(end, this.size);\n\t if (end <= begin) {\n\t return __EMPTY_RANGE;\n\t }\n\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n\t },\n\t indexOf: function(searchValue) {\n\t var offsetValue = searchValue - this._start;\n\t if (offsetValue % this._step === 0) {\n\t var index = offsetValue / this._step;\n\t if (index >= 0 && index < this.size) {\n\t return index;\n\t }\n\t }\n\t return -1;\n\t },\n\t lastIndexOf: function(searchValue) {\n\t return this.indexOf(searchValue);\n\t },\n\t take: function(amount) {\n\t return this.slice(0, Math.max(0, amount));\n\t },\n\t skip: function(amount) {\n\t return this.slice(Math.max(0, amount));\n\t },\n\t __iterate: function(fn, reverse) {\n\t var maxIndex = this.size - 1;\n\t var step = this._step;\n\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t for (var ii = 0; ii <= maxIndex; ii++) {\n\t if (fn(value, ii, this) === false) {\n\t return ii + 1;\n\t }\n\t value += reverse ? -step : step;\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var maxIndex = this.size - 1;\n\t var step = this._step;\n\t var value = reverse ? this._start + maxIndex * step : this._start;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t var v = value;\n\t value += reverse ? -step : step;\n\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n\t }));\n\t },\n\t __deepEquals: function(other) {\n\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : $traceurRuntime.superCall(this, $Range.prototype, \"__deepEquals\", [other]);\n\t }\n\t}, {}, IndexedSeq);\n\tvar RangePrototype = Range.prototype;\n\tRangePrototype.__toJS = RangePrototype.toArray;\n\tRangePrototype.first = ListPrototype.first;\n\tRangePrototype.last = ListPrototype.last;\n\tvar __EMPTY_RANGE = Range(0, 0);\n\tvar Repeat = function Repeat(value, times) {\n\t if (times <= 0 && EMPTY_REPEAT) {\n\t return EMPTY_REPEAT;\n\t }\n\t if (!(this instanceof $Repeat)) {\n\t return new $Repeat(value, times);\n\t }\n\t this._value = value;\n\t this.size = times === undefined ? Infinity : Math.max(0, times);\n\t if (this.size === 0) {\n\t EMPTY_REPEAT = this;\n\t }\n\t};\n\tvar $Repeat = Repeat;\n\t($traceurRuntime.createClass)(Repeat, {\n\t toString: function() {\n\t if (this.size === 0) {\n\t return 'Repeat []';\n\t }\n\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n\t },\n\t get: function(index, notSetValue) {\n\t return this.has(index) ? this._value : notSetValue;\n\t },\n\t contains: function(searchValue) {\n\t return is(this._value, searchValue);\n\t },\n\t slice: function(begin, end) {\n\t var size = this.size;\n\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n\t },\n\t reverse: function() {\n\t return this;\n\t },\n\t indexOf: function(searchValue) {\n\t if (is(this._value, searchValue)) {\n\t return 0;\n\t }\n\t return -1;\n\t },\n\t lastIndexOf: function(searchValue) {\n\t if (is(this._value, searchValue)) {\n\t return this.size;\n\t }\n\t return -1;\n\t },\n\t __iterate: function(fn, reverse) {\n\t for (var ii = 0; ii < this.size; ii++) {\n\t if (fn(this._value, ii, this) === false) {\n\t return ii + 1;\n\t }\n\t }\n\t return ii;\n\t },\n\t __iterator: function(type, reverse) {\n\t var $__0 = this;\n\t var ii = 0;\n\t return new Iterator((function() {\n\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\n\t }));\n\t },\n\t __deepEquals: function(other) {\n\t return other instanceof $Repeat ? is(this._value, other._value) : $traceurRuntime.superCall(this, $Repeat.prototype, \"__deepEquals\", [other]);\n\t }\n\t}, {}, IndexedSeq);\n\tvar RepeatPrototype = Repeat.prototype;\n\tRepeatPrototype.last = RepeatPrototype.first;\n\tRepeatPrototype.has = RangePrototype.has;\n\tRepeatPrototype.take = RangePrototype.take;\n\tRepeatPrototype.skip = RangePrototype.skip;\n\tRepeatPrototype.__toJS = RangePrototype.__toJS;\n\tvar EMPTY_REPEAT;\n\tvar Immutable = {\n\t Iterable: Iterable,\n\t Seq: Seq,\n\t Collection: Collection,\n\t Map: Map,\n\t List: List,\n\t Stack: Stack,\n\t Set: Set,\n\t OrderedMap: OrderedMap,\n\t Record: Record,\n\t Range: Range,\n\t Repeat: Repeat,\n\t is: is,\n\t fromJS: fromJS\n\t};\n\n\t return Immutable;\n\t}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function r(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function FooBar() {\n // TODO: implement this module\n}","function n(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function n(t){return!!t.constructor&&\"function\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}","function Module() {}","function Module() {}","function Module() {}","function Module() {}","function Module() {}","function Module() {}","patch() {\n }","function v8(v9,v10) {\n const v16 = [1337,1337];\n // v16 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v17 = [\"536870912\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\n // v17 = .object(ofGroup: Array, withProperties: [\"length\", \"__proto__\", \"constructor\"], withMethods: [\"concat\", \"fill\", \"indexOf\", \"entries\", \"forEach\", \"find\", \"reverse\", \"slice\", \"flat\", \"reduce\", \"join\", \"findIndex\", \"reduceRight\", \"some\", \"copyWithin\", \"toString\", \"pop\", \"filter\", \"map\", \"splice\", \"keys\", \"unshift\", \"sort\", \"includes\", \"flatMap\", \"shift\", \"values\", \"every\", \"toLocaleString\", \"push\", \"lastIndexOf\"])\n const v18 = {constructor:13.37,e:v16};\n // v18 = .object(ofGroup: Object, withProperties: [\"constructor\", \"e\", \"__proto__\"])\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\n // v19 = .object(ofGroup: Object, withProperties: [\"d\", \"b\", \"a\", \"__proto__\", \"e\", \"constructor\", \"length\"])\n const v21 = new Float64Array(v19);\n // v21 = .object(ofGroup: Float64Array, withProperties: [\"byteOffset\", \"constructor\", \"buffer\", \"__proto__\", \"byteLength\", \"length\"], withMethods: [\"map\", \"values\", \"subarray\", \"find\", \"fill\", \"set\", \"findIndex\", \"some\", \"reduceRight\", \"reverse\", \"join\", \"includes\", \"entries\", \"reduce\", \"every\", \"copyWithin\", \"sort\", \"forEach\", \"lastIndexOf\", \"indexOf\", \"filter\", \"slice\", \"keys\"])\n v6[6] = v7;\n v7.toString = v9;\n }","function Utils() {}","function Utils() {}","function o(e){return!!e.constructor&&\"function\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}","function c() {}","constructor( ) {}","function main() {\n}","use(fn) {}","function FooRule() {\n}","initialize() {}","initialize() {}","initialize() {}","initialize() {}","initialize() {}","initialize() {}","function test() {\n var o35 = Object.getOwnPropertyDescriptor(Object.prototype, \"__proto__\").function(o1, o2)\n{\n var o3 = 0;\n var o4 = 0;\n try {\nfor (var o5 = 1; o5 < 10000; o5++)\n {\n try {\no3 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0x3FFFF;\n}catch(e){}\n try {\no2.o3 = o3 + o4;\n}catch(e){}\n try {\no4 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0xFFFF;\n}catch(e){}\n }\n}catch(e){}\n try {\nreturn o3 + o4;\n}catch(e){}\n};\n function o1() {\n }\n var o2 = ((o863 & 0x4000) >> Object.o157) | ((o863 & 0x40) >> 6);\n var o38 = o839.o906.o917(o308);\n var o6 = Array('Math.ceil((' + target + ')/');\n var o867 = this.o543[0x200 | (o768 >> 4)];\n var o8 = o1(\"willValidate\");\n try {\no21 = function () {\n try {\no337++;\n}catch(e){}\n };\n}catch(e){}\n try {\ntry { o1(\"MSGestureEvent\"); } catch(e) {}try { try {\no1(\"setImmediate\");\n}catch(e){} } catch(e) {}\n}catch(e){}\n try {\n({ o9: !o3.call(o2, o1, '!') });\n}catch(e){}\n try {\nif (o0 != 2)\n try {\nprint(\"FAIL\");\n}catch(e){}\n else\n try {\nprint(\"PASS\");\n}catch(e){}\n}catch(e){}\n}","function Bevy() {}","function hc(){return hc=Object.assign?Object.assign.bind():function(e){for(var t=1;t=0;d--)(n=e[d])&&(r=(i<3?n(r):i>3?n(t,a,r):n(t,a))||r);return i>3&&r&&Object.defineProperty(t,a,r),r\\n/**\\n * @license\\n * Copyright 2016 Google Inc.\\n *\\n * Permission is hereby granted, free of charge, to any person obtaining a copy\\n * of this software and associated documentation files (the \\\"Software\\\"), to deal\\n * in the Software without restriction, including without limitation the rights\\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\\n * copies of the Software, and to permit persons to whom the Software is\\n * furnished to do so, subject to the following conditions:\\n *\\n * The above copyright notice and this permission notice shall be included in\\n * all copies or substantial portions of the Software.\\n *\\n * THE SOFTWARE IS PROVIDED \\\"AS IS\\\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\\n * THE SOFTWARE.\\n */}\",\n \"function n(r){return!!r.constructor&&typeof r.constructor.isBuffer==\\\"function\\\"&&r.constructor.isBuffer(r)}\",\n \"function Generator() {} // 80\",\n \"function r() {}\",\n \"function r() {}\",\n \"function r() {}\",\n \"function i(e){var t=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),n=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),r=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),i=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),a=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),s=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),c=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),d=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),f=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),m=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),v=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),y=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),g=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),_=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),b=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),w=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),T=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),E=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),S=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(n),x=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(e),k=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),C=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),A=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),N=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x),I=function(e){function t(){return(0,l.default)(this,t),(0,p.default)(this,(t.__proto__||(0,u.default)(t)).apply(this,arguments))}return(0,h.default)(t,e),t}(x);(0,o.default)(e,{0:t,NetworkOrCORSError:t,400:n,BadRequest:n,401:r,Unauthorized:r,402:i,PaymentRequired:i,403:a,Forbidden:a,404:s,NotFound:s,405:c,MethodNotAllowed:c,406:d,NotAcceptable:d,407:f,ProxyAuthenticationRequired:f,408:m,RequestTimeout:m,409:v,Conflict:v,410:y,Gone:y,411:g,LengthRequired:g,412:_,PreconditionFailed:_,413:b,RequestEntityTooLarge:b,414:w,RequestUriTooLong:w,415:T,UnsupportedMediaType:T,416:E,RequestRangeNotSatisfiable:E,417:S,ExpectationFailed:S,500:x,InternalServerError:x,501:k,NotImplemented:k,502:C,BadGateway:C,503:A,ServiceUnavailable:A,504:N,GatewayTimeout:N,505:I,HttpVersionNotSupported:I,select:function(t){if(void 0===t||null===t)return e;t=t.statusCode||t;var n=e[t];return n||(t=t.toString().split(\\\"\\\").shift()+\\\"00\\\",t=parseInt(t,10),e[t]||e)}})}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function t(n){return!!n.constructor&&typeof n.constructor.isBuffer==\\\"function\\\"&&n.constructor.isBuffer(n)}\",\n \"function y(e){let t=R,n=D,r=j,s=v,i=M,o=B,a=_,u=new Uint8Array(x.slice(0,R)),d=E,c=E.slice(0,E.length),g=F,l=Y,p=e();return R=t,D=n,j=r,v=s,M=i,B=o,_=a,x=u,Y=l,E=d,E.splice(0,E.length,...c),F=g,P=new DataView(x.buffer,x.byteOffset,x.byteLength),p}\",\n \"function Generator() {} // 84\",\n \"function require() { return {}; }\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(){}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function r(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function Util() {}\",\n \"function n(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function lt(t,i){return t(i={exports:{}},i.exports),i.exports}\",\n \"function c(e,t,n){Array.isArray(e)?(n=t,t=e,e=void 0):\\\"string\\\"!=typeof e&&(n=e,e=t=void 0),t&&!Array.isArray(t)&&(n=t,t=void 0),t||(t=[\\\"require\\\",\\\"exports\\\",\\\"module\\\"]),\\n//Set up properties for this module. If an ID, then use\\n//internal cache. If no ID, then use the external variables\\n//for this node module.\\ne?\\n//Put the module in deep freeze until there is a\\n//require call for it.\\nd[e]=[e,t,n]:l(e,t,n)}\",\n \"private public function m246() {}\",\n \"function t(e){return!!e.constructor&&'function'==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function universalModule() {\\n\\t\\t var $Object = Object;\\n\\n\\t\\tfunction createClass(ctor, methods, staticMethods, superClass) {\\n\\t\\t var proto;\\n\\t\\t if (superClass) {\\n\\t\\t var superProto = superClass.prototype;\\n\\t\\t proto = $Object.create(superProto);\\n\\t\\t } else {\\n\\t\\t proto = ctor.prototype;\\n\\t\\t }\\n\\t\\t $Object.keys(methods).forEach(function (key) {\\n\\t\\t proto[key] = methods[key];\\n\\t\\t });\\n\\t\\t $Object.keys(staticMethods).forEach(function (key) {\\n\\t\\t ctor[key] = staticMethods[key];\\n\\t\\t });\\n\\t\\t proto.constructor = ctor;\\n\\t\\t ctor.prototype = proto;\\n\\t\\t return ctor;\\n\\t\\t}\\n\\n\\t\\tfunction superCall(self, proto, name, args) {\\n\\t\\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\\n\\t\\t}\\n\\n\\t\\tfunction defaultSuperCall(self, proto, args) {\\n\\t\\t superCall(self, proto, 'constructor', args);\\n\\t\\t}\\n\\n\\t\\tvar $traceurRuntime = {};\\n\\t\\t$traceurRuntime.createClass = createClass;\\n\\t\\t$traceurRuntime.superCall = superCall;\\n\\t\\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\\n\\t\\t\\\"use strict\\\";\\n\\t\\tfunction is(valueA, valueB) {\\n\\t\\t if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t if (!valueA || !valueB) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t if (typeof valueA.valueOf === 'function' && typeof valueB.valueOf === 'function') {\\n\\t\\t valueA = valueA.valueOf();\\n\\t\\t valueB = valueB.valueOf();\\n\\t\\t }\\n\\t\\t return typeof valueA.equals === 'function' && typeof valueB.equals === 'function' ? valueA.equals(valueB) : valueA === valueB || (valueA !== valueA && valueB !== valueB);\\n\\t\\t}\\n\\t\\tfunction invariant(condition, error) {\\n\\t\\t if (!condition)\\n\\t\\t throw new Error(error);\\n\\t\\t}\\n\\t\\tvar DELETE = 'delete';\\n\\t\\tvar SHIFT = 5;\\n\\t\\tvar SIZE = 1 << SHIFT;\\n\\t\\tvar MASK = SIZE - 1;\\n\\t\\tvar NOT_SET = {};\\n\\t\\tvar CHANGE_LENGTH = {value: false};\\n\\t\\tvar DID_ALTER = {value: false};\\n\\t\\tfunction MakeRef(ref) {\\n\\t\\t ref.value = false;\\n\\t\\t return ref;\\n\\t\\t}\\n\\t\\tfunction SetRef(ref) {\\n\\t\\t ref && (ref.value = true);\\n\\t\\t}\\n\\t\\tfunction OwnerID() {}\\n\\t\\tfunction arrCopy(arr, offset) {\\n\\t\\t offset = offset || 0;\\n\\t\\t var len = Math.max(0, arr.length - offset);\\n\\t\\t var newArr = new Array(len);\\n\\t\\t for (var ii = 0; ii < len; ii++) {\\n\\t\\t newArr[ii] = arr[ii + offset];\\n\\t\\t }\\n\\t\\t return newArr;\\n\\t\\t}\\n\\t\\tfunction assertNotInfinite(size) {\\n\\t\\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\\n\\t\\t}\\n\\t\\tfunction ensureSize(iter) {\\n\\t\\t if (iter.size === undefined) {\\n\\t\\t iter.size = iter.__iterate(returnTrue);\\n\\t\\t }\\n\\t\\t return iter.size;\\n\\t\\t}\\n\\t\\tfunction wrapIndex(iter, index) {\\n\\t\\t return index >= 0 ? (+index) : ensureSize(iter) + (+index);\\n\\t\\t}\\n\\t\\tfunction returnTrue() {\\n\\t\\t return true;\\n\\t\\t}\\n\\t\\tfunction wholeSlice(begin, end, size) {\\n\\t\\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\\n\\t\\t}\\n\\t\\tfunction resolveBegin(begin, size) {\\n\\t\\t return resolveIndex(begin, size, 0);\\n\\t\\t}\\n\\t\\tfunction resolveEnd(end, size) {\\n\\t\\t return resolveIndex(end, size, size);\\n\\t\\t}\\n\\t\\tfunction resolveIndex(index, size, defaultIndex) {\\n\\t\\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\\n\\t\\t}\\n\\t\\tvar imul = typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ? Math.imul : function imul(a, b) {\\n\\t\\t a = a | 0;\\n\\t\\t b = b | 0;\\n\\t\\t var c = a & 0xffff;\\n\\t\\t var d = b & 0xffff;\\n\\t\\t return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0;\\n\\t\\t};\\n\\t\\tfunction smi(i32) {\\n\\t\\t return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\\n\\t\\t}\\n\\t\\tfunction hash(o) {\\n\\t\\t if (o === false || o === null || o === undefined) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t if (typeof o.valueOf === 'function') {\\n\\t\\t o = o.valueOf();\\n\\t\\t if (o === false || o === null || o === undefined) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (o === true) {\\n\\t\\t return 1;\\n\\t\\t }\\n\\t\\t var type = typeof o;\\n\\t\\t if (type === 'number') {\\n\\t\\t var h = o | 0;\\n\\t\\t while (o > 0xFFFFFFFF) {\\n\\t\\t o /= 0xFFFFFFFF;\\n\\t\\t h ^= o;\\n\\t\\t }\\n\\t\\t return smi(h);\\n\\t\\t }\\n\\t\\t if (type === 'string') {\\n\\t\\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\\n\\t\\t }\\n\\t\\t if (typeof o.hashCode === 'function') {\\n\\t\\t return o.hashCode();\\n\\t\\t }\\n\\t\\t return hashJSObj(o);\\n\\t\\t}\\n\\t\\tfunction cachedHashString(string) {\\n\\t\\t var hash = stringHashCache[string];\\n\\t\\t if (hash === undefined) {\\n\\t\\t hash = hashString(string);\\n\\t\\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\\n\\t\\t STRING_HASH_CACHE_SIZE = 0;\\n\\t\\t stringHashCache = {};\\n\\t\\t }\\n\\t\\t STRING_HASH_CACHE_SIZE++;\\n\\t\\t stringHashCache[string] = hash;\\n\\t\\t }\\n\\t\\t return hash;\\n\\t\\t}\\n\\t\\tfunction hashString(string) {\\n\\t\\t var hash = 0;\\n\\t\\t for (var ii = 0; ii < string.length; ii++) {\\n\\t\\t hash = 31 * hash + string.charCodeAt(ii) | 0;\\n\\t\\t }\\n\\t\\t return smi(hash);\\n\\t\\t}\\n\\t\\tfunction hashJSObj(obj) {\\n\\t\\t var hash = weakMap && weakMap.get(obj);\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t hash = obj[UID_HASH_KEY];\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t if (!canDefineProperty) {\\n\\t\\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t hash = getIENodeHash(obj);\\n\\t\\t if (hash)\\n\\t\\t return hash;\\n\\t\\t }\\n\\t\\t if (Object.isExtensible && !Object.isExtensible(obj)) {\\n\\t\\t throw new Error('Non-extensible objects are not allowed as keys.');\\n\\t\\t }\\n\\t\\t hash = ++objHashUID;\\n\\t\\t if (objHashUID & 0x40000000) {\\n\\t\\t objHashUID = 0;\\n\\t\\t }\\n\\t\\t if (weakMap) {\\n\\t\\t weakMap.set(obj, hash);\\n\\t\\t } else if (canDefineProperty) {\\n\\t\\t Object.defineProperty(obj, UID_HASH_KEY, {\\n\\t\\t 'enumerable': false,\\n\\t\\t 'configurable': false,\\n\\t\\t 'writable': false,\\n\\t\\t 'value': hash\\n\\t\\t });\\n\\t\\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\\n\\t\\t obj.propertyIsEnumerable = function() {\\n\\t\\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\\n\\t\\t };\\n\\t\\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\\n\\t\\t } else if (obj.nodeType) {\\n\\t\\t obj[UID_HASH_KEY] = hash;\\n\\t\\t } else {\\n\\t\\t throw new Error('Unable to set a non-enumerable property on object.');\\n\\t\\t }\\n\\t\\t return hash;\\n\\t\\t}\\n\\t\\tvar canDefineProperty = (function() {\\n\\t\\t try {\\n\\t\\t Object.defineProperty({}, 'x', {});\\n\\t\\t return true;\\n\\t\\t } catch (e) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t}());\\n\\t\\tfunction getIENodeHash(node) {\\n\\t\\t if (node && node.nodeType > 0) {\\n\\t\\t switch (node.nodeType) {\\n\\t\\t case 1:\\n\\t\\t return node.uniqueID;\\n\\t\\t case 9:\\n\\t\\t return node.documentElement && node.documentElement.uniqueID;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t}\\n\\t\\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\\n\\t\\tvar objHashUID = 0;\\n\\t\\tvar UID_HASH_KEY = '__immutablehash__';\\n\\t\\tif (typeof Symbol === 'function') {\\n\\t\\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\\n\\t\\t}\\n\\t\\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\\n\\t\\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\\n\\t\\tvar STRING_HASH_CACHE_SIZE = 0;\\n\\t\\tvar stringHashCache = {};\\n\\t\\tvar ITERATE_KEYS = 0;\\n\\t\\tvar ITERATE_VALUES = 1;\\n\\t\\tvar ITERATE_ENTRIES = 2;\\n\\t\\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\\n\\t\\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\\n\\t\\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\\n\\t\\tvar Iterator = function Iterator(next) {\\n\\t\\t this.next = next;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Iterator, {toString: function() {\\n\\t\\t return '[Iterator]';\\n\\t\\t }}, {});\\n\\t\\tIterator.KEYS = ITERATE_KEYS;\\n\\t\\tIterator.VALUES = ITERATE_VALUES;\\n\\t\\tIterator.ENTRIES = ITERATE_ENTRIES;\\n\\t\\tvar IteratorPrototype = Iterator.prototype;\\n\\t\\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\\n\\t\\t return this.toString();\\n\\t\\t};\\n\\t\\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\\n\\t\\t return this;\\n\\t\\t};\\n\\t\\tfunction iteratorValue(type, k, v, iteratorResult) {\\n\\t\\t var value = type === 0 ? k : type === 1 ? v : [k, v];\\n\\t\\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\\n\\t\\t value: value,\\n\\t\\t done: false\\n\\t\\t });\\n\\t\\t return iteratorResult;\\n\\t\\t}\\n\\t\\tfunction iteratorDone() {\\n\\t\\t return {\\n\\t\\t value: undefined,\\n\\t\\t done: true\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction hasIterator(maybeIterable) {\\n\\t\\t return !!_iteratorFn(maybeIterable);\\n\\t\\t}\\n\\t\\tfunction isIterator(maybeIterator) {\\n\\t\\t return maybeIterator && typeof maybeIterator.next === 'function';\\n\\t\\t}\\n\\t\\tfunction getIterator(iterable) {\\n\\t\\t var iteratorFn = _iteratorFn(iterable);\\n\\t\\t return iteratorFn && iteratorFn.call(iterable);\\n\\t\\t}\\n\\t\\tfunction _iteratorFn(iterable) {\\n\\t\\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\\n\\t\\t if (typeof iteratorFn === 'function') {\\n\\t\\t return iteratorFn;\\n\\t\\t }\\n\\t\\t}\\n\\t\\tvar Iterable = function Iterable(value) {\\n\\t\\t return isIterable(value) ? value : Seq(value);\\n\\t\\t};\\n\\t\\tvar $Iterable = Iterable;\\n\\t\\t($traceurRuntime.createClass)(Iterable, {\\n\\t\\t toArray: function() {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var array = new Array(this.size || 0);\\n\\t\\t this.valueSeq().__iterate((function(v, i) {\\n\\t\\t array[i] = v;\\n\\t\\t }));\\n\\t\\t return array;\\n\\t\\t },\\n\\t\\t toIndexedSeq: function() {\\n\\t\\t return new ToIndexedSequence(this);\\n\\t\\t },\\n\\t\\t toJS: function() {\\n\\t\\t return this.toSeq().map((function(value) {\\n\\t\\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\\n\\t\\t })).__toJS();\\n\\t\\t },\\n\\t\\t toKeyedSeq: function() {\\n\\t\\t return new ToKeyedSequence(this, true);\\n\\t\\t },\\n\\t\\t toMap: function() {\\n\\t\\t return Map(this.toKeyedSeq());\\n\\t\\t },\\n\\t\\t toObject: function() {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var object = {};\\n\\t\\t this.__iterate((function(v, k) {\\n\\t\\t object[k] = v;\\n\\t\\t }));\\n\\t\\t return object;\\n\\t\\t },\\n\\t\\t toOrderedMap: function() {\\n\\t\\t return OrderedMap(this.toKeyedSeq());\\n\\t\\t },\\n\\t\\t toOrderedSet: function() {\\n\\t\\t return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toSet: function() {\\n\\t\\t return Set(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toSetSeq: function() {\\n\\t\\t return new ToSetSequence(this);\\n\\t\\t },\\n\\t\\t toSeq: function() {\\n\\t\\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\\n\\t\\t },\\n\\t\\t toStack: function() {\\n\\t\\t return Stack(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toList: function() {\\n\\t\\t return List(isKeyed(this) ? this.valueSeq() : this);\\n\\t\\t },\\n\\t\\t toString: function() {\\n\\t\\t return '[Iterable]';\\n\\t\\t },\\n\\t\\t __toString: function(head, tail) {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return head + tail;\\n\\t\\t }\\n\\t\\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\\n\\t\\t },\\n\\t\\t concat: function() {\\n\\t\\t for (var values = [],\\n\\t\\t $__2 = 0; $__2 < arguments.length; $__2++)\\n\\t\\t values[$__2] = arguments[$__2];\\n\\t\\t return reify(this, concatFactory(this, values));\\n\\t\\t },\\n\\t\\t contains: function(searchValue) {\\n\\t\\t return this.some((function(value) {\\n\\t\\t return is(value, searchValue);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t entries: function() {\\n\\t\\t return this.__iterator(ITERATE_ENTRIES);\\n\\t\\t },\\n\\t\\t every: function(predicate, context) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var returnValue = true;\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (!predicate.call(context, v, k, c)) {\\n\\t\\t returnValue = false;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return returnValue;\\n\\t\\t },\\n\\t\\t filter: function(predicate, context) {\\n\\t\\t return reify(this, filterFactory(this, predicate, context, true));\\n\\t\\t },\\n\\t\\t find: function(predicate, context, notSetValue) {\\n\\t\\t var foundValue = notSetValue;\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (predicate.call(context, v, k, c)) {\\n\\t\\t foundValue = v;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return foundValue;\\n\\t\\t },\\n\\t\\t forEach: function(sideEffect, context) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\\n\\t\\t },\\n\\t\\t join: function(separator) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t separator = separator !== undefined ? '' + separator : ',';\\n\\t\\t var joined = '';\\n\\t\\t var isFirst = true;\\n\\t\\t this.__iterate((function(v) {\\n\\t\\t isFirst ? (isFirst = false) : (joined += separator);\\n\\t\\t joined += v !== null && v !== undefined ? v : '';\\n\\t\\t }));\\n\\t\\t return joined;\\n\\t\\t },\\n\\t\\t keys: function() {\\n\\t\\t return this.__iterator(ITERATE_KEYS);\\n\\t\\t },\\n\\t\\t map: function(mapper, context) {\\n\\t\\t return reify(this, mapFactory(this, mapper, context));\\n\\t\\t },\\n\\t\\t reduce: function(reducer, initialReduction, context) {\\n\\t\\t assertNotInfinite(this.size);\\n\\t\\t var reduction;\\n\\t\\t var useFirst;\\n\\t\\t if (arguments.length < 2) {\\n\\t\\t useFirst = true;\\n\\t\\t } else {\\n\\t\\t reduction = initialReduction;\\n\\t\\t }\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (useFirst) {\\n\\t\\t useFirst = false;\\n\\t\\t reduction = v;\\n\\t\\t } else {\\n\\t\\t reduction = reducer.call(context, reduction, v, k, c);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return reduction;\\n\\t\\t },\\n\\t\\t reduceRight: function(reducer, initialReduction, context) {\\n\\t\\t var reversed = this.toKeyedSeq().reverse();\\n\\t\\t return reversed.reduce.apply(reversed, arguments);\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t return reify(this, reverseFactory(this, true));\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t if (wholeSlice(begin, end, this.size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t\\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\\n\\t\\t return this.toSeq().cacheResult().slice(begin, end);\\n\\t\\t }\\n\\t\\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\\n\\t\\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\\n\\t\\t },\\n\\t\\t some: function(predicate, context) {\\n\\t\\t return !this.every(not(predicate), context);\\n\\t\\t },\\n\\t\\t sort: function(comparator) {\\n\\t\\t return reify(this, sortFactory(this, comparator));\\n\\t\\t },\\n\\t\\t values: function() {\\n\\t\\t return this.__iterator(ITERATE_VALUES);\\n\\t\\t },\\n\\t\\t butLast: function() {\\n\\t\\t return this.slice(0, -1);\\n\\t\\t },\\n\\t\\t count: function(predicate, context) {\\n\\t\\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\\n\\t\\t },\\n\\t\\t countBy: function(grouper, context) {\\n\\t\\t return countByFactory(this, grouper, context);\\n\\t\\t },\\n\\t\\t equals: function(other) {\\n\\t\\t return deepEqual(this, other);\\n\\t\\t },\\n\\t\\t entrySeq: function() {\\n\\t\\t var iterable = this;\\n\\t\\t if (iterable._cache) {\\n\\t\\t return new ArraySeq(iterable._cache);\\n\\t\\t }\\n\\t\\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\\n\\t\\t entriesSequence.fromEntrySeq = (function() {\\n\\t\\t return iterable.toSeq();\\n\\t\\t });\\n\\t\\t return entriesSequence;\\n\\t\\t },\\n\\t\\t filterNot: function(predicate, context) {\\n\\t\\t return this.filter(not(predicate), context);\\n\\t\\t },\\n\\t\\t findLast: function(predicate, context, notSetValue) {\\n\\t\\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\\n\\t\\t },\\n\\t\\t first: function() {\\n\\t\\t return this.find(returnTrue);\\n\\t\\t },\\n\\t\\t flatMap: function(mapper, context) {\\n\\t\\t return reify(this, flatMapFactory(this, mapper, context));\\n\\t\\t },\\n\\t\\t flatten: function(depth) {\\n\\t\\t return reify(this, flattenFactory(this, depth, true));\\n\\t\\t },\\n\\t\\t fromEntrySeq: function() {\\n\\t\\t return new FromEntriesSequence(this);\\n\\t\\t },\\n\\t\\t get: function(searchKey, notSetValue) {\\n\\t\\t return this.find((function(_, key) {\\n\\t\\t return is(key, searchKey);\\n\\t\\t }), undefined, notSetValue);\\n\\t\\t },\\n\\t\\t getIn: function(searchKeyPath, notSetValue) {\\n\\t\\t var nested = this;\\n\\t\\t if (searchKeyPath) {\\n\\t\\t var iter = getIterator(searchKeyPath) || getIterator($Iterable(searchKeyPath));\\n\\t\\t var step;\\n\\t\\t while (!(step = iter.next()).done) {\\n\\t\\t var key = step.value;\\n\\t\\t nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\\n\\t\\t if (nested === NOT_SET) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return nested;\\n\\t\\t },\\n\\t\\t groupBy: function(grouper, context) {\\n\\t\\t return groupByFactory(this, grouper, context);\\n\\t\\t },\\n\\t\\t has: function(searchKey) {\\n\\t\\t return this.get(searchKey, NOT_SET) !== NOT_SET;\\n\\t\\t },\\n\\t\\t hasIn: function(searchKeyPath) {\\n\\t\\t return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\\n\\t\\t },\\n\\t\\t isSubset: function(iter) {\\n\\t\\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\\n\\t\\t return this.every((function(value) {\\n\\t\\t return iter.contains(value);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t isSuperset: function(iter) {\\n\\t\\t return iter.isSubset(this);\\n\\t\\t },\\n\\t\\t keySeq: function() {\\n\\t\\t return this.toSeq().map(keyMapper).toIndexedSeq();\\n\\t\\t },\\n\\t\\t last: function() {\\n\\t\\t return this.toSeq().reverse().first();\\n\\t\\t },\\n\\t\\t max: function(comparator) {\\n\\t\\t return maxFactory(this, comparator);\\n\\t\\t },\\n\\t\\t maxBy: function(mapper, comparator) {\\n\\t\\t return maxFactory(this, comparator, mapper);\\n\\t\\t },\\n\\t\\t min: function(comparator) {\\n\\t\\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\\n\\t\\t },\\n\\t\\t minBy: function(mapper, comparator) {\\n\\t\\t return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\\n\\t\\t },\\n\\t\\t rest: function() {\\n\\t\\t return this.slice(1);\\n\\t\\t },\\n\\t\\t skip: function(amount) {\\n\\t\\t return reify(this, skipFactory(this, amount, true));\\n\\t\\t },\\n\\t\\t skipLast: function(amount) {\\n\\t\\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\\n\\t\\t },\\n\\t\\t skipWhile: function(predicate, context) {\\n\\t\\t return reify(this, skipWhileFactory(this, predicate, context, true));\\n\\t\\t },\\n\\t\\t skipUntil: function(predicate, context) {\\n\\t\\t return this.skipWhile(not(predicate), context);\\n\\t\\t },\\n\\t\\t sortBy: function(mapper, comparator) {\\n\\t\\t return reify(this, sortFactory(this, comparator, mapper));\\n\\t\\t },\\n\\t\\t take: function(amount) {\\n\\t\\t return reify(this, takeFactory(this, amount));\\n\\t\\t },\\n\\t\\t takeLast: function(amount) {\\n\\t\\t return reify(this, this.toSeq().reverse().take(amount).reverse());\\n\\t\\t },\\n\\t\\t takeWhile: function(predicate, context) {\\n\\t\\t return reify(this, takeWhileFactory(this, predicate, context));\\n\\t\\t },\\n\\t\\t takeUntil: function(predicate, context) {\\n\\t\\t return this.takeWhile(not(predicate), context);\\n\\t\\t },\\n\\t\\t valueSeq: function() {\\n\\t\\t return this.toIndexedSeq();\\n\\t\\t },\\n\\t\\t hashCode: function() {\\n\\t\\t return this.__hash || (this.__hash = hashIterable(this));\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\\n\\t\\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\\n\\t\\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\\n\\t\\tvar IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\\n\\t\\tvar IterablePrototype = Iterable.prototype;\\n\\t\\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\\n\\t\\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\\n\\t\\tIterablePrototype.toJSON = IterablePrototype.toJS;\\n\\t\\tIterablePrototype.__toJS = IterablePrototype.toArray;\\n\\t\\tIterablePrototype.__toStringMapper = quoteString;\\n\\t\\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\\n\\t\\t return this.toString();\\n\\t\\t};\\n\\t\\tIterablePrototype.chain = IterablePrototype.flatMap;\\n\\t\\t(function() {\\n\\t\\t try {\\n\\t\\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\\n\\t\\t if (!Iterable.noLengthWarning) {\\n\\t\\t var stack;\\n\\t\\t try {\\n\\t\\t throw new Error();\\n\\t\\t } catch (error) {\\n\\t\\t stack = error.stack;\\n\\t\\t }\\n\\t\\t if (stack.indexOf('_wrapObject') === -1) {\\n\\t\\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\\n\\t\\t return this.size;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }});\\n\\t\\t } catch (e) {}\\n\\t\\t})();\\n\\t\\tvar KeyedIterable = function KeyedIterable(value) {\\n\\t\\t return isKeyed(value) ? value : KeyedSeq(value);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(KeyedIterable, {\\n\\t\\t flip: function() {\\n\\t\\t return reify(this, flipFactory(this));\\n\\t\\t },\\n\\t\\t findKey: function(predicate, context) {\\n\\t\\t var foundKey;\\n\\t\\t this.__iterate((function(v, k, c) {\\n\\t\\t if (predicate.call(context, v, k, c)) {\\n\\t\\t foundKey = k;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return foundKey;\\n\\t\\t },\\n\\t\\t findLastKey: function(predicate, context) {\\n\\t\\t return this.toSeq().reverse().findKey(predicate, context);\\n\\t\\t },\\n\\t\\t keyOf: function(searchValue) {\\n\\t\\t return this.findKey((function(value) {\\n\\t\\t return is(value, searchValue);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t lastKeyOf: function(searchValue) {\\n\\t\\t return this.toSeq().reverse().keyOf(searchValue);\\n\\t\\t },\\n\\t\\t mapEntries: function(mapper, context) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t return reify(this, this.toSeq().map((function(v, k) {\\n\\t\\t return mapper.call(context, [k, v], iterations++, $__0);\\n\\t\\t })).fromEntrySeq());\\n\\t\\t },\\n\\t\\t mapKeys: function(mapper, context) {\\n\\t\\t var $__0 = this;\\n\\t\\t return reify(this, this.toSeq().flip().map((function(k, v) {\\n\\t\\t return mapper.call(context, k, v, $__0);\\n\\t\\t })).flip());\\n\\t\\t }\\n\\t\\t}, {}, Iterable);\\n\\t\\tvar KeyedIterablePrototype = KeyedIterable.prototype;\\n\\t\\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\\n\\t\\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\\n\\t\\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\\n\\t\\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\\n\\t\\t return k + ': ' + quoteString(v);\\n\\t\\t});\\n\\t\\tvar IndexedIterable = function IndexedIterable(value) {\\n\\t\\t return isIndexed(value) ? value : IndexedSeq(value);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(IndexedIterable, {\\n\\t\\t toKeyedSeq: function() {\\n\\t\\t return new ToKeyedSequence(this, false);\\n\\t\\t },\\n\\t\\t filter: function(predicate, context) {\\n\\t\\t return reify(this, filterFactory(this, predicate, context, false));\\n\\t\\t },\\n\\t\\t findIndex: function(predicate, context) {\\n\\t\\t var key = this.toKeyedSeq().findKey(predicate, context);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t indexOf: function(searchValue) {\\n\\t\\t var key = this.toKeyedSeq().keyOf(searchValue);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t lastIndexOf: function(searchValue) {\\n\\t\\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t return reify(this, reverseFactory(this, false));\\n\\t\\t },\\n\\t\\t splice: function(index, removeNum) {\\n\\t\\t var numArgs = arguments.length;\\n\\t\\t removeNum = Math.max(removeNum | 0, 0);\\n\\t\\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t index = resolveBegin(index, this.size);\\n\\t\\t var spliced = this.slice(0, index);\\n\\t\\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\\n\\t\\t },\\n\\t\\t findLastIndex: function(predicate, context) {\\n\\t\\t var key = this.toKeyedSeq().findLastKey(predicate, context);\\n\\t\\t return key === undefined ? -1 : key;\\n\\t\\t },\\n\\t\\t first: function() {\\n\\t\\t return this.get(0);\\n\\t\\t },\\n\\t\\t flatten: function(depth) {\\n\\t\\t return reify(this, flattenFactory(this, depth, false));\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\\n\\t\\t return key === index;\\n\\t\\t }), undefined, notSetValue);\\n\\t\\t },\\n\\t\\t has: function(index) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\\n\\t\\t },\\n\\t\\t interpose: function(separator) {\\n\\t\\t return reify(this, interposeFactory(this, separator));\\n\\t\\t },\\n\\t\\t last: function() {\\n\\t\\t return this.get(-1);\\n\\t\\t },\\n\\t\\t skip: function(amount) {\\n\\t\\t var iter = this;\\n\\t\\t var skipSeq = skipFactory(iter, amount, false);\\n\\t\\t if (isSeq(iter) && skipSeq !== iter) {\\n\\t\\t skipSeq.get = function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\\n\\t\\t };\\n\\t\\t }\\n\\t\\t return reify(this, skipSeq);\\n\\t\\t },\\n\\t\\t skipWhile: function(predicate, context) {\\n\\t\\t return reify(this, skipWhileFactory(this, predicate, context, false));\\n\\t\\t },\\n\\t\\t take: function(amount) {\\n\\t\\t var iter = this;\\n\\t\\t var takeSeq = takeFactory(iter, amount);\\n\\t\\t if (isSeq(iter) && takeSeq !== iter) {\\n\\t\\t takeSeq.get = function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\\n\\t\\t };\\n\\t\\t }\\n\\t\\t return reify(this, takeSeq);\\n\\t\\t }\\n\\t\\t}, {}, Iterable);\\n\\t\\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\\n\\t\\tIndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tvar SetIterable = function SetIterable(value) {\\n\\t\\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(SetIterable, {\\n\\t\\t get: function(value, notSetValue) {\\n\\t\\t return this.has(value) ? value : notSetValue;\\n\\t\\t },\\n\\t\\t contains: function(value) {\\n\\t\\t return this.has(value);\\n\\t\\t },\\n\\t\\t keySeq: function() {\\n\\t\\t return this.valueSeq();\\n\\t\\t }\\n\\t\\t}, {}, Iterable);\\n\\t\\tSetIterable.prototype.has = IterablePrototype.contains;\\n\\t\\tfunction isIterable(maybeIterable) {\\n\\t\\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\\n\\t\\t}\\n\\t\\tfunction isKeyed(maybeKeyed) {\\n\\t\\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\\n\\t\\t}\\n\\t\\tfunction isIndexed(maybeIndexed) {\\n\\t\\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\\n\\t\\t}\\n\\t\\tfunction isAssociative(maybeAssociative) {\\n\\t\\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\\n\\t\\t}\\n\\t\\tfunction isOrdered(maybeOrdered) {\\n\\t\\t return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\\n\\t\\t}\\n\\t\\tIterable.isIterable = isIterable;\\n\\t\\tIterable.isKeyed = isKeyed;\\n\\t\\tIterable.isIndexed = isIndexed;\\n\\t\\tIterable.isAssociative = isAssociative;\\n\\t\\tIterable.isOrdered = isOrdered;\\n\\t\\tIterable.Keyed = KeyedIterable;\\n\\t\\tIterable.Indexed = IndexedIterable;\\n\\t\\tIterable.Set = SetIterable;\\n\\t\\tIterable.Iterator = Iterator;\\n\\t\\tfunction keyMapper(v, k) {\\n\\t\\t return k;\\n\\t\\t}\\n\\t\\tfunction entryMapper(v, k) {\\n\\t\\t return [k, v];\\n\\t\\t}\\n\\t\\tfunction not(predicate) {\\n\\t\\t return function() {\\n\\t\\t return !predicate.apply(this, arguments);\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction neg(predicate) {\\n\\t\\t return function() {\\n\\t\\t return -predicate.apply(this, arguments);\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction quoteString(value) {\\n\\t\\t return typeof value === 'string' ? JSON.stringify(value) : value;\\n\\t\\t}\\n\\t\\tfunction defaultNegComparator(a, b) {\\n\\t\\t return a < b ? 1 : a > b ? -1 : 0;\\n\\t\\t}\\n\\t\\tfunction deepEqual(a, b) {\\n\\t\\t if (a === b) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t if (!isIterable(b) || a.size !== undefined && b.size !== undefined && a.size !== b.size || a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash || isKeyed(a) !== isKeyed(b) || isIndexed(a) !== isIndexed(b) || isOrdered(a) !== isOrdered(b)) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t if (a.size === 0 && b.size === 0) {\\n\\t\\t return true;\\n\\t\\t }\\n\\t\\t var notAssociative = !isAssociative(a);\\n\\t\\t if (isOrdered(a)) {\\n\\t\\t var entries = a.entries();\\n\\t\\t return b.every((function(v, k) {\\n\\t\\t var entry = entries.next().value;\\n\\t\\t return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\\n\\t\\t })) && entries.next().done;\\n\\t\\t }\\n\\t\\t var flipped = false;\\n\\t\\t if (a.size === undefined) {\\n\\t\\t if (b.size === undefined) {\\n\\t\\t a.cacheResult();\\n\\t\\t } else {\\n\\t\\t flipped = true;\\n\\t\\t var _ = a;\\n\\t\\t a = b;\\n\\t\\t b = _;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var allEqual = true;\\n\\t\\t var bSize = b.__iterate((function(v, k) {\\n\\t\\t if (notAssociative ? !a.has(v) : flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\\n\\t\\t allEqual = false;\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return allEqual && a.size === bSize;\\n\\t\\t}\\n\\t\\tfunction hashIterable(iterable) {\\n\\t\\t if (iterable.size === Infinity) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t var ordered = isOrdered(iterable);\\n\\t\\t var keyed = isKeyed(iterable);\\n\\t\\t var h = ordered ? 1 : 0;\\n\\t\\t var size = iterable.__iterate(keyed ? ordered ? (function(v, k) {\\n\\t\\t h = 31 * h + hashMerge(hash(v), hash(k)) | 0;\\n\\t\\t }) : (function(v, k) {\\n\\t\\t h = h + hashMerge(hash(v), hash(k)) | 0;\\n\\t\\t }) : ordered ? (function(v) {\\n\\t\\t h = 31 * h + hash(v) | 0;\\n\\t\\t }) : (function(v) {\\n\\t\\t h = h + hash(v) | 0;\\n\\t\\t }));\\n\\t\\t return murmurHashOfSize(size, h);\\n\\t\\t}\\n\\t\\tfunction murmurHashOfSize(size, h) {\\n\\t\\t h = imul(h, 0xCC9E2D51);\\n\\t\\t h = imul(h << 15 | h >>> -15, 0x1B873593);\\n\\t\\t h = imul(h << 13 | h >>> -13, 5);\\n\\t\\t h = (h + 0xE6546B64 | 0) ^ size;\\n\\t\\t h = imul(h ^ h >>> 16, 0x85EBCA6B);\\n\\t\\t h = imul(h ^ h >>> 13, 0xC2B2AE35);\\n\\t\\t h = smi(h ^ h >>> 16);\\n\\t\\t return h;\\n\\t\\t}\\n\\t\\tfunction hashMerge(a, b) {\\n\\t\\t return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0;\\n\\t\\t}\\n\\t\\tfunction mixin(ctor, methods) {\\n\\t\\t var proto = ctor.prototype;\\n\\t\\t var keyCopier = (function(key) {\\n\\t\\t proto[key] = methods[key];\\n\\t\\t });\\n\\t\\t Object.keys(methods).forEach(keyCopier);\\n\\t\\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\\n\\t\\t return ctor;\\n\\t\\t}\\n\\t\\tvar Seq = function Seq(value) {\\n\\t\\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\\n\\t\\t};\\n\\t\\tvar $Seq = Seq;\\n\\t\\t($traceurRuntime.createClass)(Seq, {\\n\\t\\t toSeq: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Seq {', '}');\\n\\t\\t },\\n\\t\\t cacheResult: function() {\\n\\t\\t if (!this._cache && this.__iterateUncached) {\\n\\t\\t this._cache = this.entrySeq().toArray();\\n\\t\\t this.size = this._cache.length;\\n\\t\\t }\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t return seqIterate(this, fn, reverse, true);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return seqIterator(this, type, reverse, true);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return $Seq(arguments);\\n\\t\\t }}, Iterable);\\n\\t\\tvar KeyedSeq = function KeyedSeq(value) {\\n\\t\\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\\n\\t\\t};\\n\\t\\tvar $KeyedSeq = KeyedSeq;\\n\\t\\t($traceurRuntime.createClass)(KeyedSeq, {\\n\\t\\t toKeyedSeq: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t toSeq: function() {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return $KeyedSeq(arguments);\\n\\t\\t }}, Seq);\\n\\t\\tmixin(KeyedSeq, KeyedIterable.prototype);\\n\\t\\tvar IndexedSeq = function IndexedSeq(value) {\\n\\t\\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\\n\\t\\t};\\n\\t\\tvar $IndexedSeq = IndexedSeq;\\n\\t\\t($traceurRuntime.createClass)(IndexedSeq, {\\n\\t\\t toIndexedSeq: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Seq [', ']');\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t return seqIterate(this, fn, reverse, false);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return seqIterator(this, type, reverse, false);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return $IndexedSeq(arguments);\\n\\t\\t }}, Seq);\\n\\t\\tmixin(IndexedSeq, IndexedIterable.prototype);\\n\\t\\tvar SetSeq = function SetSeq(value) {\\n\\t\\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\\n\\t\\t};\\n\\t\\tvar $SetSeq = SetSeq;\\n\\t\\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\\n\\t\\t return this;\\n\\t\\t }}, {of: function() {\\n\\t\\t return $SetSeq(arguments);\\n\\t\\t }}, Seq);\\n\\t\\tmixin(SetSeq, SetIterable.prototype);\\n\\t\\tSeq.isSeq = isSeq;\\n\\t\\tSeq.Keyed = KeyedSeq;\\n\\t\\tSeq.Set = SetSeq;\\n\\t\\tSeq.Indexed = IndexedSeq;\\n\\t\\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\\n\\t\\tSeq.prototype[IS_SEQ_SENTINEL] = true;\\n\\t\\tvar ArraySeq = function ArraySeq(array) {\\n\\t\\t this._array = array;\\n\\t\\t this.size = array.length;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ArraySeq, {\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var array = this._array;\\n\\t\\t var maxIndex = array.length - 1;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var array = this._array;\\n\\t\\t var maxIndex = array.length - 1;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar ObjectSeq = function ObjectSeq(object) {\\n\\t\\t var keys = Object.keys(object);\\n\\t\\t this._object = object;\\n\\t\\t this._keys = keys;\\n\\t\\t this.size = keys.length;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ObjectSeq, {\\n\\t\\t get: function(key, notSetValue) {\\n\\t\\t if (notSetValue !== undefined && !this.has(key)) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t return this._object[key];\\n\\t\\t },\\n\\t\\t has: function(key) {\\n\\t\\t return this._object.hasOwnProperty(key);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var object = this._object;\\n\\t\\t var keys = this._keys;\\n\\t\\t var maxIndex = keys.length - 1;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t\\t if (fn(object[key], key, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var object = this._object;\\n\\t\\t var keys = this._keys;\\n\\t\\t var maxIndex = keys.length - 1;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, KeyedSeq);\\n\\t\\tObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tvar IterableSeq = function IterableSeq(iterable) {\\n\\t\\t this._iterable = iterable;\\n\\t\\t this.size = iterable.length || iterable.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(IterableSeq, {\\n\\t\\t __iterateUncached: function(fn, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterable = this._iterable;\\n\\t\\t var iterator = getIterator(iterable);\\n\\t\\t var iterations = 0;\\n\\t\\t if (isIterator(iterator)) {\\n\\t\\t var step;\\n\\t\\t while (!(step = iterator.next()).done) {\\n\\t\\t if (fn(step.value, iterations++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __iteratorUncached: function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterable = this._iterable;\\n\\t\\t var iterator = getIterator(iterable);\\n\\t\\t if (!isIterator(iterator)) {\\n\\t\\t return new Iterator(iteratorDone);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, iterations++, step.value);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar IteratorSeq = function IteratorSeq(iterator) {\\n\\t\\t this._iterator = iterator;\\n\\t\\t this._iteratorCache = [];\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(IteratorSeq, {\\n\\t\\t __iterateUncached: function(fn, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterator = this._iterator;\\n\\t\\t var cache = this._iteratorCache;\\n\\t\\t var iterations = 0;\\n\\t\\t while (iterations < cache.length) {\\n\\t\\t if (fn(cache[iterations], iterations++, this) === false) {\\n\\t\\t return iterations;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var step;\\n\\t\\t while (!(step = iterator.next()).done) {\\n\\t\\t var val = step.value;\\n\\t\\t cache[iterations] = val;\\n\\t\\t if (fn(val, iterations++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __iteratorUncached: function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = this._iterator;\\n\\t\\t var cache = this._iteratorCache;\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (iterations >= cache.length) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t cache[iterations] = step.value;\\n\\t\\t }\\n\\t\\t return iteratorValue(type, iterations, cache[iterations++]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tfunction isSeq(maybeSeq) {\\n\\t\\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\\n\\t\\t}\\n\\t\\tvar EMPTY_SEQ;\\n\\t\\tfunction emptySequence() {\\n\\t\\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\\n\\t\\t}\\n\\t\\tfunction keyedSeqFromValue(value) {\\n\\t\\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\\n\\t\\t if (!seq) {\\n\\t\\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\\n\\t\\t }\\n\\t\\t return seq;\\n\\t\\t}\\n\\t\\tfunction indexedSeqFromValue(value) {\\n\\t\\t var seq = maybeIndexedSeqFromValue(value);\\n\\t\\t if (!seq) {\\n\\t\\t throw new TypeError('Expected Array or iterable object of values: ' + value);\\n\\t\\t }\\n\\t\\t return seq;\\n\\t\\t}\\n\\t\\tfunction seqFromValue(value) {\\n\\t\\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\\n\\t\\t if (!seq) {\\n\\t\\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\\n\\t\\t }\\n\\t\\t return seq;\\n\\t\\t}\\n\\t\\tfunction maybeIndexedSeqFromValue(value) {\\n\\t\\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\\n\\t\\t}\\n\\t\\tfunction isArrayLike(value) {\\n\\t\\t return value && typeof value.length === 'number';\\n\\t\\t}\\n\\t\\tfunction seqIterate(seq, fn, reverse, useKeys) {\\n\\t\\t var cache = seq._cache;\\n\\t\\t if (cache) {\\n\\t\\t var maxIndex = cache.length - 1;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t\\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t }\\n\\t\\t return seq.__iterateUncached(fn, reverse);\\n\\t\\t}\\n\\t\\tfunction seqIterator(seq, type, reverse, useKeys) {\\n\\t\\t var cache = seq._cache;\\n\\t\\t if (cache) {\\n\\t\\t var maxIndex = cache.length - 1;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t return seq.__iteratorUncached(type, reverse);\\n\\t\\t}\\n\\t\\tfunction fromJS(json, converter) {\\n\\t\\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\\n\\t\\t}\\n\\t\\tfunction _fromJSWith(converter, json, key, parentJSON) {\\n\\t\\t if (Array.isArray(json)) {\\n\\t\\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\\n\\t\\t return _fromJSWith(converter, v, k, json);\\n\\t\\t })));\\n\\t\\t }\\n\\t\\t if (isPlainObj(json)) {\\n\\t\\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\\n\\t\\t return _fromJSWith(converter, v, k, json);\\n\\t\\t })));\\n\\t\\t }\\n\\t\\t return json;\\n\\t\\t}\\n\\t\\tfunction _fromJSDefault(json) {\\n\\t\\t if (Array.isArray(json)) {\\n\\t\\t return IndexedSeq(json).map(_fromJSDefault).toList();\\n\\t\\t }\\n\\t\\t if (isPlainObj(json)) {\\n\\t\\t return KeyedSeq(json).map(_fromJSDefault).toMap();\\n\\t\\t }\\n\\t\\t return json;\\n\\t\\t}\\n\\t\\tfunction isPlainObj(value) {\\n\\t\\t return value && value.constructor === Object;\\n\\t\\t}\\n\\t\\tvar Collection = function Collection() {\\n\\t\\t throw TypeError('Abstract');\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\\n\\t\\tvar KeyedCollection = function KeyedCollection() {\\n\\t\\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\\n\\t\\t};\\n\\t\\tvar $KeyedCollection = KeyedCollection;\\n\\t\\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\\n\\t\\tmixin(KeyedCollection, KeyedIterable.prototype);\\n\\t\\tvar IndexedCollection = function IndexedCollection() {\\n\\t\\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\\n\\t\\t};\\n\\t\\tvar $IndexedCollection = IndexedCollection;\\n\\t\\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\\n\\t\\tmixin(IndexedCollection, IndexedIterable.prototype);\\n\\t\\tvar SetCollection = function SetCollection() {\\n\\t\\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\\n\\t\\t};\\n\\t\\tvar $SetCollection = SetCollection;\\n\\t\\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\\n\\t\\tmixin(SetCollection, SetIterable.prototype);\\n\\t\\tCollection.Keyed = KeyedCollection;\\n\\t\\tCollection.Indexed = IndexedCollection;\\n\\t\\tCollection.Set = SetCollection;\\n\\t\\tvar Map = function Map(value) {\\n\\t\\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().withMutations((function(map) {\\n\\t\\t var iter = KeyedIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v, k) {\\n\\t\\t return map.set(k, v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Map, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Map {', '}');\\n\\t\\t },\\n\\t\\t get: function(k, notSetValue) {\\n\\t\\t return this._root ? this._root.get(0, undefined, k, notSetValue) : notSetValue;\\n\\t\\t },\\n\\t\\t set: function(k, v) {\\n\\t\\t return updateMap(this, k, v);\\n\\t\\t },\\n\\t\\t setIn: function(keyPath, v) {\\n\\t\\t return this.updateIn(keyPath, NOT_SET, (function() {\\n\\t\\t return v;\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t remove: function(k) {\\n\\t\\t return updateMap(this, k, NOT_SET);\\n\\t\\t },\\n\\t\\t deleteIn: function(keyPath) {\\n\\t\\t return this.updateIn(keyPath, (function() {\\n\\t\\t return NOT_SET;\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t update: function(k, notSetValue, updater) {\\n\\t\\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\\n\\t\\t },\\n\\t\\t updateIn: function(keyPath, notSetValue, updater) {\\n\\t\\t if (!updater) {\\n\\t\\t updater = notSetValue;\\n\\t\\t notSetValue = undefined;\\n\\t\\t }\\n\\t\\t var updatedValue = updateInDeepMap(this, getIterator(keyPath) || getIterator(Iterable(keyPath)), notSetValue, updater);\\n\\t\\t return updatedValue === NOT_SET ? undefined : updatedValue;\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = 0;\\n\\t\\t this._root = null;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyMap();\\n\\t\\t },\\n\\t\\t merge: function() {\\n\\t\\t return mergeIntoMapWith(this, undefined, arguments);\\n\\t\\t },\\n\\t\\t mergeWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__3 = 1; $__3 < arguments.length; $__3++)\\n\\t\\t iters[$__3 - 1] = arguments[$__3];\\n\\t\\t return mergeIntoMapWith(this, merger, iters);\\n\\t\\t },\\n\\t\\t mergeIn: function(keyPath) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__4 = 1; $__4 < arguments.length; $__4++)\\n\\t\\t iters[$__4 - 1] = arguments[$__4];\\n\\t\\t return this.updateIn(keyPath, emptyMap(), (function(m) {\\n\\t\\t return m.merge.apply(m, iters);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t mergeDeep: function() {\\n\\t\\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\\n\\t\\t },\\n\\t\\t mergeDeepWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__5 = 1; $__5 < arguments.length; $__5++)\\n\\t\\t iters[$__5 - 1] = arguments[$__5];\\n\\t\\t return mergeIntoMapWith(this, deepMerger(merger), iters);\\n\\t\\t },\\n\\t\\t mergeDeepIn: function(keyPath) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__6 = 1; $__6 < arguments.length; $__6++)\\n\\t\\t iters[$__6 - 1] = arguments[$__6];\\n\\t\\t return this.updateIn(keyPath, emptyMap(), (function(m) {\\n\\t\\t return m.mergeDeep.apply(m, iters);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t sort: function(comparator) {\\n\\t\\t return OrderedMap(sortFactory(this, comparator));\\n\\t\\t },\\n\\t\\t sortBy: function(mapper, comparator) {\\n\\t\\t return OrderedMap(sortFactory(this, comparator, mapper));\\n\\t\\t },\\n\\t\\t withMutations: function(fn) {\\n\\t\\t var mutable = this.asMutable();\\n\\t\\t fn(mutable);\\n\\t\\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\\n\\t\\t },\\n\\t\\t asMutable: function() {\\n\\t\\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\\n\\t\\t },\\n\\t\\t asImmutable: function() {\\n\\t\\t return this.__ensureOwner();\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this.__altered;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return new MapIterator(this, type, reverse);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t this._root && this._root.iterate((function(entry) {\\n\\t\\t iterations++;\\n\\t\\t return fn(entry[1], entry[0], $__0);\\n\\t\\t }), reverse);\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this.__altered = false;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeMap(this.size, this._root, ownerID, this.__hash);\\n\\t\\t }\\n\\t\\t}, {}, KeyedCollection);\\n\\t\\tfunction isMap(maybeMap) {\\n\\t\\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\\n\\t\\t}\\n\\t\\tMap.isMap = isMap;\\n\\t\\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\\n\\t\\tvar MapPrototype = Map.prototype;\\n\\t\\tMapPrototype[IS_MAP_SENTINEL] = true;\\n\\t\\tMapPrototype[DELETE] = MapPrototype.remove;\\n\\t\\tMapPrototype.removeIn = MapPrototype.deleteIn;\\n\\t\\tvar ArrayMapNode = function ArrayMapNode(ownerID, entries) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.entries = entries;\\n\\t\\t};\\n\\t\\tvar $ArrayMapNode = ArrayMapNode;\\n\\t\\t($traceurRuntime.createClass)(ArrayMapNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t var entries = this.entries;\\n\\t\\t for (var ii = 0,\\n\\t\\t len = entries.length; ii < len; ii++) {\\n\\t\\t if (is(key, entries[ii][0])) {\\n\\t\\t return entries[ii][1];\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t var entries = this.entries;\\n\\t\\t var idx = 0;\\n\\t\\t for (var len = entries.length; idx < len; idx++) {\\n\\t\\t if (is(key, entries[idx][0])) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var exists = idx < len;\\n\\t\\t if (exists ? entries[idx][1] === value : removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t (removed || !exists) && SetRef(didChangeSize);\\n\\t\\t if (removed && entries.length === 1) {\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\\n\\t\\t return createNodes(ownerID, entries, key, value);\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newEntries = isEditable ? entries : arrCopy(entries);\\n\\t\\t if (exists) {\\n\\t\\t if (removed) {\\n\\t\\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\\n\\t\\t } else {\\n\\t\\t newEntries[idx] = [key, value];\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t newEntries.push([key, value]);\\n\\t\\t }\\n\\t\\t if (isEditable) {\\n\\t\\t this.entries = newEntries;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $ArrayMapNode(ownerID, newEntries);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.bitmap = bitmap;\\n\\t\\t this.nodes = nodes;\\n\\t\\t};\\n\\t\\tvar $BitmapIndexedNode = BitmapIndexedNode;\\n\\t\\t($traceurRuntime.createClass)(BitmapIndexedNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\\n\\t\\t var bitmap = this.bitmap;\\n\\t\\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var bit = 1 << keyHashFrag;\\n\\t\\t var bitmap = this.bitmap;\\n\\t\\t var exists = (bitmap & bit) !== 0;\\n\\t\\t if (!exists && value === NOT_SET) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var idx = popCount(bitmap & (bit - 1));\\n\\t\\t var nodes = this.nodes;\\n\\t\\t var node = exists ? nodes[idx] : undefined;\\n\\t\\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\\n\\t\\t if (newNode === node) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\\n\\t\\t return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\\n\\t\\t }\\n\\t\\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\\n\\t\\t return nodes[idx ^ 1];\\n\\t\\t }\\n\\t\\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\\n\\t\\t return newNode;\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\\n\\t\\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\\n\\t\\t if (isEditable) {\\n\\t\\t this.bitmap = newBitmap;\\n\\t\\t this.nodes = newNodes;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar HashArrayMapNode = function HashArrayMapNode(ownerID, count, nodes) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.count = count;\\n\\t\\t this.nodes = nodes;\\n\\t\\t};\\n\\t\\tvar $HashArrayMapNode = HashArrayMapNode;\\n\\t\\t($traceurRuntime.createClass)(HashArrayMapNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var node = this.nodes[idx];\\n\\t\\t return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t var nodes = this.nodes;\\n\\t\\t var node = nodes[idx];\\n\\t\\t if (removed && !node) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\\n\\t\\t if (newNode === node) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newCount = this.count;\\n\\t\\t if (!node) {\\n\\t\\t newCount++;\\n\\t\\t } else if (!newNode) {\\n\\t\\t newCount--;\\n\\t\\t if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\\n\\t\\t return packNodes(ownerID, nodes, newCount, idx);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newNodes = setIn(nodes, idx, newNode, isEditable);\\n\\t\\t if (isEditable) {\\n\\t\\t this.count = newCount;\\n\\t\\t this.nodes = newNodes;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $HashArrayMapNode(ownerID, newCount, newNodes);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar HashCollisionNode = function HashCollisionNode(ownerID, keyHash, entries) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.keyHash = keyHash;\\n\\t\\t this.entries = entries;\\n\\t\\t};\\n\\t\\tvar $HashCollisionNode = HashCollisionNode;\\n\\t\\t($traceurRuntime.createClass)(HashCollisionNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t var entries = this.entries;\\n\\t\\t for (var ii = 0,\\n\\t\\t len = entries.length; ii < len; ii++) {\\n\\t\\t if (is(key, entries[ii][0])) {\\n\\t\\t return entries[ii][1];\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (keyHash === undefined) {\\n\\t\\t keyHash = hash(key);\\n\\t\\t }\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t if (keyHash !== this.keyHash) {\\n\\t\\t if (removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\\n\\t\\t }\\n\\t\\t var entries = this.entries;\\n\\t\\t var idx = 0;\\n\\t\\t for (var len = entries.length; idx < len; idx++) {\\n\\t\\t if (is(key, entries[idx][0])) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var exists = idx < len;\\n\\t\\t if (exists ? entries[idx][1] === value : removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t (removed || !exists) && SetRef(didChangeSize);\\n\\t\\t if (removed && len === 2) {\\n\\t\\t return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\\n\\t\\t }\\n\\t\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t\\t var newEntries = isEditable ? entries : arrCopy(entries);\\n\\t\\t if (exists) {\\n\\t\\t if (removed) {\\n\\t\\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\\n\\t\\t } else {\\n\\t\\t newEntries[idx] = [key, value];\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t newEntries.push([key, value]);\\n\\t\\t }\\n\\t\\t if (isEditable) {\\n\\t\\t this.entries = newEntries;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $HashCollisionNode(ownerID, this.keyHash, newEntries);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar ValueNode = function ValueNode(ownerID, keyHash, entry) {\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t this.keyHash = keyHash;\\n\\t\\t this.entry = entry;\\n\\t\\t};\\n\\t\\tvar $ValueNode = ValueNode;\\n\\t\\t($traceurRuntime.createClass)(ValueNode, {\\n\\t\\t get: function(shift, keyHash, key, notSetValue) {\\n\\t\\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\\n\\t\\t },\\n\\t\\t update: function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t var removed = value === NOT_SET;\\n\\t\\t var keyMatch = is(key, this.entry[0]);\\n\\t\\t if (keyMatch ? value === this.entry[1] : removed) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t if (removed) {\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t if (keyMatch) {\\n\\t\\t if (ownerID && ownerID === this.ownerID) {\\n\\t\\t this.entry[1] = value;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return new $ValueNode(ownerID, this.keyHash, [key, value]);\\n\\t\\t }\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tArrayMapNode.prototype.iterate = HashCollisionNode.prototype.iterate = function(fn, reverse) {\\n\\t\\t var entries = this.entries;\\n\\t\\t for (var ii = 0,\\n\\t\\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\\n\\t\\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t};\\n\\t\\tBitmapIndexedNode.prototype.iterate = HashArrayMapNode.prototype.iterate = function(fn, reverse) {\\n\\t\\t var nodes = this.nodes;\\n\\t\\t for (var ii = 0,\\n\\t\\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\\n\\t\\t var node = nodes[reverse ? maxIndex - ii : ii];\\n\\t\\t if (node && node.iterate(fn, reverse) === false) {\\n\\t\\t return false;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t};\\n\\t\\tValueNode.prototype.iterate = function(fn, reverse) {\\n\\t\\t return fn(this.entry);\\n\\t\\t};\\n\\t\\tvar MapIterator = function MapIterator(map, type, reverse) {\\n\\t\\t this._type = type;\\n\\t\\t this._reverse = reverse;\\n\\t\\t this._stack = map._root && mapIteratorFrame(map._root);\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(MapIterator, {next: function() {\\n\\t\\t var type = this._type;\\n\\t\\t var stack = this._stack;\\n\\t\\t while (stack) {\\n\\t\\t var node = stack.node;\\n\\t\\t var index = stack.index++;\\n\\t\\t var maxIndex;\\n\\t\\t if (node.entry) {\\n\\t\\t if (index === 0) {\\n\\t\\t return mapIteratorValue(type, node.entry);\\n\\t\\t }\\n\\t\\t } else if (node.entries) {\\n\\t\\t maxIndex = node.entries.length - 1;\\n\\t\\t if (index <= maxIndex) {\\n\\t\\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t maxIndex = node.nodes.length - 1;\\n\\t\\t if (index <= maxIndex) {\\n\\t\\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\\n\\t\\t if (subNode) {\\n\\t\\t if (subNode.entry) {\\n\\t\\t return mapIteratorValue(type, subNode.entry);\\n\\t\\t }\\n\\t\\t stack = this._stack = mapIteratorFrame(subNode, stack);\\n\\t\\t }\\n\\t\\t continue;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t stack = this._stack = this._stack.__prev;\\n\\t\\t }\\n\\t\\t return iteratorDone();\\n\\t\\t }}, {}, Iterator);\\n\\t\\tfunction mapIteratorValue(type, entry) {\\n\\t\\t return iteratorValue(type, entry[0], entry[1]);\\n\\t\\t}\\n\\t\\tfunction mapIteratorFrame(node, prev) {\\n\\t\\t return {\\n\\t\\t node: node,\\n\\t\\t index: 0,\\n\\t\\t __prev: prev\\n\\t\\t };\\n\\t\\t}\\n\\t\\tfunction makeMap(size, root, ownerID, hash) {\\n\\t\\t var map = Object.create(MapPrototype);\\n\\t\\t map.size = size;\\n\\t\\t map._root = root;\\n\\t\\t map.__ownerID = ownerID;\\n\\t\\t map.__hash = hash;\\n\\t\\t map.__altered = false;\\n\\t\\t return map;\\n\\t\\t}\\n\\t\\tvar EMPTY_MAP;\\n\\t\\tfunction emptyMap() {\\n\\t\\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\\n\\t\\t}\\n\\t\\tfunction updateMap(map, k, v) {\\n\\t\\t var newRoot;\\n\\t\\t var newSize;\\n\\t\\t if (!map._root) {\\n\\t\\t if (v === NOT_SET) {\\n\\t\\t return map;\\n\\t\\t }\\n\\t\\t newSize = 1;\\n\\t\\t newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\\n\\t\\t } else {\\n\\t\\t var didChangeSize = MakeRef(CHANGE_LENGTH);\\n\\t\\t var didAlter = MakeRef(DID_ALTER);\\n\\t\\t newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\\n\\t\\t if (!didAlter.value) {\\n\\t\\t return map;\\n\\t\\t }\\n\\t\\t newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\\n\\t\\t }\\n\\t\\t if (map.__ownerID) {\\n\\t\\t map.size = newSize;\\n\\t\\t map._root = newRoot;\\n\\t\\t map.__hash = undefined;\\n\\t\\t map.__altered = true;\\n\\t\\t return map;\\n\\t\\t }\\n\\t\\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\\n\\t\\t}\\n\\t\\tfunction updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\\n\\t\\t if (!node) {\\n\\t\\t if (value === NOT_SET) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t SetRef(didChangeSize);\\n\\t\\t return new ValueNode(ownerID, keyHash, [key, value]);\\n\\t\\t }\\n\\t\\t return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\\n\\t\\t}\\n\\t\\tfunction isLeafNode(node) {\\n\\t\\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\\n\\t\\t}\\n\\t\\tfunction mergeIntoNode(node, ownerID, shift, keyHash, entry) {\\n\\t\\t if (node.keyHash === keyHash) {\\n\\t\\t return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\\n\\t\\t }\\n\\t\\t var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\\n\\t\\t var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\\n\\t\\t var newNode;\\n\\t\\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] : ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\\n\\t\\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\\n\\t\\t}\\n\\t\\tfunction createNodes(ownerID, entries, key, value) {\\n\\t\\t if (!ownerID) {\\n\\t\\t ownerID = new OwnerID();\\n\\t\\t }\\n\\t\\t var node = new ValueNode(ownerID, hash(key), [key, value]);\\n\\t\\t for (var ii = 0; ii < entries.length; ii++) {\\n\\t\\t var entry = entries[ii];\\n\\t\\t node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\\n\\t\\t }\\n\\t\\t return node;\\n\\t\\t}\\n\\t\\tfunction packNodes(ownerID, nodes, count, excluding) {\\n\\t\\t var bitmap = 0;\\n\\t\\t var packedII = 0;\\n\\t\\t var packedNodes = new Array(count);\\n\\t\\t for (var ii = 0,\\n\\t\\t bit = 1,\\n\\t\\t len = nodes.length; ii < len; ii++, bit <<= 1) {\\n\\t\\t var node = nodes[ii];\\n\\t\\t if (node !== undefined && ii !== excluding) {\\n\\t\\t bitmap |= bit;\\n\\t\\t packedNodes[packedII++] = node;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\\n\\t\\t}\\n\\t\\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\\n\\t\\t var count = 0;\\n\\t\\t var expandedNodes = new Array(SIZE);\\n\\t\\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\\n\\t\\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\\n\\t\\t }\\n\\t\\t expandedNodes[including] = node;\\n\\t\\t return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\\n\\t\\t}\\n\\t\\tfunction mergeIntoMapWith(map, merger, iterables) {\\n\\t\\t var iters = [];\\n\\t\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t\\t var value = iterables[ii];\\n\\t\\t var iter = KeyedIterable(value);\\n\\t\\t if (!isIterable(value)) {\\n\\t\\t iter = iter.map((function(v) {\\n\\t\\t return fromJS(v);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t iters.push(iter);\\n\\t\\t }\\n\\t\\t return mergeIntoCollectionWith(map, merger, iters);\\n\\t\\t}\\n\\t\\tfunction deepMerger(merger) {\\n\\t\\t return (function(existing, value) {\\n\\t\\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\\n\\t\\t });\\n\\t\\t}\\n\\t\\tfunction mergeIntoCollectionWith(collection, merger, iters) {\\n\\t\\t iters = iters.filter((function(x) {\\n\\t\\t return x.size !== 0;\\n\\t\\t }));\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return collection;\\n\\t\\t }\\n\\t\\t if (collection.size === 0 && iters.length === 1) {\\n\\t\\t return collection.constructor(iters[0]);\\n\\t\\t }\\n\\t\\t return collection.withMutations((function(collection) {\\n\\t\\t var mergeIntoMap = merger ? (function(value, key) {\\n\\t\\t collection.update(key, NOT_SET, (function(existing) {\\n\\t\\t return existing === NOT_SET ? value : merger(existing, value);\\n\\t\\t }));\\n\\t\\t }) : (function(value, key) {\\n\\t\\t collection.set(key, value);\\n\\t\\t });\\n\\t\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t\\t iters[ii].forEach(mergeIntoMap);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t}\\n\\t\\tfunction updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\\n\\t\\t var isNotSet = existing === NOT_SET;\\n\\t\\t var step = keyPathIter.next();\\n\\t\\t if (step.done) {\\n\\t\\t var existingValue = isNotSet ? notSetValue : existing;\\n\\t\\t var newValue = updater(existingValue);\\n\\t\\t return newValue === existingValue ? existing : newValue;\\n\\t\\t }\\n\\t\\t invariant(isNotSet || (existing && existing.set), 'invalid keyPath');\\n\\t\\t var key = step.value;\\n\\t\\t var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\\n\\t\\t var nextUpdated = updateInDeepMap(nextExisting, keyPathIter, notSetValue, updater);\\n\\t\\t return nextUpdated === nextExisting ? existing : nextUpdated === NOT_SET ? existing.remove(key) : (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\\n\\t\\t}\\n\\t\\tfunction popCount(x) {\\n\\t\\t x = x - ((x >> 1) & 0x55555555);\\n\\t\\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\\n\\t\\t x = (x + (x >> 4)) & 0x0f0f0f0f;\\n\\t\\t x = x + (x >> 8);\\n\\t\\t x = x + (x >> 16);\\n\\t\\t return x & 0x7f;\\n\\t\\t}\\n\\t\\tfunction setIn(array, idx, val, canEdit) {\\n\\t\\t var newArray = canEdit ? array : arrCopy(array);\\n\\t\\t newArray[idx] = val;\\n\\t\\t return newArray;\\n\\t\\t}\\n\\t\\tfunction spliceIn(array, idx, val, canEdit) {\\n\\t\\t var newLen = array.length + 1;\\n\\t\\t if (canEdit && idx + 1 === newLen) {\\n\\t\\t array[idx] = val;\\n\\t\\t return array;\\n\\t\\t }\\n\\t\\t var newArray = new Array(newLen);\\n\\t\\t var after = 0;\\n\\t\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t\\t if (ii === idx) {\\n\\t\\t newArray[ii] = val;\\n\\t\\t after = -1;\\n\\t\\t } else {\\n\\t\\t newArray[ii] = array[ii + after];\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return newArray;\\n\\t\\t}\\n\\t\\tfunction spliceOut(array, idx, canEdit) {\\n\\t\\t var newLen = array.length - 1;\\n\\t\\t if (canEdit && idx === newLen) {\\n\\t\\t array.pop();\\n\\t\\t return array;\\n\\t\\t }\\n\\t\\t var newArray = new Array(newLen);\\n\\t\\t var after = 0;\\n\\t\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t\\t if (ii === idx) {\\n\\t\\t after = 1;\\n\\t\\t }\\n\\t\\t newArray[ii] = array[ii + after];\\n\\t\\t }\\n\\t\\t return newArray;\\n\\t\\t}\\n\\t\\tvar MAX_ARRAY_MAP_SIZE = SIZE / 4;\\n\\t\\tvar MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\\n\\t\\tvar MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\\n\\t\\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\\n\\t\\t this._iter = indexed;\\n\\t\\t this._useKeys = useKeys;\\n\\t\\t this.size = indexed.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ToKeyedSequence, {\\n\\t\\t get: function(key, notSetValue) {\\n\\t\\t return this._iter.get(key, notSetValue);\\n\\t\\t },\\n\\t\\t has: function(key) {\\n\\t\\t return this._iter.has(key);\\n\\t\\t },\\n\\t\\t valueSeq: function() {\\n\\t\\t return this._iter.valueSeq();\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t var $__0 = this;\\n\\t\\t var reversedSequence = reverseFactory(this, true);\\n\\t\\t if (!this._useKeys) {\\n\\t\\t reversedSequence.valueSeq = (function() {\\n\\t\\t return $__0._iter.toSeq().reverse();\\n\\t\\t });\\n\\t\\t }\\n\\t\\t return reversedSequence;\\n\\t\\t },\\n\\t\\t map: function(mapper, context) {\\n\\t\\t var $__0 = this;\\n\\t\\t var mappedSequence = mapFactory(this, mapper, context);\\n\\t\\t if (!this._useKeys) {\\n\\t\\t mappedSequence.valueSeq = (function() {\\n\\t\\t return $__0._iter.toSeq().map(mapper, context);\\n\\t\\t });\\n\\t\\t }\\n\\t\\t return mappedSequence;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var ii;\\n\\t\\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\\n\\t\\t return fn(v, k, $__0);\\n\\t\\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\\n\\t\\t return fn(v, reverse ? --ii : ii++, $__0);\\n\\t\\t })), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t if (this._useKeys) {\\n\\t\\t return this._iter.__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t var ii = reverse ? resolveSize(this) : 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, KeyedSeq);\\n\\t\\tToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\\n\\t\\t this._iter = iter;\\n\\t\\t this.size = iter.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ToIndexedSequence, {\\n\\t\\t contains: function(value) {\\n\\t\\t return this._iter.contains(value);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t return this._iter.__iterate((function(v) {\\n\\t\\t return fn(v, iterations++, $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar ToSetSequence = function ToSetSequence(iter) {\\n\\t\\t this._iter = iter;\\n\\t\\t this.size = iter.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(ToSetSequence, {\\n\\t\\t has: function(key) {\\n\\t\\t return this._iter.contains(key);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._iter.__iterate((function(v) {\\n\\t\\t return fn(v, v, $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, SetSeq);\\n\\t\\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\\n\\t\\t this._iter = entries;\\n\\t\\t this.size = entries.size;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(FromEntriesSequence, {\\n\\t\\t entrySeq: function() {\\n\\t\\t return this._iter.toSeq();\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._iter.__iterate((function(entry) {\\n\\t\\t if (entry) {\\n\\t\\t validateEntry(entry);\\n\\t\\t return fn(entry[1], entry[0], $__0);\\n\\t\\t }\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (true) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t if (entry) {\\n\\t\\t validateEntry(entry);\\n\\t\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {}, KeyedSeq);\\n\\t\\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\\n\\t\\tfunction flipFactory(iterable) {\\n\\t\\t var flipSequence = makeSequence(iterable);\\n\\t\\t flipSequence._iter = iterable;\\n\\t\\t flipSequence.size = iterable.size;\\n\\t\\t flipSequence.flip = (function() {\\n\\t\\t return iterable;\\n\\t\\t });\\n\\t\\t flipSequence.reverse = function() {\\n\\t\\t var reversedSequence = iterable.reverse.apply(this);\\n\\t\\t reversedSequence.flip = (function() {\\n\\t\\t return iterable.reverse();\\n\\t\\t });\\n\\t\\t return reversedSequence;\\n\\t\\t };\\n\\t\\t flipSequence.has = (function(key) {\\n\\t\\t return iterable.contains(key);\\n\\t\\t });\\n\\t\\t flipSequence.contains = (function(key) {\\n\\t\\t return iterable.has(key);\\n\\t\\t });\\n\\t\\t flipSequence.cacheResult = cacheResultThrough;\\n\\t\\t flipSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return iterable.__iterate((function(v, k) {\\n\\t\\t return fn(k, v, $__0) !== false;\\n\\t\\t }), reverse);\\n\\t\\t };\\n\\t\\t flipSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t if (type === ITERATE_ENTRIES) {\\n\\t\\t var iterator = iterable.__iterator(type, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (!step.done) {\\n\\t\\t var k = step.value[0];\\n\\t\\t step.value[0] = step.value[1];\\n\\t\\t step.value[1] = k;\\n\\t\\t }\\n\\t\\t return step;\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\\n\\t\\t };\\n\\t\\t return flipSequence;\\n\\t\\t}\\n\\t\\tfunction mapFactory(iterable, mapper, context) {\\n\\t\\t var mappedSequence = makeSequence(iterable);\\n\\t\\t mappedSequence.size = iterable.size;\\n\\t\\t mappedSequence.has = (function(key) {\\n\\t\\t return iterable.has(key);\\n\\t\\t });\\n\\t\\t mappedSequence.get = (function(key, notSetValue) {\\n\\t\\t var v = iterable.get(key, NOT_SET);\\n\\t\\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\\n\\t\\t });\\n\\t\\t mappedSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return iterable.__iterate((function(v, k, c) {\\n\\t\\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\\n\\t\\t }), reverse);\\n\\t\\t };\\n\\t\\t mappedSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t var key = entry[0];\\n\\t\\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return mappedSequence;\\n\\t\\t}\\n\\t\\tfunction reverseFactory(iterable, useKeys) {\\n\\t\\t var reversedSequence = makeSequence(iterable);\\n\\t\\t reversedSequence._iter = iterable;\\n\\t\\t reversedSequence.size = iterable.size;\\n\\t\\t reversedSequence.reverse = (function() {\\n\\t\\t return iterable;\\n\\t\\t });\\n\\t\\t if (iterable.flip) {\\n\\t\\t reversedSequence.flip = function() {\\n\\t\\t var flipSequence = flipFactory(iterable);\\n\\t\\t flipSequence.reverse = (function() {\\n\\t\\t return iterable.flip();\\n\\t\\t });\\n\\t\\t return flipSequence;\\n\\t\\t };\\n\\t\\t }\\n\\t\\t reversedSequence.get = (function(key, notSetValue) {\\n\\t\\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\\n\\t\\t });\\n\\t\\t reversedSequence.has = (function(key) {\\n\\t\\t return iterable.has(useKeys ? key : -1 - key);\\n\\t\\t });\\n\\t\\t reversedSequence.contains = (function(value) {\\n\\t\\t return iterable.contains(value);\\n\\t\\t });\\n\\t\\t reversedSequence.cacheResult = cacheResultThrough;\\n\\t\\t reversedSequence.__iterate = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return iterable.__iterate((function(v, k) {\\n\\t\\t return fn(v, k, $__0);\\n\\t\\t }), !reverse);\\n\\t\\t };\\n\\t\\t reversedSequence.__iterator = (function(type, reverse) {\\n\\t\\t return iterable.__iterator(type, !reverse);\\n\\t\\t });\\n\\t\\t return reversedSequence;\\n\\t\\t}\\n\\t\\tfunction filterFactory(iterable, predicate, context, useKeys) {\\n\\t\\t var filterSequence = makeSequence(iterable);\\n\\t\\t if (useKeys) {\\n\\t\\t filterSequence.has = (function(key) {\\n\\t\\t var v = iterable.get(key, NOT_SET);\\n\\t\\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\\n\\t\\t });\\n\\t\\t filterSequence.get = (function(key, notSetValue) {\\n\\t\\t var v = iterable.get(key, NOT_SET);\\n\\t\\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\\n\\t\\t });\\n\\t\\t }\\n\\t\\t filterSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k, c) {\\n\\t\\t if (predicate.call(context, v, k, c)) {\\n\\t\\t iterations++;\\n\\t\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t\\t }\\n\\t\\t }), reverse);\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t filterSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (true) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t var key = entry[0];\\n\\t\\t var value = entry[1];\\n\\t\\t if (predicate.call(context, value, key, iterable)) {\\n\\t\\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return filterSequence;\\n\\t\\t}\\n\\t\\tfunction countByFactory(iterable, grouper, context) {\\n\\t\\t var groups = Map().asMutable();\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\\n\\t\\t return a + 1;\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t return groups.asImmutable();\\n\\t\\t}\\n\\t\\tfunction groupByFactory(iterable, grouper, context) {\\n\\t\\t var isKeyedIter = isKeyed(iterable);\\n\\t\\t var groups = Map().asMutable();\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t groups.update(grouper.call(context, v, k, iterable), (function(a) {\\n\\t\\t return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t var coerce = iterableClass(iterable);\\n\\t\\t return groups.map((function(arr) {\\n\\t\\t return reify(iterable, coerce(arr));\\n\\t\\t }));\\n\\t\\t}\\n\\t\\tfunction takeFactory(iterable, amount) {\\n\\t\\t if (amount > iterable.size) {\\n\\t\\t return iterable;\\n\\t\\t }\\n\\t\\t if (amount < 0) {\\n\\t\\t amount = 0;\\n\\t\\t }\\n\\t\\t var takeSequence = makeSequence(iterable);\\n\\t\\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\\n\\t\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (amount === 0) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (iterations++ > amount) {\\n\\t\\t return iteratorDone();\\n\\t\\t }\\n\\t\\t return iterator.next();\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return takeSequence;\\n\\t\\t}\\n\\t\\tfunction takeWhileFactory(iterable, predicate, context) {\\n\\t\\t var takeSequence = makeSequence(iterable);\\n\\t\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k, c) {\\n\\t\\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t var iterating = true;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (!iterating) {\\n\\t\\t return iteratorDone();\\n\\t\\t }\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t var k = entry[0];\\n\\t\\t var v = entry[1];\\n\\t\\t if (!predicate.call(context, v, k, $__0)) {\\n\\t\\t iterating = false;\\n\\t\\t return iteratorDone();\\n\\t\\t }\\n\\t\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return takeSequence;\\n\\t\\t}\\n\\t\\tfunction skipFactory(iterable, amount, useKeys) {\\n\\t\\t if (amount <= 0) {\\n\\t\\t return iterable;\\n\\t\\t }\\n\\t\\t var skipSequence = makeSequence(iterable);\\n\\t\\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\\n\\t\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var skipped = 0;\\n\\t\\t var isSkipping = true;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\\n\\t\\t iterations++;\\n\\t\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t\\t var skipped = 0;\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (skipped < amount) {\\n\\t\\t skipped++;\\n\\t\\t iterator.next();\\n\\t\\t }\\n\\t\\t var step = iterator.next();\\n\\t\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t\\t return step;\\n\\t\\t } else if (type === ITERATE_KEYS) {\\n\\t\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t\\t } else {\\n\\t\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return skipSequence;\\n\\t\\t}\\n\\t\\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\\n\\t\\t var skipSequence = makeSequence(iterable);\\n\\t\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var isSkipping = true;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k, c) {\\n\\t\\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\\n\\t\\t iterations++;\\n\\t\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t if (reverse) {\\n\\t\\t return this.cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t\\t var skipping = true;\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var step,\\n\\t\\t k,\\n\\t\\t v;\\n\\t\\t do {\\n\\t\\t step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t\\t return step;\\n\\t\\t } else if (type === ITERATE_KEYS) {\\n\\t\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t\\t } else {\\n\\t\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var entry = step.value;\\n\\t\\t k = entry[0];\\n\\t\\t v = entry[1];\\n\\t\\t skipping && (skipping = predicate.call(context, v, k, $__0));\\n\\t\\t } while (skipping);\\n\\t\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return skipSequence;\\n\\t\\t}\\n\\t\\tfunction concatFactory(iterable, values) {\\n\\t\\t var isKeyedIterable = isKeyed(iterable);\\n\\t\\t var iters = [iterable].concat(values).map((function(v) {\\n\\t\\t if (!isIterable(v)) {\\n\\t\\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\\n\\t\\t } else if (isKeyedIterable) {\\n\\t\\t v = KeyedIterable(v);\\n\\t\\t }\\n\\t\\t return v;\\n\\t\\t })).filter((function(v) {\\n\\t\\t return v.size !== 0;\\n\\t\\t }));\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return iterable;\\n\\t\\t }\\n\\t\\t if (iters.length === 1) {\\n\\t\\t var singleton = iters[0];\\n\\t\\t if (singleton === iterable || isKeyedIterable && isKeyed(singleton) || isIndexed(iterable) && isIndexed(singleton)) {\\n\\t\\t return singleton;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t var concatSeq = new ArraySeq(iters);\\n\\t\\t if (isKeyedIterable) {\\n\\t\\t concatSeq = concatSeq.toKeyedSeq();\\n\\t\\t } else if (!isIndexed(iterable)) {\\n\\t\\t concatSeq = concatSeq.toSetSeq();\\n\\t\\t }\\n\\t\\t concatSeq = concatSeq.flatten(true);\\n\\t\\t concatSeq.size = iters.reduce((function(sum, seq) {\\n\\t\\t if (sum !== undefined) {\\n\\t\\t var size = seq.size;\\n\\t\\t if (size !== undefined) {\\n\\t\\t return sum + size;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t }), 0);\\n\\t\\t return concatSeq;\\n\\t\\t}\\n\\t\\tfunction flattenFactory(iterable, depth, useKeys) {\\n\\t\\t var flatSequence = makeSequence(iterable);\\n\\t\\t flatSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var iterations = 0;\\n\\t\\t var stopped = false;\\n\\t\\t function flatDeep(iter, currentDepth) {\\n\\t\\t var $__0 = this;\\n\\t\\t iter.__iterate((function(v, k) {\\n\\t\\t if ((!depth || currentDepth < depth) && isIterable(v)) {\\n\\t\\t flatDeep(v, currentDepth + 1);\\n\\t\\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\\n\\t\\t stopped = true;\\n\\t\\t }\\n\\t\\t return !stopped;\\n\\t\\t }), reverse);\\n\\t\\t }\\n\\t\\t flatDeep(iterable, 0);\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t flatSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(type, reverse);\\n\\t\\t var stack = [];\\n\\t\\t var iterations = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t while (iterator) {\\n\\t\\t var step = iterator.next();\\n\\t\\t if (step.done !== false) {\\n\\t\\t iterator = stack.pop();\\n\\t\\t continue;\\n\\t\\t }\\n\\t\\t var v = step.value;\\n\\t\\t if (type === ITERATE_ENTRIES) {\\n\\t\\t v = v[1];\\n\\t\\t }\\n\\t\\t if ((!depth || stack.length < depth) && isIterable(v)) {\\n\\t\\t stack.push(iterator);\\n\\t\\t iterator = v.__iterator(type, reverse);\\n\\t\\t } else {\\n\\t\\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iteratorDone();\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return flatSequence;\\n\\t\\t}\\n\\t\\tfunction flatMapFactory(iterable, mapper, context) {\\n\\t\\t var coerce = iterableClass(iterable);\\n\\t\\t return iterable.toSeq().map((function(v, k) {\\n\\t\\t return coerce(mapper.call(context, v, k, iterable));\\n\\t\\t })).flatten(true);\\n\\t\\t}\\n\\t\\tfunction interposeFactory(iterable, separator) {\\n\\t\\t var interposedSequence = makeSequence(iterable);\\n\\t\\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\\n\\t\\t interposedSequence.__iterateUncached = function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var iterations = 0;\\n\\t\\t iterable.__iterate((function(v, k) {\\n\\t\\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\\n\\t\\t }), reverse);\\n\\t\\t return iterations;\\n\\t\\t };\\n\\t\\t interposedSequence.__iteratorUncached = function(type, reverse) {\\n\\t\\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\\n\\t\\t var iterations = 0;\\n\\t\\t var step;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (!step || iterations % 2) {\\n\\t\\t step = iterator.next();\\n\\t\\t if (step.done) {\\n\\t\\t return step;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\\n\\t\\t }));\\n\\t\\t };\\n\\t\\t return interposedSequence;\\n\\t\\t}\\n\\t\\tfunction sortFactory(iterable, comparator, mapper) {\\n\\t\\t if (!comparator) {\\n\\t\\t comparator = defaultComparator;\\n\\t\\t }\\n\\t\\t var isKeyedIterable = isKeyed(iterable);\\n\\t\\t var index = 0;\\n\\t\\t var entries = iterable.toSeq().map((function(v, k) {\\n\\t\\t return [k, v, index++, mapper ? mapper(v, k, iterable) : v];\\n\\t\\t })).toArray();\\n\\t\\t entries.sort((function(a, b) {\\n\\t\\t return comparator(a[3], b[3]) || a[2] - b[2];\\n\\t\\t })).forEach(isKeyedIterable ? (function(v, i) {\\n\\t\\t entries[i].length = 2;\\n\\t\\t }) : (function(v, i) {\\n\\t\\t entries[i] = v[1];\\n\\t\\t }));\\n\\t\\t return isKeyedIterable ? KeyedSeq(entries) : isIndexed(iterable) ? IndexedSeq(entries) : SetSeq(entries);\\n\\t\\t}\\n\\t\\tfunction maxFactory(iterable, comparator, mapper) {\\n\\t\\t if (!comparator) {\\n\\t\\t comparator = defaultComparator;\\n\\t\\t }\\n\\t\\t if (mapper) {\\n\\t\\t var entry = iterable.toSeq().map((function(v, k) {\\n\\t\\t return [v, mapper(v, k, iterable)];\\n\\t\\t })).reduce((function(a, b) {\\n\\t\\t return _maxCompare(comparator, a[1], b[1]) ? b : a;\\n\\t\\t }));\\n\\t\\t return entry && entry[0];\\n\\t\\t } else {\\n\\t\\t return iterable.reduce((function(a, b) {\\n\\t\\t return _maxCompare(comparator, a, b) ? b : a;\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction _maxCompare(comparator, a, b) {\\n\\t\\t var comp = comparator(b, a);\\n\\t\\t return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\\n\\t\\t}\\n\\t\\tfunction reify(iter, seq) {\\n\\t\\t return isSeq(iter) ? seq : iter.constructor(seq);\\n\\t\\t}\\n\\t\\tfunction validateEntry(entry) {\\n\\t\\t if (entry !== Object(entry)) {\\n\\t\\t throw new TypeError('Expected [K, V] tuple: ' + entry);\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction resolveSize(iter) {\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t return ensureSize(iter);\\n\\t\\t}\\n\\t\\tfunction iterableClass(iterable) {\\n\\t\\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\\n\\t\\t}\\n\\t\\tfunction makeSequence(iterable) {\\n\\t\\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\\n\\t\\t}\\n\\t\\tfunction cacheResultThrough() {\\n\\t\\t if (this._iter.cacheResult) {\\n\\t\\t this._iter.cacheResult();\\n\\t\\t this.size = this._iter.size;\\n\\t\\t return this;\\n\\t\\t } else {\\n\\t\\t return Seq.prototype.cacheResult.call(this);\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction defaultComparator(a, b) {\\n\\t\\t return a > b ? 1 : a < b ? -1 : 0;\\n\\t\\t}\\n\\t\\tvar List = function List(value) {\\n\\t\\t var empty = emptyList();\\n\\t\\t if (value === null || value === undefined) {\\n\\t\\t return empty;\\n\\t\\t }\\n\\t\\t if (isList(value)) {\\n\\t\\t return value;\\n\\t\\t }\\n\\t\\t var iter = IndexedIterable(value);\\n\\t\\t var size = iter.size;\\n\\t\\t if (size === 0) {\\n\\t\\t return empty;\\n\\t\\t }\\n\\t\\t assertNotInfinite(size);\\n\\t\\t if (size > 0 && size < SIZE) {\\n\\t\\t return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\\n\\t\\t }\\n\\t\\t return empty.withMutations((function(list) {\\n\\t\\t list.setSize(size);\\n\\t\\t iter.forEach((function(v, i) {\\n\\t\\t return list.set(i, v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(List, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('List [', ']');\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t index = wrapIndex(this, index);\\n\\t\\t if (index < 0 || index >= this.size) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t index += this._origin;\\n\\t\\t var node = listNodeFor(this, index);\\n\\t\\t return node && node.array[index & MASK];\\n\\t\\t },\\n\\t\\t set: function(index, value) {\\n\\t\\t return updateList(this, index, value);\\n\\t\\t },\\n\\t\\t remove: function(index) {\\n\\t\\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = this._origin = this._capacity = 0;\\n\\t\\t this._level = SHIFT;\\n\\t\\t this._root = this._tail = null;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyList();\\n\\t\\t },\\n\\t\\t push: function() {\\n\\t\\t var values = arguments;\\n\\t\\t var oldSize = this.size;\\n\\t\\t return this.withMutations((function(list) {\\n\\t\\t setListBounds(list, 0, oldSize + values.length);\\n\\t\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t\\t list.set(oldSize + ii, values[ii]);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t pop: function() {\\n\\t\\t return setListBounds(this, 0, -1);\\n\\t\\t },\\n\\t\\t unshift: function() {\\n\\t\\t var values = arguments;\\n\\t\\t return this.withMutations((function(list) {\\n\\t\\t setListBounds(list, -values.length);\\n\\t\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t\\t list.set(ii, values[ii]);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t shift: function() {\\n\\t\\t return setListBounds(this, 1);\\n\\t\\t },\\n\\t\\t merge: function() {\\n\\t\\t return mergeIntoListWith(this, undefined, arguments);\\n\\t\\t },\\n\\t\\t mergeWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__7 = 1; $__7 < arguments.length; $__7++)\\n\\t\\t iters[$__7 - 1] = arguments[$__7];\\n\\t\\t return mergeIntoListWith(this, merger, iters);\\n\\t\\t },\\n\\t\\t mergeDeep: function() {\\n\\t\\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\\n\\t\\t },\\n\\t\\t mergeDeepWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__8 = 1; $__8 < arguments.length; $__8++)\\n\\t\\t iters[$__8 - 1] = arguments[$__8];\\n\\t\\t return mergeIntoListWith(this, deepMerger(merger), iters);\\n\\t\\t },\\n\\t\\t setSize: function(size) {\\n\\t\\t return setListBounds(this, 0, size);\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t var size = this.size;\\n\\t\\t if (wholeSlice(begin, end, size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var index = 0;\\n\\t\\t var values = iterateList(this, reverse);\\n\\t\\t return new Iterator((function() {\\n\\t\\t var value = values();\\n\\t\\t return value === DONE ? iteratorDone() : iteratorValue(type, index++, value);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var index = 0;\\n\\t\\t var values = iterateList(this, reverse);\\n\\t\\t var value;\\n\\t\\t while ((value = values()) !== DONE) {\\n\\t\\t if (fn(value, index++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return index;\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t }}, IndexedCollection);\\n\\t\\tfunction isList(maybeList) {\\n\\t\\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\\n\\t\\t}\\n\\t\\tList.isList = isList;\\n\\t\\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\\n\\t\\tvar ListPrototype = List.prototype;\\n\\t\\tListPrototype[IS_LIST_SENTINEL] = true;\\n\\t\\tListPrototype[DELETE] = ListPrototype.remove;\\n\\t\\tListPrototype.setIn = MapPrototype.setIn;\\n\\t\\tListPrototype.deleteIn = ListPrototype.removeIn = MapPrototype.removeIn;\\n\\t\\tListPrototype.update = MapPrototype.update;\\n\\t\\tListPrototype.updateIn = MapPrototype.updateIn;\\n\\t\\tListPrototype.mergeIn = MapPrototype.mergeIn;\\n\\t\\tListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\\n\\t\\tListPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tListPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tListPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tListPrototype.wasAltered = MapPrototype.wasAltered;\\n\\t\\tvar VNode = function VNode(array, ownerID) {\\n\\t\\t this.array = array;\\n\\t\\t this.ownerID = ownerID;\\n\\t\\t};\\n\\t\\tvar $VNode = VNode;\\n\\t\\t($traceurRuntime.createClass)(VNode, {\\n\\t\\t removeBefore: function(ownerID, level, index) {\\n\\t\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var originIndex = (index >>> level) & MASK;\\n\\t\\t if (originIndex >= this.array.length) {\\n\\t\\t return new $VNode([], ownerID);\\n\\t\\t }\\n\\t\\t var removingFirst = originIndex === 0;\\n\\t\\t var newChild;\\n\\t\\t if (level > 0) {\\n\\t\\t var oldChild = this.array[originIndex];\\n\\t\\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\\n\\t\\t if (newChild === oldChild && removingFirst) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (removingFirst && !newChild) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var editable = editableVNode(this, ownerID);\\n\\t\\t if (!removingFirst) {\\n\\t\\t for (var ii = 0; ii < originIndex; ii++) {\\n\\t\\t editable.array[ii] = undefined;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (newChild) {\\n\\t\\t editable.array[originIndex] = newChild;\\n\\t\\t }\\n\\t\\t return editable;\\n\\t\\t },\\n\\t\\t removeAfter: function(ownerID, level, index) {\\n\\t\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var sizeIndex = ((index - 1) >>> level) & MASK;\\n\\t\\t if (sizeIndex >= this.array.length) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var removingLast = sizeIndex === this.array.length - 1;\\n\\t\\t var newChild;\\n\\t\\t if (level > 0) {\\n\\t\\t var oldChild = this.array[sizeIndex];\\n\\t\\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\\n\\t\\t if (newChild === oldChild && removingLast) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (removingLast && !newChild) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var editable = editableVNode(this, ownerID);\\n\\t\\t if (!removingLast) {\\n\\t\\t editable.array.pop();\\n\\t\\t }\\n\\t\\t if (newChild) {\\n\\t\\t editable.array[sizeIndex] = newChild;\\n\\t\\t }\\n\\t\\t return editable;\\n\\t\\t }\\n\\t\\t}, {});\\n\\t\\tvar DONE = {};\\n\\t\\tfunction iterateList(list, reverse) {\\n\\t\\t var left = list._origin;\\n\\t\\t var right = list._capacity;\\n\\t\\t var tailPos = getTailOffset(right);\\n\\t\\t var tail = list._tail;\\n\\t\\t return iterateNodeOrLeaf(list._root, list._level, 0);\\n\\t\\t function iterateNodeOrLeaf(node, level, offset) {\\n\\t\\t return level === 0 ? iterateLeaf(node, offset) : iterateNode(node, level, offset);\\n\\t\\t }\\n\\t\\t function iterateLeaf(node, offset) {\\n\\t\\t var array = offset === tailPos ? tail && tail.array : node && node.array;\\n\\t\\t var from = offset > left ? 0 : left - offset;\\n\\t\\t var to = right - offset;\\n\\t\\t if (to > SIZE) {\\n\\t\\t to = SIZE;\\n\\t\\t }\\n\\t\\t return (function() {\\n\\t\\t if (from === to) {\\n\\t\\t return DONE;\\n\\t\\t }\\n\\t\\t var idx = reverse ? --to : from++;\\n\\t\\t return array && array[idx];\\n\\t\\t });\\n\\t\\t }\\n\\t\\t function iterateNode(node, level, offset) {\\n\\t\\t var values;\\n\\t\\t var array = node && node.array;\\n\\t\\t var from = offset > left ? 0 : (left - offset) >> level;\\n\\t\\t var to = ((right - offset) >> level) + 1;\\n\\t\\t if (to > SIZE) {\\n\\t\\t to = SIZE;\\n\\t\\t }\\n\\t\\t return (function() {\\n\\t\\t do {\\n\\t\\t if (values) {\\n\\t\\t var value = values();\\n\\t\\t if (value !== DONE) {\\n\\t\\t return value;\\n\\t\\t }\\n\\t\\t values = null;\\n\\t\\t }\\n\\t\\t if (from === to) {\\n\\t\\t return DONE;\\n\\t\\t }\\n\\t\\t var idx = reverse ? --to : from++;\\n\\t\\t values = iterateNodeOrLeaf(array && array[idx], level - SHIFT, offset + (idx << level));\\n\\t\\t } while (true);\\n\\t\\t });\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\\n\\t\\t var list = Object.create(ListPrototype);\\n\\t\\t list.size = capacity - origin;\\n\\t\\t list._origin = origin;\\n\\t\\t list._capacity = capacity;\\n\\t\\t list._level = level;\\n\\t\\t list._root = root;\\n\\t\\t list._tail = tail;\\n\\t\\t list.__ownerID = ownerID;\\n\\t\\t list.__hash = hash;\\n\\t\\t list.__altered = false;\\n\\t\\t return list;\\n\\t\\t}\\n\\t\\tvar EMPTY_LIST;\\n\\t\\tfunction emptyList() {\\n\\t\\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\\n\\t\\t}\\n\\t\\tfunction updateList(list, index, value) {\\n\\t\\t index = wrapIndex(list, index);\\n\\t\\t if (index >= list.size || index < 0) {\\n\\t\\t return list.withMutations((function(list) {\\n\\t\\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t index += list._origin;\\n\\t\\t var newTail = list._tail;\\n\\t\\t var newRoot = list._root;\\n\\t\\t var didAlter = MakeRef(DID_ALTER);\\n\\t\\t if (index >= getTailOffset(list._capacity)) {\\n\\t\\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\\n\\t\\t } else {\\n\\t\\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\\n\\t\\t }\\n\\t\\t if (!didAlter.value) {\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t if (list.__ownerID) {\\n\\t\\t list._root = newRoot;\\n\\t\\t list._tail = newTail;\\n\\t\\t list.__hash = undefined;\\n\\t\\t list.__altered = true;\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\\n\\t\\t}\\n\\t\\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\\n\\t\\t var idx = (index >>> level) & MASK;\\n\\t\\t var nodeHas = node && idx < node.array.length;\\n\\t\\t if (!nodeHas && value === undefined) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t var newNode;\\n\\t\\t if (level > 0) {\\n\\t\\t var lowerNode = node && node.array[idx];\\n\\t\\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\\n\\t\\t if (newLowerNode === lowerNode) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t newNode = editableVNode(node, ownerID);\\n\\t\\t newNode.array[idx] = newLowerNode;\\n\\t\\t return newNode;\\n\\t\\t }\\n\\t\\t if (nodeHas && node.array[idx] === value) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t SetRef(didAlter);\\n\\t\\t newNode = editableVNode(node, ownerID);\\n\\t\\t if (value === undefined && idx === newNode.array.length - 1) {\\n\\t\\t newNode.array.pop();\\n\\t\\t } else {\\n\\t\\t newNode.array[idx] = value;\\n\\t\\t }\\n\\t\\t return newNode;\\n\\t\\t}\\n\\t\\tfunction editableVNode(node, ownerID) {\\n\\t\\t if (ownerID && node && ownerID === node.ownerID) {\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t return new VNode(node ? node.array.slice() : [], ownerID);\\n\\t\\t}\\n\\t\\tfunction listNodeFor(list, rawIndex) {\\n\\t\\t if (rawIndex >= getTailOffset(list._capacity)) {\\n\\t\\t return list._tail;\\n\\t\\t }\\n\\t\\t if (rawIndex < 1 << (list._level + SHIFT)) {\\n\\t\\t var node = list._root;\\n\\t\\t var level = list._level;\\n\\t\\t while (node && level > 0) {\\n\\t\\t node = node.array[(rawIndex >>> level) & MASK];\\n\\t\\t level -= SHIFT;\\n\\t\\t }\\n\\t\\t return node;\\n\\t\\t }\\n\\t\\t}\\n\\t\\tfunction setListBounds(list, begin, end) {\\n\\t\\t var owner = list.__ownerID || new OwnerID();\\n\\t\\t var oldOrigin = list._origin;\\n\\t\\t var oldCapacity = list._capacity;\\n\\t\\t var newOrigin = oldOrigin + begin;\\n\\t\\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\\n\\t\\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t if (newOrigin >= newCapacity) {\\n\\t\\t return list.clear();\\n\\t\\t }\\n\\t\\t var newLevel = list._level;\\n\\t\\t var newRoot = list._root;\\n\\t\\t var offsetShift = 0;\\n\\t\\t while (newOrigin + offsetShift < 0) {\\n\\t\\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\\n\\t\\t newLevel += SHIFT;\\n\\t\\t offsetShift += 1 << newLevel;\\n\\t\\t }\\n\\t\\t if (offsetShift) {\\n\\t\\t newOrigin += offsetShift;\\n\\t\\t oldOrigin += offsetShift;\\n\\t\\t newCapacity += offsetShift;\\n\\t\\t oldCapacity += offsetShift;\\n\\t\\t }\\n\\t\\t var oldTailOffset = getTailOffset(oldCapacity);\\n\\t\\t var newTailOffset = getTailOffset(newCapacity);\\n\\t\\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\\n\\t\\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\\n\\t\\t newLevel += SHIFT;\\n\\t\\t }\\n\\t\\t var oldTail = list._tail;\\n\\t\\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\\n\\t\\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\\n\\t\\t newRoot = editableVNode(newRoot, owner);\\n\\t\\t var node = newRoot;\\n\\t\\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\\n\\t\\t var idx = (oldTailOffset >>> level) & MASK;\\n\\t\\t node = node.array[idx] = editableVNode(node.array[idx], owner);\\n\\t\\t }\\n\\t\\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\\n\\t\\t }\\n\\t\\t if (newCapacity < oldCapacity) {\\n\\t\\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\\n\\t\\t }\\n\\t\\t if (newOrigin >= newTailOffset) {\\n\\t\\t newOrigin -= newTailOffset;\\n\\t\\t newCapacity -= newTailOffset;\\n\\t\\t newLevel = SHIFT;\\n\\t\\t newRoot = null;\\n\\t\\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\\n\\t\\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\\n\\t\\t offsetShift = 0;\\n\\t\\t while (newRoot) {\\n\\t\\t var beginIndex = (newOrigin >>> newLevel) & MASK;\\n\\t\\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t if (beginIndex) {\\n\\t\\t offsetShift += (1 << newLevel) * beginIndex;\\n\\t\\t }\\n\\t\\t newLevel -= SHIFT;\\n\\t\\t newRoot = newRoot.array[beginIndex];\\n\\t\\t }\\n\\t\\t if (newRoot && newOrigin > oldOrigin) {\\n\\t\\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\\n\\t\\t }\\n\\t\\t if (newRoot && newTailOffset < oldTailOffset) {\\n\\t\\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\\n\\t\\t }\\n\\t\\t if (offsetShift) {\\n\\t\\t newOrigin -= offsetShift;\\n\\t\\t newCapacity -= offsetShift;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (list.__ownerID) {\\n\\t\\t list.size = newCapacity - newOrigin;\\n\\t\\t list._origin = newOrigin;\\n\\t\\t list._capacity = newCapacity;\\n\\t\\t list._level = newLevel;\\n\\t\\t list._root = newRoot;\\n\\t\\t list._tail = newTail;\\n\\t\\t list.__hash = undefined;\\n\\t\\t list.__altered = true;\\n\\t\\t return list;\\n\\t\\t }\\n\\t\\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\\n\\t\\t}\\n\\t\\tfunction mergeIntoListWith(list, merger, iterables) {\\n\\t\\t var iters = [];\\n\\t\\t var maxSize = 0;\\n\\t\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t\\t var value = iterables[ii];\\n\\t\\t var iter = IndexedIterable(value);\\n\\t\\t if (iter.size > maxSize) {\\n\\t\\t maxSize = iter.size;\\n\\t\\t }\\n\\t\\t if (!isIterable(value)) {\\n\\t\\t iter = iter.map((function(v) {\\n\\t\\t return fromJS(v);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t iters.push(iter);\\n\\t\\t }\\n\\t\\t if (maxSize > list.size) {\\n\\t\\t list = list.setSize(maxSize);\\n\\t\\t }\\n\\t\\t return mergeIntoCollectionWith(list, merger, iters);\\n\\t\\t}\\n\\t\\tfunction getTailOffset(size) {\\n\\t\\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\\n\\t\\t}\\n\\t\\tvar OrderedMap = function OrderedMap(value) {\\n\\t\\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().withMutations((function(map) {\\n\\t\\t var iter = KeyedIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v, k) {\\n\\t\\t return map.set(k, v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(OrderedMap, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('OrderedMap {', '}');\\n\\t\\t },\\n\\t\\t get: function(k, notSetValue) {\\n\\t\\t var index = this._map.get(k);\\n\\t\\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = 0;\\n\\t\\t this._map.clear();\\n\\t\\t this._list.clear();\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyOrderedMap();\\n\\t\\t },\\n\\t\\t set: function(k, v) {\\n\\t\\t return updateOrderedMap(this, k, v);\\n\\t\\t },\\n\\t\\t remove: function(k) {\\n\\t\\t return updateOrderedMap(this, k, NOT_SET);\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this._map.wasAltered() || this._list.wasAltered();\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._list.__iterate((function(entry) {\\n\\t\\t return entry && fn(entry[1], entry[0], $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return this._list.fromEntrySeq().__iterator(type, reverse);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t\\t var newList = this._list.__ensureOwner(ownerID);\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this._map = newMap;\\n\\t\\t this._list = newList;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t }}, Map);\\n\\t\\tfunction isOrderedMap(maybeOrderedMap) {\\n\\t\\t return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\\n\\t\\t}\\n\\t\\tOrderedMap.isOrderedMap = isOrderedMap;\\n\\t\\tOrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\\n\\t\\tfunction makeOrderedMap(map, list, ownerID, hash) {\\n\\t\\t var omap = Object.create(OrderedMap.prototype);\\n\\t\\t omap.size = map ? map.size : 0;\\n\\t\\t omap._map = map;\\n\\t\\t omap._list = list;\\n\\t\\t omap.__ownerID = ownerID;\\n\\t\\t omap.__hash = hash;\\n\\t\\t return omap;\\n\\t\\t}\\n\\t\\tvar EMPTY_ORDERED_MAP;\\n\\t\\tfunction emptyOrderedMap() {\\n\\t\\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\\n\\t\\t}\\n\\t\\tfunction updateOrderedMap(omap, k, v) {\\n\\t\\t var map = omap._map;\\n\\t\\t var list = omap._list;\\n\\t\\t var i = map.get(k);\\n\\t\\t var has = i !== undefined;\\n\\t\\t var newMap;\\n\\t\\t var newList;\\n\\t\\t if (v === NOT_SET) {\\n\\t\\t if (!has) {\\n\\t\\t return omap;\\n\\t\\t }\\n\\t\\t if (list.size >= SIZE && list.size >= map.size * 2) {\\n\\t\\t newList = list.filter((function(entry, idx) {\\n\\t\\t return entry !== undefined && i !== idx;\\n\\t\\t }));\\n\\t\\t newMap = newList.toKeyedSeq().map((function(entry) {\\n\\t\\t return entry[0];\\n\\t\\t })).flip().toMap();\\n\\t\\t if (omap.__ownerID) {\\n\\t\\t newMap.__ownerID = newList.__ownerID = omap.__ownerID;\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t newMap = map.remove(k);\\n\\t\\t newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\\n\\t\\t }\\n\\t\\t } else {\\n\\t\\t if (has) {\\n\\t\\t if (v === list.get(i)[1]) {\\n\\t\\t return omap;\\n\\t\\t }\\n\\t\\t newMap = map;\\n\\t\\t newList = list.set(i, [k, v]);\\n\\t\\t } else {\\n\\t\\t newMap = map.set(k, list.size);\\n\\t\\t newList = list.set(list.size, [k, v]);\\n\\t\\t }\\n\\t\\t }\\n\\t\\t if (omap.__ownerID) {\\n\\t\\t omap.size = newMap.size;\\n\\t\\t omap._map = newMap;\\n\\t\\t omap._list = newList;\\n\\t\\t omap.__hash = undefined;\\n\\t\\t return omap;\\n\\t\\t }\\n\\t\\t return makeOrderedMap(newMap, newList);\\n\\t\\t}\\n\\t\\tvar Stack = function Stack(value) {\\n\\t\\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\\n\\t\\t};\\n\\t\\tvar $Stack = Stack;\\n\\t\\t($traceurRuntime.createClass)(Stack, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Stack [', ']');\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t var head = this._head;\\n\\t\\t while (head && index--) {\\n\\t\\t head = head.next;\\n\\t\\t }\\n\\t\\t return head ? head.value : notSetValue;\\n\\t\\t },\\n\\t\\t peek: function() {\\n\\t\\t return this._head && this._head.value;\\n\\t\\t },\\n\\t\\t push: function() {\\n\\t\\t if (arguments.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newSize = this.size + arguments.length;\\n\\t\\t var head = this._head;\\n\\t\\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\\n\\t\\t head = {\\n\\t\\t value: arguments[ii],\\n\\t\\t next: head\\n\\t\\t };\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = newSize;\\n\\t\\t this._head = head;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(newSize, head);\\n\\t\\t },\\n\\t\\t pushAll: function(iter) {\\n\\t\\t iter = IndexedIterable(iter);\\n\\t\\t if (iter.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t var newSize = this.size;\\n\\t\\t var head = this._head;\\n\\t\\t iter.reverse().forEach((function(value) {\\n\\t\\t newSize++;\\n\\t\\t head = {\\n\\t\\t value: value,\\n\\t\\t next: head\\n\\t\\t };\\n\\t\\t }));\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = newSize;\\n\\t\\t this._head = head;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(newSize, head);\\n\\t\\t },\\n\\t\\t pop: function() {\\n\\t\\t return this.slice(1);\\n\\t\\t },\\n\\t\\t unshift: function() {\\n\\t\\t return this.push.apply(this, arguments);\\n\\t\\t },\\n\\t\\t unshiftAll: function(iter) {\\n\\t\\t return this.pushAll(iter);\\n\\t\\t },\\n\\t\\t shift: function() {\\n\\t\\t return this.pop.apply(this, arguments);\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = 0;\\n\\t\\t this._head = undefined;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return emptyStack();\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t if (wholeSlice(begin, end, this.size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t\\t if (resolvedEnd !== this.size) {\\n\\t\\t return $traceurRuntime.superCall(this, $Stack.prototype, \\\"slice\\\", [begin, end]);\\n\\t\\t }\\n\\t\\t var newSize = this.size - resolvedBegin;\\n\\t\\t var head = this._head;\\n\\t\\t while (resolvedBegin--) {\\n\\t\\t head = head.next;\\n\\t\\t }\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this.size = newSize;\\n\\t\\t this._head = head;\\n\\t\\t this.__hash = undefined;\\n\\t\\t this.__altered = true;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(newSize, head);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this.__altered = false;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeStack(this.size, this._head, ownerID, this.__hash);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.toSeq().cacheResult.__iterate(fn, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t var node = this._head;\\n\\t\\t while (node) {\\n\\t\\t if (fn(node.value, iterations++, this) === false) {\\n\\t\\t break;\\n\\t\\t }\\n\\t\\t node = node.next;\\n\\t\\t }\\n\\t\\t return iterations;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t if (reverse) {\\n\\t\\t return this.toSeq().cacheResult().__iterator(type, reverse);\\n\\t\\t }\\n\\t\\t var iterations = 0;\\n\\t\\t var node = this._head;\\n\\t\\t return new Iterator((function() {\\n\\t\\t if (node) {\\n\\t\\t var value = node.value;\\n\\t\\t node = node.next;\\n\\t\\t return iteratorValue(type, iterations++, value);\\n\\t\\t }\\n\\t\\t return iteratorDone();\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t}, {of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t }}, IndexedCollection);\\n\\t\\tfunction isStack(maybeStack) {\\n\\t\\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\\n\\t\\t}\\n\\t\\tStack.isStack = isStack;\\n\\t\\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\\n\\t\\tvar StackPrototype = Stack.prototype;\\n\\t\\tStackPrototype[IS_STACK_SENTINEL] = true;\\n\\t\\tStackPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tStackPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tStackPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tStackPrototype.wasAltered = MapPrototype.wasAltered;\\n\\t\\tfunction makeStack(size, head, ownerID, hash) {\\n\\t\\t var map = Object.create(StackPrototype);\\n\\t\\t map.size = size;\\n\\t\\t map._head = head;\\n\\t\\t map.__ownerID = ownerID;\\n\\t\\t map.__hash = hash;\\n\\t\\t map.__altered = false;\\n\\t\\t return map;\\n\\t\\t}\\n\\t\\tvar EMPTY_STACK;\\n\\t\\tfunction emptyStack() {\\n\\t\\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\\n\\t\\t}\\n\\t\\tvar Set = function Set(value) {\\n\\t\\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().withMutations((function(set) {\\n\\t\\t var iter = SetIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v) {\\n\\t\\t return set.add(v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Set, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString('Set {', '}');\\n\\t\\t },\\n\\t\\t has: function(value) {\\n\\t\\t return this._map.has(value);\\n\\t\\t },\\n\\t\\t add: function(value) {\\n\\t\\t return updateSet(this, this._map.set(value, true));\\n\\t\\t },\\n\\t\\t remove: function(value) {\\n\\t\\t return updateSet(this, this._map.remove(value));\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t return updateSet(this, this._map.clear());\\n\\t\\t },\\n\\t\\t union: function() {\\n\\t\\t for (var iters = [],\\n\\t\\t $__9 = 0; $__9 < arguments.length; $__9++)\\n\\t\\t iters[$__9] = arguments[$__9];\\n\\t\\t iters = iters.filter((function(x) {\\n\\t\\t return x.size !== 0;\\n\\t\\t }));\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t if (this.size === 0 && iters.length === 1) {\\n\\t\\t return this.constructor(iters[0]);\\n\\t\\t }\\n\\t\\t return this.withMutations((function(set) {\\n\\t\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t\\t SetIterable(iters[ii]).forEach((function(value) {\\n\\t\\t return set.add(value);\\n\\t\\t }));\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t intersect: function() {\\n\\t\\t for (var iters = [],\\n\\t\\t $__10 = 0; $__10 < arguments.length; $__10++)\\n\\t\\t iters[$__10] = arguments[$__10];\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t iters = iters.map((function(iter) {\\n\\t\\t return SetIterable(iter);\\n\\t\\t }));\\n\\t\\t var originalSet = this;\\n\\t\\t return this.withMutations((function(set) {\\n\\t\\t originalSet.forEach((function(value) {\\n\\t\\t if (!iters.every((function(iter) {\\n\\t\\t return iter.contains(value);\\n\\t\\t }))) {\\n\\t\\t set.remove(value);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t subtract: function() {\\n\\t\\t for (var iters = [],\\n\\t\\t $__11 = 0; $__11 < arguments.length; $__11++)\\n\\t\\t iters[$__11] = arguments[$__11];\\n\\t\\t if (iters.length === 0) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t iters = iters.map((function(iter) {\\n\\t\\t return SetIterable(iter);\\n\\t\\t }));\\n\\t\\t var originalSet = this;\\n\\t\\t return this.withMutations((function(set) {\\n\\t\\t originalSet.forEach((function(value) {\\n\\t\\t if (iters.some((function(iter) {\\n\\t\\t return iter.contains(value);\\n\\t\\t }))) {\\n\\t\\t set.remove(value);\\n\\t\\t }\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t merge: function() {\\n\\t\\t return this.union.apply(this, arguments);\\n\\t\\t },\\n\\t\\t mergeWith: function(merger) {\\n\\t\\t for (var iters = [],\\n\\t\\t $__12 = 1; $__12 < arguments.length; $__12++)\\n\\t\\t iters[$__12 - 1] = arguments[$__12];\\n\\t\\t return this.union.apply(this, iters);\\n\\t\\t },\\n\\t\\t sort: function(comparator) {\\n\\t\\t return OrderedSet(sortFactory(this, comparator));\\n\\t\\t },\\n\\t\\t sortBy: function(mapper, comparator) {\\n\\t\\t return OrderedSet(sortFactory(this, comparator, mapper));\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this._map.wasAltered();\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return this._map.__iterate((function(_, k) {\\n\\t\\t return fn(k, k, $__0);\\n\\t\\t }), reverse);\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t return this._map.map((function(_, k) {\\n\\t\\t return k;\\n\\t\\t })).__iterator(type, reverse);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this._map = newMap;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return this.__make(newMap, ownerID);\\n\\t\\t }\\n\\t\\t}, {\\n\\t\\t of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t },\\n\\t\\t fromKeys: function(value) {\\n\\t\\t return this(KeyedIterable(value).keySeq());\\n\\t\\t }\\n\\t\\t}, SetCollection);\\n\\t\\tfunction isSet(maybeSet) {\\n\\t\\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\\n\\t\\t}\\n\\t\\tSet.isSet = isSet;\\n\\t\\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\\n\\t\\tvar SetPrototype = Set.prototype;\\n\\t\\tSetPrototype[IS_SET_SENTINEL] = true;\\n\\t\\tSetPrototype[DELETE] = SetPrototype.remove;\\n\\t\\tSetPrototype.mergeDeep = SetPrototype.merge;\\n\\t\\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\\n\\t\\tSetPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tSetPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tSetPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tSetPrototype.__empty = emptySet;\\n\\t\\tSetPrototype.__make = makeSet;\\n\\t\\tfunction updateSet(set, newMap) {\\n\\t\\t if (set.__ownerID) {\\n\\t\\t set.size = newMap.size;\\n\\t\\t set._map = newMap;\\n\\t\\t return set;\\n\\t\\t }\\n\\t\\t return newMap === set._map ? set : newMap.size === 0 ? set.__empty() : set.__make(newMap);\\n\\t\\t}\\n\\t\\tfunction makeSet(map, ownerID) {\\n\\t\\t var set = Object.create(SetPrototype);\\n\\t\\t set.size = map ? map.size : 0;\\n\\t\\t set._map = map;\\n\\t\\t set.__ownerID = ownerID;\\n\\t\\t return set;\\n\\t\\t}\\n\\t\\tvar EMPTY_SET;\\n\\t\\tfunction emptySet() {\\n\\t\\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\\n\\t\\t}\\n\\t\\tvar OrderedSet = function OrderedSet(value) {\\n\\t\\t return value === null || value === undefined ? emptyOrderedSet() : isOrderedSet(value) ? value : emptyOrderedSet().withMutations((function(set) {\\n\\t\\t var iter = SetIterable(value);\\n\\t\\t assertNotInfinite(iter.size);\\n\\t\\t iter.forEach((function(v) {\\n\\t\\t return set.add(v);\\n\\t\\t }));\\n\\t\\t }));\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(OrderedSet, {toString: function() {\\n\\t\\t return this.__toString('OrderedSet {', '}');\\n\\t\\t }}, {\\n\\t\\t of: function() {\\n\\t\\t return this(arguments);\\n\\t\\t },\\n\\t\\t fromKeys: function(value) {\\n\\t\\t return this(KeyedIterable(value).keySeq());\\n\\t\\t }\\n\\t\\t}, Set);\\n\\t\\tfunction isOrderedSet(maybeOrderedSet) {\\n\\t\\t return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\\n\\t\\t}\\n\\t\\tOrderedSet.isOrderedSet = isOrderedSet;\\n\\t\\tvar OrderedSetPrototype = OrderedSet.prototype;\\n\\t\\tOrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\\n\\t\\tOrderedSetPrototype.__empty = emptyOrderedSet;\\n\\t\\tOrderedSetPrototype.__make = makeOrderedSet;\\n\\t\\tfunction makeOrderedSet(map, ownerID) {\\n\\t\\t var set = Object.create(OrderedSetPrototype);\\n\\t\\t set.size = map ? map.size : 0;\\n\\t\\t set._map = map;\\n\\t\\t set.__ownerID = ownerID;\\n\\t\\t return set;\\n\\t\\t}\\n\\t\\tvar EMPTY_ORDERED_SET;\\n\\t\\tfunction emptyOrderedSet() {\\n\\t\\t return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\\n\\t\\t}\\n\\t\\tvar Record = function Record(defaultValues, name) {\\n\\t\\t var RecordType = function Record(values) {\\n\\t\\t if (!(this instanceof RecordType)) {\\n\\t\\t return new RecordType(values);\\n\\t\\t }\\n\\t\\t this._map = Map(values);\\n\\t\\t };\\n\\t\\t var keys = Object.keys(defaultValues);\\n\\t\\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\\n\\t\\t RecordTypePrototype.constructor = RecordType;\\n\\t\\t name && (RecordTypePrototype._name = name);\\n\\t\\t RecordTypePrototype._defaultValues = defaultValues;\\n\\t\\t RecordTypePrototype._keys = keys;\\n\\t\\t RecordTypePrototype.size = keys.length;\\n\\t\\t try {\\n\\t\\t keys.forEach((function(key) {\\n\\t\\t Object.defineProperty(RecordType.prototype, key, {\\n\\t\\t get: function() {\\n\\t\\t return this.get(key);\\n\\t\\t },\\n\\t\\t set: function(value) {\\n\\t\\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\\n\\t\\t this.set(key, value);\\n\\t\\t }\\n\\t\\t });\\n\\t\\t }));\\n\\t\\t } catch (error) {}\\n\\t\\t return RecordType;\\n\\t\\t};\\n\\t\\t($traceurRuntime.createClass)(Record, {\\n\\t\\t toString: function() {\\n\\t\\t return this.__toString(recordName(this) + ' {', '}');\\n\\t\\t },\\n\\t\\t has: function(k) {\\n\\t\\t return this._defaultValues.hasOwnProperty(k);\\n\\t\\t },\\n\\t\\t get: function(k, notSetValue) {\\n\\t\\t if (!this.has(k)) {\\n\\t\\t return notSetValue;\\n\\t\\t }\\n\\t\\t var defaultVal = this._defaultValues[k];\\n\\t\\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\\n\\t\\t },\\n\\t\\t clear: function() {\\n\\t\\t if (this.__ownerID) {\\n\\t\\t this._map && this._map.clear();\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var SuperRecord = Object.getPrototypeOf(this).constructor;\\n\\t\\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\\n\\t\\t },\\n\\t\\t set: function(k, v) {\\n\\t\\t if (!this.has(k)) {\\n\\t\\t throw new Error('Cannot set unknown key \\\"' + k + '\\\" on ' + recordName(this));\\n\\t\\t }\\n\\t\\t var newMap = this._map && this._map.set(k, v);\\n\\t\\t if (this.__ownerID || newMap === this._map) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeRecord(this, newMap);\\n\\t\\t },\\n\\t\\t remove: function(k) {\\n\\t\\t if (!this.has(k)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map && this._map.remove(k);\\n\\t\\t if (this.__ownerID || newMap === this._map) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeRecord(this, newMap);\\n\\t\\t },\\n\\t\\t wasAltered: function() {\\n\\t\\t return this._map.wasAltered();\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t\\t return $__0.get(k);\\n\\t\\t })).__iterator(type, reverse);\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t\\t return $__0.get(k);\\n\\t\\t })).__iterate(fn, reverse);\\n\\t\\t },\\n\\t\\t __ensureOwner: function(ownerID) {\\n\\t\\t if (ownerID === this.__ownerID) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t var newMap = this._map && this._map.__ensureOwner(ownerID);\\n\\t\\t if (!ownerID) {\\n\\t\\t this.__ownerID = ownerID;\\n\\t\\t this._map = newMap;\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t return makeRecord(this, newMap, ownerID);\\n\\t\\t }\\n\\t\\t}, {}, KeyedCollection);\\n\\t\\tvar RecordPrototype = Record.prototype;\\n\\t\\tRecordPrototype[DELETE] = RecordPrototype.remove;\\n\\t\\tRecordPrototype.deleteIn = RecordPrototype.removeIn = MapPrototype.removeIn;\\n\\t\\tRecordPrototype.merge = MapPrototype.merge;\\n\\t\\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\\n\\t\\tRecordPrototype.mergeIn = MapPrototype.mergeIn;\\n\\t\\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\\n\\t\\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\\n\\t\\tRecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\\n\\t\\tRecordPrototype.setIn = MapPrototype.setIn;\\n\\t\\tRecordPrototype.update = MapPrototype.update;\\n\\t\\tRecordPrototype.updateIn = MapPrototype.updateIn;\\n\\t\\tRecordPrototype.withMutations = MapPrototype.withMutations;\\n\\t\\tRecordPrototype.asMutable = MapPrototype.asMutable;\\n\\t\\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\\n\\t\\tfunction makeRecord(likeRecord, map, ownerID) {\\n\\t\\t var record = Object.create(Object.getPrototypeOf(likeRecord));\\n\\t\\t record._map = map;\\n\\t\\t record.__ownerID = ownerID;\\n\\t\\t return record;\\n\\t\\t}\\n\\t\\tfunction recordName(record) {\\n\\t\\t return record._name || record.constructor.name;\\n\\t\\t}\\n\\t\\tvar Range = function Range(start, end, step) {\\n\\t\\t if (!(this instanceof $Range)) {\\n\\t\\t return new $Range(start, end, step);\\n\\t\\t }\\n\\t\\t invariant(step !== 0, 'Cannot step a Range by 0');\\n\\t\\t start = start || 0;\\n\\t\\t if (end === undefined) {\\n\\t\\t end = Infinity;\\n\\t\\t }\\n\\t\\t if (start === end && __EMPTY_RANGE) {\\n\\t\\t return __EMPTY_RANGE;\\n\\t\\t }\\n\\t\\t step = step === undefined ? 1 : Math.abs(step);\\n\\t\\t if (end < start) {\\n\\t\\t step = -step;\\n\\t\\t }\\n\\t\\t this._start = start;\\n\\t\\t this._end = end;\\n\\t\\t this._step = step;\\n\\t\\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\\n\\t\\t};\\n\\t\\tvar $Range = Range;\\n\\t\\t($traceurRuntime.createClass)(Range, {\\n\\t\\t toString: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return 'Range []';\\n\\t\\t }\\n\\t\\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\\n\\t\\t },\\n\\t\\t contains: function(searchValue) {\\n\\t\\t var possibleIndex = (searchValue - this._start) / this._step;\\n\\t\\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t if (wholeSlice(begin, end, this.size)) {\\n\\t\\t return this;\\n\\t\\t }\\n\\t\\t begin = resolveBegin(begin, this.size);\\n\\t\\t end = resolveEnd(end, this.size);\\n\\t\\t if (end <= begin) {\\n\\t\\t return __EMPTY_RANGE;\\n\\t\\t }\\n\\t\\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\\n\\t\\t },\\n\\t\\t indexOf: function(searchValue) {\\n\\t\\t var offsetValue = searchValue - this._start;\\n\\t\\t if (offsetValue % this._step === 0) {\\n\\t\\t var index = offsetValue / this._step;\\n\\t\\t if (index >= 0 && index < this.size) {\\n\\t\\t return index;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return -1;\\n\\t\\t },\\n\\t\\t lastIndexOf: function(searchValue) {\\n\\t\\t return this.indexOf(searchValue);\\n\\t\\t },\\n\\t\\t take: function(amount) {\\n\\t\\t return this.slice(0, Math.max(0, amount));\\n\\t\\t },\\n\\t\\t skip: function(amount) {\\n\\t\\t return this.slice(Math.max(0, amount));\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t var maxIndex = this.size - 1;\\n\\t\\t var step = this._step;\\n\\t\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t\\t if (fn(value, ii, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t value += reverse ? -step : step;\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var maxIndex = this.size - 1;\\n\\t\\t var step = this._step;\\n\\t\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t var v = value;\\n\\t\\t value += reverse ? -step : step;\\n\\t\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t equals: function(other) {\\n\\t\\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : deepEqual(this, other);\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar RangePrototype = Range.prototype;\\n\\t\\tRangePrototype.__toJS = RangePrototype.toArray;\\n\\t\\tRangePrototype.first = ListPrototype.first;\\n\\t\\tRangePrototype.last = ListPrototype.last;\\n\\t\\tvar __EMPTY_RANGE = Range(0, 0);\\n\\t\\tvar Repeat = function Repeat(value, times) {\\n\\t\\t if (times <= 0 && EMPTY_REPEAT) {\\n\\t\\t return EMPTY_REPEAT;\\n\\t\\t }\\n\\t\\t if (!(this instanceof $Repeat)) {\\n\\t\\t return new $Repeat(value, times);\\n\\t\\t }\\n\\t\\t this._value = value;\\n\\t\\t this.size = times === undefined ? Infinity : Math.max(0, times);\\n\\t\\t if (this.size === 0) {\\n\\t\\t EMPTY_REPEAT = this;\\n\\t\\t }\\n\\t\\t};\\n\\t\\tvar $Repeat = Repeat;\\n\\t\\t($traceurRuntime.createClass)(Repeat, {\\n\\t\\t toString: function() {\\n\\t\\t if (this.size === 0) {\\n\\t\\t return 'Repeat []';\\n\\t\\t }\\n\\t\\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\\n\\t\\t },\\n\\t\\t get: function(index, notSetValue) {\\n\\t\\t return this.has(index) ? this._value : notSetValue;\\n\\t\\t },\\n\\t\\t contains: function(searchValue) {\\n\\t\\t return is(this._value, searchValue);\\n\\t\\t },\\n\\t\\t slice: function(begin, end) {\\n\\t\\t var size = this.size;\\n\\t\\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\\n\\t\\t },\\n\\t\\t reverse: function() {\\n\\t\\t return this;\\n\\t\\t },\\n\\t\\t indexOf: function(searchValue) {\\n\\t\\t if (is(this._value, searchValue)) {\\n\\t\\t return 0;\\n\\t\\t }\\n\\t\\t return -1;\\n\\t\\t },\\n\\t\\t lastIndexOf: function(searchValue) {\\n\\t\\t if (is(this._value, searchValue)) {\\n\\t\\t return this.size;\\n\\t\\t }\\n\\t\\t return -1;\\n\\t\\t },\\n\\t\\t __iterate: function(fn, reverse) {\\n\\t\\t for (var ii = 0; ii < this.size; ii++) {\\n\\t\\t if (fn(this._value, ii, this) === false) {\\n\\t\\t return ii + 1;\\n\\t\\t }\\n\\t\\t }\\n\\t\\t return ii;\\n\\t\\t },\\n\\t\\t __iterator: function(type, reverse) {\\n\\t\\t var $__0 = this;\\n\\t\\t var ii = 0;\\n\\t\\t return new Iterator((function() {\\n\\t\\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\\n\\t\\t }));\\n\\t\\t },\\n\\t\\t equals: function(other) {\\n\\t\\t return other instanceof $Repeat ? is(this._value, other._value) : deepEqual(other);\\n\\t\\t }\\n\\t\\t}, {}, IndexedSeq);\\n\\t\\tvar RepeatPrototype = Repeat.prototype;\\n\\t\\tRepeatPrototype.last = RepeatPrototype.first;\\n\\t\\tRepeatPrototype.has = RangePrototype.has;\\n\\t\\tRepeatPrototype.take = RangePrototype.take;\\n\\t\\tRepeatPrototype.skip = RangePrototype.skip;\\n\\t\\tRepeatPrototype.__toJS = RangePrototype.__toJS;\\n\\t\\tvar EMPTY_REPEAT;\\n\\t\\tvar Immutable = {\\n\\t\\t Iterable: Iterable,\\n\\t\\t Seq: Seq,\\n\\t\\t Collection: Collection,\\n\\t\\t Map: Map,\\n\\t\\t OrderedMap: OrderedMap,\\n\\t\\t List: List,\\n\\t\\t Stack: Stack,\\n\\t\\t Set: Set,\\n\\t\\t OrderedSet: OrderedSet,\\n\\t\\t Record: Record,\\n\\t\\t Range: Range,\\n\\t\\t Repeat: Repeat,\\n\\t\\t is: is,\\n\\t\\t fromJS: fromJS\\n\\t\\t};\\n\\n\\t\\t return Immutable;\\n\\t\\t}\",\n \"function Module(stdlib, imports, buffer) {\\n \\\"use asm\\\";\\n\\n function f() {\\n return 281474976710655 * 1048575 | 0;\\n }\\n\\n return {\\n f: f\\n };\\n}\",\n \"function v7(v8,v9) {\\n const v10 = gc;\\n // v10 = .function([] => .undefined)\\n let v13 = 0;\\n const v16 = [13.37,13.37,13.37,13.37];\\n // v16 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v18 = [1337,1337,1337,1337];\\n // v18 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v19 = [3697200800,v16,v18];\\n // v19 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v20 = v6[0];\\n // v20 = .unknown\\n const v21 = Symbol;\\n // v21 = .object(ofGroup: SymbolConstructor, withProperties: [\\\"match\\\", \\\"asyncIterator\\\", \\\"search\\\", \\\"iterator\\\", \\\"replace\\\", \\\"isConcatSpreadable\\\", \\\"toStringTag\\\", \\\"split\\\", \\\"toPrimitive\\\", \\\"matchAll\\\", \\\"hasInstance\\\", \\\"unscopable\\\", \\\"species\\\"], withMethods: [\\\"for\\\", \\\"keyFor\\\"]) + .function([.string] => .object(ofGroup: Symbol, withProperties: [\\\"__proto__\\\", \\\"description\\\"]))\\n for (let v25 = 0; v25 < 4; v25 = v25 + 1) {\\n }\\n function v27(v28,v29) {\\n }\\n do {\\n const v31 = [13.37,13.37,13.37,13.37];\\n // v31 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v34 = [1337,1337,Function,1337];\\n // v34 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v35 = {__proto__:v34,a:v31,c:1337,d:Function,e:v34,toString:Function};\\n // v35 = .object(ofGroup: Object, withProperties: [\\\"a\\\", \\\"__proto__\\\", \\\"toString\\\", \\\"d\\\", \\\"c\\\", \\\"e\\\"])\\n let v39 = 0;\\n while (v39 < 1337) {\\n const v40 = v39 + 1;\\n // v40 = .primitive\\n v39 = v40;\\n }\\n const v41 = [13.37,13.37,13.37,13.37];\\n // v41 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v43 = [1337,1337,1337,1337];\\n // v43 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v44 = [3697200800,v41,v43];\\n // v44 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v45 = v13 + 1;\\n // v45 = .primitive\\n function v48(v49,v50) {\\n return v44;\\n }\\n const v51 = [1337,1337,1337,1337];\\n // v51 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n for (let v54 = 0; v54 < 100; v54 = v54 + 100) {\\n }\\n const v55 = {__proto__:v51,a:1337,c:1337,d:Function,e:v51,toString:Function};\\n // v55 = .object(ofGroup: Object, withProperties: [\\\"e\\\", \\\"c\\\", \\\"__proto__\\\", \\\"toString\\\", \\\"d\\\", \\\"a\\\"])\\n const v56 = v48(1337,v41,...v55);\\n // v56 = .unknown\\n v13 = v45;\\n } while (v13 < 7);\\n return v3;\\n}\",\n \"function e(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function universalModule() {\\n\\t var $Object = Object;\\n\\n\\tfunction createClass(ctor, methods, staticMethods, superClass) {\\n\\t var proto;\\n\\t if (superClass) {\\n\\t var superProto = superClass.prototype;\\n\\t proto = $Object.create(superProto);\\n\\t } else {\\n\\t proto = ctor.prototype;\\n\\t }\\n\\t $Object.keys(methods).forEach(function (key) {\\n\\t proto[key] = methods[key];\\n\\t });\\n\\t $Object.keys(staticMethods).forEach(function (key) {\\n\\t ctor[key] = staticMethods[key];\\n\\t });\\n\\t proto.constructor = ctor;\\n\\t ctor.prototype = proto;\\n\\t return ctor;\\n\\t}\\n\\n\\tfunction superCall(self, proto, name, args) {\\n\\t return $Object.getPrototypeOf(proto)[name].apply(self, args);\\n\\t}\\n\\n\\tfunction defaultSuperCall(self, proto, args) {\\n\\t superCall(self, proto, 'constructor', args);\\n\\t}\\n\\n\\tvar $traceurRuntime = {};\\n\\t$traceurRuntime.createClass = createClass;\\n\\t$traceurRuntime.superCall = superCall;\\n\\t$traceurRuntime.defaultSuperCall = defaultSuperCall;\\n\\t\\\"use strict\\\";\\n\\tfunction is(first, second) {\\n\\t if (first === second) {\\n\\t return first !== 0 || second !== 0 || 1 / first === 1 / second;\\n\\t }\\n\\t if (first !== first) {\\n\\t return second !== second;\\n\\t }\\n\\t if (first && typeof first.equals === 'function') {\\n\\t return first.equals(second);\\n\\t }\\n\\t return false;\\n\\t}\\n\\tfunction invariant(condition, error) {\\n\\t if (!condition)\\n\\t throw new Error(error);\\n\\t}\\n\\tvar DELETE = 'delete';\\n\\tvar SHIFT = 5;\\n\\tvar SIZE = 1 << SHIFT;\\n\\tvar MASK = SIZE - 1;\\n\\tvar NOT_SET = {};\\n\\tvar CHANGE_LENGTH = {value: false};\\n\\tvar DID_ALTER = {value: false};\\n\\tfunction MakeRef(ref) {\\n\\t ref.value = false;\\n\\t return ref;\\n\\t}\\n\\tfunction SetRef(ref) {\\n\\t ref && (ref.value = true);\\n\\t}\\n\\tfunction OwnerID() {}\\n\\tfunction arrCopy(arr, offset) {\\n\\t offset = offset || 0;\\n\\t var len = Math.max(0, arr.length - offset);\\n\\t var newArr = new Array(len);\\n\\t for (var ii = 0; ii < len; ii++) {\\n\\t newArr[ii] = arr[ii + offset];\\n\\t }\\n\\t return newArr;\\n\\t}\\n\\tfunction assertNotInfinite(size) {\\n\\t invariant(size !== Infinity, 'Cannot perform this action with an infinite size.');\\n\\t}\\n\\tfunction ensureSize(iter) {\\n\\t if (iter.size === undefined) {\\n\\t iter.size = iter.__iterate(returnTrue);\\n\\t }\\n\\t return iter.size;\\n\\t}\\n\\tfunction wrapIndex(iter, index) {\\n\\t return index >= 0 ? index : ensureSize(iter) + index;\\n\\t}\\n\\tfunction returnTrue() {\\n\\t return true;\\n\\t}\\n\\tfunction wholeSlice(begin, end, size) {\\n\\t return (begin === 0 || (size !== undefined && begin <= -size)) && (end === undefined || (size !== undefined && end >= size));\\n\\t}\\n\\tfunction resolveBegin(begin, size) {\\n\\t return resolveIndex(begin, size, 0);\\n\\t}\\n\\tfunction resolveEnd(end, size) {\\n\\t return resolveIndex(end, size, size);\\n\\t}\\n\\tfunction resolveIndex(index, size, defaultIndex) {\\n\\t return index === undefined ? defaultIndex : index < 0 ? Math.max(0, size + index) : size === undefined ? index : Math.min(size, index);\\n\\t}\\n\\tfunction hash(o) {\\n\\t if (!o) {\\n\\t return 0;\\n\\t }\\n\\t if (o === true) {\\n\\t return 1;\\n\\t }\\n\\t var type = typeof o;\\n\\t if (type === 'number') {\\n\\t if ((o | 0) === o) {\\n\\t return o & HASH_MAX_VAL;\\n\\t }\\n\\t o = '' + o;\\n\\t type = 'string';\\n\\t }\\n\\t if (type === 'string') {\\n\\t return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\\n\\t }\\n\\t if (o.hashCode) {\\n\\t return hash(typeof o.hashCode === 'function' ? o.hashCode() : o.hashCode);\\n\\t }\\n\\t return hashJSObj(o);\\n\\t}\\n\\tfunction cachedHashString(string) {\\n\\t var hash = stringHashCache[string];\\n\\t if (hash === undefined) {\\n\\t hash = hashString(string);\\n\\t if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\\n\\t STRING_HASH_CACHE_SIZE = 0;\\n\\t stringHashCache = {};\\n\\t }\\n\\t STRING_HASH_CACHE_SIZE++;\\n\\t stringHashCache[string] = hash;\\n\\t }\\n\\t return hash;\\n\\t}\\n\\tfunction hashString(string) {\\n\\t var hash = 0;\\n\\t for (var ii = 0; ii < string.length; ii++) {\\n\\t hash = (31 * hash + string.charCodeAt(ii)) & HASH_MAX_VAL;\\n\\t }\\n\\t return hash;\\n\\t}\\n\\tfunction hashJSObj(obj) {\\n\\t var hash = weakMap && weakMap.get(obj);\\n\\t if (hash)\\n\\t return hash;\\n\\t hash = obj[UID_HASH_KEY];\\n\\t if (hash)\\n\\t return hash;\\n\\t if (!canDefineProperty) {\\n\\t hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\\n\\t if (hash)\\n\\t return hash;\\n\\t hash = getIENodeHash(obj);\\n\\t if (hash)\\n\\t return hash;\\n\\t }\\n\\t if (Object.isExtensible && !Object.isExtensible(obj)) {\\n\\t throw new Error('Non-extensible objects are not allowed as keys.');\\n\\t }\\n\\t hash = ++objHashUID & HASH_MAX_VAL;\\n\\t if (weakMap) {\\n\\t weakMap.set(obj, hash);\\n\\t } else if (canDefineProperty) {\\n\\t Object.defineProperty(obj, UID_HASH_KEY, {\\n\\t 'enumerable': false,\\n\\t 'configurable': false,\\n\\t 'writable': false,\\n\\t 'value': hash\\n\\t });\\n\\t } else if (obj.propertyIsEnumerable && obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\\n\\t obj.propertyIsEnumerable = function() {\\n\\t return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\\n\\t };\\n\\t obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\\n\\t } else if (obj.nodeType) {\\n\\t obj[UID_HASH_KEY] = hash;\\n\\t } else {\\n\\t throw new Error('Unable to set a non-enumerable property on object.');\\n\\t }\\n\\t return hash;\\n\\t}\\n\\tvar canDefineProperty = (function() {\\n\\t try {\\n\\t Object.defineProperty({}, 'x', {});\\n\\t return true;\\n\\t } catch (e) {\\n\\t return false;\\n\\t }\\n\\t}());\\n\\tfunction getIENodeHash(node) {\\n\\t if (node && node.nodeType > 0) {\\n\\t switch (node.nodeType) {\\n\\t case 1:\\n\\t return node.uniqueID;\\n\\t case 9:\\n\\t return node.documentElement && node.documentElement.uniqueID;\\n\\t }\\n\\t }\\n\\t}\\n\\tvar weakMap = typeof WeakMap === 'function' && new WeakMap();\\n\\tvar HASH_MAX_VAL = 0x7FFFFFFF;\\n\\tvar objHashUID = 0;\\n\\tvar UID_HASH_KEY = '__immutablehash__';\\n\\tif (typeof Symbol === 'function') {\\n\\t UID_HASH_KEY = Symbol(UID_HASH_KEY);\\n\\t}\\n\\tvar STRING_HASH_CACHE_MIN_STRLEN = 16;\\n\\tvar STRING_HASH_CACHE_MAX_SIZE = 255;\\n\\tvar STRING_HASH_CACHE_SIZE = 0;\\n\\tvar stringHashCache = {};\\n\\tvar ITERATE_KEYS = 0;\\n\\tvar ITERATE_VALUES = 1;\\n\\tvar ITERATE_ENTRIES = 2;\\n\\tvar FAUX_ITERATOR_SYMBOL = '@@iterator';\\n\\tvar REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\\n\\tvar ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\\n\\tvar Iterator = function Iterator(next) {\\n\\t this.next = next;\\n\\t};\\n\\t($traceurRuntime.createClass)(Iterator, {toString: function() {\\n\\t return '[Iterator]';\\n\\t }}, {});\\n\\tIterator.KEYS = ITERATE_KEYS;\\n\\tIterator.VALUES = ITERATE_VALUES;\\n\\tIterator.ENTRIES = ITERATE_ENTRIES;\\n\\tvar IteratorPrototype = Iterator.prototype;\\n\\tIteratorPrototype.inspect = IteratorPrototype.toSource = function() {\\n\\t return this.toString();\\n\\t};\\n\\tIteratorPrototype[ITERATOR_SYMBOL] = function() {\\n\\t return this;\\n\\t};\\n\\tfunction iteratorValue(type, k, v, iteratorResult) {\\n\\t var value = type === 0 ? k : type === 1 ? v : [k, v];\\n\\t iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\\n\\t value: value,\\n\\t done: false\\n\\t });\\n\\t return iteratorResult;\\n\\t}\\n\\tfunction iteratorDone() {\\n\\t return {\\n\\t value: undefined,\\n\\t done: true\\n\\t };\\n\\t}\\n\\tfunction hasIterator(maybeIterable) {\\n\\t return !!_iteratorFn(maybeIterable);\\n\\t}\\n\\tfunction isIterator(maybeIterator) {\\n\\t return maybeIterator && typeof maybeIterator.next === 'function';\\n\\t}\\n\\tfunction getIterator(iterable) {\\n\\t var iteratorFn = _iteratorFn(iterable);\\n\\t return iteratorFn && iteratorFn.call(iterable);\\n\\t}\\n\\tfunction _iteratorFn(iterable) {\\n\\t var iteratorFn = iterable && ((REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) || iterable[FAUX_ITERATOR_SYMBOL]);\\n\\t if (typeof iteratorFn === 'function') {\\n\\t return iteratorFn;\\n\\t }\\n\\t}\\n\\tvar Iterable = function Iterable(value) {\\n\\t return isIterable(value) ? value : Seq(value);\\n\\t};\\n\\tvar $Iterable = Iterable;\\n\\t($traceurRuntime.createClass)(Iterable, {\\n\\t toArray: function() {\\n\\t assertNotInfinite(this.size);\\n\\t var array = new Array(this.size || 0);\\n\\t this.valueSeq().__iterate((function(v, i) {\\n\\t array[i] = v;\\n\\t }));\\n\\t return array;\\n\\t },\\n\\t toIndexedSeq: function() {\\n\\t return new ToIndexedSequence(this);\\n\\t },\\n\\t toJS: function() {\\n\\t return this.toSeq().map((function(value) {\\n\\t return value && typeof value.toJS === 'function' ? value.toJS() : value;\\n\\t })).__toJS();\\n\\t },\\n\\t toKeyedSeq: function() {\\n\\t return new ToKeyedSequence(this, true);\\n\\t },\\n\\t toMap: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return Map(this.toKeyedSeq());\\n\\t },\\n\\t toObject: function() {\\n\\t assertNotInfinite(this.size);\\n\\t var object = {};\\n\\t this.__iterate((function(v, k) {\\n\\t object[k] = v;\\n\\t }));\\n\\t return object;\\n\\t },\\n\\t toOrderedMap: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return OrderedMap(this.toKeyedSeq());\\n\\t },\\n\\t toSet: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return Set(isKeyed(this) ? this.valueSeq() : this);\\n\\t },\\n\\t toSetSeq: function() {\\n\\t return new ToSetSequence(this);\\n\\t },\\n\\t toSeq: function() {\\n\\t return isIndexed(this) ? this.toIndexedSeq() : isKeyed(this) ? this.toKeyedSeq() : this.toSetSeq();\\n\\t },\\n\\t toStack: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return Stack(isKeyed(this) ? this.valueSeq() : this);\\n\\t },\\n\\t toList: function() {\\n\\t assertNotInfinite(this.size);\\n\\t return List(isKeyed(this) ? this.valueSeq() : this);\\n\\t },\\n\\t toString: function() {\\n\\t return '[Iterable]';\\n\\t },\\n\\t __toString: function(head, tail) {\\n\\t if (this.size === 0) {\\n\\t return head + tail;\\n\\t }\\n\\t return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\\n\\t },\\n\\t concat: function() {\\n\\t for (var values = [],\\n\\t $__2 = 0; $__2 < arguments.length; $__2++)\\n\\t values[$__2] = arguments[$__2];\\n\\t return reify(this, concatFactory(this, values));\\n\\t },\\n\\t contains: function(searchValue) {\\n\\t return this.some((function(value) {\\n\\t return is(value, searchValue);\\n\\t }));\\n\\t },\\n\\t entries: function() {\\n\\t return this.__iterator(ITERATE_ENTRIES);\\n\\t },\\n\\t every: function(predicate, context) {\\n\\t var returnValue = true;\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (!predicate.call(context, v, k, c)) {\\n\\t returnValue = false;\\n\\t return false;\\n\\t }\\n\\t }));\\n\\t return returnValue;\\n\\t },\\n\\t filter: function(predicate, context) {\\n\\t return reify(this, filterFactory(this, predicate, context, true));\\n\\t },\\n\\t find: function(predicate, context, notSetValue) {\\n\\t var foundValue = notSetValue;\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (predicate.call(context, v, k, c)) {\\n\\t foundValue = v;\\n\\t return false;\\n\\t }\\n\\t }));\\n\\t return foundValue;\\n\\t },\\n\\t forEach: function(sideEffect, context) {\\n\\t return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\\n\\t },\\n\\t join: function(separator) {\\n\\t separator = separator !== undefined ? '' + separator : ',';\\n\\t var joined = '';\\n\\t var isFirst = true;\\n\\t this.__iterate((function(v) {\\n\\t isFirst ? (isFirst = false) : (joined += separator);\\n\\t joined += v !== null && v !== undefined ? v : '';\\n\\t }));\\n\\t return joined;\\n\\t },\\n\\t keys: function() {\\n\\t return this.__iterator(ITERATE_KEYS);\\n\\t },\\n\\t map: function(mapper, context) {\\n\\t return reify(this, mapFactory(this, mapper, context));\\n\\t },\\n\\t reduce: function(reducer, initialReduction, context) {\\n\\t var reduction;\\n\\t var useFirst;\\n\\t if (arguments.length < 2) {\\n\\t useFirst = true;\\n\\t } else {\\n\\t reduction = initialReduction;\\n\\t }\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (useFirst) {\\n\\t useFirst = false;\\n\\t reduction = v;\\n\\t } else {\\n\\t reduction = reducer.call(context, reduction, v, k, c);\\n\\t }\\n\\t }));\\n\\t return reduction;\\n\\t },\\n\\t reduceRight: function(reducer, initialReduction, context) {\\n\\t var reversed = this.toKeyedSeq().reverse();\\n\\t return reversed.reduce.apply(reversed, arguments);\\n\\t },\\n\\t reverse: function() {\\n\\t return reify(this, reverseFactory(this, true));\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t if (wholeSlice(begin, end, this.size)) {\\n\\t return this;\\n\\t }\\n\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\\n\\t return this.toSeq().cacheResult().slice(begin, end);\\n\\t }\\n\\t var skipped = resolvedBegin === 0 ? this : this.skip(resolvedBegin);\\n\\t return reify(this, resolvedEnd === undefined || resolvedEnd === this.size ? skipped : skipped.take(resolvedEnd - resolvedBegin));\\n\\t },\\n\\t some: function(predicate, context) {\\n\\t return !this.every(not(predicate), context);\\n\\t },\\n\\t sort: function(comparator) {\\n\\t return this.sortBy(valueMapper, comparator);\\n\\t },\\n\\t values: function() {\\n\\t return this.__iterator(ITERATE_VALUES);\\n\\t },\\n\\t butLast: function() {\\n\\t return this.slice(0, -1);\\n\\t },\\n\\t count: function(predicate, context) {\\n\\t return ensureSize(predicate ? this.toSeq().filter(predicate, context) : this);\\n\\t },\\n\\t countBy: function(grouper, context) {\\n\\t return countByFactory(this, grouper, context);\\n\\t },\\n\\t equals: function(other) {\\n\\t if (this === other) {\\n\\t return true;\\n\\t }\\n\\t if (!other || typeof other.equals !== 'function') {\\n\\t return false;\\n\\t }\\n\\t if (this.size !== undefined && other.size !== undefined) {\\n\\t if (this.size !== other.size) {\\n\\t return false;\\n\\t }\\n\\t if (this.size === 0 && other.size === 0) {\\n\\t return true;\\n\\t }\\n\\t }\\n\\t if (this.__hash !== undefined && other.__hash !== undefined && this.__hash !== other.__hash) {\\n\\t return false;\\n\\t }\\n\\t return this.__deepEquals(other);\\n\\t },\\n\\t __deepEquals: function(other) {\\n\\t var entries = this.entries();\\n\\t return typeof other.every === 'function' && other.every((function(v, k) {\\n\\t var entry = entries.next().value;\\n\\t return entry && is(entry[0], k) && is(entry[1], v);\\n\\t })) && entries.next().done;\\n\\t },\\n\\t entrySeq: function() {\\n\\t var iterable = this;\\n\\t if (iterable._cache) {\\n\\t return new ArraySeq(iterable._cache);\\n\\t }\\n\\t var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\\n\\t entriesSequence.fromEntrySeq = (function() {\\n\\t return iterable.toSeq();\\n\\t });\\n\\t return entriesSequence;\\n\\t },\\n\\t filterNot: function(predicate, context) {\\n\\t return this.filter(not(predicate), context);\\n\\t },\\n\\t findLast: function(predicate, context, notSetValue) {\\n\\t return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\\n\\t },\\n\\t first: function() {\\n\\t return this.find(returnTrue);\\n\\t },\\n\\t flatMap: function(mapper, context) {\\n\\t return reify(this, flatMapFactory(this, mapper, context));\\n\\t },\\n\\t flatten: function(depth) {\\n\\t return reify(this, flattenFactory(this, depth, true));\\n\\t },\\n\\t fromEntrySeq: function() {\\n\\t return new FromEntriesSequence(this);\\n\\t },\\n\\t get: function(searchKey, notSetValue) {\\n\\t return this.find((function(_, key) {\\n\\t return is(key, searchKey);\\n\\t }), undefined, notSetValue);\\n\\t },\\n\\t getIn: function(searchKeyPath, notSetValue) {\\n\\t var nested = this;\\n\\t if (searchKeyPath) {\\n\\t for (var ii = 0; ii < searchKeyPath.length; ii++) {\\n\\t nested = nested && nested.get ? nested.get(searchKeyPath[ii], NOT_SET) : NOT_SET;\\n\\t if (nested === NOT_SET) {\\n\\t return notSetValue;\\n\\t }\\n\\t }\\n\\t }\\n\\t return nested;\\n\\t },\\n\\t groupBy: function(grouper, context) {\\n\\t return groupByFactory(this, grouper, context);\\n\\t },\\n\\t has: function(searchKey) {\\n\\t return this.get(searchKey, NOT_SET) !== NOT_SET;\\n\\t },\\n\\t isSubset: function(iter) {\\n\\t iter = typeof iter.contains === 'function' ? iter : $Iterable(iter);\\n\\t return this.every((function(value) {\\n\\t return iter.contains(value);\\n\\t }));\\n\\t },\\n\\t isSuperset: function(iter) {\\n\\t return iter.isSubset(this);\\n\\t },\\n\\t keySeq: function() {\\n\\t return this.toSeq().map(keyMapper).toIndexedSeq();\\n\\t },\\n\\t last: function() {\\n\\t return this.toSeq().reverse().first();\\n\\t },\\n\\t max: function(comparator) {\\n\\t return this.maxBy(valueMapper, comparator);\\n\\t },\\n\\t maxBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t var maxEntry = this.entrySeq().reduce((function(max, next) {\\n\\t return comparator(mapper(next[1], next[0], $__0), mapper(max[1], max[0], $__0)) > 0 ? next : max;\\n\\t }));\\n\\t return maxEntry && maxEntry[1];\\n\\t },\\n\\t min: function(comparator) {\\n\\t return this.minBy(valueMapper, comparator);\\n\\t },\\n\\t minBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t var minEntry = this.entrySeq().reduce((function(min, next) {\\n\\t return comparator(mapper(next[1], next[0], $__0), mapper(min[1], min[0], $__0)) < 0 ? next : min;\\n\\t }));\\n\\t return minEntry && minEntry[1];\\n\\t },\\n\\t rest: function() {\\n\\t return this.slice(1);\\n\\t },\\n\\t skip: function(amount) {\\n\\t return reify(this, skipFactory(this, amount, true));\\n\\t },\\n\\t skipLast: function(amount) {\\n\\t return reify(this, this.toSeq().reverse().skip(amount).reverse());\\n\\t },\\n\\t skipWhile: function(predicate, context) {\\n\\t return reify(this, skipWhileFactory(this, predicate, context, true));\\n\\t },\\n\\t skipUntil: function(predicate, context) {\\n\\t return this.skipWhile(not(predicate), context);\\n\\t },\\n\\t sortBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t return reify(this, new ArraySeq(this.entrySeq().entrySeq().toArray().sort((function(a, b) {\\n\\t return comparator(mapper(a[1][1], a[1][0], $__0), mapper(b[1][1], b[1][0], $__0)) || a[0] - b[0];\\n\\t }))).fromEntrySeq().valueSeq().fromEntrySeq());\\n\\t },\\n\\t take: function(amount) {\\n\\t return reify(this, takeFactory(this, amount));\\n\\t },\\n\\t takeLast: function(amount) {\\n\\t return reify(this, this.toSeq().reverse().take(amount).reverse());\\n\\t },\\n\\t takeWhile: function(predicate, context) {\\n\\t return reify(this, takeWhileFactory(this, predicate, context));\\n\\t },\\n\\t takeUntil: function(predicate, context) {\\n\\t return this.takeWhile(not(predicate), context);\\n\\t },\\n\\t valueSeq: function() {\\n\\t return this.toIndexedSeq();\\n\\t },\\n\\t hashCode: function() {\\n\\t return this.__hash || (this.__hash = this.size === Infinity ? 0 : this.reduce((function(h, v, k) {\\n\\t return (h + (hash(v) ^ (v === k ? 0 : hash(k)))) & HASH_MAX_VAL;\\n\\t }), 0));\\n\\t }\\n\\t}, {});\\n\\tvar IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\\n\\tvar IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\\n\\tvar IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\\n\\tvar IterablePrototype = Iterable.prototype;\\n\\tIterablePrototype[IS_ITERABLE_SENTINEL] = true;\\n\\tIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\\n\\tIterablePrototype.toJSON = IterablePrototype.toJS;\\n\\tIterablePrototype.__toJS = IterablePrototype.toArray;\\n\\tIterablePrototype.__toStringMapper = quoteString;\\n\\tIterablePrototype.inspect = IterablePrototype.toSource = function() {\\n\\t return this.toString();\\n\\t};\\n\\tIterablePrototype.chain = IterablePrototype.flatMap;\\n\\t(function() {\\n\\t try {\\n\\t Object.defineProperty(IterablePrototype, 'length', {get: function() {\\n\\t if (!Iterable.noLengthWarning) {\\n\\t var stack;\\n\\t try {\\n\\t throw new Error();\\n\\t } catch (error) {\\n\\t stack = error.stack;\\n\\t }\\n\\t if (stack.indexOf('_wrapObject') === -1) {\\n\\t console && console.warn && console.warn('iterable.length has been deprecated, ' + 'use iterable.size or iterable.count(). ' + 'This warning will become a silent error in a future version. ' + stack);\\n\\t return this.size;\\n\\t }\\n\\t }\\n\\t }});\\n\\t } catch (e) {}\\n\\t})();\\n\\tvar KeyedIterable = function KeyedIterable(value) {\\n\\t return isKeyed(value) ? value : KeyedSeq(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(KeyedIterable, {\\n\\t flip: function() {\\n\\t return reify(this, flipFactory(this));\\n\\t },\\n\\t findKey: function(predicate, context) {\\n\\t var foundKey;\\n\\t this.__iterate((function(v, k, c) {\\n\\t if (predicate.call(context, v, k, c)) {\\n\\t foundKey = k;\\n\\t return false;\\n\\t }\\n\\t }));\\n\\t return foundKey;\\n\\t },\\n\\t findLastKey: function(predicate, context) {\\n\\t return this.toSeq().reverse().findKey(predicate, context);\\n\\t },\\n\\t keyOf: function(searchValue) {\\n\\t return this.findKey((function(value) {\\n\\t return is(value, searchValue);\\n\\t }));\\n\\t },\\n\\t lastKeyOf: function(searchValue) {\\n\\t return this.toSeq().reverse().keyOf(searchValue);\\n\\t },\\n\\t mapEntries: function(mapper, context) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t return reify(this, this.toSeq().map((function(v, k) {\\n\\t return mapper.call(context, [k, v], iterations++, $__0);\\n\\t })).fromEntrySeq());\\n\\t },\\n\\t mapKeys: function(mapper, context) {\\n\\t var $__0 = this;\\n\\t return reify(this, this.toSeq().flip().map((function(k, v) {\\n\\t return mapper.call(context, k, v, $__0);\\n\\t })).flip());\\n\\t }\\n\\t}, {}, Iterable);\\n\\tvar KeyedIterablePrototype = KeyedIterable.prototype;\\n\\tKeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\\n\\tKeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\\n\\tKeyedIterablePrototype.__toJS = IterablePrototype.toObject;\\n\\tKeyedIterablePrototype.__toStringMapper = (function(v, k) {\\n\\t return k + ': ' + quoteString(v);\\n\\t});\\n\\tvar IndexedIterable = function IndexedIterable(value) {\\n\\t return isIndexed(value) ? value : IndexedSeq(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(IndexedIterable, {\\n\\t toKeyedSeq: function() {\\n\\t return new ToKeyedSequence(this, false);\\n\\t },\\n\\t filter: function(predicate, context) {\\n\\t return reify(this, filterFactory(this, predicate, context, false));\\n\\t },\\n\\t findIndex: function(predicate, context) {\\n\\t var key = this.toKeyedSeq().findKey(predicate, context);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t indexOf: function(searchValue) {\\n\\t var key = this.toKeyedSeq().keyOf(searchValue);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t lastIndexOf: function(searchValue) {\\n\\t var key = this.toKeyedSeq().lastKeyOf(searchValue);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t reverse: function() {\\n\\t return reify(this, reverseFactory(this, false));\\n\\t },\\n\\t splice: function(index, removeNum) {\\n\\t var numArgs = arguments.length;\\n\\t removeNum = Math.max(removeNum | 0, 0);\\n\\t if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\\n\\t return this;\\n\\t }\\n\\t index = resolveBegin(index, this.size);\\n\\t var spliced = this.slice(0, index);\\n\\t return reify(this, numArgs === 1 ? spliced : spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum)));\\n\\t },\\n\\t findLastIndex: function(predicate, context) {\\n\\t var key = this.toKeyedSeq().findLastKey(predicate, context);\\n\\t return key === undefined ? -1 : key;\\n\\t },\\n\\t first: function() {\\n\\t return this.get(0);\\n\\t },\\n\\t flatten: function(depth) {\\n\\t return reify(this, flattenFactory(this, depth, false));\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t return (index < 0 || (this.size === Infinity || (this.size !== undefined && index > this.size))) ? notSetValue : this.find((function(_, key) {\\n\\t return key === index;\\n\\t }), undefined, notSetValue);\\n\\t },\\n\\t has: function(index) {\\n\\t index = wrapIndex(this, index);\\n\\t return index >= 0 && (this.size !== undefined ? this.size === Infinity || index < this.size : this.indexOf(index) !== -1);\\n\\t },\\n\\t interpose: function(separator) {\\n\\t return reify(this, interposeFactory(this, separator));\\n\\t },\\n\\t last: function() {\\n\\t return this.get(-1);\\n\\t },\\n\\t skip: function(amount) {\\n\\t var iter = this;\\n\\t var skipSeq = skipFactory(iter, amount, false);\\n\\t if (isSeq(iter) && skipSeq !== iter) {\\n\\t skipSeq.get = function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t return index >= 0 ? iter.get(index + amount, notSetValue) : notSetValue;\\n\\t };\\n\\t }\\n\\t return reify(this, skipSeq);\\n\\t },\\n\\t skipWhile: function(predicate, context) {\\n\\t return reify(this, skipWhileFactory(this, predicate, context, false));\\n\\t },\\n\\t sortBy: function(mapper, comparator) {\\n\\t var $__0 = this;\\n\\t comparator = comparator || defaultComparator;\\n\\t return reify(this, new ArraySeq(this.entrySeq().toArray().sort((function(a, b) {\\n\\t return comparator(mapper(a[1], a[0], $__0), mapper(b[1], b[0], $__0)) || a[0] - b[0];\\n\\t }))).fromEntrySeq().valueSeq());\\n\\t },\\n\\t take: function(amount) {\\n\\t var iter = this;\\n\\t var takeSeq = takeFactory(iter, amount);\\n\\t if (isSeq(iter) && takeSeq !== iter) {\\n\\t takeSeq.get = function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t return index >= 0 && index < amount ? iter.get(index, notSetValue) : notSetValue;\\n\\t };\\n\\t }\\n\\t return reify(this, takeSeq);\\n\\t }\\n\\t}, {}, Iterable);\\n\\tIndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\\n\\tvar SetIterable = function SetIterable(value) {\\n\\t return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(SetIterable, {\\n\\t get: function(value, notSetValue) {\\n\\t return this.has(value) ? value : notSetValue;\\n\\t },\\n\\t contains: function(value) {\\n\\t return this.has(value);\\n\\t },\\n\\t keySeq: function() {\\n\\t return this.valueSeq();\\n\\t }\\n\\t}, {}, Iterable);\\n\\tSetIterable.prototype.has = IterablePrototype.contains;\\n\\tfunction isIterable(maybeIterable) {\\n\\t return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\\n\\t}\\n\\tfunction isKeyed(maybeKeyed) {\\n\\t return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\\n\\t}\\n\\tfunction isIndexed(maybeIndexed) {\\n\\t return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\\n\\t}\\n\\tfunction isAssociative(maybeAssociative) {\\n\\t return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\\n\\t}\\n\\tIterable.isIterable = isIterable;\\n\\tIterable.isKeyed = isKeyed;\\n\\tIterable.isIndexed = isIndexed;\\n\\tIterable.isAssociative = isAssociative;\\n\\tIterable.Keyed = KeyedIterable;\\n\\tIterable.Indexed = IndexedIterable;\\n\\tIterable.Set = SetIterable;\\n\\tIterable.Iterator = Iterator;\\n\\tfunction valueMapper(v) {\\n\\t return v;\\n\\t}\\n\\tfunction keyMapper(v, k) {\\n\\t return k;\\n\\t}\\n\\tfunction entryMapper(v, k) {\\n\\t return [k, v];\\n\\t}\\n\\tfunction not(predicate) {\\n\\t return function() {\\n\\t return !predicate.apply(this, arguments);\\n\\t };\\n\\t}\\n\\tfunction quoteString(value) {\\n\\t return typeof value === 'string' ? JSON.stringify(value) : value;\\n\\t}\\n\\tfunction defaultComparator(a, b) {\\n\\t return a > b ? 1 : a < b ? -1 : 0;\\n\\t}\\n\\tfunction mixin(ctor, methods) {\\n\\t var proto = ctor.prototype;\\n\\t var keyCopier = (function(key) {\\n\\t proto[key] = methods[key];\\n\\t });\\n\\t Object.keys(methods).forEach(keyCopier);\\n\\t Object.getOwnPropertySymbols && Object.getOwnPropertySymbols(methods).forEach(keyCopier);\\n\\t return ctor;\\n\\t}\\n\\tvar Seq = function Seq(value) {\\n\\t return value === null || value === undefined ? emptySequence() : isIterable(value) ? value.toSeq() : seqFromValue(value);\\n\\t};\\n\\tvar $Seq = Seq;\\n\\t($traceurRuntime.createClass)(Seq, {\\n\\t toSeq: function() {\\n\\t return this;\\n\\t },\\n\\t toString: function() {\\n\\t return this.__toString('Seq {', '}');\\n\\t },\\n\\t cacheResult: function() {\\n\\t if (!this._cache && this.__iterateUncached) {\\n\\t this._cache = this.entrySeq().toArray();\\n\\t this.size = this._cache.length;\\n\\t }\\n\\t return this;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t return seqIterate(this, fn, reverse, true);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return seqIterator(this, type, reverse, true);\\n\\t }\\n\\t}, {of: function() {\\n\\t return $Seq(arguments);\\n\\t }}, Iterable);\\n\\tvar KeyedSeq = function KeyedSeq(value) {\\n\\t return value === null || value === undefined ? emptySequence().toKeyedSeq() : isIterable(value) ? (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) : keyedSeqFromValue(value);\\n\\t};\\n\\tvar $KeyedSeq = KeyedSeq;\\n\\t($traceurRuntime.createClass)(KeyedSeq, {\\n\\t toKeyedSeq: function() {\\n\\t return this;\\n\\t },\\n\\t toSeq: function() {\\n\\t return this;\\n\\t }\\n\\t}, {of: function() {\\n\\t return $KeyedSeq(arguments);\\n\\t }}, Seq);\\n\\tmixin(KeyedSeq, KeyedIterable.prototype);\\n\\tvar IndexedSeq = function IndexedSeq(value) {\\n\\t return value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\\n\\t};\\n\\tvar $IndexedSeq = IndexedSeq;\\n\\t($traceurRuntime.createClass)(IndexedSeq, {\\n\\t toIndexedSeq: function() {\\n\\t return this;\\n\\t },\\n\\t toString: function() {\\n\\t return this.__toString('Seq [', ']');\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t return seqIterate(this, fn, reverse, false);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return seqIterator(this, type, reverse, false);\\n\\t }\\n\\t}, {of: function() {\\n\\t return $IndexedSeq(arguments);\\n\\t }}, Seq);\\n\\tmixin(IndexedSeq, IndexedIterable.prototype);\\n\\tvar SetSeq = function SetSeq(value) {\\n\\t return (value === null || value === undefined ? emptySequence() : !isIterable(value) ? indexedSeqFromValue(value) : isKeyed(value) ? value.entrySeq() : value).toSetSeq();\\n\\t};\\n\\tvar $SetSeq = SetSeq;\\n\\t($traceurRuntime.createClass)(SetSeq, {toSetSeq: function() {\\n\\t return this;\\n\\t }}, {of: function() {\\n\\t return $SetSeq(arguments);\\n\\t }}, Seq);\\n\\tmixin(SetSeq, SetIterable.prototype);\\n\\tSeq.isSeq = isSeq;\\n\\tSeq.Keyed = KeyedSeq;\\n\\tSeq.Set = SetSeq;\\n\\tSeq.Indexed = IndexedSeq;\\n\\tvar IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\\n\\tSeq.prototype[IS_SEQ_SENTINEL] = true;\\n\\tvar ArraySeq = function ArraySeq(array) {\\n\\t this._array = array;\\n\\t this.size = array.length;\\n\\t};\\n\\t($traceurRuntime.createClass)(ArraySeq, {\\n\\t get: function(index, notSetValue) {\\n\\t return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var array = this._array;\\n\\t var maxIndex = array.length - 1;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var array = this._array;\\n\\t var maxIndex = array.length - 1;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++]);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar ObjectSeq = function ObjectSeq(object) {\\n\\t var keys = Object.keys(object);\\n\\t this._object = object;\\n\\t this._keys = keys;\\n\\t this.size = keys.length;\\n\\t};\\n\\t($traceurRuntime.createClass)(ObjectSeq, {\\n\\t get: function(key, notSetValue) {\\n\\t if (notSetValue !== undefined && !this.has(key)) {\\n\\t return notSetValue;\\n\\t }\\n\\t return this._object[key];\\n\\t },\\n\\t has: function(key) {\\n\\t return this._object.hasOwnProperty(key);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var object = this._object;\\n\\t var keys = this._keys;\\n\\t var maxIndex = keys.length - 1;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t if (fn(object[key], key, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var object = this._object;\\n\\t var keys = this._keys;\\n\\t var maxIndex = keys.length - 1;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t var key = keys[reverse ? maxIndex - ii : ii];\\n\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, key, object[key]);\\n\\t }));\\n\\t }\\n\\t}, {}, KeyedSeq);\\n\\tvar IterableSeq = function IterableSeq(iterable) {\\n\\t this._iterable = iterable;\\n\\t this.size = iterable.length || iterable.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(IterableSeq, {\\n\\t __iterateUncached: function(fn, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterable = this._iterable;\\n\\t var iterator = getIterator(iterable);\\n\\t var iterations = 0;\\n\\t if (isIterator(iterator)) {\\n\\t var step;\\n\\t while (!(step = iterator.next()).done) {\\n\\t if (fn(step.value, iterations++, this) === false) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __iteratorUncached: function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterable = this._iterable;\\n\\t var iterator = getIterator(iterable);\\n\\t if (!isIterator(iterator)) {\\n\\t return new Iterator(iteratorDone);\\n\\t }\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, iterations++, step.value);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar IteratorSeq = function IteratorSeq(iterator) {\\n\\t this._iterator = iterator;\\n\\t this._iteratorCache = [];\\n\\t};\\n\\t($traceurRuntime.createClass)(IteratorSeq, {\\n\\t __iterateUncached: function(fn, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterator = this._iterator;\\n\\t var cache = this._iteratorCache;\\n\\t var iterations = 0;\\n\\t while (iterations < cache.length) {\\n\\t if (fn(cache[iterations], iterations++, this) === false) {\\n\\t return iterations;\\n\\t }\\n\\t }\\n\\t var step;\\n\\t while (!(step = iterator.next()).done) {\\n\\t var val = step.value;\\n\\t cache[iterations] = val;\\n\\t if (fn(val, iterations++, this) === false) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __iteratorUncached: function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = this._iterator;\\n\\t var cache = this._iteratorCache;\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t if (iterations >= cache.length) {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t cache[iterations] = step.value;\\n\\t }\\n\\t return iteratorValue(type, iterations, cache[iterations++]);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tfunction isSeq(maybeSeq) {\\n\\t return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\\n\\t}\\n\\tvar EMPTY_SEQ;\\n\\tfunction emptySequence() {\\n\\t return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\\n\\t}\\n\\tfunction keyedSeqFromValue(value) {\\n\\t var seq = Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() : isIterator(value) ? new IteratorSeq(value).fromEntrySeq() : hasIterator(value) ? new IterableSeq(value).fromEntrySeq() : typeof value === 'object' ? new ObjectSeq(value) : undefined;\\n\\t if (!seq) {\\n\\t throw new TypeError('Expected Array or iterable object of [k, v] entries, ' + 'or keyed object: ' + value);\\n\\t }\\n\\t return seq;\\n\\t}\\n\\tfunction indexedSeqFromValue(value) {\\n\\t var seq = maybeIndexedSeqFromValue(value);\\n\\t if (!seq) {\\n\\t throw new TypeError('Expected Array or iterable object of values: ' + value);\\n\\t }\\n\\t return seq;\\n\\t}\\n\\tfunction seqFromValue(value) {\\n\\t var seq = maybeIndexedSeqFromValue(value) || (typeof value === 'object' && new ObjectSeq(value));\\n\\t if (!seq) {\\n\\t throw new TypeError('Expected Array or iterable object of values, or keyed object: ' + value);\\n\\t }\\n\\t return seq;\\n\\t}\\n\\tfunction maybeIndexedSeqFromValue(value) {\\n\\t return (isArrayLike(value) ? new ArraySeq(value) : isIterator(value) ? new IteratorSeq(value) : hasIterator(value) ? new IterableSeq(value) : undefined);\\n\\t}\\n\\tfunction isArrayLike(value) {\\n\\t return value && typeof value.length === 'number';\\n\\t}\\n\\tfunction seqIterate(seq, fn, reverse, useKeys) {\\n\\t assertNotInfinite(seq.size);\\n\\t var cache = seq._cache;\\n\\t if (cache) {\\n\\t var maxIndex = cache.length - 1;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t }\\n\\t return seq.__iterateUncached(fn, reverse);\\n\\t}\\n\\tfunction seqIterator(seq, type, reverse, useKeys) {\\n\\t var cache = seq._cache;\\n\\t if (cache) {\\n\\t var maxIndex = cache.length - 1;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t var entry = cache[reverse ? maxIndex - ii : ii];\\n\\t return ii++ > maxIndex ? iteratorDone() : iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\\n\\t }));\\n\\t }\\n\\t return seq.__iteratorUncached(type, reverse);\\n\\t}\\n\\tfunction fromJS(json, converter) {\\n\\t return converter ? _fromJSWith(converter, json, '', {'': json}) : _fromJSDefault(json);\\n\\t}\\n\\tfunction _fromJSWith(converter, json, key, parentJSON) {\\n\\t if (Array.isArray(json)) {\\n\\t return converter.call(parentJSON, key, IndexedSeq(json).map((function(v, k) {\\n\\t return _fromJSWith(converter, v, k, json);\\n\\t })));\\n\\t }\\n\\t if (isPlainObj(json)) {\\n\\t return converter.call(parentJSON, key, KeyedSeq(json).map((function(v, k) {\\n\\t return _fromJSWith(converter, v, k, json);\\n\\t })));\\n\\t }\\n\\t return json;\\n\\t}\\n\\tfunction _fromJSDefault(json) {\\n\\t if (Array.isArray(json)) {\\n\\t return IndexedSeq(json).map(_fromJSDefault).toList();\\n\\t }\\n\\t if (isPlainObj(json)) {\\n\\t return KeyedSeq(json).map(_fromJSDefault).toMap();\\n\\t }\\n\\t return json;\\n\\t}\\n\\tfunction isPlainObj(value) {\\n\\t return value && value.constructor === Object;\\n\\t}\\n\\tvar Collection = function Collection() {\\n\\t throw TypeError('Abstract');\\n\\t};\\n\\t($traceurRuntime.createClass)(Collection, {}, {}, Iterable);\\n\\tvar KeyedCollection = function KeyedCollection() {\\n\\t $traceurRuntime.defaultSuperCall(this, $KeyedCollection.prototype, arguments);\\n\\t};\\n\\tvar $KeyedCollection = KeyedCollection;\\n\\t($traceurRuntime.createClass)(KeyedCollection, {}, {}, Collection);\\n\\tmixin(KeyedCollection, KeyedIterable.prototype);\\n\\tvar IndexedCollection = function IndexedCollection() {\\n\\t $traceurRuntime.defaultSuperCall(this, $IndexedCollection.prototype, arguments);\\n\\t};\\n\\tvar $IndexedCollection = IndexedCollection;\\n\\t($traceurRuntime.createClass)(IndexedCollection, {}, {}, Collection);\\n\\tmixin(IndexedCollection, IndexedIterable.prototype);\\n\\tvar SetCollection = function SetCollection() {\\n\\t $traceurRuntime.defaultSuperCall(this, $SetCollection.prototype, arguments);\\n\\t};\\n\\tvar $SetCollection = SetCollection;\\n\\t($traceurRuntime.createClass)(SetCollection, {}, {}, Collection);\\n\\tmixin(SetCollection, SetIterable.prototype);\\n\\tCollection.Keyed = KeyedCollection;\\n\\tCollection.Indexed = IndexedCollection;\\n\\tCollection.Set = SetCollection;\\n\\tvar Map = function Map(value) {\\n\\t return value === null || value === undefined ? emptyMap() : isMap(value) ? value : emptyMap().merge(KeyedIterable(value));\\n\\t};\\n\\t($traceurRuntime.createClass)(Map, {\\n\\t toString: function() {\\n\\t return this.__toString('Map {', '}');\\n\\t },\\n\\t get: function(k, notSetValue) {\\n\\t return this._root ? this._root.get(0, hash(k), k, notSetValue) : notSetValue;\\n\\t },\\n\\t set: function(k, v) {\\n\\t return updateMap(this, k, v);\\n\\t },\\n\\t setIn: function(keyPath, v) {\\n\\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\\n\\t return this.updateIn(keyPath, (function() {\\n\\t return v;\\n\\t }));\\n\\t },\\n\\t remove: function(k) {\\n\\t return updateMap(this, k, NOT_SET);\\n\\t },\\n\\t removeIn: function(keyPath) {\\n\\t invariant(keyPath.length > 0, 'Requires non-empty key path.');\\n\\t return this.updateIn(keyPath, (function() {\\n\\t return NOT_SET;\\n\\t }));\\n\\t },\\n\\t update: function(k, notSetValue, updater) {\\n\\t return arguments.length === 1 ? k(this) : this.updateIn([k], notSetValue, updater);\\n\\t },\\n\\t updateIn: function(keyPath, notSetValue, updater) {\\n\\t if (!updater) {\\n\\t updater = notSetValue;\\n\\t notSetValue = undefined;\\n\\t }\\n\\t return keyPath.length === 0 ? updater(this) : updateInDeepMap(this, keyPath, notSetValue, updater, 0);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._root = null;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return emptyMap();\\n\\t },\\n\\t merge: function() {\\n\\t return mergeIntoMapWith(this, undefined, arguments);\\n\\t },\\n\\t mergeWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__3 = 1; $__3 < arguments.length; $__3++)\\n\\t iters[$__3 - 1] = arguments[$__3];\\n\\t return mergeIntoMapWith(this, merger, iters);\\n\\t },\\n\\t mergeDeep: function() {\\n\\t return mergeIntoMapWith(this, deepMerger(undefined), arguments);\\n\\t },\\n\\t mergeDeepWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__4 = 1; $__4 < arguments.length; $__4++)\\n\\t iters[$__4 - 1] = arguments[$__4];\\n\\t return mergeIntoMapWith(this, deepMerger(merger), iters);\\n\\t },\\n\\t withMutations: function(fn) {\\n\\t var mutable = this.asMutable();\\n\\t fn(mutable);\\n\\t return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\\n\\t },\\n\\t asMutable: function() {\\n\\t return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\\n\\t },\\n\\t asImmutable: function() {\\n\\t return this.__ensureOwner();\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this.__altered;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return new MapIterator(this, type, reverse);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t this._root && this._root.iterate((function(entry) {\\n\\t iterations++;\\n\\t return fn(entry[1], entry[0], $__0);\\n\\t }), reverse);\\n\\t return iterations;\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this.__altered = false;\\n\\t return this;\\n\\t }\\n\\t return makeMap(this.size, this._root, ownerID, this.__hash);\\n\\t }\\n\\t}, {}, KeyedCollection);\\n\\tfunction isMap(maybeMap) {\\n\\t return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\\n\\t}\\n\\tMap.isMap = isMap;\\n\\tvar IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\\n\\tvar MapPrototype = Map.prototype;\\n\\tMapPrototype[IS_MAP_SENTINEL] = true;\\n\\tMapPrototype[DELETE] = MapPrototype.remove;\\n\\tvar BitmapIndexedNode = function BitmapIndexedNode(ownerID, bitmap, nodes) {\\n\\t this.ownerID = ownerID;\\n\\t this.bitmap = bitmap;\\n\\t this.nodes = nodes;\\n\\t};\\n\\tvar $BitmapIndexedNode = BitmapIndexedNode;\\n\\t($traceurRuntime.createClass)(BitmapIndexedNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t var bit = (1 << ((shift === 0 ? hash : hash >>> shift) & MASK));\\n\\t var bitmap = this.bitmap;\\n\\t return (bitmap & bit) === 0 ? notSetValue : this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, hash, key, notSetValue);\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var hashFrag = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var bit = 1 << hashFrag;\\n\\t var bitmap = this.bitmap;\\n\\t var exists = (bitmap & bit) !== 0;\\n\\t if (!exists && value === NOT_SET) {\\n\\t return this;\\n\\t }\\n\\t var idx = popCount(bitmap & (bit - 1));\\n\\t var nodes = this.nodes;\\n\\t var node = exists ? nodes[idx] : undefined;\\n\\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\\n\\t if (newNode === node) {\\n\\t return this;\\n\\t }\\n\\t if (!exists && newNode && nodes.length >= MAX_BITMAP_SIZE) {\\n\\t return expandNodes(ownerID, nodes, bitmap, hashFrag, newNode);\\n\\t }\\n\\t if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\\n\\t return nodes[idx ^ 1];\\n\\t }\\n\\t if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\\n\\t return newNode;\\n\\t }\\n\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\\n\\t var newNodes = exists ? newNode ? setIn(nodes, idx, newNode, isEditable) : spliceOut(nodes, idx, isEditable) : spliceIn(nodes, idx, newNode, isEditable);\\n\\t if (isEditable) {\\n\\t this.bitmap = newBitmap;\\n\\t this.nodes = newNodes;\\n\\t return this;\\n\\t }\\n\\t return new $BitmapIndexedNode(ownerID, newBitmap, newNodes);\\n\\t },\\n\\t iterate: function(fn, reverse) {\\n\\t var nodes = this.nodes;\\n\\t for (var ii = 0,\\n\\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\\n\\t if (nodes[reverse ? maxIndex - ii : ii].iterate(fn, reverse) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t}, {});\\n\\tvar ArrayNode = function ArrayNode(ownerID, count, nodes) {\\n\\t this.ownerID = ownerID;\\n\\t this.count = count;\\n\\t this.nodes = nodes;\\n\\t};\\n\\tvar $ArrayNode = ArrayNode;\\n\\t($traceurRuntime.createClass)(ArrayNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var node = this.nodes[idx];\\n\\t return node ? node.get(shift + SHIFT, hash, key, notSetValue) : notSetValue;\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var idx = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var removed = value === NOT_SET;\\n\\t var nodes = this.nodes;\\n\\t var node = nodes[idx];\\n\\t if (removed && !node) {\\n\\t return this;\\n\\t }\\n\\t var newNode = updateNode(node, ownerID, shift + SHIFT, hash, key, value, didChangeSize, didAlter);\\n\\t if (newNode === node) {\\n\\t return this;\\n\\t }\\n\\t var newCount = this.count;\\n\\t if (!node) {\\n\\t newCount++;\\n\\t } else if (!newNode) {\\n\\t newCount--;\\n\\t if (newCount < MIN_ARRAY_SIZE) {\\n\\t return packNodes(ownerID, nodes, newCount, idx);\\n\\t }\\n\\t }\\n\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t var newNodes = setIn(nodes, idx, newNode, isEditable);\\n\\t if (isEditable) {\\n\\t this.count = newCount;\\n\\t this.nodes = newNodes;\\n\\t return this;\\n\\t }\\n\\t return new $ArrayNode(ownerID, newCount, newNodes);\\n\\t },\\n\\t iterate: function(fn, reverse) {\\n\\t var nodes = this.nodes;\\n\\t for (var ii = 0,\\n\\t maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\\n\\t var node = nodes[reverse ? maxIndex - ii : ii];\\n\\t if (node && node.iterate(fn, reverse) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t}, {});\\n\\tvar HashCollisionNode = function HashCollisionNode(ownerID, hash, entries) {\\n\\t this.ownerID = ownerID;\\n\\t this.hash = hash;\\n\\t this.entries = entries;\\n\\t};\\n\\tvar $HashCollisionNode = HashCollisionNode;\\n\\t($traceurRuntime.createClass)(HashCollisionNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t var entries = this.entries;\\n\\t for (var ii = 0,\\n\\t len = entries.length; ii < len; ii++) {\\n\\t if (is(key, entries[ii][0])) {\\n\\t return entries[ii][1];\\n\\t }\\n\\t }\\n\\t return notSetValue;\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var removed = value === NOT_SET;\\n\\t if (hash !== this.hash) {\\n\\t if (removed) {\\n\\t return this;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t SetRef(didChangeSize);\\n\\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\\n\\t }\\n\\t var entries = this.entries;\\n\\t var idx = 0;\\n\\t for (var len = entries.length; idx < len; idx++) {\\n\\t if (is(key, entries[idx][0])) {\\n\\t break;\\n\\t }\\n\\t }\\n\\t var exists = idx < len;\\n\\t if (removed && !exists) {\\n\\t return this;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t (removed || !exists) && SetRef(didChangeSize);\\n\\t if (removed && len === 2) {\\n\\t return new ValueNode(ownerID, this.hash, entries[idx ^ 1]);\\n\\t }\\n\\t var isEditable = ownerID && ownerID === this.ownerID;\\n\\t var newEntries = isEditable ? entries : arrCopy(entries);\\n\\t if (exists) {\\n\\t if (removed) {\\n\\t idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\\n\\t } else {\\n\\t newEntries[idx] = [key, value];\\n\\t }\\n\\t } else {\\n\\t newEntries.push([key, value]);\\n\\t }\\n\\t if (isEditable) {\\n\\t this.entries = newEntries;\\n\\t return this;\\n\\t }\\n\\t return new $HashCollisionNode(ownerID, this.hash, newEntries);\\n\\t },\\n\\t iterate: function(fn, reverse) {\\n\\t var entries = this.entries;\\n\\t for (var ii = 0,\\n\\t maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\\n\\t if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t}, {});\\n\\tvar ValueNode = function ValueNode(ownerID, hash, entry) {\\n\\t this.ownerID = ownerID;\\n\\t this.hash = hash;\\n\\t this.entry = entry;\\n\\t};\\n\\tvar $ValueNode = ValueNode;\\n\\t($traceurRuntime.createClass)(ValueNode, {\\n\\t get: function(shift, hash, key, notSetValue) {\\n\\t return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\\n\\t },\\n\\t update: function(ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t var removed = value === NOT_SET;\\n\\t var keyMatch = is(key, this.entry[0]);\\n\\t if (keyMatch ? value === this.entry[1] : removed) {\\n\\t return this;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t if (removed) {\\n\\t SetRef(didChangeSize);\\n\\t return;\\n\\t }\\n\\t if (keyMatch) {\\n\\t if (ownerID && ownerID === this.ownerID) {\\n\\t this.entry[1] = value;\\n\\t return this;\\n\\t }\\n\\t return new $ValueNode(ownerID, hash, [key, value]);\\n\\t }\\n\\t SetRef(didChangeSize);\\n\\t return mergeIntoNode(this, ownerID, shift, hash, [key, value]);\\n\\t },\\n\\t iterate: function(fn) {\\n\\t return fn(this.entry);\\n\\t }\\n\\t}, {});\\n\\tvar MapIterator = function MapIterator(map, type, reverse) {\\n\\t this._type = type;\\n\\t this._reverse = reverse;\\n\\t this._stack = map._root && mapIteratorFrame(map._root);\\n\\t};\\n\\t($traceurRuntime.createClass)(MapIterator, {next: function() {\\n\\t var type = this._type;\\n\\t var stack = this._stack;\\n\\t while (stack) {\\n\\t var node = stack.node;\\n\\t var index = stack.index++;\\n\\t var maxIndex;\\n\\t if (node.entry) {\\n\\t if (index === 0) {\\n\\t return mapIteratorValue(type, node.entry);\\n\\t }\\n\\t } else if (node.entries) {\\n\\t maxIndex = node.entries.length - 1;\\n\\t if (index <= maxIndex) {\\n\\t return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\\n\\t }\\n\\t } else {\\n\\t maxIndex = node.nodes.length - 1;\\n\\t if (index <= maxIndex) {\\n\\t var subNode = node.nodes[this._reverse ? maxIndex - index : index];\\n\\t if (subNode) {\\n\\t if (subNode.entry) {\\n\\t return mapIteratorValue(type, subNode.entry);\\n\\t }\\n\\t stack = this._stack = mapIteratorFrame(subNode, stack);\\n\\t }\\n\\t continue;\\n\\t }\\n\\t }\\n\\t stack = this._stack = this._stack.__prev;\\n\\t }\\n\\t return iteratorDone();\\n\\t }}, {}, Iterator);\\n\\tfunction mapIteratorValue(type, entry) {\\n\\t return iteratorValue(type, entry[0], entry[1]);\\n\\t}\\n\\tfunction mapIteratorFrame(node, prev) {\\n\\t return {\\n\\t node: node,\\n\\t index: 0,\\n\\t __prev: prev\\n\\t };\\n\\t}\\n\\tfunction makeMap(size, root, ownerID, hash) {\\n\\t var map = Object.create(MapPrototype);\\n\\t map.size = size;\\n\\t map._root = root;\\n\\t map.__ownerID = ownerID;\\n\\t map.__hash = hash;\\n\\t map.__altered = false;\\n\\t return map;\\n\\t}\\n\\tvar EMPTY_MAP;\\n\\tfunction emptyMap() {\\n\\t return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\\n\\t}\\n\\tfunction updateMap(map, k, v) {\\n\\t var didChangeSize = MakeRef(CHANGE_LENGTH);\\n\\t var didAlter = MakeRef(DID_ALTER);\\n\\t var newRoot = updateNode(map._root, map.__ownerID, 0, hash(k), k, v, didChangeSize, didAlter);\\n\\t if (!didAlter.value) {\\n\\t return map;\\n\\t }\\n\\t var newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\\n\\t if (map.__ownerID) {\\n\\t map.size = newSize;\\n\\t map._root = newRoot;\\n\\t map.__hash = undefined;\\n\\t map.__altered = true;\\n\\t return map;\\n\\t }\\n\\t return newRoot ? makeMap(newSize, newRoot) : emptyMap();\\n\\t}\\n\\tfunction updateNode(node, ownerID, shift, hash, key, value, didChangeSize, didAlter) {\\n\\t if (!node) {\\n\\t if (value === NOT_SET) {\\n\\t return node;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t SetRef(didChangeSize);\\n\\t return new ValueNode(ownerID, hash, [key, value]);\\n\\t }\\n\\t return node.update(ownerID, shift, hash, key, value, didChangeSize, didAlter);\\n\\t}\\n\\tfunction isLeafNode(node) {\\n\\t return node.constructor === ValueNode || node.constructor === HashCollisionNode;\\n\\t}\\n\\tfunction mergeIntoNode(node, ownerID, shift, hash, entry) {\\n\\t if (node.hash === hash) {\\n\\t return new HashCollisionNode(ownerID, hash, [node.entry, entry]);\\n\\t }\\n\\t var idx1 = (shift === 0 ? node.hash : node.hash >>> shift) & MASK;\\n\\t var idx2 = (shift === 0 ? hash : hash >>> shift) & MASK;\\n\\t var newNode;\\n\\t var nodes = idx1 === idx2 ? [mergeIntoNode(node, ownerID, shift + SHIFT, hash, entry)] : ((newNode = new ValueNode(ownerID, hash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\\n\\t return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\\n\\t}\\n\\tfunction packNodes(ownerID, nodes, count, excluding) {\\n\\t var bitmap = 0;\\n\\t var packedII = 0;\\n\\t var packedNodes = new Array(count);\\n\\t for (var ii = 0,\\n\\t bit = 1,\\n\\t len = nodes.length; ii < len; ii++, bit <<= 1) {\\n\\t var node = nodes[ii];\\n\\t if (node !== undefined && ii !== excluding) {\\n\\t bitmap |= bit;\\n\\t packedNodes[packedII++] = node;\\n\\t }\\n\\t }\\n\\t return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\\n\\t}\\n\\tfunction expandNodes(ownerID, nodes, bitmap, including, node) {\\n\\t var count = 0;\\n\\t var expandedNodes = new Array(SIZE);\\n\\t for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\\n\\t expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\\n\\t }\\n\\t expandedNodes[including] = node;\\n\\t return new ArrayNode(ownerID, count + 1, expandedNodes);\\n\\t}\\n\\tfunction mergeIntoMapWith(map, merger, iterables) {\\n\\t var iters = [];\\n\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t var value = iterables[ii];\\n\\t var iter = KeyedIterable(value);\\n\\t if (!isIterable(value)) {\\n\\t iter = iter.map((function(v) {\\n\\t return fromJS(v);\\n\\t }));\\n\\t }\\n\\t iters.push(iter);\\n\\t }\\n\\t return mergeIntoCollectionWith(map, merger, iters);\\n\\t}\\n\\tfunction deepMerger(merger) {\\n\\t return (function(existing, value) {\\n\\t return existing && existing.mergeDeepWith && isIterable(value) ? existing.mergeDeepWith(merger, value) : merger ? merger(existing, value) : value;\\n\\t });\\n\\t}\\n\\tfunction mergeIntoCollectionWith(collection, merger, iters) {\\n\\t if (iters.length === 0) {\\n\\t return collection;\\n\\t }\\n\\t return collection.withMutations((function(collection) {\\n\\t var mergeIntoMap = merger ? (function(value, key) {\\n\\t collection.update(key, NOT_SET, (function(existing) {\\n\\t return existing === NOT_SET ? value : merger(existing, value);\\n\\t }));\\n\\t }) : (function(value, key) {\\n\\t collection.set(key, value);\\n\\t });\\n\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t iters[ii].forEach(mergeIntoMap);\\n\\t }\\n\\t }));\\n\\t}\\n\\tfunction updateInDeepMap(collection, keyPath, notSetValue, updater, offset) {\\n\\t invariant(!collection || collection.set, 'updateIn with invalid keyPath');\\n\\t var key = keyPath[offset];\\n\\t var existing = collection ? collection.get(key, NOT_SET) : NOT_SET;\\n\\t var existingValue = existing === NOT_SET ? undefined : existing;\\n\\t var value = offset === keyPath.length - 1 ? updater(existing === NOT_SET ? notSetValue : existing) : updateInDeepMap(existingValue, keyPath, notSetValue, updater, offset + 1);\\n\\t return value === existingValue ? collection : value === NOT_SET ? collection && collection.remove(key) : (collection || emptyMap()).set(key, value);\\n\\t}\\n\\tfunction popCount(x) {\\n\\t x = x - ((x >> 1) & 0x55555555);\\n\\t x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\\n\\t x = (x + (x >> 4)) & 0x0f0f0f0f;\\n\\t x = x + (x >> 8);\\n\\t x = x + (x >> 16);\\n\\t return x & 0x7f;\\n\\t}\\n\\tfunction setIn(array, idx, val, canEdit) {\\n\\t var newArray = canEdit ? array : arrCopy(array);\\n\\t newArray[idx] = val;\\n\\t return newArray;\\n\\t}\\n\\tfunction spliceIn(array, idx, val, canEdit) {\\n\\t var newLen = array.length + 1;\\n\\t if (canEdit && idx + 1 === newLen) {\\n\\t array[idx] = val;\\n\\t return array;\\n\\t }\\n\\t var newArray = new Array(newLen);\\n\\t var after = 0;\\n\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t if (ii === idx) {\\n\\t newArray[ii] = val;\\n\\t after = -1;\\n\\t } else {\\n\\t newArray[ii] = array[ii + after];\\n\\t }\\n\\t }\\n\\t return newArray;\\n\\t}\\n\\tfunction spliceOut(array, idx, canEdit) {\\n\\t var newLen = array.length - 1;\\n\\t if (canEdit && idx === newLen) {\\n\\t array.pop();\\n\\t return array;\\n\\t }\\n\\t var newArray = new Array(newLen);\\n\\t var after = 0;\\n\\t for (var ii = 0; ii < newLen; ii++) {\\n\\t if (ii === idx) {\\n\\t after = 1;\\n\\t }\\n\\t newArray[ii] = array[ii + after];\\n\\t }\\n\\t return newArray;\\n\\t}\\n\\tvar MAX_BITMAP_SIZE = SIZE / 2;\\n\\tvar MIN_ARRAY_SIZE = SIZE / 4;\\n\\tvar ToKeyedSequence = function ToKeyedSequence(indexed, useKeys) {\\n\\t this._iter = indexed;\\n\\t this._useKeys = useKeys;\\n\\t this.size = indexed.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(ToKeyedSequence, {\\n\\t get: function(key, notSetValue) {\\n\\t return this._iter.get(key, notSetValue);\\n\\t },\\n\\t has: function(key) {\\n\\t return this._iter.has(key);\\n\\t },\\n\\t valueSeq: function() {\\n\\t return this._iter.valueSeq();\\n\\t },\\n\\t reverse: function() {\\n\\t var $__0 = this;\\n\\t var reversedSequence = reverseFactory(this, true);\\n\\t if (!this._useKeys) {\\n\\t reversedSequence.valueSeq = (function() {\\n\\t return $__0._iter.toSeq().reverse();\\n\\t });\\n\\t }\\n\\t return reversedSequence;\\n\\t },\\n\\t map: function(mapper, context) {\\n\\t var $__0 = this;\\n\\t var mappedSequence = mapFactory(this, mapper, context);\\n\\t if (!this._useKeys) {\\n\\t mappedSequence.valueSeq = (function() {\\n\\t return $__0._iter.toSeq().map(mapper, context);\\n\\t });\\n\\t }\\n\\t return mappedSequence;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var ii;\\n\\t return this._iter.__iterate(this._useKeys ? (function(v, k) {\\n\\t return fn(v, k, $__0);\\n\\t }) : ((ii = reverse ? resolveSize(this) : 0), (function(v) {\\n\\t return fn(v, reverse ? --ii : ii++, $__0);\\n\\t })), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t if (this._useKeys) {\\n\\t return this._iter.__iterator(type, reverse);\\n\\t }\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t var ii = reverse ? resolveSize(this) : 0;\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, reverse ? --ii : ii++, step.value, step);\\n\\t }));\\n\\t }\\n\\t}, {}, KeyedSeq);\\n\\tvar ToIndexedSequence = function ToIndexedSequence(iter) {\\n\\t this._iter = iter;\\n\\t this.size = iter.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(ToIndexedSequence, {\\n\\t contains: function(value) {\\n\\t return this._iter.contains(value);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t return this._iter.__iterate((function(v) {\\n\\t return fn(v, iterations++, $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, iterations++, step.value, step);\\n\\t }));\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar ToSetSequence = function ToSetSequence(iter) {\\n\\t this._iter = iter;\\n\\t this.size = iter.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(ToSetSequence, {\\n\\t has: function(key) {\\n\\t return this._iter.contains(key);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._iter.__iterate((function(v) {\\n\\t return fn(v, v, $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t return step.done ? step : iteratorValue(type, step.value, step.value, step);\\n\\t }));\\n\\t }\\n\\t}, {}, SetSeq);\\n\\tvar FromEntriesSequence = function FromEntriesSequence(entries) {\\n\\t this._iter = entries;\\n\\t this.size = entries.size;\\n\\t};\\n\\t($traceurRuntime.createClass)(FromEntriesSequence, {\\n\\t entrySeq: function() {\\n\\t return this._iter.toSeq();\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._iter.__iterate((function(entry) {\\n\\t if (entry) {\\n\\t validateEntry(entry);\\n\\t return fn(entry[1], entry[0], $__0);\\n\\t }\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\\n\\t return new Iterator((function() {\\n\\t while (true) {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t if (entry) {\\n\\t validateEntry(entry);\\n\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, entry[0], entry[1], step);\\n\\t }\\n\\t }\\n\\t }));\\n\\t }\\n\\t}, {}, KeyedSeq);\\n\\tToIndexedSequence.prototype.cacheResult = ToKeyedSequence.prototype.cacheResult = ToSetSequence.prototype.cacheResult = FromEntriesSequence.prototype.cacheResult = cacheResultThrough;\\n\\tfunction flipFactory(iterable) {\\n\\t var flipSequence = makeSequence(iterable);\\n\\t flipSequence._iter = iterable;\\n\\t flipSequence.size = iterable.size;\\n\\t flipSequence.flip = (function() {\\n\\t return iterable;\\n\\t });\\n\\t flipSequence.reverse = function() {\\n\\t var reversedSequence = iterable.reverse.apply(this);\\n\\t reversedSequence.flip = (function() {\\n\\t return iterable.reverse();\\n\\t });\\n\\t return reversedSequence;\\n\\t };\\n\\t flipSequence.has = (function(key) {\\n\\t return iterable.contains(key);\\n\\t });\\n\\t flipSequence.contains = (function(key) {\\n\\t return iterable.has(key);\\n\\t });\\n\\t flipSequence.cacheResult = cacheResultThrough;\\n\\t flipSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return iterable.__iterate((function(v, k) {\\n\\t return fn(k, v, $__0) !== false;\\n\\t }), reverse);\\n\\t };\\n\\t flipSequence.__iteratorUncached = function(type, reverse) {\\n\\t if (type === ITERATE_ENTRIES) {\\n\\t var iterator = iterable.__iterator(type, reverse);\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t if (!step.done) {\\n\\t var k = step.value[0];\\n\\t step.value[0] = step.value[1];\\n\\t step.value[1] = k;\\n\\t }\\n\\t return step;\\n\\t }));\\n\\t }\\n\\t return iterable.__iterator(type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES, reverse);\\n\\t };\\n\\t return flipSequence;\\n\\t}\\n\\tfunction mapFactory(iterable, mapper, context) {\\n\\t var mappedSequence = makeSequence(iterable);\\n\\t mappedSequence.size = iterable.size;\\n\\t mappedSequence.has = (function(key) {\\n\\t return iterable.has(key);\\n\\t });\\n\\t mappedSequence.get = (function(key, notSetValue) {\\n\\t var v = iterable.get(key, NOT_SET);\\n\\t return v === NOT_SET ? notSetValue : mapper.call(context, v, key, iterable);\\n\\t });\\n\\t mappedSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return iterable.__iterate((function(v, k, c) {\\n\\t return fn(mapper.call(context, v, k, c), k, $__0) !== false;\\n\\t }), reverse);\\n\\t };\\n\\t mappedSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t return new Iterator((function() {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t var key = entry[0];\\n\\t return iteratorValue(type, key, mapper.call(context, entry[1], key, iterable), step);\\n\\t }));\\n\\t };\\n\\t return mappedSequence;\\n\\t}\\n\\tfunction reverseFactory(iterable, useKeys) {\\n\\t var reversedSequence = makeSequence(iterable);\\n\\t reversedSequence._iter = iterable;\\n\\t reversedSequence.size = iterable.size;\\n\\t reversedSequence.reverse = (function() {\\n\\t return iterable;\\n\\t });\\n\\t if (iterable.flip) {\\n\\t reversedSequence.flip = function() {\\n\\t var flipSequence = flipFactory(iterable);\\n\\t flipSequence.reverse = (function() {\\n\\t return iterable.flip();\\n\\t });\\n\\t return flipSequence;\\n\\t };\\n\\t }\\n\\t reversedSequence.get = (function(key, notSetValue) {\\n\\t return iterable.get(useKeys ? key : -1 - key, notSetValue);\\n\\t });\\n\\t reversedSequence.has = (function(key) {\\n\\t return iterable.has(useKeys ? key : -1 - key);\\n\\t });\\n\\t reversedSequence.contains = (function(value) {\\n\\t return iterable.contains(value);\\n\\t });\\n\\t reversedSequence.cacheResult = cacheResultThrough;\\n\\t reversedSequence.__iterate = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return iterable.__iterate((function(v, k) {\\n\\t return fn(v, k, $__0);\\n\\t }), !reverse);\\n\\t };\\n\\t reversedSequence.__iterator = (function(type, reverse) {\\n\\t return iterable.__iterator(type, !reverse);\\n\\t });\\n\\t return reversedSequence;\\n\\t}\\n\\tfunction filterFactory(iterable, predicate, context, useKeys) {\\n\\t var filterSequence = makeSequence(iterable);\\n\\t if (useKeys) {\\n\\t filterSequence.has = (function(key) {\\n\\t var v = iterable.get(key, NOT_SET);\\n\\t return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\\n\\t });\\n\\t filterSequence.get = (function(key, notSetValue) {\\n\\t var v = iterable.get(key, NOT_SET);\\n\\t return v !== NOT_SET && predicate.call(context, v, key, iterable) ? v : notSetValue;\\n\\t });\\n\\t }\\n\\t filterSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k, c) {\\n\\t if (predicate.call(context, v, k, c)) {\\n\\t iterations++;\\n\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t }\\n\\t }), reverse);\\n\\t return iterations;\\n\\t };\\n\\t filterSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t while (true) {\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t var key = entry[0];\\n\\t var value = entry[1];\\n\\t if (predicate.call(context, value, key, iterable)) {\\n\\t return iteratorValue(type, useKeys ? key : iterations++, value, step);\\n\\t }\\n\\t }\\n\\t }));\\n\\t };\\n\\t return filterSequence;\\n\\t}\\n\\tfunction countByFactory(iterable, grouper, context) {\\n\\t var groups = Map().asMutable();\\n\\t iterable.__iterate((function(v, k) {\\n\\t groups.update(grouper.call(context, v, k, iterable), 0, (function(a) {\\n\\t return a + 1;\\n\\t }));\\n\\t }));\\n\\t return groups.asImmutable();\\n\\t}\\n\\tfunction groupByFactory(iterable, grouper, context) {\\n\\t var isKeyedIter = isKeyed(iterable);\\n\\t var groups = Map().asMutable();\\n\\t iterable.__iterate((function(v, k) {\\n\\t groups.update(grouper.call(context, v, k, iterable), [], (function(a) {\\n\\t return (a.push(isKeyedIter ? [k, v] : v), a);\\n\\t }));\\n\\t }));\\n\\t var coerce = iterableClass(iterable);\\n\\t return groups.map((function(arr) {\\n\\t return reify(iterable, coerce(arr));\\n\\t }));\\n\\t}\\n\\tfunction takeFactory(iterable, amount) {\\n\\t if (amount > iterable.size) {\\n\\t return iterable;\\n\\t }\\n\\t if (amount < 0) {\\n\\t amount = 0;\\n\\t }\\n\\t var takeSequence = makeSequence(iterable);\\n\\t takeSequence.size = iterable.size && Math.min(iterable.size, amount);\\n\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (amount === 0) {\\n\\t return 0;\\n\\t }\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k) {\\n\\t return ++iterations && fn(v, k, $__0) !== false && iterations < amount;\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t if (iterations++ > amount) {\\n\\t return iteratorDone();\\n\\t }\\n\\t return iterator.next();\\n\\t }));\\n\\t };\\n\\t return takeSequence;\\n\\t}\\n\\tfunction takeWhileFactory(iterable, predicate, context) {\\n\\t var takeSequence = makeSequence(iterable);\\n\\t takeSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k, c) {\\n\\t return predicate.call(context, v, k, c) && ++iterations && fn(v, k, $__0);\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t takeSequence.__iteratorUncached = function(type, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t var iterating = true;\\n\\t return new Iterator((function() {\\n\\t if (!iterating) {\\n\\t return iteratorDone();\\n\\t }\\n\\t var step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t var entry = step.value;\\n\\t var k = entry[0];\\n\\t var v = entry[1];\\n\\t if (!predicate.call(context, v, k, $__0)) {\\n\\t iterating = false;\\n\\t return iteratorDone();\\n\\t }\\n\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t }));\\n\\t };\\n\\t return takeSequence;\\n\\t}\\n\\tfunction skipFactory(iterable, amount, useKeys) {\\n\\t if (amount <= 0) {\\n\\t return iterable;\\n\\t }\\n\\t var skipSequence = makeSequence(iterable);\\n\\t skipSequence.size = iterable.size && Math.max(0, iterable.size - amount);\\n\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var skipped = 0;\\n\\t var isSkipping = true;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k) {\\n\\t if (!(isSkipping && (isSkipping = skipped++ < amount))) {\\n\\t iterations++;\\n\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t }\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = amount && iterable.__iterator(type, reverse);\\n\\t var skipped = 0;\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t while (skipped < amount) {\\n\\t skipped++;\\n\\t iterator.next();\\n\\t }\\n\\t var step = iterator.next();\\n\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t return step;\\n\\t } else if (type === ITERATE_KEYS) {\\n\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t } else {\\n\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t }\\n\\t }));\\n\\t };\\n\\t return skipSequence;\\n\\t}\\n\\tfunction skipWhileFactory(iterable, predicate, context, useKeys) {\\n\\t var skipSequence = makeSequence(iterable);\\n\\t skipSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterate(fn, reverse);\\n\\t }\\n\\t var isSkipping = true;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k, c) {\\n\\t if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\\n\\t iterations++;\\n\\t return fn(v, useKeys ? k : iterations - 1, $__0);\\n\\t }\\n\\t }));\\n\\t return iterations;\\n\\t };\\n\\t skipSequence.__iteratorUncached = function(type, reverse) {\\n\\t var $__0 = this;\\n\\t if (reverse) {\\n\\t return this.cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\\n\\t var skipping = true;\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t var step,\\n\\t k,\\n\\t v;\\n\\t do {\\n\\t step = iterator.next();\\n\\t if (step.done) {\\n\\t if (useKeys || type === ITERATE_VALUES) {\\n\\t return step;\\n\\t } else if (type === ITERATE_KEYS) {\\n\\t return iteratorValue(type, iterations++, undefined, step);\\n\\t } else {\\n\\t return iteratorValue(type, iterations++, step.value[1], step);\\n\\t }\\n\\t }\\n\\t var entry = step.value;\\n\\t k = entry[0];\\n\\t v = entry[1];\\n\\t skipping && (skipping = predicate.call(context, v, k, $__0));\\n\\t } while (skipping);\\n\\t return type === ITERATE_ENTRIES ? step : iteratorValue(type, k, v, step);\\n\\t }));\\n\\t };\\n\\t return skipSequence;\\n\\t}\\n\\tfunction concatFactory(iterable, values) {\\n\\t var isKeyedIterable = isKeyed(iterable);\\n\\t var iters = new ArraySeq([iterable].concat(values)).map((function(v) {\\n\\t if (!isIterable(v)) {\\n\\t v = isKeyedIterable ? keyedSeqFromValue(v) : indexedSeqFromValue(Array.isArray(v) ? v : [v]);\\n\\t } else if (isKeyedIterable) {\\n\\t v = KeyedIterable(v);\\n\\t }\\n\\t return v;\\n\\t }));\\n\\t if (isKeyedIterable) {\\n\\t iters = iters.toKeyedSeq();\\n\\t } else if (!isIndexed(iterable)) {\\n\\t iters = iters.toSetSeq();\\n\\t }\\n\\t var flat = iters.flatten(true);\\n\\t flat.size = iters.reduce((function(sum, seq) {\\n\\t if (sum !== undefined) {\\n\\t var size = seq.size;\\n\\t if (size !== undefined) {\\n\\t return sum + size;\\n\\t }\\n\\t }\\n\\t }), 0);\\n\\t return flat;\\n\\t}\\n\\tfunction flattenFactory(iterable, depth, useKeys) {\\n\\t var flatSequence = makeSequence(iterable);\\n\\t flatSequence.__iterateUncached = function(fn, reverse) {\\n\\t var iterations = 0;\\n\\t var stopped = false;\\n\\t function flatDeep(iter, currentDepth) {\\n\\t var $__0 = this;\\n\\t iter.__iterate((function(v, k) {\\n\\t if ((!depth || currentDepth < depth) && isIterable(v)) {\\n\\t flatDeep(v, currentDepth + 1);\\n\\t } else if (fn(v, useKeys ? k : iterations++, $__0) === false) {\\n\\t stopped = true;\\n\\t }\\n\\t return !stopped;\\n\\t }), reverse);\\n\\t }\\n\\t flatDeep(iterable, 0);\\n\\t return iterations;\\n\\t };\\n\\t flatSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(type, reverse);\\n\\t var stack = [];\\n\\t var iterations = 0;\\n\\t return new Iterator((function() {\\n\\t while (iterator) {\\n\\t var step = iterator.next();\\n\\t if (step.done !== false) {\\n\\t iterator = stack.pop();\\n\\t continue;\\n\\t }\\n\\t var v = step.value;\\n\\t if (type === ITERATE_ENTRIES) {\\n\\t v = v[1];\\n\\t }\\n\\t if ((!depth || stack.length < depth) && isIterable(v)) {\\n\\t stack.push(iterator);\\n\\t iterator = v.__iterator(type, reverse);\\n\\t } else {\\n\\t return useKeys ? step : iteratorValue(type, iterations++, v, step);\\n\\t }\\n\\t }\\n\\t return iteratorDone();\\n\\t }));\\n\\t };\\n\\t return flatSequence;\\n\\t}\\n\\tfunction flatMapFactory(iterable, mapper, context) {\\n\\t var coerce = iterableClass(iterable);\\n\\t return iterable.toSeq().map((function(v, k) {\\n\\t return coerce(mapper.call(context, v, k, iterable));\\n\\t })).flatten(true);\\n\\t}\\n\\tfunction interposeFactory(iterable, separator) {\\n\\t var interposedSequence = makeSequence(iterable);\\n\\t interposedSequence.size = iterable.size && iterable.size * 2 - 1;\\n\\t interposedSequence.__iterateUncached = function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t iterable.__iterate((function(v, k) {\\n\\t return (!iterations || fn(separator, iterations++, $__0) !== false) && fn(v, iterations++, $__0) !== false;\\n\\t }), reverse);\\n\\t return iterations;\\n\\t };\\n\\t interposedSequence.__iteratorUncached = function(type, reverse) {\\n\\t var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\\n\\t var iterations = 0;\\n\\t var step;\\n\\t return new Iterator((function() {\\n\\t if (!step || iterations % 2) {\\n\\t step = iterator.next();\\n\\t if (step.done) {\\n\\t return step;\\n\\t }\\n\\t }\\n\\t return iterations % 2 ? iteratorValue(type, iterations++, separator) : iteratorValue(type, iterations++, step.value, step);\\n\\t }));\\n\\t };\\n\\t return interposedSequence;\\n\\t}\\n\\tfunction reify(iter, seq) {\\n\\t return isSeq(iter) ? seq : iter.constructor(seq);\\n\\t}\\n\\tfunction validateEntry(entry) {\\n\\t if (entry !== Object(entry)) {\\n\\t throw new TypeError('Expected [K, V] tuple: ' + entry);\\n\\t }\\n\\t}\\n\\tfunction resolveSize(iter) {\\n\\t assertNotInfinite(iter.size);\\n\\t return ensureSize(iter);\\n\\t}\\n\\tfunction iterableClass(iterable) {\\n\\t return isKeyed(iterable) ? KeyedIterable : isIndexed(iterable) ? IndexedIterable : SetIterable;\\n\\t}\\n\\tfunction makeSequence(iterable) {\\n\\t return Object.create((isKeyed(iterable) ? KeyedSeq : isIndexed(iterable) ? IndexedSeq : SetSeq).prototype);\\n\\t}\\n\\tfunction cacheResultThrough() {\\n\\t if (this._iter.cacheResult) {\\n\\t this._iter.cacheResult();\\n\\t this.size = this._iter.size;\\n\\t return this;\\n\\t } else {\\n\\t return Seq.prototype.cacheResult.call(this);\\n\\t }\\n\\t}\\n\\tvar List = function List(value) {\\n\\t var empty = emptyList();\\n\\t if (value === null || value === undefined) {\\n\\t return empty;\\n\\t }\\n\\t if (isList(value)) {\\n\\t return value;\\n\\t }\\n\\t value = IndexedIterable(value);\\n\\t var size = value.size;\\n\\t if (size === 0) {\\n\\t return empty;\\n\\t }\\n\\t if (size > 0 && size < SIZE) {\\n\\t return makeList(0, size, SHIFT, null, new VNode(value.toArray()));\\n\\t }\\n\\t return empty.merge(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(List, {\\n\\t toString: function() {\\n\\t return this.__toString('List [', ']');\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t index = wrapIndex(this, index);\\n\\t if (index < 0 || index >= this.size) {\\n\\t return notSetValue;\\n\\t }\\n\\t index += this._origin;\\n\\t var node = listNodeFor(this, index);\\n\\t return node && node.array[index & MASK];\\n\\t },\\n\\t set: function(index, value) {\\n\\t return updateList(this, index, value);\\n\\t },\\n\\t remove: function(index) {\\n\\t return !this.has(index) ? this : index === 0 ? this.shift() : index === this.size - 1 ? this.pop() : this.splice(index, 1);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = this._origin = this._capacity = 0;\\n\\t this._level = SHIFT;\\n\\t this._root = this._tail = null;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return emptyList();\\n\\t },\\n\\t push: function() {\\n\\t var values = arguments;\\n\\t var oldSize = this.size;\\n\\t return this.withMutations((function(list) {\\n\\t setListBounds(list, 0, oldSize + values.length);\\n\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t list.set(oldSize + ii, values[ii]);\\n\\t }\\n\\t }));\\n\\t },\\n\\t pop: function() {\\n\\t return setListBounds(this, 0, -1);\\n\\t },\\n\\t unshift: function() {\\n\\t var values = arguments;\\n\\t return this.withMutations((function(list) {\\n\\t setListBounds(list, -values.length);\\n\\t for (var ii = 0; ii < values.length; ii++) {\\n\\t list.set(ii, values[ii]);\\n\\t }\\n\\t }));\\n\\t },\\n\\t shift: function() {\\n\\t return setListBounds(this, 1);\\n\\t },\\n\\t merge: function() {\\n\\t return mergeIntoListWith(this, undefined, arguments);\\n\\t },\\n\\t mergeWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__5 = 1; $__5 < arguments.length; $__5++)\\n\\t iters[$__5 - 1] = arguments[$__5];\\n\\t return mergeIntoListWith(this, merger, iters);\\n\\t },\\n\\t mergeDeep: function() {\\n\\t return mergeIntoListWith(this, deepMerger(undefined), arguments);\\n\\t },\\n\\t mergeDeepWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__6 = 1; $__6 < arguments.length; $__6++)\\n\\t iters[$__6 - 1] = arguments[$__6];\\n\\t return mergeIntoListWith(this, deepMerger(merger), iters);\\n\\t },\\n\\t setSize: function(size) {\\n\\t return setListBounds(this, 0, size);\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t var size = this.size;\\n\\t if (wholeSlice(begin, end, size)) {\\n\\t return this;\\n\\t }\\n\\t return setListBounds(this, resolveBegin(begin, size), resolveEnd(end, size));\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return new ListIterator(this, type, reverse);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t var iterations = 0;\\n\\t var eachFn = (function(v) {\\n\\t return fn(v, iterations++, $__0);\\n\\t });\\n\\t var tailOffset = getTailOffset(this._capacity);\\n\\t if (reverse) {\\n\\t iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse) && iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse);\\n\\t } else {\\n\\t iterateVNode(this._root, this._level, -this._origin, tailOffset - this._origin, eachFn, reverse) && iterateVNode(this._tail, 0, tailOffset - this._origin, this._capacity - this._origin, eachFn, reverse);\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t return this;\\n\\t }\\n\\t return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\\n\\t }\\n\\t}, {of: function() {\\n\\t return this(arguments);\\n\\t }}, IndexedCollection);\\n\\tfunction isList(maybeList) {\\n\\t return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\\n\\t}\\n\\tList.isList = isList;\\n\\tvar IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\\n\\tvar ListPrototype = List.prototype;\\n\\tListPrototype[IS_LIST_SENTINEL] = true;\\n\\tListPrototype[DELETE] = ListPrototype.remove;\\n\\tListPrototype.setIn = MapPrototype.setIn;\\n\\tListPrototype.removeIn = MapPrototype.removeIn;\\n\\tListPrototype.update = MapPrototype.update;\\n\\tListPrototype.updateIn = MapPrototype.updateIn;\\n\\tListPrototype.withMutations = MapPrototype.withMutations;\\n\\tListPrototype.asMutable = MapPrototype.asMutable;\\n\\tListPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tListPrototype.wasAltered = MapPrototype.wasAltered;\\n\\tvar VNode = function VNode(array, ownerID) {\\n\\t this.array = array;\\n\\t this.ownerID = ownerID;\\n\\t};\\n\\tvar $VNode = VNode;\\n\\t($traceurRuntime.createClass)(VNode, {\\n\\t removeBefore: function(ownerID, level, index) {\\n\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t return this;\\n\\t }\\n\\t var originIndex = (index >>> level) & MASK;\\n\\t if (originIndex >= this.array.length) {\\n\\t return new $VNode([], ownerID);\\n\\t }\\n\\t var removingFirst = originIndex === 0;\\n\\t var newChild;\\n\\t if (level > 0) {\\n\\t var oldChild = this.array[originIndex];\\n\\t newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\\n\\t if (newChild === oldChild && removingFirst) {\\n\\t return this;\\n\\t }\\n\\t }\\n\\t if (removingFirst && !newChild) {\\n\\t return this;\\n\\t }\\n\\t var editable = editableVNode(this, ownerID);\\n\\t if (!removingFirst) {\\n\\t for (var ii = 0; ii < originIndex; ii++) {\\n\\t editable.array[ii] = undefined;\\n\\t }\\n\\t }\\n\\t if (newChild) {\\n\\t editable.array[originIndex] = newChild;\\n\\t }\\n\\t return editable;\\n\\t },\\n\\t removeAfter: function(ownerID, level, index) {\\n\\t if (index === level ? 1 << level : 0 || this.array.length === 0) {\\n\\t return this;\\n\\t }\\n\\t var sizeIndex = ((index - 1) >>> level) & MASK;\\n\\t if (sizeIndex >= this.array.length) {\\n\\t return this;\\n\\t }\\n\\t var removingLast = sizeIndex === this.array.length - 1;\\n\\t var newChild;\\n\\t if (level > 0) {\\n\\t var oldChild = this.array[sizeIndex];\\n\\t newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\\n\\t if (newChild === oldChild && removingLast) {\\n\\t return this;\\n\\t }\\n\\t }\\n\\t if (removingLast && !newChild) {\\n\\t return this;\\n\\t }\\n\\t var editable = editableVNode(this, ownerID);\\n\\t if (!removingLast) {\\n\\t editable.array.pop();\\n\\t }\\n\\t if (newChild) {\\n\\t editable.array[sizeIndex] = newChild;\\n\\t }\\n\\t return editable;\\n\\t }\\n\\t}, {});\\n\\tfunction iterateVNode(node, level, offset, max, fn, reverse) {\\n\\t var ii;\\n\\t var array = node && node.array;\\n\\t if (level === 0) {\\n\\t var from = offset < 0 ? -offset : 0;\\n\\t var to = max - offset;\\n\\t if (to > SIZE) {\\n\\t to = SIZE;\\n\\t }\\n\\t for (ii = from; ii < to; ii++) {\\n\\t if (fn(array && array[reverse ? from + to - 1 - ii : ii]) === false) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t } else {\\n\\t var step = 1 << level;\\n\\t var newLevel = level - SHIFT;\\n\\t for (ii = 0; ii <= MASK; ii++) {\\n\\t var levelIndex = reverse ? MASK - ii : ii;\\n\\t var newOffset = offset + (levelIndex << level);\\n\\t if (newOffset < max && newOffset + step > 0) {\\n\\t var nextNode = array && array[levelIndex];\\n\\t if (!iterateVNode(nextNode, newLevel, newOffset, max, fn, reverse)) {\\n\\t return false;\\n\\t }\\n\\t }\\n\\t }\\n\\t }\\n\\t return true;\\n\\t}\\n\\tvar ListIterator = function ListIterator(list, type, reverse) {\\n\\t this._type = type;\\n\\t this._reverse = !!reverse;\\n\\t this._maxIndex = list.size - 1;\\n\\t var tailOffset = getTailOffset(list._capacity);\\n\\t var rootStack = listIteratorFrame(list._root && list._root.array, list._level, -list._origin, tailOffset - list._origin - 1);\\n\\t var tailStack = listIteratorFrame(list._tail && list._tail.array, 0, tailOffset - list._origin, list._capacity - list._origin - 1);\\n\\t this._stack = reverse ? tailStack : rootStack;\\n\\t this._stack.__prev = reverse ? rootStack : tailStack;\\n\\t};\\n\\t($traceurRuntime.createClass)(ListIterator, {next: function() {\\n\\t var stack = this._stack;\\n\\t while (stack) {\\n\\t var array = stack.array;\\n\\t var rawIndex = stack.index++;\\n\\t if (this._reverse) {\\n\\t rawIndex = MASK - rawIndex;\\n\\t if (rawIndex > stack.rawMax) {\\n\\t rawIndex = stack.rawMax;\\n\\t stack.index = SIZE - rawIndex;\\n\\t }\\n\\t }\\n\\t if (rawIndex >= 0 && rawIndex < SIZE && rawIndex <= stack.rawMax) {\\n\\t var value = array && array[rawIndex];\\n\\t if (stack.level === 0) {\\n\\t var type = this._type;\\n\\t var index;\\n\\t if (type !== 1) {\\n\\t index = stack.offset + (rawIndex << stack.level);\\n\\t if (this._reverse) {\\n\\t index = this._maxIndex - index;\\n\\t }\\n\\t }\\n\\t return iteratorValue(type, index, value);\\n\\t } else {\\n\\t this._stack = stack = listIteratorFrame(value && value.array, stack.level - SHIFT, stack.offset + (rawIndex << stack.level), stack.max, stack);\\n\\t }\\n\\t continue;\\n\\t }\\n\\t stack = this._stack = this._stack.__prev;\\n\\t }\\n\\t return iteratorDone();\\n\\t }}, {}, Iterator);\\n\\tfunction listIteratorFrame(array, level, offset, max, prevFrame) {\\n\\t return {\\n\\t array: array,\\n\\t level: level,\\n\\t offset: offset,\\n\\t max: max,\\n\\t rawMax: ((max - offset) >> level),\\n\\t index: 0,\\n\\t __prev: prevFrame\\n\\t };\\n\\t}\\n\\tfunction makeList(origin, capacity, level, root, tail, ownerID, hash) {\\n\\t var list = Object.create(ListPrototype);\\n\\t list.size = capacity - origin;\\n\\t list._origin = origin;\\n\\t list._capacity = capacity;\\n\\t list._level = level;\\n\\t list._root = root;\\n\\t list._tail = tail;\\n\\t list.__ownerID = ownerID;\\n\\t list.__hash = hash;\\n\\t list.__altered = false;\\n\\t return list;\\n\\t}\\n\\tvar EMPTY_LIST;\\n\\tfunction emptyList() {\\n\\t return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\\n\\t}\\n\\tfunction updateList(list, index, value) {\\n\\t index = wrapIndex(list, index);\\n\\t if (index >= list.size || index < 0) {\\n\\t return list.withMutations((function(list) {\\n\\t index < 0 ? setListBounds(list, index).set(0, value) : setListBounds(list, 0, index + 1).set(index, value);\\n\\t }));\\n\\t }\\n\\t index += list._origin;\\n\\t var newTail = list._tail;\\n\\t var newRoot = list._root;\\n\\t var didAlter = MakeRef(DID_ALTER);\\n\\t if (index >= getTailOffset(list._capacity)) {\\n\\t newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\\n\\t } else {\\n\\t newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\\n\\t }\\n\\t if (!didAlter.value) {\\n\\t return list;\\n\\t }\\n\\t if (list.__ownerID) {\\n\\t list._root = newRoot;\\n\\t list._tail = newTail;\\n\\t list.__hash = undefined;\\n\\t list.__altered = true;\\n\\t return list;\\n\\t }\\n\\t return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\\n\\t}\\n\\tfunction updateVNode(node, ownerID, level, index, value, didAlter) {\\n\\t var idx = (index >>> level) & MASK;\\n\\t var nodeHas = node && idx < node.array.length;\\n\\t if (!nodeHas && value === undefined) {\\n\\t return node;\\n\\t }\\n\\t var newNode;\\n\\t if (level > 0) {\\n\\t var lowerNode = node && node.array[idx];\\n\\t var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\\n\\t if (newLowerNode === lowerNode) {\\n\\t return node;\\n\\t }\\n\\t newNode = editableVNode(node, ownerID);\\n\\t newNode.array[idx] = newLowerNode;\\n\\t return newNode;\\n\\t }\\n\\t if (nodeHas && node.array[idx] === value) {\\n\\t return node;\\n\\t }\\n\\t SetRef(didAlter);\\n\\t newNode = editableVNode(node, ownerID);\\n\\t if (value === undefined && idx === newNode.array.length - 1) {\\n\\t newNode.array.pop();\\n\\t } else {\\n\\t newNode.array[idx] = value;\\n\\t }\\n\\t return newNode;\\n\\t}\\n\\tfunction editableVNode(node, ownerID) {\\n\\t if (ownerID && node && ownerID === node.ownerID) {\\n\\t return node;\\n\\t }\\n\\t return new VNode(node ? node.array.slice() : [], ownerID);\\n\\t}\\n\\tfunction listNodeFor(list, rawIndex) {\\n\\t if (rawIndex >= getTailOffset(list._capacity)) {\\n\\t return list._tail;\\n\\t }\\n\\t if (rawIndex < 1 << (list._level + SHIFT)) {\\n\\t var node = list._root;\\n\\t var level = list._level;\\n\\t while (node && level > 0) {\\n\\t node = node.array[(rawIndex >>> level) & MASK];\\n\\t level -= SHIFT;\\n\\t }\\n\\t return node;\\n\\t }\\n\\t}\\n\\tfunction setListBounds(list, begin, end) {\\n\\t var owner = list.__ownerID || new OwnerID();\\n\\t var oldOrigin = list._origin;\\n\\t var oldCapacity = list._capacity;\\n\\t var newOrigin = oldOrigin + begin;\\n\\t var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\\n\\t if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\\n\\t return list;\\n\\t }\\n\\t if (newOrigin >= newCapacity) {\\n\\t return list.clear();\\n\\t }\\n\\t var newLevel = list._level;\\n\\t var newRoot = list._root;\\n\\t var offsetShift = 0;\\n\\t while (newOrigin + offsetShift < 0) {\\n\\t newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\\n\\t newLevel += SHIFT;\\n\\t offsetShift += 1 << newLevel;\\n\\t }\\n\\t if (offsetShift) {\\n\\t newOrigin += offsetShift;\\n\\t oldOrigin += offsetShift;\\n\\t newCapacity += offsetShift;\\n\\t oldCapacity += offsetShift;\\n\\t }\\n\\t var oldTailOffset = getTailOffset(oldCapacity);\\n\\t var newTailOffset = getTailOffset(newCapacity);\\n\\t while (newTailOffset >= 1 << (newLevel + SHIFT)) {\\n\\t newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\\n\\t newLevel += SHIFT;\\n\\t }\\n\\t var oldTail = list._tail;\\n\\t var newTail = newTailOffset < oldTailOffset ? listNodeFor(list, newCapacity - 1) : newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\\n\\t if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\\n\\t newRoot = editableVNode(newRoot, owner);\\n\\t var node = newRoot;\\n\\t for (var level = newLevel; level > SHIFT; level -= SHIFT) {\\n\\t var idx = (oldTailOffset >>> level) & MASK;\\n\\t node = node.array[idx] = editableVNode(node.array[idx], owner);\\n\\t }\\n\\t node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\\n\\t }\\n\\t if (newCapacity < oldCapacity) {\\n\\t newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\\n\\t }\\n\\t if (newOrigin >= newTailOffset) {\\n\\t newOrigin -= newTailOffset;\\n\\t newCapacity -= newTailOffset;\\n\\t newLevel = SHIFT;\\n\\t newRoot = null;\\n\\t newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\\n\\t } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\\n\\t offsetShift = 0;\\n\\t while (newRoot) {\\n\\t var beginIndex = (newOrigin >>> newLevel) & MASK;\\n\\t if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\\n\\t break;\\n\\t }\\n\\t if (beginIndex) {\\n\\t offsetShift += (1 << newLevel) * beginIndex;\\n\\t }\\n\\t newLevel -= SHIFT;\\n\\t newRoot = newRoot.array[beginIndex];\\n\\t }\\n\\t if (newRoot && newOrigin > oldOrigin) {\\n\\t newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\\n\\t }\\n\\t if (newRoot && newTailOffset < oldTailOffset) {\\n\\t newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\\n\\t }\\n\\t if (offsetShift) {\\n\\t newOrigin -= offsetShift;\\n\\t newCapacity -= offsetShift;\\n\\t }\\n\\t }\\n\\t if (list.__ownerID) {\\n\\t list.size = newCapacity - newOrigin;\\n\\t list._origin = newOrigin;\\n\\t list._capacity = newCapacity;\\n\\t list._level = newLevel;\\n\\t list._root = newRoot;\\n\\t list._tail = newTail;\\n\\t list.__hash = undefined;\\n\\t list.__altered = true;\\n\\t return list;\\n\\t }\\n\\t return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\\n\\t}\\n\\tfunction mergeIntoListWith(list, merger, iterables) {\\n\\t var iters = [];\\n\\t var maxSize = 0;\\n\\t for (var ii = 0; ii < iterables.length; ii++) {\\n\\t var value = iterables[ii];\\n\\t var iter = IndexedIterable(value);\\n\\t if (iter.size > maxSize) {\\n\\t maxSize = iter.size;\\n\\t }\\n\\t if (!isIterable(value)) {\\n\\t iter = iter.map((function(v) {\\n\\t return fromJS(v);\\n\\t }));\\n\\t }\\n\\t iters.push(iter);\\n\\t }\\n\\t if (maxSize > list.size) {\\n\\t list = list.setSize(maxSize);\\n\\t }\\n\\t return mergeIntoCollectionWith(list, merger, iters);\\n\\t}\\n\\tfunction getTailOffset(size) {\\n\\t return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\\n\\t}\\n\\tvar Stack = function Stack(value) {\\n\\t return value === null || value === undefined ? emptyStack() : isStack(value) ? value : emptyStack().unshiftAll(value);\\n\\t};\\n\\tvar $Stack = Stack;\\n\\t($traceurRuntime.createClass)(Stack, {\\n\\t toString: function() {\\n\\t return this.__toString('Stack [', ']');\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t var head = this._head;\\n\\t while (head && index--) {\\n\\t head = head.next;\\n\\t }\\n\\t return head ? head.value : notSetValue;\\n\\t },\\n\\t peek: function() {\\n\\t return this._head && this._head.value;\\n\\t },\\n\\t push: function() {\\n\\t if (arguments.length === 0) {\\n\\t return this;\\n\\t }\\n\\t var newSize = this.size + arguments.length;\\n\\t var head = this._head;\\n\\t for (var ii = arguments.length - 1; ii >= 0; ii--) {\\n\\t head = {\\n\\t value: arguments[ii],\\n\\t next: head\\n\\t };\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = newSize;\\n\\t this._head = head;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return makeStack(newSize, head);\\n\\t },\\n\\t pushAll: function(iter) {\\n\\t iter = IndexedIterable(iter);\\n\\t if (iter.size === 0) {\\n\\t return this;\\n\\t }\\n\\t var newSize = this.size;\\n\\t var head = this._head;\\n\\t iter.reverse().forEach((function(value) {\\n\\t newSize++;\\n\\t head = {\\n\\t value: value,\\n\\t next: head\\n\\t };\\n\\t }));\\n\\t if (this.__ownerID) {\\n\\t this.size = newSize;\\n\\t this._head = head;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return makeStack(newSize, head);\\n\\t },\\n\\t pop: function() {\\n\\t return this.slice(1);\\n\\t },\\n\\t unshift: function() {\\n\\t return this.push.apply(this, arguments);\\n\\t },\\n\\t unshiftAll: function(iter) {\\n\\t return this.pushAll(iter);\\n\\t },\\n\\t shift: function() {\\n\\t return this.pop.apply(this, arguments);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._head = undefined;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return emptyStack();\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t if (wholeSlice(begin, end, this.size)) {\\n\\t return this;\\n\\t }\\n\\t var resolvedBegin = resolveBegin(begin, this.size);\\n\\t var resolvedEnd = resolveEnd(end, this.size);\\n\\t if (resolvedEnd !== this.size) {\\n\\t return $traceurRuntime.superCall(this, $Stack.prototype, \\\"slice\\\", [begin, end]);\\n\\t }\\n\\t var newSize = this.size - resolvedBegin;\\n\\t var head = this._head;\\n\\t while (resolvedBegin--) {\\n\\t head = head.next;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = newSize;\\n\\t this._head = head;\\n\\t this.__hash = undefined;\\n\\t this.__altered = true;\\n\\t return this;\\n\\t }\\n\\t return makeStack(newSize, head);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this.__altered = false;\\n\\t return this;\\n\\t }\\n\\t return makeStack(this.size, this._head, ownerID, this.__hash);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t if (reverse) {\\n\\t return this.toSeq().cacheResult.__iterate(fn, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t var node = this._head;\\n\\t while (node) {\\n\\t if (fn(node.value, iterations++, this) === false) {\\n\\t break;\\n\\t }\\n\\t node = node.next;\\n\\t }\\n\\t return iterations;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t if (reverse) {\\n\\t return this.toSeq().cacheResult().__iterator(type, reverse);\\n\\t }\\n\\t var iterations = 0;\\n\\t var node = this._head;\\n\\t return new Iterator((function() {\\n\\t if (node) {\\n\\t var value = node.value;\\n\\t node = node.next;\\n\\t return iteratorValue(type, iterations++, value);\\n\\t }\\n\\t return iteratorDone();\\n\\t }));\\n\\t }\\n\\t}, {of: function() {\\n\\t return this(arguments);\\n\\t }}, IndexedCollection);\\n\\tfunction isStack(maybeStack) {\\n\\t return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\\n\\t}\\n\\tStack.isStack = isStack;\\n\\tvar IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\\n\\tvar StackPrototype = Stack.prototype;\\n\\tStackPrototype[IS_STACK_SENTINEL] = true;\\n\\tStackPrototype.withMutations = MapPrototype.withMutations;\\n\\tStackPrototype.asMutable = MapPrototype.asMutable;\\n\\tStackPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tStackPrototype.wasAltered = MapPrototype.wasAltered;\\n\\tfunction makeStack(size, head, ownerID, hash) {\\n\\t var map = Object.create(StackPrototype);\\n\\t map.size = size;\\n\\t map._head = head;\\n\\t map.__ownerID = ownerID;\\n\\t map.__hash = hash;\\n\\t map.__altered = false;\\n\\t return map;\\n\\t}\\n\\tvar EMPTY_STACK;\\n\\tfunction emptyStack() {\\n\\t return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\\n\\t}\\n\\tvar Set = function Set(value) {\\n\\t return value === null || value === undefined ? emptySet() : isSet(value) ? value : emptySet().union(value);\\n\\t};\\n\\t($traceurRuntime.createClass)(Set, {\\n\\t toString: function() {\\n\\t return this.__toString('Set {', '}');\\n\\t },\\n\\t has: function(value) {\\n\\t return this._map.has(value);\\n\\t },\\n\\t add: function(value) {\\n\\t var newMap = this._map.set(value, true);\\n\\t if (this.__ownerID) {\\n\\t this.size = newMap.size;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return newMap === this._map ? this : makeSet(newMap);\\n\\t },\\n\\t remove: function(value) {\\n\\t var newMap = this._map.remove(value);\\n\\t if (this.__ownerID) {\\n\\t this.size = newMap.size;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return newMap === this._map ? this : newMap.size === 0 ? emptySet() : makeSet(newMap);\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._map.clear();\\n\\t return this;\\n\\t }\\n\\t return emptySet();\\n\\t },\\n\\t union: function() {\\n\\t var iters = arguments;\\n\\t if (iters.length === 0) {\\n\\t return this;\\n\\t }\\n\\t return this.withMutations((function(set) {\\n\\t for (var ii = 0; ii < iters.length; ii++) {\\n\\t SetIterable(iters[ii]).forEach((function(value) {\\n\\t return set.add(value);\\n\\t }));\\n\\t }\\n\\t }));\\n\\t },\\n\\t intersect: function() {\\n\\t for (var iters = [],\\n\\t $__7 = 0; $__7 < arguments.length; $__7++)\\n\\t iters[$__7] = arguments[$__7];\\n\\t if (iters.length === 0) {\\n\\t return this;\\n\\t }\\n\\t iters = iters.map((function(iter) {\\n\\t return SetIterable(iter);\\n\\t }));\\n\\t var originalSet = this;\\n\\t return this.withMutations((function(set) {\\n\\t originalSet.forEach((function(value) {\\n\\t if (!iters.every((function(iter) {\\n\\t return iter.contains(value);\\n\\t }))) {\\n\\t set.remove(value);\\n\\t }\\n\\t }));\\n\\t }));\\n\\t },\\n\\t subtract: function() {\\n\\t for (var iters = [],\\n\\t $__8 = 0; $__8 < arguments.length; $__8++)\\n\\t iters[$__8] = arguments[$__8];\\n\\t if (iters.length === 0) {\\n\\t return this;\\n\\t }\\n\\t iters = iters.map((function(iter) {\\n\\t return SetIterable(iter);\\n\\t }));\\n\\t var originalSet = this;\\n\\t return this.withMutations((function(set) {\\n\\t originalSet.forEach((function(value) {\\n\\t if (iters.some((function(iter) {\\n\\t return iter.contains(value);\\n\\t }))) {\\n\\t set.remove(value);\\n\\t }\\n\\t }));\\n\\t }));\\n\\t },\\n\\t merge: function() {\\n\\t return this.union.apply(this, arguments);\\n\\t },\\n\\t mergeWith: function(merger) {\\n\\t for (var iters = [],\\n\\t $__9 = 1; $__9 < arguments.length; $__9++)\\n\\t iters[$__9 - 1] = arguments[$__9];\\n\\t return this.union.apply(this, iters);\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this._map.wasAltered();\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._map.__iterate((function(_, k) {\\n\\t return fn(k, k, $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return this._map.map((function(_, k) {\\n\\t return k;\\n\\t })).__iterator(type, reverse);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return makeSet(newMap, ownerID);\\n\\t }\\n\\t}, {\\n\\t of: function() {\\n\\t return this(arguments);\\n\\t },\\n\\t fromKeys: function(value) {\\n\\t return this(KeyedSeq(value).flip().valueSeq());\\n\\t }\\n\\t}, SetCollection);\\n\\tfunction isSet(maybeSet) {\\n\\t return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\\n\\t}\\n\\tSet.isSet = isSet;\\n\\tvar IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\\n\\tvar SetPrototype = Set.prototype;\\n\\tSetPrototype[IS_SET_SENTINEL] = true;\\n\\tSetPrototype[DELETE] = SetPrototype.remove;\\n\\tSetPrototype.mergeDeep = SetPrototype.merge;\\n\\tSetPrototype.mergeDeepWith = SetPrototype.mergeWith;\\n\\tSetPrototype.withMutations = MapPrototype.withMutations;\\n\\tSetPrototype.asMutable = MapPrototype.asMutable;\\n\\tSetPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tfunction makeSet(map, ownerID) {\\n\\t var set = Object.create(SetPrototype);\\n\\t set.size = map ? map.size : 0;\\n\\t set._map = map;\\n\\t set.__ownerID = ownerID;\\n\\t return set;\\n\\t}\\n\\tvar EMPTY_SET;\\n\\tfunction emptySet() {\\n\\t return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\\n\\t}\\n\\tvar OrderedMap = function OrderedMap(value) {\\n\\t return value === null || value === undefined ? emptyOrderedMap() : isOrderedMap(value) ? value : emptyOrderedMap().merge(KeyedIterable(value));\\n\\t};\\n\\t($traceurRuntime.createClass)(OrderedMap, {\\n\\t toString: function() {\\n\\t return this.__toString('OrderedMap {', '}');\\n\\t },\\n\\t get: function(k, notSetValue) {\\n\\t var index = this._map.get(k);\\n\\t return index !== undefined ? this._list.get(index)[1] : notSetValue;\\n\\t },\\n\\t clear: function() {\\n\\t if (this.size === 0) {\\n\\t return this;\\n\\t }\\n\\t if (this.__ownerID) {\\n\\t this.size = 0;\\n\\t this._map.clear();\\n\\t this._list.clear();\\n\\t return this;\\n\\t }\\n\\t return emptyOrderedMap();\\n\\t },\\n\\t set: function(k, v) {\\n\\t return updateOrderedMap(this, k, v);\\n\\t },\\n\\t remove: function(k) {\\n\\t return updateOrderedMap(this, k, NOT_SET);\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this._map.wasAltered() || this._list.wasAltered();\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return this._list.__iterate((function(entry) {\\n\\t return entry && fn(entry[1], entry[0], $__0);\\n\\t }), reverse);\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t return this._list.fromEntrySeq().__iterator(type, reverse);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map.__ensureOwner(ownerID);\\n\\t var newList = this._list.__ensureOwner(ownerID);\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this._map = newMap;\\n\\t this._list = newList;\\n\\t return this;\\n\\t }\\n\\t return makeOrderedMap(newMap, newList, ownerID, this.__hash);\\n\\t }\\n\\t}, {of: function() {\\n\\t return this(arguments);\\n\\t }}, Map);\\n\\tfunction isOrderedMap(maybeOrderedMap) {\\n\\t return !!(maybeOrderedMap && maybeOrderedMap[IS_ORDERED_MAP_SENTINEL]);\\n\\t}\\n\\tOrderedMap.isOrderedMap = isOrderedMap;\\n\\tvar IS_ORDERED_MAP_SENTINEL = '@@__IMMUTABLE_ORDERED_MAP__@@';\\n\\tOrderedMap.prototype[IS_ORDERED_MAP_SENTINEL] = true;\\n\\tOrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\\n\\tfunction makeOrderedMap(map, list, ownerID, hash) {\\n\\t var omap = Object.create(OrderedMap.prototype);\\n\\t omap.size = map ? map.size : 0;\\n\\t omap._map = map;\\n\\t omap._list = list;\\n\\t omap.__ownerID = ownerID;\\n\\t omap.__hash = hash;\\n\\t return omap;\\n\\t}\\n\\tvar EMPTY_ORDERED_MAP;\\n\\tfunction emptyOrderedMap() {\\n\\t return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\\n\\t}\\n\\tfunction updateOrderedMap(omap, k, v) {\\n\\t var map = omap._map;\\n\\t var list = omap._list;\\n\\t var i = map.get(k);\\n\\t var has = i !== undefined;\\n\\t var removed = v === NOT_SET;\\n\\t if ((!has && removed) || (has && v === list.get(i)[1])) {\\n\\t return omap;\\n\\t }\\n\\t if (!has) {\\n\\t i = list.size;\\n\\t }\\n\\t var newMap = removed ? map.remove(k) : has ? map : map.set(k, i);\\n\\t var newList = removed ? list.set(i, undefined) : list.set(i, [k, v]);\\n\\t if (omap.__ownerID) {\\n\\t omap.size = newMap.size;\\n\\t omap._map = newMap;\\n\\t omap._list = newList;\\n\\t omap.__hash = undefined;\\n\\t return omap;\\n\\t }\\n\\t return makeOrderedMap(newMap, newList);\\n\\t}\\n\\tvar Record = function Record(defaultValues, name) {\\n\\t var RecordType = function Record(values) {\\n\\t if (!(this instanceof RecordType)) {\\n\\t return new RecordType(values);\\n\\t }\\n\\t this._map = Map(values);\\n\\t };\\n\\t var keys = Object.keys(defaultValues);\\n\\t var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\\n\\t RecordTypePrototype.constructor = RecordType;\\n\\t name && (RecordTypePrototype._name = name);\\n\\t RecordTypePrototype._defaultValues = defaultValues;\\n\\t RecordTypePrototype._keys = keys;\\n\\t RecordTypePrototype.size = keys.length;\\n\\t try {\\n\\t keys.forEach((function(key) {\\n\\t Object.defineProperty(RecordType.prototype, key, {\\n\\t get: function() {\\n\\t return this.get(key);\\n\\t },\\n\\t set: function(value) {\\n\\t invariant(this.__ownerID, 'Cannot set on an immutable record.');\\n\\t this.set(key, value);\\n\\t }\\n\\t });\\n\\t }));\\n\\t } catch (error) {}\\n\\t return RecordType;\\n\\t};\\n\\t($traceurRuntime.createClass)(Record, {\\n\\t toString: function() {\\n\\t return this.__toString(recordName(this) + ' {', '}');\\n\\t },\\n\\t has: function(k) {\\n\\t return this._defaultValues.hasOwnProperty(k);\\n\\t },\\n\\t get: function(k, notSetValue) {\\n\\t if (notSetValue !== undefined && !this.has(k)) {\\n\\t return notSetValue;\\n\\t }\\n\\t var defaultVal = this._defaultValues[k];\\n\\t return this._map ? this._map.get(k, defaultVal) : defaultVal;\\n\\t },\\n\\t clear: function() {\\n\\t if (this.__ownerID) {\\n\\t this._map && this._map.clear();\\n\\t return this;\\n\\t }\\n\\t var SuperRecord = Object.getPrototypeOf(this).constructor;\\n\\t return SuperRecord._empty || (SuperRecord._empty = makeRecord(this, emptyMap()));\\n\\t },\\n\\t set: function(k, v) {\\n\\t if (!this.has(k)) {\\n\\t throw new Error('Cannot set unknown key \\\"' + k + '\\\" on ' + recordName(this));\\n\\t }\\n\\t var newMap = this._map && this._map.set(k, v);\\n\\t if (this.__ownerID || newMap === this._map) {\\n\\t return this;\\n\\t }\\n\\t return makeRecord(this, newMap);\\n\\t },\\n\\t remove: function(k) {\\n\\t if (!this.has(k)) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map && this._map.remove(k);\\n\\t if (this.__ownerID || newMap === this._map) {\\n\\t return this;\\n\\t }\\n\\t return makeRecord(this, newMap);\\n\\t },\\n\\t wasAltered: function() {\\n\\t return this._map.wasAltered();\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var $__0 = this;\\n\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t return $__0.get(k);\\n\\t })).__iterator(type, reverse);\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var $__0 = this;\\n\\t return KeyedIterable(this._defaultValues).map((function(_, k) {\\n\\t return $__0.get(k);\\n\\t })).__iterate(fn, reverse);\\n\\t },\\n\\t __ensureOwner: function(ownerID) {\\n\\t if (ownerID === this.__ownerID) {\\n\\t return this;\\n\\t }\\n\\t var newMap = this._map && this._map.__ensureOwner(ownerID);\\n\\t if (!ownerID) {\\n\\t this.__ownerID = ownerID;\\n\\t this._map = newMap;\\n\\t return this;\\n\\t }\\n\\t return makeRecord(this, newMap, ownerID);\\n\\t }\\n\\t}, {}, KeyedCollection);\\n\\tvar RecordPrototype = Record.prototype;\\n\\tRecordPrototype[DELETE] = RecordPrototype.remove;\\n\\tRecordPrototype.merge = MapPrototype.merge;\\n\\tRecordPrototype.mergeWith = MapPrototype.mergeWith;\\n\\tRecordPrototype.mergeDeep = MapPrototype.mergeDeep;\\n\\tRecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\\n\\tRecordPrototype.update = MapPrototype.update;\\n\\tRecordPrototype.updateIn = MapPrototype.updateIn;\\n\\tRecordPrototype.withMutations = MapPrototype.withMutations;\\n\\tRecordPrototype.asMutable = MapPrototype.asMutable;\\n\\tRecordPrototype.asImmutable = MapPrototype.asImmutable;\\n\\tfunction makeRecord(likeRecord, map, ownerID) {\\n\\t var record = Object.create(Object.getPrototypeOf(likeRecord));\\n\\t record._map = map;\\n\\t record.__ownerID = ownerID;\\n\\t return record;\\n\\t}\\n\\tfunction recordName(record) {\\n\\t return record._name || record.constructor.name;\\n\\t}\\n\\tvar Range = function Range(start, end, step) {\\n\\t if (!(this instanceof $Range)) {\\n\\t return new $Range(start, end, step);\\n\\t }\\n\\t invariant(step !== 0, 'Cannot step a Range by 0');\\n\\t start = start || 0;\\n\\t if (end === undefined) {\\n\\t end = Infinity;\\n\\t }\\n\\t if (start === end && __EMPTY_RANGE) {\\n\\t return __EMPTY_RANGE;\\n\\t }\\n\\t step = step === undefined ? 1 : Math.abs(step);\\n\\t if (end < start) {\\n\\t step = -step;\\n\\t }\\n\\t this._start = start;\\n\\t this._end = end;\\n\\t this._step = step;\\n\\t this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\\n\\t};\\n\\tvar $Range = Range;\\n\\t($traceurRuntime.createClass)(Range, {\\n\\t toString: function() {\\n\\t if (this.size === 0) {\\n\\t return 'Range []';\\n\\t }\\n\\t return 'Range [ ' + this._start + '...' + this._end + (this._step > 1 ? ' by ' + this._step : '') + ' ]';\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t return this.has(index) ? this._start + wrapIndex(this, index) * this._step : notSetValue;\\n\\t },\\n\\t contains: function(searchValue) {\\n\\t var possibleIndex = (searchValue - this._start) / this._step;\\n\\t return possibleIndex >= 0 && possibleIndex < this.size && possibleIndex === Math.floor(possibleIndex);\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t if (wholeSlice(begin, end, this.size)) {\\n\\t return this;\\n\\t }\\n\\t begin = resolveBegin(begin, this.size);\\n\\t end = resolveEnd(end, this.size);\\n\\t if (end <= begin) {\\n\\t return __EMPTY_RANGE;\\n\\t }\\n\\t return new $Range(this.get(begin, this._end), this.get(end, this._end), this._step);\\n\\t },\\n\\t indexOf: function(searchValue) {\\n\\t var offsetValue = searchValue - this._start;\\n\\t if (offsetValue % this._step === 0) {\\n\\t var index = offsetValue / this._step;\\n\\t if (index >= 0 && index < this.size) {\\n\\t return index;\\n\\t }\\n\\t }\\n\\t return -1;\\n\\t },\\n\\t lastIndexOf: function(searchValue) {\\n\\t return this.indexOf(searchValue);\\n\\t },\\n\\t take: function(amount) {\\n\\t return this.slice(0, Math.max(0, amount));\\n\\t },\\n\\t skip: function(amount) {\\n\\t return this.slice(Math.max(0, amount));\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t var maxIndex = this.size - 1;\\n\\t var step = this._step;\\n\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t for (var ii = 0; ii <= maxIndex; ii++) {\\n\\t if (fn(value, ii, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t value += reverse ? -step : step;\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var maxIndex = this.size - 1;\\n\\t var step = this._step;\\n\\t var value = reverse ? this._start + maxIndex * step : this._start;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t var v = value;\\n\\t value += reverse ? -step : step;\\n\\t return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\\n\\t }));\\n\\t },\\n\\t __deepEquals: function(other) {\\n\\t return other instanceof $Range ? this._start === other._start && this._end === other._end && this._step === other._step : $traceurRuntime.superCall(this, $Range.prototype, \\\"__deepEquals\\\", [other]);\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar RangePrototype = Range.prototype;\\n\\tRangePrototype.__toJS = RangePrototype.toArray;\\n\\tRangePrototype.first = ListPrototype.first;\\n\\tRangePrototype.last = ListPrototype.last;\\n\\tvar __EMPTY_RANGE = Range(0, 0);\\n\\tvar Repeat = function Repeat(value, times) {\\n\\t if (times <= 0 && EMPTY_REPEAT) {\\n\\t return EMPTY_REPEAT;\\n\\t }\\n\\t if (!(this instanceof $Repeat)) {\\n\\t return new $Repeat(value, times);\\n\\t }\\n\\t this._value = value;\\n\\t this.size = times === undefined ? Infinity : Math.max(0, times);\\n\\t if (this.size === 0) {\\n\\t EMPTY_REPEAT = this;\\n\\t }\\n\\t};\\n\\tvar $Repeat = Repeat;\\n\\t($traceurRuntime.createClass)(Repeat, {\\n\\t toString: function() {\\n\\t if (this.size === 0) {\\n\\t return 'Repeat []';\\n\\t }\\n\\t return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\\n\\t },\\n\\t get: function(index, notSetValue) {\\n\\t return this.has(index) ? this._value : notSetValue;\\n\\t },\\n\\t contains: function(searchValue) {\\n\\t return is(this._value, searchValue);\\n\\t },\\n\\t slice: function(begin, end) {\\n\\t var size = this.size;\\n\\t return wholeSlice(begin, end, size) ? this : new $Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\\n\\t },\\n\\t reverse: function() {\\n\\t return this;\\n\\t },\\n\\t indexOf: function(searchValue) {\\n\\t if (is(this._value, searchValue)) {\\n\\t return 0;\\n\\t }\\n\\t return -1;\\n\\t },\\n\\t lastIndexOf: function(searchValue) {\\n\\t if (is(this._value, searchValue)) {\\n\\t return this.size;\\n\\t }\\n\\t return -1;\\n\\t },\\n\\t __iterate: function(fn, reverse) {\\n\\t for (var ii = 0; ii < this.size; ii++) {\\n\\t if (fn(this._value, ii, this) === false) {\\n\\t return ii + 1;\\n\\t }\\n\\t }\\n\\t return ii;\\n\\t },\\n\\t __iterator: function(type, reverse) {\\n\\t var $__0 = this;\\n\\t var ii = 0;\\n\\t return new Iterator((function() {\\n\\t return ii < $__0.size ? iteratorValue(type, ii++, $__0._value) : iteratorDone();\\n\\t }));\\n\\t },\\n\\t __deepEquals: function(other) {\\n\\t return other instanceof $Repeat ? is(this._value, other._value) : $traceurRuntime.superCall(this, $Repeat.prototype, \\\"__deepEquals\\\", [other]);\\n\\t }\\n\\t}, {}, IndexedSeq);\\n\\tvar RepeatPrototype = Repeat.prototype;\\n\\tRepeatPrototype.last = RepeatPrototype.first;\\n\\tRepeatPrototype.has = RangePrototype.has;\\n\\tRepeatPrototype.take = RangePrototype.take;\\n\\tRepeatPrototype.skip = RangePrototype.skip;\\n\\tRepeatPrototype.__toJS = RangePrototype.__toJS;\\n\\tvar EMPTY_REPEAT;\\n\\tvar Immutable = {\\n\\t Iterable: Iterable,\\n\\t Seq: Seq,\\n\\t Collection: Collection,\\n\\t Map: Map,\\n\\t List: List,\\n\\t Stack: Stack,\\n\\t Set: Set,\\n\\t OrderedMap: OrderedMap,\\n\\t Record: Record,\\n\\t Range: Range,\\n\\t Repeat: Repeat,\\n\\t is: is,\\n\\t fromJS: fromJS\\n\\t};\\n\\n\\t return Immutable;\\n\\t}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function r(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function FooBar() {\\n // TODO: implement this module\\n}\",\n \"function n(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function n(t){return!!t.constructor&&\\\"function\\\"==typeof t.constructor.isBuffer&&t.constructor.isBuffer(t)}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"function Module() {}\",\n \"patch() {\\n }\",\n \"function v8(v9,v10) {\\n const v16 = [1337,1337];\\n // v16 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v17 = [\\\"536870912\\\",-3848843708,v16,-3848843708,1337,13.37,13.37,WeakMap,-3848843708];\\n // v17 = .object(ofGroup: Array, withProperties: [\\\"length\\\", \\\"__proto__\\\", \\\"constructor\\\"], withMethods: [\\\"concat\\\", \\\"fill\\\", \\\"indexOf\\\", \\\"entries\\\", \\\"forEach\\\", \\\"find\\\", \\\"reverse\\\", \\\"slice\\\", \\\"flat\\\", \\\"reduce\\\", \\\"join\\\", \\\"findIndex\\\", \\\"reduceRight\\\", \\\"some\\\", \\\"copyWithin\\\", \\\"toString\\\", \\\"pop\\\", \\\"filter\\\", \\\"map\\\", \\\"splice\\\", \\\"keys\\\", \\\"unshift\\\", \\\"sort\\\", \\\"includes\\\", \\\"flatMap\\\", \\\"shift\\\", \\\"values\\\", \\\"every\\\", \\\"toLocaleString\\\", \\\"push\\\", \\\"lastIndexOf\\\"])\\n const v18 = {constructor:13.37,e:v16};\\n // v18 = .object(ofGroup: Object, withProperties: [\\\"constructor\\\", \\\"e\\\", \\\"__proto__\\\"])\\n const v19 = {__proto__:-3848843708,a:v18,b:-3848843708,constructor:1337,d:v18,e:v17,length:WeakMap};\\n // v19 = .object(ofGroup: Object, withProperties: [\\\"d\\\", \\\"b\\\", \\\"a\\\", \\\"__proto__\\\", \\\"e\\\", \\\"constructor\\\", \\\"length\\\"])\\n const v21 = new Float64Array(v19);\\n // v21 = .object(ofGroup: Float64Array, withProperties: [\\\"byteOffset\\\", \\\"constructor\\\", \\\"buffer\\\", \\\"__proto__\\\", \\\"byteLength\\\", \\\"length\\\"], withMethods: [\\\"map\\\", \\\"values\\\", \\\"subarray\\\", \\\"find\\\", \\\"fill\\\", \\\"set\\\", \\\"findIndex\\\", \\\"some\\\", \\\"reduceRight\\\", \\\"reverse\\\", \\\"join\\\", \\\"includes\\\", \\\"entries\\\", \\\"reduce\\\", \\\"every\\\", \\\"copyWithin\\\", \\\"sort\\\", \\\"forEach\\\", \\\"lastIndexOf\\\", \\\"indexOf\\\", \\\"filter\\\", \\\"slice\\\", \\\"keys\\\"])\\n v6[6] = v7;\\n v7.toString = v9;\\n }\",\n \"function Utils() {}\",\n \"function Utils() {}\",\n \"function o(e){return!!e.constructor&&\\\"function\\\"==typeof e.constructor.isBuffer&&e.constructor.isBuffer(e)}\",\n \"function c() {}\",\n \"constructor( ) {}\",\n \"function main() {\\n}\",\n \"use(fn) {}\",\n \"function FooRule() {\\n}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"initialize() {}\",\n \"function test() {\\n var o35 = Object.getOwnPropertyDescriptor(Object.prototype, \\\"__proto__\\\").function(o1, o2)\\n{\\n var o3 = 0;\\n var o4 = 0;\\n try {\\nfor (var o5 = 1; o5 < 10000; o5++)\\n {\\n try {\\no3 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0x3FFFF;\\n}catch(e){}\\n try {\\no2.o3 = o3 + o4;\\n}catch(e){}\\n try {\\no4 = (o1.o3 + o1.o3 + o1.o3 + o1.o3 + o1.o3) & 0xFFFF;\\n}catch(e){}\\n }\\n}catch(e){}\\n try {\\nreturn o3 + o4;\\n}catch(e){}\\n};\\n function o1() {\\n }\\n var o2 = ((o863 & 0x4000) >> Object.o157) | ((o863 & 0x40) >> 6);\\n var o38 = o839.o906.o917(o308);\\n var o6 = Array('Math.ceil((' + target + ')/');\\n var o867 = this.o543[0x200 | (o768 >> 4)];\\n var o8 = o1(\\\"willValidate\\\");\\n try {\\no21 = function () {\\n try {\\no337++;\\n}catch(e){}\\n };\\n}catch(e){}\\n try {\\ntry { o1(\\\"MSGestureEvent\\\"); } catch(e) {}try { try {\\no1(\\\"setImmediate\\\");\\n}catch(e){} } catch(e) {}\\n}catch(e){}\\n try {\\n({ o9: !o3.call(o2, o1, '!') });\\n}catch(e){}\\n try {\\nif (o0 != 2)\\n try {\\nprint(\\\"FAIL\\\");\\n}catch(e){}\\n else\\n try {\\nprint(\\\"PASS\\\");\\n}catch(e){}\\n}catch(e){}\\n}\",\n \"function Bevy() {}\",\n \"function hc(){return hc=Object.assign?Object.assign.bind():function(e){for(var t=1;t}\n * @private\n */\n this._data = []\n }","function Data() {\n this.mariopower = 1;\n this.traveled = this.traveledold = 0; // only used for random\n this.scorelevs = [100, 200, 400, 500, 800, 1000, 2000, 4000, 5000, 8000];\n this.score = new DataObject(0, 6, \"SCORE\");\n this.time = new DataObject(350, 3, \"TIME\");\n this.world = new DataObject(0, 0, \"WORLD\");\n this.coins = new DataObject(0, 0, \"COINS\");\n this.lives = new DataObject(3, 1, \"LIVES\");\n this.time.dir = -1;\n this.scoreold = 0;\n}","function DataManager() {}","function LC() {\n this.data = {};\n}","constructur() {}","constructor (data) {\n\t\tthis.rows = data;\n\t}","constructor(data) {\n\n //TODO - your code goes here -\n\n }","constructor(){\r\n\t\tthis.data = [];//initializing the array as blank...\r\n\t\tthis.data.push(new employee(123, \"Phaniraj\", \"Bangalore\"));\r\n\t\tthis.data.push(new employee(124, \"Mahesh\", \"Bangalore\"));\r\n\t\tthis.data.push(new employee(125, \"Gopal\", \"Mysore\"));\r\n\t\tthis.data.push(new employee(126, \"Venkatesh\", \"Chennai\"));\r\n\t}","function or(){this.__data__=new Ut}","constructor (){}","constructor (data) {\n super(data, InstanceModel)\n }","consructor() {\n }","initInstance() {\n this.instance = {};\n this.instance.epiHiperSchema = '';\n this.instance.diseaseModel = {};\n this.instance.sets = [];\n this.instance.variables = [];\n this.instance.initializations = [];\n this.instance.triggers = [];\n this.instance.interventions = [];\n this.instance.traits = [];\n this.instance.personTraitDBs = [];\n this.instance.network = {};\n this.instance.runParameters = {};\n }","constructor (data) {\n\n // the data array\n this.data = [];\n\n // should we parse the todos data?\n if (data && data.todos) data.todos.map(function (item) {\n return new Todo(item);\n }).forEach((item) => { this.data.push(item); });\n }","function DataObject() {\n\tthis.string = 'string';\n\tthis.number = 1234;\n\tthis.bool = false;\n\tthis.undef = undefined;\n\tthis.nul = null;\n\tthis.nan = NaN;\n\tthis.array = [1, 2, 3, 4];\n\tthis.func = function() {};\n\tthis.obj = {};\n}","GetData() {}","constructor(data = {}) {\r\n //super(data);\r\n for (const prop in data) {\r\n this[prop] = data[prop];\r\n }\r\n }","constructor(){\r\n\t\tthis.data=[]\r\n\t}","constructor () {\n this.#data = {} // Objeto vazio\n this.#tail = -1 // Pilha vazia\n }","function Data(dia, mes, ano) {\n this.dia = dia;\n this.mes = mes;\n this.ano = ano;\n // this.dia = dia;\n // this.mes = mes;\n // this.ano = ano;\n }","makeData (callback) {\n\t\tthis.init(callback);\n\t}","makeData (callback) {\n\t\tthis.init(callback);\n\t}","makeData (callback) {\n\t\tthis.init(callback);\n\t}","makeData (callback) {\n\t\tthis.init(callback);\n\t}","constructor(list, data) {\n this._list = list;\n this._data = data;\n }","constructor() {\n\n _data.set( this, new Map() );\n _validity.set( this, new Map() );\n\n // Immutable object.\n Object.freeze( this );\n }","constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0x8aeabec3;\n this.SUBCLASS_OF_ID = 0x7cd41eb4;\n\n this.data = args.data;\n this.dataHash = args.dataHash;\n this.secret = args.secret;\n }","constructor(data) {\n this.type = data.type;\n this.byDevice = data.byDevice;\n this.byMonth = data.byMonth;\n this.symbol = data.symbol;\n }","constructor(data = {}) {\n //super(data);\n for (const prop in data) {\n this[prop] = data[prop];\n }\n }","function _construct()\n\t\t{;\n\t\t}","constructor() {\n this.data = [];\n }","constructor(){\n this.data = [] //armazenamento\n }","constructor(x,y){\n this.a = x;\n this.b = y;\n this.#data = y;\n console.log(`Private data = ${this.#data}`);\n }","constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0x187fa0ca;\n this.SUBCLASS_OF_ID = 0x51138ae;\n\n this.type = args.type;\n this.data = args.data || null;\n this.frontSide = args.frontSide || null;\n this.reverseSide = args.reverseSide || null;\n this.selfie = args.selfie || null;\n this.translation = args.translation || null;\n this.files = args.files || null;\n this.plainData = args.plainData || null;\n this.hash = args.hash;\n }","function Data(dia, mes, ano) {\n if (ano === void 0) { ano = 1970; }\n this.dia = dia;\n this.mes = mes;\n this.ano = ano;\n // this.dia = dia;\n // this.mes = mes;\n // this.ano = ano;\n }","function chartData( dataNum = 0,inputTitle = \"\", attrbuteArray = [], datasetArray = []) {\n\tlet self = this;\n\tthis.title = inputTitle;\n\tthis.count = dataNum;\n\tthis.attributes = attrbuteArray;\n\tthis.datasets = datasetArray;\n\n}","constructor() {\n /**\n * Data holder for the stats class\n * @type {Object}\n */\n this.data = {};\n }","constructor(data) {\n this.data = data\n this.next = null\n }","constructor(data){\n // super para acceder el constructor del padre\n super(data.name, data.sellIn, data.quality)\n \n }","function Initialize1(data) {\n // Make sure all variables in this thread are initialized only once.\n self.littleEndian = data.littleEndian;\n self.compressed = data.compressed;\n self.memoryBudget = data.memoryBudget;\n self.attributesData = data.attributesData;\n self.sceneData = data.sceneData;\n self.version = data.version;\n }","constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0xdb21d0a7;\n this.SUBCLASS_OF_ID = 0xb49da1fc;\n\n this.type = args.type;\n this.data = args.data || null;\n this.frontSide = args.frontSide || null;\n this.reverseSide = args.reverseSide || null;\n this.selfie = args.selfie || null;\n this.translation = args.translation || null;\n this.files = args.files || null;\n this.plainData = args.plainData || null;\n }","constructor(data) {\n this.data = data;\n this.rebuild_population();\n this.list_of_infoBoxData = [];\n }","constructor (number = 1) {\n this.data = number;\n }","function VersionData() {\r\n this.allUnits = {};\r\n this.playerUnits = {};\r\n this.computerUnits = {};\r\n this.camps = {};\r\n this.generals = {};\r\n this.functions = {};\r\n}","initData(data) {\n if (!data || !data.sys) {\n return;\n }\n this.data = this.data || {};\n let dict = data.sys.dict;\n let protos = data.sys.protos;\n\n //Init compress dict\n if (dict) {\n this.data.dict = dict;\n this.data.abbrs = {};\n\n for (let route in dict) {\n this.data.abbrs[dict[route]] = route;\n }\n }\n\n //Init protobuf protos\n if (protos) {\n this.data.protos = {\n server: protos.server || {},\n client: protos.client || {}\n };\n if (!tools.isNull(this.protobuf)) {\n this.protobuf.init({\n encoderProtos: protos.client,\n decoderProtos: protos.server\n });\n }\n }\n }","constructor(options, ...args){\n super(options, ...args);\n this.data = options ? options.data : undefined;\n }","function Data(tag, fields) {\n this.type = DATA;\n this.tag = tag;\n this.fields = fields;\n}","constructor(data) {\n this._id = data._id\n this.imgUrl = data.imgUrl\n this.price = data.price\n this.year = data.year\n this.levels = data.levels\n this.bedrooms = data.bedrooms\n this.bathrooms = data.bathrooms\n this.description = data.description\n }","constructor(id, data = ''){\n\t\tthis.id = id;\n this.data = data;\t\t\n\t}","init (data = {}) {\n for(let _key in data){\n this[_key] = data[_key];\n }\n }","constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0x3417d728;\n this.SUBCLASS_OF_ID = 0x2899a53d;\n\n this.save = args.save || null;\n this.data = args.data;\n }","constructor(data) {\n // here the data is passed grouped as an object, rather than indivually in order\n const { name, price, stock = 0, description = \"\", tags = [] } = data;\n // log(arguments);\n\n \n\n this._id = MenuItem.uuidv4();\n this.name = name;\n this.price = price;\n this.stock = stock;\n this.description = description;\n this.tags = tags;\n }","constructor(data) {\n if (data !== undefined) {\n this._matrix = ExtMath.matrix(data);\n }\n }","constructor(data) {\n this.id = data.id\n this.nombre = data.nombre.toUpperCase();\n this.precio = parseFloat(data.precio);\n this.vendido = false;\n }","static create( data ) {\n\t\tlet obj = new ( this )();\n\t\tfor( var key in data ) {\n\t\t\tif( data.hasOwnProperty( key ) ) {\n\t\t\t\tobj[key] = data[key];\n\t\t\t}\n\t\t}\n\t\treturn obj.save();\n\t}","initDataRaw(X) {\n\t\t\tconst N = X.length;\n\t\t\tconst D = X[0].length;\n\t\t\tassert(N > 0, ' X is empty? You must have some data!');\n\t\t\tassert(D > 0, ' X[0] is empty? Where is the data?');\n\t\t\tconst pairwiseDistancesOfInput = pairwiseDistances(X); // convert X to distances using gaussian kernel\n\t\t\tthis.P = d2p(pairwiseDistancesOfInput, this.perplexity, 1e-4); // attach to object\n\t\t\tthis.N = N; // back up the size of the dataset\n\t\t\tthis.initSolution(); // refresh this\n\t\t}","initData(data) {\n this.status = data.status;\n this.id = data.id;\n }","constructor(args) {\n super();\n args = args || {}\n this.CONSTRUCTOR_ID = 0x33f0ea47;\n this.SUBCLASS_OF_ID = 0x94dc7633;\n\n this.data = args.data;\n this.hash = args.hash;\n this.secret = args.secret;\n }","constructor() {\n\t\t\t// Create a storage object for this class. This will serve as our 'memory' and corresponds to 'collection' in the first solution.\n\t\t\tthis.memState = {};\n\t\t}","constructor(data) {\n this.data = data || {},\n this.trainDataUrl = { //! object for holding/organizing random query string parts\n baseUrl: 'http://lapi.transitchicago.com/api/1.0/ttarrivals.aspx',\n apiKey: '3106a8d27f8b4f8fb99b7c8d895163dd',\n mapId: '',\n stpId: '',\n outputType: 'JSON',\n }\n }","function Dataobject(ServerData) {\n this.Head = ServerData.Head;\n this.Data = ServerData.Data;\n this.Config = ServerData.Config; //toNo-Arr indexes\n this.Grid = ServerData.Grid;\n\n //------------------------------------------------------------------------------------------------------------------\n //--------------------Object converters------------------------------------------------------------------------------\n //----------------------------------------------------------------------------------------------------------------\n}","function Vt(){this.__data__=[]}","constructor() {\n this._name = 'Hake';\n this._version = '0.0.0';\n this.data = data;\n this.dom = dom;\n this.observe = observe;\n this.parse = parse;\n this.event = event;\n this.item = item;\n }"],"string":"[\n \"function Data() { }\",\n \"constructor() {\\n super();\\n this.data = new Data();\\n }\",\n \"constructor(data) { }\",\n \"constructor(data) {\\n \\n }\",\n \"constructor() {\\n this.data = this._loadData();\\n }\",\n \"constructor(data) {\\n this.data = data;\\n }\",\n \"constructor(dataInput) {\\n this.data = dataInput;\\n this.length = Object.keys(dataInput).length;\\n this.names = this.dataNames(); \\n this.counts = this.dataCounts();\\n this.data360 = this.dataMap360();\\n this.percent100 = this.dataPercents();\\n console.log(this);\\n }\",\n \"init(){\\n var self = this;\\n self.generateData();\\n self.insertInfo();\\n self.copyData();\\n }\",\n \"constructor(data) {\\n this.data = data;\\n }\",\n \"constructor () {\\n this.data = {}\\n }\",\n \"constructor(data) {\\n const dataKeys = Object.keys(data);\\n for (let i = 0; i < dataKeys.length; i++) {\\n this[dataKeys[i]] = data[dataKeys[i]];\\n }\\n }\",\n \"constructor(data = {}) {\\n super(data);\\n \\n this.init(data);\\n }\",\n \"function Data() {\\n this.mariopower = 1;\\n this.scorelevs = [100, 200, 400, 500, 800, 1000, 2000, 4000, 5000, 8000];\\n this.score = new dataObject(0, 6, \\\"SCORE\\\");\\n this.time = new dataObject(350, 3, \\\"TIME\\\");\\n this.world = new dataObject(0, 0, \\\"WORLD\\\");\\n this.coins = new dataObject(0, 0, \\\"COINS\\\");\\n this.lives = new dataObject(3, 1, \\\"LIVES\\\");\\n}\",\n \"function Data()\\n{\\n //parameters\\n this.total = 0;\\n this.domestic = 0;\\n this.transborder = 0;\\n this.other = 0;\\n}\",\n \"constructor(data){ \\n this.data = data;\\n }\",\n \"constructor() {\\n this.data = {};\\n }\",\n \"constructor() {\\n this.data = {};\\n }\",\n \"function Data() {\\n this.columns = null;\\n this.items = null;\\n this.projection = null;\\n this.num_rows = 0;\\n this.num_cols = 0;\\n}\",\n \"constructor(_data, _target) {\\n // Define fields\\n this.data = _data;\\n this.target = _target;\\n\\n // Call init\\n this.init();\\n }\",\n \"constructor() {\\n super() // required after extends\\n this.data = []\\n }\",\n \"constructor(data) {\\n super(data);\\n }\",\n \"constructor(_data = {}) {\\n this._data = _data;\\n }\",\n \"init(data) {\\r\\n this.object = data.object;\\r\\n }\",\n \"constructor(data = {}) {\\n Object.assign(this, data)\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x8317c0c3;\\n this.SUBCLASS_OF_ID = 0x9f89304e;\\n\\n this.data = args.data;\\n }\",\n \"init (data = {}) {\\n for(let key in data){\\n this[key] = data[key];\\n }\\n }\",\n \"init (data = {}) {\\n for(let key in data){\\n this[key] = data[key];\\n }\\n }\",\n \"static $new(data) {\\n\\t\\tvar className = this;\\n\\t\\tvar instance = new className();\\n\\t\\tvar defaultProps = className.$properties();\\n\\t\\t// bind data\\n\\t\\tif(_.isPlainObject(defaultProps)){\\n\\t\\t\\tvar propNames = Object.getOwnPropertyNames(defaultProps);\\n\\t\\t\\tfor(let propName of propNames) {\\n\\t\\t\\t\\tvar propVal\\n\\t\\t\\t\\tif(_.isPlainObject(data) && data[propName] !== undefined){\\n\\t\\t\\t\\t\\tpropVal = data[propName];\\n\\t\\t\\t\\t} else if(typeof defaultProps[propName] === 'function'){\\n\\t\\t\\t\\t\\tpropVal = defaultProps[propName].apply(instance, [data]);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tpropVal = defaultProps[propName];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tinstance[propName] = propVal;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// Object.seal(instance)\\n\\t\\treturn instance;\\n\\t}\",\n \"function _newDataClass(oBoss)\\r\\n{\\r\\n\\tthis.n = 0;\\r\\n\\tthis.o = 0;\\r\\n\\tthis.h = 0;\\r\\n\\tthis.c = 0;\\r\\n\\tthis.l = 0;\\r\\n\\tthis.html = \\\"xxx\\\";\\r\\n\\tthis.ui\\t\\t= null;\\r\\n}\",\n \"constructor() {\\r\\n this.datas = new Array(16);\\r\\n this.identity();\\r\\n }\",\n \"function Data() {\\n\\n this.expando = cepto.expando + Data.uid++;\\n\\n Object.defineProperty(this.cache = {}, 0, {\\n get: function() {\\n return {};\\n }\\n });\\n\\n}\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x4218a164;\\n this.SUBCLASS_OF_ID = 0xf1163490;\\n\\n this.data = args.data;\\n }\",\n \"static instantiate (data) {\\n return new InstancesCollection(data)\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x7d748d04;\\n this.SUBCLASS_OF_ID = 0xad0352e8;\\n\\n this.data = args.data;\\n }\",\n \"initialize(data) {\\n this.$exists = false;\\n this.$changed = {};\\n this.$attributes = {};\\n this.fill(data);\\n this.$initialized = true;\\n\\n return this;\\n }\",\n \"function Data() { // 4029\\n\\tthis.expando = jQuery.expando + Data.uid++; // 4030\\n} // 4031\",\n \"SetData() {}\",\n \"constructor( data ){\\n this._emitter = new EventTarget();\\n this._converters = new Map();\\n this._dynamicProperties = false;\\n this._data = data;\\n }\",\n \"constructor() {\\n\\n /**\\n * @type {Array.<{type: string, label: string, url: string}>}\\n * @private\\n */\\n this._data = []\\n }\",\n \"function Data() {\\n this.mariopower = 1;\\n this.traveled = this.traveledold = 0; // only used for random\\n this.scorelevs = [100, 200, 400, 500, 800, 1000, 2000, 4000, 5000, 8000];\\n this.score = new DataObject(0, 6, \\\"SCORE\\\");\\n this.time = new DataObject(350, 3, \\\"TIME\\\");\\n this.world = new DataObject(0, 0, \\\"WORLD\\\");\\n this.coins = new DataObject(0, 0, \\\"COINS\\\");\\n this.lives = new DataObject(3, 1, \\\"LIVES\\\");\\n this.time.dir = -1;\\n this.scoreold = 0;\\n}\",\n \"function DataManager() {}\",\n \"function LC() {\\n this.data = {};\\n}\",\n \"constructur() {}\",\n \"constructor (data) {\\n\\t\\tthis.rows = data;\\n\\t}\",\n \"constructor(data) {\\n\\n //TODO - your code goes here -\\n\\n }\",\n \"constructor(){\\r\\n\\t\\tthis.data = [];//initializing the array as blank...\\r\\n\\t\\tthis.data.push(new employee(123, \\\"Phaniraj\\\", \\\"Bangalore\\\"));\\r\\n\\t\\tthis.data.push(new employee(124, \\\"Mahesh\\\", \\\"Bangalore\\\"));\\r\\n\\t\\tthis.data.push(new employee(125, \\\"Gopal\\\", \\\"Mysore\\\"));\\r\\n\\t\\tthis.data.push(new employee(126, \\\"Venkatesh\\\", \\\"Chennai\\\"));\\r\\n\\t}\",\n \"function or(){this.__data__=new Ut}\",\n \"constructor (){}\",\n \"constructor (data) {\\n super(data, InstanceModel)\\n }\",\n \"consructor() {\\n }\",\n \"initInstance() {\\n this.instance = {};\\n this.instance.epiHiperSchema = '';\\n this.instance.diseaseModel = {};\\n this.instance.sets = [];\\n this.instance.variables = [];\\n this.instance.initializations = [];\\n this.instance.triggers = [];\\n this.instance.interventions = [];\\n this.instance.traits = [];\\n this.instance.personTraitDBs = [];\\n this.instance.network = {};\\n this.instance.runParameters = {};\\n }\",\n \"constructor (data) {\\n\\n // the data array\\n this.data = [];\\n\\n // should we parse the todos data?\\n if (data && data.todos) data.todos.map(function (item) {\\n return new Todo(item);\\n }).forEach((item) => { this.data.push(item); });\\n }\",\n \"function DataObject() {\\n\\tthis.string = 'string';\\n\\tthis.number = 1234;\\n\\tthis.bool = false;\\n\\tthis.undef = undefined;\\n\\tthis.nul = null;\\n\\tthis.nan = NaN;\\n\\tthis.array = [1, 2, 3, 4];\\n\\tthis.func = function() {};\\n\\tthis.obj = {};\\n}\",\n \"GetData() {}\",\n \"constructor(data = {}) {\\r\\n //super(data);\\r\\n for (const prop in data) {\\r\\n this[prop] = data[prop];\\r\\n }\\r\\n }\",\n \"constructor(){\\r\\n\\t\\tthis.data=[]\\r\\n\\t}\",\n \"constructor () {\\n this.#data = {} // Objeto vazio\\n this.#tail = -1 // Pilha vazia\\n }\",\n \"function Data(dia, mes, ano) {\\n this.dia = dia;\\n this.mes = mes;\\n this.ano = ano;\\n // this.dia = dia;\\n // this.mes = mes;\\n // this.ano = ano;\\n }\",\n \"makeData (callback) {\\n\\t\\tthis.init(callback);\\n\\t}\",\n \"makeData (callback) {\\n\\t\\tthis.init(callback);\\n\\t}\",\n \"makeData (callback) {\\n\\t\\tthis.init(callback);\\n\\t}\",\n \"makeData (callback) {\\n\\t\\tthis.init(callback);\\n\\t}\",\n \"constructor(list, data) {\\n this._list = list;\\n this._data = data;\\n }\",\n \"constructor() {\\n\\n _data.set( this, new Map() );\\n _validity.set( this, new Map() );\\n\\n // Immutable object.\\n Object.freeze( this );\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x8aeabec3;\\n this.SUBCLASS_OF_ID = 0x7cd41eb4;\\n\\n this.data = args.data;\\n this.dataHash = args.dataHash;\\n this.secret = args.secret;\\n }\",\n \"constructor(data) {\\n this.type = data.type;\\n this.byDevice = data.byDevice;\\n this.byMonth = data.byMonth;\\n this.symbol = data.symbol;\\n }\",\n \"constructor(data = {}) {\\n //super(data);\\n for (const prop in data) {\\n this[prop] = data[prop];\\n }\\n }\",\n \"function _construct()\\n\\t\\t{;\\n\\t\\t}\",\n \"constructor() {\\n this.data = [];\\n }\",\n \"constructor(){\\n this.data = [] //armazenamento\\n }\",\n \"constructor(x,y){\\n this.a = x;\\n this.b = y;\\n this.#data = y;\\n console.log(`Private data = ${this.#data}`);\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x187fa0ca;\\n this.SUBCLASS_OF_ID = 0x51138ae;\\n\\n this.type = args.type;\\n this.data = args.data || null;\\n this.frontSide = args.frontSide || null;\\n this.reverseSide = args.reverseSide || null;\\n this.selfie = args.selfie || null;\\n this.translation = args.translation || null;\\n this.files = args.files || null;\\n this.plainData = args.plainData || null;\\n this.hash = args.hash;\\n }\",\n \"function Data(dia, mes, ano) {\\n if (ano === void 0) { ano = 1970; }\\n this.dia = dia;\\n this.mes = mes;\\n this.ano = ano;\\n // this.dia = dia;\\n // this.mes = mes;\\n // this.ano = ano;\\n }\",\n \"function chartData( dataNum = 0,inputTitle = \\\"\\\", attrbuteArray = [], datasetArray = []) {\\n\\tlet self = this;\\n\\tthis.title = inputTitle;\\n\\tthis.count = dataNum;\\n\\tthis.attributes = attrbuteArray;\\n\\tthis.datasets = datasetArray;\\n\\n}\",\n \"constructor() {\\n /**\\n * Data holder for the stats class\\n * @type {Object}\\n */\\n this.data = {};\\n }\",\n \"constructor(data) {\\n this.data = data\\n this.next = null\\n }\",\n \"constructor(data){\\n // super para acceder el constructor del padre\\n super(data.name, data.sellIn, data.quality)\\n \\n }\",\n \"function Initialize1(data) {\\n // Make sure all variables in this thread are initialized only once.\\n self.littleEndian = data.littleEndian;\\n self.compressed = data.compressed;\\n self.memoryBudget = data.memoryBudget;\\n self.attributesData = data.attributesData;\\n self.sceneData = data.sceneData;\\n self.version = data.version;\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0xdb21d0a7;\\n this.SUBCLASS_OF_ID = 0xb49da1fc;\\n\\n this.type = args.type;\\n this.data = args.data || null;\\n this.frontSide = args.frontSide || null;\\n this.reverseSide = args.reverseSide || null;\\n this.selfie = args.selfie || null;\\n this.translation = args.translation || null;\\n this.files = args.files || null;\\n this.plainData = args.plainData || null;\\n }\",\n \"constructor(data) {\\n this.data = data;\\n this.rebuild_population();\\n this.list_of_infoBoxData = [];\\n }\",\n \"constructor (number = 1) {\\n this.data = number;\\n }\",\n \"function VersionData() {\\r\\n this.allUnits = {};\\r\\n this.playerUnits = {};\\r\\n this.computerUnits = {};\\r\\n this.camps = {};\\r\\n this.generals = {};\\r\\n this.functions = {};\\r\\n}\",\n \"initData(data) {\\n if (!data || !data.sys) {\\n return;\\n }\\n this.data = this.data || {};\\n let dict = data.sys.dict;\\n let protos = data.sys.protos;\\n\\n //Init compress dict\\n if (dict) {\\n this.data.dict = dict;\\n this.data.abbrs = {};\\n\\n for (let route in dict) {\\n this.data.abbrs[dict[route]] = route;\\n }\\n }\\n\\n //Init protobuf protos\\n if (protos) {\\n this.data.protos = {\\n server: protos.server || {},\\n client: protos.client || {}\\n };\\n if (!tools.isNull(this.protobuf)) {\\n this.protobuf.init({\\n encoderProtos: protos.client,\\n decoderProtos: protos.server\\n });\\n }\\n }\\n }\",\n \"constructor(options, ...args){\\n super(options, ...args);\\n this.data = options ? options.data : undefined;\\n }\",\n \"function Data(tag, fields) {\\n this.type = DATA;\\n this.tag = tag;\\n this.fields = fields;\\n}\",\n \"constructor(data) {\\n this._id = data._id\\n this.imgUrl = data.imgUrl\\n this.price = data.price\\n this.year = data.year\\n this.levels = data.levels\\n this.bedrooms = data.bedrooms\\n this.bathrooms = data.bathrooms\\n this.description = data.description\\n }\",\n \"constructor(id, data = ''){\\n\\t\\tthis.id = id;\\n this.data = data;\\t\\t\\n\\t}\",\n \"init (data = {}) {\\n for(let _key in data){\\n this[_key] = data[_key];\\n }\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x3417d728;\\n this.SUBCLASS_OF_ID = 0x2899a53d;\\n\\n this.save = args.save || null;\\n this.data = args.data;\\n }\",\n \"constructor(data) {\\n // here the data is passed grouped as an object, rather than indivually in order\\n const { name, price, stock = 0, description = \\\"\\\", tags = [] } = data;\\n // log(arguments);\\n\\n \\n\\n this._id = MenuItem.uuidv4();\\n this.name = name;\\n this.price = price;\\n this.stock = stock;\\n this.description = description;\\n this.tags = tags;\\n }\",\n \"constructor(data) {\\n if (data !== undefined) {\\n this._matrix = ExtMath.matrix(data);\\n }\\n }\",\n \"constructor(data) {\\n this.id = data.id\\n this.nombre = data.nombre.toUpperCase();\\n this.precio = parseFloat(data.precio);\\n this.vendido = false;\\n }\",\n \"static create( data ) {\\n\\t\\tlet obj = new ( this )();\\n\\t\\tfor( var key in data ) {\\n\\t\\t\\tif( data.hasOwnProperty( key ) ) {\\n\\t\\t\\t\\tobj[key] = data[key];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn obj.save();\\n\\t}\",\n \"initDataRaw(X) {\\n\\t\\t\\tconst N = X.length;\\n\\t\\t\\tconst D = X[0].length;\\n\\t\\t\\tassert(N > 0, ' X is empty? You must have some data!');\\n\\t\\t\\tassert(D > 0, ' X[0] is empty? Where is the data?');\\n\\t\\t\\tconst pairwiseDistancesOfInput = pairwiseDistances(X); // convert X to distances using gaussian kernel\\n\\t\\t\\tthis.P = d2p(pairwiseDistancesOfInput, this.perplexity, 1e-4); // attach to object\\n\\t\\t\\tthis.N = N; // back up the size of the dataset\\n\\t\\t\\tthis.initSolution(); // refresh this\\n\\t\\t}\",\n \"initData(data) {\\n this.status = data.status;\\n this.id = data.id;\\n }\",\n \"constructor(args) {\\n super();\\n args = args || {}\\n this.CONSTRUCTOR_ID = 0x33f0ea47;\\n this.SUBCLASS_OF_ID = 0x94dc7633;\\n\\n this.data = args.data;\\n this.hash = args.hash;\\n this.secret = args.secret;\\n }\",\n \"constructor() {\\n\\t\\t\\t// Create a storage object for this class. This will serve as our 'memory' and corresponds to 'collection' in the first solution.\\n\\t\\t\\tthis.memState = {};\\n\\t\\t}\",\n \"constructor(data) {\\n this.data = data || {},\\n this.trainDataUrl = { //! object for holding/organizing random query string parts\\n baseUrl: 'http://lapi.transitchicago.com/api/1.0/ttarrivals.aspx',\\n apiKey: '3106a8d27f8b4f8fb99b7c8d895163dd',\\n mapId: '',\\n stpId: '',\\n outputType: 'JSON',\\n }\\n }\",\n \"function Dataobject(ServerData) {\\n this.Head = ServerData.Head;\\n this.Data = ServerData.Data;\\n this.Config = ServerData.Config; //toNo-Arr indexes\\n this.Grid = ServerData.Grid;\\n\\n //------------------------------------------------------------------------------------------------------------------\\n //--------------------Object converters------------------------------------------------------------------------------\\n //----------------------------------------------------------------------------------------------------------------\\n}\",\n \"function Vt(){this.__data__=[]}\",\n \"constructor() {\\n this._name = 'Hake';\\n this._version = '0.0.0';\\n this.data = data;\\n this.dom = dom;\\n this.observe = observe;\\n this.parse = parse;\\n this.event = event;\\n this.item = item;\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.7691085","0.753114","0.7498393","0.73728585","0.7296609","0.7263449","0.7160494","0.7158822","0.71553206","0.70138717","0.7013545","0.69452906","0.69428927","0.68995243","0.688462","0.6873593","0.6873593","0.68278205","0.68025386","0.6752245","0.6751113","0.6749138","0.6747565","0.6708915","0.6701723","0.6701398","0.6701398","0.6701198","0.66992193","0.6695931","0.6694994","0.665871","0.665305","0.6645085","0.6636177","0.662002","0.66162205","0.66047615","0.6588096","0.65844715","0.65800315","0.65785426","0.65623945","0.6557694","0.65548027","0.65403384","0.6540047","0.65148455","0.65027773","0.648983","0.64896375","0.6474517","0.64735234","0.6450476","0.6445122","0.6435978","0.6412877","0.640967","0.6408561","0.6408561","0.6408561","0.6408561","0.6404268","0.6401824","0.64010805","0.63995844","0.639475","0.63932014","0.6391255","0.63906235","0.6387246","0.6382113","0.63799","0.6368787","0.6363083","0.63625604","0.635934","0.6350419","0.6345456","0.63435525","0.6331289","0.6328642","0.63193786","0.6311776","0.63048357","0.63010216","0.62916076","0.6284753","0.6279267","0.6234816","0.6212262","0.61933273","0.6191214","0.61886126","0.6186381","0.6182196","0.61700124","0.6151601","0.6147353","0.6146106","0.6141949"],"string":"[\n \"0.7691085\",\n \"0.753114\",\n \"0.7498393\",\n \"0.73728585\",\n \"0.7296609\",\n \"0.7263449\",\n \"0.7160494\",\n \"0.7158822\",\n \"0.71553206\",\n \"0.70138717\",\n \"0.7013545\",\n \"0.69452906\",\n \"0.69428927\",\n \"0.68995243\",\n \"0.688462\",\n \"0.6873593\",\n \"0.6873593\",\n \"0.68278205\",\n \"0.68025386\",\n \"0.6752245\",\n \"0.6751113\",\n \"0.6749138\",\n \"0.6747565\",\n \"0.6708915\",\n \"0.6701723\",\n \"0.6701398\",\n \"0.6701398\",\n \"0.6701198\",\n \"0.66992193\",\n \"0.6695931\",\n \"0.6694994\",\n \"0.665871\",\n \"0.665305\",\n \"0.6645085\",\n \"0.6636177\",\n \"0.662002\",\n \"0.66162205\",\n \"0.66047615\",\n \"0.6588096\",\n \"0.65844715\",\n \"0.65800315\",\n \"0.65785426\",\n \"0.65623945\",\n \"0.6557694\",\n \"0.65548027\",\n \"0.65403384\",\n \"0.6540047\",\n \"0.65148455\",\n \"0.65027773\",\n \"0.648983\",\n \"0.64896375\",\n \"0.6474517\",\n \"0.64735234\",\n \"0.6450476\",\n \"0.6445122\",\n \"0.6435978\",\n \"0.6412877\",\n \"0.640967\",\n \"0.6408561\",\n \"0.6408561\",\n \"0.6408561\",\n \"0.6408561\",\n \"0.6404268\",\n \"0.6401824\",\n \"0.64010805\",\n \"0.63995844\",\n \"0.639475\",\n \"0.63932014\",\n \"0.6391255\",\n \"0.63906235\",\n \"0.6387246\",\n \"0.6382113\",\n \"0.63799\",\n \"0.6368787\",\n \"0.6363083\",\n \"0.63625604\",\n \"0.635934\",\n \"0.6350419\",\n \"0.6345456\",\n \"0.63435525\",\n \"0.6331289\",\n \"0.6328642\",\n \"0.63193786\",\n \"0.6311776\",\n \"0.63048357\",\n \"0.63010216\",\n \"0.62916076\",\n \"0.6284753\",\n \"0.6279267\",\n \"0.6234816\",\n \"0.6212262\",\n \"0.61933273\",\n \"0.6191214\",\n \"0.61886126\",\n \"0.6186381\",\n \"0.6182196\",\n \"0.61700124\",\n \"0.6151601\",\n \"0.6147353\",\n \"0.6146106\",\n \"0.6141949\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81764,"cells":{"query":{"kind":"string","value":"++++++++++++++++++++++++++++++++++++++++++++ FUNCTION DECLARATIONS ++++++++++++++++++++++++++++++++++++++++++++ Function to randomly generate randomIndex1, randomIndex2, and randomIndex3"},"document":{"kind":"string","value":"function checkForData() {\n if (localStorage.userResults) {\n catalogArray = JSON.parse(localStorage.userResults);\n for (var i = 0; i < catalogArray.length; i++) {\n imageNameArray.push(catalogArray[i].imageName);\n }\n }\n\n else {\n catalogArray = [];\n createCatalogItems();\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function createThreeRandomIndexes(){\n\n let randomIndexes = [];\n while (randomIndexes.length !== 3){\n let rand = generateRandomNumber();\n if(!randomIndexes.includes(rand)){\n randomIndexes.push(rand);\n\n }\n }\n return randomIndexes;\n}","function randomIndex() {\n let n = floor(random(0, 4));\n return n;\n}","function randomIndex(n) {\n return Math.floor(Math.random() * parseInt(n));\n }","function renderThreeRandomImages(){\n let tempIndexes = createThreeRandomIndexes();\n if(randomIndexs.length === 0){\n randomIndexs = tempIndexes;\n }else{\n while(compareTwoArrays(randomIndexs,tempIndexes)){\n tempIndexes = createThreeRandomIndexes();\n }\n randomIndexs = tempIndexes;\n }\n\n\n console.log(randomIndexs);\n leftIndex = randomIndexs[0];\n rightIndex = randomIndexs[1];\n middleIndex = randomIndexs[2];\n\n\n leftImageEl.setAttribute('src',products[leftIndex].imagePath);\n rightImageEl.setAttribute('src',products[rightIndex].imagePath);\n middleImageEL.setAttribute('src',products[middleIndex].imagePath);\n products[leftIndex].viewedNum++;\n products[rightIndex].viewedNum++;\n products[middleIndex].viewedNum++;\n}","function getRandomIndex () {\n let min = 0, max = 9;\n //generate random number as index between min and max\n //floor to get an integer\n randomIndex = Math.floor(Math.random() * (max - min + 1)) + min;\n}","function generateRandomIndex() {\n return Math.floor(Math.random() * 10);\n}","function randomindex() {\n return Math.floor(Math.random() * Busmall.allimg.length);\n}","function randomindexPath() {\n\n do {\n var right = randomNum();\n var middle = randomNum();\n var left = randomNum();\n var equality = right == left || right == middle || left == middle;\n } while (equality || availableItem([left, middle, right]))\n\n uniqueItem = [];\n\n uniqueItem.push(\n itemsArray[left],\n itemsArray[middle],\n itemsArray[right]\n )\n render(left, middle, right);\n}","function getRandomIndex() {\n // 0=>20\n return Math.floor(Math.random() * products.length);\n}","function randIndex (N) { // improve, se w3c example\n var a = [];\n Array.from (Array(N), (e, i) => {\n a [i] = {index: i, value: Math.random()};\n });\n a = a.sort ((a,b)=>{return a.value - b.value});\n Array.from (Array (N), (e, i) => {a [i] = a [i].index})\n return a;\n}","function getRandomIndex() {\n // 0=>18\n return Math.floor(Math.random() * (products.length));\n}","function getRandomIndex(indexSize) {\n return Math.floor(Math.random() * indexSize);\n}","function generateRandomIndex(imgIndexSelected) {\n var randIndex = Math.floor(Math.random() * products.length);\n while (previouslyDisplayedIndexs.includes(randIndex) || imgIndexSelected.includes(randIndex) ) {\n randIndex = Math.floor(Math.random() * products.length);\n }\n\n return randIndex;\n\n}","function possibleIndex(n) {\n return Math.floor(Math.random() * n);\n }","function generateRandomIndex() {\n return Math.floor(Math.random() * productsArray.length);\n}","function getRandomIndex() {\n return Math.floor(Math.random() * allProducts.length);\n}","function getRandomIndex() {\n return Math.floor(Math.random() * Product.all.length);\n}","function generateRandomIndex() {\n\n return Math.floor(Math.random() * Product.allProducts.length);\n}","function randomIndex(length) {\n return Math.floor(Math.random() * (length));\n}","function pickrandom(){\r\n //chose horizontal or vertical\r\n var axis = Math.floor(Math.random()*10);\r\n //random horizontal postion\r\n if (axis <=4){\r\n //chose 0 or 9\r\n var row = Math.floor(Math.random()*10);\r\n //0\r\n if (row <=4){\r\n row = 0;\r\n var col = Math.floor(Math.random()*(n-1));\r\n var ind = index(col,row);\r\n return linearVertex[ind];\r\n }\r\n //9\r\n else {\r\n row = n-1;\r\n var col = Math.floor(Math.random()*(n-1));\r\n var ind = index(col,row);\r\n return linearVertex[ind];\r\n }\r\n }\r\n //random vertical postion.\r\n else {\r\n //chose 0 or 9\r\n var col = Math.floor(Math.random()*10);\r\n //0\r\n if (col <=4){\r\n col = 0;\r\n var row = Math.floor(Math.random()*(n-1));\r\n var ind = index(col,row);\r\n return linearVertex[ind];\r\n }\r\n //9\r\n else {\r\n col = n-1;\r\n var row = Math.floor(Math.random()*(n-1));\r\n var ind = index(col,row);\r\n return linearVertex[ind];\r\n }\r\n }\r\n}","function rng(){\n return Math.floor(Math.random() * 3);\n}","function genrateRandomIndex(){\n return Math.floor(Math.random() * Goat.allImages.length); \n // 0.99999999999 * 8 => 7.999999994 floor() => 7\n // 0.99999999999 * 5 => 4.999999 floor => 4\n}","function randomIndex(list){\n return Math.floor(Math.random()*list.length);\n}","static randomPosition(count) {\n\t\treturn [random(-width, width), random(-height, height), random(width)].slice(0, count === undefined ? 3 : count);\n\t}","function getRandomIndex(){\n\n var index = getRandomNumber(allBusMall.length);\n\n while (uniqueIndexArray.includes(index)){\n index = getRandomNumber(allBusMall.length);\n }\n uniqueIndexArray.push(index);\n if(uniqueIndexArray.length > 6){\n uniqueIndexArray.shift();\n }\n return index;\n}","function getRandomIndices(num_residents) {\n\tvar possibleIndices = [];\n\tfor (var i = 0; i < num_residents; i++) {\n\t\tpossibleIndices.push(i);\n\t}\n\tvar rand1 = possibleIndices[Math.floor(Math.random() * possibleIndices.length)];\n\tpossibleIndices.splice(rand1, 1);\n\tvar rand2 = possibleIndices[Math.floor(Math.random() * possibleIndices.length)];\n\n\treturn { index1: rand1, index2: rand2 };\n}","function random() {\n return (Math.floor(Math.random() * 3));\n }","function randomIndex(data) {\n return Math.floor(Math.random() * data.length);\n }","function getRandomIndex(maxIndex) {\n return Math.floor(Math.random() * maxIndex);\n}","function generateRandomIndex() {\n return Math.floor(Math.random() * busMall.length);\n}","function randomsuggestion(){\n $('#match').css({ 'order': Math.floor((Math.random() * 3) + 1)});\n $('.suggData1').css({ 'order': Math.floor((Math.random() * 3) + 1)});\n $('.suggData2').css({ 'order': Math.floor((Math.random() * 3) + 1)});\n } // end function to generate random index","generateRandomIndex(){\n var index = {index:{}, string: \"\"};\n for(var field in this.fields){\n var i = (Math.floor(Math.random() * this.fields[field].length) );\n index.index[field] = i;\n index.string += i.toString() + \".\";\n }\n return index;\n }","function randomIndex(){\n let last_index = audio_utility.index_curr_track;\n let current_index = getRandomIntInclusive(0, audio_utility.track_list_length-1);\n while(last_index == current_index){\n current_index = getRandomIntInclusive(0, audio_utility.track_list_length-1);\n }\n audio_utility.index_curr_track = current_index;\n}","function createRandom(flo,index){\n let\n}","function randomIndex (max){\n return Math.floor(Math.random() * max);\n}","function random() {\n random1 = Math.floor((Math.random() * startupX.length));\n random2 = Math.floor((Math.random() * startupY.length));\n\n}","function generateRandomPuzzle(){\n//Random number of rows and cols and picture\n\n\tvar num = Math.ceil(Math.random()*6); // set the random magical number to access the array of images through\n\t_image_path = String(images[num].path); // get the image path using the index generated\n\t_image_width = images[num].swidth; //get the picture width\n\t_image_height = images[num].sheight; //get the picture height\n\t\n\tvar puzzleSize = Math.ceil(Math.random()*9); //get the random puzzle size\n\t_num_rows = puzzleSize; //set the number of rows\n\t_num_cols = puzzleSize; // set the number of columns\n\t\n\t\n\t\n\t\n\t\n\t\n}","function randomButtons() {\n randomBtn1 = Math.floor(Math.random() * 19 + 1);\n randomBtn2 = Math.floor(Math.random() * 19 + 1);\n randomBtn3 = Math.floor(Math.random() * 19 + 1);\n randomBtn4 = Math.floor(Math.random() * 19 + 1);\n randomBtn5 = Math.floor(Math.random() * 19 + 1);\n }","function setRandomIndices(n){\n\t\tvar temp = [],\n\t\tmax = array.length-1;\n\t\t\t\n\t\twhile(max >= 0) temp.push(max--)\n\t\t\n\t\t//From http://stackoverflow.com/questions/962802/is-it-correct-to-use-javascript-array-sort-method-for-shuffling#answer-962890\n\t\tvar shuffled = (function shuffle(array) {\n\t\t var tmp, current, top = array.length;\n\n\t\t if(top) while(--top) {\n\t\t current = Math.floor(Math.random() * (top + 1))\n\t\t tmp = array[current]\n\t\t array[current] = array[top]\n\t\t array[top] = tmp\n\t\t }\n\n\t\t return array;\n\t\t})(temp)\n\n\t\treturn shuffled.slice(0, n)\n\t}","function randInt() {\n return Math.floor(Math.random()*3);\n}","function setRandom(){\n\tvar lstShuffle = new Array();\n\tvar\tlst = [0,1,2,3,4,5,6,7,8,9,10,11];\n\twhile(lst.length>0){\n\t\tvar tempIndex = randomXToY(0, lst.length);\n\t\tif(typeof lst[tempIndex] != \"undefined\"){\n\t\t\tlstShuffle.push(lst[tempIndex]);\n\t\t\tlst.splice(tempIndex,1);\t\n\t\t}\n\t}\t\n\t\n\t//mergin\n\tvar obj;\n\tfor(var i = 0; i < lstShuffle.length;i++){\n\t\tobj = new Object();\n\t\tobj.index = lstShuffle[i];\n\t\tobj.num = irandom[i].num;\n\t\tobj.xAngle = irandom[i].xAngle;\n\t\tobj.yAngle = irandom[i].yAngle;\n\t\tirandom[i] = obj;\n\t}\n\n}","function multiRand () {\n return Math.floor(Math.random() * 11);\n}","function shuffle()\n{\n var tem = getRandom(shuffleIndexCount);\n var tem2 = shuffleIndex[tem];\n shuffleIndex[tem] = shuffleIndex[shuffleIndexCount];\n\n shuffleIndexCount--;\n if(shuffleIndexCount < 0)\n {\n shuffleIndexCount = songsList.length;\n }\n return tem2;\n}","function getRandomIndex(array){\n return Math.floor(Math.random() * array.length);\n}","function renderThreeRandomImages(){\n do{\n firstImageIndex = generateRandomIndex();\n secondImageIndex = generateRandomIndex();\n thirdImageIndex = generateRandomIndex();\n } while(firstImageIndex === previousRow[0] || firstImageIndex === previousRow[1] || firstImageIndex === previousRow[2] || secondImageIndex === previousRow[0] || secondImageIndex === previousRow[1] || secondImageIndex === previousRow[2] || thirdImageIndex === previousRow[0] || thirdImageIndex === previousRow[1] || thirdImageIndex === previousRow[2] || firstImageIndex === secondImageIndex || firstImageIndex === thirdImageIndex || secondImageIndex === thirdImageIndex );\n\n previousRow = [];\n previousRow.push(firstImageIndex);\n previousRow.push(secondImageIndex);\n previousRow.push(thirdImageIndex);\n\n firstImageProduct.src = Product.prototype.allProduct[firstImageIndex].pathImage;\n secondImageProduct.src = Product.prototype.allProduct[secondImageIndex].pathImage;\n thirdImageProduct.src = Product.prototype.allProduct[thirdImageIndex].pathImage;\n\n console.log(previousRow);\n}","function getNextRandomIndex(indexArr) {\n if (indexArr.length <= 0) return -1;\n let j = getRandomInt(0, indexArr.length-1);\n\n //swap\n let ret = indexArr[j];\n indexArr[j] = indexArr[indexArr.length-1];\n indexArr.pop();\n\n return ret;\n}","function randomNumber(index) {\n if (selectedFeatures[(index - 1)] == \"specChars\") {\n random = specChars.charAt(Math.floor(Math.random() * specChars.length));\n } else if (selectedFeatures[(index - 1)] == \"numerals\") {\n random = numerals.charAt(Math.floor(Math.random() * numerals.length));\n } else if (selectedFeatures[(index - 1)] == \"alphabetLower\") {\n random = alphabetLower.charAt(Math.floor(Math.random() * alphabetLower.length));\n } else if (selectedFeatures[(index - 1)] == \"alphabetUpper\") {\n random = alphabetUpper.charAt(Math.floor(Math.random() * alphabetUpper.length));\n }\n return random;\n }","function getRandomIndex (arr) {\n return Math.round(Math.random() * (arr.length - 1));\n}","function aRandomArray() {\n randomIndex = [];\n for (let i = 0; i < 9; i++) {\n let randomArray = Math.floor(Math.random() * 9);\n if (randomIndex.indexOf(randomArray) === -1) {\n randomIndex.push(randomArray);\n } else {\n i = i - 1;\n }\n }\n} //aRandomArray()","function randomPickedColorIndex()\r\n{\r\n\treturn Math.floor(Math.random()*arr.length);\r\n}","generateRandomDirections() {\n let randoms = [];\n for (let i = 0; i < 4; i++) {\n randoms.push(i + 1);\n }\n return this.shuffle(randoms);\n }","function index (max){\n return Math.floor(Math.random() * max)\n }","function getRandomIndex(array) {\n return Math.floor(Math.random() * array.length);\n}","function getRandomIndex(array) {\n return Math.floor(Math.random() * array.length);\n}","function getRandomIndex(array) {\n return Math.floor(Math.random() * array.length);\n}","@autobind\n initShuffleIndexes() {\n for (var i=0; i< this.particleCount; i++) {\n this.shuffleIndexArray[i] = i * 3;\n }\n this.shuffleIndexes();\n }","function getRandomIndex(max){\n\t\treturn Math.round(Math.random() * max);\n\t}","function getRandomIndex(array) {\n return Math.floor(Math.random() * array.length);\n }","function getRandomIndex(array) {\n return Math.floor(Math.random() * array.length);\n }","function randomIndexOf(arr) {\n if(arr.length < 1) return -1;\n return Math.floor(Math.random() * arr.length);\n}","function rpsBotRandomInt() {\n return Math.floor(Math.random() * 3);\n}","function randControl()\n{\n while(leftIndex === usedImg[0] || leftIndex === usedImg[1] || leftIndex === usedImg[2])\n {\n leftIndex = randomImage();\n }\n while(midIndex === usedImg[0] || midIndex === usedImg[1] || midIndex === usedImg[2])\n {\n midIndex = randomImage();\n }\n while(rightIndex === usedImg[0] || rightIndex === usedImg[1] || rightIndex === usedImg[2])\n {\n rightIndex = randomImage();\n }\n}","randomizeDirection() {\n //Create variables to pick randomly from array\n let directions = [this.size, 0, -this.size];\n //Pick from the array index and set the next direction on a horizontal axis\n let randomDirection = floor(random(0, 1) * directions.length);\n this.nextDirectionX = directions[randomDirection];\n //Pick from the array index and set the next direction on a vertical axis\n randomDirection = floor(random(0, 1) * directions.length);\n this.nextDirectionY = directions[randomDirection];\n\n\n\n }","function generateExcuse (arr1,arr2,arr3){\n\n let num1=generateNumRandom(clearArray(arr1))\n let num2=generateNumRandom(clearArray(arr2))\n let num3=generateNumRandom(clearArray(arr3))\n\n return `${arr1[num1]} ${arr2[num2]} ${arr3[num3]} `\n\n}","function chooseRandomIndex(array) {\n return Math.floor(Math.random() * array.length);\n}","function randomIndexForUA() {\n return Math.floor(Math.random() * 10**Math.ceil(Math.log10(UA.length))) % UA.length;\n}","function getRandom(animals){ //declare a function called get randonm with 1 parameter\n return animals[Math.floor(Math.random() * animals.length-1)];//hahve function returns a random number that reps index of random animal in animals array\n }","function randomIndex(max)\n{\n\treturn Math.floor(randomNumber(0,max));\n}","function randomizer() {\n return Math.floor((Math.randon() * 3) + 1)\n}","function randomizer() {\n return Math.floor((Math.randon() * 3) + 1)\n}","generateRandomPoisonIndex() {\n let randoms = [];\n while (randoms.length <= this.numberOfGrids) {\n let currentNumber = Math.floor(\n Math.random() * this.numberOfGrids * this.numberOfGrids\n );\n if (randoms.indexOf(currentNumber) < 0) {\n randoms.push(currentNumber);\n }\n }\n return randoms;\n }","function generateTarget() { \n return Math.floor(Math.random() * 9)\n;}","function random(){\n\tvar randomIndex = mathRandom(workoutArray.length);\n\twhile(current == randomIndex){\n\t\trandomIndex = mathRandom(workoutArray.length);\n\t}\n\n if(randomIndex == 0){\n window.location.href=\"chest.html\";\n }\n else if(randomIndex == 1){\n window.location.href=\"back.html\";\n }\n else if(randomIndex == 2){\n window.location.href=\"arms.html\";\n }\n\telse if(randomIndex == 3){\n\t\twindow.location.href=\"legs.html\";\n\t}\n}","function random_nums() {\n\t\t\tvar max = all_coords.length + 1;\n\t\t\treturn Math.floor(Math.random() * max) \n\t\t}","function generateTarget() {\n return Math.floor(Math.random()* 9)\n}","function generateRandomColors() {\r\n color1.value = getRandom();\r\n color2.value = getRandom();\r\n setGradient();\r\n}","function rndIndx(arr) {\n return Math.floor(Math.random() * arr.length);\n}","function getRandom1to5(index){\r\n\tvar rand=Math.floor(Math.random()*5+1);\r\n\tdocument.getElementById(\"indictor\"+index).innerHTML=rand;\r\n\treturn rand;\r\n}","function generate() {\n return [getRand(categories), getRand(gameType), 'where you', getRand(action), getRand(thing)].join(' ');\n}","function pickADoor() {\n return Math.floor(Math.random() * 3 + 1) // get a random integer: 1, 2, or 3\n}","getRandomGift(index) {\n let i = Math.floor(Math.random() * giftList.length),\n set_index = this.state.show_index;\n set_index[index] = i;\n this.setState({ show_index: set_index });\n }","function generateRandomGameSequence() {\n // random number between 0 and 3\n var rnd = Math.floor(Math.random() * 4);\n gameSequence.push(rnd);\n reproduceGameSequence(gameSequence);\n}","function randomnum() {\n //Sets var randArray to a random index of 0-3; relates to arrays: lower, upper, number, special\n var randArray = Math.floor((Math.random() * array.length));\n //Sets var random to the index of selected var randArray from 0 - max length of the randArray\n var random = Math.floor((Math.random() * array[randArray].length));\n //returns the value in var randArray with an index of var random\n return array[randArray][random];\n}","function randomAll() {\n var random = [];\n random.push(randomNova());\n random.push(randomVodafone());\n random.push(randomTwoForOne());\n var allRandom = random[Math.floor(Math.random() * random.length)];\n return allRandom;\n}","function Random() {\n var RandomNumber1 = Math.floor(Math.random() * 10).toString();\n var RandomNumber2 = Math.floor(Math.random() * 10).toString();\n var RandomNumber3 = Math.floor(Math.random() * 10).toString();\n var linkRandom = RandomNumber1 + RandomNumber2 + RandomNumber3;\n return linkRandom;\n }","function generateAnIdea(){\n thisArrayRandom = Math.floor(Math.random() * thisArray.length) + 1;\n thatArrayRandom = Math.floor(Math.random() * thatArray.length) + 1;\n console.log(\"Idea \"+(i + 1) +\": \"+thisArray[thisArrayRandom] + \" for \"+ thatArray[thatArrayRandom]);\n}","function generateRandomNumbers() {\n let delay = [];\n delay[0] = generateRandom(60, 100);\n for (let i = 1; i < 3; i++) {\n delay[i] = generateRandom(delay[i-1] + 5, 100 + i * 5);\n }\n return delay;\n}","function randomSequence () {\n\tvar random = Math.floor(Math.random() * sequence.length);\n\treturn sequence[random];\n}","function randGenInvValues(){\n for(var i = 0; i < itemList1.length; i++){\n itemList1[i].value = Math.floor(Math.random() * 300)\n }\n for(var i = 0; i < itemList2.length; i++){\n itemList2[i].value = Math.floor(Math.random() * 300)\n }\n for(var i = 0; i < itemList3.length; i++){\n itemList3[i].value = Math.floor(Math.random() * 300)\n }\n}","function generateRandomAge() {\n var randomIdx = getRandomIndex(5);\n return randomIdx;\n}","function generateIndices() {\n let samples = [];\n while (samples.length < n) {\n let sample = Math.floor(index_prng() * face_genders.length);\n if (!samples.includes(sample) && face_genders[sample] != \"unknown\") {\n samples.push(sample);\n }\n }\n return samples;\n }","function random() {\n rndCnt++; // console.log(rndCnt);\n\n return rndFunc();\n }","function randomize(){\n num1 = int(random(1,10))\n num2 = int(random(1,10))\n num3 = int(random(1,10))\n num4 = int(random(1,10))\n num5 = int(random(1,10))\n num6 = int(random(1,10))\n num7 = int(random(1,10))\n}","function SpeedLeft(Index)\n{\n\tvar rando = Math.floor(Math.random() * 2 );\n\tif (rando == 0) \n\t{\n\t\tLeftSpeed[Index] = ((Math.ceil(Math.random() * 3)));\n\t} \n\telse \n\t{\n\t\tLeftSpeed[Index] =((Math.ceil(Math.random() * 3))) * -1;\n\t}\n\n}","function showRandomProducts() {\n let currentProductIndexes = [];\n\n for (let i = 0; i < 3; i++) {\n let randomNumber = Math.floor(Math.random() * allProducts.length);\n\n if (!currentProductIndexes.includes(randomNumber)) {\n currentProductIndexes.push(randomNumber);\n } else {\n while(currentProductIndexes.includes(randomNumber)) {\n randomNumber = Math.floor(Math.random() * allProducts.length);\n }\n\n currentProductIndexes.push(randomNumber);\n }\n }\n\n console.log(`CURRENT: ${ currentProductIndexes[0] }, ${ currentProductIndexes[1] }, ${ currentProductIndexes[2] }`);\n\n for (let i = 0; i < currentProductIndexes.length; i++) {\n allProducts[currentProductIndexes[i]].views++;\n\n if (i === 0) {\n firstProduct.src = allProducts[currentProductIndexes[i]].filepath;\n firstProduct.alt = allProducts[currentProductIndexes[i]].name;\n firstProductTitle.innerText = allProducts[currentProductIndexes[i]].name;\n }\n\n if (i === 1) {\n secondProduct.src = allProducts[currentProductIndexes[i]].filepath;\n secondProduct.alt = allProducts[currentProductIndexes[i]].name;\n secondProductTitle.innerText = allProducts[currentProductIndexes[i]].name;\n }\n\n if (i === 2) {\n thirdProduct.src = allProducts[currentProductIndexes[i]].filepath;\n thirdProduct.alt = allProducts[currentProductIndexes[i]].name;\n thirdProductTitle.innerText = allProducts[currentProductIndexes[i]].name;\n }\n }\n }","function random_index( N, bias ) {\n if (bias == undefined) bias = 1\n return Math.min(N-1, Math.floor(Math.pow(Math.random(), 1/bias) * N))\n}","function getRandomNumber(){\r\n return Math.floor(Math.random() * colors.length);\r\n}","function randomIndex(vect) {\n return Math.floor(Math.random() * vect.length);\n}","function selectRandomIndex(arr) {\n const index = Math.floor(Math.random() * arr.length);\n return index;\n }","function addRandomNumber(){\t\t\n\tvar index=Math.floor(Math.random() * 4);\n\tsequence.push(index);\t\n}","function getRandomNumber(){\r\n return Math.floor(Math.random()*colors.length);\r\n}"],"string":"[\n \"function createThreeRandomIndexes(){\\n\\n let randomIndexes = [];\\n while (randomIndexes.length !== 3){\\n let rand = generateRandomNumber();\\n if(!randomIndexes.includes(rand)){\\n randomIndexes.push(rand);\\n\\n }\\n }\\n return randomIndexes;\\n}\",\n \"function randomIndex() {\\n let n = floor(random(0, 4));\\n return n;\\n}\",\n \"function randomIndex(n) {\\n return Math.floor(Math.random() * parseInt(n));\\n }\",\n \"function renderThreeRandomImages(){\\n let tempIndexes = createThreeRandomIndexes();\\n if(randomIndexs.length === 0){\\n randomIndexs = tempIndexes;\\n }else{\\n while(compareTwoArrays(randomIndexs,tempIndexes)){\\n tempIndexes = createThreeRandomIndexes();\\n }\\n randomIndexs = tempIndexes;\\n }\\n\\n\\n console.log(randomIndexs);\\n leftIndex = randomIndexs[0];\\n rightIndex = randomIndexs[1];\\n middleIndex = randomIndexs[2];\\n\\n\\n leftImageEl.setAttribute('src',products[leftIndex].imagePath);\\n rightImageEl.setAttribute('src',products[rightIndex].imagePath);\\n middleImageEL.setAttribute('src',products[middleIndex].imagePath);\\n products[leftIndex].viewedNum++;\\n products[rightIndex].viewedNum++;\\n products[middleIndex].viewedNum++;\\n}\",\n \"function getRandomIndex () {\\n let min = 0, max = 9;\\n //generate random number as index between min and max\\n //floor to get an integer\\n randomIndex = Math.floor(Math.random() * (max - min + 1)) + min;\\n}\",\n \"function generateRandomIndex() {\\n return Math.floor(Math.random() * 10);\\n}\",\n \"function randomindex() {\\n return Math.floor(Math.random() * Busmall.allimg.length);\\n}\",\n \"function randomindexPath() {\\n\\n do {\\n var right = randomNum();\\n var middle = randomNum();\\n var left = randomNum();\\n var equality = right == left || right == middle || left == middle;\\n } while (equality || availableItem([left, middle, right]))\\n\\n uniqueItem = [];\\n\\n uniqueItem.push(\\n itemsArray[left],\\n itemsArray[middle],\\n itemsArray[right]\\n )\\n render(left, middle, right);\\n}\",\n \"function getRandomIndex() {\\n // 0=>20\\n return Math.floor(Math.random() * products.length);\\n}\",\n \"function randIndex (N) { // improve, se w3c example\\n var a = [];\\n Array.from (Array(N), (e, i) => {\\n a [i] = {index: i, value: Math.random()};\\n });\\n a = a.sort ((a,b)=>{return a.value - b.value});\\n Array.from (Array (N), (e, i) => {a [i] = a [i].index})\\n return a;\\n}\",\n \"function getRandomIndex() {\\n // 0=>18\\n return Math.floor(Math.random() * (products.length));\\n}\",\n \"function getRandomIndex(indexSize) {\\n return Math.floor(Math.random() * indexSize);\\n}\",\n \"function generateRandomIndex(imgIndexSelected) {\\n var randIndex = Math.floor(Math.random() * products.length);\\n while (previouslyDisplayedIndexs.includes(randIndex) || imgIndexSelected.includes(randIndex) ) {\\n randIndex = Math.floor(Math.random() * products.length);\\n }\\n\\n return randIndex;\\n\\n}\",\n \"function possibleIndex(n) {\\n return Math.floor(Math.random() * n);\\n }\",\n \"function generateRandomIndex() {\\n return Math.floor(Math.random() * productsArray.length);\\n}\",\n \"function getRandomIndex() {\\n return Math.floor(Math.random() * allProducts.length);\\n}\",\n \"function getRandomIndex() {\\n return Math.floor(Math.random() * Product.all.length);\\n}\",\n \"function generateRandomIndex() {\\n\\n return Math.floor(Math.random() * Product.allProducts.length);\\n}\",\n \"function randomIndex(length) {\\n return Math.floor(Math.random() * (length));\\n}\",\n \"function pickrandom(){\\r\\n //chose horizontal or vertical\\r\\n var axis = Math.floor(Math.random()*10);\\r\\n //random horizontal postion\\r\\n if (axis <=4){\\r\\n //chose 0 or 9\\r\\n var row = Math.floor(Math.random()*10);\\r\\n //0\\r\\n if (row <=4){\\r\\n row = 0;\\r\\n var col = Math.floor(Math.random()*(n-1));\\r\\n var ind = index(col,row);\\r\\n return linearVertex[ind];\\r\\n }\\r\\n //9\\r\\n else {\\r\\n row = n-1;\\r\\n var col = Math.floor(Math.random()*(n-1));\\r\\n var ind = index(col,row);\\r\\n return linearVertex[ind];\\r\\n }\\r\\n }\\r\\n //random vertical postion.\\r\\n else {\\r\\n //chose 0 or 9\\r\\n var col = Math.floor(Math.random()*10);\\r\\n //0\\r\\n if (col <=4){\\r\\n col = 0;\\r\\n var row = Math.floor(Math.random()*(n-1));\\r\\n var ind = index(col,row);\\r\\n return linearVertex[ind];\\r\\n }\\r\\n //9\\r\\n else {\\r\\n col = n-1;\\r\\n var row = Math.floor(Math.random()*(n-1));\\r\\n var ind = index(col,row);\\r\\n return linearVertex[ind];\\r\\n }\\r\\n }\\r\\n}\",\n \"function rng(){\\n return Math.floor(Math.random() * 3);\\n}\",\n \"function genrateRandomIndex(){\\n return Math.floor(Math.random() * Goat.allImages.length); \\n // 0.99999999999 * 8 => 7.999999994 floor() => 7\\n // 0.99999999999 * 5 => 4.999999 floor => 4\\n}\",\n \"function randomIndex(list){\\n return Math.floor(Math.random()*list.length);\\n}\",\n \"static randomPosition(count) {\\n\\t\\treturn [random(-width, width), random(-height, height), random(width)].slice(0, count === undefined ? 3 : count);\\n\\t}\",\n \"function getRandomIndex(){\\n\\n var index = getRandomNumber(allBusMall.length);\\n\\n while (uniqueIndexArray.includes(index)){\\n index = getRandomNumber(allBusMall.length);\\n }\\n uniqueIndexArray.push(index);\\n if(uniqueIndexArray.length > 6){\\n uniqueIndexArray.shift();\\n }\\n return index;\\n}\",\n \"function getRandomIndices(num_residents) {\\n\\tvar possibleIndices = [];\\n\\tfor (var i = 0; i < num_residents; i++) {\\n\\t\\tpossibleIndices.push(i);\\n\\t}\\n\\tvar rand1 = possibleIndices[Math.floor(Math.random() * possibleIndices.length)];\\n\\tpossibleIndices.splice(rand1, 1);\\n\\tvar rand2 = possibleIndices[Math.floor(Math.random() * possibleIndices.length)];\\n\\n\\treturn { index1: rand1, index2: rand2 };\\n}\",\n \"function random() {\\n return (Math.floor(Math.random() * 3));\\n }\",\n \"function randomIndex(data) {\\n return Math.floor(Math.random() * data.length);\\n }\",\n \"function getRandomIndex(maxIndex) {\\n return Math.floor(Math.random() * maxIndex);\\n}\",\n \"function generateRandomIndex() {\\n return Math.floor(Math.random() * busMall.length);\\n}\",\n \"function randomsuggestion(){\\n $('#match').css({ 'order': Math.floor((Math.random() * 3) + 1)});\\n $('.suggData1').css({ 'order': Math.floor((Math.random() * 3) + 1)});\\n $('.suggData2').css({ 'order': Math.floor((Math.random() * 3) + 1)});\\n } // end function to generate random index\",\n \"generateRandomIndex(){\\n var index = {index:{}, string: \\\"\\\"};\\n for(var field in this.fields){\\n var i = (Math.floor(Math.random() * this.fields[field].length) );\\n index.index[field] = i;\\n index.string += i.toString() + \\\".\\\";\\n }\\n return index;\\n }\",\n \"function randomIndex(){\\n let last_index = audio_utility.index_curr_track;\\n let current_index = getRandomIntInclusive(0, audio_utility.track_list_length-1);\\n while(last_index == current_index){\\n current_index = getRandomIntInclusive(0, audio_utility.track_list_length-1);\\n }\\n audio_utility.index_curr_track = current_index;\\n}\",\n \"function createRandom(flo,index){\\n let\\n}\",\n \"function randomIndex (max){\\n return Math.floor(Math.random() * max);\\n}\",\n \"function random() {\\n random1 = Math.floor((Math.random() * startupX.length));\\n random2 = Math.floor((Math.random() * startupY.length));\\n\\n}\",\n \"function generateRandomPuzzle(){\\n//Random number of rows and cols and picture\\n\\n\\tvar num = Math.ceil(Math.random()*6); // set the random magical number to access the array of images through\\n\\t_image_path = String(images[num].path); // get the image path using the index generated\\n\\t_image_width = images[num].swidth; //get the picture width\\n\\t_image_height = images[num].sheight; //get the picture height\\n\\t\\n\\tvar puzzleSize = Math.ceil(Math.random()*9); //get the random puzzle size\\n\\t_num_rows = puzzleSize; //set the number of rows\\n\\t_num_cols = puzzleSize; // set the number of columns\\n\\t\\n\\t\\n\\t\\n\\t\\n\\t\\n\\t\\n}\",\n \"function randomButtons() {\\n randomBtn1 = Math.floor(Math.random() * 19 + 1);\\n randomBtn2 = Math.floor(Math.random() * 19 + 1);\\n randomBtn3 = Math.floor(Math.random() * 19 + 1);\\n randomBtn4 = Math.floor(Math.random() * 19 + 1);\\n randomBtn5 = Math.floor(Math.random() * 19 + 1);\\n }\",\n \"function setRandomIndices(n){\\n\\t\\tvar temp = [],\\n\\t\\tmax = array.length-1;\\n\\t\\t\\t\\n\\t\\twhile(max >= 0) temp.push(max--)\\n\\t\\t\\n\\t\\t//From http://stackoverflow.com/questions/962802/is-it-correct-to-use-javascript-array-sort-method-for-shuffling#answer-962890\\n\\t\\tvar shuffled = (function shuffle(array) {\\n\\t\\t var tmp, current, top = array.length;\\n\\n\\t\\t if(top) while(--top) {\\n\\t\\t current = Math.floor(Math.random() * (top + 1))\\n\\t\\t tmp = array[current]\\n\\t\\t array[current] = array[top]\\n\\t\\t array[top] = tmp\\n\\t\\t }\\n\\n\\t\\t return array;\\n\\t\\t})(temp)\\n\\n\\t\\treturn shuffled.slice(0, n)\\n\\t}\",\n \"function randInt() {\\n return Math.floor(Math.random()*3);\\n}\",\n \"function setRandom(){\\n\\tvar lstShuffle = new Array();\\n\\tvar\\tlst = [0,1,2,3,4,5,6,7,8,9,10,11];\\n\\twhile(lst.length>0){\\n\\t\\tvar tempIndex = randomXToY(0, lst.length);\\n\\t\\tif(typeof lst[tempIndex] != \\\"undefined\\\"){\\n\\t\\t\\tlstShuffle.push(lst[tempIndex]);\\n\\t\\t\\tlst.splice(tempIndex,1);\\t\\n\\t\\t}\\n\\t}\\t\\n\\t\\n\\t//mergin\\n\\tvar obj;\\n\\tfor(var i = 0; i < lstShuffle.length;i++){\\n\\t\\tobj = new Object();\\n\\t\\tobj.index = lstShuffle[i];\\n\\t\\tobj.num = irandom[i].num;\\n\\t\\tobj.xAngle = irandom[i].xAngle;\\n\\t\\tobj.yAngle = irandom[i].yAngle;\\n\\t\\tirandom[i] = obj;\\n\\t}\\n\\n}\",\n \"function multiRand () {\\n return Math.floor(Math.random() * 11);\\n}\",\n \"function shuffle()\\n{\\n var tem = getRandom(shuffleIndexCount);\\n var tem2 = shuffleIndex[tem];\\n shuffleIndex[tem] = shuffleIndex[shuffleIndexCount];\\n\\n shuffleIndexCount--;\\n if(shuffleIndexCount < 0)\\n {\\n shuffleIndexCount = songsList.length;\\n }\\n return tem2;\\n}\",\n \"function getRandomIndex(array){\\n return Math.floor(Math.random() * array.length);\\n}\",\n \"function renderThreeRandomImages(){\\n do{\\n firstImageIndex = generateRandomIndex();\\n secondImageIndex = generateRandomIndex();\\n thirdImageIndex = generateRandomIndex();\\n } while(firstImageIndex === previousRow[0] || firstImageIndex === previousRow[1] || firstImageIndex === previousRow[2] || secondImageIndex === previousRow[0] || secondImageIndex === previousRow[1] || secondImageIndex === previousRow[2] || thirdImageIndex === previousRow[0] || thirdImageIndex === previousRow[1] || thirdImageIndex === previousRow[2] || firstImageIndex === secondImageIndex || firstImageIndex === thirdImageIndex || secondImageIndex === thirdImageIndex );\\n\\n previousRow = [];\\n previousRow.push(firstImageIndex);\\n previousRow.push(secondImageIndex);\\n previousRow.push(thirdImageIndex);\\n\\n firstImageProduct.src = Product.prototype.allProduct[firstImageIndex].pathImage;\\n secondImageProduct.src = Product.prototype.allProduct[secondImageIndex].pathImage;\\n thirdImageProduct.src = Product.prototype.allProduct[thirdImageIndex].pathImage;\\n\\n console.log(previousRow);\\n}\",\n \"function getNextRandomIndex(indexArr) {\\n if (indexArr.length <= 0) return -1;\\n let j = getRandomInt(0, indexArr.length-1);\\n\\n //swap\\n let ret = indexArr[j];\\n indexArr[j] = indexArr[indexArr.length-1];\\n indexArr.pop();\\n\\n return ret;\\n}\",\n \"function randomNumber(index) {\\n if (selectedFeatures[(index - 1)] == \\\"specChars\\\") {\\n random = specChars.charAt(Math.floor(Math.random() * specChars.length));\\n } else if (selectedFeatures[(index - 1)] == \\\"numerals\\\") {\\n random = numerals.charAt(Math.floor(Math.random() * numerals.length));\\n } else if (selectedFeatures[(index - 1)] == \\\"alphabetLower\\\") {\\n random = alphabetLower.charAt(Math.floor(Math.random() * alphabetLower.length));\\n } else if (selectedFeatures[(index - 1)] == \\\"alphabetUpper\\\") {\\n random = alphabetUpper.charAt(Math.floor(Math.random() * alphabetUpper.length));\\n }\\n return random;\\n }\",\n \"function getRandomIndex (arr) {\\n return Math.round(Math.random() * (arr.length - 1));\\n}\",\n \"function aRandomArray() {\\n randomIndex = [];\\n for (let i = 0; i < 9; i++) {\\n let randomArray = Math.floor(Math.random() * 9);\\n if (randomIndex.indexOf(randomArray) === -1) {\\n randomIndex.push(randomArray);\\n } else {\\n i = i - 1;\\n }\\n }\\n} //aRandomArray()\",\n \"function randomPickedColorIndex()\\r\\n{\\r\\n\\treturn Math.floor(Math.random()*arr.length);\\r\\n}\",\n \"generateRandomDirections() {\\n let randoms = [];\\n for (let i = 0; i < 4; i++) {\\n randoms.push(i + 1);\\n }\\n return this.shuffle(randoms);\\n }\",\n \"function index (max){\\n return Math.floor(Math.random() * max)\\n }\",\n \"function getRandomIndex(array) {\\n return Math.floor(Math.random() * array.length);\\n}\",\n \"function getRandomIndex(array) {\\n return Math.floor(Math.random() * array.length);\\n}\",\n \"function getRandomIndex(array) {\\n return Math.floor(Math.random() * array.length);\\n}\",\n \"@autobind\\n initShuffleIndexes() {\\n for (var i=0; i< this.particleCount; i++) {\\n this.shuffleIndexArray[i] = i * 3;\\n }\\n this.shuffleIndexes();\\n }\",\n \"function getRandomIndex(max){\\n\\t\\treturn Math.round(Math.random() * max);\\n\\t}\",\n \"function getRandomIndex(array) {\\n return Math.floor(Math.random() * array.length);\\n }\",\n \"function getRandomIndex(array) {\\n return Math.floor(Math.random() * array.length);\\n }\",\n \"function randomIndexOf(arr) {\\n if(arr.length < 1) return -1;\\n return Math.floor(Math.random() * arr.length);\\n}\",\n \"function rpsBotRandomInt() {\\n return Math.floor(Math.random() * 3);\\n}\",\n \"function randControl()\\n{\\n while(leftIndex === usedImg[0] || leftIndex === usedImg[1] || leftIndex === usedImg[2])\\n {\\n leftIndex = randomImage();\\n }\\n while(midIndex === usedImg[0] || midIndex === usedImg[1] || midIndex === usedImg[2])\\n {\\n midIndex = randomImage();\\n }\\n while(rightIndex === usedImg[0] || rightIndex === usedImg[1] || rightIndex === usedImg[2])\\n {\\n rightIndex = randomImage();\\n }\\n}\",\n \"randomizeDirection() {\\n //Create variables to pick randomly from array\\n let directions = [this.size, 0, -this.size];\\n //Pick from the array index and set the next direction on a horizontal axis\\n let randomDirection = floor(random(0, 1) * directions.length);\\n this.nextDirectionX = directions[randomDirection];\\n //Pick from the array index and set the next direction on a vertical axis\\n randomDirection = floor(random(0, 1) * directions.length);\\n this.nextDirectionY = directions[randomDirection];\\n\\n\\n\\n }\",\n \"function generateExcuse (arr1,arr2,arr3){\\n\\n let num1=generateNumRandom(clearArray(arr1))\\n let num2=generateNumRandom(clearArray(arr2))\\n let num3=generateNumRandom(clearArray(arr3))\\n\\n return `${arr1[num1]} ${arr2[num2]} ${arr3[num3]} `\\n\\n}\",\n \"function chooseRandomIndex(array) {\\n return Math.floor(Math.random() * array.length);\\n}\",\n \"function randomIndexForUA() {\\n return Math.floor(Math.random() * 10**Math.ceil(Math.log10(UA.length))) % UA.length;\\n}\",\n \"function getRandom(animals){ //declare a function called get randonm with 1 parameter\\n return animals[Math.floor(Math.random() * animals.length-1)];//hahve function returns a random number that reps index of random animal in animals array\\n }\",\n \"function randomIndex(max)\\n{\\n\\treturn Math.floor(randomNumber(0,max));\\n}\",\n \"function randomizer() {\\n return Math.floor((Math.randon() * 3) + 1)\\n}\",\n \"function randomizer() {\\n return Math.floor((Math.randon() * 3) + 1)\\n}\",\n \"generateRandomPoisonIndex() {\\n let randoms = [];\\n while (randoms.length <= this.numberOfGrids) {\\n let currentNumber = Math.floor(\\n Math.random() * this.numberOfGrids * this.numberOfGrids\\n );\\n if (randoms.indexOf(currentNumber) < 0) {\\n randoms.push(currentNumber);\\n }\\n }\\n return randoms;\\n }\",\n \"function generateTarget() { \\n return Math.floor(Math.random() * 9)\\n;}\",\n \"function random(){\\n\\tvar randomIndex = mathRandom(workoutArray.length);\\n\\twhile(current == randomIndex){\\n\\t\\trandomIndex = mathRandom(workoutArray.length);\\n\\t}\\n\\n if(randomIndex == 0){\\n window.location.href=\\\"chest.html\\\";\\n }\\n else if(randomIndex == 1){\\n window.location.href=\\\"back.html\\\";\\n }\\n else if(randomIndex == 2){\\n window.location.href=\\\"arms.html\\\";\\n }\\n\\telse if(randomIndex == 3){\\n\\t\\twindow.location.href=\\\"legs.html\\\";\\n\\t}\\n}\",\n \"function random_nums() {\\n\\t\\t\\tvar max = all_coords.length + 1;\\n\\t\\t\\treturn Math.floor(Math.random() * max) \\n\\t\\t}\",\n \"function generateTarget() {\\n return Math.floor(Math.random()* 9)\\n}\",\n \"function generateRandomColors() {\\r\\n color1.value = getRandom();\\r\\n color2.value = getRandom();\\r\\n setGradient();\\r\\n}\",\n \"function rndIndx(arr) {\\n return Math.floor(Math.random() * arr.length);\\n}\",\n \"function getRandom1to5(index){\\r\\n\\tvar rand=Math.floor(Math.random()*5+1);\\r\\n\\tdocument.getElementById(\\\"indictor\\\"+index).innerHTML=rand;\\r\\n\\treturn rand;\\r\\n}\",\n \"function generate() {\\n return [getRand(categories), getRand(gameType), 'where you', getRand(action), getRand(thing)].join(' ');\\n}\",\n \"function pickADoor() {\\n return Math.floor(Math.random() * 3 + 1) // get a random integer: 1, 2, or 3\\n}\",\n \"getRandomGift(index) {\\n let i = Math.floor(Math.random() * giftList.length),\\n set_index = this.state.show_index;\\n set_index[index] = i;\\n this.setState({ show_index: set_index });\\n }\",\n \"function generateRandomGameSequence() {\\n // random number between 0 and 3\\n var rnd = Math.floor(Math.random() * 4);\\n gameSequence.push(rnd);\\n reproduceGameSequence(gameSequence);\\n}\",\n \"function randomnum() {\\n //Sets var randArray to a random index of 0-3; relates to arrays: lower, upper, number, special\\n var randArray = Math.floor((Math.random() * array.length));\\n //Sets var random to the index of selected var randArray from 0 - max length of the randArray\\n var random = Math.floor((Math.random() * array[randArray].length));\\n //returns the value in var randArray with an index of var random\\n return array[randArray][random];\\n}\",\n \"function randomAll() {\\n var random = [];\\n random.push(randomNova());\\n random.push(randomVodafone());\\n random.push(randomTwoForOne());\\n var allRandom = random[Math.floor(Math.random() * random.length)];\\n return allRandom;\\n}\",\n \"function Random() {\\n var RandomNumber1 = Math.floor(Math.random() * 10).toString();\\n var RandomNumber2 = Math.floor(Math.random() * 10).toString();\\n var RandomNumber3 = Math.floor(Math.random() * 10).toString();\\n var linkRandom = RandomNumber1 + RandomNumber2 + RandomNumber3;\\n return linkRandom;\\n }\",\n \"function generateAnIdea(){\\n thisArrayRandom = Math.floor(Math.random() * thisArray.length) + 1;\\n thatArrayRandom = Math.floor(Math.random() * thatArray.length) + 1;\\n console.log(\\\"Idea \\\"+(i + 1) +\\\": \\\"+thisArray[thisArrayRandom] + \\\" for \\\"+ thatArray[thatArrayRandom]);\\n}\",\n \"function generateRandomNumbers() {\\n let delay = [];\\n delay[0] = generateRandom(60, 100);\\n for (let i = 1; i < 3; i++) {\\n delay[i] = generateRandom(delay[i-1] + 5, 100 + i * 5);\\n }\\n return delay;\\n}\",\n \"function randomSequence () {\\n\\tvar random = Math.floor(Math.random() * sequence.length);\\n\\treturn sequence[random];\\n}\",\n \"function randGenInvValues(){\\n for(var i = 0; i < itemList1.length; i++){\\n itemList1[i].value = Math.floor(Math.random() * 300)\\n }\\n for(var i = 0; i < itemList2.length; i++){\\n itemList2[i].value = Math.floor(Math.random() * 300)\\n }\\n for(var i = 0; i < itemList3.length; i++){\\n itemList3[i].value = Math.floor(Math.random() * 300)\\n }\\n}\",\n \"function generateRandomAge() {\\n var randomIdx = getRandomIndex(5);\\n return randomIdx;\\n}\",\n \"function generateIndices() {\\n let samples = [];\\n while (samples.length < n) {\\n let sample = Math.floor(index_prng() * face_genders.length);\\n if (!samples.includes(sample) && face_genders[sample] != \\\"unknown\\\") {\\n samples.push(sample);\\n }\\n }\\n return samples;\\n }\",\n \"function random() {\\n rndCnt++; // console.log(rndCnt);\\n\\n return rndFunc();\\n }\",\n \"function randomize(){\\n num1 = int(random(1,10))\\n num2 = int(random(1,10))\\n num3 = int(random(1,10))\\n num4 = int(random(1,10))\\n num5 = int(random(1,10))\\n num6 = int(random(1,10))\\n num7 = int(random(1,10))\\n}\",\n \"function SpeedLeft(Index)\\n{\\n\\tvar rando = Math.floor(Math.random() * 2 );\\n\\tif (rando == 0) \\n\\t{\\n\\t\\tLeftSpeed[Index] = ((Math.ceil(Math.random() * 3)));\\n\\t} \\n\\telse \\n\\t{\\n\\t\\tLeftSpeed[Index] =((Math.ceil(Math.random() * 3))) * -1;\\n\\t}\\n\\n}\",\n \"function showRandomProducts() {\\n let currentProductIndexes = [];\\n\\n for (let i = 0; i < 3; i++) {\\n let randomNumber = Math.floor(Math.random() * allProducts.length);\\n\\n if (!currentProductIndexes.includes(randomNumber)) {\\n currentProductIndexes.push(randomNumber);\\n } else {\\n while(currentProductIndexes.includes(randomNumber)) {\\n randomNumber = Math.floor(Math.random() * allProducts.length);\\n }\\n\\n currentProductIndexes.push(randomNumber);\\n }\\n }\\n\\n console.log(`CURRENT: ${ currentProductIndexes[0] }, ${ currentProductIndexes[1] }, ${ currentProductIndexes[2] }`);\\n\\n for (let i = 0; i < currentProductIndexes.length; i++) {\\n allProducts[currentProductIndexes[i]].views++;\\n\\n if (i === 0) {\\n firstProduct.src = allProducts[currentProductIndexes[i]].filepath;\\n firstProduct.alt = allProducts[currentProductIndexes[i]].name;\\n firstProductTitle.innerText = allProducts[currentProductIndexes[i]].name;\\n }\\n\\n if (i === 1) {\\n secondProduct.src = allProducts[currentProductIndexes[i]].filepath;\\n secondProduct.alt = allProducts[currentProductIndexes[i]].name;\\n secondProductTitle.innerText = allProducts[currentProductIndexes[i]].name;\\n }\\n\\n if (i === 2) {\\n thirdProduct.src = allProducts[currentProductIndexes[i]].filepath;\\n thirdProduct.alt = allProducts[currentProductIndexes[i]].name;\\n thirdProductTitle.innerText = allProducts[currentProductIndexes[i]].name;\\n }\\n }\\n }\",\n \"function random_index( N, bias ) {\\n if (bias == undefined) bias = 1\\n return Math.min(N-1, Math.floor(Math.pow(Math.random(), 1/bias) * N))\\n}\",\n \"function getRandomNumber(){\\r\\n return Math.floor(Math.random() * colors.length);\\r\\n}\",\n \"function randomIndex(vect) {\\n return Math.floor(Math.random() * vect.length);\\n}\",\n \"function selectRandomIndex(arr) {\\n const index = Math.floor(Math.random() * arr.length);\\n return index;\\n }\",\n \"function addRandomNumber(){\\t\\t\\n\\tvar index=Math.floor(Math.random() * 4);\\n\\tsequence.push(index);\\t\\n}\",\n \"function getRandomNumber(){\\r\\n return Math.floor(Math.random()*colors.length);\\r\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7604658","0.7136812","0.71226996","0.6999024","0.69741267","0.69292235","0.69046384","0.6896481","0.687405","0.68581074","0.68324506","0.678987","0.6762413","0.6676587","0.66665584","0.6651931","0.6639924","0.66346294","0.6617684","0.65913737","0.658985","0.6589808","0.6569774","0.65663785","0.6552915","0.6546491","0.6529126","0.65076566","0.6504564","0.6492415","0.64914244","0.6487891","0.6455799","0.64480543","0.6432957","0.6362661","0.6357535","0.63557327","0.63439834","0.6324656","0.6314304","0.6298868","0.62519187","0.6248629","0.623509","0.6230954","0.6223914","0.62204635","0.62107414","0.6208143","0.62063915","0.6205709","0.61891055","0.61891055","0.61891055","0.61836594","0.61715704","0.6166397","0.6166397","0.6149086","0.6144036","0.61409783","0.613731","0.61309993","0.61256194","0.61217827","0.6119108","0.61146784","0.6102417","0.6102417","0.6102316","0.6078829","0.6075063","0.6067423","0.6066605","0.6064869","0.6059372","0.6049646","0.60281265","0.6027817","0.60269713","0.60216373","0.60200495","0.6011811","0.60112214","0.60097474","0.5999399","0.5997383","0.5994149","0.5989857","0.5987151","0.5982611","0.5980743","0.59802735","0.5976648","0.5973318","0.5973147","0.5960367","0.5954164","0.59494615","0.5944105"],"string":"[\n \"0.7604658\",\n \"0.7136812\",\n \"0.71226996\",\n \"0.6999024\",\n \"0.69741267\",\n \"0.69292235\",\n \"0.69046384\",\n \"0.6896481\",\n \"0.687405\",\n \"0.68581074\",\n \"0.68324506\",\n \"0.678987\",\n \"0.6762413\",\n \"0.6676587\",\n \"0.66665584\",\n \"0.6651931\",\n \"0.6639924\",\n \"0.66346294\",\n \"0.6617684\",\n \"0.65913737\",\n \"0.658985\",\n \"0.6589808\",\n \"0.6569774\",\n \"0.65663785\",\n \"0.6552915\",\n \"0.6546491\",\n \"0.6529126\",\n \"0.65076566\",\n \"0.6504564\",\n \"0.6492415\",\n \"0.64914244\",\n \"0.6487891\",\n \"0.6455799\",\n \"0.64480543\",\n \"0.6432957\",\n \"0.6362661\",\n \"0.6357535\",\n \"0.63557327\",\n \"0.63439834\",\n \"0.6324656\",\n \"0.6314304\",\n \"0.6298868\",\n \"0.62519187\",\n \"0.6248629\",\n \"0.623509\",\n \"0.6230954\",\n \"0.6223914\",\n \"0.62204635\",\n \"0.62107414\",\n \"0.6208143\",\n \"0.62063915\",\n \"0.6205709\",\n \"0.61891055\",\n \"0.61891055\",\n \"0.61891055\",\n \"0.61836594\",\n \"0.61715704\",\n \"0.6166397\",\n \"0.6166397\",\n \"0.6149086\",\n \"0.6144036\",\n \"0.61409783\",\n \"0.613731\",\n \"0.61309993\",\n \"0.61256194\",\n \"0.61217827\",\n \"0.6119108\",\n \"0.61146784\",\n \"0.6102417\",\n \"0.6102417\",\n \"0.6102316\",\n \"0.6078829\",\n \"0.6075063\",\n \"0.6067423\",\n \"0.6066605\",\n \"0.6064869\",\n \"0.6059372\",\n \"0.6049646\",\n \"0.60281265\",\n \"0.6027817\",\n \"0.60269713\",\n \"0.60216373\",\n \"0.60200495\",\n \"0.6011811\",\n \"0.60112214\",\n \"0.60097474\",\n \"0.5999399\",\n \"0.5997383\",\n \"0.5994149\",\n \"0.5989857\",\n \"0.5987151\",\n \"0.5982611\",\n \"0.5980743\",\n \"0.59802735\",\n \"0.5976648\",\n \"0.5973318\",\n \"0.5973147\",\n \"0.5960367\",\n \"0.5954164\",\n \"0.59494615\",\n \"0.5944105\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81765,"cells":{"query":{"kind":"string","value":"Function to end survey at 25 clicks"},"document":{"kind":"string","value":"function surveyEnd() {\n viewResultsButton.textContent = 'View Results';\n picSection.appendChild(viewResultsButton);\n picSection.removeEventListener('click', handleUserClick);\n for (var i = 0; i < catalogArray.length; i++) {\n tallyClickFinal.push(catalogArray[i].tallyClicked);\n tallyViewFinal.push(catalogArray[i].tallyDisplayed);\n };\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"rt\": Math.round(performance.now() - trial_onset),\n \"digit_response\": digit_response,\n 'click_history': click_history\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n if (trial.post_trial_duration !== null) {\n jsPsych.pluginAPI.setTimeout(function () {\n jsPsych.finishTrial(trial_data);\n }, trial.post_trial_duration);\n } else {\n jsPsych.finishTrial(trial_data);\n }\n\n }","function click() {\r\n console.log(questions[questionIndex].answer)\r\n console.log(this.value)\r\nif(this.value !== questions[questionIndex].answer) {\r\n time -= 5;\r\n\r\n if (time < 0) {\r\n time = 0;\r\n }\r\n}\r\n\r\n$(\"#time-counter\").text(time);\r\n\r\nquestionIndex++;\r\nif(questionIndex === questions.length) {\r\n finish();\r\n} else {\r\nstartQuestions();\r\n}}","function correctAnswerClicked() {\n console.log(\"correct answer\");\n correctAnswerCount++;\n $(\"#correct-answers-view\").html(correctAnswerCount);\n $(\".footer\").html(\"Correct!!!
Waiting 5 seconds to go next!\");\n \n stop();\n waitBeforeGoingNextAutomatically();\n\n}","function ansClick(e) {\n if(qIndex >= (questions.length - 1)) {\n postScore();\n } else {\n var currentQuestion = questions[qIndex];\n var ansClick = e.target.textContent;\n if(ansClick.toLowerCase() === currentQuestion.answer.toLowerCase()) {\n currentScore+= 5;\n } else {\n time -= 10;\n currentScore -= 5;\n }\n qIndex++;\n getQuestion();\n };\n}","function nextQuestion() {\n // currentQuestion++\n $(\"#question\").html(test[nextUp].hint);\n $(\"#guess1\").html(test[nextUp].guess1);\n $(\"#guess2\").html(test[nextUp].guess2);\n $(\"#guess3\").html(test[nextUp].guess3);\n $(\"#guess4\").html(test[nextUp].guess4);\n // console.log(nextUp)\n countDown();\n // $('#timeToGo').each(countDown); //starts counter\n anser = (test[nextUp].Answer);\n nextUp++\n // console.log(currentQuestion)\n\n //-------------------------------------------------------------------------------------------------------\n //clicks for answer 1\n}","function end_trial() {\r\n\r\n // kill any remaining setTimeout handlers\r\n for (var i = 0; i < setTimeoutHandlers.length; i++) {\r\n clearTimeout(setTimeoutHandlers[i]);\r\n }\r\n\r\n // gather the data to store for the trial\r\n var trial_data = {\r\n \"rt\": response.rt,\r\n \"stimulus\": trial.stimulus,\r\n \"button_pressed\": response.button\r\n };\r\n\r\n // clear the display\r\n display_element.html('');\r\n\r\n // move on to the next trial\r\n jsPsych.finishTrial(trial_data);\r\n }","function nextQuestion(){\n $(\"#alerts\").hide();\n currentQuestion = triviaQuestions[currentQuestionIndex + 1];\n currentQuestionIndex++;\n if (currentQuestionIndex >= 10) {\n $(\"#alerts\").html(\" Nice job! Click the Start 90s Trivia button to play again!
\");\n $(\"#alerts\").show();\n stopTimer();\n } else {\n displayQuestion(currentQuestion);\n };\n }","function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"rt\": response.rt,\n \"stimulus\": trial.stimulus,\n \"button_pressed\": response.button\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"rt\": response.rt,\n \"stimulus\": trial.stimulus,\n \"button_pressed\": response.button\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end(){\n\t\tclearTimeout(timerId);\n\t\t$(\"#Time-Remaining\").hide();\n\t\t$(\"#Question\").hide();\n $(\"#score\").show();\n $(\"#score\").text(\"You got \"+ correct +\" out of \"+questions.length+\" correct!\")\n $(\".answer\").hide();\n $(\"#Ready\").show();\n $(\"#retry\").show();\n cQ = 0;\n correct = 0;\n $(\"#Ready\").click(function(){\n\t\t\ttimeLeft = 60\n $(\".answer\").empty();\n $(\"#Question\").empty();\n $(\"#Time-Remaining\").show();\n $(\"#Ready\").hide();\n $(\"#score\").hide();\n $(\"#retry\").hide();\n\t\t\tsetTimeout(Question,500);\n });\n }","function answerClick(x) {\n var answer = questions[questionCounter].answer;\n showAnswer(x == answer);\n if (x !== answer) {\n time -= wrongAnswerPenalty;\n showTime();\n }\n questionCounter ++;\n if (questionCounter < questions.length) {\n getQuestions();\n }\n else {\n showEndScreen();\n }\n}","function end_trial() {\r\n\r\n // kill any remaining setTimeout handlers\r\n jsPsych.pluginAPI.clearAllTimeouts();\r\n\r\n // gather the data to store for the trial\r\n var trial_data = {\r\n \"stimulus\": trial.stimulus,\r\n \"correct\": trial.correct,\r\n \"choice\": response.choice,\r\n \"accuracy\": response.accuracy,\r\n \"rt\": response.rt,\r\n };\r\n\r\n // clear the display\r\n display_element.innerHTML = '';\r\n\r\n // move on to the next trial\r\n jsPsych.finishTrial(trial_data);\r\n }","function lastClicked() { \n // end the quiz and show the score\n console.log(\"last clik func active\");\n clearInterval(timeInterval);\n quiz.style.display = \"none\";\n\n //todo//\n }","function end_trial() {\r\n\r\n // kill any remaining setTimeout handlers\r\n jsPsych.pluginAPI.clearAllTimeouts();\r\n\r\n // gather the data to store for the trial\r\n var trial_data = {\r\n \"rt\": response.rt,\r\n \"stimulus\": trial.stimulus,\r\n \"response\": response.response\r\n };\r\n\r\n // clear the display\r\n display_element.innerHTML = '';\r\n\r\n // move on to the next trial\r\n jsPsych.finishTrial(trial_data);\r\n }","function end_trial() {\n response.rt = performance.now() - start_time;\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(response);\n }","function end_trial() {\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n const trial_data = {\n rt: response.rt,\n stimulus: trial.stimulus,\n button_pressed: response.button,\n switched_queries: response.switched_queries,\n confidence: response.confidence,\n choice: response.choice,\n correct: response.choice == trial.correct_query_choice,\n };\n\n // clear the display\n display_element.innerHTML = \"\";\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"stimulus\": trial.stimulus,\n \"rating\": trial.rating,\n \"condition\": trial.condition,\n \"with loading\": trial.cognitive_loading,\n \"rating_rt\": trial.rating_rt,\n \"grid_rt\": trial.grid_rt,\n \"scale type\": trial.scale_type,\n \"correct anser\": trial.correct_answer,\n \"hits\": trial.hits,\n \"misses\": trial.misses,\n \"false alarms\": trial.false_alarms,\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n\n\t\t\tjsPsych.pluginAPI.clearAllTimeouts();\n\t\t\t//Kill the keyboard listener if keyboardListener has been defined\n\t\t\tif (typeof keyboardListener !== 'undefined') {\n\t\t\t\tjsPsych.pluginAPI.cancelKeyboardResponse(keyboardListener);\n\t\t\t}\n\n\t\t\t//Place all the data to be saved from this trial in one data object\n\t\t\tvar trial_data = {\n\t\t\t\t\"rt\": response.rt, //The response time\n\t\t\t\t\"key_press\": response.key, //The key that the subject pressed\n\t\t\t\t\"mean\": trial.mean,\n\t\t\t\t\"sd\": trial.sd,\n\t\t\t\t'left_circles': circles_left,\n\t\t\t\t'right_circles': circles_right,\n\t\t\t\t'larger_magnitude': larger_magnitude,\n\t\t\t\t'left_radius': r1,\n\t\t\t\t'right_radius': r2\n\t\t\t}\n\n\t\t\tif (trial_data.key_press == trial.choices[0] && larger_magnitude == 'left'){\n\t\t\t\ttrial_data.correct = true\n\t\t\t}\n\t\t\telse if (trial_data.key_press == trial.choices[1] && larger_magnitude == 'right'){\n\t\t\t\ttrial_data.correct = true\n\t\t\t}\n\t\t\telse if (trial_data.key_press == -1 ){\n\t\t\t\ttrial_data.correct = null\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttrial_data.correct = false\n\t\t\t}\n\n\n\t\t\t//Remove the canvas as the child of the display_element element\n\t\t\tdisplay_element.innerHTML='';\n\n\t\t\t//Restore the settings to JsPsych defaults\n\t\t\tbody.style.margin = originalMargin;\n\t\t\tbody.style.padding = originalPadding;\n\t\t\tbody.style.backgroundColor = originalBackgroundColor\n\t\t\tbody.style.cursor = originalCursorType\n\n\t\t\tjsPsych.finishTrial(trial_data); //End this trial and move on to the next trial\n\n\t\t}","function nextQuestion(){\t\n\t\thideAnswerBox();\n\t\tremovePosters();\n\t\tstopAudio();\n\t\tquestionCount++;\n\t\t\n\t\tif (questionCount > 9) {\n\t\t\tendGame();\n\t\t\tshowOverlay($('.endGame'));\n\t\t}\n\t\telse if (questionCount > 4 && gameCount < 1) {\n\t\t\tendRound();\n\t\t\tshowOverlay($('.end_round'));\n\t\t}\n\t\telse {\n\t\t\tupdateQuestion();\n\t\t\tplayAudio();\n\t\t}\n\t}","function nextQuestions() {\n number++;\n count = 30;\n timeRemain = setInterval(timer, 1000);\n $(\"#timer\").html(\"Time remaining: \" + count + \" secs\");\n questions(number);\n $(\"#image\").hide();\n }","function end_trial() {\n 'use strict';\n\n // gather the data to store for the trial\n let trial_data = {\n end_rt: response.rt,\n end_x: Math.round(x_coords[x_coords.length - 1]),\n end_y: Math.round(y_coords[y_coords.length - 1]),\n x_coords: roundArray(x_coords),\n y_coords: roundArray(y_coords),\n time: time,\n text_bounds: text_bounds,\n };\n\n // remove canvas mouse events\n canvas.removeEventListener('mousemove', mousePosition);\n canvas.removeEventListener('mousedown', mouseResponse);\n\n // clear the display and move on the the next trial\n display_element.innerHTML = '';\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n let trial_data = {\n \"rt\": response.rt,\n \"stimulus\": trial.stimulus,\n \"audio_data\": response.audio_data\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function reask() {\n cb.call(surveyResponse, null, surveyResponse, responseLength);\n }","function count() {\n time--;\n $(\".timer\").text(time);\n if (time <= 0) {\n clearInterval(questionInterval);\n buttonClicked(0);\n // calling the buttonClicked function as if unanswered = wrong.\n }\n }","function wait(){\n $(\"#showAnswer\").hide().empty();\n if(questionCounter<8){\n stepforward();\n \n } else {\n console.log(\"gameover!\");\n finalResults();\n \n }\n}","function nextQuestion() {\n // clean the record\n var allId = [\"A\", \"B\", \"C\", \"D\"];\n for (var i in allId) {\n $(\"#\" + allId[i]).removeClass(\"selected\");\n }\n\n\n // if the answer is right, score pluses 1\n if (right === answer) {\n isRightAnswer();\n }\n\n // increment the number of questions count\n increment(\"#count\", 1);\n\n $(\"#time\").html(\"10\"); // set time to the maximum\n clearInterval(myInterval);\n myInterval = setInterval(timer, 1000); // time click each 1 second\n score(); // show the score and question number\n\n ajax_get_json();\n}","function nextQuestion() {\n questionsIndex++\n console.log(\"click worked!\")\n\n if (questionsIndex === questions.length) {\n endQuiz()\n } else {\n generateQuestion()\n }\n\n}","function doneWeaponsQuestSponsor() {\n\tconsole.log(totalStages);\n\tif(totalStages == 0) {\n\t\t$('body').off('click');\n\t\tdocument.getElementById('doneQuest').style.display = \"inline\";\n\t\tdoneQuestSetup();\n\t\treturn;\n\t}\n\t$('body').off('click');\n\tsetupQuestRound();\n\tdocument.getElementById('doneQuest').style.display = \"none\";\n}","function nextQuestion() {\n resetTime();\n setTimeout(function() {\n clearScreen();\n answersQuestionPrint();\n }, 3000);\n }","function after_response(choice) {\n\n // measure rt\n rating_end_time = Date.now();\n trial.rating_rt = rating_end_time - rating_start_time;\n\n trial.rating = choice;\n\n\n // after a valid response, the stimulus will have the CSS class 'responded'\n // which can be used to provide visual feedback that a response was recorded\n display_element.querySelector('#jspsych-html-button-response-stimulus').className += ' responded';\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\n for(var i=0; i The correct answer is \" + questions[currentQuestionToPlay].correctResponse + \".
Waiting 5 seconds to go next!\");\n\n wrongAnswerCount++;\n $(\"#wrong-answers-view\").html(wrongAnswerCount);\n\n stop();\n waitBeforeGoingNextAutomatically();\n}","function nextQuestion() {\n countDown = 10;\n clearInterval(timer);\n currQuestion++;\n displaymyQuestion();\n\n\n}","function fiveSecondBreak() {\n $(`#answers button[index=${qsAndAs[questionIndex].correctIndexAnswer}]`).removeClass(`btn-outline-dark`).addClass(`btn-success`);\n \n var startdown = 6;\n var intervalId;\n \n if(guesses[questionIndex] == qsAndAs[questionIndex].correctIndexAnswer) {\n score++;\n $('.score').html(`1){\n time--;\n $(\"#question\").text(\"Next round starting in \"+time+\" seconds\");\n } else { \n time--;\n $(\"#question\").text(\"Next round starting in \"+time+\" seconds\");\n clearInterval(timeInterval);\n displayQuestion();\n }\n }, 1000)} else {\n $(\"#timer\").text($(\"#timer\").text()+\" You got \"+correct+\"/10 correct!\")\n $(\"#question\").text(\"Click here to start over!\")\n questionType = -1; \n }\n $(\"#results-text\").text(who+\" is the \"+where+\" for \"+band+\"!\") \n }","function nextPage() {\n setTimeout(function(){\n if (questionCount < (questions.length-1)) {\n number = t;\n questionCount++;\n createQuestionArea();\n createAnswerArea();\n startTimer();\n $('#timer').show(); \n } else {\n createFinalScreen();\n }\n },1000*5);\n}","function questionTimedout() {\n acceptingResponsesFromUser = false;\n\n console.log(\"timeout\");\n $(\"#timer-view\").html(\"- -\");\n $(\".footer\").html(\"Darn! Time out!
The correct answer is \" + questions[currentQuestionToPlay].correctResponse + \".
Waiting 5 seconds to go next!\");\n\n timeoutCount++;\n $(\"#timeout-view\").html(timeoutCount);\n waitBeforeGoingNextAutomatically();\n}","function timeRunsOut() {\n noAnswer++;\n console.log(noAnswer);\n $(\".timer\").hide();\n $(\".question\").empty();\n $(\".answers\").empty();\n $(\".results\").html(\"\" + \"You got \" + correct + \" out of \" + questions.length + \" questions correct!\");\n }\n\n //calls displayQuestions\n stopwatch.stop();\n displayQuestions();\n }","function timeLimit() {\n timer = setInterval(function () {\n $(\"#clock\").css(\"animation\", \"none\");\n $(\"#timer\").text(\"Time left: \" + seconds);\n seconds--;\n\n if (seconds < 5) {\n $(\"#clock\").css(\"animation\", \"pulse 5s infinite\");\n }\n\n if (seconds === -1 && click < questions.length) {\n seconds = 15;\n click++;\n incorrect++;\n clearTimeout(timer);\n showAnswer();\n }\n else if (click === questions.length) {\n displayScore();\n }\n }, 1000);\n }","function chooseFoodQuiz() {\n $(foodQuiz).click();\n questions = foodQuestions;\n finalQuestion = foodQuestions.length - 1;\n startQuiz();\n}","function startSurvey(element){\r\n //Starts timer\r\n setInterval(startTimer, 1000);\r\n //Hides the button you clicked to start the survey\r\n hideStart(element);\r\n //Starts the survey, showing the first question\r\n startQuiz();\r\n}","function quizEnd() {\n /*\n @TODO: write your function code here\n */\n clearInterval(timerId);\n finalScore.textContent= score;\n questionsEl.setAttribute(\"class\", \"hide\");\n choicesEl.setAttribute(\"class\",\"hide\");\n endScreen.removeAttribute(\"class\");\n endScreen.setAttribute(\"style\",\"text-align:center\")\n}","function countDown() {\n timeRemaining--;\n $('#timeCount').text(timeRemaining);\n if (timeRemaining <= 0 && count === 10) {\n clearInterval(time);\n answered.push(\"0\")\n finalScreen();\n } else if (timeRemaining <= 0) {\n clearInterval(time);\n answered.push(\"0\");\n loadingScreen();\n }\n}","function TimeoutNextClickCheck(tot) {\n\tif(IsRadioClick==false) {\n// BMOD: use confirm instead of alert\n//\t\talert(\"You did not click on an answer\");\n//\t\treturn false;\n\t\tif(!confirm(\"Proceed without answer?\")) {\n\t\t\treturn false;\n\t\t}\n\t}\n//\talert(\"new func\");\n\tvar checked = 0;\n\tfor(nn = 0; nn < tot; nn++) {\n\t\tif(document.QuestionForm.pre_answer[nn].checked) {\n\t\t\tdocument.QuestionForm.answer.value = document.QuestionForm.pre_answer[nn].value;\n\t\t\tchecked = 1;\n\t\t}\n//\t\talert(checked + \":\" + document.QuestionForm.pre_answer[nn].value);\n\t}\n\tif(checked == 0) {\n\t\tdocument.QuestionForm.answer.value = document.QuestionForm.timeout_answer.value;\n\t}\n\treturn true;\n}","finishQuestion() {\n this.stoptimer();\n this.allowAnwsers = false;\n this.scorePlayers();\n //show results\n this.generateRoundup().then((state) => {\n this.masters.forEach((socket) => {\n socket.emit('roundup', state);\n });\n });\n\n //nextquestion\n if (this.timer === null) {\n this.timer = setTimeout(() => {\n this.nextQuestion();\n }, 10 * 1000); //after 10s\n }\n }","function handleClick(e){\n Product.current = [];\n Product.click++;\n for(let i = 0; i < Product.all.length; i++){\n if(e.target.alt === Product.all[i].name){\n Product.all[i].timesClick++;\n updateChartArrays();\n }\n }\n runSurvey();\n}","function after_response(choice) {\n\n // measure rt\n var end_time = Date.now();\n var rt = end_time - start_time;\n response.button = choice;\n response.rt = rt;\n\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\n for(var i=0; i
Waiting 5 seconds to go next!\");\n \n stop();\n waitBeforeGoingNextAutomatically();\n\n}","function ansClick(e) {\n if(qIndex >= (questions.length - 1)) {\n postScore();\n } else {\n var currentQuestion = questions[qIndex];\n var ansClick = e.target.textContent;\n if(ansClick.toLowerCase() === currentQuestion.answer.toLowerCase()) {\n currentScore+= 5;\n } else {\n time -= 10;\n currentScore -= 5;\n }\n qIndex++;\n getQuestion();\n };\n}","function nextQuestion() {\n // currentQuestion++\n $(\"#question\").html(test[nextUp].hint);\n $(\"#guess1\").html(test[nextUp].guess1);\n $(\"#guess2\").html(test[nextUp].guess2);\n $(\"#guess3\").html(test[nextUp].guess3);\n $(\"#guess4\").html(test[nextUp].guess4);\n // console.log(nextUp)\n countDown();\n // $('#timeToGo').each(countDown); //starts counter\n anser = (test[nextUp].Answer);\n nextUp++\n // console.log(currentQuestion)\n\n //-------------------------------------------------------------------------------------------------------\n //clicks for answer 1\n}","function end_trial() {\r\n\r\n // kill any remaining setTimeout handlers\r\n for (var i = 0; i < setTimeoutHandlers.length; i++) {\r\n clearTimeout(setTimeoutHandlers[i]);\r\n }\r\n\r\n // gather the data to store for the trial\r\n var trial_data = {\r\n \"rt\": response.rt,\r\n \"stimulus\": trial.stimulus,\r\n \"button_pressed\": response.button\r\n };\r\n\r\n // clear the display\r\n display_element.html('');\r\n\r\n // move on to the next trial\r\n jsPsych.finishTrial(trial_data);\r\n }","function nextQuestion(){\n $(\"#alerts\").hide();\n currentQuestion = triviaQuestions[currentQuestionIndex + 1];\n currentQuestionIndex++;\n if (currentQuestionIndex >= 10) {\n $(\"#alerts\").html(\"
Nice job! Click the Start 90s Trivia button to play again!
Questions Correct: \" + correctAnswers.length + \"
Questions Incorrect: \" + incorrectAnswers.length + \"
\");\n $(\"#alerts\").show();\n stopTimer();\n } else {\n displayQuestion(currentQuestion);\n };\n }","function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"rt\": response.rt,\n \"stimulus\": trial.stimulus,\n \"button_pressed\": response.button\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"rt\": response.rt,\n \"stimulus\": trial.stimulus,\n \"button_pressed\": response.button\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end(){\n\t\tclearTimeout(timerId);\n\t\t$(\"#Time-Remaining\").hide();\n\t\t$(\"#Question\").hide();\n $(\"#score\").show();\n $(\"#score\").text(\"You got \"+ correct +\" out of \"+questions.length+\" correct!\")\n $(\".answer\").hide();\n $(\"#Ready\").show();\n $(\"#retry\").show();\n cQ = 0;\n correct = 0;\n $(\"#Ready\").click(function(){\n\t\t\ttimeLeft = 60\n $(\".answer\").empty();\n $(\"#Question\").empty();\n $(\"#Time-Remaining\").show();\n $(\"#Ready\").hide();\n $(\"#score\").hide();\n $(\"#retry\").hide();\n\t\t\tsetTimeout(Question,500);\n });\n }","function answerClick(x) {\n var answer = questions[questionCounter].answer;\n showAnswer(x == answer);\n if (x !== answer) {\n time -= wrongAnswerPenalty;\n showTime();\n }\n questionCounter ++;\n if (questionCounter < questions.length) {\n getQuestions();\n }\n else {\n showEndScreen();\n }\n}","function end_trial() {\r\n\r\n // kill any remaining setTimeout handlers\r\n jsPsych.pluginAPI.clearAllTimeouts();\r\n\r\n // gather the data to store for the trial\r\n var trial_data = {\r\n \"stimulus\": trial.stimulus,\r\n \"correct\": trial.correct,\r\n \"choice\": response.choice,\r\n \"accuracy\": response.accuracy,\r\n \"rt\": response.rt,\r\n };\r\n\r\n // clear the display\r\n display_element.innerHTML = '';\r\n\r\n // move on to the next trial\r\n jsPsych.finishTrial(trial_data);\r\n }","function lastClicked() { \n // end the quiz and show the score\n console.log(\"last clik func active\");\n clearInterval(timeInterval);\n quiz.style.display = \"none\";\n\n //todo//\n }","function end_trial() {\r\n\r\n // kill any remaining setTimeout handlers\r\n jsPsych.pluginAPI.clearAllTimeouts();\r\n\r\n // gather the data to store for the trial\r\n var trial_data = {\r\n \"rt\": response.rt,\r\n \"stimulus\": trial.stimulus,\r\n \"response\": response.response\r\n };\r\n\r\n // clear the display\r\n display_element.innerHTML = '';\r\n\r\n // move on to the next trial\r\n jsPsych.finishTrial(trial_data);\r\n }","function end_trial() {\n response.rt = performance.now() - start_time;\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(response);\n }","function end_trial() {\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n const trial_data = {\n rt: response.rt,\n stimulus: trial.stimulus,\n button_pressed: response.button,\n switched_queries: response.switched_queries,\n confidence: response.confidence,\n choice: response.choice,\n correct: response.choice == trial.correct_query_choice,\n };\n\n // clear the display\n display_element.innerHTML = \"\";\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n var trial_data = {\n \"stimulus\": trial.stimulus,\n \"rating\": trial.rating,\n \"condition\": trial.condition,\n \"with loading\": trial.cognitive_loading,\n \"rating_rt\": trial.rating_rt,\n \"grid_rt\": trial.grid_rt,\n \"scale type\": trial.scale_type,\n \"correct anser\": trial.correct_answer,\n \"hits\": trial.hits,\n \"misses\": trial.misses,\n \"false alarms\": trial.false_alarms,\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n\n\t\t\tjsPsych.pluginAPI.clearAllTimeouts();\n\t\t\t//Kill the keyboard listener if keyboardListener has been defined\n\t\t\tif (typeof keyboardListener !== 'undefined') {\n\t\t\t\tjsPsych.pluginAPI.cancelKeyboardResponse(keyboardListener);\n\t\t\t}\n\n\t\t\t//Place all the data to be saved from this trial in one data object\n\t\t\tvar trial_data = {\n\t\t\t\t\"rt\": response.rt, //The response time\n\t\t\t\t\"key_press\": response.key, //The key that the subject pressed\n\t\t\t\t\"mean\": trial.mean,\n\t\t\t\t\"sd\": trial.sd,\n\t\t\t\t'left_circles': circles_left,\n\t\t\t\t'right_circles': circles_right,\n\t\t\t\t'larger_magnitude': larger_magnitude,\n\t\t\t\t'left_radius': r1,\n\t\t\t\t'right_radius': r2\n\t\t\t}\n\n\t\t\tif (trial_data.key_press == trial.choices[0] && larger_magnitude == 'left'){\n\t\t\t\ttrial_data.correct = true\n\t\t\t}\n\t\t\telse if (trial_data.key_press == trial.choices[1] && larger_magnitude == 'right'){\n\t\t\t\ttrial_data.correct = true\n\t\t\t}\n\t\t\telse if (trial_data.key_press == -1 ){\n\t\t\t\ttrial_data.correct = null\n\t\t\t}\n\t\t\telse{\n\t\t\t\ttrial_data.correct = false\n\t\t\t}\n\n\n\t\t\t//Remove the canvas as the child of the display_element element\n\t\t\tdisplay_element.innerHTML='';\n\n\t\t\t//Restore the settings to JsPsych defaults\n\t\t\tbody.style.margin = originalMargin;\n\t\t\tbody.style.padding = originalPadding;\n\t\t\tbody.style.backgroundColor = originalBackgroundColor\n\t\t\tbody.style.cursor = originalCursorType\n\n\t\t\tjsPsych.finishTrial(trial_data); //End this trial and move on to the next trial\n\n\t\t}","function nextQuestion(){\t\n\t\thideAnswerBox();\n\t\tremovePosters();\n\t\tstopAudio();\n\t\tquestionCount++;\n\t\t\n\t\tif (questionCount > 9) {\n\t\t\tendGame();\n\t\t\tshowOverlay($('.endGame'));\n\t\t}\n\t\telse if (questionCount > 4 && gameCount < 1) {\n\t\t\tendRound();\n\t\t\tshowOverlay($('.end_round'));\n\t\t}\n\t\telse {\n\t\t\tupdateQuestion();\n\t\t\tplayAudio();\n\t\t}\n\t}","function nextQuestions() {\n number++;\n count = 30;\n timeRemain = setInterval(timer, 1000);\n $(\"#timer\").html(\"Time remaining: \" + count + \" secs\");\n questions(number);\n $(\"#image\").hide();\n }","function end_trial() {\n 'use strict';\n\n // gather the data to store for the trial\n let trial_data = {\n end_rt: response.rt,\n end_x: Math.round(x_coords[x_coords.length - 1]),\n end_y: Math.round(y_coords[y_coords.length - 1]),\n x_coords: roundArray(x_coords),\n y_coords: roundArray(y_coords),\n time: time,\n text_bounds: text_bounds,\n };\n\n // remove canvas mouse events\n canvas.removeEventListener('mousemove', mousePosition);\n canvas.removeEventListener('mousedown', mouseResponse);\n\n // clear the display and move on the the next trial\n display_element.innerHTML = '';\n jsPsych.finishTrial(trial_data);\n }","function end_trial() {\n // kill any remaining setTimeout handlers\n jsPsych.pluginAPI.clearAllTimeouts();\n\n // gather the data to store for the trial\n let trial_data = {\n \"rt\": response.rt,\n \"stimulus\": trial.stimulus,\n \"audio_data\": response.audio_data\n };\n\n // clear the display\n display_element.innerHTML = '';\n\n // move on to the next trial\n jsPsych.finishTrial(trial_data);\n }","function reask() {\n cb.call(surveyResponse, null, surveyResponse, responseLength);\n }","function count() {\n time--;\n $(\".timer\").text(time);\n if (time <= 0) {\n clearInterval(questionInterval);\n buttonClicked(0);\n // calling the buttonClicked function as if unanswered = wrong.\n }\n }","function wait(){\n $(\"#showAnswer\").hide().empty();\n if(questionCounter<8){\n stepforward();\n \n } else {\n console.log(\"gameover!\");\n finalResults();\n \n }\n}","function nextQuestion() {\n // clean the record\n var allId = [\"A\", \"B\", \"C\", \"D\"];\n for (var i in allId) {\n $(\"#\" + allId[i]).removeClass(\"selected\");\n }\n\n\n // if the answer is right, score pluses 1\n if (right === answer) {\n isRightAnswer();\n }\n\n // increment the number of questions count\n increment(\"#count\", 1);\n\n $(\"#time\").html(\"10\"); // set time to the maximum\n clearInterval(myInterval);\n myInterval = setInterval(timer, 1000); // time click each 1 second\n score(); // show the score and question number\n\n ajax_get_json();\n}","function nextQuestion() {\n questionsIndex++\n console.log(\"click worked!\")\n\n if (questionsIndex === questions.length) {\n endQuiz()\n } else {\n generateQuestion()\n }\n\n}","function doneWeaponsQuestSponsor() {\n\tconsole.log(totalStages);\n\tif(totalStages == 0) {\n\t\t$('body').off('click');\n\t\tdocument.getElementById('doneQuest').style.display = \"inline\";\n\t\tdoneQuestSetup();\n\t\treturn;\n\t}\n\t$('body').off('click');\n\tsetupQuestRound();\n\tdocument.getElementById('doneQuest').style.display = \"none\";\n}","function nextQuestion() {\n resetTime();\n setTimeout(function() {\n clearScreen();\n answersQuestionPrint();\n }, 3000);\n }","function after_response(choice) {\n\n // measure rt\n rating_end_time = Date.now();\n trial.rating_rt = rating_end_time - rating_start_time;\n\n trial.rating = choice;\n\n\n // after a valid response, the stimulus will have the CSS class 'responded'\n // which can be used to provide visual feedback that a response was recorded\n display_element.querySelector('#jspsych-html-button-response-stimulus').className += ' responded';\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\n for(var i=0; iWaiting 5 seconds to go next!\");\n\n wrongAnswerCount++;\n $(\"#wrong-answers-view\").html(wrongAnswerCount);\n\n stop();\n waitBeforeGoingNextAutomatically();\n}","function nextQuestion() {\n countDown = 10;\n clearInterval(timer);\n currQuestion++;\n displaymyQuestion();\n\n\n}","function fiveSecondBreak() {\n $(`#answers button[index=${qsAndAs[questionIndex].correctIndexAnswer}]`).removeClass(`btn-outline-dark`).addClass(`btn-success`);\n \n var startdown = 6;\n var intervalId;\n \n if(guesses[questionIndex] == qsAndAs[questionIndex].correctIndexAnswer) {\n score++;\n $('.score').html(`
Correct Answers: ${score}
`)\n }else{\n $(`#answers button[index=${guesses[questionIndex]}]`).removeClass(`btn-outline-dark`).addClass(`btn-danger`);\n $('.score').html(`Correct Answers: ${score}
`)\n }\n \n function lilBreak() {\n clearInterval(intervalId);\n intervalId = setInterval(decrement, 1000);\n }\n function decrement() {\n startdown--;\n console.log(\"QIndex : \" + (parseInt(questionIndex) + 2));\n console.log(\"qsAndAs.length: \" + qsAndAs.length); \n console.log((parseInt(questionIndex) + 2) === qsAndAs.length);\n if((parseInt(questionIndex) + 2) < qsAndAs.length){\n $('.next').html(`Next question in ${startdown}
`);\n }if((parseInt(questionIndex) + 2) === qsAndAs.length){\n $('.next').html(`Last question in ${startdown}
`);\n }if((parseInt(questionIndex) + 1) === qsAndAs.length){\n $('.next').html(`Trivia Game Over - Calculating...
`);\n }if (startdown === 0) {\n breaksOver(); \n } \n }\n function breaksOver() {\n clearInterval(intervalId);\n questionIndex += 1;\n $('.next').text(``);\n $(`button.answer`).removeClass(`btn-success btn-danger`).addClass(`btn-outline-dark`);\n if(questionIndex >= qsAndAs.length) {\n gameOver();\n clearInterval(intervalId);\n }else{\n start();\n } \n }\n lilBreak();\n}","function checkEndGame() {\n if (questionNum == 15) {\n clearInterval(countDown);\n $('#sectionQuestions').addClass('hidden');\n $('#sectionResults').removeClass('hidden');\n $('#feedback').html('Game Over!!');\n $('#feedbackDetail').html(\"You got \" + correctCounter + \" questions right, \" + incorrectCounter + \" questions wrong, and didn't answer \" + timeoutCounter + \" questions at all.\");\n };\n }","function endQuiz() {\n //calculate final score\n score = Math.max((timer * 10).toFixed(), 0);\n timer = 0;\n $timer.text(\"Timer: \" + timer.toFixed(1));\n //stop the timer\n clearInterval(interval);\n //write the end message, buttons, and scores\n setEndDOM();\n }","function after_response(choice) {\n\n // measure rt\n var end_time = Date.now();\n var rt = end_time - start_time;\n response.button = choice;\n response.rt = rt;\n\n // after a valid response, the stimulus will have the CSS class 'responded'\n // which can be used to provide visual feedback that a response was recorded\n display_element.querySelector('#jspsych-html-click-stimulus').className += ' responded';\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.jspsych-html-click-button button');\n for(var i=0; iThe correct answer is \" + questions[currentQuestionToPlay].correctResponse + \".
Waiting 5 seconds to go next!\");\n\n timeoutCount++;\n $(\"#timeout-view\").html(timeoutCount);\n waitBeforeGoingNextAutomatically();\n}","function timeRunsOut() {\n noAnswer++;\n console.log(noAnswer);\n $(\".timer\").hide();\n $(\".question\").empty();\n $(\".answers\").empty();\n $(\".results\").html(\"\" + \"
You got \" + correct + \" out of \" + questions.length + \" questions correct!\");\n }\n\n //calls displayQuestions\n stopwatch.stop();\n displayQuestions();\n }","function timeLimit() {\n timer = setInterval(function () {\n $(\"#clock\").css(\"animation\", \"none\");\n $(\"#timer\").text(\"Time left: \" + seconds);\n seconds--;\n\n if (seconds < 5) {\n $(\"#clock\").css(\"animation\", \"pulse 5s infinite\");\n }\n\n if (seconds === -1 && click < questions.length) {\n seconds = 15;\n click++;\n incorrect++;\n clearTimeout(timer);\n showAnswer();\n }\n else if (click === questions.length) {\n displayScore();\n }\n }, 1000);\n }","function chooseFoodQuiz() {\n $(foodQuiz).click();\n questions = foodQuestions;\n finalQuestion = foodQuestions.length - 1;\n startQuiz();\n}","function startSurvey(element){\r\n //Starts timer\r\n setInterval(startTimer, 1000);\r\n //Hides the button you clicked to start the survey\r\n hideStart(element);\r\n //Starts the survey, showing the first question\r\n startQuiz();\r\n}","function quizEnd() {\n /*\n @TODO: write your function code here\n */\n clearInterval(timerId);\n finalScore.textContent= score;\n questionsEl.setAttribute(\"class\", \"hide\");\n choicesEl.setAttribute(\"class\",\"hide\");\n endScreen.removeAttribute(\"class\");\n endScreen.setAttribute(\"style\",\"text-align:center\")\n}","function countDown() {\n timeRemaining--;\n $('#timeCount').text(timeRemaining);\n if (timeRemaining <= 0 && count === 10) {\n clearInterval(time);\n answered.push(\"0\")\n finalScreen();\n } else if (timeRemaining <= 0) {\n clearInterval(time);\n answered.push(\"0\");\n loadingScreen();\n }\n}","function TimeoutNextClickCheck(tot) {\n\tif(IsRadioClick==false) {\n// BMOD: use confirm instead of alert\n//\t\talert(\"You did not click on an answer\");\n//\t\treturn false;\n\t\tif(!confirm(\"Proceed without answer?\")) {\n\t\t\treturn false;\n\t\t}\n\t}\n//\talert(\"new func\");\n\tvar checked = 0;\n\tfor(nn = 0; nn < tot; nn++) {\n\t\tif(document.QuestionForm.pre_answer[nn].checked) {\n\t\t\tdocument.QuestionForm.answer.value = document.QuestionForm.pre_answer[nn].value;\n\t\t\tchecked = 1;\n\t\t}\n//\t\talert(checked + \":\" + document.QuestionForm.pre_answer[nn].value);\n\t}\n\tif(checked == 0) {\n\t\tdocument.QuestionForm.answer.value = document.QuestionForm.timeout_answer.value;\n\t}\n\treturn true;\n}","finishQuestion() {\n this.stoptimer();\n this.allowAnwsers = false;\n this.scorePlayers();\n //show results\n this.generateRoundup().then((state) => {\n this.masters.forEach((socket) => {\n socket.emit('roundup', state);\n });\n });\n\n //nextquestion\n if (this.timer === null) {\n this.timer = setTimeout(() => {\n this.nextQuestion();\n }, 10 * 1000); //after 10s\n }\n }","function handleClick(e){\n Product.current = [];\n Product.click++;\n for(let i = 0; i < Product.all.length; i++){\n if(e.target.alt === Product.all[i].name){\n Product.all[i].timesClick++;\n updateChartArrays();\n }\n }\n runSurvey();\n}","function after_response(choice) {\n\n // measure rt\n var end_time = Date.now();\n var rt = end_time - start_time;\n response.button = choice;\n response.rt = rt;\n\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\n for(var i=0; iCorrect: \" + correct + \"Wrong: \" + incorrect + \"
Trivia written by Glen Weldon for NPR podcast 'Pop Culture Happy Hour.' Weldon is the author of 'The Caped Crusade: Batman and the Rise of Nerd Culture.'
\");\n\t\t$(\".choice\").hide();\n\t\t$(\"#startBtn\").show();\n\t}\n\t}","function endTracking() {\n tryingToTrack = false;\n timeCounter = 0;\n\n $(\"#stopTrackingMe\").css({\n \"display\": \"none\"\n });\n $(\"#extendTrackingMe\").css({\n \"display\": \"none\"\n });\n $(\"#extendTrackingMe\").on('click', () => {\n alert(\"Timer set to 30 mins\")\n });\n $(\"#startTrackingMe\").css({\n \"display\": \"inline-block\"\n });\n }","function nextQuestion() {\n if (questionCounter < questions.length) {\n time = 15;\n $(\"#gameScreen\").html(\"You have \" + time + \" seconds left!
\");\n questionContent();\n timer();\n userTimeout();\n }\n else {\n resultsScreen();\n }\n\n }","function nextQuestion() {\n\t\tif (questionCounter < questions.length) {\n\t\t\ttime = 15;\n\t\t\t$(\".gameScreen\").html(\"You have \" + time + \" seconds left!
\");\n\t\t\tquestionContent();\n\t\t\ttimer();\n\t\t\ttimesUp();\n\t\t}\n\t\telse {\n\t\t\tresultsScreen();\n\t\t}\n\t}","function goToLastQuestion(){ \r\n\tcount--\r\n\tupdateItems();\r\n}","function nextQuestion(event) {\n\n\n // condition uses click event to add to user score if correct ansser is made //\n if (event.target.value === questions[currentQuesIndex].correctAns) {\n score++;\n } else {\n time -= 5;\n counter.textContent = time + \" Seconds left on quiz.\";\n }\n\n\n\n // Condition executes next question\n if (currentQuesIndex < questions.length) {\n currentQuesIndex++;\n // moves to next section once condition is met\n } if (currentQuesIndex === questions.length) {\n\n quizEl.style.display = \"none\";\n // this function call takes user to results section\n quizResults();\n return;\n\n }\n showQuestion();\n}","function nextQuestion() {\n if (questionCounter < questions.length)\n { time = 10;\n $(\"#gameScreen\").html(\" You have \" + time + \n \" seconds left!
\");\n questionContent();\n timer();\n userTimeout();\n \n }\n \n else {\n resultsScreen();\n }\n\t}","function incorrect() {\n timeLeft -=20;\n nextQuestion();\n}","function tally() {\r\n alert('You are have reached the end of the game! Your answers gave you a cool rating of: ' + correct);\r\n alert('Explore the rest of the page to check out more about me that wasn\\'t included in the game!');\r\n\r\n }","function checkGameEnd() {\n if(count === question.length) {\n $(\"#time-holder\").hide();\n showResults();\n count = 0;\n $(\".start\").show();\n $(\".start\").on(\"click\", function() {\n resetResults();\n startGame();\n });\n }\n }","function checkGameEnd() {\n if(count === question.length) {\n $(\"#time-holder\").hide();\n showResults();\n count = 0;\n $(\".start\").show();\n $(\".start\").on(\"click\", function() {\n resetResults();\n startGame();\n });\n }\n }","function after_response(choice) {\n\n // measure rt\n var end_time = Date.now();\n var rt = end_time - start_time;\n response.choice = data.prompt_type == \"count\" ? parseInt(choice) : choice;\n response.rt = rt;\n\n // after a valid response, the stimulus will have the CSS class 'responded'\n // which can be used to provide visual feedback that a response was recorded\n display_element.querySelector('#scene-stimulus').className += ' responded';\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.scene-choice-button button');\n for(var i=0; i {\r\n if (indexNumber <= 9) {\r\n NextQuestion(indexNumber)\r\n }\r\n else {\r\n handleEndGame()\r\n }\r\n resetOptionBackground()\r\n\t\t\r\n }, 1000);\r\n\t\r\n\t\r\n}","function collectedDone() { //Collection of functions meant to run when you press the Done-button in the quiz.\n correctAnswers();\n roundsPlayed();\n collectedRights();\n collectedWrongs()\n correctPercentage();\n controlChildrenTabIndexMinus() \n}","function askNextQuestion(){ \n $('.questions').on('click', '.submit-next', function(){\n currentQuestion++; \n if (currentQuestion > QUESTIONS.length-1){\n showFinalResult();\n }else{\n console.log('next question asked');\n resetOptions();\n renderQuestion();\n updateProgress();\n $('.submit-answer').removeClass('hidden');\n $('.submit-next').addClass('hidden');\n } \n });\n}","function checkGameEnd() {\n if (count === question.length) {\n $(\"#time-holder\").hide();\n showResults();\n count = 0;\n $(\".start\").show();\n $(\".start\").on(\"click\", function () {\n resetResults();\n startGame();\n });\n }\n }","function wait() {\n\tif (questionCounter < 7) {\n\tquestionCounter++;\n\tgenerateHTML();\n\tcounter = 30;\n\ttimerWrapper();\n\t}\n\telse {\n\t\tfinalScreen();\n\t}\n}","function timingQuestion() {\n \n displayQuestionAndListenForInput();\n\n\n if (count == questionArr.length + 1) {\n clearInterval(intervalid);\n clearInterval(timeIntervalID);\n $(\"#timer-id\").empty();\n $(\"main\").empty();\n\n \n $(\"main\").append(\"Correct Answers: \" + correctAnswer + \"
\");\n $(\"main\").append(\"Wrong Answers: \" + wrongAnswer + \"
\");\n $(\"main\").append(\"Missed Answers: \" + missedAnswer + \"
\");\n\n time = 30;\n clicked = false;\n count =0;\n correctAnswer = 0;\n wrongAnswer = 0;\n missedAnswer = 0;\n\n $(\"main\").append(\"\");\n $(\"#start-button\").on(\"click\", timingQuestion);\n }\n }","function correctAnswer(){\n $(\"#timer\").text(\"You are correct!\"); \n if (clickCount == 0) {\n correct++;\n }; \n clickCount++; //used to prevent multiple clicks adding to the total amount\n clearInterval(timeInterval); \n roundEnd();\n $(\"button\").remove(); //used to remove previous events from existing buttons\n $(\"#choice-container\").html('')\n }"],"string":"[\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"rt\\\": Math.round(performance.now() - trial_onset),\\n \\\"digit_response\\\": digit_response,\\n 'click_history': click_history\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n if (trial.post_trial_duration !== null) {\\n jsPsych.pluginAPI.setTimeout(function () {\\n jsPsych.finishTrial(trial_data);\\n }, trial.post_trial_duration);\\n } else {\\n jsPsych.finishTrial(trial_data);\\n }\\n\\n }\",\n \"function click() {\\r\\n console.log(questions[questionIndex].answer)\\r\\n console.log(this.value)\\r\\nif(this.value !== questions[questionIndex].answer) {\\r\\n time -= 5;\\r\\n\\r\\n if (time < 0) {\\r\\n time = 0;\\r\\n }\\r\\n}\\r\\n\\r\\n$(\\\"#time-counter\\\").text(time);\\r\\n\\r\\nquestionIndex++;\\r\\nif(questionIndex === questions.length) {\\r\\n finish();\\r\\n} else {\\r\\nstartQuestions();\\r\\n}}\",\n \"function correctAnswerClicked() {\\n console.log(\\\"correct answer\\\");\\n correctAnswerCount++;\\n $(\\\"#correct-answers-view\\\").html(correctAnswerCount);\\n $(\\\".footer\\\").html(\\\"Correct!!!
Waiting 5 seconds to go next!\\\");\\n \\n stop();\\n waitBeforeGoingNextAutomatically();\\n\\n}\",\n \"function ansClick(e) {\\n if(qIndex >= (questions.length - 1)) {\\n postScore();\\n } else {\\n var currentQuestion = questions[qIndex];\\n var ansClick = e.target.textContent;\\n if(ansClick.toLowerCase() === currentQuestion.answer.toLowerCase()) {\\n currentScore+= 5;\\n } else {\\n time -= 10;\\n currentScore -= 5;\\n }\\n qIndex++;\\n getQuestion();\\n };\\n}\",\n \"function nextQuestion() {\\n // currentQuestion++\\n $(\\\"#question\\\").html(test[nextUp].hint);\\n $(\\\"#guess1\\\").html(test[nextUp].guess1);\\n $(\\\"#guess2\\\").html(test[nextUp].guess2);\\n $(\\\"#guess3\\\").html(test[nextUp].guess3);\\n $(\\\"#guess4\\\").html(test[nextUp].guess4);\\n // console.log(nextUp)\\n countDown();\\n // $('#timeToGo').each(countDown); //starts counter\\n anser = (test[nextUp].Answer);\\n nextUp++\\n // console.log(currentQuestion)\\n\\n //-------------------------------------------------------------------------------------------------------\\n //clicks for answer 1\\n}\",\n \"function end_trial() {\\r\\n\\r\\n // kill any remaining setTimeout handlers\\r\\n for (var i = 0; i < setTimeoutHandlers.length; i++) {\\r\\n clearTimeout(setTimeoutHandlers[i]);\\r\\n }\\r\\n\\r\\n // gather the data to store for the trial\\r\\n var trial_data = {\\r\\n \\\"rt\\\": response.rt,\\r\\n \\\"stimulus\\\": trial.stimulus,\\r\\n \\\"button_pressed\\\": response.button\\r\\n };\\r\\n\\r\\n // clear the display\\r\\n display_element.html('');\\r\\n\\r\\n // move on to the next trial\\r\\n jsPsych.finishTrial(trial_data);\\r\\n }\",\n \"function nextQuestion(){\\n $(\\\"#alerts\\\").hide();\\n currentQuestion = triviaQuestions[currentQuestionIndex + 1];\\n currentQuestionIndex++;\\n if (currentQuestionIndex >= 10) {\\n $(\\\"#alerts\\\").html(\\\" Nice job! Click the Start 90s Trivia button to play again!
Questions Correct: \\\" + correctAnswers.length + \\\"
Questions Incorrect: \\\" + incorrectAnswers.length + \\\"
\\\");\\n $(\\\"#alerts\\\").show();\\n stopTimer();\\n } else {\\n displayQuestion(currentQuestion);\\n };\\n }\",\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"rt\\\": response.rt,\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"button_pressed\\\": response.button\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"rt\\\": response.rt,\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"button_pressed\\\": response.button\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end(){\\n\\t\\tclearTimeout(timerId);\\n\\t\\t$(\\\"#Time-Remaining\\\").hide();\\n\\t\\t$(\\\"#Question\\\").hide();\\n $(\\\"#score\\\").show();\\n $(\\\"#score\\\").text(\\\"You got \\\"+ correct +\\\" out of \\\"+questions.length+\\\" correct!\\\")\\n $(\\\".answer\\\").hide();\\n $(\\\"#Ready\\\").show();\\n $(\\\"#retry\\\").show();\\n cQ = 0;\\n correct = 0;\\n $(\\\"#Ready\\\").click(function(){\\n\\t\\t\\ttimeLeft = 60\\n $(\\\".answer\\\").empty();\\n $(\\\"#Question\\\").empty();\\n $(\\\"#Time-Remaining\\\").show();\\n $(\\\"#Ready\\\").hide();\\n $(\\\"#score\\\").hide();\\n $(\\\"#retry\\\").hide();\\n\\t\\t\\tsetTimeout(Question,500);\\n });\\n }\",\n \"function answerClick(x) {\\n var answer = questions[questionCounter].answer;\\n showAnswer(x == answer);\\n if (x !== answer) {\\n time -= wrongAnswerPenalty;\\n showTime();\\n }\\n questionCounter ++;\\n if (questionCounter < questions.length) {\\n getQuestions();\\n }\\n else {\\n showEndScreen();\\n }\\n}\",\n \"function end_trial() {\\r\\n\\r\\n // kill any remaining setTimeout handlers\\r\\n jsPsych.pluginAPI.clearAllTimeouts();\\r\\n\\r\\n // gather the data to store for the trial\\r\\n var trial_data = {\\r\\n \\\"stimulus\\\": trial.stimulus,\\r\\n \\\"correct\\\": trial.correct,\\r\\n \\\"choice\\\": response.choice,\\r\\n \\\"accuracy\\\": response.accuracy,\\r\\n \\\"rt\\\": response.rt,\\r\\n };\\r\\n\\r\\n // clear the display\\r\\n display_element.innerHTML = '';\\r\\n\\r\\n // move on to the next trial\\r\\n jsPsych.finishTrial(trial_data);\\r\\n }\",\n \"function lastClicked() { \\n // end the quiz and show the score\\n console.log(\\\"last clik func active\\\");\\n clearInterval(timeInterval);\\n quiz.style.display = \\\"none\\\";\\n\\n //todo//\\n }\",\n \"function end_trial() {\\r\\n\\r\\n // kill any remaining setTimeout handlers\\r\\n jsPsych.pluginAPI.clearAllTimeouts();\\r\\n\\r\\n // gather the data to store for the trial\\r\\n var trial_data = {\\r\\n \\\"rt\\\": response.rt,\\r\\n \\\"stimulus\\\": trial.stimulus,\\r\\n \\\"response\\\": response.response\\r\\n };\\r\\n\\r\\n // clear the display\\r\\n display_element.innerHTML = '';\\r\\n\\r\\n // move on to the next trial\\r\\n jsPsych.finishTrial(trial_data);\\r\\n }\",\n \"function end_trial() {\\n response.rt = performance.now() - start_time;\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(response);\\n }\",\n \"function end_trial() {\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n const trial_data = {\\n rt: response.rt,\\n stimulus: trial.stimulus,\\n button_pressed: response.button,\\n switched_queries: response.switched_queries,\\n confidence: response.confidence,\\n choice: response.choice,\\n correct: response.choice == trial.correct_query_choice,\\n };\\n\\n // clear the display\\n display_element.innerHTML = \\\"\\\";\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"rating\\\": trial.rating,\\n \\\"condition\\\": trial.condition,\\n \\\"with loading\\\": trial.cognitive_loading,\\n \\\"rating_rt\\\": trial.rating_rt,\\n \\\"grid_rt\\\": trial.grid_rt,\\n \\\"scale type\\\": trial.scale_type,\\n \\\"correct anser\\\": trial.correct_answer,\\n \\\"hits\\\": trial.hits,\\n \\\"misses\\\": trial.misses,\\n \\\"false alarms\\\": trial.false_alarms,\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n\\n\\t\\t\\tjsPsych.pluginAPI.clearAllTimeouts();\\n\\t\\t\\t//Kill the keyboard listener if keyboardListener has been defined\\n\\t\\t\\tif (typeof keyboardListener !== 'undefined') {\\n\\t\\t\\t\\tjsPsych.pluginAPI.cancelKeyboardResponse(keyboardListener);\\n\\t\\t\\t}\\n\\n\\t\\t\\t//Place all the data to be saved from this trial in one data object\\n\\t\\t\\tvar trial_data = {\\n\\t\\t\\t\\t\\\"rt\\\": response.rt, //The response time\\n\\t\\t\\t\\t\\\"key_press\\\": response.key, //The key that the subject pressed\\n\\t\\t\\t\\t\\\"mean\\\": trial.mean,\\n\\t\\t\\t\\t\\\"sd\\\": trial.sd,\\n\\t\\t\\t\\t'left_circles': circles_left,\\n\\t\\t\\t\\t'right_circles': circles_right,\\n\\t\\t\\t\\t'larger_magnitude': larger_magnitude,\\n\\t\\t\\t\\t'left_radius': r1,\\n\\t\\t\\t\\t'right_radius': r2\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (trial_data.key_press == trial.choices[0] && larger_magnitude == 'left'){\\n\\t\\t\\t\\ttrial_data.correct = true\\n\\t\\t\\t}\\n\\t\\t\\telse if (trial_data.key_press == trial.choices[1] && larger_magnitude == 'right'){\\n\\t\\t\\t\\ttrial_data.correct = true\\n\\t\\t\\t}\\n\\t\\t\\telse if (trial_data.key_press == -1 ){\\n\\t\\t\\t\\ttrial_data.correct = null\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\ttrial_data.correct = false\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\t//Remove the canvas as the child of the display_element element\\n\\t\\t\\tdisplay_element.innerHTML='';\\n\\n\\t\\t\\t//Restore the settings to JsPsych defaults\\n\\t\\t\\tbody.style.margin = originalMargin;\\n\\t\\t\\tbody.style.padding = originalPadding;\\n\\t\\t\\tbody.style.backgroundColor = originalBackgroundColor\\n\\t\\t\\tbody.style.cursor = originalCursorType\\n\\n\\t\\t\\tjsPsych.finishTrial(trial_data); //End this trial and move on to the next trial\\n\\n\\t\\t}\",\n \"function nextQuestion(){\\t\\n\\t\\thideAnswerBox();\\n\\t\\tremovePosters();\\n\\t\\tstopAudio();\\n\\t\\tquestionCount++;\\n\\t\\t\\n\\t\\tif (questionCount > 9) {\\n\\t\\t\\tendGame();\\n\\t\\t\\tshowOverlay($('.endGame'));\\n\\t\\t}\\n\\t\\telse if (questionCount > 4 && gameCount < 1) {\\n\\t\\t\\tendRound();\\n\\t\\t\\tshowOverlay($('.end_round'));\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tupdateQuestion();\\n\\t\\t\\tplayAudio();\\n\\t\\t}\\n\\t}\",\n \"function nextQuestions() {\\n number++;\\n count = 30;\\n timeRemain = setInterval(timer, 1000);\\n $(\\\"#timer\\\").html(\\\"Time remaining: \\\" + count + \\\" secs\\\");\\n questions(number);\\n $(\\\"#image\\\").hide();\\n }\",\n \"function end_trial() {\\n 'use strict';\\n\\n // gather the data to store for the trial\\n let trial_data = {\\n end_rt: response.rt,\\n end_x: Math.round(x_coords[x_coords.length - 1]),\\n end_y: Math.round(y_coords[y_coords.length - 1]),\\n x_coords: roundArray(x_coords),\\n y_coords: roundArray(y_coords),\\n time: time,\\n text_bounds: text_bounds,\\n };\\n\\n // remove canvas mouse events\\n canvas.removeEventListener('mousemove', mousePosition);\\n canvas.removeEventListener('mousedown', mouseResponse);\\n\\n // clear the display and move on the the next trial\\n display_element.innerHTML = '';\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n let trial_data = {\\n \\\"rt\\\": response.rt,\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"audio_data\\\": response.audio_data\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function reask() {\\n cb.call(surveyResponse, null, surveyResponse, responseLength);\\n }\",\n \"function count() {\\n time--;\\n $(\\\".timer\\\").text(time);\\n if (time <= 0) {\\n clearInterval(questionInterval);\\n buttonClicked(0);\\n // calling the buttonClicked function as if unanswered = wrong.\\n }\\n }\",\n \"function wait(){\\n $(\\\"#showAnswer\\\").hide().empty();\\n if(questionCounter<8){\\n stepforward();\\n \\n } else {\\n console.log(\\\"gameover!\\\");\\n finalResults();\\n \\n }\\n}\",\n \"function nextQuestion() {\\n // clean the record\\n var allId = [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\"];\\n for (var i in allId) {\\n $(\\\"#\\\" + allId[i]).removeClass(\\\"selected\\\");\\n }\\n\\n\\n // if the answer is right, score pluses 1\\n if (right === answer) {\\n isRightAnswer();\\n }\\n\\n // increment the number of questions count\\n increment(\\\"#count\\\", 1);\\n\\n $(\\\"#time\\\").html(\\\"10\\\"); // set time to the maximum\\n clearInterval(myInterval);\\n myInterval = setInterval(timer, 1000); // time click each 1 second\\n score(); // show the score and question number\\n\\n ajax_get_json();\\n}\",\n \"function nextQuestion() {\\n questionsIndex++\\n console.log(\\\"click worked!\\\")\\n\\n if (questionsIndex === questions.length) {\\n endQuiz()\\n } else {\\n generateQuestion()\\n }\\n\\n}\",\n \"function doneWeaponsQuestSponsor() {\\n\\tconsole.log(totalStages);\\n\\tif(totalStages == 0) {\\n\\t\\t$('body').off('click');\\n\\t\\tdocument.getElementById('doneQuest').style.display = \\\"inline\\\";\\n\\t\\tdoneQuestSetup();\\n\\t\\treturn;\\n\\t}\\n\\t$('body').off('click');\\n\\tsetupQuestRound();\\n\\tdocument.getElementById('doneQuest').style.display = \\\"none\\\";\\n}\",\n \"function nextQuestion() {\\n resetTime();\\n setTimeout(function() {\\n clearScreen();\\n answersQuestionPrint();\\n }, 3000);\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n rating_end_time = Date.now();\\n trial.rating_rt = rating_end_time - rating_start_time;\\n\\n trial.rating = choice;\\n\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#jspsych-html-button-response-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\\n for(var i=0; i The correct answer is \\\" + questions[currentQuestionToPlay].correctResponse + \\\".
Waiting 5 seconds to go next!\\\");\\n\\n wrongAnswerCount++;\\n $(\\\"#wrong-answers-view\\\").html(wrongAnswerCount);\\n\\n stop();\\n waitBeforeGoingNextAutomatically();\\n}\",\n \"function nextQuestion() {\\n countDown = 10;\\n clearInterval(timer);\\n currQuestion++;\\n displaymyQuestion();\\n\\n\\n}\",\n \"function fiveSecondBreak() {\\n $(`#answers button[index=${qsAndAs[questionIndex].correctIndexAnswer}]`).removeClass(`btn-outline-dark`).addClass(`btn-success`);\\n \\n var startdown = 6;\\n var intervalId;\\n \\n if(guesses[questionIndex] == qsAndAs[questionIndex].correctIndexAnswer) {\\n score++;\\n $('.score').html(`Correct Answers: ${score}
`)\\n }else{\\n $(`#answers button[index=${guesses[questionIndex]}]`).removeClass(`btn-outline-dark`).addClass(`btn-danger`);\\n $('.score').html(`Correct Answers: ${score}
`)\\n }\\n \\n function lilBreak() {\\n clearInterval(intervalId);\\n intervalId = setInterval(decrement, 1000);\\n }\\n function decrement() {\\n startdown--;\\n console.log(\\\"QIndex : \\\" + (parseInt(questionIndex) + 2));\\n console.log(\\\"qsAndAs.length: \\\" + qsAndAs.length); \\n console.log((parseInt(questionIndex) + 2) === qsAndAs.length);\\n if((parseInt(questionIndex) + 2) < qsAndAs.length){\\n $('.next').html(`Next question in ${startdown}
`);\\n }if((parseInt(questionIndex) + 2) === qsAndAs.length){\\n $('.next').html(`Last question in ${startdown}
`);\\n }if((parseInt(questionIndex) + 1) === qsAndAs.length){\\n $('.next').html(`Trivia Game Over - Calculating...
`);\\n }if (startdown === 0) {\\n breaksOver(); \\n } \\n }\\n function breaksOver() {\\n clearInterval(intervalId);\\n questionIndex += 1;\\n $('.next').text(``);\\n $(`button.answer`).removeClass(`btn-success btn-danger`).addClass(`btn-outline-dark`);\\n if(questionIndex >= qsAndAs.length) {\\n gameOver();\\n clearInterval(intervalId);\\n }else{\\n start();\\n } \\n }\\n lilBreak();\\n}\",\n \"function checkEndGame() {\\n if (questionNum == 15) {\\n clearInterval(countDown);\\n $('#sectionQuestions').addClass('hidden');\\n $('#sectionResults').removeClass('hidden');\\n $('#feedback').html('Game Over!!');\\n $('#feedbackDetail').html(\\\"You got \\\" + correctCounter + \\\" questions right, \\\" + incorrectCounter + \\\" questions wrong, and didn't answer \\\" + timeoutCounter + \\\" questions at all.\\\");\\n };\\n }\",\n \"function endQuiz() {\\n //calculate final score\\n score = Math.max((timer * 10).toFixed(), 0);\\n timer = 0;\\n $timer.text(\\\"Timer: \\\" + timer.toFixed(1));\\n //stop the timer\\n clearInterval(interval);\\n //write the end message, buttons, and scores\\n setEndDOM();\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.button = choice;\\n response.rt = rt;\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#jspsych-html-click-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.jspsych-html-click-button button');\\n for(var i=0; i1){\\n time--;\\n $(\\\"#question\\\").text(\\\"Next round starting in \\\"+time+\\\" seconds\\\");\\n } else { \\n time--;\\n $(\\\"#question\\\").text(\\\"Next round starting in \\\"+time+\\\" seconds\\\");\\n clearInterval(timeInterval);\\n displayQuestion();\\n }\\n }, 1000)} else {\\n $(\\\"#timer\\\").text($(\\\"#timer\\\").text()+\\\" You got \\\"+correct+\\\"/10 correct!\\\")\\n $(\\\"#question\\\").text(\\\"Click here to start over!\\\")\\n questionType = -1; \\n }\\n $(\\\"#results-text\\\").text(who+\\\" is the \\\"+where+\\\" for \\\"+band+\\\"!\\\") \\n }\",\n \"function nextPage() {\\n setTimeout(function(){\\n if (questionCount < (questions.length-1)) {\\n number = t;\\n questionCount++;\\n createQuestionArea();\\n createAnswerArea();\\n startTimer();\\n $('#timer').show(); \\n } else {\\n createFinalScreen();\\n }\\n },1000*5);\\n}\",\n \"function questionTimedout() {\\n acceptingResponsesFromUser = false;\\n\\n console.log(\\\"timeout\\\");\\n $(\\\"#timer-view\\\").html(\\\"- -\\\");\\n $(\\\".footer\\\").html(\\\"Darn! Time out!
The correct answer is \\\" + questions[currentQuestionToPlay].correctResponse + \\\".
Waiting 5 seconds to go next!\\\");\\n\\n timeoutCount++;\\n $(\\\"#timeout-view\\\").html(timeoutCount);\\n waitBeforeGoingNextAutomatically();\\n}\",\n \"function timeRunsOut() {\\n noAnswer++;\\n console.log(noAnswer);\\n $(\\\".timer\\\").hide();\\n $(\\\".question\\\").empty();\\n $(\\\".answers\\\").empty();\\n $(\\\".results\\\").html(\\\"\\\" + \\\"You got \\\" + correct + \\\" out of \\\" + questions.length + \\\" questions correct!\\\");\\n }\\n\\n //calls displayQuestions\\n stopwatch.stop();\\n displayQuestions();\\n }\",\n \"function timeLimit() {\\n timer = setInterval(function () {\\n $(\\\"#clock\\\").css(\\\"animation\\\", \\\"none\\\");\\n $(\\\"#timer\\\").text(\\\"Time left: \\\" + seconds);\\n seconds--;\\n\\n if (seconds < 5) {\\n $(\\\"#clock\\\").css(\\\"animation\\\", \\\"pulse 5s infinite\\\");\\n }\\n\\n if (seconds === -1 && click < questions.length) {\\n seconds = 15;\\n click++;\\n incorrect++;\\n clearTimeout(timer);\\n showAnswer();\\n }\\n else if (click === questions.length) {\\n displayScore();\\n }\\n }, 1000);\\n }\",\n \"function chooseFoodQuiz() {\\n $(foodQuiz).click();\\n questions = foodQuestions;\\n finalQuestion = foodQuestions.length - 1;\\n startQuiz();\\n}\",\n \"function startSurvey(element){\\r\\n //Starts timer\\r\\n setInterval(startTimer, 1000);\\r\\n //Hides the button you clicked to start the survey\\r\\n hideStart(element);\\r\\n //Starts the survey, showing the first question\\r\\n startQuiz();\\r\\n}\",\n \"function quizEnd() {\\n /*\\n @TODO: write your function code here\\n */\\n clearInterval(timerId);\\n finalScore.textContent= score;\\n questionsEl.setAttribute(\\\"class\\\", \\\"hide\\\");\\n choicesEl.setAttribute(\\\"class\\\",\\\"hide\\\");\\n endScreen.removeAttribute(\\\"class\\\");\\n endScreen.setAttribute(\\\"style\\\",\\\"text-align:center\\\")\\n}\",\n \"function countDown() {\\n timeRemaining--;\\n $('#timeCount').text(timeRemaining);\\n if (timeRemaining <= 0 && count === 10) {\\n clearInterval(time);\\n answered.push(\\\"0\\\")\\n finalScreen();\\n } else if (timeRemaining <= 0) {\\n clearInterval(time);\\n answered.push(\\\"0\\\");\\n loadingScreen();\\n }\\n}\",\n \"function TimeoutNextClickCheck(tot) {\\n\\tif(IsRadioClick==false) {\\n// BMOD: use confirm instead of alert\\n//\\t\\talert(\\\"You did not click on an answer\\\");\\n//\\t\\treturn false;\\n\\t\\tif(!confirm(\\\"Proceed without answer?\\\")) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n//\\talert(\\\"new func\\\");\\n\\tvar checked = 0;\\n\\tfor(nn = 0; nn < tot; nn++) {\\n\\t\\tif(document.QuestionForm.pre_answer[nn].checked) {\\n\\t\\t\\tdocument.QuestionForm.answer.value = document.QuestionForm.pre_answer[nn].value;\\n\\t\\t\\tchecked = 1;\\n\\t\\t}\\n//\\t\\talert(checked + \\\":\\\" + document.QuestionForm.pre_answer[nn].value);\\n\\t}\\n\\tif(checked == 0) {\\n\\t\\tdocument.QuestionForm.answer.value = document.QuestionForm.timeout_answer.value;\\n\\t}\\n\\treturn true;\\n}\",\n \"finishQuestion() {\\n this.stoptimer();\\n this.allowAnwsers = false;\\n this.scorePlayers();\\n //show results\\n this.generateRoundup().then((state) => {\\n this.masters.forEach((socket) => {\\n socket.emit('roundup', state);\\n });\\n });\\n\\n //nextquestion\\n if (this.timer === null) {\\n this.timer = setTimeout(() => {\\n this.nextQuestion();\\n }, 10 * 1000); //after 10s\\n }\\n }\",\n \"function handleClick(e){\\n Product.current = [];\\n Product.click++;\\n for(let i = 0; i < Product.all.length; i++){\\n if(e.target.alt === Product.all[i].name){\\n Product.all[i].timesClick++;\\n updateChartArrays();\\n }\\n }\\n runSurvey();\\n}\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.button = choice;\\n response.rt = rt;\\n\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\\n for(var i=0; iCorrect: \\\" + correct + \\\"Wrong: \\\" + incorrect + \\\"
Trivia written by Glen Weldon for NPR podcast 'Pop Culture Happy Hour.' Weldon is the author of 'The Caped Crusade: Batman and the Rise of Nerd Culture.'
\\\");\\n\\t\\t$(\\\".choice\\\").hide();\\n\\t\\t$(\\\"#startBtn\\\").show();\\n\\t}\\n\\t}\",\n \"function endTracking() {\\n tryingToTrack = false;\\n timeCounter = 0;\\n\\n $(\\\"#stopTrackingMe\\\").css({\\n \\\"display\\\": \\\"none\\\"\\n });\\n $(\\\"#extendTrackingMe\\\").css({\\n \\\"display\\\": \\\"none\\\"\\n });\\n $(\\\"#extendTrackingMe\\\").on('click', () => {\\n alert(\\\"Timer set to 30 mins\\\")\\n });\\n $(\\\"#startTrackingMe\\\").css({\\n \\\"display\\\": \\\"inline-block\\\"\\n });\\n }\",\n \"function nextQuestion() {\\n if (questionCounter < questions.length) {\\n time = 15;\\n $(\\\"#gameScreen\\\").html(\\\"You have \\\" + time + \\\" seconds left!
\\\");\\n questionContent();\\n timer();\\n userTimeout();\\n }\\n else {\\n resultsScreen();\\n }\\n\\n }\",\n \"function nextQuestion() {\\n\\t\\tif (questionCounter < questions.length) {\\n\\t\\t\\ttime = 15;\\n\\t\\t\\t$(\\\".gameScreen\\\").html(\\\"You have \\\" + time + \\\" seconds left!
\\\");\\n\\t\\t\\tquestionContent();\\n\\t\\t\\ttimer();\\n\\t\\t\\ttimesUp();\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tresultsScreen();\\n\\t\\t}\\n\\t}\",\n \"function goToLastQuestion(){ \\r\\n\\tcount--\\r\\n\\tupdateItems();\\r\\n}\",\n \"function nextQuestion(event) {\\n\\n\\n // condition uses click event to add to user score if correct ansser is made //\\n if (event.target.value === questions[currentQuesIndex].correctAns) {\\n score++;\\n } else {\\n time -= 5;\\n counter.textContent = time + \\\" Seconds left on quiz.\\\";\\n }\\n\\n\\n\\n // Condition executes next question\\n if (currentQuesIndex < questions.length) {\\n currentQuesIndex++;\\n // moves to next section once condition is met\\n } if (currentQuesIndex === questions.length) {\\n\\n quizEl.style.display = \\\"none\\\";\\n // this function call takes user to results section\\n quizResults();\\n return;\\n\\n }\\n showQuestion();\\n}\",\n \"function nextQuestion() {\\n if (questionCounter < questions.length)\\n { time = 10;\\n $(\\\"#gameScreen\\\").html(\\\" You have \\\" + time + \\n \\\" seconds left!
\\\");\\n questionContent();\\n timer();\\n userTimeout();\\n \\n }\\n \\n else {\\n resultsScreen();\\n }\\n\\t}\",\n \"function incorrect() {\\n timeLeft -=20;\\n nextQuestion();\\n}\",\n \"function tally() {\\r\\n alert('You are have reached the end of the game! Your answers gave you a cool rating of: ' + correct);\\r\\n alert('Explore the rest of the page to check out more about me that wasn\\\\'t included in the game!');\\r\\n\\r\\n }\",\n \"function checkGameEnd() {\\n if(count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function() {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function checkGameEnd() {\\n if(count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function() {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.choice = data.prompt_type == \\\"count\\\" ? parseInt(choice) : choice;\\n response.rt = rt;\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#scene-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.scene-choice-button button');\\n for(var i=0; i {\\r\\n if (indexNumber <= 9) {\\r\\n NextQuestion(indexNumber)\\r\\n }\\r\\n else {\\r\\n handleEndGame()\\r\\n }\\r\\n resetOptionBackground()\\r\\n\\t\\t\\r\\n }, 1000);\\r\\n\\t\\r\\n\\t\\r\\n}\",\n \"function collectedDone() { //Collection of functions meant to run when you press the Done-button in the quiz.\\n correctAnswers();\\n roundsPlayed();\\n collectedRights();\\n collectedWrongs()\\n correctPercentage();\\n controlChildrenTabIndexMinus() \\n}\",\n \"function askNextQuestion(){ \\n $('.questions').on('click', '.submit-next', function(){\\n currentQuestion++; \\n if (currentQuestion > QUESTIONS.length-1){\\n showFinalResult();\\n }else{\\n console.log('next question asked');\\n resetOptions();\\n renderQuestion();\\n updateProgress();\\n $('.submit-answer').removeClass('hidden');\\n $('.submit-next').addClass('hidden');\\n } \\n });\\n}\",\n \"function checkGameEnd() {\\n if (count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function () {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function wait() {\\n\\tif (questionCounter < 7) {\\n\\tquestionCounter++;\\n\\tgenerateHTML();\\n\\tcounter = 30;\\n\\ttimerWrapper();\\n\\t}\\n\\telse {\\n\\t\\tfinalScreen();\\n\\t}\\n}\",\n \"function timingQuestion() {\\n \\n displayQuestionAndListenForInput();\\n\\n\\n if (count == questionArr.length + 1) {\\n clearInterval(intervalid);\\n clearInterval(timeIntervalID);\\n $(\\\"#timer-id\\\").empty();\\n $(\\\"main\\\").empty();\\n\\n \\n $(\\\"main\\\").append(\\\"Correct Answers: \\\" + correctAnswer + \\\"
\\\");\\n $(\\\"main\\\").append(\\\"Wrong Answers: \\\" + wrongAnswer + \\\"
\\\");\\n $(\\\"main\\\").append(\\\"Missed Answers: \\\" + missedAnswer + \\\"
\\\");\\n\\n time = 30;\\n clicked = false;\\n count =0;\\n correctAnswer = 0;\\n wrongAnswer = 0;\\n missedAnswer = 0;\\n\\n $(\\\"main\\\").append(\\\"\\\");\\n $(\\\"#start-button\\\").on(\\\"click\\\", timingQuestion);\\n }\\n }\",\n \"function correctAnswer(){\\n $(\\\"#timer\\\").text(\\\"You are correct!\\\"); \\n if (clickCount == 0) {\\n correct++;\\n }; \\n clickCount++; //used to prevent multiple clicks adding to the total amount\\n clearInterval(timeInterval); \\n roundEnd();\\n $(\\\"button\\\").remove(); //used to remove previous events from existing buttons\\n $(\\\"#choice-container\\\").html('')\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.64227456","0.6413096","0.6383165","0.6315035","0.61615896","0.6158293","0.6154531","0.61421865","0.61421865","0.6108407","0.60826856","0.60767287","0.6074042","0.6061887","0.60602075","0.6058682","0.60495466","0.6020223","0.6019584","0.60044336","0.5961336","0.5948536","0.5941623","0.5940533","0.5930909","0.5922732","0.5918794","0.5917989","0.5916928","0.59047616","0.59028244","0.5901223","0.59007424","0.5899033","0.5888634","0.58700985","0.58596915","0.58575135","0.5834327","0.58333564","0.58283097","0.58141315","0.5812859","0.5809388","0.5805613","0.58001727","0.5798387","0.57858586","0.57813084","0.57790124","0.5776532","0.5774767","0.57726187","0.57705057","0.5762136","0.5744722","0.5743024","0.57420653","0.5737513","0.5737474","0.57348746","0.572924","0.57273334","0.5726199","0.57247525","0.57216424","0.57031","0.5702565","0.5701889","0.5698703","0.56970567","0.5694414","0.56874555","0.5686841","0.56852555","0.567838","0.5674172","0.56570846","0.5655508","0.5654415","0.56490713","0.5644633","0.5635947","0.5631291","0.5627927","0.56263185","0.5623375","0.5619338","0.5615136","0.561425","0.561425","0.5613537","0.5613175","0.5610761","0.5610715","0.56096053","0.5608574","0.56063783","0.56061655","0.5602974"],"string":"[\n \"0.64227456\",\n \"0.6413096\",\n \"0.6383165\",\n \"0.6315035\",\n \"0.61615896\",\n \"0.6158293\",\n \"0.6154531\",\n \"0.61421865\",\n \"0.61421865\",\n \"0.6108407\",\n \"0.60826856\",\n \"0.60767287\",\n \"0.6074042\",\n \"0.6061887\",\n \"0.60602075\",\n \"0.6058682\",\n \"0.60495466\",\n \"0.6020223\",\n \"0.6019584\",\n \"0.60044336\",\n \"0.5961336\",\n \"0.5948536\",\n \"0.5941623\",\n \"0.5940533\",\n \"0.5930909\",\n \"0.5922732\",\n \"0.5918794\",\n \"0.5917989\",\n \"0.5916928\",\n \"0.59047616\",\n \"0.59028244\",\n \"0.5901223\",\n \"0.59007424\",\n \"0.5899033\",\n \"0.5888634\",\n \"0.58700985\",\n \"0.58596915\",\n \"0.58575135\",\n \"0.5834327\",\n \"0.58333564\",\n \"0.58283097\",\n \"0.58141315\",\n \"0.5812859\",\n \"0.5809388\",\n \"0.5805613\",\n \"0.58001727\",\n \"0.5798387\",\n \"0.57858586\",\n \"0.57813084\",\n \"0.57790124\",\n \"0.5776532\",\n \"0.5774767\",\n \"0.57726187\",\n \"0.57705057\",\n \"0.5762136\",\n \"0.5744722\",\n \"0.5743024\",\n \"0.57420653\",\n \"0.5737513\",\n \"0.5737474\",\n \"0.57348746\",\n \"0.572924\",\n \"0.57273334\",\n \"0.5726199\",\n \"0.57247525\",\n \"0.57216424\",\n \"0.57031\",\n \"0.5702565\",\n \"0.5701889\",\n \"0.5698703\",\n \"0.56970567\",\n \"0.5694414\",\n \"0.56874555\",\n \"0.5686841\",\n \"0.56852555\",\n \"0.567838\",\n \"0.5674172\",\n \"0.56570846\",\n \"0.5655508\",\n \"0.5654415\",\n \"0.56490713\",\n \"0.5644633\",\n \"0.5635947\",\n \"0.5631291\",\n \"0.5627927\",\n \"0.56263185\",\n \"0.5623375\",\n \"0.5619338\",\n \"0.5615136\",\n \"0.561425\",\n \"0.561425\",\n \"0.5613537\",\n \"0.5613175\",\n \"0.5610761\",\n \"0.5610715\",\n \"0.56096053\",\n \"0.5608574\",\n \"0.56063783\",\n \"0.56061655\",\n \"0.5602974\"\n]"},"document_score":{"kind":"string","value":"0.66317606"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":81766,"cells":{"query":{"kind":"string","value":"Function to Load Images to Page"},"document":{"kind":"string","value":"function loadImages() {\n if (surveyLength > 24) {\n surveyEnd();\n }\n\n lastIndex = [];\n\n lastIndex.push(randomIndex1);\n lastIndex.push(randomIndex2);\n lastIndex.push(randomIndex3);\n\n //Re-assigning the variables for each picture\n randomIndexGenerator();\n\n //While loop to prevent double choices AND no prior choice repeats\n while (randomIndex1 === lastIndex[0] || randomIndex1 === lastIndex[1] || randomIndex1 === lastIndex[2] || randomIndex2 === lastIndex[0] || randomIndex2 === lastIndex[1] || randomIndex2 === lastIndex[2] || randomIndex3 === lastIndex[0] || randomIndex3 === lastIndex[1] || randomIndex3 === lastIndex[2] || randomIndex1 === randomIndex2 || randomIndex1 === randomIndex3 || randomIndex2 === randomIndex3) {\n randomIndexGenerator();\n }\n //Makes leftImg's src property equal to the fileName of the indexed item\n leftImg.src = catalogArray[randomIndex1].filePath;\n centerImg.src = catalogArray[randomIndex2].filePath;\n rightImg.src = catalogArray[randomIndex3].filePath;\n\n //Adds 1 to the display tally property of the indexed object\n catalogArray[randomIndex1].tallyDisplayed += 1;\n catalogArray[randomIndex2].tallyDisplayed += 1;\n catalogArray[randomIndex3].tallyDisplayed += 1;\n\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function loadImages() {\n\t\t const button = document.querySelector('#loadImages');\n\t\t const container = document.querySelector('#image-container');\n\n\t\t button.addEventListener(\"click\", (event) => {\n\n\t\t const images = imageNames();\n\t\t images.forEach((image) => {\n\t\t requestFor(image, container).then(imageData => {\n\t\t const imageElement = imageData.imageElement;\n\t\t const imageSrc = imageData.objectURL;\n\t\t imageElement.src = imageSrc;\n\t\t });\n\t\t });\n\t\t });\n\t\t}","function load_images() {\n data.each(function(frame) {\n var imgs = []\n frame.images.each(function(imgstr) {\n var img = new Image(IMG_WIDTH, IMG_HEIGHT);\n img.src = \"/img/\" + imgstr;\n img.style.float = \"left\";\n imgs.push(img); \n });\n frame['imageobjs'] = imgs;\n }) \n }","function getImages() {\n\t$.get(\"resources/get_images.php\", {\"page\": globalPage}).success(function(data) {\n\t\tglobalPage++;\n\t\t\n\t\tvar imgz = JSON.parse(data).images;\n\t\tgenerateThumbnails(imgz);\n\t\tgenerateShowMoreButton(imgz);\n\t}).fail(function() {\n\t\twindow.location.replace(\"index.php\");\n\t});\n}","function renderImages() {\n $('.landing-page').addClass('hidden');\n $('.img-round').removeClass('hidden');\n updateSrcs();\n currentOffset+=100;\n }","function start_loadImages()\n {\n methods.loadImages(\n function() {\n methods.getDataURI();\n run_app();\n },\n imagesRack.imgList\n );\n }","function loadImages() {\r\n new Image('(\"Robot\") Bag','/images/bag.jpg', 0);\r\n new Image('Bathroom Phone Holder','/images/bathroom.jpg', 0);\r\n new Image('Breakfast Maker','/images/breakfast.jpg', 0);\r\n new Image('Meatball Bubblegum','/images/bubblegum.jpg', 0);\r\n new Image('Chair','/images/chair.jpg', 0);\r\n new Image('Cthulhu','/images/cthulhu.jpg', 0);\r\n new Image('Duck Mask','/images/dog-duck.jpg', 0);\r\n new Image('Dragon','/images/dragon.jpg', 0);\r\n new Image('U-Pensils','/images/pen.jpg', 0);\r\n new Image('Pet Sweep','/images/pet-sweep.jpg', 0);\r\n new Image('Pizza Scissors','/images/scissors.jpg', 0);\r\n new Image('Shark Blanket','/images/shark.jpg', 0);\r\n new Image('Baby Sweep','/images/sweep.png', 0);\r\n new Image('TaunTaun Sleepingbag','/images/tauntaun.jpg', 0);\r\n new Image('Unicorn Meat','/images/unicorn.jpg', 0);\r\n new Image('USB','/images/usb.gif', 0);\r\n new Image('Water Can','/images/water-can.jpg', 0);\r\n new Image('Wine Glass','/images/wine-glass.jpg', 0);\r\n new Image('boots', '/images/boots.jpg', 0);\r\n new Image('banana','/images/banana.jpg', 0);\r\n }","function loadAllImages() {\n var images = document.querySelectorAll('img[data-src]');\n\n for (var i = 0; i < images.length; i++) {\n ImageLoader.load(images[i]);\n }\n }","function loadImages() {\n $('img[data-src]').each(function () {\n var src = $(this).data('src');\n var style = $(this).data('style');\n $(this).attr('src', src);\n $(this).attr('style', style);\n });\n}","function loadImages() {\n var files = [ 'outer_light.png', 'layer_down_light.png',\n 'layer_up_light.png', 'angle_prev_light.png',\n 'angle_next_light.png', 'linked_data_light.png',\n 'raw_scan_light.png', 'dig_positive_light.png',\n 'text_view_light.png', 'vector_view_light.png',\n 'overlays_light.png', 'thumbnails_light.png',\n '3d_view_light.png', 'step_back_light.png',\n 'step_fwd_light.png', 'minimize_light.png' ];\n\n var i = 0;\n for (i = 0; i < files.length; i++) {\n btnImages[i] = new Image(); btnImages[i].src = files[i];\n }\n}","function findImagesToLoad() {\n\tsetLazyImagePositions.call(this);\n\tconst imagesToLoad = getImagesInView(this.images);\n\tloadImages.call(this, imagesToLoad);\n}","function LoadImages()\n{\n\tvar loadedImages = 0;\n\tvar numImages = 0;\n\tfor (var src in ImgList)\n\t{\n\t\tnumImages++;\n\t}\n\tfor (var src in ImgList)\n\t{\n\t\tImgs[src] = new Image();\n\t\tImgs[src].onload = function()\n\t\t{\n\t\t\tloadedImages = loadedImages +1;\n\t\t\tif(loadedImages >= numImages)\n\t\t\t{\n\t\t\t\t//Finished loading!\n\t\t\t\ttstsetup();\n\t\t\t\tImgsFinished = 1;\n\t\t\t}\n\t\t};\n\n\t\tif (src < 6)\n\t\t{\n\t\t\tImgs[src].src = ImgList[src];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tImgs[src].src = ImgURL + ImgList[src];\n\t\t}\n\t}\n}","function fetchImages() {\n $.getJSON(\"/images.php\", function(data) {\n preloadImages(data);\n }); \n }","function loadImages() {\n bsImage = new Image();\n bsImage.src = \"resources/resources/images/spritesheets/buttons_1.png\";\n wallImag = new Image();\n wallImag.src = \"resources/resources/images/spritesheets/jungle_wall.png\";\n ssImage = new Image();\n ssImage.src = \"resources/resources/images/spritesheets/sprites_final.png\";\n window.setTimeout(setup, 1500);\n aImage = new Image();\n aImage.src = \"resources/resources/images/spritesheets/uparr.png\"\n}","function loadImages(div){\r\n\tvar images = [];\r\n\tjQuery.each(jQuery(div+' img'), function(i,img){\r\n\t\tif(!jQuery(img).attr('src') || jQuery(img).attr('src')==''){\r\n\t\t\timages.push(img);\r\n\t\t}\r\n\t});\r\n\tjQuery(images).each( function(i,image) {\r\n\t\tjQuery(this).attr('src',jQuery(this).attr('longdesc'));\r\n\t});\r\n}","function loadImage() {\n var baseUrl = 'https://source.unsplash.com/category';\n var category = 'nature';\n var size = '1920x1080';\n\n var source = baseUrl + '/' + category + '/' + size;\n\n buildElement(source)\n .then(render);\n }","function loadImages() {\r\n var files = document.getElementById('images').files, i, file, reader;\r\n for (i = 0; i < files.length; i = i + 1) {\r\n file = files[i];\r\n if (file.name.endsWith(\".jpg\") || file.name.endsWith(\".gif\") || file.name.endsWith(\".png\")) {\r\n images.push(file);\r\n }\r\n }\r\n if (images.length > 0) {\r\n showLoadedImages(\"list\");\r\n } else {\r\n alert(\"No images found. Try another directory.\");\r\n }\r\n }","function loadVisiblePages() {\n // Fetch page images that are currently shown on the site\n var firstVisibleImageLinks = $('#imageList li>a').not('.page-text').withinviewport();\n $.each(firstVisibleImageLinks, function(index, aEl) {\n var imgEl = $(aEl).find('img');\n // Check if the image is already loaded\n if( $(imgEl).attr('src') !== '' )\n return;\n\n // Load page images via Ajax\n $.get( \"ajax/image/page\", { \"imageId\" : globalImageType, \"pageId\" : $(aEl).attr('data-pageid'), \"width\" : 150 } )\n .always(function( data ) {\n // Remove broken image icon first\n var nextEl = $(imgEl).next();\n if( nextEl.length !== 0 ) {\n $(nextEl).remove();\n }\n })\n .done(function( data ) {\n $(imgEl).attr('src', \"data:image/jpeg;base64, \" + data);\n })\n .fail(function( data ) {\n $(imgEl).after('broken_image');\n });\n });\n}","function loadImage() {\n\n // image file not loaded yet? => load image file\n if ( !resource ) jQuery( '![](\"')
' );\n\n // immediate perform success callback\n success();\n\n }","function loadImages() {\n\t// for each image container\n\t$('.image-container').each(function() {\n\t\t// get medium-sized image filename\n\t\tvar img_filename = $('img', $(this)).attr('data-imglarge')\n\t\tvar img_med_filename = img_filename.substring(0, img_filename.indexOf('.png')) + '_medium.jpg'\n\n\t\t// // load medium-sized image\n\t\t// var imgLarge = new Image()\n\t\t// $(imgLarge).addClass('artwork')\n\t\t// \t.attr('src', img_med_filename)\n\t\t// \t.attr('data-imglarge', img_filename)\n\t\t// \t.attr('alt', $('.placeholder', $(this)).attr('alt'))\n\t\t// \t.on('load', () => {\n\t\t// \t\t$(imgLarge).addClass('loaded')\n\t\t// \t})\n\t\t// $(this).append($(imgLarge))\n\n\t\t// update placeholder image src\n\t\t$('.placeholder', $(this)).attr('src', img_med_filename)\n\t\t\t.attr('data-imglarge', img_filename)\n\t\t\t.css('filter', 'none')\n\t})\n\tconsole.log('window loaded!')\n}","function loadImages (){\n var img = [\n 'src/Barba Garcia, Francisco.jpg',\n 'src/Barba Rodriguez, Arturo.jpg',\n 'src/Caro Bernal, Miguel Angel.jpg',\n 'src/Castillo Peña, José Luis.jpg',\n 'src/Cruz Vidal, Alejandro.jpg',\n 'src/Gallego Martel, Jose Maria.jpg',\n 'src/Garci Peña, José Joaquín.jpg',\n 'src/Vazquez Rodriguez, Maria del Mar.jpg',\n ];\n\n setImgs(shuffle(initImgs(img)));\n}","function loadImages() {\n floor = new Image();\n background = new Image();\n ring = new Image();\n platform = new Image();\n\n floor.src = './tile-images/floorpath.png';\n background.src = './tile-images/plainbackgroundtile.png';\n ring.src = './tile-images/ring.png';\n platform.src = './tile-images/platform.png';\n}","function display_advertise_images() {\n}","function refreshImages() {\n var images = document.querySelectorAll('img[data-src]');\n\n for (var i = 0; i < images.length; i++) {\n ImageLoader.load(images[i]);\n }\n }","function loadImages(){\n prev_btnj.addClass('loading')\n next_btnj.addClass('loading')\n fs.readdir(dirname, (err, files) => {\n if (!err){\n images = files.filter(isImage)\n curIndex = images.indexOf(basename)\n prev_btnj.removeClass('loading')\n next_btnj.removeClass('loading')\n setBtn()\n }\n })\n}","function loadImages() {\n testPattern = new Image();\n testPattern.src = \"testpattern.gif\";\n }","function loadImages() {\r\n\t\tremoveUnseenImages();\r\n\t\tvar sets = $['mapsettings'];\r\n\t\tvar range = getPixelRange();\r\n\t\tfor(var i=range.start.x; i![]()
').attr({\n id: \"image\" + i,\n src: config.imgDir + i + config.imgFormat,\n title: \"Image\" + i\n }).appendTo(\"#\" + config.imgContainer);\n }\n }","function preloadImages() {\n\tidList.forEach(function(id) {\n\t\tlet $newImage = $('#image-preloader').clone();\n\t\t$newImage.attr('src', `${ART_URL}${id}.png`);\n\t\t$('#image-preloader-container').append();\n\t});\n}","function loadImage() {\n var baseUrl = 'https://source.unsplash.com/category',\n cat = 'nature',\n size = '1920x1080';\n\n buildElement(`${baseUrl}/${cat}/${size}`).then(render);\n }","function getImages() {\n alert(\"Page will reload once images are finished loading\");\n // runs 1540photo.py, which collects images from Gmail\n exec(\"python 1540photo.py\");\n loaded_images_from_tba = 0;\n // for each team, loads media\n for (let team_id in teams) {\n loadMediaFromTBA(teams[team_id]);\n }\n // gets local files\n let local_dir = fs.readdirSync(\"./data/images/\");\n for (let team_id in local_dir) {\n try {\n let file = local_dir[team_id];\n if (manifest_images.indexOf(file) < 0) {\n manifest_images.push(file);\n }\n } catch (_) {}\n }\n // checks to see if all images are loaded, and saves a manifest if true\n window.setInterval(saveImageManifest, 3000);\n}","function renderImages() {\n imgElem.src = Actor.all[0].path;\n}","function loadImages(atlas)\n\t\t{\n\t\t\tdataAtlas = atlas.tiles;\n\t\t\tplayerAtlas = atlas.player;\n\n\t\t\tlet images = [\"img/Tiles/sheet.png\", \"img/Player/p1_spritesheet.png\"];\n\t\t\tlet imgsPromises = images.map (function (url)\n\t\t\t{\n\t\t\t\treturn new Promise ( (ok, error) => {\n\t\t\t\t\tvar img = new Image();\n\t\t\t\t\timg.src = url;\n\t\t\t\t\timg.onload = () => ok(img);\n\t\t\t\t});\n\t\t\t});\n\t\t\treturn (Promise.all(imgsPromises))\n\t\t}","preloadImages(doload, callback) {\n\t\tconst paths = this.getImagePaths();\n\t\tfor (let i = 0; i < paths.length; i++) {\n\t\t\tgraphics.add(paths[i]);\n\t\t}\n\t\tif (doload) {\n\t\t\tgraphics.load(callback);\n\t\t}\n\t}","function ImageController(){\n\t\tvar imageService = new ImageService()\n\t\t$.get(window.location.pathname + '-image-tag.html', function(data){\n\t\t\t$('.main-container').append(data)\n\t\t})\n\t\timageService.getImage(function(imageData){\n\t\t\t$('body').css('background-image', `url(\"${imageData.url}\")`);\n\t\t\tconsole.log(imageData.large_url)\n\t\t\t$('.image-link').attr('href', imageData.large_url!==null? imageData.large_url : imageData.url)\n\t\t})\n\t}","function loadImg(){\n document.productImg.src = myImgSrc + myImg[i] + myImgEnd;\n}","function loadImage() {\n\t\t$('div.thumbnail a img').on('click', function(){\n\t\t\tvar image = this.src;\n\t\t\t$('.image-load').html('');\n\t\t});\n\t}","function loadImage(imageName, imageLocation)\n{\nif (document.images) document.images[imageName].src = imageLocation;\nreturn true;\n}","function Load_Page(CurrentImageID){\r\n\t\r\n\t\r\n\tvar Image_Number = Loaded_Images[CurrentImageID].number;\r\n\tvar Image_Page = Loaded_Images[CurrentImageID].page\r\n\t\r\n\t// Checks which page direction and if it's the end of the list.\r\n\t\r\n\t// Going towards the left\r\n\tvar backPaging = (Image_Number <= 1 && Image_Page > 1)\r\n\tvar FrontWall = (Image_Page == FirstPage)\r\n\t\r\n\t// Going towards the right\r\n\tvar forwardPaging = (Image_Number >= ImagesPerPage && Image_Page >= 1)\r\n\tvar RearWall = (Image_Number < ImagesPerPage && Image_Page == LastPage)\r\n\tif(backPaging && !FrontWall){\r\n\t\tvar PageSelect = Image_Page-1\r\n\t\t// console.debug('backpaging')\r\n\t}else if(forwardPaging && !RearWall){\r\n\t\tvar PageSelect = Image_Page+1\r\n\t\t// console.debug('forwardPaging')\r\n\t}else{\r\n\t\t// console.debug('wall')\r\n\t\tPageSelect = Image_Page\r\n\t};\r\n\r\n\t\r\n\t\r\n\t// Takes the requested page and converts into a URL string to load.\r\n\tif(backPaging || forwardPaging){\r\n\t$nav_thumb_img.show();\r\n\tPageSelect -= 1\r\n\tPageSelect = PageSelect*ImagesPerPage\r\n\t\r\n\tif(document.URL.indexOf('pid=') > -1){\r\n\t\tvar requestURL = document.URL.replace(/pid\\=[0-9]{1,}/,'pid='+PageSelect);\r\n\t}else{\r\n\t\tvar requestURL = document.URL+'&pid='+PageSelect;\r\n\t};\r\n\t// console.debug(requestURL+' Loading...')\r\n\tGM_xmlhttpRequest({\r\n\t\tmethod: \"GET\",\r\n\t\turl: requestURL,\r\n\t\tonload: function(retour) {\r\n\t\t\t// console.debug(retour)\r\n\t\t\t$nav_thumb_img.hide();\r\n\t\t\tResponseHTML = $(retour.responseText);\r\n\t\t\tvar ImageNumber = 0\r\n\t\t\t$('.content span.thumb', ResponseHTML).each(function(){\r\n\t\t\t\r\n\t\t\t\tvar $this_span = $(this)\r\n\t\t\t\tvar ImageID = $this_span.attr('id');\r\n\t\t\t\tvar ImageThumb = $('img.preview' ,$this_span).attr('src');\r\n\t\t\t\tvar ImageTags = $('img.preview' ,$this_span).attr('alt');\r\n\t\t\t\tvar ImagePage = parseInt($('#paginator .pagination b', ResponseHTML).text());\r\n\t\t\t\tvar ImageMain = ImageThumb.replace('thumbnail_','').replace(\"/r34/thumbnails/\",'//images/').replace(\"/rule34/thumbnails/\",'/rule34//images/')\r\n\t\t\t\tvar ImageLink = $('a[href^=\"'+Setting_ImageLinkBegins+'\"]',$this_span).attr('href');\r\n\t\t\t\t\r\n\t\t\t\t// console.debug(ImageMain);\r\n\t\t\t\t// http://cdn.rule34.xxx/r34/thumbnails/1354/thumbnail_23a69eecacb1cd8c36045e45657800e8f257e950.jpg?1411722\r\n\t\t\t\r\n\t\t\t\tImageNumber++\r\n\t\t\t\t\r\n\t\t\t\tAddImage(ImageID,ImageThumb,ImageMain,ImagePage,ImageNumber,ImageLink,ImageTags)\r\n\t\t\t\t\r\n\t\t\t});\r\n\t\t\t\r\n\t\t\tSort_images();\r\n\t\t\tvar Cur_Image_ID = $('.image_nav_content img.main_img').data('ImageId')\r\n\t\t\tvar Image_Number2 = Loaded_Images_array.indexOf(Cur_Image_ID);\r\n\t\t\tif(backPaging){\r\n\t\t\t\tImage_Number2--\r\n\t\t\t\t// console.debug('backPaging')\r\n\t\t\t}else if(forwardPaging){\r\n\t\t\t\tImage_Number2++\r\n\t\t\t\t// console.debug('forwardPaging')\r\n\t\t\t}\r\n\t\t\t// console.debug(Cur_Image_ID+' ID, Number: '+Image_Number2)\t\t\t\r\n\t\t\tNew_Image = Loaded_Images_array[Image_Number2]\r\n\t\t\t// console.debug(New_Image)\r\n\t\t\tLoadImage(New_Image);\r\n\t\t\t\r\n\t\t}\r\n\t});\r\n\t};\r\n \r\n}","function preloader() {\n\tif (document.images) {\n\t\tvar img1 = new Image();\n\t\tvar img2 = new Image();\n\t\tvar img3 = new Image();\n\t\tvar img4 = new Image();\n\n\t\timg1.src = \"./imgs/sunny.jpg\";\n\t\timg2.src = \"./imgs/sunset.jpg\";\n\t\timg3.src = \"./imgs/stars.jpg\";\n\t\timg4.src = \"./imgs/downtown.jpg\";\n\t}\n}","function preload() {\n println(\"loading images\")\n img = [loadImage(\"./assets/AmericaFirst.png\"), loadImage(\"./assets/AuditTheVote.png\"), loadImage(\"./assets/Hillary.png\"), loadImage(\"./assets/MAGA.png\"), loadImage(\"./assets/TrumpTrain.png\")];\n\n}","function lazyLoad(){\n\tvar $images = $('.lazy_load');\n\n\t$images.each(function(){\n\t\tvar $img = $(this),\n\t\t\tsrc = $img.attr('data-img');\n\t\t$img.attr('src',src);\n\t});\n}","function loadImageUrls() {\n fetch(\"https://api.imgflip.com/get_memes\")\n .then((result) => result.json())\n .then(({ data: { memes: loadedMemes } = {} }) => {\n memes = loadedMemes;\n showImage(0);\n });\n }","function loadImages(imagesToLoad) {\n\timagesToLoad.forEach(lazyImage => {\n\t\tthis.fireLazyEvent(lazyImage.image);\n\t\tlazyImage.resolved = true;\n\t});\n}","function displayPhotos() {\n loader.hidden = true;\n photos.forEach((photo) => {\n // Create Unspalsh page Link for the image\n const imageLink = document.createElement(\"a\");\n imageLink.setAttribute(\"href\", photo.links.html);\n imageLink.setAttribute(\"target\", \"_blank\");\n\n // Create image element\n const img = document.createElement(\"img\");\n img.setAttribute(\"src\", photo.urls.regular);\n img.setAttribute(\"alt\", photo.alt_description);\n img.setAttribute(\"title\", photo.alt_description);\n\n imageLink.appendChild(img);\n imageContainer.appendChild(imageLink);\n\n //event listner for image\n img.addEventListener(\"load\", imageLoaded);\n });\n}","function getLoadedImages() {\r\n return images;\r\n }","function preload(){\n images.forEach(function(elem) {\n im = new Image();\n im.src = elem;\n });\n}","function preloadImages() {\n var images = [\n 'btn_action_active.png',\n\t'btn_focus_active.png',\n 'btn_up_active.png',\n 'btn_right_active.png',\n 'btn_left_active.png',\n 'btn_down_active.png',\n 'prybar.png',\n 'machete.png',\n 'sample_dna.png',\n 'pickaxe.png',\n 'fuel.png',\n 'fire_extinguisher.png',\n 'dynamite.png',\n 'dna_sampler.png'\n ];\n $(images).each(function() {\n $('![]()
')[0].src = this;\n (new Image()).src = this;\n });\n}","function LoadSliderImages(sublist) {\n\t\t\tvar numImages = sublist.find('.item > a > .src').length;\n\t\t\tsublist.find('.item > a > .src').each(function(i) {\n\t\t\t\tvar img = new Image();\n\t\t\t\tvar imgSrc = $(this).html();\n\t\t\t\tvar imgAlt = $(this).parent().find('.alt').html();\n\t\n\t\t\t\t$(this).parent().append(img);\n\t\t\t \n\t\t\t\t// wrap our new image in jQuery, then:\n\t\t\t\t$(img).load(function () {\n\t\t\t\t\tnumImages--;\n\t\t\t\t\tif (numImages == 0) {\n\t\t\t\t\t\tSetSublist(sublist);\n\t\t\t\t\t}\n\t\t\t\t\t/*\n\t\t\t\t\tif (i == sublist.find('.item > a > .src').size() - 1) {\n\t\t\t\t\t\tSetSublist(sublist);\n\t\t\t\t\t}\n\t\t\t\t\t*/\n\t\t\t\t})\n\t\t\t\t.error(function () {\n\t\t\t\t// notify the user that the image could not be loaded\n\t\t\t\t})\n\t\t\t\t.attr('src', imgSrc).attr('alt', imgAlt);\n\t\t\t});\n\t\t}","function preloadImages() {\n\tif (document.images) {\n\t\tfor (var i = 0; i < preloadImages.arguments.length; i++) {\n\t\t\t(new Image()).src = preloadImages.arguments[i];\t\n\t\t}\n\t}\n} // end image preloader","function preload(){\r\n img=loadImage('https://upload.wikimedia.org/wikipedia/commons/8/81/Dalai_Lama_%2814566605561%29.jpg')\r\n\r\n img1=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/02/Nelson_Mandela_1994.jpg')\r\n\r\n img2=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/00/Bill_Clinton_1999_Presidential_Medal_of_Freedom_%281%29.jpg')\r\n\r\nimg3=loadImage('https://live.staticflickr.com/65535/49245065008_a7082b2a41_b.jpg')\r\n}","loadImages(): void {\n let self = this;\n let items = this.getState().items;\n for (let i = 0; i < items.length; i++) {\n let item: ItemType = items[i];\n // Copy item config\n let config: ImageViewerConfigType = {...item.viewerConfig};\n if (_.isEmpty(config)) {\n config = makeImageViewerConfig();\n }\n let url = item.url;\n let image = new Image();\n image.crossOrigin = 'Anonymous';\n self.images.push(image);\n image.onload = function() {\n config.imageHeight = this.height;\n config.imageWidth = this.width;\n self.store.dispatch({type: types.LOAD_ITEM, index: item.index,\n config: config});\n };\n image.onerror = function() {\n alert(sprintf('Image %s was not found.', url));\n };\n image.src = url;\n }\n }","function _onImageLoaded() {\n _imagesToLoad = _imagesToLoad - 1;\n if (!_imagesToLoad) {\n $$log(\"All images loaded, rendering again.\");\n PP64.renderer.render();\n }\n }","function fnLoadPngs(){\n var rslt = navigator.appVersion.match(/MSIE (\\d+\\.\\d+)/, '');\n var itsAllGood = (rslt != null && Number(rslt[1]) >= 5.5);\n \n for (var i = document.images.length - 1, img = null; (img = document.images[i]); i--){\n if (itsAllGood && img.src.match(/\\.png$/i) != null) {\n var src = img.src;\n var div = document.createElement(\"DIV\");\n \n div.style.filter = \"progid:DXImageTransform.Microsoft.AlphaImageLoader(src='\" + src + \"', sizing='scale')\"\n div.style.width = img.width + \"px\";\n div.style.height = img.height + \"px\";\n img.replaceNode(div);\n }\n \n img.style.visibility = \"visible\";\n }\n}","function pilau_preload_images() {\n\tvar args_len, i, cache_image;\n\targs_len = arguments.length;\n\tfor ( i = args_len; i--;) {\n\t\tcache_image = document.createElement('img');\n\t\tcache_image.src = arguments[i];\n\t\tcache.push( cache_image );\n\t}\n}","function addImages() {\n var images = ['heroImage', 'legacyLogo'];\n var img = null;\n for (var i = 0; i < images.length; i++) {\n var key = companyInfo['key'];\n if (companyInfo[images[i]].length > 0) {\n var url = 'https://media.licdn.com/media' + companyInfo[images[i]];\n img = $('![]()
');\n $(img).attr('src', url);\n img.data('file', null);\n img.data('name', images[i] + '-' + key);\n img.data('saved', false);\n img.data('scraped', true);\n createThumbnail(img, 'company-image-container');\n }\n }\n}","function loadCarousel() {\n var carousel_images = [\n \"/Content/icons/png/1.jpg\",\n \"/Content/icons/png/2.jpg\",\n \"/Content/icons/png/3.jpg\",\n \"/Content/icons/png/4.jpg\",\n \"/Content/icons/png/5.jpg\",\n \"/Content/icons/png/6.jpg\",\n \"/Content/icons/png/7.jpg\",\n \"/Content/icons/png/8.jpg\"];\n\n $(window).load(function () {\n $(\"#photo_container\").isc({\n imgArray: carousel_images\n });\n });\n }","function showLoadedImages(elem) {\r\n var i, span, reader, file;\r\n document.getElementById(elem).style.display = \"inline\";\r\n document.getElementById(elem).innerHTML = [];\r\n for (i = 0; i < images.length; i = i + 1) {\r\n file = images[i];\r\n reader = new FileReader();\r\n reader.onload = (function (file) {\r\n var j = i;\r\n return function (e) {\r\n span = document.createElement('span');\r\n span.className = \"tile\";\r\n span.onclick = function () {\r\n showImage(j, elem);\r\n };\r\n span.innerHTML = ['', file.name, '
', file.name, '![](\"', "\\"',")
'].join('');\r\n document.getElementById(elem).insertBefore(span, null);\r\n };\r\n })(file);\r\n reader.readAsDataURL(file);\r\n }\r\n }","function beginLoadingImage(arrayIndex, fileName, isGamePic) {\n if (isGamePic) {\n gamePics[arrayIndex] = document.createElement(\"img\");\n gamePics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\n gamePics[arrayIndex].src = \"images/\" + fileName;\n } else {\n worldPics[arrayIndex] = document.createElement(\"img\");\n worldPics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\n worldPics[arrayIndex].src = \"images/\" + fileName;\n }\n}","function preload()\n{\n dogImage=loadImage(\"images/dogImg.png\")\n happyDog=loadImage(\"images/Happy.png\")\n //bedroomImg=loadImage(\"images/Bed Room.png\")\n//gardenImg=loadImage(\"images/Garden.png\")\n//washroomImg=loadImage(\"images/Wash Room.png\")\n\t//load images here\n}","function preloadImages () {\n\tif (document.images)\n\t\t{\n\t\t\tclosed_img = new Image(11,11);\n\t\t\tclosed_img.src = \"images/closed.gif\";\n\t\t\t\n\t\t\topened_img = new Image(11,11);\n\t\t\topened_img.src = \"images/opened.gif\";\n\t\t}\n\telse {\n\t\talert (\"document.images not found!\")\n\t}\n}","function loadImages(elem) {\n if (!elem) {\n return;\n }\n\n var images = elem.getElementsByTagName('img');\n\n var n = images.length;\n for (var i = 0; i < n; i++) {\n var image = images[i];\n\n if (image.getAttribute('data-src')) {\n image.src = image.getAttribute('data-src');\n image.removeAttribute('data-src');\n }\n }\n }","function LoadContactRefs() {\n var imageObjects = $(\"img\").get();\n\n for (var i = 0; i < imageObjects.length; i++) {\n var img = imageObjects[i];\n var imageSource = $(img).attr('src');\n var sourceEnd = imageSource.substring(14, imageSource.length)\n\n switch (sourceEnd) {\n case \"github.png\": $(img).parent().attr(\"href\", \"https://github.com/captainsalt\"); break;\n case \"linkedin.png\": $(img).parent().attr(\"href\", \"https://www.linkedin.com/in/david-wright-659006144/\"); break;\n case \"stack.png\": $(img).parent().attr(\"href\", \"https://stackoverflow.com/users/7107832/captainsalt\"); break;\n }\n }\n}","function preloadImages() {\n for (var i = 0; i < numberOfGifsToPreload; i++) {\n popThenAddImage(fileNamesArray);\n }\n }","loadImages() {\n let loadCount = 0;\n let loadTotal = this.images.length;\n\n if (WP.shuffle) {\n this.images = this.shuffle(this.images);\n }\n\n const imageLoaded = (() => {\n loadCount++;\n\n if (loadCount >= loadTotal) {\n // All images loaded!\n this.setupCanvases();\n this.bindShake();\n this.loadingComplete();\n }\n }).bind(this);\n\n for (let image of this.images) {\n // Create img elements for each image\n // and save it on the object\n const size = this.getBestImageSize(image.src);\n image.img = document.createElement('img'); // image is global\n image.img.addEventListener('load', imageLoaded, false);\n image.img.src = image.src[size][0];\n }\n }","function lazyload(){\n var scrollTop = $(\"html, body\").scrollTop();\n $(\"img[data-src]\").each(function(){\n var top = $(this).offset().top - 800;\n var left = $(this).offset().left;\n\n\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\":visible\") ){\n $(this).attr(\"src\", $(this).attr(\"data-src\"));\n }\n });\n\n $(\"[data-background-src]\").each(function(){\n var top = $(this).offset().top - 800;\n var left = $(this).offset().left;\n if($(this).hasClass(\"main-kb-bg\")){\n if(scrollTop >= top){\n $(this).css(\"background-image\", \"url(\"+$(this).attr(\"data-background-src\")+\")\");\n }\n } else {\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\":visible\")){\n $(this).css(\"background-image\", \"url(\"+$(this).attr(\"data-background-src\")+\")\");\n }\n }\n\n });\n }","function loadImages(sources, callback) { \n\t\tfor(var src in sources) { \t// get num of sources\n numImages++;\n }\n for(var src in sources) {\n images[src] = new Image();\n\t\t\timages[src].onload = function() {\n\t\t\t\tif(++loadedImages >= numImages) {\n\t\t\t\tcallback(images);\n\t\t\t\t}\n\t\t\t};\n images[src].src = sources[src];\n }\n }","function loadImages() {\n var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n var urls = opts.urls,\n _opts$onProgress3 = opts.onProgress,\n onProgress = _opts$onProgress3 === undefined ? noop : _opts$onProgress3;\n\n (0, _assert2.default)(urls.every(function (url) {\n return typeof url === 'string';\n }), 'loadImages: {urls} must be array of strings');\n var count = 0;\n return Promise.all(urls.map(function (url) {\n var promise = (0, _browserLoad.loadImage)(url, opts);\n promise.then(function (file) {\n return onProgress({\n progress: ++count / urls.length,\n count: count,\n total: urls.length,\n url: url\n });\n });\n return promise;\n }));\n}","function createImages()\n{\n\tlargeImg.src = imgArray[0];\n\t\n\tfor (var i = 0; i < imgArray.length; i++)\n\t{\n\t\tfourImgsDiv.innerHTML += \"![](\" + imgArray[i] + \")
\";\n\t}\n}","loadImages() {\n if (this._queue.length > 0) {\n let img = new Image();\n let src = this._queue.pop();\n\n let name = src.slice(src.lastIndexOf('/') + 1);\n img.src = src;\n img.onload = (function() {\n this.loadImages();\n }).bind(this);\n this.images[name] = img;\n } else {\n this._callback();\n }\n }","function loadImages(images, string) {\n images.forEach((image, index) => {\n image.style.backgroundImage = \"url(./css/img/\" + string + (index + 1) + \".jpg)\";\n image.style.backgroundSize = \"contain\";\n })\n}","function renderImages() {\n //if ( viewSkins ) { renderSkins(); } // disabled here so plants can be rendered sequentially in plants.js\n if ( viewSpans ) { renderSpans(); }\n if ( viewPoints ) { renderPoints(); }\n if ( viewScaffolding ) { renderScaffolding(); }\n}","function getDirectoryImages() {\n\t\t\t// show image previews?\n\t\t\tif (opts.showImgPreview) {\n\t\t\t\tdoLoadDirectoryImage($('#browser ul li.GIF, #browser ul li.JPG, #browser ul li.PNG'), 0, sys.currentPathIdx);\n\t\t\t}\n\t\t}","function init() {\n cacheDom();\n loadImage();\n }","async function loadImages() {\n let data = arg.splice(1, arg.length - 1);\n let promise = [];\n data.forEach(img => {\n if(typeof img === \"string\") {\n let image = Canva2D.API.Preloader(\"singleImageOnly\", img);\n promise.push(image);\n } else if(img.hasOwnProperty(\"img\") && img.hasOwnProperty(\"src\")) {\n let image = Canva2D.API.Preloader(\"singleImageOnly\", img[\"img\"], img[\"src\"]);\n promise.push(image);\n } else {\n let image = Canva2D.API.Preloader(\"singleImageOnly\", img);\n promise.push(image);\n }\n });\n return await Promise.all(promise).then(e => {\n for(const img of e) \n _IMAGES_STACK.push(img);\n return _IMAGES_STACK;\n }).then(e => getImage);\n }","function load_images () {\n console.log(\"load images\");\n\n GM_addStyle(\"#display_img {position: fixed; left: 0px; top: 50px; opacity: 0.6; background-color: #000; width: 100%; height: calc(100% - 50px); display: none;} .postright img {cursor: zoom-in;}\");\n //adds the faded background\n let div = element(\"div\").a(\"id\", \"display_img\").apthis(document.getElementById(\"pagewrapper\"));\n //div that holds the image\n let div1 = document.createElement(\"div\");\n div1.setAttribute(\"style\", \"position: fixed; left: 0px; top: 50px; width: 100%; height: calc(100% - 50px); text-align: center; display: none; cursor: zoom-out;\");\n //the img element that will display the image\n let img = document.createElement(\"img\");\n img.setAttribute(\"src\", \"\");\n img.setAttribute(\"id\", \"display_img_img\");\n div1.appendChild(img);\n //this causes the faded background and image to disappear\n document.getElementById(\"pagewrapper\").appendChild(div1);\n div1.addEventListener(\"click\", (event) => {\n div.style.display = \"none\";\n div1.style.display = \"none\";\n });\n\n let posts = document.getElementsByClassName(\"postright\");\n for (let a of posts) {\n let imgs = a.getElementsByTagName(\"img\");\n for (let b of imgs) {\n b.addEventListener(\"click\", (event) => {\n img.setAttribute(\"src\", event.currentTarget.src);\n //gets current image size\n let img_width = event.currentTarget.clientWidth;\n let img_height = event.currentTarget.clientHeight;\n //going to be used for the dialation\n let scale_factor = 1.5;//this is the maximun a small image can be scalled up\n const display_width = window.innerWidth;\n const display_height = window.innerHeight - 50;\n let final_height = 0, final_width = 0;\n\n final_height = img_height * scale_factor;\n final_width = img_width * scale_factor;\n\n //this is the best solution to deal with all different screen sizes and images sizes\n //It have tried making multilayer if/else statemanets but they don't work well for this\n while (final_height > display_height || final_width > display_width) {\n scale_factor -= 0.1;\n final_height = img_height * scale_factor;\n final_width = img_width * scale_factor;\n }\n //makes it cerntered vertically and makes sure it has right hieght and width\n img.setAttribute(\"style\", \"width:\" + final_width + \"px; height:\" + final_height + \"px; position: relative; top:\" + (((display_height) / 2) - (final_height / 2)) + \"px;\");\n\n div.style.display = \"block\";\n div1.style.display = \"block\";\n });\n }\n }\n }","function showImages() {\r\n const images = document.querySelectorAll('[data-src]');\r\n const clientHeight = document.documentElement.clientHeight;\r\n for (let img of images) {\r\n const coord = img.getBoundingClientRect();\r\n let realSrc = img.dataset.src;\r\n if (!realSrc) continue;\r\n if (coord.top > -clientHeight &&\r\n coord.top < clientHeight * 2 ||\r\n coord.bottom > -clientHeight &&\r\n coord.bottom < clientHeight * 2) {\r\n img.src = realSrc;\r\n img.dataset.src = '';\r\n }\r\n }\r\n }","loadImg() {\n let loadedCount = 0\n function onLoad() {\n loadedCount++\n if (loadedCount >= this.imgPaths.length) {\n this.flowStart()\n }\n }\n this.baseImages = this.imgPaths.map(path => {\n const image = new Image()\n image.onload = onLoad.bind(this)\n image.src = path\n return image\n })\n }","function loadImage(){\n $(\".image-box\").attr(\"src\", displayedImg.download_url);\n}","function loadImage() {\n\t\t\tthis.loading = 'eager';\n\t\t\tif( this.src )\n\t\t\t\tthis.src = this.src;\n\t\t\tif( this.srcset )\n\t\t\t\tthis.srcset = this.srcset;\n\t\t}","function preloadImages(urls) {\n urls.forEach(url => {\n const image = new Image();\n image.src = url;\n });\n}","function loadImages(element) {\n const images = element.querySelectorAll(\".menu__slide--image img\");\n images.forEach(image => (image.src = image.dataset.src || image.src));\n}","function preLoad(onLoadAll) {\n \n var finished = false;\n \n var progressBar = {\n max : 0,\n loaded : 0\n };\n \n var updateBar = function() {\n \n var percnt = ((progressBar.loaded * 100) / progressBar.max) >> 0;\n $(\"#progress-bar\").width(percnt + '%');\n };\n \n var loadImage = function(img) {\n \n var e = document.createElement('img');\n\n e.onload = function() {\n\n progressBar.loaded++;\n updateBar();\n\n if(progressBar.loaded >= progressBar.max) {\n // once we get here, we are pretty much done, so redirect to the actual page\n if(!finished) {\n finished = true;\n helper.hide('progress-bar', 1000, false);\n onLoadAll();\n }\n }\n };\n \n e.onerror = e.onload;\n \n // this will trigger your browser loading the image (and caching it)\n e.src = img;\n };\n \n //Preload images\n $.ajax({\n url: \"./json/images.json\",\n success: function(images) {\n 'use strict';\n\n progressBar.max = images.length;\n\n var i = 0;\n\n while(i < images.length) {\n loadImage(images[i]);\n i++;\n }\n }\n });\n \n //Preload fonts\n var canvas = document.createElement('canvas');\n var ctx = canvas.getContext('2d');\n ctx.font = '12px Canaro';\n ctx.fillText('.', 0, 0);\n}","function showImages() {\n const images = document.querySelectorAll('[data-src]');\n const clientHeight = document.documentElement.clientHeight;\n for (let img of images) {\n const coord = img.getBoundingClientRect();\n let realSrc = img.dataset.src;\n if (!realSrc) continue;\n if (coord.top > -clientHeight &&\n coord.top < clientHeight * 2 ||\n coord.bottom > -clientHeight &&\n coord.bottom < clientHeight * 2) {\n img.src = realSrc;\n img.dataset.src = '';\n }\n }\n }","function loadImagesSeq() {\n\t\t const button = document.querySelector('#loadImagesSeq');\n\t\t const container = document.querySelector('#image-container');\n\t\t const promises = [];\n\t\t button.addEventListener(\"click\", (event) => {\n\n\t\t const images = imageNames();\n\n\t\t images.forEach((image) => {\n\t\t promises.push(requestInSeq(image, container));\n\t\t });\n\t\t console.log(promises);\n\t\t // when all promises are resolved then this promise is resolved.\n\t\t Promise.all(promises).then((imageDataObjs) => {\n\t\t console.log(imageDataObjs);\n\t\t imageDataObjs.forEach((imageData) => {\n\t\t const imageElement = imageData.imageElement;\n\t\t const imageSrc = imageData.objectURL;\n\t\t imageElement.src = imageSrc;\n\t\t });\n\n\t\t });\n\t\t });\n\n\n\t\t}","LoadImage(){\n var images=[]\n // hard coded for convenienceproxy to a static serving end point\n if(this.state.images!=undefined){\n this.state.images.map(i =>{\n images.push(\n this.request.getStamp()+'-' + i\n )\n })\n return images; \n }\n else{\n \n return null\n }\n }","function fetch_video_html_images() { \n var path = window.location.pathname;\n var page = path.split(\"/\").pop();\n\n if(page === 'video.html') {\n // Create element\n const div = document.createElement(\"div\");\n div.className = 'video-items';\n\n let output = '';\n const datas = Object.entries(countries);\n // console.log(datas);\n\n datas.forEach(d=> {\n // console.log(d[1][0]);\n output += `\n \n ![\"\"](\"${d[1].video_image}\")
\n ${d[0]}\n \n `;\n });\n\n div.innerHTML= output;\n\n document.querySelector(\".video-container\").insertAdjacentElement(\"beforeend\", div);\n\n // console.log(output);\n }\n }","function loadImages(sources, callback) {\n \tvar images = {};\n\n for(var src in sources) {\n \timages[src] = new Image();\n \timages[src].onload = callback;\n \timages[src].src = sources[src];\n }\n return images;\n }","function load_imdb_images () {\n return new Promise (resolve => {\n $.spinnerWait (true);\n userLog (\"Det här kan ta några minuter ...\", true, 5000)\n let cmd = '$( pwd )/ld_imdb.js -e ' + $(\"#imdbPath\").text (); // pwd = present working dir\n execute (cmd).then ( () => {\n // $ (\"button.updText\").css (\"float\", \"right\");\n // $ (\"button.updText\").hide ();\n resolve (\"Done\")\n });\n });\n}","function lazyLoad() {\n lazyImages.forEach(image => {\n if (image.offsetTop < window.scrollY + 150) {\n image.style.backgroundImage =\n `url(${image.getAttribute('data-src')})`;\n image.classList.add('loaded')\n }\n })\n}","function init() {\n cacheDom();\n loadImage();\n }","function preloadImages(images) {\n imagesAmount = images.length;\n for (var i = 0; i < images.length; i++) {\n var img = new Image();\n img.addEventListener('load', imageLoadedCallback, false);\n img.src = basePath + 'images/' + images[i];\n }\n }","function displayPages() {\r\n // Retrieve the the pages div element.\r\n var $pageDiv = $(\"#pageDiv\");\r\n \r\n // Clear the page div.\r\n while ($pageDiv[0].firstChild)\r\n $pageDiv[0].removeChild($pageDiv[0].firstChild);\r\n \r\n // Iterate through all of the pages in the pagesList.\r\n for (var i = 0; i < pageList.length; i++) {\r\n var page = pageList[i];\r\n \r\n // Create a new image element to represent the page.\r\n var img = document.createElement(\"IMG\");\r\n img.onload = function() {\r\n $(this).hide().pageToggle();\r\n };\r\n img.src = \"/ShowAndTellProject/\" + page.audio;\r\n img.id = \"pageThumbnail\";\r\n \r\n // Add highlight functionality to the image element.\r\n highlight(img);\r\n \r\n // Add the image to the pages div.\r\n $pageDiv.append(img); \r\n }\r\n}","function showImages() {\n var\n last = imgs.length,\n current,\n allImagesDone = true;\n\n for (current = 0; current < last; current++) {\n var img = imgs[current];\n // if showIfVisible is false, it means we have some waiting images to be\n // shown\n if(img !== null && !showIfVisible(img, current)) {\n allImagesDone = false;\n }\n }\n\n if (allImagesDone && pageHasLoaded) {\n }\n }","function LoadImage(ImageID){\r\n\tLoaded_Images_array_current = Loaded_Images_array.indexOf(ImageID);\r\n\t// console.debug(Loaded_Images);\r\n\t\r\n\tvar ImageThumb = Loaded_Images[ImageID].thumb\r\n\tvar ImageMain = Loaded_Images[ImageID].main\r\n\tvar LoadingImage = true;\r\n\r\n\t\r\n\t// Sets the link on the image to the image page\r\n\t$nav_content_img.parent().attr('href',Loaded_Images[ImageID].link)\r\n\t\r\n\t// Formats all the tags into a list of links\r\n\tvar ImageTagsFormatted = [];\r\n\tvar ImageTags = Loaded_Images[ImageID].tags.split(\" \");\r\n\t$.each(ImageTags, function(index, value) {\r\n\t\tImageTagsFormatted.push(''+value+'');\r\n\t})\r\n\t\r\n\t$('.image_nav_background').show();\r\n\t$image_nav_overlay.show();\r\n\t$nav_thumb_img.show();\r\n\t$text_overlay.empty().append(''+Loaded_Images[ImageID].filename+' | Page '+Loaded_Images[ImageID].page+' | Image '+Loaded_Images[ImageID].number+'
'+ImageTagsFormatted.join(' | '))\r\n\t\r\n\t$nav_content_img\r\n\t.data('ImageId',ImageID)\r\n\t\r\n\tvar current_status = Loaded_Images[ImageID].status;\r\n\t\r\n\t// Loads the image if it's already been verified previously.\r\n\tif(current_status == 'loaded' || current_status == 'error'){\r\n\t\t$nav_content_img.attr('src',ImageMain)\r\n\t\tif(current_status != 'loading')$nav_thumb_img.hide();\r\n\t\t$('.main_image_direct_link',$text_overlay).attr('href',ImageMain)\r\n\t\t\r\n\t\tRepositionMainImage();\r\n\t\r\n\t// Checks each image extension until it finds a working one\r\n\t}else if(current_status == 'waiting'){\r\n\t\tLoaded_Images[ImageID].status = 'loading';\r\n\t\tGM_xmlhttpRequest({\r\n\t\t\tmethod: \"GET\",\r\n\t\t\turl: '/'+Loaded_Images[ImageID].link,\r\n\t\t\tonload: function(retour) {\r\n\t\t\t\tLoaded_Images[ImageID].verified = true\r\n\t\t\t\tvar image;\r\n\t\t\t\tvar ResponseHTML = $(retour.responseText);\r\n\t\t\t\tvar ImageServer = $('div.content script:contains(\"image\"):contains(\"domain\"):contains(\"base_dir\")',ResponseHTML).text();\r\n\t\t\t\teval(ImageServer)\r\n\t\t\t\tvar new_image_url = image.domain+\"/\"+image.base_dir+\"/\"+image.dir+\"/\"+image.img;\r\n\t\t\t\tLoaded_Images[ImageID].main = new_image_url\r\n\t\t\t\t$(\"![]()
\")\r\n\t\t\t\t\t.attr(\"src\", new_image_url)\t\r\n\t\t\t\t\t.one('load',function(){\r\n\t\t\t\t\t\tLoaded_Images[ImageID].status = 'loaded';\r\n\t\t\t\t\t// Checks to make sure the successfully loading image actually is the one selected, since the load function for a previous image might be called after the user has switched to another.\r\n\t\t\t\t\t\tif($nav_content_img.data('ImageId') == ImageID){\r\n\t\t\t\t\t\t\t$nav_content_img.attr('src',new_image_url);\r\n\t\t\t\t\t\t\t$nav_thumb_img.hide();\r\n\t\t\t\t\t\t\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\r\n\t\t\t\t\t\t\tRepositionMainImage();\r\n\t\t\t\t\t\t}\t\t\t\t\t\t\r\n\t\t\t\t\t})\r\n\t\t\t\t\t.one('error',function(){\r\n\t\t\t\t\t\tLoaded_Images[ImageID].status = 'error';\r\n\t\t\t\t\t\tif($nav_content_img.data('ImageId') == ImageID){\r\n\t\t\t\t\t\t\t$nav_content_img.attr('src','/images/404.gif').one('load',function(){RepositionMainImage();});\r\n\t\t\t\t\t\t\t$nav_thumb_img.hide();\r\n\t\t\t\t\t\t\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});;\r\n\t\t\t}\r\n\t\t});\r\n\t}\r\n\t\r\n\t// Prevent left and right scrolling in background\r\n\t$('body').css({'overflow-x' : 'hidden', 'overflow-y': 'hidden'})\r\n}","function findImages(){\n var parentDir = \"./desc/civic_2012\";\n \n console.log(parentDir);\n var fileCrowler = function(data){\n var titlestr = $(data).filter('title').text();\n // \"Directory listing for /Resource/materials/xxx\"\n var thisDirectory = titlestr.slice(titlestr.indexOf('/'), titlestr.length)\n\n //List all image file names in the page\n $(data).find(\"a\").attr(\"href\", function (i, filename) {\n if( filename.match(/\\.(jpe?g|png|gif)$/) ) { \n var fileNameWOExtension = filename.slice(0, filename.lastIndexOf('.'))\n // var img_html = \"
\".format(thisDirectory + filename, fileNameWOExtension, fileNameWOExtension);\n // $(\"#sm_image\").append(img_html);\n $( \".templ\" ).appendTo( \"#sm_image\" );\n }\n else{ \n $.ajax({\n url: thisDirectory + filename,\n success: fileCrowler\n });\n }\n });}\n\n $.ajax({\n url: parentDir,\n success: fileCrowler\n });\n}","function load_media()\n{\n bg_sprite = new Image();\n bg_sprite.src = \"images/Background-stadt_lang.png\";\n box_sprite = new Image();\n box_sprite.src = \"images/Stift.png\";\n main_sprite = new Image();\n main_sprite.src = \"images/IMG_2210_Mini.png\";\n}","function startImgStatus(){\n var img = document.createElement('img'); // Hack to extract absolute url\n $jQ('img').each(function(){\n img.src=$jQ(this).attr('src');\n setLink($jQ(this),'src', img.src);\n });\n}"],"string":"[\n \"function loadImages() {\\n\\t\\t const button = document.querySelector('#loadImages');\\n\\t\\t const container = document.querySelector('#image-container');\\n\\n\\t\\t button.addEventListener(\\\"click\\\", (event) => {\\n\\n\\t\\t const images = imageNames();\\n\\t\\t images.forEach((image) => {\\n\\t\\t requestFor(image, container).then(imageData => {\\n\\t\\t const imageElement = imageData.imageElement;\\n\\t\\t const imageSrc = imageData.objectURL;\\n\\t\\t imageElement.src = imageSrc;\\n\\t\\t });\\n\\t\\t });\\n\\t\\t });\\n\\t\\t}\",\n \"function load_images() {\\n data.each(function(frame) {\\n var imgs = []\\n frame.images.each(function(imgstr) {\\n var img = new Image(IMG_WIDTH, IMG_HEIGHT);\\n img.src = \\\"/img/\\\" + imgstr;\\n img.style.float = \\\"left\\\";\\n imgs.push(img); \\n });\\n frame['imageobjs'] = imgs;\\n }) \\n }\",\n \"function getImages() {\\n\\t$.get(\\\"resources/get_images.php\\\", {\\\"page\\\": globalPage}).success(function(data) {\\n\\t\\tglobalPage++;\\n\\t\\t\\n\\t\\tvar imgz = JSON.parse(data).images;\\n\\t\\tgenerateThumbnails(imgz);\\n\\t\\tgenerateShowMoreButton(imgz);\\n\\t}).fail(function() {\\n\\t\\twindow.location.replace(\\\"index.php\\\");\\n\\t});\\n}\",\n \"function renderImages() {\\n $('.landing-page').addClass('hidden');\\n $('.img-round').removeClass('hidden');\\n updateSrcs();\\n currentOffset+=100;\\n }\",\n \"function start_loadImages()\\n {\\n methods.loadImages(\\n function() {\\n methods.getDataURI();\\n run_app();\\n },\\n imagesRack.imgList\\n );\\n }\",\n \"function loadImages() {\\r\\n new Image('(\\\"Robot\\\") Bag','/images/bag.jpg', 0);\\r\\n new Image('Bathroom Phone Holder','/images/bathroom.jpg', 0);\\r\\n new Image('Breakfast Maker','/images/breakfast.jpg', 0);\\r\\n new Image('Meatball Bubblegum','/images/bubblegum.jpg', 0);\\r\\n new Image('Chair','/images/chair.jpg', 0);\\r\\n new Image('Cthulhu','/images/cthulhu.jpg', 0);\\r\\n new Image('Duck Mask','/images/dog-duck.jpg', 0);\\r\\n new Image('Dragon','/images/dragon.jpg', 0);\\r\\n new Image('U-Pensils','/images/pen.jpg', 0);\\r\\n new Image('Pet Sweep','/images/pet-sweep.jpg', 0);\\r\\n new Image('Pizza Scissors','/images/scissors.jpg', 0);\\r\\n new Image('Shark Blanket','/images/shark.jpg', 0);\\r\\n new Image('Baby Sweep','/images/sweep.png', 0);\\r\\n new Image('TaunTaun Sleepingbag','/images/tauntaun.jpg', 0);\\r\\n new Image('Unicorn Meat','/images/unicorn.jpg', 0);\\r\\n new Image('USB','/images/usb.gif', 0);\\r\\n new Image('Water Can','/images/water-can.jpg', 0);\\r\\n new Image('Wine Glass','/images/wine-glass.jpg', 0);\\r\\n new Image('boots', '/images/boots.jpg', 0);\\r\\n new Image('banana','/images/banana.jpg', 0);\\r\\n }\",\n \"function loadAllImages() {\\n var images = document.querySelectorAll('img[data-src]');\\n\\n for (var i = 0; i < images.length; i++) {\\n ImageLoader.load(images[i]);\\n }\\n }\",\n \"function loadImages() {\\n $('img[data-src]').each(function () {\\n var src = $(this).data('src');\\n var style = $(this).data('style');\\n $(this).attr('src', src);\\n $(this).attr('style', style);\\n });\\n}\",\n \"function loadImages() {\\n var files = [ 'outer_light.png', 'layer_down_light.png',\\n 'layer_up_light.png', 'angle_prev_light.png',\\n 'angle_next_light.png', 'linked_data_light.png',\\n 'raw_scan_light.png', 'dig_positive_light.png',\\n 'text_view_light.png', 'vector_view_light.png',\\n 'overlays_light.png', 'thumbnails_light.png',\\n '3d_view_light.png', 'step_back_light.png',\\n 'step_fwd_light.png', 'minimize_light.png' ];\\n\\n var i = 0;\\n for (i = 0; i < files.length; i++) {\\n btnImages[i] = new Image(); btnImages[i].src = files[i];\\n }\\n}\",\n \"function findImagesToLoad() {\\n\\tsetLazyImagePositions.call(this);\\n\\tconst imagesToLoad = getImagesInView(this.images);\\n\\tloadImages.call(this, imagesToLoad);\\n}\",\n \"function LoadImages()\\n{\\n\\tvar loadedImages = 0;\\n\\tvar numImages = 0;\\n\\tfor (var src in ImgList)\\n\\t{\\n\\t\\tnumImages++;\\n\\t}\\n\\tfor (var src in ImgList)\\n\\t{\\n\\t\\tImgs[src] = new Image();\\n\\t\\tImgs[src].onload = function()\\n\\t\\t{\\n\\t\\t\\tloadedImages = loadedImages +1;\\n\\t\\t\\tif(loadedImages >= numImages)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//Finished loading!\\n\\t\\t\\t\\ttstsetup();\\n\\t\\t\\t\\tImgsFinished = 1;\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\t\\tif (src < 6)\\n\\t\\t{\\n\\t\\t\\tImgs[src].src = ImgList[src];\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tImgs[src].src = ImgURL + ImgList[src];\\n\\t\\t}\\n\\t}\\n}\",\n \"function fetchImages() {\\n $.getJSON(\\\"/images.php\\\", function(data) {\\n preloadImages(data);\\n }); \\n }\",\n \"function loadImages() {\\n bsImage = new Image();\\n bsImage.src = \\\"resources/resources/images/spritesheets/buttons_1.png\\\";\\n wallImag = new Image();\\n wallImag.src = \\\"resources/resources/images/spritesheets/jungle_wall.png\\\";\\n ssImage = new Image();\\n ssImage.src = \\\"resources/resources/images/spritesheets/sprites_final.png\\\";\\n window.setTimeout(setup, 1500);\\n aImage = new Image();\\n aImage.src = \\\"resources/resources/images/spritesheets/uparr.png\\\"\\n}\",\n \"function loadImages(div){\\r\\n\\tvar images = [];\\r\\n\\tjQuery.each(jQuery(div+' img'), function(i,img){\\r\\n\\t\\tif(!jQuery(img).attr('src') || jQuery(img).attr('src')==''){\\r\\n\\t\\t\\timages.push(img);\\r\\n\\t\\t}\\r\\n\\t});\\r\\n\\tjQuery(images).each( function(i,image) {\\r\\n\\t\\tjQuery(this).attr('src',jQuery(this).attr('longdesc'));\\r\\n\\t});\\r\\n}\",\n \"function loadImage() {\\n var baseUrl = 'https://source.unsplash.com/category';\\n var category = 'nature';\\n var size = '1920x1080';\\n\\n var source = baseUrl + '/' + category + '/' + size;\\n\\n buildElement(source)\\n .then(render);\\n }\",\n \"function loadImages() {\\r\\n var files = document.getElementById('images').files, i, file, reader;\\r\\n for (i = 0; i < files.length; i = i + 1) {\\r\\n file = files[i];\\r\\n if (file.name.endsWith(\\\".jpg\\\") || file.name.endsWith(\\\".gif\\\") || file.name.endsWith(\\\".png\\\")) {\\r\\n images.push(file);\\r\\n }\\r\\n }\\r\\n if (images.length > 0) {\\r\\n showLoadedImages(\\\"list\\\");\\r\\n } else {\\r\\n alert(\\\"No images found. Try another directory.\\\");\\r\\n }\\r\\n }\",\n \"function loadVisiblePages() {\\n // Fetch page images that are currently shown on the site\\n var firstVisibleImageLinks = $('#imageList li>a').not('.page-text').withinviewport();\\n $.each(firstVisibleImageLinks, function(index, aEl) {\\n var imgEl = $(aEl).find('img');\\n // Check if the image is already loaded\\n if( $(imgEl).attr('src') !== '' )\\n return;\\n\\n // Load page images via Ajax\\n $.get( \\\"ajax/image/page\\\", { \\\"imageId\\\" : globalImageType, \\\"pageId\\\" : $(aEl).attr('data-pageid'), \\\"width\\\" : 150 } )\\n .always(function( data ) {\\n // Remove broken image icon first\\n var nextEl = $(imgEl).next();\\n if( nextEl.length !== 0 ) {\\n $(nextEl).remove();\\n }\\n })\\n .done(function( data ) {\\n $(imgEl).attr('src', \\\"data:image/jpeg;base64, \\\" + data);\\n })\\n .fail(function( data ) {\\n $(imgEl).after('broken_image');\\n });\\n });\\n}\",\n \"function loadImage() {\\n\\n // image file not loaded yet? => load image file\\n if ( !resource ) jQuery( '![](\\\"')
' );\\n\\n // immediate perform success callback\\n success();\\n\\n }\",\n \"function loadImages() {\\n\\t// for each image container\\n\\t$('.image-container').each(function() {\\n\\t\\t// get medium-sized image filename\\n\\t\\tvar img_filename = $('img', $(this)).attr('data-imglarge')\\n\\t\\tvar img_med_filename = img_filename.substring(0, img_filename.indexOf('.png')) + '_medium.jpg'\\n\\n\\t\\t// // load medium-sized image\\n\\t\\t// var imgLarge = new Image()\\n\\t\\t// $(imgLarge).addClass('artwork')\\n\\t\\t// \\t.attr('src', img_med_filename)\\n\\t\\t// \\t.attr('data-imglarge', img_filename)\\n\\t\\t// \\t.attr('alt', $('.placeholder', $(this)).attr('alt'))\\n\\t\\t// \\t.on('load', () => {\\n\\t\\t// \\t\\t$(imgLarge).addClass('loaded')\\n\\t\\t// \\t})\\n\\t\\t// $(this).append($(imgLarge))\\n\\n\\t\\t// update placeholder image src\\n\\t\\t$('.placeholder', $(this)).attr('src', img_med_filename)\\n\\t\\t\\t.attr('data-imglarge', img_filename)\\n\\t\\t\\t.css('filter', 'none')\\n\\t})\\n\\tconsole.log('window loaded!')\\n}\",\n \"function loadImages (){\\n var img = [\\n 'src/Barba Garcia, Francisco.jpg',\\n 'src/Barba Rodriguez, Arturo.jpg',\\n 'src/Caro Bernal, Miguel Angel.jpg',\\n 'src/Castillo Peña, José Luis.jpg',\\n 'src/Cruz Vidal, Alejandro.jpg',\\n 'src/Gallego Martel, Jose Maria.jpg',\\n 'src/Garci Peña, José Joaquín.jpg',\\n 'src/Vazquez Rodriguez, Maria del Mar.jpg',\\n ];\\n\\n setImgs(shuffle(initImgs(img)));\\n}\",\n \"function loadImages() {\\n floor = new Image();\\n background = new Image();\\n ring = new Image();\\n platform = new Image();\\n\\n floor.src = './tile-images/floorpath.png';\\n background.src = './tile-images/plainbackgroundtile.png';\\n ring.src = './tile-images/ring.png';\\n platform.src = './tile-images/platform.png';\\n}\",\n \"function display_advertise_images() {\\n}\",\n \"function refreshImages() {\\n var images = document.querySelectorAll('img[data-src]');\\n\\n for (var i = 0; i < images.length; i++) {\\n ImageLoader.load(images[i]);\\n }\\n }\",\n \"function loadImages(){\\n prev_btnj.addClass('loading')\\n next_btnj.addClass('loading')\\n fs.readdir(dirname, (err, files) => {\\n if (!err){\\n images = files.filter(isImage)\\n curIndex = images.indexOf(basename)\\n prev_btnj.removeClass('loading')\\n next_btnj.removeClass('loading')\\n setBtn()\\n }\\n })\\n}\",\n \"function loadImages() {\\n testPattern = new Image();\\n testPattern.src = \\\"testpattern.gif\\\";\\n }\",\n \"function loadImages() {\\r\\n\\t\\tremoveUnseenImages();\\r\\n\\t\\tvar sets = $['mapsettings'];\\r\\n\\t\\tvar range = getPixelRange();\\r\\n\\t\\tfor(var i=range.start.x; i![]()
').attr({\\n id: \\\"image\\\" + i,\\n src: config.imgDir + i + config.imgFormat,\\n title: \\\"Image\\\" + i\\n }).appendTo(\\\"#\\\" + config.imgContainer);\\n }\\n }\",\n \"function preloadImages() {\\n\\tidList.forEach(function(id) {\\n\\t\\tlet $newImage = $('#image-preloader').clone();\\n\\t\\t$newImage.attr('src', `${ART_URL}${id}.png`);\\n\\t\\t$('#image-preloader-container').append();\\n\\t});\\n}\",\n \"function loadImage() {\\n var baseUrl = 'https://source.unsplash.com/category',\\n cat = 'nature',\\n size = '1920x1080';\\n\\n buildElement(`${baseUrl}/${cat}/${size}`).then(render);\\n }\",\n \"function getImages() {\\n alert(\\\"Page will reload once images are finished loading\\\");\\n // runs 1540photo.py, which collects images from Gmail\\n exec(\\\"python 1540photo.py\\\");\\n loaded_images_from_tba = 0;\\n // for each team, loads media\\n for (let team_id in teams) {\\n loadMediaFromTBA(teams[team_id]);\\n }\\n // gets local files\\n let local_dir = fs.readdirSync(\\\"./data/images/\\\");\\n for (let team_id in local_dir) {\\n try {\\n let file = local_dir[team_id];\\n if (manifest_images.indexOf(file) < 0) {\\n manifest_images.push(file);\\n }\\n } catch (_) {}\\n }\\n // checks to see if all images are loaded, and saves a manifest if true\\n window.setInterval(saveImageManifest, 3000);\\n}\",\n \"function renderImages() {\\n imgElem.src = Actor.all[0].path;\\n}\",\n \"function loadImages(atlas)\\n\\t\\t{\\n\\t\\t\\tdataAtlas = atlas.tiles;\\n\\t\\t\\tplayerAtlas = atlas.player;\\n\\n\\t\\t\\tlet images = [\\\"img/Tiles/sheet.png\\\", \\\"img/Player/p1_spritesheet.png\\\"];\\n\\t\\t\\tlet imgsPromises = images.map (function (url)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn new Promise ( (ok, error) => {\\n\\t\\t\\t\\t\\tvar img = new Image();\\n\\t\\t\\t\\t\\timg.src = url;\\n\\t\\t\\t\\t\\timg.onload = () => ok(img);\\n\\t\\t\\t\\t});\\n\\t\\t\\t});\\n\\t\\t\\treturn (Promise.all(imgsPromises))\\n\\t\\t}\",\n \"preloadImages(doload, callback) {\\n\\t\\tconst paths = this.getImagePaths();\\n\\t\\tfor (let i = 0; i < paths.length; i++) {\\n\\t\\t\\tgraphics.add(paths[i]);\\n\\t\\t}\\n\\t\\tif (doload) {\\n\\t\\t\\tgraphics.load(callback);\\n\\t\\t}\\n\\t}\",\n \"function ImageController(){\\n\\t\\tvar imageService = new ImageService()\\n\\t\\t$.get(window.location.pathname + '-image-tag.html', function(data){\\n\\t\\t\\t$('.main-container').append(data)\\n\\t\\t})\\n\\t\\timageService.getImage(function(imageData){\\n\\t\\t\\t$('body').css('background-image', `url(\\\"${imageData.url}\\\")`);\\n\\t\\t\\tconsole.log(imageData.large_url)\\n\\t\\t\\t$('.image-link').attr('href', imageData.large_url!==null? imageData.large_url : imageData.url)\\n\\t\\t})\\n\\t}\",\n \"function loadImg(){\\n document.productImg.src = myImgSrc + myImg[i] + myImgEnd;\\n}\",\n \"function loadImage() {\\n\\t\\t$('div.thumbnail a img').on('click', function(){\\n\\t\\t\\tvar image = this.src;\\n\\t\\t\\t$('.image-load').html('');\\n\\t\\t});\\n\\t}\",\n \"function loadImage(imageName, imageLocation)\\n{\\nif (document.images) document.images[imageName].src = imageLocation;\\nreturn true;\\n}\",\n \"function Load_Page(CurrentImageID){\\r\\n\\t\\r\\n\\t\\r\\n\\tvar Image_Number = Loaded_Images[CurrentImageID].number;\\r\\n\\tvar Image_Page = Loaded_Images[CurrentImageID].page\\r\\n\\t\\r\\n\\t// Checks which page direction and if it's the end of the list.\\r\\n\\t\\r\\n\\t// Going towards the left\\r\\n\\tvar backPaging = (Image_Number <= 1 && Image_Page > 1)\\r\\n\\tvar FrontWall = (Image_Page == FirstPage)\\r\\n\\t\\r\\n\\t// Going towards the right\\r\\n\\tvar forwardPaging = (Image_Number >= ImagesPerPage && Image_Page >= 1)\\r\\n\\tvar RearWall = (Image_Number < ImagesPerPage && Image_Page == LastPage)\\r\\n\\tif(backPaging && !FrontWall){\\r\\n\\t\\tvar PageSelect = Image_Page-1\\r\\n\\t\\t// console.debug('backpaging')\\r\\n\\t}else if(forwardPaging && !RearWall){\\r\\n\\t\\tvar PageSelect = Image_Page+1\\r\\n\\t\\t// console.debug('forwardPaging')\\r\\n\\t}else{\\r\\n\\t\\t// console.debug('wall')\\r\\n\\t\\tPageSelect = Image_Page\\r\\n\\t};\\r\\n\\r\\n\\t\\r\\n\\t\\r\\n\\t// Takes the requested page and converts into a URL string to load.\\r\\n\\tif(backPaging || forwardPaging){\\r\\n\\t$nav_thumb_img.show();\\r\\n\\tPageSelect -= 1\\r\\n\\tPageSelect = PageSelect*ImagesPerPage\\r\\n\\t\\r\\n\\tif(document.URL.indexOf('pid=') > -1){\\r\\n\\t\\tvar requestURL = document.URL.replace(/pid\\\\=[0-9]{1,}/,'pid='+PageSelect);\\r\\n\\t}else{\\r\\n\\t\\tvar requestURL = document.URL+'&pid='+PageSelect;\\r\\n\\t};\\r\\n\\t// console.debug(requestURL+' Loading...')\\r\\n\\tGM_xmlhttpRequest({\\r\\n\\t\\tmethod: \\\"GET\\\",\\r\\n\\t\\turl: requestURL,\\r\\n\\t\\tonload: function(retour) {\\r\\n\\t\\t\\t// console.debug(retour)\\r\\n\\t\\t\\t$nav_thumb_img.hide();\\r\\n\\t\\t\\tResponseHTML = $(retour.responseText);\\r\\n\\t\\t\\tvar ImageNumber = 0\\r\\n\\t\\t\\t$('.content span.thumb', ResponseHTML).each(function(){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tvar $this_span = $(this)\\r\\n\\t\\t\\t\\tvar ImageID = $this_span.attr('id');\\r\\n\\t\\t\\t\\tvar ImageThumb = $('img.preview' ,$this_span).attr('src');\\r\\n\\t\\t\\t\\tvar ImageTags = $('img.preview' ,$this_span).attr('alt');\\r\\n\\t\\t\\t\\tvar ImagePage = parseInt($('#paginator .pagination b', ResponseHTML).text());\\r\\n\\t\\t\\t\\tvar ImageMain = ImageThumb.replace('thumbnail_','').replace(\\\"/r34/thumbnails/\\\",'//images/').replace(\\\"/rule34/thumbnails/\\\",'/rule34//images/')\\r\\n\\t\\t\\t\\tvar ImageLink = $('a[href^=\\\"'+Setting_ImageLinkBegins+'\\\"]',$this_span).attr('href');\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// console.debug(ImageMain);\\r\\n\\t\\t\\t\\t// http://cdn.rule34.xxx/r34/thumbnails/1354/thumbnail_23a69eecacb1cd8c36045e45657800e8f257e950.jpg?1411722\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tImageNumber++\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tAddImage(ImageID,ImageThumb,ImageMain,ImagePage,ImageNumber,ImageLink,ImageTags)\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSort_images();\\r\\n\\t\\t\\tvar Cur_Image_ID = $('.image_nav_content img.main_img').data('ImageId')\\r\\n\\t\\t\\tvar Image_Number2 = Loaded_Images_array.indexOf(Cur_Image_ID);\\r\\n\\t\\t\\tif(backPaging){\\r\\n\\t\\t\\t\\tImage_Number2--\\r\\n\\t\\t\\t\\t// console.debug('backPaging')\\r\\n\\t\\t\\t}else if(forwardPaging){\\r\\n\\t\\t\\t\\tImage_Number2++\\r\\n\\t\\t\\t\\t// console.debug('forwardPaging')\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// console.debug(Cur_Image_ID+' ID, Number: '+Image_Number2)\\t\\t\\t\\r\\n\\t\\t\\tNew_Image = Loaded_Images_array[Image_Number2]\\r\\n\\t\\t\\t// console.debug(New_Image)\\r\\n\\t\\t\\tLoadImage(New_Image);\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t});\\r\\n\\t};\\r\\n \\r\\n}\",\n \"function preloader() {\\n\\tif (document.images) {\\n\\t\\tvar img1 = new Image();\\n\\t\\tvar img2 = new Image();\\n\\t\\tvar img3 = new Image();\\n\\t\\tvar img4 = new Image();\\n\\n\\t\\timg1.src = \\\"./imgs/sunny.jpg\\\";\\n\\t\\timg2.src = \\\"./imgs/sunset.jpg\\\";\\n\\t\\timg3.src = \\\"./imgs/stars.jpg\\\";\\n\\t\\timg4.src = \\\"./imgs/downtown.jpg\\\";\\n\\t}\\n}\",\n \"function preload() {\\n println(\\\"loading images\\\")\\n img = [loadImage(\\\"./assets/AmericaFirst.png\\\"), loadImage(\\\"./assets/AuditTheVote.png\\\"), loadImage(\\\"./assets/Hillary.png\\\"), loadImage(\\\"./assets/MAGA.png\\\"), loadImage(\\\"./assets/TrumpTrain.png\\\")];\\n\\n}\",\n \"function lazyLoad(){\\n\\tvar $images = $('.lazy_load');\\n\\n\\t$images.each(function(){\\n\\t\\tvar $img = $(this),\\n\\t\\t\\tsrc = $img.attr('data-img');\\n\\t\\t$img.attr('src',src);\\n\\t});\\n}\",\n \"function loadImageUrls() {\\n fetch(\\\"https://api.imgflip.com/get_memes\\\")\\n .then((result) => result.json())\\n .then(({ data: { memes: loadedMemes } = {} }) => {\\n memes = loadedMemes;\\n showImage(0);\\n });\\n }\",\n \"function loadImages(imagesToLoad) {\\n\\timagesToLoad.forEach(lazyImage => {\\n\\t\\tthis.fireLazyEvent(lazyImage.image);\\n\\t\\tlazyImage.resolved = true;\\n\\t});\\n}\",\n \"function displayPhotos() {\\n loader.hidden = true;\\n photos.forEach((photo) => {\\n // Create Unspalsh page Link for the image\\n const imageLink = document.createElement(\\\"a\\\");\\n imageLink.setAttribute(\\\"href\\\", photo.links.html);\\n imageLink.setAttribute(\\\"target\\\", \\\"_blank\\\");\\n\\n // Create image element\\n const img = document.createElement(\\\"img\\\");\\n img.setAttribute(\\\"src\\\", photo.urls.regular);\\n img.setAttribute(\\\"alt\\\", photo.alt_description);\\n img.setAttribute(\\\"title\\\", photo.alt_description);\\n\\n imageLink.appendChild(img);\\n imageContainer.appendChild(imageLink);\\n\\n //event listner for image\\n img.addEventListener(\\\"load\\\", imageLoaded);\\n });\\n}\",\n \"function getLoadedImages() {\\r\\n return images;\\r\\n }\",\n \"function preload(){\\n images.forEach(function(elem) {\\n im = new Image();\\n im.src = elem;\\n });\\n}\",\n \"function preloadImages() {\\n var images = [\\n 'btn_action_active.png',\\n\\t'btn_focus_active.png',\\n 'btn_up_active.png',\\n 'btn_right_active.png',\\n 'btn_left_active.png',\\n 'btn_down_active.png',\\n 'prybar.png',\\n 'machete.png',\\n 'sample_dna.png',\\n 'pickaxe.png',\\n 'fuel.png',\\n 'fire_extinguisher.png',\\n 'dynamite.png',\\n 'dna_sampler.png'\\n ];\\n $(images).each(function() {\\n $('![]()
')[0].src = this;\\n (new Image()).src = this;\\n });\\n}\",\n \"function LoadSliderImages(sublist) {\\n\\t\\t\\tvar numImages = sublist.find('.item > a > .src').length;\\n\\t\\t\\tsublist.find('.item > a > .src').each(function(i) {\\n\\t\\t\\t\\tvar img = new Image();\\n\\t\\t\\t\\tvar imgSrc = $(this).html();\\n\\t\\t\\t\\tvar imgAlt = $(this).parent().find('.alt').html();\\n\\t\\n\\t\\t\\t\\t$(this).parent().append(img);\\n\\t\\t\\t \\n\\t\\t\\t\\t// wrap our new image in jQuery, then:\\n\\t\\t\\t\\t$(img).load(function () {\\n\\t\\t\\t\\t\\tnumImages--;\\n\\t\\t\\t\\t\\tif (numImages == 0) {\\n\\t\\t\\t\\t\\t\\tSetSublist(sublist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\tif (i == sublist.find('.item > a > .src').size() - 1) {\\n\\t\\t\\t\\t\\t\\tSetSublist(sublist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t*/\\n\\t\\t\\t\\t})\\n\\t\\t\\t\\t.error(function () {\\n\\t\\t\\t\\t// notify the user that the image could not be loaded\\n\\t\\t\\t\\t})\\n\\t\\t\\t\\t.attr('src', imgSrc).attr('alt', imgAlt);\\n\\t\\t\\t});\\n\\t\\t}\",\n \"function preloadImages() {\\n\\tif (document.images) {\\n\\t\\tfor (var i = 0; i < preloadImages.arguments.length; i++) {\\n\\t\\t\\t(new Image()).src = preloadImages.arguments[i];\\t\\n\\t\\t}\\n\\t}\\n} // end image preloader\",\n \"function preload(){\\r\\n img=loadImage('https://upload.wikimedia.org/wikipedia/commons/8/81/Dalai_Lama_%2814566605561%29.jpg')\\r\\n\\r\\n img1=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/02/Nelson_Mandela_1994.jpg')\\r\\n\\r\\n img2=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/00/Bill_Clinton_1999_Presidential_Medal_of_Freedom_%281%29.jpg')\\r\\n\\r\\nimg3=loadImage('https://live.staticflickr.com/65535/49245065008_a7082b2a41_b.jpg')\\r\\n}\",\n \"loadImages(): void {\\n let self = this;\\n let items = this.getState().items;\\n for (let i = 0; i < items.length; i++) {\\n let item: ItemType = items[i];\\n // Copy item config\\n let config: ImageViewerConfigType = {...item.viewerConfig};\\n if (_.isEmpty(config)) {\\n config = makeImageViewerConfig();\\n }\\n let url = item.url;\\n let image = new Image();\\n image.crossOrigin = 'Anonymous';\\n self.images.push(image);\\n image.onload = function() {\\n config.imageHeight = this.height;\\n config.imageWidth = this.width;\\n self.store.dispatch({type: types.LOAD_ITEM, index: item.index,\\n config: config});\\n };\\n image.onerror = function() {\\n alert(sprintf('Image %s was not found.', url));\\n };\\n image.src = url;\\n }\\n }\",\n \"function _onImageLoaded() {\\n _imagesToLoad = _imagesToLoad - 1;\\n if (!_imagesToLoad) {\\n $$log(\\\"All images loaded, rendering again.\\\");\\n PP64.renderer.render();\\n }\\n }\",\n \"function fnLoadPngs(){\\n var rslt = navigator.appVersion.match(/MSIE (\\\\d+\\\\.\\\\d+)/, '');\\n var itsAllGood = (rslt != null && Number(rslt[1]) >= 5.5);\\n \\n for (var i = document.images.length - 1, img = null; (img = document.images[i]); i--){\\n if (itsAllGood && img.src.match(/\\\\.png$/i) != null) {\\n var src = img.src;\\n var div = document.createElement(\\\"DIV\\\");\\n \\n div.style.filter = \\\"progid:DXImageTransform.Microsoft.AlphaImageLoader(src='\\\" + src + \\\"', sizing='scale')\\\"\\n div.style.width = img.width + \\\"px\\\";\\n div.style.height = img.height + \\\"px\\\";\\n img.replaceNode(div);\\n }\\n \\n img.style.visibility = \\\"visible\\\";\\n }\\n}\",\n \"function pilau_preload_images() {\\n\\tvar args_len, i, cache_image;\\n\\targs_len = arguments.length;\\n\\tfor ( i = args_len; i--;) {\\n\\t\\tcache_image = document.createElement('img');\\n\\t\\tcache_image.src = arguments[i];\\n\\t\\tcache.push( cache_image );\\n\\t}\\n}\",\n \"function addImages() {\\n var images = ['heroImage', 'legacyLogo'];\\n var img = null;\\n for (var i = 0; i < images.length; i++) {\\n var key = companyInfo['key'];\\n if (companyInfo[images[i]].length > 0) {\\n var url = 'https://media.licdn.com/media' + companyInfo[images[i]];\\n img = $('![]()
');\\n $(img).attr('src', url);\\n img.data('file', null);\\n img.data('name', images[i] + '-' + key);\\n img.data('saved', false);\\n img.data('scraped', true);\\n createThumbnail(img, 'company-image-container');\\n }\\n }\\n}\",\n \"function loadCarousel() {\\n var carousel_images = [\\n \\\"/Content/icons/png/1.jpg\\\",\\n \\\"/Content/icons/png/2.jpg\\\",\\n \\\"/Content/icons/png/3.jpg\\\",\\n \\\"/Content/icons/png/4.jpg\\\",\\n \\\"/Content/icons/png/5.jpg\\\",\\n \\\"/Content/icons/png/6.jpg\\\",\\n \\\"/Content/icons/png/7.jpg\\\",\\n \\\"/Content/icons/png/8.jpg\\\"];\\n\\n $(window).load(function () {\\n $(\\\"#photo_container\\\").isc({\\n imgArray: carousel_images\\n });\\n });\\n }\",\n \"function showLoadedImages(elem) {\\r\\n var i, span, reader, file;\\r\\n document.getElementById(elem).style.display = \\\"inline\\\";\\r\\n document.getElementById(elem).innerHTML = [];\\r\\n for (i = 0; i < images.length; i = i + 1) {\\r\\n file = images[i];\\r\\n reader = new FileReader();\\r\\n reader.onload = (function (file) {\\r\\n var j = i;\\r\\n return function (e) {\\r\\n span = document.createElement('span');\\r\\n span.className = \\\"tile\\\";\\r\\n span.onclick = function () {\\r\\n showImage(j, elem);\\r\\n };\\r\\n span.innerHTML = ['', file.name, '
', file.name, '![](\\\"', "\\\\"',")
'].join('');\\r\\n document.getElementById(elem).insertBefore(span, null);\\r\\n };\\r\\n })(file);\\r\\n reader.readAsDataURL(file);\\r\\n }\\r\\n }\",\n \"function beginLoadingImage(arrayIndex, fileName, isGamePic) {\\n if (isGamePic) {\\n gamePics[arrayIndex] = document.createElement(\\\"img\\\");\\n gamePics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\\n gamePics[arrayIndex].src = \\\"images/\\\" + fileName;\\n } else {\\n worldPics[arrayIndex] = document.createElement(\\\"img\\\");\\n worldPics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\\n worldPics[arrayIndex].src = \\\"images/\\\" + fileName;\\n }\\n}\",\n \"function preload()\\n{\\n dogImage=loadImage(\\\"images/dogImg.png\\\")\\n happyDog=loadImage(\\\"images/Happy.png\\\")\\n //bedroomImg=loadImage(\\\"images/Bed Room.png\\\")\\n//gardenImg=loadImage(\\\"images/Garden.png\\\")\\n//washroomImg=loadImage(\\\"images/Wash Room.png\\\")\\n\\t//load images here\\n}\",\n \"function preloadImages () {\\n\\tif (document.images)\\n\\t\\t{\\n\\t\\t\\tclosed_img = new Image(11,11);\\n\\t\\t\\tclosed_img.src = \\\"images/closed.gif\\\";\\n\\t\\t\\t\\n\\t\\t\\topened_img = new Image(11,11);\\n\\t\\t\\topened_img.src = \\\"images/opened.gif\\\";\\n\\t\\t}\\n\\telse {\\n\\t\\talert (\\\"document.images not found!\\\")\\n\\t}\\n}\",\n \"function loadImages(elem) {\\n if (!elem) {\\n return;\\n }\\n\\n var images = elem.getElementsByTagName('img');\\n\\n var n = images.length;\\n for (var i = 0; i < n; i++) {\\n var image = images[i];\\n\\n if (image.getAttribute('data-src')) {\\n image.src = image.getAttribute('data-src');\\n image.removeAttribute('data-src');\\n }\\n }\\n }\",\n \"function LoadContactRefs() {\\n var imageObjects = $(\\\"img\\\").get();\\n\\n for (var i = 0; i < imageObjects.length; i++) {\\n var img = imageObjects[i];\\n var imageSource = $(img).attr('src');\\n var sourceEnd = imageSource.substring(14, imageSource.length)\\n\\n switch (sourceEnd) {\\n case \\\"github.png\\\": $(img).parent().attr(\\\"href\\\", \\\"https://github.com/captainsalt\\\"); break;\\n case \\\"linkedin.png\\\": $(img).parent().attr(\\\"href\\\", \\\"https://www.linkedin.com/in/david-wright-659006144/\\\"); break;\\n case \\\"stack.png\\\": $(img).parent().attr(\\\"href\\\", \\\"https://stackoverflow.com/users/7107832/captainsalt\\\"); break;\\n }\\n }\\n}\",\n \"function preloadImages() {\\n for (var i = 0; i < numberOfGifsToPreload; i++) {\\n popThenAddImage(fileNamesArray);\\n }\\n }\",\n \"loadImages() {\\n let loadCount = 0;\\n let loadTotal = this.images.length;\\n\\n if (WP.shuffle) {\\n this.images = this.shuffle(this.images);\\n }\\n\\n const imageLoaded = (() => {\\n loadCount++;\\n\\n if (loadCount >= loadTotal) {\\n // All images loaded!\\n this.setupCanvases();\\n this.bindShake();\\n this.loadingComplete();\\n }\\n }).bind(this);\\n\\n for (let image of this.images) {\\n // Create img elements for each image\\n // and save it on the object\\n const size = this.getBestImageSize(image.src);\\n image.img = document.createElement('img'); // image is global\\n image.img.addEventListener('load', imageLoaded, false);\\n image.img.src = image.src[size][0];\\n }\\n }\",\n \"function lazyload(){\\n var scrollTop = $(\\\"html, body\\\").scrollTop();\\n $(\\\"img[data-src]\\\").each(function(){\\n var top = $(this).offset().top - 800;\\n var left = $(this).offset().left;\\n\\n\\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\\\":visible\\\") ){\\n $(this).attr(\\\"src\\\", $(this).attr(\\\"data-src\\\"));\\n }\\n });\\n\\n $(\\\"[data-background-src]\\\").each(function(){\\n var top = $(this).offset().top - 800;\\n var left = $(this).offset().left;\\n if($(this).hasClass(\\\"main-kb-bg\\\")){\\n if(scrollTop >= top){\\n $(this).css(\\\"background-image\\\", \\\"url(\\\"+$(this).attr(\\\"data-background-src\\\")+\\\")\\\");\\n }\\n } else {\\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\\\":visible\\\")){\\n $(this).css(\\\"background-image\\\", \\\"url(\\\"+$(this).attr(\\\"data-background-src\\\")+\\\")\\\");\\n }\\n }\\n\\n });\\n }\",\n \"function loadImages(sources, callback) { \\n\\t\\tfor(var src in sources) { \\t// get num of sources\\n numImages++;\\n }\\n for(var src in sources) {\\n images[src] = new Image();\\n\\t\\t\\timages[src].onload = function() {\\n\\t\\t\\t\\tif(++loadedImages >= numImages) {\\n\\t\\t\\t\\tcallback(images);\\n\\t\\t\\t\\t}\\n\\t\\t\\t};\\n images[src].src = sources[src];\\n }\\n }\",\n \"function loadImages() {\\n var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\\n var urls = opts.urls,\\n _opts$onProgress3 = opts.onProgress,\\n onProgress = _opts$onProgress3 === undefined ? noop : _opts$onProgress3;\\n\\n (0, _assert2.default)(urls.every(function (url) {\\n return typeof url === 'string';\\n }), 'loadImages: {urls} must be array of strings');\\n var count = 0;\\n return Promise.all(urls.map(function (url) {\\n var promise = (0, _browserLoad.loadImage)(url, opts);\\n promise.then(function (file) {\\n return onProgress({\\n progress: ++count / urls.length,\\n count: count,\\n total: urls.length,\\n url: url\\n });\\n });\\n return promise;\\n }));\\n}\",\n \"function createImages()\\n{\\n\\tlargeImg.src = imgArray[0];\\n\\t\\n\\tfor (var i = 0; i < imgArray.length; i++)\\n\\t{\\n\\t\\tfourImgsDiv.innerHTML += \\\"![](\\\" + imgArray[i] + \\\")
\\\";\\n\\t}\\n}\",\n \"loadImages() {\\n if (this._queue.length > 0) {\\n let img = new Image();\\n let src = this._queue.pop();\\n\\n let name = src.slice(src.lastIndexOf('/') + 1);\\n img.src = src;\\n img.onload = (function() {\\n this.loadImages();\\n }).bind(this);\\n this.images[name] = img;\\n } else {\\n this._callback();\\n }\\n }\",\n \"function loadImages(images, string) {\\n images.forEach((image, index) => {\\n image.style.backgroundImage = \\\"url(./css/img/\\\" + string + (index + 1) + \\\".jpg)\\\";\\n image.style.backgroundSize = \\\"contain\\\";\\n })\\n}\",\n \"function renderImages() {\\n //if ( viewSkins ) { renderSkins(); } // disabled here so plants can be rendered sequentially in plants.js\\n if ( viewSpans ) { renderSpans(); }\\n if ( viewPoints ) { renderPoints(); }\\n if ( viewScaffolding ) { renderScaffolding(); }\\n}\",\n \"function getDirectoryImages() {\\n\\t\\t\\t// show image previews?\\n\\t\\t\\tif (opts.showImgPreview) {\\n\\t\\t\\t\\tdoLoadDirectoryImage($('#browser ul li.GIF, #browser ul li.JPG, #browser ul li.PNG'), 0, sys.currentPathIdx);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function init() {\\n cacheDom();\\n loadImage();\\n }\",\n \"async function loadImages() {\\n let data = arg.splice(1, arg.length - 1);\\n let promise = [];\\n data.forEach(img => {\\n if(typeof img === \\\"string\\\") {\\n let image = Canva2D.API.Preloader(\\\"singleImageOnly\\\", img);\\n promise.push(image);\\n } else if(img.hasOwnProperty(\\\"img\\\") && img.hasOwnProperty(\\\"src\\\")) {\\n let image = Canva2D.API.Preloader(\\\"singleImageOnly\\\", img[\\\"img\\\"], img[\\\"src\\\"]);\\n promise.push(image);\\n } else {\\n let image = Canva2D.API.Preloader(\\\"singleImageOnly\\\", img);\\n promise.push(image);\\n }\\n });\\n return await Promise.all(promise).then(e => {\\n for(const img of e) \\n _IMAGES_STACK.push(img);\\n return _IMAGES_STACK;\\n }).then(e => getImage);\\n }\",\n \"function load_images () {\\n console.log(\\\"load images\\\");\\n\\n GM_addStyle(\\\"#display_img {position: fixed; left: 0px; top: 50px; opacity: 0.6; background-color: #000; width: 100%; height: calc(100% - 50px); display: none;} .postright img {cursor: zoom-in;}\\\");\\n //adds the faded background\\n let div = element(\\\"div\\\").a(\\\"id\\\", \\\"display_img\\\").apthis(document.getElementById(\\\"pagewrapper\\\"));\\n //div that holds the image\\n let div1 = document.createElement(\\\"div\\\");\\n div1.setAttribute(\\\"style\\\", \\\"position: fixed; left: 0px; top: 50px; width: 100%; height: calc(100% - 50px); text-align: center; display: none; cursor: zoom-out;\\\");\\n //the img element that will display the image\\n let img = document.createElement(\\\"img\\\");\\n img.setAttribute(\\\"src\\\", \\\"\\\");\\n img.setAttribute(\\\"id\\\", \\\"display_img_img\\\");\\n div1.appendChild(img);\\n //this causes the faded background and image to disappear\\n document.getElementById(\\\"pagewrapper\\\").appendChild(div1);\\n div1.addEventListener(\\\"click\\\", (event) => {\\n div.style.display = \\\"none\\\";\\n div1.style.display = \\\"none\\\";\\n });\\n\\n let posts = document.getElementsByClassName(\\\"postright\\\");\\n for (let a of posts) {\\n let imgs = a.getElementsByTagName(\\\"img\\\");\\n for (let b of imgs) {\\n b.addEventListener(\\\"click\\\", (event) => {\\n img.setAttribute(\\\"src\\\", event.currentTarget.src);\\n //gets current image size\\n let img_width = event.currentTarget.clientWidth;\\n let img_height = event.currentTarget.clientHeight;\\n //going to be used for the dialation\\n let scale_factor = 1.5;//this is the maximun a small image can be scalled up\\n const display_width = window.innerWidth;\\n const display_height = window.innerHeight - 50;\\n let final_height = 0, final_width = 0;\\n\\n final_height = img_height * scale_factor;\\n final_width = img_width * scale_factor;\\n\\n //this is the best solution to deal with all different screen sizes and images sizes\\n //It have tried making multilayer if/else statemanets but they don't work well for this\\n while (final_height > display_height || final_width > display_width) {\\n scale_factor -= 0.1;\\n final_height = img_height * scale_factor;\\n final_width = img_width * scale_factor;\\n }\\n //makes it cerntered vertically and makes sure it has right hieght and width\\n img.setAttribute(\\\"style\\\", \\\"width:\\\" + final_width + \\\"px; height:\\\" + final_height + \\\"px; position: relative; top:\\\" + (((display_height) / 2) - (final_height / 2)) + \\\"px;\\\");\\n\\n div.style.display = \\\"block\\\";\\n div1.style.display = \\\"block\\\";\\n });\\n }\\n }\\n }\",\n \"function showImages() {\\r\\n const images = document.querySelectorAll('[data-src]');\\r\\n const clientHeight = document.documentElement.clientHeight;\\r\\n for (let img of images) {\\r\\n const coord = img.getBoundingClientRect();\\r\\n let realSrc = img.dataset.src;\\r\\n if (!realSrc) continue;\\r\\n if (coord.top > -clientHeight &&\\r\\n coord.top < clientHeight * 2 ||\\r\\n coord.bottom > -clientHeight &&\\r\\n coord.bottom < clientHeight * 2) {\\r\\n img.src = realSrc;\\r\\n img.dataset.src = '';\\r\\n }\\r\\n }\\r\\n }\",\n \"loadImg() {\\n let loadedCount = 0\\n function onLoad() {\\n loadedCount++\\n if (loadedCount >= this.imgPaths.length) {\\n this.flowStart()\\n }\\n }\\n this.baseImages = this.imgPaths.map(path => {\\n const image = new Image()\\n image.onload = onLoad.bind(this)\\n image.src = path\\n return image\\n })\\n }\",\n \"function loadImage(){\\n $(\\\".image-box\\\").attr(\\\"src\\\", displayedImg.download_url);\\n}\",\n \"function loadImage() {\\n\\t\\t\\tthis.loading = 'eager';\\n\\t\\t\\tif( this.src )\\n\\t\\t\\t\\tthis.src = this.src;\\n\\t\\t\\tif( this.srcset )\\n\\t\\t\\t\\tthis.srcset = this.srcset;\\n\\t\\t}\",\n \"function preloadImages(urls) {\\n urls.forEach(url => {\\n const image = new Image();\\n image.src = url;\\n });\\n}\",\n \"function loadImages(element) {\\n const images = element.querySelectorAll(\\\".menu__slide--image img\\\");\\n images.forEach(image => (image.src = image.dataset.src || image.src));\\n}\",\n \"function preLoad(onLoadAll) {\\n \\n var finished = false;\\n \\n var progressBar = {\\n max : 0,\\n loaded : 0\\n };\\n \\n var updateBar = function() {\\n \\n var percnt = ((progressBar.loaded * 100) / progressBar.max) >> 0;\\n $(\\\"#progress-bar\\\").width(percnt + '%');\\n };\\n \\n var loadImage = function(img) {\\n \\n var e = document.createElement('img');\\n\\n e.onload = function() {\\n\\n progressBar.loaded++;\\n updateBar();\\n\\n if(progressBar.loaded >= progressBar.max) {\\n // once we get here, we are pretty much done, so redirect to the actual page\\n if(!finished) {\\n finished = true;\\n helper.hide('progress-bar', 1000, false);\\n onLoadAll();\\n }\\n }\\n };\\n \\n e.onerror = e.onload;\\n \\n // this will trigger your browser loading the image (and caching it)\\n e.src = img;\\n };\\n \\n //Preload images\\n $.ajax({\\n url: \\\"./json/images.json\\\",\\n success: function(images) {\\n 'use strict';\\n\\n progressBar.max = images.length;\\n\\n var i = 0;\\n\\n while(i < images.length) {\\n loadImage(images[i]);\\n i++;\\n }\\n }\\n });\\n \\n //Preload fonts\\n var canvas = document.createElement('canvas');\\n var ctx = canvas.getContext('2d');\\n ctx.font = '12px Canaro';\\n ctx.fillText('.', 0, 0);\\n}\",\n \"function showImages() {\\n const images = document.querySelectorAll('[data-src]');\\n const clientHeight = document.documentElement.clientHeight;\\n for (let img of images) {\\n const coord = img.getBoundingClientRect();\\n let realSrc = img.dataset.src;\\n if (!realSrc) continue;\\n if (coord.top > -clientHeight &&\\n coord.top < clientHeight * 2 ||\\n coord.bottom > -clientHeight &&\\n coord.bottom < clientHeight * 2) {\\n img.src = realSrc;\\n img.dataset.src = '';\\n }\\n }\\n }\",\n \"function loadImagesSeq() {\\n\\t\\t const button = document.querySelector('#loadImagesSeq');\\n\\t\\t const container = document.querySelector('#image-container');\\n\\t\\t const promises = [];\\n\\t\\t button.addEventListener(\\\"click\\\", (event) => {\\n\\n\\t\\t const images = imageNames();\\n\\n\\t\\t images.forEach((image) => {\\n\\t\\t promises.push(requestInSeq(image, container));\\n\\t\\t });\\n\\t\\t console.log(promises);\\n\\t\\t // when all promises are resolved then this promise is resolved.\\n\\t\\t Promise.all(promises).then((imageDataObjs) => {\\n\\t\\t console.log(imageDataObjs);\\n\\t\\t imageDataObjs.forEach((imageData) => {\\n\\t\\t const imageElement = imageData.imageElement;\\n\\t\\t const imageSrc = imageData.objectURL;\\n\\t\\t imageElement.src = imageSrc;\\n\\t\\t });\\n\\n\\t\\t });\\n\\t\\t });\\n\\n\\n\\t\\t}\",\n \"LoadImage(){\\n var images=[]\\n // hard coded for convenienceproxy to a static serving end point\\n if(this.state.images!=undefined){\\n this.state.images.map(i =>{\\n images.push(\\n this.request.getStamp()+'-' + i\\n )\\n })\\n return images; \\n }\\n else{\\n \\n return null\\n }\\n }\",\n \"function fetch_video_html_images() { \\n var path = window.location.pathname;\\n var page = path.split(\\\"/\\\").pop();\\n\\n if(page === 'video.html') {\\n // Create element\\n const div = document.createElement(\\\"div\\\");\\n div.className = 'video-items';\\n\\n let output = '';\\n const datas = Object.entries(countries);\\n // console.log(datas);\\n\\n datas.forEach(d=> {\\n // console.log(d[1][0]);\\n output += `\\n \\n ![\\\"\\\"](\\\"${d[1].video_image}\\\")
\\n ${d[0]}\\n \\n `;\\n });\\n\\n div.innerHTML= output;\\n\\n document.querySelector(\\\".video-container\\\").insertAdjacentElement(\\\"beforeend\\\", div);\\n\\n // console.log(output);\\n }\\n }\",\n \"function loadImages(sources, callback) {\\n \\tvar images = {};\\n\\n for(var src in sources) {\\n \\timages[src] = new Image();\\n \\timages[src].onload = callback;\\n \\timages[src].src = sources[src];\\n }\\n return images;\\n }\",\n \"function load_imdb_images () {\\n return new Promise (resolve => {\\n $.spinnerWait (true);\\n userLog (\\\"Det här kan ta några minuter ...\\\", true, 5000)\\n let cmd = '$( pwd )/ld_imdb.js -e ' + $(\\\"#imdbPath\\\").text (); // pwd = present working dir\\n execute (cmd).then ( () => {\\n // $ (\\\"button.updText\\\").css (\\\"float\\\", \\\"right\\\");\\n // $ (\\\"button.updText\\\").hide ();\\n resolve (\\\"Done\\\")\\n });\\n });\\n}\",\n \"function lazyLoad() {\\n lazyImages.forEach(image => {\\n if (image.offsetTop < window.scrollY + 150) {\\n image.style.backgroundImage =\\n `url(${image.getAttribute('data-src')})`;\\n image.classList.add('loaded')\\n }\\n })\\n}\",\n \"function init() {\\n cacheDom();\\n loadImage();\\n }\",\n \"function preloadImages(images) {\\n imagesAmount = images.length;\\n for (var i = 0; i < images.length; i++) {\\n var img = new Image();\\n img.addEventListener('load', imageLoadedCallback, false);\\n img.src = basePath + 'images/' + images[i];\\n }\\n }\",\n \"function displayPages() {\\r\\n // Retrieve the the pages div element.\\r\\n var $pageDiv = $(\\\"#pageDiv\\\");\\r\\n \\r\\n // Clear the page div.\\r\\n while ($pageDiv[0].firstChild)\\r\\n $pageDiv[0].removeChild($pageDiv[0].firstChild);\\r\\n \\r\\n // Iterate through all of the pages in the pagesList.\\r\\n for (var i = 0; i < pageList.length; i++) {\\r\\n var page = pageList[i];\\r\\n \\r\\n // Create a new image element to represent the page.\\r\\n var img = document.createElement(\\\"IMG\\\");\\r\\n img.onload = function() {\\r\\n $(this).hide().pageToggle();\\r\\n };\\r\\n img.src = \\\"/ShowAndTellProject/\\\" + page.audio;\\r\\n img.id = \\\"pageThumbnail\\\";\\r\\n \\r\\n // Add highlight functionality to the image element.\\r\\n highlight(img);\\r\\n \\r\\n // Add the image to the pages div.\\r\\n $pageDiv.append(img); \\r\\n }\\r\\n}\",\n \"function showImages() {\\n var\\n last = imgs.length,\\n current,\\n allImagesDone = true;\\n\\n for (current = 0; current < last; current++) {\\n var img = imgs[current];\\n // if showIfVisible is false, it means we have some waiting images to be\\n // shown\\n if(img !== null && !showIfVisible(img, current)) {\\n allImagesDone = false;\\n }\\n }\\n\\n if (allImagesDone && pageHasLoaded) {\\n }\\n }\",\n \"function LoadImage(ImageID){\\r\\n\\tLoaded_Images_array_current = Loaded_Images_array.indexOf(ImageID);\\r\\n\\t// console.debug(Loaded_Images);\\r\\n\\t\\r\\n\\tvar ImageThumb = Loaded_Images[ImageID].thumb\\r\\n\\tvar ImageMain = Loaded_Images[ImageID].main\\r\\n\\tvar LoadingImage = true;\\r\\n\\r\\n\\t\\r\\n\\t// Sets the link on the image to the image page\\r\\n\\t$nav_content_img.parent().attr('href',Loaded_Images[ImageID].link)\\r\\n\\t\\r\\n\\t// Formats all the tags into a list of links\\r\\n\\tvar ImageTagsFormatted = [];\\r\\n\\tvar ImageTags = Loaded_Images[ImageID].tags.split(\\\" \\\");\\r\\n\\t$.each(ImageTags, function(index, value) {\\r\\n\\t\\tImageTagsFormatted.push(''+value+'');\\r\\n\\t})\\r\\n\\t\\r\\n\\t$('.image_nav_background').show();\\r\\n\\t$image_nav_overlay.show();\\r\\n\\t$nav_thumb_img.show();\\r\\n\\t$text_overlay.empty().append(''+Loaded_Images[ImageID].filename+' | Page '+Loaded_Images[ImageID].page+' | Image '+Loaded_Images[ImageID].number+'
'+ImageTagsFormatted.join(' | '))\\r\\n\\t\\r\\n\\t$nav_content_img\\r\\n\\t.data('ImageId',ImageID)\\r\\n\\t\\r\\n\\tvar current_status = Loaded_Images[ImageID].status;\\r\\n\\t\\r\\n\\t// Loads the image if it's already been verified previously.\\r\\n\\tif(current_status == 'loaded' || current_status == 'error'){\\r\\n\\t\\t$nav_content_img.attr('src',ImageMain)\\r\\n\\t\\tif(current_status != 'loading')$nav_thumb_img.hide();\\r\\n\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',ImageMain)\\r\\n\\t\\t\\r\\n\\t\\tRepositionMainImage();\\r\\n\\t\\r\\n\\t// Checks each image extension until it finds a working one\\r\\n\\t}else if(current_status == 'waiting'){\\r\\n\\t\\tLoaded_Images[ImageID].status = 'loading';\\r\\n\\t\\tGM_xmlhttpRequest({\\r\\n\\t\\t\\tmethod: \\\"GET\\\",\\r\\n\\t\\t\\turl: '/'+Loaded_Images[ImageID].link,\\r\\n\\t\\t\\tonload: function(retour) {\\r\\n\\t\\t\\t\\tLoaded_Images[ImageID].verified = true\\r\\n\\t\\t\\t\\tvar image;\\r\\n\\t\\t\\t\\tvar ResponseHTML = $(retour.responseText);\\r\\n\\t\\t\\t\\tvar ImageServer = $('div.content script:contains(\\\"image\\\"):contains(\\\"domain\\\"):contains(\\\"base_dir\\\")',ResponseHTML).text();\\r\\n\\t\\t\\t\\teval(ImageServer)\\r\\n\\t\\t\\t\\tvar new_image_url = image.domain+\\\"/\\\"+image.base_dir+\\\"/\\\"+image.dir+\\\"/\\\"+image.img;\\r\\n\\t\\t\\t\\tLoaded_Images[ImageID].main = new_image_url\\r\\n\\t\\t\\t\\t$(\\\"![]()
\\\")\\r\\n\\t\\t\\t\\t\\t.attr(\\\"src\\\", new_image_url)\\t\\r\\n\\t\\t\\t\\t\\t.one('load',function(){\\r\\n\\t\\t\\t\\t\\t\\tLoaded_Images[ImageID].status = 'loaded';\\r\\n\\t\\t\\t\\t\\t// Checks to make sure the successfully loading image actually is the one selected, since the load function for a previous image might be called after the user has switched to another.\\r\\n\\t\\t\\t\\t\\t\\tif($nav_content_img.data('ImageId') == ImageID){\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_content_img.attr('src',new_image_url);\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_thumb_img.hide();\\r\\n\\t\\t\\t\\t\\t\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\\r\\n\\t\\t\\t\\t\\t\\t\\tRepositionMainImage();\\r\\n\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t})\\r\\n\\t\\t\\t\\t\\t.one('error',function(){\\r\\n\\t\\t\\t\\t\\t\\tLoaded_Images[ImageID].status = 'error';\\r\\n\\t\\t\\t\\t\\t\\tif($nav_content_img.data('ImageId') == ImageID){\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_content_img.attr('src','/images/404.gif').one('load',function(){RepositionMainImage();});\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_thumb_img.hide();\\r\\n\\t\\t\\t\\t\\t\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t});;\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\\r\\n\\t\\r\\n\\t// Prevent left and right scrolling in background\\r\\n\\t$('body').css({'overflow-x' : 'hidden', 'overflow-y': 'hidden'})\\r\\n}\",\n \"function findImages(){\\n var parentDir = \\\"./desc/civic_2012\\\";\\n \\n console.log(parentDir);\\n var fileCrowler = function(data){\\n var titlestr = $(data).filter('title').text();\\n // \\\"Directory listing for /Resource/materials/xxx\\\"\\n var thisDirectory = titlestr.slice(titlestr.indexOf('/'), titlestr.length)\\n\\n //List all image file names in the page\\n $(data).find(\\\"a\\\").attr(\\\"href\\\", function (i, filename) {\\n if( filename.match(/\\\\.(jpe?g|png|gif)$/) ) { \\n var fileNameWOExtension = filename.slice(0, filename.lastIndexOf('.'))\\n // var img_html = \\\"\\\".format(thisDirectory + filename, fileNameWOExtension, fileNameWOExtension);\\n // $(\\\"#sm_image\\\").append(img_html);\\n $( \\\".templ\\\" ).appendTo( \\\"#sm_image\\\" );\\n }\\n else{ \\n $.ajax({\\n url: thisDirectory + filename,\\n success: fileCrowler\\n });\\n }\\n });}\\n\\n $.ajax({\\n url: parentDir,\\n success: fileCrowler\\n });\\n}\",\n \"function load_media()\\n{\\n bg_sprite = new Image();\\n bg_sprite.src = \\\"images/Background-stadt_lang.png\\\";\\n box_sprite = new Image();\\n box_sprite.src = \\\"images/Stift.png\\\";\\n main_sprite = new Image();\\n main_sprite.src = \\\"images/IMG_2210_Mini.png\\\";\\n}\",\n \"function startImgStatus(){\\n var img = document.createElement('img'); // Hack to extract absolute url\\n $jQ('img').each(function(){\\n img.src=$jQ(this).attr('src');\\n setLink($jQ(this),'src', img.src);\\n });\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7676688","0.731364","0.73070186","0.71697855","0.7169777","0.7163216","0.7148358","0.7096101","0.70113856","0.6933231","0.6932604","0.6905027","0.6893312","0.6842709","0.68203217","0.6815961","0.68065524","0.6800416","0.6784943","0.6782312","0.6781785","0.67740965","0.67655426","0.67486274","0.6746114","0.6744704","0.67271554","0.67201483","0.66962916","0.6683502","0.66795224","0.66738015","0.66700095","0.66521937","0.6647351","0.66462153","0.663513","0.6633545","0.6631216","0.65984666","0.6582906","0.65764487","0.6570141","0.6568608","0.6567403","0.65654916","0.6552041","0.65471315","0.6530931","0.6512293","0.6509736","0.64923954","0.6491187","0.6486816","0.64857817","0.6484542","0.64781225","0.6456162","0.6448061","0.64363563","0.643174","0.64248437","0.64221454","0.6409288","0.6399283","0.6396185","0.6387334","0.6387277","0.63857067","0.63850623","0.6384308","0.63661546","0.63619304","0.63554865","0.6351606","0.6350221","0.634836","0.63385725","0.6332649","0.63317084","0.6329298","0.63284594","0.63280773","0.63216704","0.63143826","0.6310112","0.6308037","0.6298355","0.6297974","0.62956744","0.6295391","0.628929","0.6289254","0.6287079","0.628348","0.6277684","0.62660134","0.6263837","0.6256909","0.6254528","0.62508744"],"string":"[\n \"0.7676688\",\n \"0.731364\",\n \"0.73070186\",\n \"0.71697855\",\n \"0.7169777\",\n \"0.7163216\",\n \"0.7148358\",\n \"0.7096101\",\n \"0.70113856\",\n \"0.6933231\",\n \"0.6932604\",\n \"0.6905027\",\n \"0.6893312\",\n \"0.6842709\",\n \"0.68203217\",\n \"0.6815961\",\n \"0.68065524\",\n \"0.6800416\",\n \"0.6784943\",\n \"0.6782312\",\n \"0.6781785\",\n \"0.67740965\",\n \"0.67655426\",\n \"0.67486274\",\n \"0.6746114\",\n \"0.6744704\",\n \"0.67271554\",\n \"0.67201483\",\n \"0.66962916\",\n \"0.6683502\",\n \"0.66795224\",\n \"0.66738015\",\n \"0.66700095\",\n \"0.66521937\",\n \"0.6647351\",\n \"0.66462153\",\n \"0.663513\",\n \"0.6633545\",\n \"0.6631216\",\n \"0.65984666\",\n \"0.6582906\",\n \"0.65764487\",\n \"0.6570141\",\n \"0.6568608\",\n \"0.6567403\",\n \"0.65654916\",\n \"0.6552041\",\n \"0.65471315\",\n \"0.6530931\",\n \"0.6512293\",\n \"0.6509736\",\n \"0.64923954\",\n \"0.6491187\",\n \"0.6486816\",\n \"0.64857817\",\n \"0.6484542\",\n \"0.64781225\",\n \"0.6456162\",\n \"0.6448061\",\n \"0.64363563\",\n \"0.643174\",\n \"0.64248437\",\n \"0.64221454\",\n \"0.6409288\",\n \"0.6399283\",\n \"0.6396185\",\n \"0.6387334\",\n \"0.6387277\",\n \"0.63857067\",\n \"0.63850623\",\n \"0.6384308\",\n \"0.63661546\",\n \"0.63619304\",\n \"0.63554865\",\n \"0.6351606\",\n \"0.6350221\",\n \"0.634836\",\n \"0.63385725\",\n \"0.6332649\",\n \"0.63317084\",\n \"0.6329298\",\n \"0.63284594\",\n \"0.63280773\",\n \"0.63216704\",\n \"0.63143826\",\n \"0.6310112\",\n \"0.6308037\",\n \"0.6298355\",\n \"0.6297974\",\n \"0.62956744\",\n \"0.6295391\",\n \"0.628929\",\n \"0.6289254\",\n \"0.6287079\",\n \"0.628348\",\n \"0.6277684\",\n \"0.62660134\",\n \"0.6263837\",\n \"0.6256909\",\n \"0.6254528\",\n \"0.62508744\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81767,"cells":{"query":{"kind":"string","value":"Event Handler for click on picture"},"document":{"kind":"string","value":"function handleUserClick(event) {\n event.preventDefault();\n\n if (event.target.id === 'left') {\n catalogArray[randomIndex1].tallyClicked += 1;\n }\n\n else if (event.target.id === 'center') {\n catalogArray[randomIndex2].tallyClicked += 1;\n }\n\n else if (event.target.id === 'right') {\n catalogArray[randomIndex3].tallyClicked += 1;\n }\n else {\n alert('Pick a product!');\n return;\n }\n console.log('I clicked' + event.target.id);\n\n surveyLength += 1;\n localStorage.setItem('userResults', JSON.stringify(catalogArray));\n\n loadImages();\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["onImageClick() {\n console.log('Clicked Image')\n }","function imgClick(event) {\n\n}","imageClickHandler() {\n\t\tconst {data} = this.props,\n\t\t\tlistOfPhotos = document.querySelector('.gallery__photo-list');\n\n\t\tlistOfPhotos.addEventListener('click', e => {\n\t\t\tconst {target} = e,\n\t\t\t\t{imageMinId: id} = target.dataset;\n\n\t\t\tif (target.tagName !== 'IMG') return;\n\t\t\tthis.props.currentPhoto = +id;\n\t\t\tthis.changeGeneralPhoto(+id);\n\t\t\tthis.selectImageHandler();\n\t\t});\n\t}","function handleClick(event)\n{\n\t// Gets position of click\n\tvar rect = canvas.getBoundingClientRect();\n\tvar posx = event.clientX - rect.left;\n\tvar posy = event.clientY - rect.top;\n\t\n\t// Checks each object to see if it was clicked\n\tfor (var i = 0; i < clickable.length; i++)\n\t{\n\t\t// If image was clicked, runs specified function\n\t\tif (posx >= clickable[i].x && posx <= clickable[i].x + clickable[i].width &&\n\t\t\tposy >= clickable[i].y && posy <= clickable[i].y + clickable[i].height)\n\t\t{\n\t\t\tclickable[i].func();\n\t\t}\n\t}\n}","function clickImage (data){\n\t\t\n\t\t/*click function on each image*/\n\t\tdelegate(\"body\",\"click\",\".clickMe\",(event) => {\n\t\t\t\n\t\t\tevent.preventDefault();\n\t\t\tvar dataCaptionId=getKeyFromClosestElement(event.delegateTarget);\n\t\t\tvar dataCaption = data.caption;\n\t\t\tdataCaption = dataCaption.replace(/\\s+/g, \"\");\n\t\t\t\n\t\t\t//match the id and render pop up with the data\n\t\t\tif (dataCaption == dataCaptionId){\n\t\t\t\trenderPopup(data, container) \n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t}","function onImageClick(event) {\n var imageWrap = document.querySelector('.image_wrap');\n if(!imageWrap.classList.contains('image_displayed')) return;\n\n if(imageWrap.classList.contains('positioning')) {\n var posRel = getPositionRel(event, document.querySelector('.image_wrap .image_con'));\n\n if(posRel.x >= 0 && posRel.x <= 1\n && posRel.y >= 0 && posRel.y <= 1) {\n placePinSelection(posRel);\n event.stopPropagation();\n }\n }\n\n if(imageWrap.classList.contains('moving')) {\n // ignore moving click events, mouse/touch events do everything\n event.stopPropagation();\n event.preventDefault();\n }\n }","function onImgClick () {\n $ ('.img-wrap').one ('click', function (e) {\n console.log ('image clicked');\n console.log (characters);\n attackSound.play ();\n $ ('#selected-character-id').css ('border', 'solid 5px greenyellow');\n $ (this).off (e);\n });\n }","function imgClicked(e)\n{\n\tlargeImg.src = e.target.src;\n}","function handleClick(e) {\n const src = e.currentTarget.querySelector('img').src;\n const href = this.childNodes[0].nextSibling.href;\n overlayLink.href = href;\n overlayLink.innerText = href;\n overlayImage.src = src;\n overlay.classList.add('open');\n }","function clickOnImage(event)\n{\n\tif ($(\"#country_selected\").val() != '0')\n\t{\n\t\tvar e = event || window.event;\n\t\tvar pos = getRelativeCoordinates(event, $(\"#reference\").get(0));\n\t\tvar m = $(\"#marker\").get(0);\n\t\tdisplayMarker(pos.x, pos.y);\n\t}\n}","function clickOnThumbnail() {\n\tgetPhotoUrl($(this));\n\t$container.append($photoviewer.append($photoBox).append($caption));\n\t$photoBox.after($leftClick);\n\t$photoBox.before($rightClick);\n\t$(\"html\").css(\"background\",\"gray\");\n\t//All other images are not visible\n\t$(\".thumbnail\").addClass(\"greyed-out\");\n\t$(\".small-img\").hide();\n\t$leftClick.on(\"click\",leftClick);\n\t$rightClick.on(\"click\",rightClick);\n}","function handleImageClick(event) {\n if (isDragAndDropSupported || !instance) {\n return;\n }\n\n const target = event.target;\n\n fetch(target.src)\n .then((r) => r.blob())\n .then((blob) => {\n const pageIndex = instance.viewState.currentPageIndex;\n const pageInfo = instance.pageInfoForIndex(pageIndex);\n\n insertImageAnnotation(\n new PSPDFKit.Geometry.Rect({\n width: target.width,\n height: target.height,\n left: pageInfo.width / 2 - target.width / 2,\n top: pageInfo.height / 2 - target.height / 2,\n }),\n blob,\n pageIndex\n );\n });\n}","function ChoosePhoto(e) {\n console.log(\"gggg\");\n getPhoto(pictureSource.PHOTOLIBRARY);\n }","function imgClicked(imgId) {\n gMeme.selectedImgId = imgId;\n}","function clickRegularViewFocusImg(e) {\n\n var clickedThing = e.target;\n\n // if clicked element is a single image or the focus img in a gallery\n if (clickedThing.classList.contains('clickme')) {\n\n // define imgToShow\n var imgToShow = clickedThing;\n\n // call NAMED lightbox function\n lightbox(imgToShow);\n\n // call NAMED function to populate lightbox dots\n populateLightboxDots(imgToShow);\n\n } // close if ('clickme')\n} // close function","function handleClick(e) {\n\tSTATE.popupOpen = true\n\tconst elem = closest(e.target, '[data-type=image]')\n\tconst i = parseInt(elem.getAttribute('data-index'), 10)\n\tSTATE.popup.innerHTML = popupContent({ elem: content.parts[i], index: i })\n}","function clickFunc(event) {\n\t//alert(event);\n\tvar e = event;\n\t//console.log(typeof e);\n\t\n\tif(event.target !== event.currentTarget) {\n\t\tvar clickedItem = event.target.id;\n\t\t//alert(\"this is the image id = \"+clickedItem);\n\t}\n \n}","function addEventOpenImages() {\n document.addEventListener('click', function (evt) {\n if (evt.target.parentNode.classList.contains('picture')) {\n evt.preventDefault();\n showImage(evt.target.parentNode);\n }\n });\n }","function clickHandler(event) {\n //take the path from the src attribute of the img node\n //that we clicked on. We get a reference to that node\n //from event.target\n var targetString = event.target.src;\n //take the relevant part of the path from the node\n var targetPath = targetString.split('assets')[1];\n var itemPath;\n\n //look through the ItemImage objects to find the one that\n //corresponds to the image we clicked on\n for (var i = 0; i < items.length; i++) {\n //get the relevant part from the path on the object\n itemPath = items[i].path.split('assets')[1];\n if (itemPath === targetPath) {\n //when we find the right object increment its clicked\n //property\n items[i].clicked += 1;\n }\n }\n\n changePicture();\n}","imageClick(e) {\n e.preventDefault();\n\n if (this.item.link) {\n window.open(this.item.link, '_blank');\n } else {\n this.shadowRoot.querySelector('#image-dialog').open();\n\n HhAnalytics.trackDialogOpen(this.item.internalTitle);\n }\n }","function imageSelect(){\n\tvar getPhoto = document.getElementById(\"userPhoto\");\n\tgetPhoto.click();\n}","initiatePictureCapture(){this.imageInput.trigger('click')}","function handleImgClick(event) {\n if (event.target.id === 'left') {\n allImages[leftImg].clicked += 1;\n console.log(allImages[leftImg].imgname + ' ' + allImages[leftImg].clicked);\n counter += 1;\n pick3();\n }\n if (event.target.id === 'center') {\n allImages[centerImg].clicked += 1;\n console.log(allImages[centerImg].imgname + ' ' + allImages[centerImg].clicked);\n counter += 1;\n pick3();\n }\n if (event.target.id === 'right') {\n allImages[rightImg].clicked += 1;\n console.log(allImages[rightImg].imgname + ' ' + allImages[rightImg].clicked);\n counter += 1;\n pick3();\n }\n if (event.target.id === 'imgContain') {\n alert('You need to click on an image!');\n pick3();\n }\n}","function clickHandler(event) {\r\n console.log(event.target);\r\n var imageName = event.target.alt;\r\n for (var i = 0; i < pictures.length; i++) {\r\n if (pictures[i].name === imageName) {\r\n pictures[i].updateChosen();\r\n picked++;\r\n }\r\n }\r\n\r\n if (picked === 25) {\r\n removeListener();\r\n chartData();\r\n showResults();\r\n var dataAsString = JSON.stringify(pictureData);\r\n localStorage.setItem('data', dataAsString);\r\n var nameAsString = JSON.stringify(labels);\r\n localStorage.setItem('pictures', nameAsString);\r\n }\r\n\r\n previousSet = thisSet;\r\n thisSet = {};\r\n setupImageContainer();\r\n}","function imgClick(event) {\n var clickTargetPath = $(event.target).attr('src'), // find the click target\n $lightbox = $('#image_show'),\n $boxImage = $('#image_show img');\n // check to see if lightbox is already displayed\n if ($lightbox.hasClass('display_img')) {\n closeLightbox();\n return\n }\n // attach a click listener for closing the lightbox\n $(window).click(closeLightbox);\n $boxImage.click(function(evt){\n evt.stopPropagation() // ignore clicks on the lightbox image\n })\n // change lightbox image targete\n $boxImage.attr('src', clickTargetPath);\n // display the lightbox\n $lightbox.addClass('display_img').removeClass('display_none');\n}","function imageClick(){\n\t$('.pic').click(function() { \n\t\tmenuModal.style.display = \"block\";\n\t\twindow.onclick = function(event) {\n\t\t\tif (event.target == menuModal) {\n\t\t\t\tmenuModal.style.display = \"none\";\n\t\t\t}\n\t\t}\n\t});\n}","function mouseClicked(){\n if(current_img == null) current_img = flowers_img;\n if(mouseX>=0 && mouseX=0 && mouseY maxClicks) {\n imagesParent.removeEventListener ('click', picClickHandler);\n setUpList();\n displayChart();\n } else {\n for (var i = 0; i < currentImages.length; i++) {\n productObject[currentImages[i]].timesShown++;\n }\n\n previousImages = currentImages;\n currentImages = [];\n\n var clicked = event.target.getAttribute('id');\n productObject[clicked].timesClicked++;\n\n imagesParent.removeChild(imagesParent.lastChild);\n imagesParent.removeChild(imagesParent.lastChild);\n imagesParent.removeChild(imagesParent.lastChild);\n\n userClicks++;\n setProductState (productObject, currentImages, previousImages, userClicks);\n\n start();\n }\n}","changeModalPicFromHomepage(clickedPhoto) {\n console.log('Target', event);\n console.log('changing pic', clickedPhoto);\n //set the state of the current photo to the photo that was clicked\n this.setState({\n modalCurrentPhoto: clickedPhoto\n });\n }","function clickHandler(e) {\n // Nur bei Linksklick\n if (e.button !== 0) return;\n clickAt(e.offsetX, e.offsetY);\n }","function changeImage(){\n\t\t$('#fileImagen').click();\n\t}","function imgClick(evt){\n\treturn imgDerecha(evt) ? btnnext(evt) : btnback(evt);\n}","handleClick( event ){ }","function clickOnImageLink(e)\n{\n\t// http://pit.dirty.ru/dirty/1/2011/04/15/28284-142540-32deef3d70482f072b516ac3a723533d.gif\n\tvar imgPreview = document.createElement('img');\n\timgPreview.setAttribute('src', this.href );\n\tvar imgLink = document.createElement('a');\n\timgLink.setAttribute('href', '#');\n\t_$.addEvent( imgLink, 'click', function(e) { this.previousSibling.setAttribute('style', this.previousSibling.getAttribute('bkpstyle')); this.parentNode.removeChild(this ); e.preventDefault(); return false; });\n\timgLink.appendChild( imgPreview );\n\t_$.insertAfter(this, imgLink);\n\tthis.setAttribute('bkpstyle', this.getAttribute('style'));\n\tthis.setAttribute('style', 'display: none');\n\te.preventDefault();\n\treturn false;\n}","function actualTakePhoto() {\n $(\"#capture\").click();\n}","function onClick(e) {\n if (e.target.dataset.source === undefined) {\n return;\n }\n onClickModalOpener();\n imagePlacer(onClickUrl(e));\n if (modalEL.classList.contains(\"is-open\")) {\n window.addEventListener(\"keydown\", onEsc);\n document\n .querySelector(\"div.lightbox__overlay\")\n .addEventListener(\"click\", onCloseClick);\n }\n window.addEventListener(\"keydown\", horizontalSlider);\n}","function imageClicked(eventData) {\n let clickInformation = eventData;\n if ( clickInformation.target.className = 'image') {\n if (clickInformation.target.alt === \"rock\") {\n let playerSelection = \"rock\";\n rockImage.classList.add('image','playerWeapon');\n outcome = playRound(playerSelection, computerPlay());\n \n if (playerScore != 5 && compScore != 5) {\n whoWon(outcome);\n \n }\n\n } else if (clickInformation.target.alt === \"paper\") {\n let playerSelection = \"paper\";\n paperImage.classList.add('image','playerWeapon');\n outcome = playRound(playerSelection, computerPlay());\n\n if (playerScore != 5 && compScore != 5) {\n whoWon(outcome);\n \n }\n \n } else if (clickInformation.target.alt === \"scissors\") {\n let playerSelection = \"scissors\";\n scissorsImage.classList.add('image','playerWeapon');\n outcome = playRound(playerSelection, computerPlay());\n\n if (playerScore != 5 && compScore != 5) {\n whoWon(outcome);\n \n }\n }\n }\n \n }","function selectImage(e) {\r\n if(e.target.innerHTML === \"\") //ensures only images can be clicked\r\n removeClasses(e);\r\n\r\n }","function imgOnclickEvt (img, data) {\n\t\treturn function () {\n\t\t\tshowImage (img, data);\n\t\t}\n\t}","render () {\n return (\n \n 
\n \n )\n }","function selectChoice(event){\n console.log(event.target.id);\n var k = event.target.id;\n console.log('yo', event.target);\n imgObjArr[k].numClicks++;\n console.log('hey', imgObjArr[k]);\n console.log('target clicks:', imgObjArr[k].numClicks);\n if (totalClicks < 25) {\n fillImages();\n } else {\n alert('Thank you for participating in our study!');\n save();\n buildTable();\n }\n}","function clickImage(e){\n if( e.target.id === 'left_goat_img' || e.target.id === 'right_goat_img'){\n pickRandomImages();\n totalClicks++;\n }\n if(event.target.id === 'left_goat_img'){\n leftGoatThatIsOnThePage.likes++;\n }\n if(event.target.id === 'right_goat_img'){\n rightGoatThatIsOnThePage.likes++;\n }\n if(totalClicks === 6){\n //remove event listener\n groupImageSection.removeEventListener('click' , clickImage);\n rightGoatImage.remove();\n leftGoatImage.remove();\n renderChartResults();\n }\n}","function pickedImg() { //the clicked img will be run every other time\n for ( var k = 0; k < imgShort.length; k +=2 ) {\n };\n function clicky(event) {\n var clicked1 = event.target.id;\n document.getElementById('img_box').addEventListener('click', clicky);\n }\n}","function imgClick(e) {\n musicInfo = e.target.alt;\n splitInfo = musicInfo.split('_');\n DOMString.getCurrentMusicVideoTitle.textContent = splitInfo[0];\n DOMString.getCurrentMusicVideoArtist.textContent = splitInfo[1];\n DOMString.getCurrentMusicVideo.src = e.target.dataset.src;\n\n DOMString.getCurrentMusicVideoHeading.classList.add('fadeIn');\n setTimeout(() => DOMString.getCurrentMusicVideoHeading.classList.remove('fadeIn'), 500);\n }","handleJDotterClick() {}","function imgClick(img) {\n window.event.stopPropagation();\n document.querySelector(`#grey-screen`).classList.toggle(\"hide\");\n document.querySelector(`#zoom-img`).src = img;\n}","function thumbnailClickHandler(evt) {\n var target = evt.target;\n if (!target || !target.classList.contains('thumbnail'))\n return;\n\n if (currentView === thumbnailListView || currentView === fullscreenView) {\n showFile(parseInt(target.dataset.index));\n }\n else if (currentView === thumbnailSelectView) {\n updateSelection(target);\n }\n else if (currentView === pickView) {\n cropPickedImage(files[parseInt(target.dataset.index)]);\n }\n}","function img_click(i){\n i.onclick=function(){\n modal.style.display=\"block\";\n modalImg.src=this.src;\n }\n}","function handleImgClick(e){\n modal.style.display = \"block\";\n console.log(e);\n let image=e.currentTarget.src;\n modalImg.src=image;\n captionText.innerHTML = e.currentTarget.getAttribute(\"alt\");\n}","function load_click() {\n if ($('random_front_picture') != null) {\n Event.observe('random_front_picture', 'click', function(e) {\n e.stop()\n to = $('random_front_picture').href \n new Ajax.Request(to)\n })\n }\n}","function choose_img(files_id) { // function choose img upload from file in your folder.\r\n $(\"#\" + files_id).click();\r\n}","clicked(x, y) {}","function clickImage(object){\n document.location = page.PRODUCT + '?id=' + object.id;\n}","function handleImageClick(event) {\n console.log(event.target.alt);\n //iterate through array to check that event has been clicked\n for (var i = 0; i < allProducts.length; i++) {\n if (event.target.alt === allProducts[i].name) {\n allProducts[i].votes++;\n }\n }\n //in order to get a random image which allows new photos to be displayed call randomImage Function\n randomImage();\n}","function uploadAvatar(){\n\t$('#avatarPhoto').click();\n}","putImage(button){\n if(button.code == -1){//al ser clickeada la locación, se enrutará a la página de locaciones y su subbsección respectiva\n switch(this.easyFrame){\n case 0:\n window.location.href = \"location.html#cove\";\n return;\n case 1:\n window.location.href = \"location.html#darkest-dungeon\";\n return;\n case 2:\n window.location.href = \"location.html#ruins\";\n return;\n case 3:\n window.location.href = \"location.html#warrens\";\n return;\n case 4:\n window.location.href = \"location.html#weald\";\n return;\n case 5:\n window.location.href = \"location.html#courtyard\";\n return;\n case 6:\n window.location.href = \"location.html#farmstead\";\n return;\n default:\n return;\n }\n\n }\n //en caso que se clickee un botón, se ajusta el frame de la locación y se vuelve visible, además se le agrega su interactividad\n this.areaPicture.setFrame(button.code);\n this.easyFrame = button.code;\n this.areaPicture.setVisible(true);\n this.areaPicture.setInteractive();\n this.areaPicture.on('clicked', this.putImage, this);\n }","function choiceClick(counter) {\n $('#picture .slick-next').trigger('click');\n $('.img-overlay').find('.click-overlay').parent().next().find('.overlay').addClass('click-overlay');\n $('#picture-array .slick-next').trigger('click');\n $('.image_number').html(counter + 1 + ' of 46');\n}","_onClick({x,y,object}) {\n console.log(\"Clicked icon:\",object);\n }","function on_click(e) {\n cloud.on_click(e.clientX, e.clientY);\n}","function onImageClick(imageId) {\n setMemeImgId(imageId)\n drawImgFromlocal(imageId);\n setTimeout(function () {\n document.querySelector('.header2').style.display = 'none';\n document.querySelector('main').style.display = 'none';\n document.querySelector('.my-info').style.display = 'none';\n document.querySelector('.canvas-btn-container').style.display = 'flex';\n resizeCanvas();\n }, 10)\n}","function handleClick(event)\n{\n}","function clickHandler(theEvent) {\n//outerHTML repalces the whole html including the tags\n var theImage = theEvent.target.outerHTML;\n //changing the class of image_show from display_none to display_img\n imgDiv.className = \"display_img\";\n //changing the html in the image_show by inserting the html from the thumbnail\n imgDiv.innerHTML = theImage;\n}","function handlePlanImage(id) {\n alert(id);\n }","function selectImage(event) {\n\n const button = event.currentTarget\n const buttons = document.querySelectorAll('.images button')\n\n buttons.forEach((button) => {\n button.classList.remove('active')\n })\n //adicionar a classe active para o botão clicado\n button.classList.add('active')\n\n\n //selecionara a imagem clicada\n const image = button.children[0]\n const imageContainer = document.querySelector('.orphanage-details > img')\n //atualizar o container de imagem\n imageContainer.src = image.src\n\n}","handleArrowClick(e) {\n e.preventDefault();\n this.changeMainImage(e.target.name);\n }","function selectAvatar1(event)\n{\n selectAvatar(event, 1);\n}","function canvasClick(e) {\n\tblockus.mouseClicked();\n}","function exeOpenImage(e){ openImage(e.target) }","onClick(event) {\n\t\t// console.log(\"mouse click\");\n\t\tthis.draw(event);\n\t}","handleClick() {}","function imgEvent(){\n alert('This is Void Link');\n}","function setupEventListenersToBigImg() {\n bigImg.addEventListener('click', addClick);\n}","function conduitEventClick(event) {\n var command = this.getMouseEventCommand( event );\n switch( command ) {\n case \"cancel\":\n this.close();\n break;\n case \"searchConduit\":\n this.searchConduit();\n break;\n case \"insertFromConduit\": \n var ids = this.list.getSelectedIDs();\n if( ids.length ) {\n // Actually, we only handle a single photo at a time\n // at this time.\n for (var i = 0; i < ids.length; i++) {\n var asset = {\n name: names[ids[i]],\n // TODO: bells & whistles for the IMG tag?\n body: \"![](\\\"\")
\"\n };\n app.c.createAssetFromEmbed( {\n asset: asset,\n callback: this._gIM( \"handleCreate\" )\n } );\n }\n }\n break;\n }\n}","render() {\n return (\n 
{this.props.handleClick(this.props.id)} }\n />\n )\n }","function mouseClick(event) {\n const id = event.target.id;\n\n // Check if click was made on the background\n if (id === \"background\")\n return;\n\n // Update selector if it wasn't over the clicked card \n // (mixed controls behaviour bug)\n if (mouseOver !== selectorOver)\n updateSelector(mouseOver);\n\n pickCard();\n}","function func(e) {\r\n // console.log(e.target.parentNode.getAttribute('class'));\r\n var p = e.target\r\n while (p.className !== \"music_image\") {\r\n p = p.parentNode\r\n }\r\n // var change = p.querySelector('img').src;\r\n\r\n changePreview(p.id);\r\n }","function mediaClick(e, data) {\n page = 0;\n $('#imgs').load('/admin/mediaSelector', addImgClickHandler);\n\n $(data.popup).children(\"#next\").click(function(e) {\n $('#imgs').load('/admin/mediaSelector?page=' + ++page, addImgClickHandler);\n });\n\n // Wire up the submit button click event\n $(data.popup).children(\"#submit\")\n .unbind(\"click\")\n .bind(\"click\", function(e) {\n // Get the editor\n var editor = data.editor;\n\n // Get the full url of the image clicked\n var fullUrl = $(data.popup).find(\"#imgToInsert\").val();\n\n // Insert the img tag into the document\n var html = \"![](\" + fullUrl + \")
\";\n editor.execCommand(data.command, html, null, data.button);\n\n // Hide the popup and set focus back to the editor\n editor.hidePopups();\n editor.focus();\n });\n }","function handleClick(event) {\n var clickedPictures = event.target.alt;\n // var clickdDiv = event.target.id;\n if (clickedPictures) {\n clicked++;\n\n for (var i = 0; i < allPictures.length; i++) {\n if (clickedPictures === allPictures[i].name) {\n allPictures[i].votes++;\n }\n }\n // renderPictures(); // gives us the images after each click!!\n renderPictures();\n\n if (clicked === totalClickedAllowed) {\n\n pictureContener.removeEventListener('click', handleClick);\n\n renderMyChart();\n renderResults();\n\n // lab 13 save data begins\n\n var stringifiedResults = JSON.stringify(allPictures); // \"packs data away\" to be stored, we convert to JSON\n localStorage.setItem('pictureResults', stringifiedResults); // store the data - \"put the box on the shelf\"\n // lab 13 save data ends\n }\n } else {\n alert('please clicked picture ');\n }\n}","function getClickHandler() {\n return function(info, tab) {\n\n // The srcUrl property is only available for image elements.\n var url = info.srcUrl;\n\n alert( url );\n };\n}","function bindClickOnThumbnails(){\n $(\".changedCP\").on('click',function(){\n var pId = this.id;\n closeOverlay();\n closeChangeCoverCatMenu();\n saveSelectedImage(pId);\n removePreviousCatCss();\n });\n}","function addThumbClickHandler(thumb) {\r\n 'use strict';\r\n thumb.addEventListener('click', function (event) {\r\n event.preventDefault();\r\n setDetailsFromThumb(thumb);\r\n\r\n // 7.1.4 - Showing the detail image again\r\n showDetails();\r\n });\r\n}","handlePress(i) {\n\t\tif (i == 1) {\n\t\t\tthis.gotoPhoto();\n\t\t} else if (i == 2) {\n\t\t\tthis.gotoGallery();\n\t\t}\n\t}","selectImage(imgSrc) {\n const {onImageSelected} = this.props;\n if (typeof onImageSelected === \"function\") {\n onImageSelected(imgSrc);\n }\n }","function genericOnClick(info, tab, callback) {\n // Get url of image\n let srcUrl = info.srcUrl;\n console.log(srcUrl);\n\n // Google cloud vision api request body\n let body = {\n \"requests\": [\n {\n \"image\": {\n \"source\": {\n \"imageUri\": srcUrl\n }\n },\n \"features\": [\n {\n \"type\": \"LANDMARK_DETECTION\",\n \"maxResults\": 1\n }\n ]\n }\n ]\n }\n\n // Call Google cloud vision api on image for landmark detection\n fetch(API_URL + API_KEY, {\n method: 'post',\n body: JSON.stringify(body)\n }).then(function(response) {\n return response.json();\n }).then(function(response) {\n // strip landmark from response\n let location = response.responses[0].landmarkAnnotations[0].description;\n\n callback(location);\n })\n .catch((error) => {\n // let user know if could not determine landmark\n alert('Sorry, we could not figure out where this image was taken :(');\n });\n}","function firstImgPastaClicked() {\n console.log(\"view recipe \");\n imageNum = 0;\n passMealId(imageNum);\n}","click() {\n this.get('modal').showModal(this.get('photoFullUrl'));\n }","function superbgimage_click(img) {\n\t\t\t\t\t\t$fullsize.nextSlide();\n\t\t\t\t\t\t$fullsizetimer.startTimer( 7000 );\n\t\t\t\t\t}","function clickHandler(event){\n\t\t\tif(ignoreClick){\n\t\t\t\tignoreClick = false;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tvar offset = overlay.cumulativeOffset();\t\t\t\n\t\t\ttarget.fire('flotr:click', [{\n\t\t\t\tx: xaxis.min + (event.pageX - offset.left - plotOffset.left) / hozScale,\n\t\t\t\ty: yaxis.max - (event.pageY - offset.top - plotOffset.top) / vertScale\n\t\t\t}]);\n\t\t}","handlePress(i) {\n if (i == 1) {\n this.gotoPhoto();\n } else if (i == 2) {\n this.gotoGallery();\n }\n }"],"string":"[\n \"onImageClick() {\\n console.log('Clicked Image')\\n }\",\n \"function imgClick(event) {\\n\\n}\",\n \"imageClickHandler() {\\n\\t\\tconst {data} = this.props,\\n\\t\\t\\tlistOfPhotos = document.querySelector('.gallery__photo-list');\\n\\n\\t\\tlistOfPhotos.addEventListener('click', e => {\\n\\t\\t\\tconst {target} = e,\\n\\t\\t\\t\\t{imageMinId: id} = target.dataset;\\n\\n\\t\\t\\tif (target.tagName !== 'IMG') return;\\n\\t\\t\\tthis.props.currentPhoto = +id;\\n\\t\\t\\tthis.changeGeneralPhoto(+id);\\n\\t\\t\\tthis.selectImageHandler();\\n\\t\\t});\\n\\t}\",\n \"function handleClick(event)\\n{\\n\\t// Gets position of click\\n\\tvar rect = canvas.getBoundingClientRect();\\n\\tvar posx = event.clientX - rect.left;\\n\\tvar posy = event.clientY - rect.top;\\n\\t\\n\\t// Checks each object to see if it was clicked\\n\\tfor (var i = 0; i < clickable.length; i++)\\n\\t{\\n\\t\\t// If image was clicked, runs specified function\\n\\t\\tif (posx >= clickable[i].x && posx <= clickable[i].x + clickable[i].width &&\\n\\t\\t\\tposy >= clickable[i].y && posy <= clickable[i].y + clickable[i].height)\\n\\t\\t{\\n\\t\\t\\tclickable[i].func();\\n\\t\\t}\\n\\t}\\n}\",\n \"function clickImage (data){\\n\\t\\t\\n\\t\\t/*click function on each image*/\\n\\t\\tdelegate(\\\"body\\\",\\\"click\\\",\\\".clickMe\\\",(event) => {\\n\\t\\t\\t\\n\\t\\t\\tevent.preventDefault();\\n\\t\\t\\tvar dataCaptionId=getKeyFromClosestElement(event.delegateTarget);\\n\\t\\t\\tvar dataCaption = data.caption;\\n\\t\\t\\tdataCaption = dataCaption.replace(/\\\\s+/g, \\\"\\\");\\n\\t\\t\\t\\n\\t\\t\\t//match the id and render pop up with the data\\n\\t\\t\\tif (dataCaption == dataCaptionId){\\n\\t\\t\\t\\trenderPopup(data, container) \\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t});\\n\\t\\t\\n\\t}\",\n \"function onImageClick(event) {\\n var imageWrap = document.querySelector('.image_wrap');\\n if(!imageWrap.classList.contains('image_displayed')) return;\\n\\n if(imageWrap.classList.contains('positioning')) {\\n var posRel = getPositionRel(event, document.querySelector('.image_wrap .image_con'));\\n\\n if(posRel.x >= 0 && posRel.x <= 1\\n && posRel.y >= 0 && posRel.y <= 1) {\\n placePinSelection(posRel);\\n event.stopPropagation();\\n }\\n }\\n\\n if(imageWrap.classList.contains('moving')) {\\n // ignore moving click events, mouse/touch events do everything\\n event.stopPropagation();\\n event.preventDefault();\\n }\\n }\",\n \"function onImgClick () {\\n $ ('.img-wrap').one ('click', function (e) {\\n console.log ('image clicked');\\n console.log (characters);\\n attackSound.play ();\\n $ ('#selected-character-id').css ('border', 'solid 5px greenyellow');\\n $ (this).off (e);\\n });\\n }\",\n \"function imgClicked(e)\\n{\\n\\tlargeImg.src = e.target.src;\\n}\",\n \"function handleClick(e) {\\n const src = e.currentTarget.querySelector('img').src;\\n const href = this.childNodes[0].nextSibling.href;\\n overlayLink.href = href;\\n overlayLink.innerText = href;\\n overlayImage.src = src;\\n overlay.classList.add('open');\\n }\",\n \"function clickOnImage(event)\\n{\\n\\tif ($(\\\"#country_selected\\\").val() != '0')\\n\\t{\\n\\t\\tvar e = event || window.event;\\n\\t\\tvar pos = getRelativeCoordinates(event, $(\\\"#reference\\\").get(0));\\n\\t\\tvar m = $(\\\"#marker\\\").get(0);\\n\\t\\tdisplayMarker(pos.x, pos.y);\\n\\t}\\n}\",\n \"function clickOnThumbnail() {\\n\\tgetPhotoUrl($(this));\\n\\t$container.append($photoviewer.append($photoBox).append($caption));\\n\\t$photoBox.after($leftClick);\\n\\t$photoBox.before($rightClick);\\n\\t$(\\\"html\\\").css(\\\"background\\\",\\\"gray\\\");\\n\\t//All other images are not visible\\n\\t$(\\\".thumbnail\\\").addClass(\\\"greyed-out\\\");\\n\\t$(\\\".small-img\\\").hide();\\n\\t$leftClick.on(\\\"click\\\",leftClick);\\n\\t$rightClick.on(\\\"click\\\",rightClick);\\n}\",\n \"function handleImageClick(event) {\\n if (isDragAndDropSupported || !instance) {\\n return;\\n }\\n\\n const target = event.target;\\n\\n fetch(target.src)\\n .then((r) => r.blob())\\n .then((blob) => {\\n const pageIndex = instance.viewState.currentPageIndex;\\n const pageInfo = instance.pageInfoForIndex(pageIndex);\\n\\n insertImageAnnotation(\\n new PSPDFKit.Geometry.Rect({\\n width: target.width,\\n height: target.height,\\n left: pageInfo.width / 2 - target.width / 2,\\n top: pageInfo.height / 2 - target.height / 2,\\n }),\\n blob,\\n pageIndex\\n );\\n });\\n}\",\n \"function ChoosePhoto(e) {\\n console.log(\\\"gggg\\\");\\n getPhoto(pictureSource.PHOTOLIBRARY);\\n }\",\n \"function imgClicked(imgId) {\\n gMeme.selectedImgId = imgId;\\n}\",\n \"function clickRegularViewFocusImg(e) {\\n\\n var clickedThing = e.target;\\n\\n // if clicked element is a single image or the focus img in a gallery\\n if (clickedThing.classList.contains('clickme')) {\\n\\n // define imgToShow\\n var imgToShow = clickedThing;\\n\\n // call NAMED lightbox function\\n lightbox(imgToShow);\\n\\n // call NAMED function to populate lightbox dots\\n populateLightboxDots(imgToShow);\\n\\n } // close if ('clickme')\\n} // close function\",\n \"function handleClick(e) {\\n\\tSTATE.popupOpen = true\\n\\tconst elem = closest(e.target, '[data-type=image]')\\n\\tconst i = parseInt(elem.getAttribute('data-index'), 10)\\n\\tSTATE.popup.innerHTML = popupContent({ elem: content.parts[i], index: i })\\n}\",\n \"function clickFunc(event) {\\n\\t//alert(event);\\n\\tvar e = event;\\n\\t//console.log(typeof e);\\n\\t\\n\\tif(event.target !== event.currentTarget) {\\n\\t\\tvar clickedItem = event.target.id;\\n\\t\\t//alert(\\\"this is the image id = \\\"+clickedItem);\\n\\t}\\n \\n}\",\n \"function addEventOpenImages() {\\n document.addEventListener('click', function (evt) {\\n if (evt.target.parentNode.classList.contains('picture')) {\\n evt.preventDefault();\\n showImage(evt.target.parentNode);\\n }\\n });\\n }\",\n \"function clickHandler(event) {\\n //take the path from the src attribute of the img node\\n //that we clicked on. We get a reference to that node\\n //from event.target\\n var targetString = event.target.src;\\n //take the relevant part of the path from the node\\n var targetPath = targetString.split('assets')[1];\\n var itemPath;\\n\\n //look through the ItemImage objects to find the one that\\n //corresponds to the image we clicked on\\n for (var i = 0; i < items.length; i++) {\\n //get the relevant part from the path on the object\\n itemPath = items[i].path.split('assets')[1];\\n if (itemPath === targetPath) {\\n //when we find the right object increment its clicked\\n //property\\n items[i].clicked += 1;\\n }\\n }\\n\\n changePicture();\\n}\",\n \"imageClick(e) {\\n e.preventDefault();\\n\\n if (this.item.link) {\\n window.open(this.item.link, '_blank');\\n } else {\\n this.shadowRoot.querySelector('#image-dialog').open();\\n\\n HhAnalytics.trackDialogOpen(this.item.internalTitle);\\n }\\n }\",\n \"function imageSelect(){\\n\\tvar getPhoto = document.getElementById(\\\"userPhoto\\\");\\n\\tgetPhoto.click();\\n}\",\n \"initiatePictureCapture(){this.imageInput.trigger('click')}\",\n \"function handleImgClick(event) {\\n if (event.target.id === 'left') {\\n allImages[leftImg].clicked += 1;\\n console.log(allImages[leftImg].imgname + ' ' + allImages[leftImg].clicked);\\n counter += 1;\\n pick3();\\n }\\n if (event.target.id === 'center') {\\n allImages[centerImg].clicked += 1;\\n console.log(allImages[centerImg].imgname + ' ' + allImages[centerImg].clicked);\\n counter += 1;\\n pick3();\\n }\\n if (event.target.id === 'right') {\\n allImages[rightImg].clicked += 1;\\n console.log(allImages[rightImg].imgname + ' ' + allImages[rightImg].clicked);\\n counter += 1;\\n pick3();\\n }\\n if (event.target.id === 'imgContain') {\\n alert('You need to click on an image!');\\n pick3();\\n }\\n}\",\n \"function clickHandler(event) {\\r\\n console.log(event.target);\\r\\n var imageName = event.target.alt;\\r\\n for (var i = 0; i < pictures.length; i++) {\\r\\n if (pictures[i].name === imageName) {\\r\\n pictures[i].updateChosen();\\r\\n picked++;\\r\\n }\\r\\n }\\r\\n\\r\\n if (picked === 25) {\\r\\n removeListener();\\r\\n chartData();\\r\\n showResults();\\r\\n var dataAsString = JSON.stringify(pictureData);\\r\\n localStorage.setItem('data', dataAsString);\\r\\n var nameAsString = JSON.stringify(labels);\\r\\n localStorage.setItem('pictures', nameAsString);\\r\\n }\\r\\n\\r\\n previousSet = thisSet;\\r\\n thisSet = {};\\r\\n setupImageContainer();\\r\\n}\",\n \"function imgClick(event) {\\n var clickTargetPath = $(event.target).attr('src'), // find the click target\\n $lightbox = $('#image_show'),\\n $boxImage = $('#image_show img');\\n // check to see if lightbox is already displayed\\n if ($lightbox.hasClass('display_img')) {\\n closeLightbox();\\n return\\n }\\n // attach a click listener for closing the lightbox\\n $(window).click(closeLightbox);\\n $boxImage.click(function(evt){\\n evt.stopPropagation() // ignore clicks on the lightbox image\\n })\\n // change lightbox image targete\\n $boxImage.attr('src', clickTargetPath);\\n // display the lightbox\\n $lightbox.addClass('display_img').removeClass('display_none');\\n}\",\n \"function imageClick(){\\n\\t$('.pic').click(function() { \\n\\t\\tmenuModal.style.display = \\\"block\\\";\\n\\t\\twindow.onclick = function(event) {\\n\\t\\t\\tif (event.target == menuModal) {\\n\\t\\t\\t\\tmenuModal.style.display = \\\"none\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t});\\n}\",\n \"function mouseClicked(){\\n if(current_img == null) current_img = flowers_img;\\n if(mouseX>=0 && mouseX=0 && mouseY maxClicks) {\\n imagesParent.removeEventListener ('click', picClickHandler);\\n setUpList();\\n displayChart();\\n } else {\\n for (var i = 0; i < currentImages.length; i++) {\\n productObject[currentImages[i]].timesShown++;\\n }\\n\\n previousImages = currentImages;\\n currentImages = [];\\n\\n var clicked = event.target.getAttribute('id');\\n productObject[clicked].timesClicked++;\\n\\n imagesParent.removeChild(imagesParent.lastChild);\\n imagesParent.removeChild(imagesParent.lastChild);\\n imagesParent.removeChild(imagesParent.lastChild);\\n\\n userClicks++;\\n setProductState (productObject, currentImages, previousImages, userClicks);\\n\\n start();\\n }\\n}\",\n \"changeModalPicFromHomepage(clickedPhoto) {\\n console.log('Target', event);\\n console.log('changing pic', clickedPhoto);\\n //set the state of the current photo to the photo that was clicked\\n this.setState({\\n modalCurrentPhoto: clickedPhoto\\n });\\n }\",\n \"function clickHandler(e) {\\n // Nur bei Linksklick\\n if (e.button !== 0) return;\\n clickAt(e.offsetX, e.offsetY);\\n }\",\n \"function changeImage(){\\n\\t\\t$('#fileImagen').click();\\n\\t}\",\n \"function imgClick(evt){\\n\\treturn imgDerecha(evt) ? btnnext(evt) : btnback(evt);\\n}\",\n \"handleClick( event ){ }\",\n \"function clickOnImageLink(e)\\n{\\n\\t// http://pit.dirty.ru/dirty/1/2011/04/15/28284-142540-32deef3d70482f072b516ac3a723533d.gif\\n\\tvar imgPreview = document.createElement('img');\\n\\timgPreview.setAttribute('src', this.href );\\n\\tvar imgLink = document.createElement('a');\\n\\timgLink.setAttribute('href', '#');\\n\\t_$.addEvent( imgLink, 'click', function(e) { this.previousSibling.setAttribute('style', this.previousSibling.getAttribute('bkpstyle')); this.parentNode.removeChild(this ); e.preventDefault(); return false; });\\n\\timgLink.appendChild( imgPreview );\\n\\t_$.insertAfter(this, imgLink);\\n\\tthis.setAttribute('bkpstyle', this.getAttribute('style'));\\n\\tthis.setAttribute('style', 'display: none');\\n\\te.preventDefault();\\n\\treturn false;\\n}\",\n \"function actualTakePhoto() {\\n $(\\\"#capture\\\").click();\\n}\",\n \"function onClick(e) {\\n if (e.target.dataset.source === undefined) {\\n return;\\n }\\n onClickModalOpener();\\n imagePlacer(onClickUrl(e));\\n if (modalEL.classList.contains(\\\"is-open\\\")) {\\n window.addEventListener(\\\"keydown\\\", onEsc);\\n document\\n .querySelector(\\\"div.lightbox__overlay\\\")\\n .addEventListener(\\\"click\\\", onCloseClick);\\n }\\n window.addEventListener(\\\"keydown\\\", horizontalSlider);\\n}\",\n \"function imageClicked(eventData) {\\n let clickInformation = eventData;\\n if ( clickInformation.target.className = 'image') {\\n if (clickInformation.target.alt === \\\"rock\\\") {\\n let playerSelection = \\\"rock\\\";\\n rockImage.classList.add('image','playerWeapon');\\n outcome = playRound(playerSelection, computerPlay());\\n \\n if (playerScore != 5 && compScore != 5) {\\n whoWon(outcome);\\n \\n }\\n\\n } else if (clickInformation.target.alt === \\\"paper\\\") {\\n let playerSelection = \\\"paper\\\";\\n paperImage.classList.add('image','playerWeapon');\\n outcome = playRound(playerSelection, computerPlay());\\n\\n if (playerScore != 5 && compScore != 5) {\\n whoWon(outcome);\\n \\n }\\n \\n } else if (clickInformation.target.alt === \\\"scissors\\\") {\\n let playerSelection = \\\"scissors\\\";\\n scissorsImage.classList.add('image','playerWeapon');\\n outcome = playRound(playerSelection, computerPlay());\\n\\n if (playerScore != 5 && compScore != 5) {\\n whoWon(outcome);\\n \\n }\\n }\\n }\\n \\n }\",\n \"function selectImage(e) {\\r\\n if(e.target.innerHTML === \\\"\\\") //ensures only images can be clicked\\r\\n removeClasses(e);\\r\\n\\r\\n }\",\n \"function imgOnclickEvt (img, data) {\\n\\t\\treturn function () {\\n\\t\\t\\tshowImage (img, data);\\n\\t\\t}\\n\\t}\",\n \"render () {\\n return (\\n \\n \\n \\n )\\n }\",\n \"function selectChoice(event){\\n console.log(event.target.id);\\n var k = event.target.id;\\n console.log('yo', event.target);\\n imgObjArr[k].numClicks++;\\n console.log('hey', imgObjArr[k]);\\n console.log('target clicks:', imgObjArr[k].numClicks);\\n if (totalClicks < 25) {\\n fillImages();\\n } else {\\n alert('Thank you for participating in our study!');\\n save();\\n buildTable();\\n }\\n}\",\n \"function clickImage(e){\\n if( e.target.id === 'left_goat_img' || e.target.id === 'right_goat_img'){\\n pickRandomImages();\\n totalClicks++;\\n }\\n if(event.target.id === 'left_goat_img'){\\n leftGoatThatIsOnThePage.likes++;\\n }\\n if(event.target.id === 'right_goat_img'){\\n rightGoatThatIsOnThePage.likes++;\\n }\\n if(totalClicks === 6){\\n //remove event listener\\n groupImageSection.removeEventListener('click' , clickImage);\\n rightGoatImage.remove();\\n leftGoatImage.remove();\\n renderChartResults();\\n }\\n}\",\n \"function pickedImg() { //the clicked img will be run every other time\\n for ( var k = 0; k < imgShort.length; k +=2 ) {\\n };\\n function clicky(event) {\\n var clicked1 = event.target.id;\\n document.getElementById('img_box').addEventListener('click', clicky);\\n }\\n}\",\n \"function imgClick(e) {\\n musicInfo = e.target.alt;\\n splitInfo = musicInfo.split('_');\\n DOMString.getCurrentMusicVideoTitle.textContent = splitInfo[0];\\n DOMString.getCurrentMusicVideoArtist.textContent = splitInfo[1];\\n DOMString.getCurrentMusicVideo.src = e.target.dataset.src;\\n\\n DOMString.getCurrentMusicVideoHeading.classList.add('fadeIn');\\n setTimeout(() => DOMString.getCurrentMusicVideoHeading.classList.remove('fadeIn'), 500);\\n }\",\n \"handleJDotterClick() {}\",\n \"function imgClick(img) {\\n window.event.stopPropagation();\\n document.querySelector(`#grey-screen`).classList.toggle(\\\"hide\\\");\\n document.querySelector(`#zoom-img`).src = img;\\n}\",\n \"function thumbnailClickHandler(evt) {\\n var target = evt.target;\\n if (!target || !target.classList.contains('thumbnail'))\\n return;\\n\\n if (currentView === thumbnailListView || currentView === fullscreenView) {\\n showFile(parseInt(target.dataset.index));\\n }\\n else if (currentView === thumbnailSelectView) {\\n updateSelection(target);\\n }\\n else if (currentView === pickView) {\\n cropPickedImage(files[parseInt(target.dataset.index)]);\\n }\\n}\",\n \"function img_click(i){\\n i.onclick=function(){\\n modal.style.display=\\\"block\\\";\\n modalImg.src=this.src;\\n }\\n}\",\n \"function handleImgClick(e){\\n modal.style.display = \\\"block\\\";\\n console.log(e);\\n let image=e.currentTarget.src;\\n modalImg.src=image;\\n captionText.innerHTML = e.currentTarget.getAttribute(\\\"alt\\\");\\n}\",\n \"function load_click() {\\n if ($('random_front_picture') != null) {\\n Event.observe('random_front_picture', 'click', function(e) {\\n e.stop()\\n to = $('random_front_picture').href \\n new Ajax.Request(to)\\n })\\n }\\n}\",\n \"function choose_img(files_id) { // function choose img upload from file in your folder.\\r\\n $(\\\"#\\\" + files_id).click();\\r\\n}\",\n \"clicked(x, y) {}\",\n \"function clickImage(object){\\n document.location = page.PRODUCT + '?id=' + object.id;\\n}\",\n \"function handleImageClick(event) {\\n console.log(event.target.alt);\\n //iterate through array to check that event has been clicked\\n for (var i = 0; i < allProducts.length; i++) {\\n if (event.target.alt === allProducts[i].name) {\\n allProducts[i].votes++;\\n }\\n }\\n //in order to get a random image which allows new photos to be displayed call randomImage Function\\n randomImage();\\n}\",\n \"function uploadAvatar(){\\n\\t$('#avatarPhoto').click();\\n}\",\n \"putImage(button){\\n if(button.code == -1){//al ser clickeada la locación, se enrutará a la página de locaciones y su subbsección respectiva\\n switch(this.easyFrame){\\n case 0:\\n window.location.href = \\\"location.html#cove\\\";\\n return;\\n case 1:\\n window.location.href = \\\"location.html#darkest-dungeon\\\";\\n return;\\n case 2:\\n window.location.href = \\\"location.html#ruins\\\";\\n return;\\n case 3:\\n window.location.href = \\\"location.html#warrens\\\";\\n return;\\n case 4:\\n window.location.href = \\\"location.html#weald\\\";\\n return;\\n case 5:\\n window.location.href = \\\"location.html#courtyard\\\";\\n return;\\n case 6:\\n window.location.href = \\\"location.html#farmstead\\\";\\n return;\\n default:\\n return;\\n }\\n\\n }\\n //en caso que se clickee un botón, se ajusta el frame de la locación y se vuelve visible, además se le agrega su interactividad\\n this.areaPicture.setFrame(button.code);\\n this.easyFrame = button.code;\\n this.areaPicture.setVisible(true);\\n this.areaPicture.setInteractive();\\n this.areaPicture.on('clicked', this.putImage, this);\\n }\",\n \"function choiceClick(counter) {\\n $('#picture .slick-next').trigger('click');\\n $('.img-overlay').find('.click-overlay').parent().next().find('.overlay').addClass('click-overlay');\\n $('#picture-array .slick-next').trigger('click');\\n $('.image_number').html(counter + 1 + ' of 46');\\n}\",\n \"_onClick({x,y,object}) {\\n console.log(\\\"Clicked icon:\\\",object);\\n }\",\n \"function on_click(e) {\\n cloud.on_click(e.clientX, e.clientY);\\n}\",\n \"function onImageClick(imageId) {\\n setMemeImgId(imageId)\\n drawImgFromlocal(imageId);\\n setTimeout(function () {\\n document.querySelector('.header2').style.display = 'none';\\n document.querySelector('main').style.display = 'none';\\n document.querySelector('.my-info').style.display = 'none';\\n document.querySelector('.canvas-btn-container').style.display = 'flex';\\n resizeCanvas();\\n }, 10)\\n}\",\n \"function handleClick(event)\\n{\\n}\",\n \"function clickHandler(theEvent) {\\n//outerHTML repalces the whole html including the tags\\n var theImage = theEvent.target.outerHTML;\\n //changing the class of image_show from display_none to display_img\\n imgDiv.className = \\\"display_img\\\";\\n //changing the html in the image_show by inserting the html from the thumbnail\\n imgDiv.innerHTML = theImage;\\n}\",\n \"function handlePlanImage(id) {\\n alert(id);\\n }\",\n \"function selectImage(event) {\\n\\n const button = event.currentTarget\\n const buttons = document.querySelectorAll('.images button')\\n\\n buttons.forEach((button) => {\\n button.classList.remove('active')\\n })\\n //adicionar a classe active para o botão clicado\\n button.classList.add('active')\\n\\n\\n //selecionara a imagem clicada\\n const image = button.children[0]\\n const imageContainer = document.querySelector('.orphanage-details > img')\\n //atualizar o container de imagem\\n imageContainer.src = image.src\\n\\n}\",\n \"handleArrowClick(e) {\\n e.preventDefault();\\n this.changeMainImage(e.target.name);\\n }\",\n \"function selectAvatar1(event)\\n{\\n selectAvatar(event, 1);\\n}\",\n \"function canvasClick(e) {\\n\\tblockus.mouseClicked();\\n}\",\n \"function exeOpenImage(e){ openImage(e.target) }\",\n \"onClick(event) {\\n\\t\\t// console.log(\\\"mouse click\\\");\\n\\t\\tthis.draw(event);\\n\\t}\",\n \"handleClick() {}\",\n \"function imgEvent(){\\n alert('This is Void Link');\\n}\",\n \"function setupEventListenersToBigImg() {\\n bigImg.addEventListener('click', addClick);\\n}\",\n \"function conduitEventClick(event) {\\n var command = this.getMouseEventCommand( event );\\n switch( command ) {\\n case \\\"cancel\\\":\\n this.close();\\n break;\\n case \\\"searchConduit\\\":\\n this.searchConduit();\\n break;\\n case \\\"insertFromConduit\\\": \\n var ids = this.list.getSelectedIDs();\\n if( ids.length ) {\\n // Actually, we only handle a single photo at a time\\n // at this time.\\n for (var i = 0; i < ids.length; i++) {\\n var asset = {\\n name: names[ids[i]],\\n // TODO: bells & whistles for the IMG tag?\\n body: \\\"![](\\\\\\\"\\\")
\\\"\\n };\\n app.c.createAssetFromEmbed( {\\n asset: asset,\\n callback: this._gIM( \\\"handleCreate\\\" )\\n } );\\n }\\n }\\n break;\\n }\\n}\",\n \"render() {\\n return (\\n {this.props.handleClick(this.props.id)} }\\n />\\n )\\n }\",\n \"function mouseClick(event) {\\n const id = event.target.id;\\n\\n // Check if click was made on the background\\n if (id === \\\"background\\\")\\n return;\\n\\n // Update selector if it wasn't over the clicked card \\n // (mixed controls behaviour bug)\\n if (mouseOver !== selectorOver)\\n updateSelector(mouseOver);\\n\\n pickCard();\\n}\",\n \"function func(e) {\\r\\n // console.log(e.target.parentNode.getAttribute('class'));\\r\\n var p = e.target\\r\\n while (p.className !== \\\"music_image\\\") {\\r\\n p = p.parentNode\\r\\n }\\r\\n // var change = p.querySelector('img').src;\\r\\n\\r\\n changePreview(p.id);\\r\\n }\",\n \"function mediaClick(e, data) {\\n page = 0;\\n $('#imgs').load('/admin/mediaSelector', addImgClickHandler);\\n\\n $(data.popup).children(\\\"#next\\\").click(function(e) {\\n $('#imgs').load('/admin/mediaSelector?page=' + ++page, addImgClickHandler);\\n });\\n\\n // Wire up the submit button click event\\n $(data.popup).children(\\\"#submit\\\")\\n .unbind(\\\"click\\\")\\n .bind(\\\"click\\\", function(e) {\\n // Get the editor\\n var editor = data.editor;\\n\\n // Get the full url of the image clicked\\n var fullUrl = $(data.popup).find(\\\"#imgToInsert\\\").val();\\n\\n // Insert the img tag into the document\\n var html = \\\"![](\\\" + fullUrl + \\\")
\\\";\\n editor.execCommand(data.command, html, null, data.button);\\n\\n // Hide the popup and set focus back to the editor\\n editor.hidePopups();\\n editor.focus();\\n });\\n }\",\n \"function handleClick(event) {\\n var clickedPictures = event.target.alt;\\n // var clickdDiv = event.target.id;\\n if (clickedPictures) {\\n clicked++;\\n\\n for (var i = 0; i < allPictures.length; i++) {\\n if (clickedPictures === allPictures[i].name) {\\n allPictures[i].votes++;\\n }\\n }\\n // renderPictures(); // gives us the images after each click!!\\n renderPictures();\\n\\n if (clicked === totalClickedAllowed) {\\n\\n pictureContener.removeEventListener('click', handleClick);\\n\\n renderMyChart();\\n renderResults();\\n\\n // lab 13 save data begins\\n\\n var stringifiedResults = JSON.stringify(allPictures); // \\\"packs data away\\\" to be stored, we convert to JSON\\n localStorage.setItem('pictureResults', stringifiedResults); // store the data - \\\"put the box on the shelf\\\"\\n // lab 13 save data ends\\n }\\n } else {\\n alert('please clicked picture ');\\n }\\n}\",\n \"function getClickHandler() {\\n return function(info, tab) {\\n\\n // The srcUrl property is only available for image elements.\\n var url = info.srcUrl;\\n\\n alert( url );\\n };\\n}\",\n \"function bindClickOnThumbnails(){\\n $(\\\".changedCP\\\").on('click',function(){\\n var pId = this.id;\\n closeOverlay();\\n closeChangeCoverCatMenu();\\n saveSelectedImage(pId);\\n removePreviousCatCss();\\n });\\n}\",\n \"function addThumbClickHandler(thumb) {\\r\\n 'use strict';\\r\\n thumb.addEventListener('click', function (event) {\\r\\n event.preventDefault();\\r\\n setDetailsFromThumb(thumb);\\r\\n\\r\\n // 7.1.4 - Showing the detail image again\\r\\n showDetails();\\r\\n });\\r\\n}\",\n \"handlePress(i) {\\n\\t\\tif (i == 1) {\\n\\t\\t\\tthis.gotoPhoto();\\n\\t\\t} else if (i == 2) {\\n\\t\\t\\tthis.gotoGallery();\\n\\t\\t}\\n\\t}\",\n \"selectImage(imgSrc) {\\n const {onImageSelected} = this.props;\\n if (typeof onImageSelected === \\\"function\\\") {\\n onImageSelected(imgSrc);\\n }\\n }\",\n \"function genericOnClick(info, tab, callback) {\\n // Get url of image\\n let srcUrl = info.srcUrl;\\n console.log(srcUrl);\\n\\n // Google cloud vision api request body\\n let body = {\\n \\\"requests\\\": [\\n {\\n \\\"image\\\": {\\n \\\"source\\\": {\\n \\\"imageUri\\\": srcUrl\\n }\\n },\\n \\\"features\\\": [\\n {\\n \\\"type\\\": \\\"LANDMARK_DETECTION\\\",\\n \\\"maxResults\\\": 1\\n }\\n ]\\n }\\n ]\\n }\\n\\n // Call Google cloud vision api on image for landmark detection\\n fetch(API_URL + API_KEY, {\\n method: 'post',\\n body: JSON.stringify(body)\\n }).then(function(response) {\\n return response.json();\\n }).then(function(response) {\\n // strip landmark from response\\n let location = response.responses[0].landmarkAnnotations[0].description;\\n\\n callback(location);\\n })\\n .catch((error) => {\\n // let user know if could not determine landmark\\n alert('Sorry, we could not figure out where this image was taken :(');\\n });\\n}\",\n \"function firstImgPastaClicked() {\\n console.log(\\\"view recipe \\\");\\n imageNum = 0;\\n passMealId(imageNum);\\n}\",\n \"click() {\\n this.get('modal').showModal(this.get('photoFullUrl'));\\n }\",\n \"function superbgimage_click(img) {\\n\\t\\t\\t\\t\\t\\t$fullsize.nextSlide();\\n\\t\\t\\t\\t\\t\\t$fullsizetimer.startTimer( 7000 );\\n\\t\\t\\t\\t\\t}\",\n \"function clickHandler(event){\\n\\t\\t\\tif(ignoreClick){\\n\\t\\t\\t\\tignoreClick = false;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\n\\t\\t\\tvar offset = overlay.cumulativeOffset();\\t\\t\\t\\n\\t\\t\\ttarget.fire('flotr:click', [{\\n\\t\\t\\t\\tx: xaxis.min + (event.pageX - offset.left - plotOffset.left) / hozScale,\\n\\t\\t\\t\\ty: yaxis.max - (event.pageY - offset.top - plotOffset.top) / vertScale\\n\\t\\t\\t}]);\\n\\t\\t}\",\n \"handlePress(i) {\\n if (i == 1) {\\n this.gotoPhoto();\\n } else if (i == 2) {\\n this.gotoGallery();\\n }\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.793244","0.7913272","0.75001377","0.72610736","0.721918","0.7161421","0.71362853","0.7103456","0.7090242","0.70852727","0.70203173","0.70005375","0.6998707","0.6914208","0.69108677","0.6900724","0.6889584","0.6857063","0.68258864","0.68070686","0.680617","0.6804444","0.67902803","0.6771649","0.6767206","0.6744571","0.67265475","0.66947025","0.6666386","0.6619777","0.6583921","0.6579494","0.65726095","0.65481764","0.65460896","0.6545399","0.6538918","0.6527891","0.65266705","0.6515239","0.6506214","0.64951426","0.64866126","0.64859486","0.64675164","0.64639205","0.6430204","0.6425853","0.6423818","0.64160573","0.6412918","0.64090186","0.6407814","0.6406657","0.63945633","0.6387182","0.638589","0.6377641","0.63693595","0.63538444","0.634797","0.63397104","0.6336709","0.63341415","0.6323704","0.63152874","0.630035","0.62993306","0.6297846","0.6292363","0.6276482","0.62634355","0.6251904","0.624599","0.6238629","0.623367","0.6230152","0.6214455","0.6195432","0.6190667","0.6175799","0.6175051","0.6172225","0.6169212","0.61583227","0.6154797","0.61495316","0.61490804","0.6144586","0.6140406","0.61400604","0.6137892","0.61361504","0.61258847","0.6120286","0.6119872","0.61156636","0.611211","0.60905135","0.6090047","0.60857326"],"string":"[\n \"0.793244\",\n \"0.7913272\",\n \"0.75001377\",\n \"0.72610736\",\n \"0.721918\",\n \"0.7161421\",\n \"0.71362853\",\n \"0.7103456\",\n \"0.7090242\",\n \"0.70852727\",\n \"0.70203173\",\n \"0.70005375\",\n \"0.6998707\",\n \"0.6914208\",\n \"0.69108677\",\n \"0.6900724\",\n \"0.6889584\",\n \"0.6857063\",\n \"0.68258864\",\n \"0.68070686\",\n \"0.680617\",\n \"0.6804444\",\n \"0.67902803\",\n \"0.6771649\",\n \"0.6767206\",\n \"0.6744571\",\n \"0.67265475\",\n \"0.66947025\",\n \"0.6666386\",\n \"0.6619777\",\n \"0.6583921\",\n \"0.6579494\",\n \"0.65726095\",\n \"0.65481764\",\n \"0.65460896\",\n \"0.6545399\",\n \"0.6538918\",\n \"0.6527891\",\n \"0.65266705\",\n \"0.6515239\",\n \"0.6506214\",\n \"0.64951426\",\n \"0.64866126\",\n \"0.64859486\",\n \"0.64675164\",\n \"0.64639205\",\n \"0.6430204\",\n \"0.6425853\",\n \"0.6423818\",\n \"0.64160573\",\n \"0.6412918\",\n \"0.64090186\",\n \"0.6407814\",\n \"0.6406657\",\n \"0.63945633\",\n \"0.6387182\",\n \"0.638589\",\n \"0.6377641\",\n \"0.63693595\",\n \"0.63538444\",\n \"0.634797\",\n \"0.63397104\",\n \"0.6336709\",\n \"0.63341415\",\n \"0.6323704\",\n \"0.63152874\",\n \"0.630035\",\n \"0.62993306\",\n \"0.6297846\",\n \"0.6292363\",\n \"0.6276482\",\n \"0.62634355\",\n \"0.6251904\",\n \"0.624599\",\n \"0.6238629\",\n \"0.623367\",\n \"0.6230152\",\n \"0.6214455\",\n \"0.6195432\",\n \"0.6190667\",\n \"0.6175799\",\n \"0.6175051\",\n \"0.6172225\",\n \"0.6169212\",\n \"0.61583227\",\n \"0.6154797\",\n \"0.61495316\",\n \"0.61490804\",\n \"0.6144586\",\n \"0.6140406\",\n \"0.61400604\",\n \"0.6137892\",\n \"0.61361504\",\n \"0.61258847\",\n \"0.6120286\",\n \"0.6119872\",\n \"0.61156636\",\n \"0.611211\",\n \"0.60905135\",\n \"0.6090047\",\n \"0.60857326\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81768,"cells":{"query":{"kind":"string","value":"Function to Draw Chart"},"document":{"kind":"string","value":"function drawChart() {\n var ctx = canvas.getContext('2d');\n var myBarChart = new Chart(ctx, {\n type: 'bar',\n data: data,\n // options: {\n // responsive: false\n // }\n });\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["_drawChart()\n {\n\n }","function drawChart() {\n stroke(0);\n yAxis();\n xAxis();\n}","function drawChart(arr) {\n drawSleepChart(arr);\n drawStepsChart(arr);\n drawCalorieChart(arr);\n drawHeartRateChart(arr);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'X');\n data.addColumn('number', 'Price');\n \n data.addRows(graphData)\n\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.LineChart(document.getElementById('chart_div'));\n chart.draw(data, fullWidthOptions);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(rendergrafica);\n\n // Set chart options\n var options = {\n 'title': 'Cantidad de laboratorios por categoria',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n\n }","function drawCharts() {\n\tdrawRecommendedInvestmentChart();\n}","function drawChart() {\r\n drawSentimentBreakdown();\r\n drawSentimentTimeline();\r\n drawPopularityTimeline();\r\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(render);\n\n // Set chart options\n var options = {\n 'title': 'Cantidad de laboratorios por sede',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(rendergrafica);\n\n // Set chart options\n var options = {\n 'title': 'cantidad de pruebas por laboratorio',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n\t\t// Get the dataGraphic array form PHP\n\t\tvar dataOptionsGraphic = JSON.parse(jsonDataGraphic);\n\n\t\tfor (col in dataOptionsGraphic) {\n\t\t\tdataOptionsGraphic[col][5] = strTooltipStart + dataOptionsGraphic[col][1] + strTooltipEnd;\n\t\t}\n\n\t\t// Header of the data Graphic\n\t\tvar headDataGraphic = [M.util.get_string('choice', 'evoting'), M.util.get_string('countvote', 'evoting'), {\n\t\t\ttype: 'string',\n\t\t\trole: 'style'\n\t\t}, {\n\t\t\ttype: 'string',\n\t\t\trole: 'annotation'\n\t\t}, 'id', {\n\t\t\t'type': 'string',\n\t\t\t'role': 'tooltip',\n\t\t\t'p': {\n\t\t\t\t'html': true\n\t\t\t}\n\t\t}, {\n\t\t\ttype: 'string'\n\t\t}];\n\t\t// Create the complete data of the Graphic by integrated header data\n\t\tdataOptionsGraphic.splice(0, 0, headDataGraphic);\n\t\toptionsGraph = {\n\t\t\ttitle: \"\",\n\t\t\tallowHtml: true,\n\t\t\theight: 450,\n\t\t\tlegend: {\n\t\t\t\tposition: 'none'\n\t\t\t},\n\t\t\tanimation: {\n\t\t\t\tduration: 500,\n\t\t\t\teasing: 'out'\n\t\t\t},\n\n\t\t\tvAxis: {\n\t\t\t\tgridlines: {\n\t\t\t\t\tcolor: '#000000'\n\t\t\t\t},\n\t\t\t\ttextPosition: 'out',\n\t\t\t\ttextStyle: {\n\t\t\t\t\tcolor: '#007cb7',\n\t\t\t\t\tfontName: 'Oswald, Times-Roman',\n\t\t\t\t\tbold: true,\n\t\t\t\t\titalic: false\n\t\t\t\t}\n\n\t\t\t},\n\t\t\thAxis: {\n\t\t\t\ttitle: M.util.get_string('totalvote', 'evoting') + \" : \" + sumVote,\n\t\t\t\tminValue: \"0\",\n\t\t\t\tmaxValue: max,\n\t\t\t\tgridlines: {\n\t\t\t\t\tcolor: '#e6e6e6'\n\t\t\t\t},\n\t\t\t\ttextStyle: {\n\t\t\t\t\tcolor: '#e6e6e6'\n\t\t\t\t},\n\t\t\t\ttitleTextStyle: {\n\t\t\t\t\tcolor: '#007cb7',\n\t\t\t\t\tfontName: 'Oswald, Times-Roman',\n\t\t\t\t\tbold: false,\n\t\t\t\t\titalic: false\n\t\t\t\t}\n\t\t\t},\n\t\t\tbaselineColor: '#007cb7',\n\t\t\ttooltip: {\n\t\t\t\tisHtml: true\n\t\t\t},\n\n\t\t\tannotations: {\n\t\t\t\ttextStyle: {\n\t\t\t\t\tfontName: 'Oswald,Helvetica,Arial,sans-serif',\n\t\t\t\t\tbold: false,\n\t\t\t\t\titalic: false,\n\t\t\t\t\tcolor: '#007cb7',\n\t\t\t\t\tauraColor: 'rgba(255,255,255,0)',\n\t\t\t\t\topacity: 1,\n\t\t\t\t\tx: 20\n\t\t\t\t},\n\t\t\t\talwaysOutside: false,\n\t\t\t\thighContrast: true,\n\t\t\t\tstemColor: '#000000'\n\t\t\t},\n\t\t\tbackgroundColor: '#f6f6f6',\n\t\t\tchartArea: {\n\t\t\t\tleft: '5%',\n\t\t\t\ttop: '5%',\n\t\t\t\theight: '75%',\n\t\t\t\twidth: '100%'\n\t\t\t}\n\t\t};\n\n\t\tdataGraph = google.visualization.arrayToDataTable(dataOptionsGraphic);\n\t\tdataGraph.setColumnProperty(0, {\n\t\t\tallowHtml: true\n\t\t});\n\t\tviewGraph = new google.visualization.DataView(dataGraph);\n\t\tviewGraph.setColumns([0, 1, 2, 3, 5]);\n\n\t\t// Create and draw the visualization.\n\t\tchart = new google.visualization.BarChart(document.getElementById('chartContainer'));\n\t\t$(\".answerCount\").each(function () {\n\t\t\tidOption = $(this).prop('id');\n\t\t});\n\t\tupdateOptionGraphicMax();\n\n\t\tmanageGoodAnswer();\n\t}","function drawCharts() {\n drawPieChart()\n drawAxisTickColors()\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Acertos', acertos],\n ['Erros', erros]\n ]);\n\n // Set chart options\n var options = {'width':800,\n 'height':600,\n 'backgroundColor': 'none',\n 'fontSize': 15,\n 'is3D':true};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawCharts() {\n /*TOD0: Implement function;\n Un dato interesante del Webstorm es que al escribir tod0\n o TOD0 y vamos a TOD0 (6, parte de abajo) sale que en\n nuestro proyecto tenemos un TOD0 y automaticamente al\n darle click nos reidirecciona a donde se encuentra\n dicho TOD0. Es una manera de hacer una pausa en lo que\n estamos implementado y cuando regresamos al trabajo de\n frente nos ubicamos en la zona donde estabamos trabajando\n o donde queremos trabajar. Recordar que el TOD0 significa\n \"to do\" (por hacer).\n\n Este metodo (drawCharts) al invocar estas 2 metodos hara que se\n dibujen los 2 graficos. Este metodo drawCharts sera invocado en\n el main.js\n */\n drawPieChart()\n drawAxisTickColors()\n}","drawChart () {\r\n\t\t\r\n\t\t// Converts color range value (eg. 'red', 'blue') into the appropriate color array\r\n\t\tthis.colorRange = this.convertColorRange(this.colorRange);\r\n\r\n\t\t// Set width and height of graph based on size of bounding element and margins\r\n\t\tvar width = document.getElementById(this.elementName).offsetWidth - this.marginLeft - this.marginRight;\r\n\t\tvar height = document.getElementById(this.elementName).offsetHeight - this.marginTop - this.marginBottom;\r\n\r\n\t\t// Create axis, streams etc.\t\t\r\n\t\tvar x = d3.time.scale()\r\n\t\t\t.range([0, width]);\r\n\r\n\t\tvar y = d3.scale.linear()\r\n\t\t\t.range([height - 10, 0]);\r\n\r\n\t\tvar z = d3.scale.ordinal()\r\n\t\t\t.range(this.colorRange);\r\n\r\n\t\tvar xAxis = d3.svg.axis()\r\n\t\t\t.scale(x)\r\n\t\t\t.orient('bottom')\r\n\t\t\t.ticks(d3.time.years);\r\n\r\n\t\tvar yAxis = d3.svg.axis()\r\n\t\t\t.scale(y);\r\n\r\n\t\tvar stack = d3.layout.stack()\r\n\t\t\t.offset('silhouette')\r\n\t\t\t.values(function (d) { return d.values; })\r\n\t\t\t.x(function (d) { return d.date; })\r\n\t\t\t.y(function (d) { return d.value; });\r\n\r\n\t\tvar nest = d3.nest()\r\n\t\t\t.key(function (d) { return d.key; });\r\n\r\n\t\tvar area = d3.svg.area()\r\n\t\t\t.interpolate('cardinal')\r\n\t\t\t.x(function (d) { return x(d.date); })\r\n\t\t\t.y0(function (d) { return y(d.y0); })\r\n\t\t\t.y1(function (d) { return y(d.y0 + d.y); });\r\n\t\r\n\t\t// Create SVG area of an appropriate size\r\n\t\tvar svg = d3.select(this.element).append('svg')\r\n\t\t\t.attr('width', width + this.marginLeft + this.marginRight)\r\n\t\t\t.attr('height', height + this.marginTop + this.marginBottom)\r\n\t\t\t.append('g')\r\n\t\t\t.attr('transform', 'translate(' + this.marginLeft + ',' + this.marginTop + ')');\r\n\r\n\t\t// Read CSV file\r\n\t\td3.csv(this.csvfile, function (data) {\r\n\t\t\tvar format = d3.time.format('%Y-%m-%d');\r\n\t\t\tdata.forEach(function (d) {\r\n\t\t\t\td.date = format.parse(d.date);\r\n\t\t\t\td.value = +d.value;\r\n\t\t\t});\r\n\r\n\t\t\tvar layers = stack(nest.entries(data));\r\n\r\n\t\t\tx.domain(d3.extent(data, function (d) { return d.date; }));\r\n\t\t\ty.domain([0, d3.max(data, function (d) { return d.y0 + d.y; })]);\r\n\r\n\t\t\t// Apply data to graph\r\n\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t.data(layers)\r\n\t\t\t\t.enter().append('path')\r\n\t\t\t\t.attr('class', 'layer')\r\n\t\t\t\t.attr('d', function (d) { return area(d.values); })\r\n\t\t\t\t.style('fill', function (d, i) { return z(i); });\r\n\r\n\t\t\t// Add a black outline to streams\r\n\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t.attr('stroke', 'black')\r\n\t\t\t\t.attr('stroke-width', '0.5px');\r\n\r\n\t\t\tsvg.append('g')\r\n\t\t\t\t.attr('class', 'x axis')\r\n\t\t\t\t.attr('transform', 'translate(0,' + height + ')')\r\n\t\t\t\t.call(xAxis);\r\n\r\n\t\t\tsvg.append('g')\r\n\t\t\t\t.attr('class', 'y axis')\r\n\t\t\t\t.attr('transform', 'translate(' + width + ', 0)')\r\n\t\t\t\t.call(yAxis.orient('right'));\r\n\r\n\t\t\tsvg.append('g')\r\n\t\t\t\t.attr('class', 'y axis')\r\n\t\t\t\t.call(yAxis.orient('left'));\r\n\r\n\t\t\t// Other streams fade when one stream is hovered over with the cursor\r\n\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t.attr('opacity', 1)\r\n\t\t\t\t.on('mouseover', function (d, i) {\r\n\t\t\t\t\tsvg.selectAll('.layer').transition()\r\n\t\t\t\t\t\t.duration(250)\r\n\t\t\t\t\t\t.attr('opacity', function (d, j) {\r\n\t\t\t\t\t\t\treturn j !== i ? 0.2 : 1;\r\n\t\t\t\t\t\t});\r\n\t\t\t\t})\r\n\r\n\t\t\t\t// Move the label which appears next to the cursor.\r\n\t\t\t\t.on('mousemove', function (d, i) {\r\n\t\t\t\t\tvar mousePos = d3.mouse(this);\r\n\t\t\t\t\tvar mouseX = mousePos[0];\r\n\t\t\t\t\tvar mouseY = mousePos[1];\r\n\t\t\t\t\tvar mouseElem = document.getElementById('besideMouse');\r\n\t\t\t\t\tdocument.getElementById('besideMouse').style.left = mouseX + 50 + 'px';\r\n\t\t\t\t\tmouseElem.style.top = mouseY - 10 + 'px';\r\n\t\t\t\t\tmouseElem.innerHTML = d.key;\r\n\t\t\t\t})\r\n\t\t\t\r\n\t\t\t\t// Set opacity back to 1 when the cursor is no longer hovering over a stream.\r\n\t\t\t\t.on('mouseout', function (d, i) {\r\n\t\t\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t\t\t.transition()\r\n\t\t\t\t\t\t.duration(250)\r\n\t\t\t\t\t\t.attr('opacity', '1');\r\n\t\t\t\t\tdocument.getElementById('besideMouse').innerHTML = '';\r\n\t\t\t\t});\r\n\t\t});\r\n\t}","function draw() {\n\t\t\tdrawGrid();\n\t\t\tdrawLabels();\n\t\t\tfor(var i = 0; i < series.length; i++){\n\t\t\t\tdrawSeries(series[i]);\n\t\t\t}\n\t\t}","function drawChart() {\n\n // Create our data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ]);\n\n\n\t\t\t// Instantiate and draw our chart, passing in some options.\n\t\t\tvar chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n\t\t\tchart.draw(data, null);\n\t\t\t}","function drawChart() {\r\n\r\n // Create our data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Task');\r\n data.addColumn('number', 'Hours per Day');\r\n data.addRows([\r\n ['Work', 11],\r\n ['Eat', 2],\r\n ['Commute', 2],\r\n ['Watch TV', 2],\r\n ['Sleep', 7]\r\n ]);\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\r\n chart.draw(data, {width: 400, height: 240, is3D: true, title: 'My Daily Activities'});\r\n }","function drawChart() {\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(Object.entries(ar_chart));\n\n // Set chart options\n var options = {'title':'Percentage of file size',\n 'width':500,\n 'height':200};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function draw() {\n const data = getData();\n const svg = d3.select('body').append('svg');\n const plot = getPlotArea();\n const paddingGroup = chartUtils.setupSvgAndPaddingGroup(svg, plot);\n const scales = makeScales(data, plot);\n defineDashedLine(svg);\n appendYAxisDashedLines(paddingGroup, scales, plot);\n appendXAxis(paddingGroup, scales, plot);\n appendYAxis(paddingGroup, scales);\n appendBars(paddingGroup, data, scales, plot);\n appendScoreToday(paddingGroup, data, scales);\n appendScoreLastYear(paddingGroup, data, scales);\n appendChartTitle(svg, plot);\n appendYAxisTitle(svg, plot);\n appendFootnote(svg, plot);\n }","function DrawCtrChart()\n{\n // create/delete rows \n if (ctrTable.getNumberOfRows() < contDataPoints.length)\n { \n var numRows = contDataPoints.length - ctrTable.getNumberOfRows();\n ctrTable.addRows(numRows);\n } else {\n for(var i=(ctrTable.getNumberOfRows()-1); i > contDataPoints.length; i--)\n {\n ctrTable.removeRow(i); \n }\n }\n\n // Populate data table with time/cost data points. \n for(var i=0; i < ctrTable.getNumberOfRows(); i++)\n {\n ctrTable.setCell(i, 0, new Date(parseInt(contDataPoints[i].timestamp)));\n ctrTable.setCell(i, 1, (parseInt(contDataPoints[i].clicks)/parseInt(contDataPoints[i].impressions))*100);\n }\n\n // Draw line chart.\n chartOptions.title = 'Ctr Chart';\n ctrChart.draw(ctrView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = google.visualization.arrayToDataTable([\n ['Test Name', 'Passed', 'Failed', 'Skipped']\n ].concat(values));\n\n var options = {\n title: 'Last ' + values.length + ' Test Runs',\n legend: { position: 'bottom' },\n colors: ['green', 'red', 'yellow'],\n backgroundColor: bgColor,\n isStacked: true\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.SteppedAreaChart(document.getElementById('historyChart'));\n chart.draw(data, options);\n \n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Task');\n data.addColumn('number', '% of Time');\n data.addRows([\n ['Setup EEG', 30],\n ['Review EEG', 30],\n ['Troubleshoot Computer', 10],\n ['CME', 10],\n ['Other', 20]\n ]);\n\n // Set chart options\n var options = {'title':'Breakdown of Time at Work',\n 'width':300,\n 'height':300,\n is3D:true,\n 'backgroundColor': {fill:'transparent'}\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('work-chart'));\n chart.draw(data, options);\n }","function drawChart() {\n // define chart to be drawn using DataTable object\n const data = new google.visualization.DataTable();\n\n // add date & time column\n data.addColumn(\"string\", \"Date & Time\");\n\n // add other category columns such as co2\n columns.forEach(column => {\n // find full text in relevent option for the current column\n const fullColumnName = $(`#cmbCategories option[value='${column}']`).text();\n data.addColumn(\"number\", fullColumnName);\n });\n\n // add rows created beforehand\n data.addRows(rows);\n\n // chart options\n const options = {\n hAxis: {\n title: \"Date & Time\"\n },\n vAxis: {\n title: \"Values\"\n },\n width: \"100%\",\n height: 700,\n };\n\n // instantiate and draw the chart\n const chart = new google.visualization.LineChart(document.getElementById(\"outputChart\"));\n\n // after chart is completely loaded and rendered\n google.visualization.events.addListener(chart, \"ready\", function () {\n // enable view chart button\n $(\"#btnViewChart\").attr(\"disabled\", false);\n\n // hide loading spinner\n $(\"#imgLoading\").hide();\n });\n\n chart.draw(data, options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('number', 'Ordua');\n data.addColumn('number', 'Barruko tenperatura');\n data.addColumn('number', 'Kanpoko tenperatura');\n\n data.addRows([\n [10, 14, 6],\n [11, 17, 7],\n [12, 18, 7],\n [13, 20, 8],\n [14, 21, 8],\n [15, 21, 8],\n [16, 21, 9],\n [17, 21, 9],\n [18, 19, 8],\n [19, 18, 7],\n [20, 17, 6],\n\n\n ]);\n\n // Set chart options\n var options = {\n chart: {\n title: 'Etxeko tenperatura',\n subtitle: 'Gradu zentigradutan'\n },\n width: 900,\n height: 300\n };\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.charts.Line(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","draw() {\n const selector = this.selector;\n let gradient;\n if (this.angles.length !== 1) {\n gradient = this.angles.reduce(\n (acc, curr, index) =>\n acc +\n `${this.getColor(index)} ${curr}deg, ${this.getColor(\n index + 1\n )} ${curr}deg, `,\n ''\n );\n let tempGradient = gradient.split(', ');\n tempGradient = tempGradient.slice(0, tempGradient.length - 2);\n gradient = tempGradient.join(', ');\n }\n else {\n gradient = `${this.getColor(0)} 0deg, ${this.getColor(0)} 360deg`;\n }\n\n const chart = document.createElement('DIV');\n const title = document.createElement('H2');\n const chartGraph = document.createElement('DIV');\n const chartData = document.createElement('DIV');\n const chartPercents = document.createElement('P');\n\n chart.setAttribute('class', 'chart');\n title.setAttribute('class', 'chart__title');\n title.textContent = this.title;\n chartGraph.setAttribute('class', `chart__graph chart__${this.chartType}`);\n chartGraph.style.backgroundImage = `conic-gradient(${gradient})`;\n chartData.setAttribute('class', 'chart__data');\n chartPercents.setAttribute('class', 'chart__percents');\n\n this.percents.forEach((percent, index) => {\n const chartPercent = document.createElement('SPAN');\n const chartPiece = document.createElement('I');\n chartPercent.textContent = `${percent}%`;\n chartPercent.setAttribute('class', 'chart__percent');\n chartPiece.setAttribute('class', 'chart__piece');\n chartPiece.style.backgroundColor = this.getColor(index);\n chartPercent.appendChild(chartPiece);\n chartPercents.appendChild(chartPercent);\n });\n chartData.appendChild(chartPercents);\n\n this.data.forEach((data, index) => {\n const chartDataRow = document.createElement('P');\n const chartDataName = document.createElement('SPAN');\n const chartDataValue = document.createElement('SPAN');\n const chartPiece = document.createElement('I');\n chartDataRow.setAttribute('class', 'chart__dataRow');\n chartDataName.setAttribute('class', 'chart__dataName');\n chartDataValue.setAttribute('class', 'chart__dataValue');\n chartDataName.textContent = Object.keys(data)[0];\n chartDataValue.textContent = Object.values(data)[0];\n chartPiece.setAttribute('class', 'chart__piece');\n chartPiece.style.backgroundColor = this.getColor(index);\n chartDataValue.appendChild(chartPiece);\n chartDataRow.appendChild(chartDataName);\n chartDataRow.appendChild(chartDataValue);\n chartData.appendChild(chartDataRow);\n });\n\n chart.appendChild(title);\n chart.appendChild(chartGraph);\n chart.appendChild(chartData);\n chart.dataset.chartId = this.id;\n\n const existId = document.querySelector(`[data-chart-id=\"${this.id}\"]`);\n if(existId){\n existId.parentNode.replaceChild(chart, existId);\n }\n else\n { \n document.querySelector(selector).appendChild(chart);\n }\n }","function drawChart() \n {\n\n // Create our data table.\n var data = new google.visualization.DataTable();\n\n \t // Create and populate the data table.\n \t var yearData = google.visualization.arrayToDataTable(yearRowData);\n \t var yearTotalsData = google.visualization.arrayToDataTable(yearTotalsRowData);\n \t var monthData = google.visualization.arrayToDataTable(monthRowData);\n \t var monthTotalsData = google.visualization.arrayToDataTable(monthTotalsRowData);\n \t var weekData = google.visualization.arrayToDataTable(weekRowData);\n \t var weekTotalsData = google.visualization.arrayToDataTable(weekTotalsRowData);\n \t var dayData = google.visualization.arrayToDataTable(dayRowData);\n \t var dayTotalsData = google.visualization.arrayToDataTable(dayTotalsRowData);\n \n // Instantiate and draw our chart, passing in some options.\n \t var chartAreaSize = {width:\"90%\",height:\"80%\"};\n \t var dayChartAreaSize = {width:\"80%\",height:\"80%\"};\n \t var chartHeight = 300;\n \t var chartWidth = 710;\n \t var pieWidth = 370;\n \t var dayWidth = 400;\n \t var fontPxSize = 14;\n \t \n \t \n // day charts\n if(dayDataExist)\n {\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('dayPieChart'));\n\t pieChart.draw(dayTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('dayPieChart'));\n\t pieChart.draw(dayTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('dayStackChart'));\n\t \t columnChart.draw(dayData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('dayStackChart'));\n\t \t columnChart.draw(dayData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('dayBarChart'));\n\t \t columnChart.draw(dayData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('dayBarChart'));\n\t \t columnChart.draw(dayData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n }\n else\n {\n \t $('#dayPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 1 });\n \t $('#dayStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 1 });\n \t $('#dayBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 1 });\n }\n \n if(weekDataExist)\n {\n\t // weekCharts\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('weekPieChart'));\n\t pieChart.draw(weekTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('weekPieChart'));\n\t pieChart.draw(weekTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('weekStackChart'));\n\t \t columnChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('weekStackChart'));\n\t \t columnChart.draw(weekData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('weekBarChart'));\n\t \t columnChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('weekBarChart'));\n\t \t columnChart.draw(weekData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(weekRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('weekLineChart'));\n\t\t lineChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('weekLineChart'));\n\t\t lineChart.draw(weekData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('weekAreaChart'));\n\t\t \t areaChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('weekAreaChart'));\n\t\t \t areaChart.draw(weekData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t } \n\t }\n\t else\n\t {\n\t \t //$(\"#weekLineChart\").html('Chart Not Available');\n\t \t //$(\"#weekAreaChart\").html('Chart Not Available');\n\t \t $('#weekLineChartTab').hide();\n\t \t $( '#lineCharts' ).tabs({ selected: 1 });\n\t \t $('#weekAreaChartTab').hide();\n\t \t $( '#areaCharts' ).tabs({ selected: 1 });\n\t }\n }\n else\n {\n \t $('#weekPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 2 });\n \t $('#weekStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 2 });\n \t $('#weekBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 2 });\n \t $('#weekLineChartTab').hide();\n \t $( '#lineCharts' ).tabs({ selected: 1 });\n \t $('#weekAreaChartTab').hide();\n \t $( '#areaCharts' ).tabs({ selected: 1 });\n }\n \n if(monthDataExist)\n {\n\t // month charts\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('monthPieChart'));\n\t pieChart.draw(monthTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('monthPieChart'));\n\t pieChart.draw(monthTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('monthStackChart'));\n\t \t columnChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('monthStackChart'));\n\t \t columnChart.draw(monthData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('monthBarChart'));\n\t \t columnChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('monthBarChart'));\n\t \t columnChart.draw(monthData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(monthRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('monthLineChart'));\n\t\t lineChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('monthLineChart'));\n\t\t lineChart.draw(monthData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('monthAreaChart'));\n\t\t \t areaChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('monthAreaChart'));\n\t\t \t areaChart.draw(monthData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t }\n\t else\n\t {\n\t \t //$(\"#monthLineChart\").html('Chart Not Available');\n\t \t //$(\"#monthAreaChart\").html('Chart Not Available');\n\t \t $('#monthLineChartTab').hide();\n\t \t $( '#lineCharts' ).tabs({ selected: 2 });\n\t \t $('#monthAreaChartTab').hide();\n\t \t $( '#areaCharts' ).tabs({ selected: 2 });\n\t }\n }\n else\n {\n \t $('#monthPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 3 });\n \t $('#monthStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 3 });\n \t $('#monthBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 3 });\n \t $('#monthLineChartTab').hide();\n \t $( '#lineCharts' ).tabs({ selected: 2 });\n \t $('#monthAreaChartTab').hide();\n \t $( '#areaCharts' ).tabs({ selected: 2 });\n }\n \n if(yearDataExist)\n {\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('yearPieChart'));\n\t pieChart.draw(yearTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('yearPieChart'));\n\t pieChart.draw(yearTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('yearStackChart'));\n\t \t columnChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('yearStackChart'));\n\t \t columnChart.draw(yearData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('yearBarChart'));\n\t \t columnChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('yearBarChart'));\n\t \t columnChart.draw(yearData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(yearRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('yearLineChart'));\n\t\t lineChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('yearLineChart'));\n\t\t lineChart.draw(yearData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('yearAreaChart'));\n\t\t \t areaChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('yearAreaChart'));\n\t\t \t areaChart.draw(yearData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t }\n\t else\n\t {\n\t \t $(\"#yearLineChart\").html('Chart Not Available');\n\t \t $(\"#yearAreaChart\").html('Chart Not Available');\n\t }\n }\n else\n {\n \t $(\"#yearPieChart\").html('Chart Not Available');\n \t $(\"#yearStackChart\").html('Chart Not Available');\n \t $(\"#yearBarChart\").html('Chart Not Available');\n \t $(\"#yearLineChart\").html('Chart Not Available');\n \t $(\"#yearAreaChart\").html('Chart Not Available');\n }\n \n }","function draw(){\n\n drawGrid();\n var seriesIndex;\n\n if(!graph.hasData) {\n return;\n }\n\n if(graph.options.axes.x1.show){\n if(!graph.options.axes.x1.labels || graph.options.axes.x1.labels.length === 0) {\n seriesIndex = graph.options.axes.x1.seriesIndex;\n graph.options.axes.x1.labels= getXLabels(graph.allSeries[seriesIndex].series[0], graph.options.labelDateFormat);\n }\n drawXLabels(graph.options.axes.x1);\n }\n if(graph.options.axes.x2.show && graph.hasData){\n if (!graph.options.axes.x2.labels || graph.options.axes.x2.labels.length === 0) {\n seriesIndex = graph.options.axes.x2.seriesIndex;\n graph.options.axes.x2.labels = getXLabels(graph.allSeries[seriesIndex].series[0], graph.options.labelDateFormat);\n }\n drawXLabels(graph.options.axes.x2);\n }\n\n if (graph.options.axes.y1.show) {\n drawYLabels(graph.maxVals[graph.options.axes.y1.seriesIndex], graph.minVals[graph.options.axes.y1.seriesIndex], graph.options.axes.y1);\n }\n if (graph.options.axes.y2.show) {\n drawYLabels(graph.maxVals[graph.options.axes.y2.seriesIndex], graph.minVals[graph.options.axes.y2.seriesIndex], graph.options.axes.y2);\n }\n }","function DrawHDDChart()\n{\n // create/delete rows \n if (hddTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - hddTable.getNumberOfRows();\n hddTable.addRows(numRows);\n } else {\n for(var i=(hddTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n hddTable.removeRow(i); \n }\n }\n\n // Populate data table with time/hdd data points. \n for(var i=0; i < hddTable.getNumberOfRows(); i++)\n {\n hddTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n hddTable.setCell(i, 1, parseInt(aggrDataPoints[i].hdd));\n }\n\n // Draw line chart.\n chartOptions.title = 'HDD Usage (%)';\n hddChart.draw(hddView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['activos', 5],\n ['inactivos', 5.8],\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Estado de las alumnas',\n 'width': 450,\n 'height': 300\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart() {\n \n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n \n // Set chart options\n var options = {'title':'How Much Pizza I Ate Last Night'};\n \n // Instantiate and draw our chart, passing in some options.\n var piechart = new google.visualization.PieChart(elements.piechart);\n var linechart = new google.charts.Line(elements.linechart);\n var barchart = new google.charts.Bar(elements.barchart);\n piechart.draw(data, options);\n linechart.draw(data, options);\n barchart.draw(data,options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n\n // Set chart options\n var options = {'title':'How Much Pizza I Ate Last Night'};\n\n // Instantiate and draw our chart, passing in some options.\n var piechart = new google.visualization.PieChart(elements.piechart);\n var linechart = new google.charts.Line(elements.linechart);\n var barchart = new google.charts.Bar(elements.barchart);\n piechart.draw(data, options);\n linechart.draw(data, options);\n barchart.draw(data,options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n\n // Set chart options\n var options = {'title':'Global Share',\n 'width':300,\n 'height':200,\n 'is3D': true,};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n 'use strict';\n // Define the chart to be drawn.\n var data = new google.visualization.DataTable();\n var points = [\n ['Nitrogen', 0.3],\n ['Oxygen', 0.21],\n ['Other', 0.01]\n ];\n addData(data, points); // by reference\n var chart = new google.visualization.PieChart(document.getElementById('chart_id'));\n chart.draw(data, null);\n }","function drawChart4() {\n\n // Create the data table.\n var data4 = new google.visualization.DataTable();\n data4.addColumn('string', 'nombre');\n data4.addColumn('number', 'cantidad');\n data4.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de pruebas por escuela sede: '+escuela,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data4, options1);\n\n }","function renderChart() {\n let datasets = [];\n\n if (funcionPoints.length > 0) {\n datasets.push({\n label: funcion,\n data: funcionPoints,\n borderColor: \"purple\",\n borderWidth: 2,\n fill: false,\n showLine: true,\n pointBackgroundColor: \"purple\",\n radius: 0,\n });\n } else {\n alert(\"No hay puntos para la funcion.\");\n }\n\n if (areaPoints.length > 0) {\n datasets.push({\n label: \"Area\",\n data: areaPoints,\n borderColor: \"blue\",\n borderWidth: 2,\n fill: true,\n showLine: true,\n pointBackgroundColor: \"blue\",\n tension: 0,\n radius: 0,\n });\n } else {\n alert(\"No hay puntos para el area.\");\n }\n\n if (insidePoints.length > 0) {\n datasets.push({\n label: \"Punto aleatorio por debajo de la función\",\n data: insidePoints,\n borderColor: \"green\",\n borderWidth: 2,\n fill: false,\n showLine: false,\n pointBackgroundColor: \"green\",\n });\n } else {\n alert(\"No hay puntos aleatorios.\");\n }\n\n if (outsidePoints.length > 0) {\n datasets.push({\n label: \"Punto aleatorio por arriba de la función\",\n data: outsidePoints,\n borderColor: \"red\",\n borderWidth: 2,\n fill: false,\n showLine: false,\n pointBackgroundColor: \"red\",\n });\n } else {\n alert(\"No hay puntos aleatorios.\");\n }\n\n data = { datasets };\n\n if (chart) {\n chart.data = data;\n chart.update();\n }\n }","function draw() {\n\n var isGridDrawn = false;\n\n if(graph.options.errorMessage) {\n var $errorMsg = $('' + graph.options.errorMessage + '')\n .addClass('alert box');\n\n graph.$el.find('.paper').prepend($errorMsg);\n }\n\n if(!graph.allSeries.length) {\n elroi.fn.grid(graph).draw();\n }\n\n $(graph.allSeries).each(function(i) {\n\n if(!isGridDrawn && graph.seriesOptions[i].type != 'pie') {\n elroi.fn.grid(graph).draw();\n isGridDrawn = true;\n }\n\n var type = graph.seriesOptions[i].type;\n elroi.fn[type](graph, graph.allSeries[i].series, i).draw();\n\n });\n\n }","function drawChart1() {\n\n // Create the data table.\n var data1 = new google.visualization.DataTable();\n data1.addColumn('string', 'nombre');\n data1.addColumn('number', 'cantidad');\n data1.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por escuela',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data1, options1);\n\n }","draw() {\n this._updateWidthHeight();\n\n this.initSvg();\n // bar char\n if (this.keysBar) {\n this.aggregateLabelsByKeys(this.selection, this.keysBar);\n }\n\n if (this.keysX && this.keysY) {\n this.aggregateValuesByKeys(this.selection, this.keysX, this.keysY);\n }\n\n this.barChart.draw();\n // scatterplot\n // this.scatter.draw();\n }","function drawChart() {\n var data = google.visualization.arrayToDataTable([\n ['', 'Hours per Day'],\n ['', 8],\n ['', 2],\n ['', 4],\n ['', 2],\n ['', 8]\n ]);\n \n var options = { legend: 'none','width':50, 'height':40};\n \n // var chart = new google.visualization.PieChart(document.getElementById('piechart'));\n // chart.draw(data,options);\n }","function makeCharts() {\n issueChart();\n countChart();\n averageChart();\n}","function drawChart() {\n\n // Create the data table.\n var data = google.visualization.arrayToDataTable([\n ['Scenario Name', 'Duration', {role: 'style'}]\n ].concat(values));\n\n var options = {\n title: 'Scenario Results',\n legend: { position: 'none' },\n vAxis: { title: 'Duration (seconds)'},\n backgroundColor: bgColor\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById('resultChart'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n // Crea la grafica a partir de la tabla\n var data = google.visualization.arrayToDataTable([\n ['Actividades', 'Actividades Esperadas', 'Actividades Presentes'],\n ['1', 33, 40],\n ['2', 117, 96],\n ['3', 166, 210],\n ['4', 117, 66],\n ['5', 66, 21],\n ['6', 33, 40],\n ['7', 117, 96],\n ['8', 150, 190],\n ['9', 103, 50],\n ['10', 200, 210]\n ]);\n\n // Opciones de la grafica\n var options = {\n chart: {\n title: 'Porcentaje de avance',\n subtitle: 'Cantidad',\n },\n bars: 'vertical',\n vAxis: {\n format: 'decimal'\n },\n height: 400,\n width: 1000,\n colors: ['#ffac19', '#63a537']\n };\n\n // Instancia de la grafica a nivel del html para dibujarla\n var chart = new google.charts.Bar(document.getElementById('chart_div'));\n chart.draw(data, google.charts.Bar.convertOptions(options));\n }","function drawChart() {\n\t\t// get the data from the table\n\t\t$(\".pie-chartify\").each( function(i,e){\n\t\t\tvar id = \"chart-\" + i,\n\t\t\t\tdt = dataTableFromTable( e ),\n\t\t\t\topt = {\n\t\t\t\t\t'pieSliceText': 'none',\n\t\t\t\t\t'tooltip': {\n\t\t\t\t\t\t'text': 'percentage'\n\t\t\t\t\t},\n\t\t\t\t\t'chartArea': {\n\t\t\t\t\t'width': '90%',\n\t\t\t\t\t\t'height': '90%'\n\t\t\t\t\t},\n\t\t\t\t\t'width': 600,\n\t\t\t\t\t'height': 400,\n\t\t\t\t\t'legend': {\n\t\t\t\t\t\tposition: 'labeled'\n\t\t\t\t\t},\n\t\t\t\t\t'fontName': 'Helvetica',\n\t\t\t\t\t'fontSize': 14,\n\t\t\t\t\t\"is3D\": true\n\t\t\t\t},\n\t\t\t\tc;\n\t\t\t$(this).after(\"\");\n\n\t\t\tc = new google.visualization.PieChart(\n\t\t\t\tdocument.getElementById(id)\n\t\t\t);\n\t\t\tc.draw(dt, opt);\n\t\t});\n\t}","function drawChart(pItemSel, pItemHeight, pConfigData, pValuesData, pDefaultConfig) {\n\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"pItemSel\": pItemSel,\n \"pItemHeight\": pItemHeight,\n \"pConfigData\": pConfigData,\n \"pValuesData\": pValuesData,\n \"pDefaultConfig\": pDefaultConfig,\n \"featureDetails\": util.featureDetails\n });\n\n var aTypeCharts = [\"pie\", \"donut\", \"gauge\"];\n var isGauge = false;\n var isPie = false;\n var isDonut = false;\n var specialStr = \"\\u200b\";\n\n // sort pValuesData by Time\n function sortArrByTime(pArr, pFormat) {\n\n function customeSort(pFirstValue, pSecondValue) {\n var parseTime = d3.timeParse(pFormat);\n var fD = parseTime(pFirstValue.x);\n var sD = parseTime(pSecondValue.x);\n return new Date(fD).getTime() - new Date(sD).getTime();\n }\n\n try {\n return pArr.sort(customeSort);\n }\n catch (e) {\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while try sort JSON Array by Time Value\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n }\n\n /* search link from data and set window.location.href */\n function executeLink(pData) {\n var key = specialStr + unescape(pData.id);\n var index = pData.index;\n\n if (seriesData[key]) {\n var seriesObj = seriesData[key];\n if (seriesObj.length === 1) {\n index = 0\n }\n\n if (seriesData[key][index] && seriesData[key][index].link) {\n util.link(seriesData[key][index].link);\n }\n }\n }\n\n try {\n var ownTooltip = false;\n\n var chartTitle = setObjectParameter(pConfigData.chartTitle, pDefaultConfig.d3chart.chartTitle || \"\").toString();\n var background = setObjectParameter(pConfigData.background, pDefaultConfig.d3chart.background);\n var backJSON = null;\n\n if (util.isDefinedAndNotNull(background)) {\n backJSON = {\n color: background\n };\n }\n\n /* line */\n var lineStep = setObjectParameter(pConfigData.lineStep, pDefaultConfig.d3chart.line.step);\n\n /* gauge */\n var gaugeMin = setObjectParameter(pConfigData.gaugeMin, pDefaultConfig.d3chart.gauge.min);\n var gaugeMax = setObjectParameter(pConfigData.gaugeMax, pDefaultConfig.d3chart.gauge.max);\n var gaugeType = setObjectParameter(pConfigData.gaugeType, pDefaultConfig.d3chart.gauge.type);\n var gaugeWidth = setObjectParameter(pConfigData.gaugeWidth, pDefaultConfig.d3chart.gauge.width);\n var gaugeArcMinWidth = setObjectParameter(pConfigData.gaugeArcMinWidth, pDefaultConfig.d3chart.gauge.arcMinWidth);\n var gaugeFullCircle = setObjectParameter(pConfigData.gaugeFullCircle, pDefaultConfig.d3chart.gauge.fullCircle, true);\n var gaugeTitle = setObjectParameter(pConfigData.gaugeTitle, pDefaultConfig.d3chart.gauge.title || \"\").toString();\n\n /* Grid */\n var gridX = setObjectParameter(pConfigData.gridX, pDefaultConfig.d3chart.grid.x, true);\n var gridY = setObjectParameter(pConfigData.gridY, pDefaultConfig.d3chart.grid.y, true);\n\n /* heights */\n var heightXAxis = setObjectParameter(pConfigData.xAxisHeight, pDefaultConfig.d3chart.x.axisHeight);\n\n /* Legend */\n var legendShow = setObjectParameter(pConfigData.legendShow, pDefaultConfig.d3chart.legend.show, true);\n var legendPosition = setObjectParameter(pConfigData.legendPosition, pDefaultConfig.d3chart.legend.position);\n\n /* padding */\n var chartPadding = util.jsonSaveExtend(null, pDefaultConfig.d3chart.padding);\n\n if (util.isDefinedAndNotNull(pConfigData.paddingBottom)) {\n chartPadding.bottom = pConfigData.paddingBottom;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingLeft)) {\n chartPadding.left = pConfigData.paddingLeft;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingRight)) {\n chartPadding.right = pConfigData.paddingRight;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingTop)) {\n chartPadding.top = pConfigData.paddingTop;\n }\n\n /* Axis */\n var rotateAxis = setObjectParameter(pConfigData.rotateAxis, pDefaultConfig.d3chart.rotateAxis, true);\n var axisLabelPosition = setObjectParameter(pConfigData.axisLabelPosition, pDefaultConfig.d3chart.axisLabelPosition);\n\n var xAxisLabelPosition = null;\n var yAxisLabelPosition = null;\n\n switch (axisLabelPosition) {\n case \"inner1\":\n xAxisLabelPosition = \"inner-left\";\n yAxisLabelPosition = \"inner-bottom\";\n break;\n case \"inner2\":\n xAxisLabelPosition = \"inner-center\";\n yAxisLabelPosition = \"inner-middle\";\n break;\n case \"inner3\":\n xAxisLabelPosition = \"inner-right\";\n yAxisLabelPosition = \"inner-top\";\n break;\n case \"outer1\":\n xAxisLabelPosition = \"outer-left\";\n yAxisLabelPosition = \"outer-bottom\";\n break;\n case \"outer2\":\n xAxisLabelPosition = \"outer-center\";\n yAxisLabelPosition = \"outer-middle\";\n break;\n case \"outer3\":\n xAxisLabelPosition = \"outer-right\";\n yAxisLabelPosition = \"outer-top\";\n break;\n default:\n break;\n }\n\n if (rotateAxis) {\n var xAxisLabelPositionTmp = xAxisLabelPosition;\n xAxisLabelPosition = yAxisLabelPosition;\n yAxisLabelPosition = xAxisLabelPositionTmp;\n }\n\n /* tooltip */\n var tooltipShow = setObjectParameter(pConfigData.tooltipShow, pDefaultConfig.d3chart.tooltip.show, true);\n var tooltipGrouped = setObjectParameter(pConfigData.tooltipGrouped, pDefaultConfig.d3chart.tooltip.grouped, true);\n\n /* Transition duration */\n var transitionDuration = setObjectParameter(pConfigData.transitionDuration || pDefaultConfig.d3chart.transitionDuration);\n\n /* x Axis */\n var xShow = setObjectParameter(pConfigData.xShow, pDefaultConfig.d3chart.x.show, true);\n var xLabel = setObjectParameter(pConfigData.xLabel, pDefaultConfig.d3chart.x.label || \"\").toString();\n var xType = setObjectParameter(pConfigData.xType, pDefaultConfig.d3chart.x.type);\n var xAxisTimeFormat = null;\n var xName = null;\n\n /* x ticks */\n var xTickCutAfter = setObjectParameter(pConfigData.xTickCutAfter, pDefaultConfig.d3chart.x.tick.cutAfter);\n var xTickMaxNumber = setObjectParameter(pConfigData.xTickMaxNumber, pDefaultConfig.d3chart.x.tick.maxNumber);\n var xTickRotation = setObjectParameter(pConfigData.xTickRotation, pDefaultConfig.d3chart.x.tick.rotation);\n var xTickMultiline = setObjectParameter(pConfigData.xTickMultiline, pDefaultConfig.d3chart.x.tick.multiline, true);\n var xTickFit = setObjectParameter(pConfigData.xTickFit, pDefaultConfig.d3chart.x.tick.fit, true);\n var xTickAutoRotate = setObjectParameter(pConfigData.xTickAutoRotate, pDefaultConfig.d3chart.x.tick.autoRotate, true);\n var xTickTimeFormat = null;\n\n if (xType == \"category\" || xType == \"timeseries\") {\n xName = \"x\";\n }\n\n if (xType == \"timeseries\") {\n xAxisTimeFormat = setObjectParameter(pConfigData.xTimeFormat, pDefaultConfig.d3chart.x.timeFormat);\n xTickTimeFormat = setObjectParameter(pConfigData.xTickTimeFormat, pDefaultConfig.d3chart.x.tick.timeFormat);\n // sort data because of tooltip index\n sortArrByTime(pValuesData, xAxisTimeFormat);\n }\n\n /* cut string if category names are to long */\n if (xType == \"category\") {\n xTickTimeFormat = function (index, categoryName) {\n return util.cutString(categoryName, xTickCutAfter);\n };\n }\n\n /* y Axis */\n var yLabel = setObjectParameter(pConfigData.yLabel, pDefaultConfig.d3chart.y.label || \"\").toString();\n var yLog = setObjectParameter(pConfigData.yLog, pDefaultConfig.d3chart.y.log, true);\n var yType = null;\n if (yLog) {\n yType = \"log\";\n }\n var yMin = pConfigData.yMin || pDefaultConfig.d3chart.y.min;\n var yMax = pConfigData.yMax || pDefaultConfig.d3chart.y.max;\n var yCulling = pConfigData.yTickMaxNumber || pDefaultConfig.d3chart.y.tick.maxNumber;\n var yUnit = pConfigData.yUnit || pDefaultConfig.d3chart.y.unit;\n\n /* y2 Axis */\n var y2Show = false;\n var y2Label = setObjectParameter(pConfigData.y2Label, pDefaultConfig.d3chart.y2.label || \"\").toString();\n var y2Log = setObjectParameter(pConfigData.y2Log, pDefaultConfig.d3chart.y2.log, true);\n var y2Type = null;\n if (y2Log) {\n y2Type = \"log\";\n }\n var y2Min = setObjectParameter(pConfigData.y2Min, pDefaultConfig.d3chart.y2.min);\n var y2Max = setObjectParameter(pConfigData.y2Max, pDefaultConfig.d3chart.y2.max);\n var y2Culling = setObjectParameter(pConfigData.y2TickMaxNumber, pDefaultConfig.d3chart.y2.tick.maxNumber);\n var y2Unit = setObjectParameter(pConfigData.y2Unit, pDefaultConfig.d3chart.y2.unit);\n\n /* Zoom and Subchart */\n var zoomEnabled = setObjectParameter(pConfigData.zoomEnabled, pDefaultConfig.d3chart.zoom.enabled, true);\n var zoomType = setObjectParameter(pConfigData.zoomType, pDefaultConfig.d3chart.zoom.type);\n var showSubChart = false;\n\n if (zoomEnabled) {\n if (zoomType == \"scroll\") {\n showSubChart = false;\n } else if (zoomType == \"subchart\") {\n showSubChart = true;\n zoomEnabled = false;\n } else if (zoomType == \"drag\") {\n zoomEnabled = true;\n showSubChart = false;\n }\n } else {\n showSubChart = false;\n }\n\n var zoomRescale = setObjectParameter(pConfigData.zoomRescale, pDefaultConfig.d3chart.zoom.rescale, true);\n\n /* Prepare Data for Render */\n var dataArr = [];\n var categoriesArr = [];\n var groupsArr = [];\n var colorsJSON = {};\n var typesJSON = {};\n var axesJSON = {};\n var namesJSON = {};\n var groupJSON = {};\n var seriesCnt = 0;\n var seriesData = util.groupObjectArray(pValuesData, 'seriesID');\n\n if (seriesData) {\n /* Add Categories or time values to x Axis when correct type is set */\n if (xType == \"category\" || xType == \"timeseries\") {\n categoriesArr.push(\"x\");\n var xCatObj = util.groupObjectArray(pValuesData, \"x\");\n var xCatArr = Object.keys(xCatObj);\n\n $.each(xCatArr, function (dIdx, dataValues) {\n categoriesArr.push((setObjectParameter(dataValues.replace(specialStr, \"\"), null)));\n });\n }\n\n dataArr.push(categoriesArr);\n\n /* Transform data for billboard.js */\n $.each(seriesData, function (idx, seriesData) {\n var series;\n seriesCnt++;\n if (seriesData[0] && seriesData[0].seriesID) {\n series = seriesData[0];\n var dataKey = escape(series.seriesID);\n colorsJSON[dataKey] = series.color;\n typesJSON[dataKey] = series.type;\n\n /* check if atypechart*/\n if (aTypeCharts.indexOf(series.type) >= 0) {\n zoomEnabled = false;\n }\n\n if (series.type === \"gauge\") {\n isGauge = true;\n }\n\n if (series.type === \"pie\") {\n isPie = true;\n }\n\n if (series.type === \"donut\") {\n isDonut = true;\n }\n\n if (util.isDefinedAndNotNull(series.tooltip)) {\n ownTooltip = true;\n }\n\n axesJSON[dataKey] = (series.yAxis || \"y\");\n if (util.isDefinedAndNotNull(series.groupID)) {\n var groupID = escape(series.groupID.toString());\n if (groupJSON[groupID]) {\n groupJSON[groupID].push(dataKey);\n } else {\n groupJSON[groupID] = [];\n groupJSON[groupID].push(dataKey);\n }\n }\n\n if (series.yAxis == \"y2\") {\n y2Show = true;\n }\n namesJSON[dataKey] = (setObjectParameter(series.label, dataKey));\n\n var arr = [];\n arr.push(dataKey);\n if (xType == \"category\" || xType == \"timeseries\") {\n $.each(xCatObj, function (dIdx, dataValues) {\n var setValueY = null;\n var setValueZ = null;\n $.each(dataValues, function (sIDx, sDataValues) {\n if (escape(sDataValues.seriesID) == dataKey) {\n setValueY = sDataValues.y;\n if (sDataValues.z) {\n setValueZ = sDataValues.z;\n }\n }\n });\n if (setValueZ !== null) {\n arr.push({\n \"y\": setValueY,\n \"z\": setValueZ\n });\n } else {\n arr.push(setValueY);\n }\n });\n } else {\n $.each(seriesData, function (dIdx, dataValues) {\n var setValueY = setObjectParameter(dataValues.y, null);\n if (dataValues.z) {\n var setValueZ = dataValues.z;\n arr.push({\n \"y\": setValueY,\n \"z\": setValueZ\n });\n } else {\n arr.push(setValueY);\n }\n });\n }\n\n dataArr.push(arr);\n\n } else {\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"No seriesID found in seriesID Cursor\",\n \"featureDetails\": util.featureDetails\n });\n }\n\n });\n\n /* Group JSON to Array */\n $.each(groupJSON, function (dIdx, jsonObj) {\n groupsArr.push(jsonObj);\n });\n\n /* Labels and Datapoints */\n var dataLabels = setObjectParameter(pConfigData.showDataLabels, pDefaultConfig.d3chart.showDataLabels, true);\n\n if (isPie || isDonut) {\n dataLabels = {\n colors: \"white\"\n };\n } else if (isGauge) {\n dataLabels = {\n colors: (gaugeType === \"single\" && seriesCnt > 1) ? \"white\" : \"inherit\"\n };\n }\n var showDataPoints = setObjectParameter(pConfigData.showDataPoints, pDefaultConfig.d3chart.showDataPoints, true);\n\n var showAbsoluteValues = setObjectParameter(pConfigData.showAbsoluteValues, pDefaultConfig.d3chart.showAbsoluteValues);\n var absoluteFormatting;\n\n if (showAbsoluteValues) {\n absoluteFormatting = function (value, ratio, id) {\n return value + yUnit;\n }\n }\n\n var ttContent;\n if (ownTooltip) {\n ttContent = function (d) {\n var div = $(\"\");\n div.addClass(\"bb-tooltip\");\n div.addClass(\"bida-chart-tooltip-custome\");\n $.each(d, function (i, pData) {\n var key = specialStr + unescape(pData.id);\n var index = pData.index;\n\n if (seriesData[key]) {\n var seriesObj = seriesData[key];\n if (seriesObj.length === 1) {\n index = 0\n }\n if (seriesData[key][index] && util.isDefinedAndNotNull(seriesData[key][index].tooltip)) {\n var ttS = seriesData[key][index].tooltip;\n if (pRequireHTMLEscape !== false) {\n ttS = util.escapeHTML(ttS);\n }\n div.append(ttS);\n div.append(\"
\");\n }\n }\n });\n return div[0].outerHTML;\n }\n }\n\n try {\n var chartContIDSel = pItemSel + \"bbc\";\n var chartContID = chartContIDSel.replace(\"#\", \"\");\n var chartCont = $(\"\");\n chartCont.attr(\"id\", chartContID);\n\n $(pItemSel).append(chartCont);\n\n var bbData = {\n bindto: chartContIDSel,\n background: backJSON,\n title: {\n text: chartTitle\n },\n size: {\n height: pItemHeight\n },\n data: {\n x: xName,\n xFormat: xAxisTimeFormat,\n columns: dataArr,\n types: typesJSON,\n groups: groupsArr,\n colors: colorsJSON,\n labels: dataLabels,\n axes: axesJSON,\n names: namesJSON,\n onclick: function (pData) {\n executeLink(pData);\n }\n },\n pie: {\n label: {\n format: absoluteFormatting,\n threshold: 0.05\n }\n },\n donut: {\n label: {\n format: absoluteFormatting,\n threshold: 0.05\n }\n },\n line: {\n step: {\n type: lineStep\n }\n },\n gauge: {\n label: {\n format: absoluteFormatting,\n threshold: (gaugeType === \"single\") ? 0.05 : null\n },\n fullCircle: gaugeFullCircle,\n min: gaugeMin,\n max: gaugeMax,\n type: gaugeType,\n width: gaugeWidth,\n title: gaugeTitle,\n arc: {\n minWidth: gaugeArcMinWidth\n }\n },\n radar: {\n direction: {\n clockwise: true\n }\n },\n subchart: {\n show: showSubChart\n },\n zoom: {\n type: zoomType,\n enabled: zoomEnabled,\n rescale: zoomRescale\n },\n transition: {\n duration: transitionDuration\n },\n legend: {\n show: legendShow,\n position: legendPosition\n },\n tooltip: {\n show: tooltipShow,\n grouped: tooltipGrouped,\n contents: ttContent\n },\n grid: {\n x: {\n show: gridX,\n },\n y: {\n show: gridY\n }\n },\n point: {\n show: showDataPoints\n },\n axis: {\n rotated: rotateAxis,\n x: {\n show: xShow,\n label: {\n text: xLabel,\n position: xAxisLabelPosition\n },\n type: xType,\n tick: {\n culling: {\n max: xTickMaxNumber\n },\n autorotate: xTickAutoRotate,\n rotate: xTickRotation,\n multiline: xTickMultiline,\n format: xTickTimeFormat,\n fit: xTickFit\n },\n height: heightXAxis\n },\n y: {\n label: {\n text: yLabel,\n position: yAxisLabelPosition\n },\n type: yType,\n max: yMax,\n min: yMin,\n tick: {\n culling: {\n max: yCulling\n },\n format: function (d) {\n return d + yUnit\n }\n }\n },\n y2: {\n show: y2Show,\n label: {\n text: y2Label,\n position: yAxisLabelPosition\n },\n type: y2Type,\n max: y2Max,\n min: y2Min,\n tick: {\n culling: {\n max: y2Culling\n },\n format: function (d) {\n return d + y2Unit\n }\n }\n }\n },\n padding: chartPadding\n };\n\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"finalChartData\": bbData,\n \"featureDetails\": util.featureDetails\n });\n\n var chart = bb.generate(bbData);\n\n /* reset zoom on right click */\n if (zoomEnabled) {\n $(chartContIDSel).contextmenu(function (evt) {\n evt.preventDefault();\n chart.unzoom();\n });\n }\n\n /* execute resize */\n function resize() {\n if (!document.hidden && chartCont.is(\":visible\")) {\n chart.resize({\n height: pItemHeight\n });\n }\n }\n\n // bind resize events\n $(window).resize(function () {\n resize();\n });\n\n /* dirty workaround because in APEX sometimes chart renders in wrong size hope apexDev Team will bring us layout change events also for tabs, collapsible so on */\n function stopResizeWA() {\n if (timers.innerItemsIntervals && timers.innerItemsIntervals[pItemSel]) {\n clearInterval(timers.innerItemsIntervals[pItemSel]);\n }\n }\n\n function startResizeWA() {\n timers.innerItemsIntervals[pItemSel] = setInterval(function () {\n if ($(pItemSel).length === 0) {\n clearInterval(timers.innerItemsIntervals[pItemSel]);\n } else {\n if (chartCont.is(\":visible\")) {\n if (!util.isBetween(chartCont.width(), chartCont.find(\"svg\").width(), resizeRange)) {\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Chart has resize problem\",\n \"featureDetails\": util.featureDetails\n });\n resize();\n }\n\n }\n }\n }, timers.defTime);\n }\n\n stopResizeWA();\n startResizeWA();\n\n /* stop when tab is not active */\n document.addEventListener(\"visibilitychange\", function () {\n if (document.hidden) {\n stopResizeWA();\n } else {\n startResizeWA();\n }\n });\n\n } catch (e) {\n $(pItemSel).empty();\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while try to render chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n } else {\n util.noDataMessage.show(pItemSel, pDefaultConfig.noDataMessage);\n }\n } catch (e) {\n $(pItemSel).empty();\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while prepare data for chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n }","function drawChart4() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'InstallationDate');\n data.addColumn('number', 'Number of Meters');\n data.addRows(installationsPerDate());\n\n // Set chart options\n var options = {\n 'title': 'Installations Per Date',\n 'width': 250,\n 'height': 200,\n };\n\n // Instantiate and draw our chart, passing in some options.\n // var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n var chart = new google.visualization.PieChart(document.getElementById('chart_div4'));\n chart.draw(data, options);\n}","drawCanvas(arrData) {\n const W = +this.elements.$tags.contentWrap.getBoundingClientRect().width;\n const H = +this.panel.svgHeight;\n const dateFrom = this.range.from.clone();\n const dateTo = this.range.to.clone();\n\n // область визуализации с данными (график)\n const margin = this.elements.sizes.marginAreaVis;\n const widthAreaVis = W - margin.left - margin.right;\n const heightAreaVis = H - margin.top - margin.bottom;\n const heightRowBar = parseInt(heightAreaVis / arrData.length, 10);\n\n const xScaleDuration = d3.scaleTime()\n .domain([0, new Date(dateTo).getTime() - new Date(dateFrom).getTime()])\n .range([0, widthAreaVis]);\n\n const xScaleTime = d3.scaleTime()\n .domain([new Date(dateFrom).getTime(), new Date(dateTo).getTime()])\n .range([0, widthAreaVis]);\n\n const canvasElement = d3.select(document.createElement('canvas'))\n .datum(arrData) // data binding\n .attr('width', widthAreaVis)\n .attr('height', heightAreaVis);\n\n const context = canvasElement.node().getContext('2d');\n\n // clear canvas\n context.fillStyle = 'rgba(0,0,0, 0)';\n context.rect(0, 0, canvasElement.attr('width'), canvasElement.attr('height'));\n context.fill();\n\n let top = 0;\n const sizeDiv = 1; // dividing line\n\n _.forEach(arrData, (changes, i, arr) => {\n _.forEach(changes, (d) => {\n context.beginPath();\n context.fillStyle = d.color;\n context.rect(\n xScaleTime(d.start) < 0 ? 0 : xScaleTime(d.start),\n top, xScaleDuration(d.ms),\n arr.length - 1 !== i ? heightRowBar - sizeDiv : heightRowBar,\n );\n context.fill();\n context.closePath();\n });\n\n top += heightRowBar;\n });\n return canvasElement.node();\n }","function drawChart() {\r\n\r\n // Create the data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Country');\r\n data.addColumn('number', 'Population');\r\n data.addColumn('number', 'Area');\r\n data.addColumn('number', 'Occupancy');\r\n data.addRows([\r\n [cdata.name, cdata.population,cdata.area,(cdata.area/cdata.population)]\r\n \r\n \r\n ]);\r\n\r\n // Set chart options\r\n var options = {'title':'Population Area Ratio of '+cdata.name,\r\n 'width':250,\r\n 'height':300};\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.BarChart(document.getElementById('bc1'));\r\n chart.draw(data, options);\r\n }","function drawChart() {\n const canvas = document.createElement('canvas');\n let data = [];\n let min = Infinity;\n let max = 0;\n for (let i = 0; i < TIMINGS.length; i++) {\n let series = TIMINGS[i];\n min = Math.min(min, Math.min(...series));\n max = Math.max(max, Math.max(...series));\n }\n\n for (let i = 0; i < TIMINGS.length; i++) {\n let series = TIMINGS[i];\n data.push({\n data: bellCurvify(series, min, max),\n label: getFileName(PATHS[i]),\n\n borderColor: COLORS[i % COLORS.length],\n fill: false\n });\n }\n const context = canvas.getContext('2d');\n let labels = [];\n for (let i = min; i <= max; i++) {\n labels.push('' + i);\n }\n document.body.appendChild(canvas);\n new Chart(context, {\n type: 'line',\n data: {\n labels: labels,\n datasets: data\n },\n options: {}\n });\n}","function drawChart() {\n ctx.beginPath();\n ctx.strokeStyle = \"blue\";\n var firstElement = true;\n ctx.font = \"10px sans-serif\";\n //plot each entry if it is in the range\n for (let entry of entries) {\n //check if entry is in the range of xmin and xmax, otherwise ignore it\n if (entry.date > xMin && entry.date < xMax) {\n //calculate location of pace coordinate\n let m = entry.getMin();\n let s = entry.getSec();\n let paceLocation = (m * 4) + (s / 15);\n\n //calculate location of date coordinate\n //plan - we have 60 blocks of usable space, can get date in ms with getTime()\n //range=xmax-min\n //value=date-xmin\n //value=value*60blocks\n let xRange = xMax.getTime() - xMin.getTime();\n let dateLocation = (entry.date.getTime() - xMin.getTime());\n dateLocation = ((dateLocation / xRange) * 60) + 5;//add 5 for axis offset\n ctx.strokeText(m + \":\" + s + \" \", blocks(dateLocation), blocks(40 - paceLocation - 1));\n \n //start at this first element\n if (firstElement) { ctx.moveTo(blocks(dateLocation), blocks(40 - paceLocation)); }\n\n //connect remaining data points\n ctx.lineTo(blocks(dateLocation), blocks(40 - paceLocation));\n ctx.arc(blocks(dateLocation), blocks(40 - paceLocation), 2, 0, Math.PI * 2, true);\n firstElement = false;\n }\n }\n ctx.font = \"12px sans-serif\";\n ctx.stroke();\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Color');\n data.addColumn('number', 'Ranking');\n\n data.addRows(graphData);\n\n // Set chart options\n var options = {\n title: 'T-Shirt Rankings',\n height: 600,\n legend: {position: 'none'},\n vAxis: {format:'#'}\n };\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n\n\t// Create the data table.\n\tvar data = new google.visualization.DataTable();\n\tdata.addColumn('string', 'Topping');\n\tdata.addColumn('number', 'Amt In Dollars');\n\tdata.addRows([\n\t [names.name1, values.expenseNameOne],\n\t [names.name2, values.expenseNameTwo],\n\t [names.name3, values.expenseNameThree],\n\t [names.name4, values.expenseNameFour],\n\t [names.name5, values.expenseNameFive]\n\t]);\n\n\t// Set chart options\n\tvar options = {'title':'MY EXPENSES',\n\t\t\t\t 'width':800,\n\t\t\t\t 'height':500};\n\n\t// Instantiate and draw our chart, passing in some options.\n\tvar chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n\tchart.draw(data, options);\n }","function drawChart() {\r\n\r\n // Create the data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Country');\r\n data.addColumn('number', 'Population');\r\n data.addColumn('number', 'Area');\r\n data.addColumn('number', 'Occupancy');\r\n data.addRows([\r\n [countrydata.name, countrydata.population,countrydata.area,(countrydata.area/countrydata.population)]\r\n \r\n \r\n ]);\r\n\r\n // Set chart options\r\n var options = {'title':'Population Area Ratio of '+countrydata.name,\r\n 'width':250,\r\n 'height':300};\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.ColumnChart(document.getElementById('bc2'));\r\n chart.draw(data, options);\r\n }","function drawChart1() {\n\n // Create the data table.\n var data1 = new google.visualization.DataTable();\n data1.addColumn('string', 'nombre');\n data1.addColumn('number', 'cantidad');\n data1.addRows(render);\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por escuela sede: '+sede,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data1, options1);\n\n }","function drawChart(x1, y1, x2, y2, x3, y3) {\n var data1 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x1],\n ['Absent', y1],\n ]);\n var data2 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x2],\n ['Absent', y2],\n ]);\n var data3 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x3],\n ['Absent', y3],\n ]);\n\n // Display the chart inside the element with id=\"piechart\"\n var chart1 = new google.visualization.PieChart(document.getElementById('piechart1'));\n var chart2 = new google.visualization.PieChart(document.getElementById('piechart2'));\n var chart3 = new google.visualization.PieChart(document.getElementById('piechart3'));\n chart1.draw(data1);\n chart2.draw(data2);\n chart3.draw(data3);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Category');\n data.addColumn('number', 'Amount');\n data.addRows(myData);\n\n // Set chart options\n var options = {'width':500,\n 'height':400};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function DrawClicksChart()\n{\n // create/delete rows \n if (clicksTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - clicksTable.getNumberOfRows();\n clicksTable.addRows(numRows);\n } else {\n for(var i=(clicksTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n clicksTable.removeRow(i); \n }\n }\n\n // Populate data table with time/clicks data points. \n for(var i=0; i < clicksTable.getNumberOfRows(); i++)\n {\n clicksTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n clicksTable.setCell(i, 1, parseInt(aggrDataPoints[i].clicks));\n }\n\n // Draw line chart.\n chartOptions.title = 'Clicks Chart';\n clicksChart.draw(clicksView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Day');\n data.addColumn('number', 'Hours');\n data.addRows([\n ['Sunday', 166860],\n ['Monday', 91133.5],\n ['Tuesday', 91133.5],\n ['Wednesday', 91133.5],\n ['Thursday', 91133.5],\n ['Friday', 91133.5],\n ['Saturday', 94222],\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Hours of free parking per day of the week',\n 'width': 300,\n 'height': 150,\n pieHole: .4\n };\n\n // Instantiate and draw our chart, passing in some options.\n // var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart(data,Container,width,height,arrBuckets,props) {\n\n// alert(\"Drawing chart\");\n\n var csvfile = arrBuckets.timeline.title + \",\" + arrBuckets.value.title + '\\n';\n \n var dataValues = d3.map(data, function(d,i) {csvfile += d.timeline+ \",\" + d.value + '\\n';\n return d.timeline + \",\" + d.value;});\n \n var chartDiv = document.getElementById(Container[0][0].id);\n var win = window\n , doc = document\n , ele = doc.documentElement\n , bdy = doc.getElementsByTagName(\"body\")[0]\n , screenWidth = screen.width;\n\n var main_margin = {top: 15, right: 15, bottom: 15, left: 15};\n\n chartDiv.style.top = main_margin.top + \"px\";\n chartDiv.style.left = main_margin.left + \"px\";\n chartDiv.style.width = width - main_margin.left - main_margin.right + \"px\";\n chartDiv.style.height = height - main_margin.top - main_margin.bottom + \"px\";\n\n mygraph = new Dygraph(\n chartDiv,\n csvfile, // CSV file\n props\n );\n\n}","function DrawRevenueChart()\n{\n // create/delete rows \n if (revenueTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - revenueTable.getNumberOfRows();\n revenueTable.addRows(numRows);\n } else {\n for(var i=(revenueTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n revenueTable.removeRow(i); \n }\n }\n\n // Populate data table with time/revenue data points. \n for(var i=0; i < revenueTable.getNumberOfRows(); i++)\n {\n revenueTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n revenueTable.setCell(i, 1, parseFloat(aggrDataPoints[i].revenue));\n }\n\n // Draw line chart.\n chartOptions.title = 'Revenue Chart';\n revenueChart.draw(revenueView, chartOptions); \n}","function drawChart() {\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Weather Element');\n data.addColumn('number', 'Dec');\n data.addColumn('number', 'Feb');\n data.addColumn('number', 'Jan');\n data.addColumn('number', 'Nov');\n data.addColumn('number', 'Oct');\n data.addColumn('number', 'Sep');\n\n data.addRows([\n ['Snow - Heavy', 6,0,2,2,0,0],\n ['Snow - Light', 2,0,0,0,0,0],\n ['Snow - Normal', 4,0,2,0,0,0]\n ]);\n\n var options = {\n 'title': 'Snowy Weather by Months',\n 'width': 500,\n 'height': 600,\n 'isStacked': true};\n \n var chart = new google.visualization.ColumnChart(document.getElementById('chart_div2'));\n chart.draw(data, options);\n }","function drawChart() { \n var data =window.google.visualization.arrayToDataTable([\n ['Location', 'Pending Request','Approved Request'],\n ['Bangalore', 8,10],\n ['Gurgaon', 2,12],\n ['Chennai', 4,2],\n ['UK', 2,8],\n ]);\n var options = {'width':500, 'height':300};\n var chart = new window.google.visualization.PieChart(document.getElementById(self.props.id));\n chart.draw(data, options); \n }","function DrawRAMChart()\n{\n // create/delete rows \n if (ramTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - ramTable.getNumberOfRows();\n ramTable.addRows(numRows);\n } else {\n for(var i=(ramTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n ramTable.removeRow(i); \n }\n }\n\n // Populate data table with time/ram data points. \n for(var i=0; i < ramTable.getNumberOfRows(); i++)\n {\n ramTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n ramTable.setCell(i, 1, parseFloat(aggrDataPoints[i].ram));\n }\n\n // Draw line chart.\n chartOptions.title = 'RAM Usage (%)';\n ramChart.draw(ramView, chartOptions); \n}","function DrawCostChart()\n{\n // create/delete rows \n if (costTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - costTable.getNumberOfRows();\n costTable.addRows(numRows);\n } else {\n for(var i=(costTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n costTable.removeRow(i); \n }\n }\n \n // Populate data table with time/cost data points. \n for(var i=0; i < costTable.getNumberOfRows(); i++)\n {\n //if(parseFloat(aggrDataPoints[i].cost) < 500) continue;\n costTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n costTable.setCell(i, 1, parseFloat(aggrDataPoints[i].cost));\n }\n\n // Draw line chart.\n chartOptions.title = 'Cost Chart';\n costChart.draw(costView, chartOptions); \n}","function drawChart() {\n console.log(\"drawChart ran\");\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Day');\n data.addColumn('number', 'Temperature');\n var i = 0;\n /*Loops through the days of the week and for each\n day there is weather info it adds a row */\n for (i = 0; i < days_of_the_week.length; i++) {\n if (day_and_temp_map.has(days_of_the_week[i])) {\n data.addRow([days_of_the_week[i], day_and_temp_map.get(days_of_the_week[i])]);\n }\n }\n\n // Set chart options\n var options = {\n 'title': 'Weather forecast chart',\n 'width': 500,\n 'height': 300\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function DrawMarginChart()\n{\n // create/delete rows \n if (marginTable.getNumberOfRows() < contDataPoints.length)\n { \n var numRows = contDataPoints.length - marginTable.getNumberOfRows();\n marginTable.addRows(numRows);\n } else {\n for(var i=(marginTable.getNumberOfRows()-1); i > contDataPoints.length; i--)\n {\n marginTable.removeRow(i); \n }\n }\n\n // Populate data table with time/cost data points. \n for(var i=0; i < marginTable.getNumberOfRows(); i++)\n {\n marginTable.setCell(i, 0, new Date(parseInt(contDataPoints[i].timestamp)));\n marginTable.setCell(i, 1, (parseFloat(contDataPoints[i].cost)-parseFloat(contDataPoints[i].revenue))/parseFloat(contDataPoints[i].revenue));\n }\n\n // Draw line chart.\n chartOptions.title = 'Margin Chart';\n marginChart.draw(marginView, chartOptions); \n}","function drawChart() {\n details.html('');\n wrap.html('');\n\n svg = wrap.append('svg')\n .attr('width', width + margin.left + margin.right)\n .attr('height', height + margin.top + margin.bottom);\n\n change = details.append('div').attr('class', 'change');\n range = details.append('div').attr('class', 'range');\n showHigh = range.append('span').attr('class', 'high');\n showLow = range.append('span').attr('class', 'low');\n volume = details.append('div').attr('class', 'volume');\n\n bg = svg.append('rect')\n .attr('width', width + margin.left + margin.right)\n .attr('height', height + margin.top + margin.bottom)\n .style({opacity: 0});\n\n pointer = svg.append('path')\n .attr('class', 'pointer')\n .attr('d', 'M 0 0 L 7 -7 L 40 -7 L 40 7 L 7 7 L 0 0')\n .attr('transform', 'translate(' +\n (width + margin.left) + ',' +\n (height + margin.top) + ')');\n\n svg.append('rect').attr('width', width + margin.left + margin.right)\n .attr('class', 'timeBackground')\n .attr('height', margin.bottom)\n .attr('transform', 'translate(0,' + (height + margin.top) + ')');\n\n gEnter = svg.append('g')\n .attr('transform', 'translate(' + margin.left + ',' + margin.top + ')');\n\n gEnter.append('g').attr('class', 'grid');\n gEnter.append('path').attr('class', 'line');\n\n gEnter.append('g').attr('class', 'x axis');\n gEnter.append('g').attr('class', 'price axis')\n .attr('transform', 'translate(' + width + ', 0)');\n\n flipping = false;\n flip = svg.append('g').attr('class', 'flip')\n .attr('width', margin.right)\n .attr('height', margin.bottom)\n .attr('transform', 'translate(' +\n (width + margin.left) + ',' +\n (height + margin.top) + ')')\n .on('click', function() {\n d3.event.stopPropagation();\n flipping = true;\n\n dropdownA.selected(self.counter);\n dropdownB.selected(self.base);\n dropdowns.selectAll('div').remove();\n\n dropdowns.append('div')\n .attr('class', 'base dropdowns')\n .attr('id', 'base' + self.index)\n .call(dropdownA);\n\n dropdowns.append('div')\n .attr('class', 'counter dropdowns')\n .attr('id', 'quote' + self.index)\n .call(dropdownB);\n\n self.load();\n\n flipping = false;\n\n if (markets.options.fixed) {\n header.html('' +\n getName(self.base.issuer, self.base.currency) +\n '' + baseCurrency + '/' +\n counterCurrency + '' +\n getName(self.counter.issuer, self.counter.currency) +\n '');\n }\n });\n\n flip.append('rect')\n .attr({\n width: margin.right,\n height: margin.bottom\n });\n\n flip.append('text').text('Flip')\n .attr({\n 'text-anchor': 'middle',\n y: margin.bottom * 4 / 5,\n x: margin.right / 2\n });\n\n horizontal = gEnter.append('line')\n .attr('class', 'horizontal')\n .attr({x1: 0, x2: width})\n .attr('transform', 'translate(0,' + height + ')');\n lastPrice = gEnter.append('text')\n .attr('class', 'lastPrice')\n .style('text-anchor', 'middle')\n .attr('x', (width + margin.left) / 2);\n }","function drawChart(percentagesByDay) {\n // Load the Visualization API and the appropriate packages, setting a callback\n // to run when the API is loaded.\n google.load('visualization', '1.0', {'packages':['corechart']});\n google.setOnLoadCallback(function() {\n drawChartCallback(percentagesByDay);\n });\n}","function DrawCPUChart()\n{\n // create/delete rows \n if (cpuTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - cpuTable.getNumberOfRows();\n cpuTable.addRows(numRows);\n } else {\n for(var i=(cpuTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n cpuTable.removeRow(i); \n }\n }\n \n // Populate data table with time/cpu data points. \n for(var i=0; i < cpuTable.getNumberOfRows(); i++)\n {\n //if(parseFloat(aggrDataPoints[i].cpu) < 500) continue;\n cpuTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n cpuTable.setCell(i, 1, parseFloat(aggrDataPoints[i].cpu));\n }\n\n // Draw line chart.\n chartOptions.title = 'CPU Usage (%)';\n cpuChart.draw(cpuView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Tricipital', parseInt(document.getElementById('tricipital').value, 10)],\n ['subescapular', parseInt(document.getElementById('subescapular').value, 10)],\n ['suprailiaca', parseInt(document.getElementById('suprailiaca').value, 10)],\n ['abdominal', parseInt(document.getElementById('abdominal').value, 10)],\n ['quadriceps', parseInt(document.getElementById('quadriceps').value, 10)]\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Percentual de dobras cutâneas em mm³',\n 'margin': 0,\n 'padding': 0,\n 'width': 450,\n 'height': 350\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawchart() {\r\n const filters = getFilters();\r\n const drawData = filterData(\r\n filters[\"startDate\"],\r\n filters[\"endDate\"],\r\n filters[\"provincesFilter\"]\r\n );\r\n timeLapseChart = new TimeLapseChart(\"timelapse-chart\");\r\n timeLapseChart\r\n .setTitle(\"COVID-19 ARGENTINA - EVOLUCIÓN EN EL TIEMPO\")\r\n .setColumnsStyles(columnNames)\r\n .addDatasets(drawData)\r\n .render();\r\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Activity');\n data.addColumn('number', 'Completed');\n data.addRows([\n ['Courses', 3],\n ['Posts', 1],\n ['Job Offers', 1],\n ['Tutorials', 1],\n ['Projects', 2]\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Your activity on Udabuddy',\n 'width': '100%',\n 'height': '100%'\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById(\n 'chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n\t var data = google.visualization.arrayToDataTable([\n\t ['Tool', 'Rating'],\n\t ['Visual Studio', 5],\n\t ['Eclipse', 3],\n\t ['Notepad++', 2],\n\t \n\t \n\t]);\n\n\t // Optional; add a title and set the width and height of the chart\n\t var options = { 'width':'94%', 'height':250,\n\t\tcolors: ['#e81e68', '#999999','#efefef'],\n\t\tis3D: true,\n\t\tbackgroundColor: 'rgb(24,27,46)',\n\t\tlegend: {textStyle: {color: 'white'},position:'bottom'}\n\t\t};\n\n\t // Display the chart inside the element with id=\"piechart\"\n\t var chart = new google.visualization.PieChart(document.getElementById('codetool'));\n\t chart.draw(data, options);\n\t}","function drawChart(idgraph) {\n\n \tvar myData;\n \t\n \t// Create the data table.\n\tvar typeChart = $('#type-select').children(':selected').attr('id');\n\tvar options;\n\tvar chart;\n\tswitch(typeChart) {\n\t\tcase \"scatter\" :\n\t\t\toptions = {\n\t\t\t\ttitle: X + ' vs. ' + Y,\n\t\t\t\twidth: 800,\n\t\t\t\theight: 480,\n\t\t\t\ttitleX: X,\n\t\t\t\ttitleY: Y,\n\t\t\t\tlegend: 'none',\n\t\t\t\tpointSize: 5\n\t\t\t};\n\t\t\tmyData = JSONextractNumber(X,Y,activeData);\n\t\t\tchart = new google.visualization.ScatterChart(document.getElementById(idgraph));\t\t\t\n\t\t\tbreak;\n\t\tcase \"bar\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractString(X,Y,activeData);\n\t\t\tchart = new google.visualization.BarChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"column\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractSort(X,Y,activeData);\n\t\t\tchart = new google.visualization.ColumnChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"line\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractSort(X,Y,activeData);\n\t\t\tchart = new google.visualization.LineChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"pie\" :\n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractCount(X,activeData);\n\t\t\tchart = new google.visualization.PieChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tdefault : \n\t\t\tbreak;\n\t}\n\n var data = google.visualization.arrayToDataTable(myData);\n chart.draw(data, options);\n\n}","function ChartsBarchart() {\n}","function drawChart(){\n\n\tdataTable = new google.visualization.DataTable(data);\n\toptions.hAxis.ticks = dataTable.getDistinctValues(0);\n\n\tview = new google.visualization.DataView(dataTable);\n\t\n\toptions['series'] = Series();\n options['selectionMode'] = 'multiple';\n options['tooltip'] = {\n 'isHtml': true,\n trigger: 'both'\n }\n\n\tchart = new google.visualization.LineChart(document.getElementById(containerId));\n\n\tchart.draw(view, options);\n\n\t//google.visualization.drawChart({\n\t//\t\"containerId\": containerId,\n\t//\t\"chartType\": chartType,\n\t//\t\"options\": options,\n\t//\t\"dataTable\": data,\n\t//\t\"view\": view\n\t//})\n}","function drawChart() {\n\t\n\n\t// Create our data table.\n\tjQuery.getJSON('/data/stats.json', function(stat_data) {\n\t\t\n\t\tjQuery.each(stat_data.entries, function(num, chart_info){\n\t\t\t\n\t\t\tvar data = new google.visualization.DataTable();\n\t\t\t\n\t\t\tif (chart_info.chart_type == \"Pie chart\"){\n\n\t\t\t\tdata.addColumn('string', chart_info.column_label);\n\t\t\t\tdata.addColumn('number', chart_info.numeric_label);\n\t\t\t\n\t\t\t\tdata.addRows(chart_info.stats.length);\n\t\t\t\n\t\t\t\tfor (var i=0; i < chart_info.stats.length; i++){\n\t\t\t\t\tfor(var j=0; j < chart_info.stats[i].length; j++){\n\t\t\t\t\t\tdata.setValue(i, j, chart_info.stats[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\tvar chart = new google.visualization.PieChart(document.getElementById(chart_info.chart_div));\n\t\t\t\tchart.draw(data, {width: 750, height: 500, title: chart_info.chart_title});\n\t\t\t\t\n\t\t\t}\n\t\t\telse{\n\t\t\t\t\n\t\t\t\tdata.addColumn('string', 'Sectors');\n\t\t\t for (var i = 0; i < chart_info.stats.length; ++i) {\n\t\t\t data.addColumn('number', chart_info.stats[i][0]); \n\t\t\t }\n\n\n\t\t\t data.addRows(chart_info.axis_labels.length);\n\n\t\t\t for (var j = 0; j < chart_info.axis_labels.length; ++j) { \n\t\t\t data.setValue(j, 0, chart_info.axis_labels[j]); \n\t\t\t }\n\t\t\t\n\t\t\t for (var i = 0; i < chart_info.stats.length; ++i) {\n\t\t\t for (var j = 1; j < chart_info.stats[i].length; ++j) {\n\t\t\t data.setValue(j-1, i+1, chart_info.stats[i][j]); \n\t\t\t }\n\t\t\t }\n\t\t\t\n\t\t\t\t\n\t\t\t\tif (chart_info.chart_type == \"Vertical bar chart\"){\n\t\t\t\t\tvar chart = new google.visualization.ColumnChart(document.getElementById(chart_info.chart_div));\n\t\t\t\t\tchart.draw(data,{width: \"100%\", height: 700, title: chart_info.chart_title, vAxis: {title: \"NGOs\"}, hAxis: {title: \"Sectors\"}});\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tvar chart = new google.visualization.BarChart(document.getElementById(chart_info.chart_div));\n\t\t\t\t\tchart.draw(data,{width: \"100%\", height: 700, title: chart_info.chart_title, vAxis: {title: \"Sectors\"}, hAxis: {title: \"NGOs\"}});\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\n\t\t});\n\t\t\n\t\t\n\t});\n\t\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Value');\n data.addRows([\n ['', 3],\n ]);\n\n // Set chart options\n var options = {'title':'Parameter #1',\n 'width':'100%',\n 'height': 105,\n 'backgroundColor': { fill:'transparent' }};\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.BarChart(document.getElementById('chart1'));\n chart1.draw(data, options);\n var chart2 = new google.visualization.BarChart(document.getElementById('chart2'));\n chart2.draw(data, options);\n var chart3 = new google.visualization.BarChart(document.getElementById('chart3'));\n chart3.draw(data, options);\n var chart4 = new google.visualization.BarChart(document.getElementById('chart4'));\n chart4.draw(data, options);\n var chart5 = new google.visualization.BarChart(document.getElementById('chart5'));\n chart5.draw(data, options);\n var chart6 = new google.visualization.BarChart(document.getElementById('chart6'));\n chart6.draw(data, options);\n var chart7 = new google.visualization.BarChart(document.getElementById('chart7'));\n chart7.draw(data, options);\n var chart8 = new google.visualization.BarChart(document.getElementById('chart8'));\n chart8.draw(data, options);\n var chart9 = new google.visualization.BarChart(document.getElementById('chart9'));\n chart9.draw(data, options);\n var chart10 = new google.visualization.BarChart(document.getElementById('chart10'));\n chart10.draw(data, options);\n }","function drawChart() {\n\t\t\t\t\tvar data = google.visualization.arrayToDataTable(\n\t\t\t\t\tInventArray, false);\n\t\t\t\t\tconsole.log(data);\n\n\t\t\t\t\t // Optional; add a title and set the width and height of the chart\n\t\t\t\t\tvar options = {'title':'Average Stock', 'width':350, 'height':300, 'chartArea': {'width': '100%', 'height': '80%'}, pieSliceText:'value-and-percentage'};\n\n\t\t\t\t\t// Display the chart inside the element with id=\"piechart\"\n\t\t\t\t\tvar chart = new google.visualization.PieChart(document.getElementById('piechart'));\n\t\t\t\t\tchart.draw(data, options);\n\t\t\t\t}","function drawChart() {\r\n var data = google.visualization.arrayToDataTable([\r\n ['Task', 'Hours per Day'],\r\n ['windows', 8],\r\n ['MacOS', 4],\r\n ['Android', 1],\r\n ['iOS', 2],\r\n ['その他', 2]\r\n]);\r\n\r\n // Optional; add a title and set the width and height of the chart\r\n var options = {'width':400, 'height':260};\r\n\r\n // Display the chart inside the element with id=\"piechart\"\r\n var chart = new google.visualization.PieChart(document.getElementById('checkOs'));\r\n chart.draw(data, options);\r\n}","function drawChart() {\n\t var data = google.visualization.arrayToDataTable([\n\t ['Task', 'Hours per Day'],\n\t ['Work', 8],\n\t ['Eat', 2],\n\t ['TV', 4],\n\t ['Gym', 2],\n\t ['Sleep', 8]\n\t]);\n\n\t // Optional; add a title and set the width and height of the chart\n\t var options = {'title':'My Average Day', 'width':300, 'height':340};\n\n\t // Display the chart inside the element with id=\"piechart\"\n\t var chart = new google.visualization.PieChart(document.getElementById('piechart'));\n\t chart.draw(data, options);\n\t}","function drawChart( pItemSel, pItemHeight, pConfigData, pValuesData, pDefaultConfig, pContainer ) {\n\n apex.debug.info( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"pItemSel\": pItemSel,\n \"pItemHeight\": pItemHeight,\n \"pConfigData\": pConfigData,\n \"pValuesData\": pValuesData,\n \"pDefaultConfig\": pDefaultConfig,\n \"featureDetails\": util.featureDetails\n } );\n\n // eslint-disable-next-line no-undef\n const d3JS = d3;\n\n const aTypeCharts = [\"pie\", \"donut\", \"gauge\"],\n specialStr = \"\\u200b\",\n seriesData = util.groupObjectArray( pValuesData, 'seriesID' );\n\n let isGauge = false,\n isPie = false,\n isDonut = false;\n\n // sort pValuesData by Time\n function sortArrByTime( pArr, pFormat ) {\n\n function customeSort( pFirstValue, pSecondValue ) {\n const parseTime = d3JS.timeParse( pFormat ),\n fD = parseTime( pFirstValue.x ),\n sD = parseTime( pSecondValue.x );\n return new Date( fD ).getTime() - new Date( sD ).getTime();\n }\n\n try {\n return pArr.sort( customeSort );\n }\n catch ( e ) {\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while try sort JSON Array by Time Value\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n }\n\n /* search link from data and set window.location.href */\n function executeLink( pData ) {\n const key = specialStr + unescape( pData.id );\n let index = pData.index;\n\n if ( seriesData[key] ) {\n const seriesObj = seriesData[key];\n if ( seriesObj.length === 1 ) {\n index = 0;\n }\n\n if ( seriesData[key][index] && seriesData[key][index].link ) {\n util.link( seriesData[key][index].link, seriesData[key][index].linkTarget );\n }\n }\n }\n\n try {\n const chartTitle = setObjectParameter( pConfigData.chartTitle, pDefaultConfig.d3JSchart.chartTitle || \"\" ).toString(),\n background = setObjectParameter( pConfigData.background, pDefaultConfig.d3JSchart.background );\n let backJSON = null,\n ownTooltip = false;\n\n if ( util.isDefinedAndNotNull( background ) ) {\n backJSON = {\n color: background\n };\n }\n\n /* line */\n const lineStep = setObjectParameter( pConfigData.lineStep, pDefaultConfig.d3JSchart.line.step );\n\n /* gauge */\n const gaugeMin = setObjectParameter( pConfigData.gaugeMin, pDefaultConfig.d3JSchart.gauge.min ),\n gaugeMax = setObjectParameter( pConfigData.gaugeMax, pDefaultConfig.d3JSchart.gauge.max ),\n gaugeType = setObjectParameter( pConfigData.gaugeType, pDefaultConfig.d3JSchart.gauge.type ),\n gaugeWidth = setObjectParameter( pConfigData.gaugeWidth, pDefaultConfig.d3JSchart.gauge.width ),\n gaugeArcMinWidth = setObjectParameter( pConfigData.gaugeArcMinWidth, pDefaultConfig.d3JSchart.gauge.arcMinWidth ),\n gaugeFullCircle = setObjectParameter( pConfigData.gaugeFullCircle, pDefaultConfig.d3JSchart.gauge.fullCircle, true ),\n gaugeTitle = setObjectParameter( pConfigData.gaugeTitle, pDefaultConfig.d3JSchart.gauge.title || \"\" ).toString();\n\n /* Grid */\n const gridX = setObjectParameter( pConfigData.gridX, pDefaultConfig.d3JSchart.grid.x, true ),\n gridY = setObjectParameter( pConfigData.gridY, pDefaultConfig.d3JSchart.grid.y, true );\n\n /* heights */\n const heightXAxis = setObjectParameter( pConfigData.xAxisHeight, pDefaultConfig.d3JSchart.x.axisHeight );\n\n /* Legend */\n const legendShow = setObjectParameter( pConfigData.legendShow, pDefaultConfig.d3JSchart.legend.show, true ),\n legendPosition = setObjectParameter( pConfigData.legendPosition, pDefaultConfig.d3JSchart.legend.position );\n\n /* padding */\n const chartPadding = util.jsonSaveExtend( null, pDefaultConfig.d3JSchart.padding );\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingBottom ) ) {\n chartPadding.bottom = pConfigData.paddingBottom;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingLeft ) ) {\n chartPadding.left = pConfigData.paddingLeft;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingRight ) ) {\n chartPadding.right = pConfigData.paddingRight;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingTop ) ) {\n chartPadding.top = pConfigData.paddingTop;\n }\n\n /* Axis */\n const rotateAxis = setObjectParameter( pConfigData.rotateAxis, pDefaultConfig.d3JSchart.rotateAxis, true ),\n axisLabelPosition = setObjectParameter( pConfigData.axisLabelPosition, pDefaultConfig.d3JSchart.axisLabelPosition );\n\n let xAxisLabelPosition = null,\n yAxisLabelPosition = null;\n\n switch ( axisLabelPosition ) {\n case \"inner1\":\n xAxisLabelPosition = \"inner-left\";\n yAxisLabelPosition = \"inner-bottom\";\n break;\n case \"inner2\":\n xAxisLabelPosition = \"inner-center\";\n yAxisLabelPosition = \"inner-middle\";\n break;\n case \"inner3\":\n xAxisLabelPosition = \"inner-right\";\n yAxisLabelPosition = \"inner-top\";\n break;\n case \"outer1\":\n xAxisLabelPosition = \"outer-left\";\n yAxisLabelPosition = \"outer-bottom\";\n break;\n case \"outer2\":\n xAxisLabelPosition = \"outer-center\";\n yAxisLabelPosition = \"outer-middle\";\n break;\n case \"outer3\":\n xAxisLabelPosition = \"outer-right\";\n yAxisLabelPosition = \"outer-top\";\n break;\n default:\n break;\n }\n\n if ( rotateAxis ) {\n const xAxisLabelPositionTmp = xAxisLabelPosition;\n xAxisLabelPosition = yAxisLabelPosition;\n yAxisLabelPosition = xAxisLabelPositionTmp;\n }\n\n /* tooltip */\n const tooltipShow = setObjectParameter( pConfigData.tooltipShow, pDefaultConfig.d3JSchart.tooltip.show, true ),\n tooltipGrouped = setObjectParameter( pConfigData.tooltipGrouped, pDefaultConfig.d3JSchart.tooltip.grouped, true );\n\n /* Transition duration */\n const transitionDuration = setObjectParameter( pConfigData.transitionDuration || pDefaultConfig.d3JSchart.transitionDuration );\n\n /* x Axis */\n const xShow = setObjectParameter( pConfigData.xShow, pDefaultConfig.d3JSchart.x.show, true ),\n xLabel = setObjectParameter( pConfigData.xLabel, pDefaultConfig.d3JSchart.x.label || \"\" ).toString();\n let xType = setObjectParameter( pConfigData.xType, pDefaultConfig.d3JSchart.x.type ),\n xAxisTimeFormat = null,\n xName = null;\n\n /* x ticks */\n const xTickCutAfter = setObjectParameter( pConfigData.xTickCutAfter, pDefaultConfig.d3JSchart.x.tick.cutAfter ),\n xTickMaxNumber = setObjectParameter( pConfigData.xTickMaxNumber, pDefaultConfig.d3JSchart.x.tick.maxNumber ),\n xTickRotation = setObjectParameter( pConfigData.xTickRotation, pDefaultConfig.d3JSchart.x.tick.rotation ),\n xTickMultiline = setObjectParameter( pConfigData.xTickMultiline, pDefaultConfig.d3JSchart.x.tick.multiline, true ),\n xTickFit = setObjectParameter( pConfigData.xTickFit, pDefaultConfig.d3JSchart.x.tick.fit, true ),\n xTickAutoRotate = setObjectParameter( pConfigData.xTickAutoRotate, pDefaultConfig.d3JSchart.x.tick.autoRotate, true );\n let xTickTimeFormat = null;\n\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n xName = \"x\";\n }\n\n if ( xType === \"timeseries\" ) {\n xAxisTimeFormat = setObjectParameter( pConfigData.xTimeFormat, pDefaultConfig.d3JSchart.x.timeFormat );\n xTickTimeFormat = setObjectParameter( pConfigData.xTickTimeFormat, pDefaultConfig.d3JSchart.x.tick.timeFormat );\n // sort data because of tooltip index\n sortArrByTime( pValuesData, xAxisTimeFormat );\n }\n\n /* cut string if category names are to long */\n if ( xType === \"category\" ) {\n xTickTimeFormat = function ( index, categoryName ) {\n return util.cutString( categoryName, xTickCutAfter );\n };\n }\n\n /* y Axis */\n const yLabel = setObjectParameter( pConfigData.yLabel, pDefaultConfig.d3JSchart.y.label || \"\" ).toString(),\n yLog = setObjectParameter( pConfigData.yLog, pDefaultConfig.d3JSchart.y.log, true );\n let yType = null;\n if ( yLog ) {\n yType = \"log\";\n }\n const yMin = pConfigData.yMin || pDefaultConfig.d3JSchart.y.min,\n yMax = pConfigData.yMax || pDefaultConfig.d3JSchart.y.max,\n yCulling = pConfigData.yTickMaxNumber || pDefaultConfig.d3JSchart.y.tick.maxNumber,\n yUnit = pConfigData.yUnit || pDefaultConfig.d3JSchart.y.unit;\n\n /* y2 Axis */\n const y2Label = setObjectParameter( pConfigData.y2Label, pDefaultConfig.d3JSchart.y2.label || \"\" ).toString(),\n y2Log = setObjectParameter( pConfigData.y2Log, pDefaultConfig.d3JSchart.y2.log, true );\n let y2Type = null,\n y2Show = false;\n if ( y2Log ) {\n y2Type = \"log\";\n }\n const y2Min = setObjectParameter( pConfigData.y2Min, pDefaultConfig.d3JSchart.y2.min ),\n y2Max = setObjectParameter( pConfigData.y2Max, pDefaultConfig.d3JSchart.y2.max ),\n y2Culling = setObjectParameter( pConfigData.y2TickMaxNumber, pDefaultConfig.d3JSchart.y2.tick.maxNumber ),\n y2Unit = setObjectParameter( pConfigData.y2Unit, pDefaultConfig.d3JSchart.y2.unit );\n\n /* Zoom and Subchart */\n const zoomType = setObjectParameter( pConfigData.zoomType, pDefaultConfig.d3JSchart.zoom.type );\n let showSubChart = false,\n zoomEnabled = setObjectParameter( pConfigData.zoomEnabled, pDefaultConfig.d3JSchart.zoom.enabled, true );\n\n const charThreshold = setObjectParameter( pConfigData.threshold, pDefaultConfig.d3JSchart.threshold );\n\n if ( zoomEnabled ) {\n if ( zoomType === \"scroll\" ) {\n showSubChart = false;\n } else if ( zoomType === \"subchart\" ) {\n showSubChart = true;\n zoomEnabled = false;\n } else if ( zoomType === \"drag\" ) {\n zoomEnabled = true;\n showSubChart = false;\n }\n } else {\n showSubChart = false;\n }\n\n const zoomRescale = setObjectParameter( pConfigData.zoomRescale, pDefaultConfig.d3JSchart.zoom.rescale, true );\n\n /* Prepare Data for Render */\n const dataArr = [],\n categoriesArr = [],\n groupsArr = [],\n colorsJSON = {},\n typesJSON = {},\n axesJSON = {},\n namesJSON = {},\n groupJSON = {},\n xCatObj = util.groupObjectArray( pValuesData, \"x\" );\n\n let seriesCnt = 0;\n\n if ( seriesData ) {\n /* Add Categories or time values to x Axis when correct type is set */\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n categoriesArr.push( \"x\" );\n const xCatArr = Object.keys( xCatObj );\n\n $.each( xCatArr, function ( dIdx, dataValues ) {\n categoriesArr.push( ( setObjectParameter( dataValues.replace( specialStr, \"\" ), null ) ) );\n } );\n }\n\n dataArr.push( categoriesArr );\n\n /* Transform data for billboard.js */\n $.each( seriesData, function ( idx, seriesData ) {\n let series;\n seriesCnt += 1;\n if ( seriesData[0] && seriesData[0].seriesID ) {\n series = seriesData[0];\n const dataKey = escape( series.seriesID );\n colorsJSON[dataKey] = series.color;\n typesJSON[dataKey] = series.type;\n\n /* check if atypechart*/\n if ( aTypeCharts.indexOf( series.type ) >= 0 ) {\n zoomEnabled = false;\n }\n\n if ( series.type === \"gauge\" ) {\n isGauge = true;\n }\n\n if ( series.type === \"pie\" ) {\n isPie = true;\n }\n\n if ( series.type === \"donut\" ) {\n isDonut = true;\n }\n\n if ( util.isDefinedAndNotNull( series.tooltip ) ) {\n ownTooltip = true;\n }\n\n axesJSON[dataKey] = ( series.yAxis || \"y\" );\n if ( util.isDefinedAndNotNull( series.groupID ) ) {\n const groupID = escape( series.groupID.toString() );\n if ( groupJSON[groupID] ) {\n groupJSON[groupID].push( dataKey );\n } else {\n groupJSON[groupID] = [];\n groupJSON[groupID].push( dataKey );\n }\n }\n\n if ( series.yAxis === \"y2\" ) {\n y2Show = true;\n }\n namesJSON[dataKey] = ( setObjectParameter( series.label, dataKey ) );\n\n const arr = [];\n arr.push( dataKey );\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n $.each( xCatObj, function ( dIdx, dataValues ) {\n let setValueY = null,\n setValueZ = null;\n $.each( dataValues, function ( sIDx, sDataValues ) {\n if ( escape( sDataValues.seriesID ) === dataKey ) {\n setValueY = sDataValues.y;\n if ( sDataValues.z ) {\n setValueZ = sDataValues.z;\n }\n }\n } );\n if ( setValueZ !== null ) {\n arr.push( {\n \"y\": setValueY,\n \"z\": setValueZ\n } );\n } else {\n arr.push( setValueY );\n }\n } );\n } else {\n $.each( seriesData, function ( dIdx, dataValues ) {\n const setValueY = setObjectParameter( dataValues.y, null );\n if ( dataValues.z ) {\n const setValueZ = dataValues.z;\n arr.push( {\n \"y\": setValueY,\n \"z\": setValueZ\n } );\n } else {\n arr.push( setValueY );\n }\n } );\n }\n\n dataArr.push( arr );\n\n } else {\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"No seriesID found in seriesID Cursor\",\n \"featureDetails\": util.featureDetails\n } );\n }\n\n } );\n\n /* Group JSON to Array */\n $.each( groupJSON, function ( dIdx, jsonObj ) {\n groupsArr.push( jsonObj );\n } );\n\n /* Labels and Datapoints */\n let dataLabels = setObjectParameter( pConfigData.showDataLabels, pDefaultConfig.d3JSchart.showDataLabels, true );\n\n if ( isPie || isDonut ) {\n dataLabels = {\n colors: \"white\"\n };\n } else if ( isGauge ) {\n dataLabels = {\n colors: ( gaugeType === \"single\" && seriesCnt > 1 ) ? \"white\" : \"inherit\"\n };\n }\n const showDataPoints = setObjectParameter( pConfigData.showDataPoints, pDefaultConfig.d3JSchart.showDataPoints, true ),\n showAbsoluteValues = setObjectParameter( pConfigData.showAbsoluteValues, pDefaultConfig.d3JSchart.showAbsoluteValues );\n let absoluteFormatting;\n\n if ( showAbsoluteValues ) {\n absoluteFormatting = function ( value ) {\n return value + yUnit;\n };\n }\n\n let ttContent;\n if ( ownTooltip ) {\n ttContent = function ( d ) {\n const div = $( \"\" );\n div.addClass( \"bb-tooltip\" );\n div.addClass( \"bida-chart-tooltip-custome\" );\n $.each( d, function ( i, pData ) {\n const key = specialStr + unescape( pData.id ),\n seriesObj = seriesData[key],\n index = pData.index;\n \n if ( seriesObj && seriesObj[index] && util.isDefinedAndNotNull( seriesObj[index].tooltip ) && util.isDefinedAndNotNull( pData.value ) ) {\n const subDiv = $( \"\" );\n\n let ttS = seriesObj[index].tooltip;\n if ( pRequireHTMLEscape !== false ) {\n ttS = util.escapeHTML( ttS );\n }\n subDiv.append( ttS );\n div.append( subDiv );\n }\n } );\n return div[0].outerHTML;\n };\n }\n\n try {\n const chartContIDSel = pItemSel + \"bbc\",\n chartContID = chartContIDSel.replace( \"#\", \"\" ),\n chartCont = $( \"\" );\n chartCont.attr( \"id\", chartContID );\n\n $( pItemSel ).append( chartCont );\n\n const bbData = {\n bindto: chartContIDSel,\n background: backJSON,\n title: {\n text: chartTitle\n },\n size: {\n height: pItemHeight\n },\n data: {\n x: xName,\n xFormat: xAxisTimeFormat,\n columns: dataArr,\n types: typesJSON,\n groups: groupsArr,\n colors: colorsJSON,\n labels: dataLabels,\n axes: axesJSON,\n names: namesJSON,\n onclick: function ( pData ) {\n executeLink( pData );\n }\n },\n pie: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n }\n },\n donut: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n }\n },\n line: {\n step: {\n type: lineStep\n }\n },\n gauge: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n },\n fullCircle: gaugeFullCircle,\n min: gaugeMin,\n max: gaugeMax,\n type: gaugeType,\n width: gaugeWidth,\n title: gaugeTitle,\n arc: {\n minWidth: gaugeArcMinWidth\n }\n },\n radar: {\n direction: {\n clockwise: true\n }\n },\n subchart: {\n show: showSubChart\n },\n zoom: {\n type: zoomType,\n enabled: zoomEnabled,\n rescale: zoomRescale\n },\n transition: {\n duration: transitionDuration\n },\n legend: {\n show: legendShow,\n position: legendPosition\n },\n tooltip: {\n show: tooltipShow,\n grouped: tooltipGrouped,\n contents: ttContent\n },\n grid: {\n x: {\n show: gridX,\n },\n y: {\n show: gridY\n }\n },\n point: {\n show: showDataPoints\n },\n axis: {\n rotated: rotateAxis,\n x: {\n show: xShow,\n label: {\n text: xLabel,\n position: xAxisLabelPosition\n },\n type: xType,\n tick: {\n culling: {\n max: xTickMaxNumber\n },\n autorotate: xTickAutoRotate,\n rotate: xTickRotation,\n multiline: xTickMultiline,\n format: xTickTimeFormat,\n fit: xTickFit\n },\n height: heightXAxis\n },\n y: {\n label: {\n text: yLabel,\n position: yAxisLabelPosition\n },\n type: yType,\n max: yMax,\n min: yMin,\n tick: {\n culling: {\n max: yCulling\n },\n format: function ( d ) {\n return d + yUnit;\n }\n }\n },\n y2: {\n show: y2Show,\n label: {\n text: y2Label,\n position: yAxisLabelPosition\n },\n type: y2Type,\n max: y2Max,\n min: y2Min,\n tick: {\n culling: {\n max: y2Culling\n },\n format: function ( d ) {\n return d + y2Unit;\n }\n }\n }\n },\n padding: chartPadding\n };\n\n apex.debug.info( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"finalChartData\": bbData,\n \"featureDetails\": util.featureDetails\n } );\n\n // eslint-disable-next-line no-undef\n const chart = bb.generate( bbData );\n\n /* reset zoom on right click */\n if ( zoomEnabled ) {\n $( chartContIDSel ).contextmenu( function ( evt ) {\n evt.preventDefault();\n chart.unzoom();\n } );\n }\n\n /* execute resize */\n pContainer.on( \"resize\", function() {\n chart.resize( {\n height: pItemHeight\n } );\n } );\n\n } catch ( e ) {\n $( pItemSel ).empty();\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while try to render chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n } else {\n util.noDataMessage.show( pItemSel, pDefaultConfig.noDataMessage );\n }\n } catch ( e ) {\n $( pItemSel ).empty();\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while prepare data for chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n }","function winInit() {\n myDIV = document.getElementById(\"myDIV\");\n myCanvas = document.getElementById('myCanvas');\n ctx = myCanvas.getContext(\"2d\");\n\n exampleCanvas = document.getElementById('exampleCanvas');\n ctx2 = exampleCanvas.getContext(\"2d\");\n\n drawColumnChart({\n ctx: ctx,\n canvas: myCanvas,\n xData: [1,2,3,4,5,6],\n yData: [10,30,20,10,20,60],\n cvx: myCanvas.width/6, // canvas.width / antall kolonner (6)\n cvy: 500,\n number: 6,\n widthPx: 50,\n yScale: 7,\n barColor: \"Green\",\n textColor: \"Pink\"\n });\n\n drawHtmlTable(myDIV, [\"nice\", \"verynice\", \"reallynice\"], [\"1\", \"13231231212\", \"38218942\", \"1\", \"2\", \"3\"]);\n\n drawPieChart(ctx2, exampleCanvas, [1,2,3], [\"Red\", \"blue\", \"yellow\"]);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'FIO');\n data.addColumn('number', 'Count');\n i = 0; \n\n names = document.querySelectorAll('.DName');\n values = document.querySelectorAll('.DCount');\n\n while (i + 1 <= names.length) {\n data.addRows([\n [names[i].innerText, +values[i].innerText]\n ]);\n i++;\n }\n\n // Set chart options\n var options = {\n 'title': 'Кругова діаграма',\n 'width': 500,\n 'height': 500\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","draw() {\n this.plot = this.svg.append('g')\n .classed(\"plot\", true)\n .attr('transform', `translate(${this.margin.left},${this.margin.top})`);\n\n // Add the background\n this.plot.append(\"rect\")\n .attrs({\n fill: \"white\",\n x: 0,\n y: 0,\n height: this.innerHeight,\n width: this.innerWidth\n });\n\n if ( this.opts.nav !== false ) {\n this.drawNav();\n }\n\n // Add the title\n this.svg.append('text')\n .attr('transform', `translate(${this.width / 2},${this.margin.top / 2})`)\n .attr(\"class\", \"chart-title\")\n .attr('x', 0)\n .attr('y', 0)\n .text(this.title);\n }","function drawChart(){\n canvas = d3.select(\"#chart\").append(\"svg\")\n .attr(\"class\",\"variationChart\")\n .attr(\"width\", width)\n .attr(\"height\", height + margin.top + margin.bottom)\n .append(\"g\")\n}","function drawChart(reactionData) {\n var reactionDataTable = new google.visualization.DataTable();\n reactionDataTable.addColumn('number', 'Time');\n reactionDataTable.addColumn('number', 'Reaction');\n reactionDataTable.addRows(reactionData);\n\n var options = {\n title: 'Reactions over Time',\n curveType: 'function',\n width: 900,\n height: 500,\n legend: 'none',\n hAxis: {title: 'Time'},\n vAxis: {title: 'Reaction'}\n };\n // set the chart handle\n var chart = new google.visualization.LineChart(document.getElementById('chart_div'));\n\n //var chart = new google.visualization.ScatterChart(document.getElementById('chart_div'));\n chart.draw(reactionDataTable, options);\n }","function drawChart() {\n\t//creates x and y axis and names them\n\tvar data = new google.visualization.DataTable();\n\tdata.addColumn('number', 'Num of itarations');\n\tdata.addColumn('number', 'Cost');\n\n\tdata.addRows(loss);//add the loss array which holds how the network is preforming\n\t \n\t//gives the chart a name and changes its size\n\tvar options = {\n\t\tchart: {\n\t\t\ttitle: 'The Cost of the network',\n\t\t},\n\t\twidth: window.innerWidth*0.4,\n\t\theight: window.innerHeight*0.2\n\t};\n\t\n\t//crates the chart\n\tvar chart = new google.charts.Line(document.getElementById('line_top_x'));\n\t\n\t//remove goggles error when the loss array is empty\n\tgoogle.visualization.events.addListener(chart, 'error', function (googleError) {\n\t\tgoogle.visualization.errors.removeError(googleError.id);\n\t});\n\t//shows the chart\n\tchart.draw(data, google.charts.Line.convertOptions(options));\n }","function draw(count1, count2, id){\n \n google.charts.setOnLoadCallback(drawChart(count1, count2, id));\n }","function draw_chart(c){\n c.beginPath();\n c.strokeStyle = \"red\";\n c.moveTo(count_block(5),count_block(40));\n\n var xplot = 10;\n for(let j=0; j < data.length; j++){\n var data_in_blocks = data[j]/100; \n \n \n c.strokeText(data[j].toString(), count_block(xplot), count_block(40-data_in_blocks)-10);\n c.lineTo(count_block(xplot), count_block(40-data_in_blocks));\n c.arc(count_block(xplot), count_block(40-data_in_blocks), 3,0, Math.PI*2, true);\n xplot+=5;\n \n }\n c.stroke();\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Budget');\n data.addColumn('number', 'Amount');\n data.addRows([\n ['Income', total_income],\n ['Expense', total_expense]\n ]);\n\n // Set chart options\n var options = {'title':'Income/Expense Pie Chart',\n 'width':400,\n 'height':300};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart() {\n\n// n.b. need all these retrieved;\n var chart5_ovs = parseFloat(document.getElementById('chart5_ovs').value);\n var chart5_hormo = parseFloat(document.getElementById('chart5_hormo').value);\n var chart5_chemo_add = parseFloat(document.getElementById('chart5_chemo_add').value);\n var chart5_tram_add = parseFloat(document.getElementById('chart5_tram_add').value);\n var chart10_ovs = parseFloat(document.getElementById('chart10_ovs').value);\n var chart10_hormo = parseFloat(document.getElementById('chart10_hormo').value);\n var chart10_chemo_add = parseFloat(document.getElementById('chart10_chemo_add').value);\n var chart10_tram_add = parseFloat(document.getElementById('chart10_tram_add').value);\n var types=['Year','Survival with no Adjuvant treatment',\n 'Benefit of Adjuvant Hormone therapy'];\n if ( chart5_chemo_add > 0.0001 ) {\n types[types.length]='Additional benefit of Adjuvant Chemotherapy';\n }\n if ( chart5_tram_add > 0.0001 ) {\n types[types.length]='Additional benefit of Trastuzumab';\n }\n types[types.length]= { role: 'annotation' };\n var yr5 = ['Five years', chart5_ovs, chart5_hormo];\n var yr10 = ['Ten years', chart10_ovs, chart10_hormo];\n if ( chart5_chemo_add > 0.0001 ) {\n yr5[yr5.length]= chart5_chemo_add;\n yr10[yr10.length]= chart10_chemo_add;\n }\n if ( chart5_tram_add > 0.0001 ) {\n yr5[yr5.length]= chart5_tram_add;\n yr10[yr10.length]= chart10_tram_add;\n }\n yr5[yr5.length]= '';\n yr10[yr10.length]= '';\n var data = google.visualization.arrayToDataTable([types,yr5,yr10]);\n\n// alternate construction - cant get this to work\n// var data = google.visualization.DataTable();\n// data.addColumn({ type: 'number', label: 'Five years', id: 'year5', role: 'annotation' });\n// data.addColumn({ type: 'number', label: 'Ten years', id: 'year10', role: 'annotation' });\n// data.addRow([10, 24]);\n// data.addRow([16, 22]);\n\n var view = new google.visualization.DataView(data);\n// n.b. view.setColumns() Specifies which columns are visible in this view. Any columns not specified will be hidden\n var setcols=[0,1,{ calc: \"stringify\",sourceColumn: 1,type: \"string\",role: \"annotation\" }];\n// only set the hormo benefit value (column 2) to be displayed if it's > 0.0\n// n.b. hormo value is always in the data array so always index 2\n if ( chart5_hormo > 0.0001 ) {\n setcols[setcols.length]= 2;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 2,type: \"string\",role: \"annotation\" };\n } else {\n// setcols[setcols.length]= 2; # not needed as not displaying ??\n }\n// n.b. if present chemo is always index 3 and traz always index 4 (no traz without chemo)\n if ( chart5_chemo_add > 0.0001 ) {\n setcols[setcols.length]= 3;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 3,type: \"string\",role: \"annotation\" };\n } else {\n// setcols[setcols.length]= 3;\n }\n if ( chart5_tram_add > 0.0001 ) {\n setcols[setcols.length]= 4;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 4,type: \"string\",role: \"annotation\" };\n// setcols[setcols.length]= 5;\n }\n setcols[setcols.length]= types.length - 1;\n view.setColumns(setcols);\n// view.setColumns([0, // this example for labelling of 2 data regimes in bar chart\n// 1,{ calc: \"stringify\",sourceColumn: 1,type: \"string\",role: \"annotation\" },\n// 2,{ calc: \"stringify\",sourceColumn: 2,type: \"string\",role: \"annotation\" },3]);\n\n// n.b. height & width are set as same as in img block\n// legend:{ alignment: 'bottom', textStyle: { fontSize: getFontSize(), overflow: 'auto'} }\n// legend: {position: 'bottom', alignment: 'center', maxLines: 4, textStyle: { overflow: 'none'}},\n// legend is uncontrolable - especially for long labels like we have! so don't use and replace with static png\n// n.b. give chart max y-axis of 105 so top category value label has enough room to display\n// tooltips: {isHtml: true, showColorCode: true},\n// colors: ['#666699','#00ff00','#ff9900','#00aa99'],\n// n.b. since new release of google charts on 23/2/15 for ER -ve (0 hormo) we now need to remove the green\n// from the colours vector as it's being used for the chemo i.e. zero hormo is not being interpretted\n// properly seemingly a bug - corrected 17/3/15 by emd\n var cols = ['#666699'];\n if ( chart5_hormo > 0.001 ) {\n cols[cols.length]= '#00ff00';\n }\n cols[cols.length]= '#ff9900';\n cols[cols.length]= '#00aa99';\n var options = {\n title: 'Overall Survival at 5 and 10 years (percent)',\n colors: cols,\n vAxis: {maxValue: 105, ticks: [0,10,20,30,40,50,60,70,80,90,100]},\n chartArea: {left:40, top:30, width:'70%', height:'65%'},\n legend: {position: 'none'},\n bar: {groupWidth: \"50%\"},\n isStacked: true,\n width: 360,\n height: 460\n };\n\n var chart_div = document.getElementById('chart1');\n var chart = new google.visualization.ColumnChart(chart_div);\n\n// n.b. currently turned off as causes tooltips NOT to be displayed on mouseover -must have tooltips!\n // Wait for the chart to finish drawing before calling the getImageURI() method.\n// google.visualization.events.addListener(chart, 'ready', function () {\n// chart_div.innerHTML = '';\n// console.log(chart_div.innerHTML);\n// });\n\n// chart.draw(data, options); // use this form if not using the view object for labelling\n chart.draw(view, options);\n\n }","function chartEmergingNow_Draw(ele, dataset) {\n // Variables\n ele = \"#\" + ele;\n $(ele +\" svg\").remove();\n\n // Data\n var data = null;\n if(dataset === \"InterestsPassions\"){\n data = appData[activeAudience].psychographics.categoriesData[activeInterestsPassionsCategory].analyses[0].emergingNow;\n }\n if(dataset === \"InsightsTrends\"){\n data = appData[activeAudience].insightstrends.categoriesData[activeInsightsTrendsCategory].emergingNow;\n }\n\n // Dimensions\n w = $(ele).width();\n var h = 110;\n\n var radius = 10;\n var max_n = 0;\n for (var d in data) {\n max_n = Math.max(data[d].value, max_n);\n }\n var dx = w / max_n;\n var dy = 30;\n\n // Draw\n var svg = d3.select(ele)\n .append(\"svg\")\n .attr(\"width\", w)\n .attr(\"height\", h);\n \n // Bars\n var bars = svg.selectAll(\".bar\")\n .data(data)\n .enter()\n .append(\"rect\")\n .attr(\"class\", function(d, i) { return \"bar\"; })\n .attr(\"x\", function(d, i) { return 0; })\n .attr(\"y\", function(d, i) { return (dy + 10) * i; })\n .attr(\"width\", function(d, i) { return (d.value / max_n) * 100 + '%'; })\n .attr(\"height\", dy)\n .attr(\"rx\", radius)\n .attr(\"ry\", radius)\n .attr( \"fill\", function( d, i ) { return chartEmergingNow_ColorSeries( i ); });\n\n // Labels\n var text = svg.selectAll(\"text\")\n .data(data)\n .enter()\n .append(\"text\")\n .attr(\"class\", function(d, i) { return \"label\";} )\n .attr(\"x\", 10)\n .attr(\"y\", function(d, i) { return ((dy + 10) * i) + 20;} )\n .attr(\"font-size\", \"12px\")\n .attr(\"font-weight\", \"bold\")\n .attr(\"fill\", \"#ffffff\")\n .text( function(d) { return d.insight; } );\n\n}","function drawEmployeeChart() {\r\n\r\n\t\t// ----- first chart ---------\r\n\t\t// Create the data table.\r\n\t\tvar dataTable = google.visualization.arrayToDataTable([\r\n\t\t\t['Type', 'Count'],\r\n\t\t\t['Masked', data['total_employee'] - data['total_result_employee']],\r\n\t\t\t['Unmasked', data['total_result_employee']]\r\n\t\t]);\r\n\r\n\t\t// Set chart options\r\n\t\tvar options = {\r\n\t\t\t'width': 500,\r\n\t\t\t'height': 400,\r\n\t\t\tbackgroundColor: 'transparent',colors: ['#809cb5', '#34485c'],\r\n\t\t\tlegend:{textStyle:{fontSize:'14', fontName: 'Montserrat'}}\r\n\t\t};\r\n\t\tvar title = { 'title': 'Employee Ratio' , \r\n\t\t\t\t\t titleTextStyle: {fontSize:'16', fontName: 'Montserrat'}\r\n\r\n\t\t\t\t};\r\n\r\n\t\t// Instantiate and draw our chart, passing in some options.\r\n\t\tvar chart = new google.visualization.PieChart(document.getElementById('chart1_div'));\r\n\t\tchart.draw(dataTable, { ...title, ...options });\r\n\r\n\r\n\t\t// ----- second chart ---------\r\n\t\tdataTable = google.visualization.arrayToDataTable([\r\n\t\t\t['Type', 'Count'],\r\n\t\t\t['Visitor', data['total_result'] - data['total_result_employee_occurance']],\r\n\t\t\t['Employee', data['total_result_employee_occurance']]\r\n\t\t]);\r\n\t\ttitle = { 'title': 'Unmasked Occurance Ratio' ,\r\n\t\t\t\ttitleTextStyle: {fontSize:'16', fontName: 'Montserrat'}};\r\n\t\tchart = new google.visualization.PieChart(document.getElementById('chart2_div'));\r\n\t\tchart.draw(dataTable, { ...title, ...options });\r\n\t}","function drawChart3() {\n var data3\n // Create the data table.\n data3 = new google.visualization.DataTable();\n data3.addColumn('string', 'nombre');\n data3.addColumn('number', 'cantidad');\n data3.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por actividad escuela: '+escuela,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data3, options1);\n\n }","function DrawImpressionsChart()\n{\n // create/delete rows \n if (impressionsTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - impressionsTable.getNumberOfRows();\n impressionsTable.addRows(numRows);\n } else {\n for(var i=(impressionsTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n impressionsTable.removeRow(i); \n }\n }\n\n // Populate data table with time/impressions data points. \n for(var i=0; i < impressionsTable.getNumberOfRows(); i++)\n {\n impressionsTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n impressionsTable.setCell(i, 1, parseInt(aggrDataPoints[i].impressions));\n }\n\n // Draw line chart.\n chartOptions.title = 'Impressions Chart';\n impressionsChart.draw(impressionsView, chartOptions); \n}","function drawChart() {\n const data = new google.visualization.DataTable();\n data.addColumn('string', 'Animal');\n data.addColumn('number', 'Count');\n data.addRows([\n ['2001', 23],\n ['2002', 22],\n ['2003', 23],\n ['2004', 23],\n ['2005', 28],\n ['2006', 28],\n ['2007', 25],\n ['2008', 28],\n ['2009', 27],\n ['2010', 6],\n ['2015', 18],\n ['2016', 18]\n ]);\n\n const options = {\n 'title': 'Distribution of BIONICLE sets per year (2001-2010; 2015-2016)',\n 'width':600,\n 'height':600\n };\n\n const chart = new google.visualization.PieChart(\n document.getElementById('chart-container'));\n chart.draw(data, options);\n}","function renderPieChart() {\n var i, x, y, r, a1, a2, set, sum;\n\n x = width / 2;\n y = height / 2;\n r = Math.min(x, y) - 2;\n a1 = 1.5 * Math.PI;\n a2 = 0;\n set = sets[0];\n sum = sumSet(set);\n\n for (i = 0; i < set.length; i++) {\n ctx.fillStyle = colorOf(i);\n ctx.beginPath();\n a2 = a1 + (set[i] / sum) * (2 * Math.PI);\n\n // TODO opts.wedge\n ctx.arc(x, y, r, a1, a2, false);\n ctx.lineTo(x, y);\n ctx.fill();\n a1 = a2;\n }\n }","function draw(datatable) {\n // Define look and feel parameters using options object to override defaults.\n var width = options.width || 300;\n var backgroundColor = options.backgroundColor;\n var globalStyle = options.globalStyle || {fontFamily:'sans-serif'};\n var titleStyle = options.titleStyle || {fontWeight:'bold'};\n var captionStyle = options.captionStyle || {fontSize:'0.70em'};\n var powerRange = options.powerRange || 6000;\n var title = options.title || source;\n\n // Create a datatable with this source's data and baseline.\n datatable = addBaseline(datatable);\n\n // Get the top-level div where this visualization should go.\n element = document.getElementById(viz_id);\n\n // Now add the elements.\n addGlobalStyle(element, backgroundColor, width, globalStyle);\n addTitleDiv(element, viz_id, title, titleStyle);\n addMeterDiv(element, viz_id, datatable, backgroundColor, width, powerRange);\n addCaptionDiv(element, viz_id, captionStyle, datatable);\n }","function drawChart() {\n\n\t// empty the container to generate chart with updated width\n\tdocument.getElementById(\"value-chart\").innerHTML = \"\";\n\n\t// get the new width of the container that will hold the chart\n\tlet chartContainerWidth = document.getElementById('chart-container').clientWidth;\n\tlet chartWidth = chartContainerWidth - 20;\n\n\t// obtain the height of the table\n\tlet tableHeight = document.getElementById('table-data').clientHeight;\n\t// assign the height of the chart to be equal to the height of the table \n\t// remove 30px to account for the chart title\n\tlet chartHeight = tableHeight - 30; // height of svg container for chart \n\t\n\t// define chart data\n\tlet dataChart = d3.zip(arrayIds, arrayNames, arrayValue2);\n\n\t// define y scale\n\tlet yScale = d3.scaleBand()\n\t\t\t\t\t.domain(d3.range(arrayIds.length))\n\t\t\t\t\t.rangeRound([0, chartHeight])\n\t\t\t\t\t.round(true)\n\t\t\t\t\t.paddingInner(0.05);\n\n\t// define x scale\n\tlet xScale = d3.scaleLinear()\n\t\t\t\t\t.domain([0, d3.max(arrayValue2)]) // +10 to show labels above\n\t\t\t\t\t.range([40, chartWidth]);\t\t\n\n\t// create SVG element\n\tlet svgSales = d3.select(\"#value-chart\") // select by id\n\t\t\t\t.append(\"svg\") // insert the
Wrong: \" + incorrect + \"
Trivia written by Glen Weldon for NPR podcast 'Pop Culture Happy Hour.' Weldon is the author of 'The Caped Crusade: Batman and the Rise of Nerd Culture.'
\");\n\t\t$(\".choice\").hide();\n\t\t$(\"#startBtn\").show();\n\t}\n\t}","function endTracking() {\n tryingToTrack = false;\n timeCounter = 0;\n\n $(\"#stopTrackingMe\").css({\n \"display\": \"none\"\n });\n $(\"#extendTrackingMe\").css({\n \"display\": \"none\"\n });\n $(\"#extendTrackingMe\").on('click', () => {\n alert(\"Timer set to 30 mins\")\n });\n $(\"#startTrackingMe\").css({\n \"display\": \"inline-block\"\n });\n }","function nextQuestion() {\n if (questionCounter < questions.length) {\n time = 15;\n $(\"#gameScreen\").html(\"You have \" + time + \" seconds left!
\");\n questionContent();\n timer();\n userTimeout();\n }\n else {\n resultsScreen();\n }\n\n }","function nextQuestion() {\n\t\tif (questionCounter < questions.length) {\n\t\t\ttime = 15;\n\t\t\t$(\".gameScreen\").html(\"You have \" + time + \" seconds left!
\");\n\t\t\tquestionContent();\n\t\t\ttimer();\n\t\t\ttimesUp();\n\t\t}\n\t\telse {\n\t\t\tresultsScreen();\n\t\t}\n\t}","function goToLastQuestion(){ \r\n\tcount--\r\n\tupdateItems();\r\n}","function nextQuestion(event) {\n\n\n // condition uses click event to add to user score if correct ansser is made //\n if (event.target.value === questions[currentQuesIndex].correctAns) {\n score++;\n } else {\n time -= 5;\n counter.textContent = time + \" Seconds left on quiz.\";\n }\n\n\n\n // Condition executes next question\n if (currentQuesIndex < questions.length) {\n currentQuesIndex++;\n // moves to next section once condition is met\n } if (currentQuesIndex === questions.length) {\n\n quizEl.style.display = \"none\";\n // this function call takes user to results section\n quizResults();\n return;\n\n }\n showQuestion();\n}","function nextQuestion() {\n if (questionCounter < questions.length)\n { time = 10;\n $(\"#gameScreen\").html(\"You have \" + time + \n \" seconds left!
\");\n questionContent();\n timer();\n userTimeout();\n \n }\n \n else {\n resultsScreen();\n }\n\t}","function incorrect() {\n timeLeft -=20;\n nextQuestion();\n}","function tally() {\r\n alert('You are have reached the end of the game! Your answers gave you a cool rating of: ' + correct);\r\n alert('Explore the rest of the page to check out more about me that wasn\\'t included in the game!');\r\n\r\n }","function checkGameEnd() {\n if(count === question.length) {\n $(\"#time-holder\").hide();\n showResults();\n count = 0;\n $(\".start\").show();\n $(\".start\").on(\"click\", function() {\n resetResults();\n startGame();\n });\n }\n }","function checkGameEnd() {\n if(count === question.length) {\n $(\"#time-holder\").hide();\n showResults();\n count = 0;\n $(\".start\").show();\n $(\".start\").on(\"click\", function() {\n resetResults();\n startGame();\n });\n }\n }","function after_response(choice) {\n\n // measure rt\n var end_time = Date.now();\n var rt = end_time - start_time;\n response.choice = data.prompt_type == \"count\" ? parseInt(choice) : choice;\n response.rt = rt;\n\n // after a valid response, the stimulus will have the CSS class 'responded'\n // which can be used to provide visual feedback that a response was recorded\n display_element.querySelector('#scene-stimulus').className += ' responded';\n\n // disable all the buttons after a response\n var btns = document.querySelectorAll('.scene-choice-button button');\n for(var i=0; iCorrect Answers: \" + correctAnswer + \"
\");\n $(\"main\").append(\"Wrong Answers: \" + wrongAnswer + \"
\");\n $(\"main\").append(\"Missed Answers: \" + missedAnswer + \"
\");\n\n time = 30;\n clicked = false;\n count =0;\n correctAnswer = 0;\n wrongAnswer = 0;\n missedAnswer = 0;\n\n $(\"main\").append(\"\");\n $(\"#start-button\").on(\"click\", timingQuestion);\n }\n }","function correctAnswer(){\n $(\"#timer\").text(\"You are correct!\"); \n if (clickCount == 0) {\n correct++;\n }; \n clickCount++; //used to prevent multiple clicks adding to the total amount\n clearInterval(timeInterval); \n roundEnd();\n $(\"button\").remove(); //used to remove previous events from existing buttons\n $(\"#choice-container\").html('')\n }"],"string":"[\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"rt\\\": Math.round(performance.now() - trial_onset),\\n \\\"digit_response\\\": digit_response,\\n 'click_history': click_history\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n if (trial.post_trial_duration !== null) {\\n jsPsych.pluginAPI.setTimeout(function () {\\n jsPsych.finishTrial(trial_data);\\n }, trial.post_trial_duration);\\n } else {\\n jsPsych.finishTrial(trial_data);\\n }\\n\\n }\",\n \"function click() {\\r\\n console.log(questions[questionIndex].answer)\\r\\n console.log(this.value)\\r\\nif(this.value !== questions[questionIndex].answer) {\\r\\n time -= 5;\\r\\n\\r\\n if (time < 0) {\\r\\n time = 0;\\r\\n }\\r\\n}\\r\\n\\r\\n$(\\\"#time-counter\\\").text(time);\\r\\n\\r\\nquestionIndex++;\\r\\nif(questionIndex === questions.length) {\\r\\n finish();\\r\\n} else {\\r\\nstartQuestions();\\r\\n}}\",\n \"function correctAnswerClicked() {\\n console.log(\\\"correct answer\\\");\\n correctAnswerCount++;\\n $(\\\"#correct-answers-view\\\").html(correctAnswerCount);\\n $(\\\".footer\\\").html(\\\"Correct!!!Waiting 5 seconds to go next!\\\");\\n \\n stop();\\n waitBeforeGoingNextAutomatically();\\n\\n}\",\n \"function ansClick(e) {\\n if(qIndex >= (questions.length - 1)) {\\n postScore();\\n } else {\\n var currentQuestion = questions[qIndex];\\n var ansClick = e.target.textContent;\\n if(ansClick.toLowerCase() === currentQuestion.answer.toLowerCase()) {\\n currentScore+= 5;\\n } else {\\n time -= 10;\\n currentScore -= 5;\\n }\\n qIndex++;\\n getQuestion();\\n };\\n}\",\n \"function nextQuestion() {\\n // currentQuestion++\\n $(\\\"#question\\\").html(test[nextUp].hint);\\n $(\\\"#guess1\\\").html(test[nextUp].guess1);\\n $(\\\"#guess2\\\").html(test[nextUp].guess2);\\n $(\\\"#guess3\\\").html(test[nextUp].guess3);\\n $(\\\"#guess4\\\").html(test[nextUp].guess4);\\n // console.log(nextUp)\\n countDown();\\n // $('#timeToGo').each(countDown); //starts counter\\n anser = (test[nextUp].Answer);\\n nextUp++\\n // console.log(currentQuestion)\\n\\n //-------------------------------------------------------------------------------------------------------\\n //clicks for answer 1\\n}\",\n \"function end_trial() {\\r\\n\\r\\n // kill any remaining setTimeout handlers\\r\\n for (var i = 0; i < setTimeoutHandlers.length; i++) {\\r\\n clearTimeout(setTimeoutHandlers[i]);\\r\\n }\\r\\n\\r\\n // gather the data to store for the trial\\r\\n var trial_data = {\\r\\n \\\"rt\\\": response.rt,\\r\\n \\\"stimulus\\\": trial.stimulus,\\r\\n \\\"button_pressed\\\": response.button\\r\\n };\\r\\n\\r\\n // clear the display\\r\\n display_element.html('');\\r\\n\\r\\n // move on to the next trial\\r\\n jsPsych.finishTrial(trial_data);\\r\\n }\",\n \"function nextQuestion(){\\n $(\\\"#alerts\\\").hide();\\n currentQuestion = triviaQuestions[currentQuestionIndex + 1];\\n currentQuestionIndex++;\\n if (currentQuestionIndex >= 10) {\\n $(\\\"#alerts\\\").html(\\\"
Nice job! Click the Start 90s Trivia button to play again!
Questions Correct: \\\" + correctAnswers.length + \\\"
Questions Incorrect: \\\" + incorrectAnswers.length + \\\"
\\\");\\n $(\\\"#alerts\\\").show();\\n stopTimer();\\n } else {\\n displayQuestion(currentQuestion);\\n };\\n }\",\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"rt\\\": response.rt,\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"button_pressed\\\": response.button\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"rt\\\": response.rt,\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"button_pressed\\\": response.button\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end(){\\n\\t\\tclearTimeout(timerId);\\n\\t\\t$(\\\"#Time-Remaining\\\").hide();\\n\\t\\t$(\\\"#Question\\\").hide();\\n $(\\\"#score\\\").show();\\n $(\\\"#score\\\").text(\\\"You got \\\"+ correct +\\\" out of \\\"+questions.length+\\\" correct!\\\")\\n $(\\\".answer\\\").hide();\\n $(\\\"#Ready\\\").show();\\n $(\\\"#retry\\\").show();\\n cQ = 0;\\n correct = 0;\\n $(\\\"#Ready\\\").click(function(){\\n\\t\\t\\ttimeLeft = 60\\n $(\\\".answer\\\").empty();\\n $(\\\"#Question\\\").empty();\\n $(\\\"#Time-Remaining\\\").show();\\n $(\\\"#Ready\\\").hide();\\n $(\\\"#score\\\").hide();\\n $(\\\"#retry\\\").hide();\\n\\t\\t\\tsetTimeout(Question,500);\\n });\\n }\",\n \"function answerClick(x) {\\n var answer = questions[questionCounter].answer;\\n showAnswer(x == answer);\\n if (x !== answer) {\\n time -= wrongAnswerPenalty;\\n showTime();\\n }\\n questionCounter ++;\\n if (questionCounter < questions.length) {\\n getQuestions();\\n }\\n else {\\n showEndScreen();\\n }\\n}\",\n \"function end_trial() {\\r\\n\\r\\n // kill any remaining setTimeout handlers\\r\\n jsPsych.pluginAPI.clearAllTimeouts();\\r\\n\\r\\n // gather the data to store for the trial\\r\\n var trial_data = {\\r\\n \\\"stimulus\\\": trial.stimulus,\\r\\n \\\"correct\\\": trial.correct,\\r\\n \\\"choice\\\": response.choice,\\r\\n \\\"accuracy\\\": response.accuracy,\\r\\n \\\"rt\\\": response.rt,\\r\\n };\\r\\n\\r\\n // clear the display\\r\\n display_element.innerHTML = '';\\r\\n\\r\\n // move on to the next trial\\r\\n jsPsych.finishTrial(trial_data);\\r\\n }\",\n \"function lastClicked() { \\n // end the quiz and show the score\\n console.log(\\\"last clik func active\\\");\\n clearInterval(timeInterval);\\n quiz.style.display = \\\"none\\\";\\n\\n //todo//\\n }\",\n \"function end_trial() {\\r\\n\\r\\n // kill any remaining setTimeout handlers\\r\\n jsPsych.pluginAPI.clearAllTimeouts();\\r\\n\\r\\n // gather the data to store for the trial\\r\\n var trial_data = {\\r\\n \\\"rt\\\": response.rt,\\r\\n \\\"stimulus\\\": trial.stimulus,\\r\\n \\\"response\\\": response.response\\r\\n };\\r\\n\\r\\n // clear the display\\r\\n display_element.innerHTML = '';\\r\\n\\r\\n // move on to the next trial\\r\\n jsPsych.finishTrial(trial_data);\\r\\n }\",\n \"function end_trial() {\\n response.rt = performance.now() - start_time;\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(response);\\n }\",\n \"function end_trial() {\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n const trial_data = {\\n rt: response.rt,\\n stimulus: trial.stimulus,\\n button_pressed: response.button,\\n switched_queries: response.switched_queries,\\n confidence: response.confidence,\\n choice: response.choice,\\n correct: response.choice == trial.correct_query_choice,\\n };\\n\\n // clear the display\\n display_element.innerHTML = \\\"\\\";\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n var trial_data = {\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"rating\\\": trial.rating,\\n \\\"condition\\\": trial.condition,\\n \\\"with loading\\\": trial.cognitive_loading,\\n \\\"rating_rt\\\": trial.rating_rt,\\n \\\"grid_rt\\\": trial.grid_rt,\\n \\\"scale type\\\": trial.scale_type,\\n \\\"correct anser\\\": trial.correct_answer,\\n \\\"hits\\\": trial.hits,\\n \\\"misses\\\": trial.misses,\\n \\\"false alarms\\\": trial.false_alarms,\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n\\n\\t\\t\\tjsPsych.pluginAPI.clearAllTimeouts();\\n\\t\\t\\t//Kill the keyboard listener if keyboardListener has been defined\\n\\t\\t\\tif (typeof keyboardListener !== 'undefined') {\\n\\t\\t\\t\\tjsPsych.pluginAPI.cancelKeyboardResponse(keyboardListener);\\n\\t\\t\\t}\\n\\n\\t\\t\\t//Place all the data to be saved from this trial in one data object\\n\\t\\t\\tvar trial_data = {\\n\\t\\t\\t\\t\\\"rt\\\": response.rt, //The response time\\n\\t\\t\\t\\t\\\"key_press\\\": response.key, //The key that the subject pressed\\n\\t\\t\\t\\t\\\"mean\\\": trial.mean,\\n\\t\\t\\t\\t\\\"sd\\\": trial.sd,\\n\\t\\t\\t\\t'left_circles': circles_left,\\n\\t\\t\\t\\t'right_circles': circles_right,\\n\\t\\t\\t\\t'larger_magnitude': larger_magnitude,\\n\\t\\t\\t\\t'left_radius': r1,\\n\\t\\t\\t\\t'right_radius': r2\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (trial_data.key_press == trial.choices[0] && larger_magnitude == 'left'){\\n\\t\\t\\t\\ttrial_data.correct = true\\n\\t\\t\\t}\\n\\t\\t\\telse if (trial_data.key_press == trial.choices[1] && larger_magnitude == 'right'){\\n\\t\\t\\t\\ttrial_data.correct = true\\n\\t\\t\\t}\\n\\t\\t\\telse if (trial_data.key_press == -1 ){\\n\\t\\t\\t\\ttrial_data.correct = null\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\ttrial_data.correct = false\\n\\t\\t\\t}\\n\\n\\n\\t\\t\\t//Remove the canvas as the child of the display_element element\\n\\t\\t\\tdisplay_element.innerHTML='';\\n\\n\\t\\t\\t//Restore the settings to JsPsych defaults\\n\\t\\t\\tbody.style.margin = originalMargin;\\n\\t\\t\\tbody.style.padding = originalPadding;\\n\\t\\t\\tbody.style.backgroundColor = originalBackgroundColor\\n\\t\\t\\tbody.style.cursor = originalCursorType\\n\\n\\t\\t\\tjsPsych.finishTrial(trial_data); //End this trial and move on to the next trial\\n\\n\\t\\t}\",\n \"function nextQuestion(){\\t\\n\\t\\thideAnswerBox();\\n\\t\\tremovePosters();\\n\\t\\tstopAudio();\\n\\t\\tquestionCount++;\\n\\t\\t\\n\\t\\tif (questionCount > 9) {\\n\\t\\t\\tendGame();\\n\\t\\t\\tshowOverlay($('.endGame'));\\n\\t\\t}\\n\\t\\telse if (questionCount > 4 && gameCount < 1) {\\n\\t\\t\\tendRound();\\n\\t\\t\\tshowOverlay($('.end_round'));\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tupdateQuestion();\\n\\t\\t\\tplayAudio();\\n\\t\\t}\\n\\t}\",\n \"function nextQuestions() {\\n number++;\\n count = 30;\\n timeRemain = setInterval(timer, 1000);\\n $(\\\"#timer\\\").html(\\\"Time remaining: \\\" + count + \\\" secs\\\");\\n questions(number);\\n $(\\\"#image\\\").hide();\\n }\",\n \"function end_trial() {\\n 'use strict';\\n\\n // gather the data to store for the trial\\n let trial_data = {\\n end_rt: response.rt,\\n end_x: Math.round(x_coords[x_coords.length - 1]),\\n end_y: Math.round(y_coords[y_coords.length - 1]),\\n x_coords: roundArray(x_coords),\\n y_coords: roundArray(y_coords),\\n time: time,\\n text_bounds: text_bounds,\\n };\\n\\n // remove canvas mouse events\\n canvas.removeEventListener('mousemove', mousePosition);\\n canvas.removeEventListener('mousedown', mouseResponse);\\n\\n // clear the display and move on the the next trial\\n display_element.innerHTML = '';\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function end_trial() {\\n // kill any remaining setTimeout handlers\\n jsPsych.pluginAPI.clearAllTimeouts();\\n\\n // gather the data to store for the trial\\n let trial_data = {\\n \\\"rt\\\": response.rt,\\n \\\"stimulus\\\": trial.stimulus,\\n \\\"audio_data\\\": response.audio_data\\n };\\n\\n // clear the display\\n display_element.innerHTML = '';\\n\\n // move on to the next trial\\n jsPsych.finishTrial(trial_data);\\n }\",\n \"function reask() {\\n cb.call(surveyResponse, null, surveyResponse, responseLength);\\n }\",\n \"function count() {\\n time--;\\n $(\\\".timer\\\").text(time);\\n if (time <= 0) {\\n clearInterval(questionInterval);\\n buttonClicked(0);\\n // calling the buttonClicked function as if unanswered = wrong.\\n }\\n }\",\n \"function wait(){\\n $(\\\"#showAnswer\\\").hide().empty();\\n if(questionCounter<8){\\n stepforward();\\n \\n } else {\\n console.log(\\\"gameover!\\\");\\n finalResults();\\n \\n }\\n}\",\n \"function nextQuestion() {\\n // clean the record\\n var allId = [\\\"A\\\", \\\"B\\\", \\\"C\\\", \\\"D\\\"];\\n for (var i in allId) {\\n $(\\\"#\\\" + allId[i]).removeClass(\\\"selected\\\");\\n }\\n\\n\\n // if the answer is right, score pluses 1\\n if (right === answer) {\\n isRightAnswer();\\n }\\n\\n // increment the number of questions count\\n increment(\\\"#count\\\", 1);\\n\\n $(\\\"#time\\\").html(\\\"10\\\"); // set time to the maximum\\n clearInterval(myInterval);\\n myInterval = setInterval(timer, 1000); // time click each 1 second\\n score(); // show the score and question number\\n\\n ajax_get_json();\\n}\",\n \"function nextQuestion() {\\n questionsIndex++\\n console.log(\\\"click worked!\\\")\\n\\n if (questionsIndex === questions.length) {\\n endQuiz()\\n } else {\\n generateQuestion()\\n }\\n\\n}\",\n \"function doneWeaponsQuestSponsor() {\\n\\tconsole.log(totalStages);\\n\\tif(totalStages == 0) {\\n\\t\\t$('body').off('click');\\n\\t\\tdocument.getElementById('doneQuest').style.display = \\\"inline\\\";\\n\\t\\tdoneQuestSetup();\\n\\t\\treturn;\\n\\t}\\n\\t$('body').off('click');\\n\\tsetupQuestRound();\\n\\tdocument.getElementById('doneQuest').style.display = \\\"none\\\";\\n}\",\n \"function nextQuestion() {\\n resetTime();\\n setTimeout(function() {\\n clearScreen();\\n answersQuestionPrint();\\n }, 3000);\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n rating_end_time = Date.now();\\n trial.rating_rt = rating_end_time - rating_start_time;\\n\\n trial.rating = choice;\\n\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#jspsych-html-button-response-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\\n for(var i=0; iWaiting 5 seconds to go next!\\\");\\n\\n wrongAnswerCount++;\\n $(\\\"#wrong-answers-view\\\").html(wrongAnswerCount);\\n\\n stop();\\n waitBeforeGoingNextAutomatically();\\n}\",\n \"function nextQuestion() {\\n countDown = 10;\\n clearInterval(timer);\\n currQuestion++;\\n displaymyQuestion();\\n\\n\\n}\",\n \"function fiveSecondBreak() {\\n $(`#answers button[index=${qsAndAs[questionIndex].correctIndexAnswer}]`).removeClass(`btn-outline-dark`).addClass(`btn-success`);\\n \\n var startdown = 6;\\n var intervalId;\\n \\n if(guesses[questionIndex] == qsAndAs[questionIndex].correctIndexAnswer) {\\n score++;\\n $('.score').html(`
Correct Answers: ${score}
`)\\n }else{\\n $(`#answers button[index=${guesses[questionIndex]}]`).removeClass(`btn-outline-dark`).addClass(`btn-danger`);\\n $('.score').html(`Correct Answers: ${score}
`)\\n }\\n \\n function lilBreak() {\\n clearInterval(intervalId);\\n intervalId = setInterval(decrement, 1000);\\n }\\n function decrement() {\\n startdown--;\\n console.log(\\\"QIndex : \\\" + (parseInt(questionIndex) + 2));\\n console.log(\\\"qsAndAs.length: \\\" + qsAndAs.length); \\n console.log((parseInt(questionIndex) + 2) === qsAndAs.length);\\n if((parseInt(questionIndex) + 2) < qsAndAs.length){\\n $('.next').html(`Next question in ${startdown}
`);\\n }if((parseInt(questionIndex) + 2) === qsAndAs.length){\\n $('.next').html(`Last question in ${startdown}
`);\\n }if((parseInt(questionIndex) + 1) === qsAndAs.length){\\n $('.next').html(`Trivia Game Over - Calculating...
`);\\n }if (startdown === 0) {\\n breaksOver(); \\n } \\n }\\n function breaksOver() {\\n clearInterval(intervalId);\\n questionIndex += 1;\\n $('.next').text(``);\\n $(`button.answer`).removeClass(`btn-success btn-danger`).addClass(`btn-outline-dark`);\\n if(questionIndex >= qsAndAs.length) {\\n gameOver();\\n clearInterval(intervalId);\\n }else{\\n start();\\n } \\n }\\n lilBreak();\\n}\",\n \"function checkEndGame() {\\n if (questionNum == 15) {\\n clearInterval(countDown);\\n $('#sectionQuestions').addClass('hidden');\\n $('#sectionResults').removeClass('hidden');\\n $('#feedback').html('Game Over!!');\\n $('#feedbackDetail').html(\\\"You got \\\" + correctCounter + \\\" questions right, \\\" + incorrectCounter + \\\" questions wrong, and didn't answer \\\" + timeoutCounter + \\\" questions at all.\\\");\\n };\\n }\",\n \"function endQuiz() {\\n //calculate final score\\n score = Math.max((timer * 10).toFixed(), 0);\\n timer = 0;\\n $timer.text(\\\"Timer: \\\" + timer.toFixed(1));\\n //stop the timer\\n clearInterval(interval);\\n //write the end message, buttons, and scores\\n setEndDOM();\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.button = choice;\\n response.rt = rt;\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#jspsych-html-click-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.jspsych-html-click-button button');\\n for(var i=0; iThe correct answer is \\\" + questions[currentQuestionToPlay].correctResponse + \\\".
Waiting 5 seconds to go next!\\\");\\n\\n timeoutCount++;\\n $(\\\"#timeout-view\\\").html(timeoutCount);\\n waitBeforeGoingNextAutomatically();\\n}\",\n \"function timeRunsOut() {\\n noAnswer++;\\n console.log(noAnswer);\\n $(\\\".timer\\\").hide();\\n $(\\\".question\\\").empty();\\n $(\\\".answers\\\").empty();\\n $(\\\".results\\\").html(\\\"\\\" + \\\"
You got \\\" + correct + \\\" out of \\\" + questions.length + \\\" questions correct!\\\");\\n }\\n\\n //calls displayQuestions\\n stopwatch.stop();\\n displayQuestions();\\n }\",\n \"function timeLimit() {\\n timer = setInterval(function () {\\n $(\\\"#clock\\\").css(\\\"animation\\\", \\\"none\\\");\\n $(\\\"#timer\\\").text(\\\"Time left: \\\" + seconds);\\n seconds--;\\n\\n if (seconds < 5) {\\n $(\\\"#clock\\\").css(\\\"animation\\\", \\\"pulse 5s infinite\\\");\\n }\\n\\n if (seconds === -1 && click < questions.length) {\\n seconds = 15;\\n click++;\\n incorrect++;\\n clearTimeout(timer);\\n showAnswer();\\n }\\n else if (click === questions.length) {\\n displayScore();\\n }\\n }, 1000);\\n }\",\n \"function chooseFoodQuiz() {\\n $(foodQuiz).click();\\n questions = foodQuestions;\\n finalQuestion = foodQuestions.length - 1;\\n startQuiz();\\n}\",\n \"function startSurvey(element){\\r\\n //Starts timer\\r\\n setInterval(startTimer, 1000);\\r\\n //Hides the button you clicked to start the survey\\r\\n hideStart(element);\\r\\n //Starts the survey, showing the first question\\r\\n startQuiz();\\r\\n}\",\n \"function quizEnd() {\\n /*\\n @TODO: write your function code here\\n */\\n clearInterval(timerId);\\n finalScore.textContent= score;\\n questionsEl.setAttribute(\\\"class\\\", \\\"hide\\\");\\n choicesEl.setAttribute(\\\"class\\\",\\\"hide\\\");\\n endScreen.removeAttribute(\\\"class\\\");\\n endScreen.setAttribute(\\\"style\\\",\\\"text-align:center\\\")\\n}\",\n \"function countDown() {\\n timeRemaining--;\\n $('#timeCount').text(timeRemaining);\\n if (timeRemaining <= 0 && count === 10) {\\n clearInterval(time);\\n answered.push(\\\"0\\\")\\n finalScreen();\\n } else if (timeRemaining <= 0) {\\n clearInterval(time);\\n answered.push(\\\"0\\\");\\n loadingScreen();\\n }\\n}\",\n \"function TimeoutNextClickCheck(tot) {\\n\\tif(IsRadioClick==false) {\\n// BMOD: use confirm instead of alert\\n//\\t\\talert(\\\"You did not click on an answer\\\");\\n//\\t\\treturn false;\\n\\t\\tif(!confirm(\\\"Proceed without answer?\\\")) {\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n//\\talert(\\\"new func\\\");\\n\\tvar checked = 0;\\n\\tfor(nn = 0; nn < tot; nn++) {\\n\\t\\tif(document.QuestionForm.pre_answer[nn].checked) {\\n\\t\\t\\tdocument.QuestionForm.answer.value = document.QuestionForm.pre_answer[nn].value;\\n\\t\\t\\tchecked = 1;\\n\\t\\t}\\n//\\t\\talert(checked + \\\":\\\" + document.QuestionForm.pre_answer[nn].value);\\n\\t}\\n\\tif(checked == 0) {\\n\\t\\tdocument.QuestionForm.answer.value = document.QuestionForm.timeout_answer.value;\\n\\t}\\n\\treturn true;\\n}\",\n \"finishQuestion() {\\n this.stoptimer();\\n this.allowAnwsers = false;\\n this.scorePlayers();\\n //show results\\n this.generateRoundup().then((state) => {\\n this.masters.forEach((socket) => {\\n socket.emit('roundup', state);\\n });\\n });\\n\\n //nextquestion\\n if (this.timer === null) {\\n this.timer = setTimeout(() => {\\n this.nextQuestion();\\n }, 10 * 1000); //after 10s\\n }\\n }\",\n \"function handleClick(e){\\n Product.current = [];\\n Product.click++;\\n for(let i = 0; i < Product.all.length; i++){\\n if(e.target.alt === Product.all[i].name){\\n Product.all[i].timesClick++;\\n updateChartArrays();\\n }\\n }\\n runSurvey();\\n}\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.button = choice;\\n response.rt = rt;\\n\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.jspsych-html-button-response-button button');\\n for(var i=0; iCorrect: \\\" + correct + \\\"Wrong: \\\" + incorrect + \\\"
Trivia written by Glen Weldon for NPR podcast 'Pop Culture Happy Hour.' Weldon is the author of 'The Caped Crusade: Batman and the Rise of Nerd Culture.'
\\\");\\n\\t\\t$(\\\".choice\\\").hide();\\n\\t\\t$(\\\"#startBtn\\\").show();\\n\\t}\\n\\t}\",\n \"function endTracking() {\\n tryingToTrack = false;\\n timeCounter = 0;\\n\\n $(\\\"#stopTrackingMe\\\").css({\\n \\\"display\\\": \\\"none\\\"\\n });\\n $(\\\"#extendTrackingMe\\\").css({\\n \\\"display\\\": \\\"none\\\"\\n });\\n $(\\\"#extendTrackingMe\\\").on('click', () => {\\n alert(\\\"Timer set to 30 mins\\\")\\n });\\n $(\\\"#startTrackingMe\\\").css({\\n \\\"display\\\": \\\"inline-block\\\"\\n });\\n }\",\n \"function nextQuestion() {\\n if (questionCounter < questions.length) {\\n time = 15;\\n $(\\\"#gameScreen\\\").html(\\\"You have \\\" + time + \\\" seconds left!
\\\");\\n questionContent();\\n timer();\\n userTimeout();\\n }\\n else {\\n resultsScreen();\\n }\\n\\n }\",\n \"function nextQuestion() {\\n\\t\\tif (questionCounter < questions.length) {\\n\\t\\t\\ttime = 15;\\n\\t\\t\\t$(\\\".gameScreen\\\").html(\\\"You have \\\" + time + \\\" seconds left!
\\\");\\n\\t\\t\\tquestionContent();\\n\\t\\t\\ttimer();\\n\\t\\t\\ttimesUp();\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tresultsScreen();\\n\\t\\t}\\n\\t}\",\n \"function goToLastQuestion(){ \\r\\n\\tcount--\\r\\n\\tupdateItems();\\r\\n}\",\n \"function nextQuestion(event) {\\n\\n\\n // condition uses click event to add to user score if correct ansser is made //\\n if (event.target.value === questions[currentQuesIndex].correctAns) {\\n score++;\\n } else {\\n time -= 5;\\n counter.textContent = time + \\\" Seconds left on quiz.\\\";\\n }\\n\\n\\n\\n // Condition executes next question\\n if (currentQuesIndex < questions.length) {\\n currentQuesIndex++;\\n // moves to next section once condition is met\\n } if (currentQuesIndex === questions.length) {\\n\\n quizEl.style.display = \\\"none\\\";\\n // this function call takes user to results section\\n quizResults();\\n return;\\n\\n }\\n showQuestion();\\n}\",\n \"function nextQuestion() {\\n if (questionCounter < questions.length)\\n { time = 10;\\n $(\\\"#gameScreen\\\").html(\\\" You have \\\" + time + \\n \\\" seconds left!
\\\");\\n questionContent();\\n timer();\\n userTimeout();\\n \\n }\\n \\n else {\\n resultsScreen();\\n }\\n\\t}\",\n \"function incorrect() {\\n timeLeft -=20;\\n nextQuestion();\\n}\",\n \"function tally() {\\r\\n alert('You are have reached the end of the game! Your answers gave you a cool rating of: ' + correct);\\r\\n alert('Explore the rest of the page to check out more about me that wasn\\\\'t included in the game!');\\r\\n\\r\\n }\",\n \"function checkGameEnd() {\\n if(count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function() {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function checkGameEnd() {\\n if(count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function() {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.choice = data.prompt_type == \\\"count\\\" ? parseInt(choice) : choice;\\n response.rt = rt;\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#scene-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.scene-choice-button button');\\n for(var i=0; i {\\r\\n if (indexNumber <= 9) {\\r\\n NextQuestion(indexNumber)\\r\\n }\\r\\n else {\\r\\n handleEndGame()\\r\\n }\\r\\n resetOptionBackground()\\r\\n\\t\\t\\r\\n }, 1000);\\r\\n\\t\\r\\n\\t\\r\\n}\",\n \"function collectedDone() { //Collection of functions meant to run when you press the Done-button in the quiz.\\n correctAnswers();\\n roundsPlayed();\\n collectedRights();\\n collectedWrongs()\\n correctPercentage();\\n controlChildrenTabIndexMinus() \\n}\",\n \"function askNextQuestion(){ \\n $('.questions').on('click', '.submit-next', function(){\\n currentQuestion++; \\n if (currentQuestion > QUESTIONS.length-1){\\n showFinalResult();\\n }else{\\n console.log('next question asked');\\n resetOptions();\\n renderQuestion();\\n updateProgress();\\n $('.submit-answer').removeClass('hidden');\\n $('.submit-next').addClass('hidden');\\n } \\n });\\n}\",\n \"function checkGameEnd() {\\n if (count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function () {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function wait() {\\n\\tif (questionCounter < 7) {\\n\\tquestionCounter++;\\n\\tgenerateHTML();\\n\\tcounter = 30;\\n\\ttimerWrapper();\\n\\t}\\n\\telse {\\n\\t\\tfinalScreen();\\n\\t}\\n}\",\n \"function timingQuestion() {\\n \\n displayQuestionAndListenForInput();\\n\\n\\n if (count == questionArr.length + 1) {\\n clearInterval(intervalid);\\n clearInterval(timeIntervalID);\\n $(\\\"#timer-id\\\").empty();\\n $(\\\"main\\\").empty();\\n\\n \\n $(\\\"main\\\").append(\\\"Correct Answers: \\\" + correctAnswer + \\\"
\\\");\\n $(\\\"main\\\").append(\\\"Wrong Answers: \\\" + wrongAnswer + \\\"
\\\");\\n $(\\\"main\\\").append(\\\"Missed Answers: \\\" + missedAnswer + \\\"
\\\");\\n\\n time = 30;\\n clicked = false;\\n count =0;\\n correctAnswer = 0;\\n wrongAnswer = 0;\\n missedAnswer = 0;\\n\\n $(\\\"main\\\").append(\\\"\\\");\\n $(\\\"#start-button\\\").on(\\\"click\\\", timingQuestion);\\n }\\n }\",\n \"function correctAnswer(){\\n $(\\\"#timer\\\").text(\\\"You are correct!\\\"); \\n if (clickCount == 0) {\\n correct++;\\n }; \\n clickCount++; //used to prevent multiple clicks adding to the total amount\\n clearInterval(timeInterval); \\n roundEnd();\\n $(\\\"button\\\").remove(); //used to remove previous events from existing buttons\\n $(\\\"#choice-container\\\").html('')\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.64227456","0.6413096","0.6383165","0.6315035","0.61615896","0.6158293","0.6154531","0.61421865","0.61421865","0.6108407","0.60826856","0.60767287","0.6074042","0.6061887","0.60602075","0.6058682","0.60495466","0.6020223","0.6019584","0.60044336","0.5961336","0.5948536","0.5941623","0.5940533","0.5930909","0.5922732","0.5918794","0.5917989","0.5916928","0.59047616","0.59028244","0.5901223","0.59007424","0.5899033","0.5888634","0.58700985","0.58596915","0.58575135","0.5834327","0.58333564","0.58283097","0.58141315","0.5812859","0.5809388","0.5805613","0.58001727","0.5798387","0.57858586","0.57813084","0.57790124","0.5776532","0.5774767","0.57726187","0.57705057","0.5762136","0.5744722","0.5743024","0.57420653","0.5737513","0.5737474","0.57348746","0.572924","0.57273334","0.5726199","0.57247525","0.57216424","0.57031","0.5702565","0.5701889","0.5698703","0.56970567","0.5694414","0.56874555","0.5686841","0.56852555","0.567838","0.5674172","0.56570846","0.5655508","0.5654415","0.56490713","0.5644633","0.5635947","0.5631291","0.5627927","0.56263185","0.5623375","0.5619338","0.5615136","0.561425","0.561425","0.5613537","0.5613175","0.5610761","0.5610715","0.56096053","0.5608574","0.56063783","0.56061655","0.5602974"],"string":"[\n \"0.64227456\",\n \"0.6413096\",\n \"0.6383165\",\n \"0.6315035\",\n \"0.61615896\",\n \"0.6158293\",\n \"0.6154531\",\n \"0.61421865\",\n \"0.61421865\",\n \"0.6108407\",\n \"0.60826856\",\n \"0.60767287\",\n \"0.6074042\",\n \"0.6061887\",\n \"0.60602075\",\n \"0.6058682\",\n \"0.60495466\",\n \"0.6020223\",\n \"0.6019584\",\n \"0.60044336\",\n \"0.5961336\",\n \"0.5948536\",\n \"0.5941623\",\n \"0.5940533\",\n \"0.5930909\",\n \"0.5922732\",\n \"0.5918794\",\n \"0.5917989\",\n \"0.5916928\",\n \"0.59047616\",\n \"0.59028244\",\n \"0.5901223\",\n \"0.59007424\",\n \"0.5899033\",\n \"0.5888634\",\n \"0.58700985\",\n \"0.58596915\",\n \"0.58575135\",\n \"0.5834327\",\n \"0.58333564\",\n \"0.58283097\",\n \"0.58141315\",\n \"0.5812859\",\n \"0.5809388\",\n \"0.5805613\",\n \"0.58001727\",\n \"0.5798387\",\n \"0.57858586\",\n \"0.57813084\",\n \"0.57790124\",\n \"0.5776532\",\n \"0.5774767\",\n \"0.57726187\",\n \"0.57705057\",\n \"0.5762136\",\n \"0.5744722\",\n \"0.5743024\",\n \"0.57420653\",\n \"0.5737513\",\n \"0.5737474\",\n \"0.57348746\",\n \"0.572924\",\n \"0.57273334\",\n \"0.5726199\",\n \"0.57247525\",\n \"0.57216424\",\n \"0.57031\",\n \"0.5702565\",\n \"0.5701889\",\n \"0.5698703\",\n \"0.56970567\",\n \"0.5694414\",\n \"0.56874555\",\n \"0.5686841\",\n \"0.56852555\",\n \"0.567838\",\n \"0.5674172\",\n \"0.56570846\",\n \"0.5655508\",\n \"0.5654415\",\n \"0.56490713\",\n \"0.5644633\",\n \"0.5635947\",\n \"0.5631291\",\n \"0.5627927\",\n \"0.56263185\",\n \"0.5623375\",\n \"0.5619338\",\n \"0.5615136\",\n \"0.561425\",\n \"0.561425\",\n \"0.5613537\",\n \"0.5613175\",\n \"0.5610761\",\n \"0.5610715\",\n \"0.56096053\",\n \"0.5608574\",\n \"0.56063783\",\n \"0.56061655\",\n \"0.5602974\"\n]"},"document_score":{"kind":"string","value":"0.66317606"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":81766,"cells":{"query":{"kind":"string","value":"Function to Load Images to Page"},"document":{"kind":"string","value":"function loadImages() {\n if (surveyLength > 24) {\n surveyEnd();\n }\n\n lastIndex = [];\n\n lastIndex.push(randomIndex1);\n lastIndex.push(randomIndex2);\n lastIndex.push(randomIndex3);\n\n //Re-assigning the variables for each picture\n randomIndexGenerator();\n\n //While loop to prevent double choices AND no prior choice repeats\n while (randomIndex1 === lastIndex[0] || randomIndex1 === lastIndex[1] || randomIndex1 === lastIndex[2] || randomIndex2 === lastIndex[0] || randomIndex2 === lastIndex[1] || randomIndex2 === lastIndex[2] || randomIndex3 === lastIndex[0] || randomIndex3 === lastIndex[1] || randomIndex3 === lastIndex[2] || randomIndex1 === randomIndex2 || randomIndex1 === randomIndex3 || randomIndex2 === randomIndex3) {\n randomIndexGenerator();\n }\n //Makes leftImg's src property equal to the fileName of the indexed item\n leftImg.src = catalogArray[randomIndex1].filePath;\n centerImg.src = catalogArray[randomIndex2].filePath;\n rightImg.src = catalogArray[randomIndex3].filePath;\n\n //Adds 1 to the display tally property of the indexed object\n catalogArray[randomIndex1].tallyDisplayed += 1;\n catalogArray[randomIndex2].tallyDisplayed += 1;\n catalogArray[randomIndex3].tallyDisplayed += 1;\n\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function loadImages() {\n\t\t const button = document.querySelector('#loadImages');\n\t\t const container = document.querySelector('#image-container');\n\n\t\t button.addEventListener(\"click\", (event) => {\n\n\t\t const images = imageNames();\n\t\t images.forEach((image) => {\n\t\t requestFor(image, container).then(imageData => {\n\t\t const imageElement = imageData.imageElement;\n\t\t const imageSrc = imageData.objectURL;\n\t\t imageElement.src = imageSrc;\n\t\t });\n\t\t });\n\t\t });\n\t\t}","function load_images() {\n data.each(function(frame) {\n var imgs = []\n frame.images.each(function(imgstr) {\n var img = new Image(IMG_WIDTH, IMG_HEIGHT);\n img.src = \"/img/\" + imgstr;\n img.style.float = \"left\";\n imgs.push(img); \n });\n frame['imageobjs'] = imgs;\n }) \n }","function getImages() {\n\t$.get(\"resources/get_images.php\", {\"page\": globalPage}).success(function(data) {\n\t\tglobalPage++;\n\t\t\n\t\tvar imgz = JSON.parse(data).images;\n\t\tgenerateThumbnails(imgz);\n\t\tgenerateShowMoreButton(imgz);\n\t}).fail(function() {\n\t\twindow.location.replace(\"index.php\");\n\t});\n}","function renderImages() {\n $('.landing-page').addClass('hidden');\n $('.img-round').removeClass('hidden');\n updateSrcs();\n currentOffset+=100;\n }","function start_loadImages()\n {\n methods.loadImages(\n function() {\n methods.getDataURI();\n run_app();\n },\n imagesRack.imgList\n );\n }","function loadImages() {\r\n new Image('(\"Robot\") Bag','/images/bag.jpg', 0);\r\n new Image('Bathroom Phone Holder','/images/bathroom.jpg', 0);\r\n new Image('Breakfast Maker','/images/breakfast.jpg', 0);\r\n new Image('Meatball Bubblegum','/images/bubblegum.jpg', 0);\r\n new Image('Chair','/images/chair.jpg', 0);\r\n new Image('Cthulhu','/images/cthulhu.jpg', 0);\r\n new Image('Duck Mask','/images/dog-duck.jpg', 0);\r\n new Image('Dragon','/images/dragon.jpg', 0);\r\n new Image('U-Pensils','/images/pen.jpg', 0);\r\n new Image('Pet Sweep','/images/pet-sweep.jpg', 0);\r\n new Image('Pizza Scissors','/images/scissors.jpg', 0);\r\n new Image('Shark Blanket','/images/shark.jpg', 0);\r\n new Image('Baby Sweep','/images/sweep.png', 0);\r\n new Image('TaunTaun Sleepingbag','/images/tauntaun.jpg', 0);\r\n new Image('Unicorn Meat','/images/unicorn.jpg', 0);\r\n new Image('USB','/images/usb.gif', 0);\r\n new Image('Water Can','/images/water-can.jpg', 0);\r\n new Image('Wine Glass','/images/wine-glass.jpg', 0);\r\n new Image('boots', '/images/boots.jpg', 0);\r\n new Image('banana','/images/banana.jpg', 0);\r\n }","function loadAllImages() {\n var images = document.querySelectorAll('img[data-src]');\n\n for (var i = 0; i < images.length; i++) {\n ImageLoader.load(images[i]);\n }\n }","function loadImages() {\n $('img[data-src]').each(function () {\n var src = $(this).data('src');\n var style = $(this).data('style');\n $(this).attr('src', src);\n $(this).attr('style', style);\n });\n}","function loadImages() {\n var files = [ 'outer_light.png', 'layer_down_light.png',\n 'layer_up_light.png', 'angle_prev_light.png',\n 'angle_next_light.png', 'linked_data_light.png',\n 'raw_scan_light.png', 'dig_positive_light.png',\n 'text_view_light.png', 'vector_view_light.png',\n 'overlays_light.png', 'thumbnails_light.png',\n '3d_view_light.png', 'step_back_light.png',\n 'step_fwd_light.png', 'minimize_light.png' ];\n\n var i = 0;\n for (i = 0; i < files.length; i++) {\n btnImages[i] = new Image(); btnImages[i].src = files[i];\n }\n}","function findImagesToLoad() {\n\tsetLazyImagePositions.call(this);\n\tconst imagesToLoad = getImagesInView(this.images);\n\tloadImages.call(this, imagesToLoad);\n}","function LoadImages()\n{\n\tvar loadedImages = 0;\n\tvar numImages = 0;\n\tfor (var src in ImgList)\n\t{\n\t\tnumImages++;\n\t}\n\tfor (var src in ImgList)\n\t{\n\t\tImgs[src] = new Image();\n\t\tImgs[src].onload = function()\n\t\t{\n\t\t\tloadedImages = loadedImages +1;\n\t\t\tif(loadedImages >= numImages)\n\t\t\t{\n\t\t\t\t//Finished loading!\n\t\t\t\ttstsetup();\n\t\t\t\tImgsFinished = 1;\n\t\t\t}\n\t\t};\n\n\t\tif (src < 6)\n\t\t{\n\t\t\tImgs[src].src = ImgList[src];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tImgs[src].src = ImgURL + ImgList[src];\n\t\t}\n\t}\n}","function fetchImages() {\n $.getJSON(\"/images.php\", function(data) {\n preloadImages(data);\n }); \n }","function loadImages() {\n bsImage = new Image();\n bsImage.src = \"resources/resources/images/spritesheets/buttons_1.png\";\n wallImag = new Image();\n wallImag.src = \"resources/resources/images/spritesheets/jungle_wall.png\";\n ssImage = new Image();\n ssImage.src = \"resources/resources/images/spritesheets/sprites_final.png\";\n window.setTimeout(setup, 1500);\n aImage = new Image();\n aImage.src = \"resources/resources/images/spritesheets/uparr.png\"\n}","function loadImages(div){\r\n\tvar images = [];\r\n\tjQuery.each(jQuery(div+' img'), function(i,img){\r\n\t\tif(!jQuery(img).attr('src') || jQuery(img).attr('src')==''){\r\n\t\t\timages.push(img);\r\n\t\t}\r\n\t});\r\n\tjQuery(images).each( function(i,image) {\r\n\t\tjQuery(this).attr('src',jQuery(this).attr('longdesc'));\r\n\t});\r\n}","function loadImage() {\n var baseUrl = 'https://source.unsplash.com/category';\n var category = 'nature';\n var size = '1920x1080';\n\n var source = baseUrl + '/' + category + '/' + size;\n\n buildElement(source)\n .then(render);\n }","function loadImages() {\r\n var files = document.getElementById('images').files, i, file, reader;\r\n for (i = 0; i < files.length; i = i + 1) {\r\n file = files[i];\r\n if (file.name.endsWith(\".jpg\") || file.name.endsWith(\".gif\") || file.name.endsWith(\".png\")) {\r\n images.push(file);\r\n }\r\n }\r\n if (images.length > 0) {\r\n showLoadedImages(\"list\");\r\n } else {\r\n alert(\"No images found. Try another directory.\");\r\n }\r\n }","function loadVisiblePages() {\n // Fetch page images that are currently shown on the site\n var firstVisibleImageLinks = $('#imageList li>a').not('.page-text').withinviewport();\n $.each(firstVisibleImageLinks, function(index, aEl) {\n var imgEl = $(aEl).find('img');\n // Check if the image is already loaded\n if( $(imgEl).attr('src') !== '' )\n return;\n\n // Load page images via Ajax\n $.get( \"ajax/image/page\", { \"imageId\" : globalImageType, \"pageId\" : $(aEl).attr('data-pageid'), \"width\" : 150 } )\n .always(function( data ) {\n // Remove broken image icon first\n var nextEl = $(imgEl).next();\n if( nextEl.length !== 0 ) {\n $(nextEl).remove();\n }\n })\n .done(function( data ) {\n $(imgEl).attr('src', \"data:image/jpeg;base64, \" + data);\n })\n .fail(function( data ) {\n $(imgEl).after('broken_image');\n });\n });\n}","function loadImage() {\n\n // image file not loaded yet? => load image file\n if ( !resource ) jQuery( '' );\n\n // immediate perform success callback\n success();\n\n }","function loadImages() {\n\t// for each image container\n\t$('.image-container').each(function() {\n\t\t// get medium-sized image filename\n\t\tvar img_filename = $('img', $(this)).attr('data-imglarge')\n\t\tvar img_med_filename = img_filename.substring(0, img_filename.indexOf('.png')) + '_medium.jpg'\n\n\t\t// // load medium-sized image\n\t\t// var imgLarge = new Image()\n\t\t// $(imgLarge).addClass('artwork')\n\t\t// \t.attr('src', img_med_filename)\n\t\t// \t.attr('data-imglarge', img_filename)\n\t\t// \t.attr('alt', $('.placeholder', $(this)).attr('alt'))\n\t\t// \t.on('load', () => {\n\t\t// \t\t$(imgLarge).addClass('loaded')\n\t\t// \t})\n\t\t// $(this).append($(imgLarge))\n\n\t\t// update placeholder image src\n\t\t$('.placeholder', $(this)).attr('src', img_med_filename)\n\t\t\t.attr('data-imglarge', img_filename)\n\t\t\t.css('filter', 'none')\n\t})\n\tconsole.log('window loaded!')\n}","function loadImages (){\n var img = [\n 'src/Barba Garcia, Francisco.jpg',\n 'src/Barba Rodriguez, Arturo.jpg',\n 'src/Caro Bernal, Miguel Angel.jpg',\n 'src/Castillo Peña, José Luis.jpg',\n 'src/Cruz Vidal, Alejandro.jpg',\n 'src/Gallego Martel, Jose Maria.jpg',\n 'src/Garci Peña, José Joaquín.jpg',\n 'src/Vazquez Rodriguez, Maria del Mar.jpg',\n ];\n\n setImgs(shuffle(initImgs(img)));\n}","function loadImages() {\n floor = new Image();\n background = new Image();\n ring = new Image();\n platform = new Image();\n\n floor.src = './tile-images/floorpath.png';\n background.src = './tile-images/plainbackgroundtile.png';\n ring.src = './tile-images/ring.png';\n platform.src = './tile-images/platform.png';\n}","function display_advertise_images() {\n}","function refreshImages() {\n var images = document.querySelectorAll('img[data-src]');\n\n for (var i = 0; i < images.length; i++) {\n ImageLoader.load(images[i]);\n }\n }","function loadImages(){\n prev_btnj.addClass('loading')\n next_btnj.addClass('loading')\n fs.readdir(dirname, (err, files) => {\n if (!err){\n images = files.filter(isImage)\n curIndex = images.indexOf(basename)\n prev_btnj.removeClass('loading')\n next_btnj.removeClass('loading')\n setBtn()\n }\n })\n}","function loadImages() {\n testPattern = new Image();\n testPattern.src = \"testpattern.gif\";\n }","function loadImages() {\r\n\t\tremoveUnseenImages();\r\n\t\tvar sets = $['mapsettings'];\r\n\t\tvar range = getPixelRange();\r\n\t\tfor(var i=range.start.x; i![]()
').attr({\n id: \"image\" + i,\n src: config.imgDir + i + config.imgFormat,\n title: \"Image\" + i\n }).appendTo(\"#\" + config.imgContainer);\n }\n }","function preloadImages() {\n\tidList.forEach(function(id) {\n\t\tlet $newImage = $('#image-preloader').clone();\n\t\t$newImage.attr('src', `${ART_URL}${id}.png`);\n\t\t$('#image-preloader-container').append();\n\t});\n}","function loadImage() {\n var baseUrl = 'https://source.unsplash.com/category',\n cat = 'nature',\n size = '1920x1080';\n\n buildElement(`${baseUrl}/${cat}/${size}`).then(render);\n }","function getImages() {\n alert(\"Page will reload once images are finished loading\");\n // runs 1540photo.py, which collects images from Gmail\n exec(\"python 1540photo.py\");\n loaded_images_from_tba = 0;\n // for each team, loads media\n for (let team_id in teams) {\n loadMediaFromTBA(teams[team_id]);\n }\n // gets local files\n let local_dir = fs.readdirSync(\"./data/images/\");\n for (let team_id in local_dir) {\n try {\n let file = local_dir[team_id];\n if (manifest_images.indexOf(file) < 0) {\n manifest_images.push(file);\n }\n } catch (_) {}\n }\n // checks to see if all images are loaded, and saves a manifest if true\n window.setInterval(saveImageManifest, 3000);\n}","function renderImages() {\n imgElem.src = Actor.all[0].path;\n}","function loadImages(atlas)\n\t\t{\n\t\t\tdataAtlas = atlas.tiles;\n\t\t\tplayerAtlas = atlas.player;\n\n\t\t\tlet images = [\"img/Tiles/sheet.png\", \"img/Player/p1_spritesheet.png\"];\n\t\t\tlet imgsPromises = images.map (function (url)\n\t\t\t{\n\t\t\t\treturn new Promise ( (ok, error) => {\n\t\t\t\t\tvar img = new Image();\n\t\t\t\t\timg.src = url;\n\t\t\t\t\timg.onload = () => ok(img);\n\t\t\t\t});\n\t\t\t});\n\t\t\treturn (Promise.all(imgsPromises))\n\t\t}","preloadImages(doload, callback) {\n\t\tconst paths = this.getImagePaths();\n\t\tfor (let i = 0; i < paths.length; i++) {\n\t\t\tgraphics.add(paths[i]);\n\t\t}\n\t\tif (doload) {\n\t\t\tgraphics.load(callback);\n\t\t}\n\t}","function ImageController(){\n\t\tvar imageService = new ImageService()\n\t\t$.get(window.location.pathname + '-image-tag.html', function(data){\n\t\t\t$('.main-container').append(data)\n\t\t})\n\t\timageService.getImage(function(imageData){\n\t\t\t$('body').css('background-image', `url(\"${imageData.url}\")`);\n\t\t\tconsole.log(imageData.large_url)\n\t\t\t$('.image-link').attr('href', imageData.large_url!==null? imageData.large_url : imageData.url)\n\t\t})\n\t}","function loadImg(){\n document.productImg.src = myImgSrc + myImg[i] + myImgEnd;\n}","function loadImage() {\n\t\t$('div.thumbnail a img').on('click', function(){\n\t\t\tvar image = this.src;\n\t\t\t$('.image-load').html('');\n\t\t});\n\t}","function loadImage(imageName, imageLocation)\n{\nif (document.images) document.images[imageName].src = imageLocation;\nreturn true;\n}","function Load_Page(CurrentImageID){\r\n\t\r\n\t\r\n\tvar Image_Number = Loaded_Images[CurrentImageID].number;\r\n\tvar Image_Page = Loaded_Images[CurrentImageID].page\r\n\t\r\n\t// Checks which page direction and if it's the end of the list.\r\n\t\r\n\t// Going towards the left\r\n\tvar backPaging = (Image_Number <= 1 && Image_Page > 1)\r\n\tvar FrontWall = (Image_Page == FirstPage)\r\n\t\r\n\t// Going towards the right\r\n\tvar forwardPaging = (Image_Number >= ImagesPerPage && Image_Page >= 1)\r\n\tvar RearWall = (Image_Number < ImagesPerPage && Image_Page == LastPage)\r\n\tif(backPaging && !FrontWall){\r\n\t\tvar PageSelect = Image_Page-1\r\n\t\t// console.debug('backpaging')\r\n\t}else if(forwardPaging && !RearWall){\r\n\t\tvar PageSelect = Image_Page+1\r\n\t\t// console.debug('forwardPaging')\r\n\t}else{\r\n\t\t// console.debug('wall')\r\n\t\tPageSelect = Image_Page\r\n\t};\r\n\r\n\t\r\n\t\r\n\t// Takes the requested page and converts into a URL string to load.\r\n\tif(backPaging || forwardPaging){\r\n\t$nav_thumb_img.show();\r\n\tPageSelect -= 1\r\n\tPageSelect = PageSelect*ImagesPerPage\r\n\t\r\n\tif(document.URL.indexOf('pid=') > -1){\r\n\t\tvar requestURL = document.URL.replace(/pid\\=[0-9]{1,}/,'pid='+PageSelect);\r\n\t}else{\r\n\t\tvar requestURL = document.URL+'&pid='+PageSelect;\r\n\t};\r\n\t// console.debug(requestURL+' Loading...')\r\n\tGM_xmlhttpRequest({\r\n\t\tmethod: \"GET\",\r\n\t\turl: requestURL,\r\n\t\tonload: function(retour) {\r\n\t\t\t// console.debug(retour)\r\n\t\t\t$nav_thumb_img.hide();\r\n\t\t\tResponseHTML = $(retour.responseText);\r\n\t\t\tvar ImageNumber = 0\r\n\t\t\t$('.content span.thumb', ResponseHTML).each(function(){\r\n\t\t\t\r\n\t\t\t\tvar $this_span = $(this)\r\n\t\t\t\tvar ImageID = $this_span.attr('id');\r\n\t\t\t\tvar ImageThumb = $('img.preview' ,$this_span).attr('src');\r\n\t\t\t\tvar ImageTags = $('img.preview' ,$this_span).attr('alt');\r\n\t\t\t\tvar ImagePage = parseInt($('#paginator .pagination b', ResponseHTML).text());\r\n\t\t\t\tvar ImageMain = ImageThumb.replace('thumbnail_','').replace(\"/r34/thumbnails/\",'//images/').replace(\"/rule34/thumbnails/\",'/rule34//images/')\r\n\t\t\t\tvar ImageLink = $('a[href^=\"'+Setting_ImageLinkBegins+'\"]',$this_span).attr('href');\r\n\t\t\t\t\r\n\t\t\t\t// console.debug(ImageMain);\r\n\t\t\t\t// http://cdn.rule34.xxx/r34/thumbnails/1354/thumbnail_23a69eecacb1cd8c36045e45657800e8f257e950.jpg?1411722\r\n\t\t\t\r\n\t\t\t\tImageNumber++\r\n\t\t\t\t\r\n\t\t\t\tAddImage(ImageID,ImageThumb,ImageMain,ImagePage,ImageNumber,ImageLink,ImageTags)\r\n\t\t\t\t\r\n\t\t\t});\r\n\t\t\t\r\n\t\t\tSort_images();\r\n\t\t\tvar Cur_Image_ID = $('.image_nav_content img.main_img').data('ImageId')\r\n\t\t\tvar Image_Number2 = Loaded_Images_array.indexOf(Cur_Image_ID);\r\n\t\t\tif(backPaging){\r\n\t\t\t\tImage_Number2--\r\n\t\t\t\t// console.debug('backPaging')\r\n\t\t\t}else if(forwardPaging){\r\n\t\t\t\tImage_Number2++\r\n\t\t\t\t// console.debug('forwardPaging')\r\n\t\t\t}\r\n\t\t\t// console.debug(Cur_Image_ID+' ID, Number: '+Image_Number2)\t\t\t\r\n\t\t\tNew_Image = Loaded_Images_array[Image_Number2]\r\n\t\t\t// console.debug(New_Image)\r\n\t\t\tLoadImage(New_Image);\r\n\t\t\t\r\n\t\t}\r\n\t});\r\n\t};\r\n \r\n}","function preloader() {\n\tif (document.images) {\n\t\tvar img1 = new Image();\n\t\tvar img2 = new Image();\n\t\tvar img3 = new Image();\n\t\tvar img4 = new Image();\n\n\t\timg1.src = \"./imgs/sunny.jpg\";\n\t\timg2.src = \"./imgs/sunset.jpg\";\n\t\timg3.src = \"./imgs/stars.jpg\";\n\t\timg4.src = \"./imgs/downtown.jpg\";\n\t}\n}","function preload() {\n println(\"loading images\")\n img = [loadImage(\"./assets/AmericaFirst.png\"), loadImage(\"./assets/AuditTheVote.png\"), loadImage(\"./assets/Hillary.png\"), loadImage(\"./assets/MAGA.png\"), loadImage(\"./assets/TrumpTrain.png\")];\n\n}","function lazyLoad(){\n\tvar $images = $('.lazy_load');\n\n\t$images.each(function(){\n\t\tvar $img = $(this),\n\t\t\tsrc = $img.attr('data-img');\n\t\t$img.attr('src',src);\n\t});\n}","function loadImageUrls() {\n fetch(\"https://api.imgflip.com/get_memes\")\n .then((result) => result.json())\n .then(({ data: { memes: loadedMemes } = {} }) => {\n memes = loadedMemes;\n showImage(0);\n });\n }","function loadImages(imagesToLoad) {\n\timagesToLoad.forEach(lazyImage => {\n\t\tthis.fireLazyEvent(lazyImage.image);\n\t\tlazyImage.resolved = true;\n\t});\n}","function displayPhotos() {\n loader.hidden = true;\n photos.forEach((photo) => {\n // Create Unspalsh page Link for the image\n const imageLink = document.createElement(\"a\");\n imageLink.setAttribute(\"href\", photo.links.html);\n imageLink.setAttribute(\"target\", \"_blank\");\n\n // Create image element\n const img = document.createElement(\"img\");\n img.setAttribute(\"src\", photo.urls.regular);\n img.setAttribute(\"alt\", photo.alt_description);\n img.setAttribute(\"title\", photo.alt_description);\n\n imageLink.appendChild(img);\n imageContainer.appendChild(imageLink);\n\n //event listner for image\n img.addEventListener(\"load\", imageLoaded);\n });\n}","function getLoadedImages() {\r\n return images;\r\n }","function preload(){\n images.forEach(function(elem) {\n im = new Image();\n im.src = elem;\n });\n}","function preloadImages() {\n var images = [\n 'btn_action_active.png',\n\t'btn_focus_active.png',\n 'btn_up_active.png',\n 'btn_right_active.png',\n 'btn_left_active.png',\n 'btn_down_active.png',\n 'prybar.png',\n 'machete.png',\n 'sample_dna.png',\n 'pickaxe.png',\n 'fuel.png',\n 'fire_extinguisher.png',\n 'dynamite.png',\n 'dna_sampler.png'\n ];\n $(images).each(function() {\n $('![]()
')[0].src = this;\n (new Image()).src = this;\n });\n}","function LoadSliderImages(sublist) {\n\t\t\tvar numImages = sublist.find('.item > a > .src').length;\n\t\t\tsublist.find('.item > a > .src').each(function(i) {\n\t\t\t\tvar img = new Image();\n\t\t\t\tvar imgSrc = $(this).html();\n\t\t\t\tvar imgAlt = $(this).parent().find('.alt').html();\n\t\n\t\t\t\t$(this).parent().append(img);\n\t\t\t \n\t\t\t\t// wrap our new image in jQuery, then:\n\t\t\t\t$(img).load(function () {\n\t\t\t\t\tnumImages--;\n\t\t\t\t\tif (numImages == 0) {\n\t\t\t\t\t\tSetSublist(sublist);\n\t\t\t\t\t}\n\t\t\t\t\t/*\n\t\t\t\t\tif (i == sublist.find('.item > a > .src').size() - 1) {\n\t\t\t\t\t\tSetSublist(sublist);\n\t\t\t\t\t}\n\t\t\t\t\t*/\n\t\t\t\t})\n\t\t\t\t.error(function () {\n\t\t\t\t// notify the user that the image could not be loaded\n\t\t\t\t})\n\t\t\t\t.attr('src', imgSrc).attr('alt', imgAlt);\n\t\t\t});\n\t\t}","function preloadImages() {\n\tif (document.images) {\n\t\tfor (var i = 0; i < preloadImages.arguments.length; i++) {\n\t\t\t(new Image()).src = preloadImages.arguments[i];\t\n\t\t}\n\t}\n} // end image preloader","function preload(){\r\n img=loadImage('https://upload.wikimedia.org/wikipedia/commons/8/81/Dalai_Lama_%2814566605561%29.jpg')\r\n\r\n img1=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/02/Nelson_Mandela_1994.jpg')\r\n\r\n img2=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/00/Bill_Clinton_1999_Presidential_Medal_of_Freedom_%281%29.jpg')\r\n\r\nimg3=loadImage('https://live.staticflickr.com/65535/49245065008_a7082b2a41_b.jpg')\r\n}","loadImages(): void {\n let self = this;\n let items = this.getState().items;\n for (let i = 0; i < items.length; i++) {\n let item: ItemType = items[i];\n // Copy item config\n let config: ImageViewerConfigType = {...item.viewerConfig};\n if (_.isEmpty(config)) {\n config = makeImageViewerConfig();\n }\n let url = item.url;\n let image = new Image();\n image.crossOrigin = 'Anonymous';\n self.images.push(image);\n image.onload = function() {\n config.imageHeight = this.height;\n config.imageWidth = this.width;\n self.store.dispatch({type: types.LOAD_ITEM, index: item.index,\n config: config});\n };\n image.onerror = function() {\n alert(sprintf('Image %s was not found.', url));\n };\n image.src = url;\n }\n }","function _onImageLoaded() {\n _imagesToLoad = _imagesToLoad - 1;\n if (!_imagesToLoad) {\n $$log(\"All images loaded, rendering again.\");\n PP64.renderer.render();\n }\n }","function fnLoadPngs(){\n var rslt = navigator.appVersion.match(/MSIE (\\d+\\.\\d+)/, '');\n var itsAllGood = (rslt != null && Number(rslt[1]) >= 5.5);\n \n for (var i = document.images.length - 1, img = null; (img = document.images[i]); i--){\n if (itsAllGood && img.src.match(/\\.png$/i) != null) {\n var src = img.src;\n var div = document.createElement(\"DIV\");\n \n div.style.filter = \"progid:DXImageTransform.Microsoft.AlphaImageLoader(src='\" + src + \"', sizing='scale')\"\n div.style.width = img.width + \"px\";\n div.style.height = img.height + \"px\";\n img.replaceNode(div);\n }\n \n img.style.visibility = \"visible\";\n }\n}","function pilau_preload_images() {\n\tvar args_len, i, cache_image;\n\targs_len = arguments.length;\n\tfor ( i = args_len; i--;) {\n\t\tcache_image = document.createElement('img');\n\t\tcache_image.src = arguments[i];\n\t\tcache.push( cache_image );\n\t}\n}","function addImages() {\n var images = ['heroImage', 'legacyLogo'];\n var img = null;\n for (var i = 0; i < images.length; i++) {\n var key = companyInfo['key'];\n if (companyInfo[images[i]].length > 0) {\n var url = 'https://media.licdn.com/media' + companyInfo[images[i]];\n img = $('![]()
');\n $(img).attr('src', url);\n img.data('file', null);\n img.data('name', images[i] + '-' + key);\n img.data('saved', false);\n img.data('scraped', true);\n createThumbnail(img, 'company-image-container');\n }\n }\n}","function loadCarousel() {\n var carousel_images = [\n \"/Content/icons/png/1.jpg\",\n \"/Content/icons/png/2.jpg\",\n \"/Content/icons/png/3.jpg\",\n \"/Content/icons/png/4.jpg\",\n \"/Content/icons/png/5.jpg\",\n \"/Content/icons/png/6.jpg\",\n \"/Content/icons/png/7.jpg\",\n \"/Content/icons/png/8.jpg\"];\n\n $(window).load(function () {\n $(\"#photo_container\").isc({\n imgArray: carousel_images\n });\n });\n }","function showLoadedImages(elem) {\r\n var i, span, reader, file;\r\n document.getElementById(elem).style.display = \"inline\";\r\n document.getElementById(elem).innerHTML = [];\r\n for (i = 0; i < images.length; i = i + 1) {\r\n file = images[i];\r\n reader = new FileReader();\r\n reader.onload = (function (file) {\r\n var j = i;\r\n return function (e) {\r\n span = document.createElement('span');\r\n span.className = \"tile\";\r\n span.onclick = function () {\r\n showImage(j, elem);\r\n };\r\n span.innerHTML = ['', file.name, '
', file.name, ''].join('');\r\n document.getElementById(elem).insertBefore(span, null);\r\n };\r\n })(file);\r\n reader.readAsDataURL(file);\r\n }\r\n }","function beginLoadingImage(arrayIndex, fileName, isGamePic) {\n if (isGamePic) {\n gamePics[arrayIndex] = document.createElement(\"img\");\n gamePics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\n gamePics[arrayIndex].src = \"images/\" + fileName;\n } else {\n worldPics[arrayIndex] = document.createElement(\"img\");\n worldPics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\n worldPics[arrayIndex].src = \"images/\" + fileName;\n }\n}","function preload()\n{\n dogImage=loadImage(\"images/dogImg.png\")\n happyDog=loadImage(\"images/Happy.png\")\n //bedroomImg=loadImage(\"images/Bed Room.png\")\n//gardenImg=loadImage(\"images/Garden.png\")\n//washroomImg=loadImage(\"images/Wash Room.png\")\n\t//load images here\n}","function preloadImages () {\n\tif (document.images)\n\t\t{\n\t\t\tclosed_img = new Image(11,11);\n\t\t\tclosed_img.src = \"images/closed.gif\";\n\t\t\t\n\t\t\topened_img = new Image(11,11);\n\t\t\topened_img.src = \"images/opened.gif\";\n\t\t}\n\telse {\n\t\talert (\"document.images not found!\")\n\t}\n}","function loadImages(elem) {\n if (!elem) {\n return;\n }\n\n var images = elem.getElementsByTagName('img');\n\n var n = images.length;\n for (var i = 0; i < n; i++) {\n var image = images[i];\n\n if (image.getAttribute('data-src')) {\n image.src = image.getAttribute('data-src');\n image.removeAttribute('data-src');\n }\n }\n }","function LoadContactRefs() {\n var imageObjects = $(\"img\").get();\n\n for (var i = 0; i < imageObjects.length; i++) {\n var img = imageObjects[i];\n var imageSource = $(img).attr('src');\n var sourceEnd = imageSource.substring(14, imageSource.length)\n\n switch (sourceEnd) {\n case \"github.png\": $(img).parent().attr(\"href\", \"https://github.com/captainsalt\"); break;\n case \"linkedin.png\": $(img).parent().attr(\"href\", \"https://www.linkedin.com/in/david-wright-659006144/\"); break;\n case \"stack.png\": $(img).parent().attr(\"href\", \"https://stackoverflow.com/users/7107832/captainsalt\"); break;\n }\n }\n}","function preloadImages() {\n for (var i = 0; i < numberOfGifsToPreload; i++) {\n popThenAddImage(fileNamesArray);\n }\n }","loadImages() {\n let loadCount = 0;\n let loadTotal = this.images.length;\n\n if (WP.shuffle) {\n this.images = this.shuffle(this.images);\n }\n\n const imageLoaded = (() => {\n loadCount++;\n\n if (loadCount >= loadTotal) {\n // All images loaded!\n this.setupCanvases();\n this.bindShake();\n this.loadingComplete();\n }\n }).bind(this);\n\n for (let image of this.images) {\n // Create img elements for each image\n // and save it on the object\n const size = this.getBestImageSize(image.src);\n image.img = document.createElement('img'); // image is global\n image.img.addEventListener('load', imageLoaded, false);\n image.img.src = image.src[size][0];\n }\n }","function lazyload(){\n var scrollTop = $(\"html, body\").scrollTop();\n $(\"img[data-src]\").each(function(){\n var top = $(this).offset().top - 800;\n var left = $(this).offset().left;\n\n\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\":visible\") ){\n $(this).attr(\"src\", $(this).attr(\"data-src\"));\n }\n });\n\n $(\"[data-background-src]\").each(function(){\n var top = $(this).offset().top - 800;\n var left = $(this).offset().left;\n if($(this).hasClass(\"main-kb-bg\")){\n if(scrollTop >= top){\n $(this).css(\"background-image\", \"url(\"+$(this).attr(\"data-background-src\")+\")\");\n }\n } else {\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\":visible\")){\n $(this).css(\"background-image\", \"url(\"+$(this).attr(\"data-background-src\")+\")\");\n }\n }\n\n });\n }","function loadImages(sources, callback) { \n\t\tfor(var src in sources) { \t// get num of sources\n numImages++;\n }\n for(var src in sources) {\n images[src] = new Image();\n\t\t\timages[src].onload = function() {\n\t\t\t\tif(++loadedImages >= numImages) {\n\t\t\t\tcallback(images);\n\t\t\t\t}\n\t\t\t};\n images[src].src = sources[src];\n }\n }","function loadImages() {\n var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n var urls = opts.urls,\n _opts$onProgress3 = opts.onProgress,\n onProgress = _opts$onProgress3 === undefined ? noop : _opts$onProgress3;\n\n (0, _assert2.default)(urls.every(function (url) {\n return typeof url === 'string';\n }), 'loadImages: {urls} must be array of strings');\n var count = 0;\n return Promise.all(urls.map(function (url) {\n var promise = (0, _browserLoad.loadImage)(url, opts);\n promise.then(function (file) {\n return onProgress({\n progress: ++count / urls.length,\n count: count,\n total: urls.length,\n url: url\n });\n });\n return promise;\n }));\n}","function createImages()\n{\n\tlargeImg.src = imgArray[0];\n\t\n\tfor (var i = 0; i < imgArray.length; i++)\n\t{\n\t\tfourImgsDiv.innerHTML += \"\";\n\t}\n}","loadImages() {\n if (this._queue.length > 0) {\n let img = new Image();\n let src = this._queue.pop();\n\n let name = src.slice(src.lastIndexOf('/') + 1);\n img.src = src;\n img.onload = (function() {\n this.loadImages();\n }).bind(this);\n this.images[name] = img;\n } else {\n this._callback();\n }\n }","function loadImages(images, string) {\n images.forEach((image, index) => {\n image.style.backgroundImage = \"url(./css/img/\" + string + (index + 1) + \".jpg)\";\n image.style.backgroundSize = \"contain\";\n })\n}","function renderImages() {\n //if ( viewSkins ) { renderSkins(); } // disabled here so plants can be rendered sequentially in plants.js\n if ( viewSpans ) { renderSpans(); }\n if ( viewPoints ) { renderPoints(); }\n if ( viewScaffolding ) { renderScaffolding(); }\n}","function getDirectoryImages() {\n\t\t\t// show image previews?\n\t\t\tif (opts.showImgPreview) {\n\t\t\t\tdoLoadDirectoryImage($('#browser ul li.GIF, #browser ul li.JPG, #browser ul li.PNG'), 0, sys.currentPathIdx);\n\t\t\t}\n\t\t}","function init() {\n cacheDom();\n loadImage();\n }","async function loadImages() {\n let data = arg.splice(1, arg.length - 1);\n let promise = [];\n data.forEach(img => {\n if(typeof img === \"string\") {\n let image = Canva2D.API.Preloader(\"singleImageOnly\", img);\n promise.push(image);\n } else if(img.hasOwnProperty(\"img\") && img.hasOwnProperty(\"src\")) {\n let image = Canva2D.API.Preloader(\"singleImageOnly\", img[\"img\"], img[\"src\"]);\n promise.push(image);\n } else {\n let image = Canva2D.API.Preloader(\"singleImageOnly\", img);\n promise.push(image);\n }\n });\n return await Promise.all(promise).then(e => {\n for(const img of e) \n _IMAGES_STACK.push(img);\n return _IMAGES_STACK;\n }).then(e => getImage);\n }","function load_images () {\n console.log(\"load images\");\n\n GM_addStyle(\"#display_img {position: fixed; left: 0px; top: 50px; opacity: 0.6; background-color: #000; width: 100%; height: calc(100% - 50px); display: none;} .postright img {cursor: zoom-in;}\");\n //adds the faded background\n let div = element(\"div\").a(\"id\", \"display_img\").apthis(document.getElementById(\"pagewrapper\"));\n //div that holds the image\n let div1 = document.createElement(\"div\");\n div1.setAttribute(\"style\", \"position: fixed; left: 0px; top: 50px; width: 100%; height: calc(100% - 50px); text-align: center; display: none; cursor: zoom-out;\");\n //the img element that will display the image\n let img = document.createElement(\"img\");\n img.setAttribute(\"src\", \"\");\n img.setAttribute(\"id\", \"display_img_img\");\n div1.appendChild(img);\n //this causes the faded background and image to disappear\n document.getElementById(\"pagewrapper\").appendChild(div1);\n div1.addEventListener(\"click\", (event) => {\n div.style.display = \"none\";\n div1.style.display = \"none\";\n });\n\n let posts = document.getElementsByClassName(\"postright\");\n for (let a of posts) {\n let imgs = a.getElementsByTagName(\"img\");\n for (let b of imgs) {\n b.addEventListener(\"click\", (event) => {\n img.setAttribute(\"src\", event.currentTarget.src);\n //gets current image size\n let img_width = event.currentTarget.clientWidth;\n let img_height = event.currentTarget.clientHeight;\n //going to be used for the dialation\n let scale_factor = 1.5;//this is the maximun a small image can be scalled up\n const display_width = window.innerWidth;\n const display_height = window.innerHeight - 50;\n let final_height = 0, final_width = 0;\n\n final_height = img_height * scale_factor;\n final_width = img_width * scale_factor;\n\n //this is the best solution to deal with all different screen sizes and images sizes\n //It have tried making multilayer if/else statemanets but they don't work well for this\n while (final_height > display_height || final_width > display_width) {\n scale_factor -= 0.1;\n final_height = img_height * scale_factor;\n final_width = img_width * scale_factor;\n }\n //makes it cerntered vertically and makes sure it has right hieght and width\n img.setAttribute(\"style\", \"width:\" + final_width + \"px; height:\" + final_height + \"px; position: relative; top:\" + (((display_height) / 2) - (final_height / 2)) + \"px;\");\n\n div.style.display = \"block\";\n div1.style.display = \"block\";\n });\n }\n }\n }","function showImages() {\r\n const images = document.querySelectorAll('[data-src]');\r\n const clientHeight = document.documentElement.clientHeight;\r\n for (let img of images) {\r\n const coord = img.getBoundingClientRect();\r\n let realSrc = img.dataset.src;\r\n if (!realSrc) continue;\r\n if (coord.top > -clientHeight &&\r\n coord.top < clientHeight * 2 ||\r\n coord.bottom > -clientHeight &&\r\n coord.bottom < clientHeight * 2) {\r\n img.src = realSrc;\r\n img.dataset.src = '';\r\n }\r\n }\r\n }","loadImg() {\n let loadedCount = 0\n function onLoad() {\n loadedCount++\n if (loadedCount >= this.imgPaths.length) {\n this.flowStart()\n }\n }\n this.baseImages = this.imgPaths.map(path => {\n const image = new Image()\n image.onload = onLoad.bind(this)\n image.src = path\n return image\n })\n }","function loadImage(){\n $(\".image-box\").attr(\"src\", displayedImg.download_url);\n}","function loadImage() {\n\t\t\tthis.loading = 'eager';\n\t\t\tif( this.src )\n\t\t\t\tthis.src = this.src;\n\t\t\tif( this.srcset )\n\t\t\t\tthis.srcset = this.srcset;\n\t\t}","function preloadImages(urls) {\n urls.forEach(url => {\n const image = new Image();\n image.src = url;\n });\n}","function loadImages(element) {\n const images = element.querySelectorAll(\".menu__slide--image img\");\n images.forEach(image => (image.src = image.dataset.src || image.src));\n}","function preLoad(onLoadAll) {\n \n var finished = false;\n \n var progressBar = {\n max : 0,\n loaded : 0\n };\n \n var updateBar = function() {\n \n var percnt = ((progressBar.loaded * 100) / progressBar.max) >> 0;\n $(\"#progress-bar\").width(percnt + '%');\n };\n \n var loadImage = function(img) {\n \n var e = document.createElement('img');\n\n e.onload = function() {\n\n progressBar.loaded++;\n updateBar();\n\n if(progressBar.loaded >= progressBar.max) {\n // once we get here, we are pretty much done, so redirect to the actual page\n if(!finished) {\n finished = true;\n helper.hide('progress-bar', 1000, false);\n onLoadAll();\n }\n }\n };\n \n e.onerror = e.onload;\n \n // this will trigger your browser loading the image (and caching it)\n e.src = img;\n };\n \n //Preload images\n $.ajax({\n url: \"./json/images.json\",\n success: function(images) {\n 'use strict';\n\n progressBar.max = images.length;\n\n var i = 0;\n\n while(i < images.length) {\n loadImage(images[i]);\n i++;\n }\n }\n });\n \n //Preload fonts\n var canvas = document.createElement('canvas');\n var ctx = canvas.getContext('2d');\n ctx.font = '12px Canaro';\n ctx.fillText('.', 0, 0);\n}","function showImages() {\n const images = document.querySelectorAll('[data-src]');\n const clientHeight = document.documentElement.clientHeight;\n for (let img of images) {\n const coord = img.getBoundingClientRect();\n let realSrc = img.dataset.src;\n if (!realSrc) continue;\n if (coord.top > -clientHeight &&\n coord.top < clientHeight * 2 ||\n coord.bottom > -clientHeight &&\n coord.bottom < clientHeight * 2) {\n img.src = realSrc;\n img.dataset.src = '';\n }\n }\n }","function loadImagesSeq() {\n\t\t const button = document.querySelector('#loadImagesSeq');\n\t\t const container = document.querySelector('#image-container');\n\t\t const promises = [];\n\t\t button.addEventListener(\"click\", (event) => {\n\n\t\t const images = imageNames();\n\n\t\t images.forEach((image) => {\n\t\t promises.push(requestInSeq(image, container));\n\t\t });\n\t\t console.log(promises);\n\t\t // when all promises are resolved then this promise is resolved.\n\t\t Promise.all(promises).then((imageDataObjs) => {\n\t\t console.log(imageDataObjs);\n\t\t imageDataObjs.forEach((imageData) => {\n\t\t const imageElement = imageData.imageElement;\n\t\t const imageSrc = imageData.objectURL;\n\t\t imageElement.src = imageSrc;\n\t\t });\n\n\t\t });\n\t\t });\n\n\n\t\t}","LoadImage(){\n var images=[]\n // hard coded for convenienceproxy to a static serving end point\n if(this.state.images!=undefined){\n this.state.images.map(i =>{\n images.push(\n this.request.getStamp()+'-' + i\n )\n })\n return images; \n }\n else{\n \n return null\n }\n }","function fetch_video_html_images() { \n var path = window.location.pathname;\n var page = path.split(\"/\").pop();\n\n if(page === 'video.html') {\n // Create element\n const div = document.createElement(\"div\");\n div.className = 'video-items';\n\n let output = '';\n const datas = Object.entries(countries);\n // console.log(datas);\n\n datas.forEach(d=> {\n // console.log(d[1][0]);\n output += `\n \n \n ${d[0]}\n \n `;\n });\n\n div.innerHTML= output;\n\n document.querySelector(\".video-container\").insertAdjacentElement(\"beforeend\", div);\n\n // console.log(output);\n }\n }","function loadImages(sources, callback) {\n \tvar images = {};\n\n for(var src in sources) {\n \timages[src] = new Image();\n \timages[src].onload = callback;\n \timages[src].src = sources[src];\n }\n return images;\n }","function load_imdb_images () {\n return new Promise (resolve => {\n $.spinnerWait (true);\n userLog (\"Det här kan ta några minuter ...\", true, 5000)\n let cmd = '$( pwd )/ld_imdb.js -e ' + $(\"#imdbPath\").text (); // pwd = present working dir\n execute (cmd).then ( () => {\n // $ (\"button.updText\").css (\"float\", \"right\");\n // $ (\"button.updText\").hide ();\n resolve (\"Done\")\n });\n });\n}","function lazyLoad() {\n lazyImages.forEach(image => {\n if (image.offsetTop < window.scrollY + 150) {\n image.style.backgroundImage =\n `url(${image.getAttribute('data-src')})`;\n image.classList.add('loaded')\n }\n })\n}","function init() {\n cacheDom();\n loadImage();\n }","function preloadImages(images) {\n imagesAmount = images.length;\n for (var i = 0; i < images.length; i++) {\n var img = new Image();\n img.addEventListener('load', imageLoadedCallback, false);\n img.src = basePath + 'images/' + images[i];\n }\n }","function displayPages() {\r\n // Retrieve the the pages div element.\r\n var $pageDiv = $(\"#pageDiv\");\r\n \r\n // Clear the page div.\r\n while ($pageDiv[0].firstChild)\r\n $pageDiv[0].removeChild($pageDiv[0].firstChild);\r\n \r\n // Iterate through all of the pages in the pagesList.\r\n for (var i = 0; i < pageList.length; i++) {\r\n var page = pageList[i];\r\n \r\n // Create a new image element to represent the page.\r\n var img = document.createElement(\"IMG\");\r\n img.onload = function() {\r\n $(this).hide().pageToggle();\r\n };\r\n img.src = \"/ShowAndTellProject/\" + page.audio;\r\n img.id = \"pageThumbnail\";\r\n \r\n // Add highlight functionality to the image element.\r\n highlight(img);\r\n \r\n // Add the image to the pages div.\r\n $pageDiv.append(img); \r\n }\r\n}","function showImages() {\n var\n last = imgs.length,\n current,\n allImagesDone = true;\n\n for (current = 0; current < last; current++) {\n var img = imgs[current];\n // if showIfVisible is false, it means we have some waiting images to be\n // shown\n if(img !== null && !showIfVisible(img, current)) {\n allImagesDone = false;\n }\n }\n\n if (allImagesDone && pageHasLoaded) {\n }\n }","function LoadImage(ImageID){\r\n\tLoaded_Images_array_current = Loaded_Images_array.indexOf(ImageID);\r\n\t// console.debug(Loaded_Images);\r\n\t\r\n\tvar ImageThumb = Loaded_Images[ImageID].thumb\r\n\tvar ImageMain = Loaded_Images[ImageID].main\r\n\tvar LoadingImage = true;\r\n\r\n\t\r\n\t// Sets the link on the image to the image page\r\n\t$nav_content_img.parent().attr('href',Loaded_Images[ImageID].link)\r\n\t\r\n\t// Formats all the tags into a list of links\r\n\tvar ImageTagsFormatted = [];\r\n\tvar ImageTags = Loaded_Images[ImageID].tags.split(\" \");\r\n\t$.each(ImageTags, function(index, value) {\r\n\t\tImageTagsFormatted.push(''+value+'');\r\n\t})\r\n\t\r\n\t$('.image_nav_background').show();\r\n\t$image_nav_overlay.show();\r\n\t$nav_thumb_img.show();\r\n\t$text_overlay.empty().append(''+Loaded_Images[ImageID].filename+' | Page '+Loaded_Images[ImageID].page+' | Image '+Loaded_Images[ImageID].number+'
'+ImageTagsFormatted.join(' | '))\r\n\t\r\n\t$nav_content_img\r\n\t.data('ImageId',ImageID)\r\n\t\r\n\tvar current_status = Loaded_Images[ImageID].status;\r\n\t\r\n\t// Loads the image if it's already been verified previously.\r\n\tif(current_status == 'loaded' || current_status == 'error'){\r\n\t\t$nav_content_img.attr('src',ImageMain)\r\n\t\tif(current_status != 'loading')$nav_thumb_img.hide();\r\n\t\t$('.main_image_direct_link',$text_overlay).attr('href',ImageMain)\r\n\t\t\r\n\t\tRepositionMainImage();\r\n\t\r\n\t// Checks each image extension until it finds a working one\r\n\t}else if(current_status == 'waiting'){\r\n\t\tLoaded_Images[ImageID].status = 'loading';\r\n\t\tGM_xmlhttpRequest({\r\n\t\t\tmethod: \"GET\",\r\n\t\t\turl: '/'+Loaded_Images[ImageID].link,\r\n\t\t\tonload: function(retour) {\r\n\t\t\t\tLoaded_Images[ImageID].verified = true\r\n\t\t\t\tvar image;\r\n\t\t\t\tvar ResponseHTML = $(retour.responseText);\r\n\t\t\t\tvar ImageServer = $('div.content script:contains(\"image\"):contains(\"domain\"):contains(\"base_dir\")',ResponseHTML).text();\r\n\t\t\t\teval(ImageServer)\r\n\t\t\t\tvar new_image_url = image.domain+\"/\"+image.base_dir+\"/\"+image.dir+\"/\"+image.img;\r\n\t\t\t\tLoaded_Images[ImageID].main = new_image_url\r\n\t\t\t\t$(\"![]()
\")\r\n\t\t\t\t\t.attr(\"src\", new_image_url)\t\r\n\t\t\t\t\t.one('load',function(){\r\n\t\t\t\t\t\tLoaded_Images[ImageID].status = 'loaded';\r\n\t\t\t\t\t// Checks to make sure the successfully loading image actually is the one selected, since the load function for a previous image might be called after the user has switched to another.\r\n\t\t\t\t\t\tif($nav_content_img.data('ImageId') == ImageID){\r\n\t\t\t\t\t\t\t$nav_content_img.attr('src',new_image_url);\r\n\t\t\t\t\t\t\t$nav_thumb_img.hide();\r\n\t\t\t\t\t\t\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\r\n\t\t\t\t\t\t\tRepositionMainImage();\r\n\t\t\t\t\t\t}\t\t\t\t\t\t\r\n\t\t\t\t\t})\r\n\t\t\t\t\t.one('error',function(){\r\n\t\t\t\t\t\tLoaded_Images[ImageID].status = 'error';\r\n\t\t\t\t\t\tif($nav_content_img.data('ImageId') == ImageID){\r\n\t\t\t\t\t\t\t$nav_content_img.attr('src','/images/404.gif').one('load',function(){RepositionMainImage();});\r\n\t\t\t\t\t\t\t$nav_thumb_img.hide();\r\n\t\t\t\t\t\t\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t});;\r\n\t\t\t}\r\n\t\t});\r\n\t}\r\n\t\r\n\t// Prevent left and right scrolling in background\r\n\t$('body').css({'overflow-x' : 'hidden', 'overflow-y': 'hidden'})\r\n}","function findImages(){\n var parentDir = \"./desc/civic_2012\";\n \n console.log(parentDir);\n var fileCrowler = function(data){\n var titlestr = $(data).filter('title').text();\n // \"Directory listing for /Resource/materials/xxx\"\n var thisDirectory = titlestr.slice(titlestr.indexOf('/'), titlestr.length)\n\n //List all image file names in the page\n $(data).find(\"a\").attr(\"href\", function (i, filename) {\n if( filename.match(/\\.(jpe?g|png|gif)$/) ) { \n var fileNameWOExtension = filename.slice(0, filename.lastIndexOf('.'))\n // var img_html = \"\".format(thisDirectory + filename, fileNameWOExtension, fileNameWOExtension);\n // $(\"#sm_image\").append(img_html);\n $( \".templ\" ).appendTo( \"#sm_image\" );\n }\n else{ \n $.ajax({\n url: thisDirectory + filename,\n success: fileCrowler\n });\n }\n });}\n\n $.ajax({\n url: parentDir,\n success: fileCrowler\n });\n}","function load_media()\n{\n bg_sprite = new Image();\n bg_sprite.src = \"images/Background-stadt_lang.png\";\n box_sprite = new Image();\n box_sprite.src = \"images/Stift.png\";\n main_sprite = new Image();\n main_sprite.src = \"images/IMG_2210_Mini.png\";\n}","function startImgStatus(){\n var img = document.createElement('img'); // Hack to extract absolute url\n $jQ('img').each(function(){\n img.src=$jQ(this).attr('src');\n setLink($jQ(this),'src', img.src);\n });\n}"],"string":"[\n \"function loadImages() {\\n\\t\\t const button = document.querySelector('#loadImages');\\n\\t\\t const container = document.querySelector('#image-container');\\n\\n\\t\\t button.addEventListener(\\\"click\\\", (event) => {\\n\\n\\t\\t const images = imageNames();\\n\\t\\t images.forEach((image) => {\\n\\t\\t requestFor(image, container).then(imageData => {\\n\\t\\t const imageElement = imageData.imageElement;\\n\\t\\t const imageSrc = imageData.objectURL;\\n\\t\\t imageElement.src = imageSrc;\\n\\t\\t });\\n\\t\\t });\\n\\t\\t });\\n\\t\\t}\",\n \"function load_images() {\\n data.each(function(frame) {\\n var imgs = []\\n frame.images.each(function(imgstr) {\\n var img = new Image(IMG_WIDTH, IMG_HEIGHT);\\n img.src = \\\"/img/\\\" + imgstr;\\n img.style.float = \\\"left\\\";\\n imgs.push(img); \\n });\\n frame['imageobjs'] = imgs;\\n }) \\n }\",\n \"function getImages() {\\n\\t$.get(\\\"resources/get_images.php\\\", {\\\"page\\\": globalPage}).success(function(data) {\\n\\t\\tglobalPage++;\\n\\t\\t\\n\\t\\tvar imgz = JSON.parse(data).images;\\n\\t\\tgenerateThumbnails(imgz);\\n\\t\\tgenerateShowMoreButton(imgz);\\n\\t}).fail(function() {\\n\\t\\twindow.location.replace(\\\"index.php\\\");\\n\\t});\\n}\",\n \"function renderImages() {\\n $('.landing-page').addClass('hidden');\\n $('.img-round').removeClass('hidden');\\n updateSrcs();\\n currentOffset+=100;\\n }\",\n \"function start_loadImages()\\n {\\n methods.loadImages(\\n function() {\\n methods.getDataURI();\\n run_app();\\n },\\n imagesRack.imgList\\n );\\n }\",\n \"function loadImages() {\\r\\n new Image('(\\\"Robot\\\") Bag','/images/bag.jpg', 0);\\r\\n new Image('Bathroom Phone Holder','/images/bathroom.jpg', 0);\\r\\n new Image('Breakfast Maker','/images/breakfast.jpg', 0);\\r\\n new Image('Meatball Bubblegum','/images/bubblegum.jpg', 0);\\r\\n new Image('Chair','/images/chair.jpg', 0);\\r\\n new Image('Cthulhu','/images/cthulhu.jpg', 0);\\r\\n new Image('Duck Mask','/images/dog-duck.jpg', 0);\\r\\n new Image('Dragon','/images/dragon.jpg', 0);\\r\\n new Image('U-Pensils','/images/pen.jpg', 0);\\r\\n new Image('Pet Sweep','/images/pet-sweep.jpg', 0);\\r\\n new Image('Pizza Scissors','/images/scissors.jpg', 0);\\r\\n new Image('Shark Blanket','/images/shark.jpg', 0);\\r\\n new Image('Baby Sweep','/images/sweep.png', 0);\\r\\n new Image('TaunTaun Sleepingbag','/images/tauntaun.jpg', 0);\\r\\n new Image('Unicorn Meat','/images/unicorn.jpg', 0);\\r\\n new Image('USB','/images/usb.gif', 0);\\r\\n new Image('Water Can','/images/water-can.jpg', 0);\\r\\n new Image('Wine Glass','/images/wine-glass.jpg', 0);\\r\\n new Image('boots', '/images/boots.jpg', 0);\\r\\n new Image('banana','/images/banana.jpg', 0);\\r\\n }\",\n \"function loadAllImages() {\\n var images = document.querySelectorAll('img[data-src]');\\n\\n for (var i = 0; i < images.length; i++) {\\n ImageLoader.load(images[i]);\\n }\\n }\",\n \"function loadImages() {\\n $('img[data-src]').each(function () {\\n var src = $(this).data('src');\\n var style = $(this).data('style');\\n $(this).attr('src', src);\\n $(this).attr('style', style);\\n });\\n}\",\n \"function loadImages() {\\n var files = [ 'outer_light.png', 'layer_down_light.png',\\n 'layer_up_light.png', 'angle_prev_light.png',\\n 'angle_next_light.png', 'linked_data_light.png',\\n 'raw_scan_light.png', 'dig_positive_light.png',\\n 'text_view_light.png', 'vector_view_light.png',\\n 'overlays_light.png', 'thumbnails_light.png',\\n '3d_view_light.png', 'step_back_light.png',\\n 'step_fwd_light.png', 'minimize_light.png' ];\\n\\n var i = 0;\\n for (i = 0; i < files.length; i++) {\\n btnImages[i] = new Image(); btnImages[i].src = files[i];\\n }\\n}\",\n \"function findImagesToLoad() {\\n\\tsetLazyImagePositions.call(this);\\n\\tconst imagesToLoad = getImagesInView(this.images);\\n\\tloadImages.call(this, imagesToLoad);\\n}\",\n \"function LoadImages()\\n{\\n\\tvar loadedImages = 0;\\n\\tvar numImages = 0;\\n\\tfor (var src in ImgList)\\n\\t{\\n\\t\\tnumImages++;\\n\\t}\\n\\tfor (var src in ImgList)\\n\\t{\\n\\t\\tImgs[src] = new Image();\\n\\t\\tImgs[src].onload = function()\\n\\t\\t{\\n\\t\\t\\tloadedImages = loadedImages +1;\\n\\t\\t\\tif(loadedImages >= numImages)\\n\\t\\t\\t{\\n\\t\\t\\t\\t//Finished loading!\\n\\t\\t\\t\\ttstsetup();\\n\\t\\t\\t\\tImgsFinished = 1;\\n\\t\\t\\t}\\n\\t\\t};\\n\\n\\t\\tif (src < 6)\\n\\t\\t{\\n\\t\\t\\tImgs[src].src = ImgList[src];\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tImgs[src].src = ImgURL + ImgList[src];\\n\\t\\t}\\n\\t}\\n}\",\n \"function fetchImages() {\\n $.getJSON(\\\"/images.php\\\", function(data) {\\n preloadImages(data);\\n }); \\n }\",\n \"function loadImages() {\\n bsImage = new Image();\\n bsImage.src = \\\"resources/resources/images/spritesheets/buttons_1.png\\\";\\n wallImag = new Image();\\n wallImag.src = \\\"resources/resources/images/spritesheets/jungle_wall.png\\\";\\n ssImage = new Image();\\n ssImage.src = \\\"resources/resources/images/spritesheets/sprites_final.png\\\";\\n window.setTimeout(setup, 1500);\\n aImage = new Image();\\n aImage.src = \\\"resources/resources/images/spritesheets/uparr.png\\\"\\n}\",\n \"function loadImages(div){\\r\\n\\tvar images = [];\\r\\n\\tjQuery.each(jQuery(div+' img'), function(i,img){\\r\\n\\t\\tif(!jQuery(img).attr('src') || jQuery(img).attr('src')==''){\\r\\n\\t\\t\\timages.push(img);\\r\\n\\t\\t}\\r\\n\\t});\\r\\n\\tjQuery(images).each( function(i,image) {\\r\\n\\t\\tjQuery(this).attr('src',jQuery(this).attr('longdesc'));\\r\\n\\t});\\r\\n}\",\n \"function loadImage() {\\n var baseUrl = 'https://source.unsplash.com/category';\\n var category = 'nature';\\n var size = '1920x1080';\\n\\n var source = baseUrl + '/' + category + '/' + size;\\n\\n buildElement(source)\\n .then(render);\\n }\",\n \"function loadImages() {\\r\\n var files = document.getElementById('images').files, i, file, reader;\\r\\n for (i = 0; i < files.length; i = i + 1) {\\r\\n file = files[i];\\r\\n if (file.name.endsWith(\\\".jpg\\\") || file.name.endsWith(\\\".gif\\\") || file.name.endsWith(\\\".png\\\")) {\\r\\n images.push(file);\\r\\n }\\r\\n }\\r\\n if (images.length > 0) {\\r\\n showLoadedImages(\\\"list\\\");\\r\\n } else {\\r\\n alert(\\\"No images found. Try another directory.\\\");\\r\\n }\\r\\n }\",\n \"function loadVisiblePages() {\\n // Fetch page images that are currently shown on the site\\n var firstVisibleImageLinks = $('#imageList li>a').not('.page-text').withinviewport();\\n $.each(firstVisibleImageLinks, function(index, aEl) {\\n var imgEl = $(aEl).find('img');\\n // Check if the image is already loaded\\n if( $(imgEl).attr('src') !== '' )\\n return;\\n\\n // Load page images via Ajax\\n $.get( \\\"ajax/image/page\\\", { \\\"imageId\\\" : globalImageType, \\\"pageId\\\" : $(aEl).attr('data-pageid'), \\\"width\\\" : 150 } )\\n .always(function( data ) {\\n // Remove broken image icon first\\n var nextEl = $(imgEl).next();\\n if( nextEl.length !== 0 ) {\\n $(nextEl).remove();\\n }\\n })\\n .done(function( data ) {\\n $(imgEl).attr('src', \\\"data:image/jpeg;base64, \\\" + data);\\n })\\n .fail(function( data ) {\\n $(imgEl).after('broken_image');\\n });\\n });\\n}\",\n \"function loadImage() {\\n\\n // image file not loaded yet? => load image file\\n if ( !resource ) jQuery( '' );\\n\\n // immediate perform success callback\\n success();\\n\\n }\",\n \"function loadImages() {\\n\\t// for each image container\\n\\t$('.image-container').each(function() {\\n\\t\\t// get medium-sized image filename\\n\\t\\tvar img_filename = $('img', $(this)).attr('data-imglarge')\\n\\t\\tvar img_med_filename = img_filename.substring(0, img_filename.indexOf('.png')) + '_medium.jpg'\\n\\n\\t\\t// // load medium-sized image\\n\\t\\t// var imgLarge = new Image()\\n\\t\\t// $(imgLarge).addClass('artwork')\\n\\t\\t// \\t.attr('src', img_med_filename)\\n\\t\\t// \\t.attr('data-imglarge', img_filename)\\n\\t\\t// \\t.attr('alt', $('.placeholder', $(this)).attr('alt'))\\n\\t\\t// \\t.on('load', () => {\\n\\t\\t// \\t\\t$(imgLarge).addClass('loaded')\\n\\t\\t// \\t})\\n\\t\\t// $(this).append($(imgLarge))\\n\\n\\t\\t// update placeholder image src\\n\\t\\t$('.placeholder', $(this)).attr('src', img_med_filename)\\n\\t\\t\\t.attr('data-imglarge', img_filename)\\n\\t\\t\\t.css('filter', 'none')\\n\\t})\\n\\tconsole.log('window loaded!')\\n}\",\n \"function loadImages (){\\n var img = [\\n 'src/Barba Garcia, Francisco.jpg',\\n 'src/Barba Rodriguez, Arturo.jpg',\\n 'src/Caro Bernal, Miguel Angel.jpg',\\n 'src/Castillo Peña, José Luis.jpg',\\n 'src/Cruz Vidal, Alejandro.jpg',\\n 'src/Gallego Martel, Jose Maria.jpg',\\n 'src/Garci Peña, José Joaquín.jpg',\\n 'src/Vazquez Rodriguez, Maria del Mar.jpg',\\n ];\\n\\n setImgs(shuffle(initImgs(img)));\\n}\",\n \"function loadImages() {\\n floor = new Image();\\n background = new Image();\\n ring = new Image();\\n platform = new Image();\\n\\n floor.src = './tile-images/floorpath.png';\\n background.src = './tile-images/plainbackgroundtile.png';\\n ring.src = './tile-images/ring.png';\\n platform.src = './tile-images/platform.png';\\n}\",\n \"function display_advertise_images() {\\n}\",\n \"function refreshImages() {\\n var images = document.querySelectorAll('img[data-src]');\\n\\n for (var i = 0; i < images.length; i++) {\\n ImageLoader.load(images[i]);\\n }\\n }\",\n \"function loadImages(){\\n prev_btnj.addClass('loading')\\n next_btnj.addClass('loading')\\n fs.readdir(dirname, (err, files) => {\\n if (!err){\\n images = files.filter(isImage)\\n curIndex = images.indexOf(basename)\\n prev_btnj.removeClass('loading')\\n next_btnj.removeClass('loading')\\n setBtn()\\n }\\n })\\n}\",\n \"function loadImages() {\\n testPattern = new Image();\\n testPattern.src = \\\"testpattern.gif\\\";\\n }\",\n \"function loadImages() {\\r\\n\\t\\tremoveUnseenImages();\\r\\n\\t\\tvar sets = $['mapsettings'];\\r\\n\\t\\tvar range = getPixelRange();\\r\\n\\t\\tfor(var i=range.start.x; i![]()
').attr({\\n id: \\\"image\\\" + i,\\n src: config.imgDir + i + config.imgFormat,\\n title: \\\"Image\\\" + i\\n }).appendTo(\\\"#\\\" + config.imgContainer);\\n }\\n }\",\n \"function preloadImages() {\\n\\tidList.forEach(function(id) {\\n\\t\\tlet $newImage = $('#image-preloader').clone();\\n\\t\\t$newImage.attr('src', `${ART_URL}${id}.png`);\\n\\t\\t$('#image-preloader-container').append();\\n\\t});\\n}\",\n \"function loadImage() {\\n var baseUrl = 'https://source.unsplash.com/category',\\n cat = 'nature',\\n size = '1920x1080';\\n\\n buildElement(`${baseUrl}/${cat}/${size}`).then(render);\\n }\",\n \"function getImages() {\\n alert(\\\"Page will reload once images are finished loading\\\");\\n // runs 1540photo.py, which collects images from Gmail\\n exec(\\\"python 1540photo.py\\\");\\n loaded_images_from_tba = 0;\\n // for each team, loads media\\n for (let team_id in teams) {\\n loadMediaFromTBA(teams[team_id]);\\n }\\n // gets local files\\n let local_dir = fs.readdirSync(\\\"./data/images/\\\");\\n for (let team_id in local_dir) {\\n try {\\n let file = local_dir[team_id];\\n if (manifest_images.indexOf(file) < 0) {\\n manifest_images.push(file);\\n }\\n } catch (_) {}\\n }\\n // checks to see if all images are loaded, and saves a manifest if true\\n window.setInterval(saveImageManifest, 3000);\\n}\",\n \"function renderImages() {\\n imgElem.src = Actor.all[0].path;\\n}\",\n \"function loadImages(atlas)\\n\\t\\t{\\n\\t\\t\\tdataAtlas = atlas.tiles;\\n\\t\\t\\tplayerAtlas = atlas.player;\\n\\n\\t\\t\\tlet images = [\\\"img/Tiles/sheet.png\\\", \\\"img/Player/p1_spritesheet.png\\\"];\\n\\t\\t\\tlet imgsPromises = images.map (function (url)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn new Promise ( (ok, error) => {\\n\\t\\t\\t\\t\\tvar img = new Image();\\n\\t\\t\\t\\t\\timg.src = url;\\n\\t\\t\\t\\t\\timg.onload = () => ok(img);\\n\\t\\t\\t\\t});\\n\\t\\t\\t});\\n\\t\\t\\treturn (Promise.all(imgsPromises))\\n\\t\\t}\",\n \"preloadImages(doload, callback) {\\n\\t\\tconst paths = this.getImagePaths();\\n\\t\\tfor (let i = 0; i < paths.length; i++) {\\n\\t\\t\\tgraphics.add(paths[i]);\\n\\t\\t}\\n\\t\\tif (doload) {\\n\\t\\t\\tgraphics.load(callback);\\n\\t\\t}\\n\\t}\",\n \"function ImageController(){\\n\\t\\tvar imageService = new ImageService()\\n\\t\\t$.get(window.location.pathname + '-image-tag.html', function(data){\\n\\t\\t\\t$('.main-container').append(data)\\n\\t\\t})\\n\\t\\timageService.getImage(function(imageData){\\n\\t\\t\\t$('body').css('background-image', `url(\\\"${imageData.url}\\\")`);\\n\\t\\t\\tconsole.log(imageData.large_url)\\n\\t\\t\\t$('.image-link').attr('href', imageData.large_url!==null? imageData.large_url : imageData.url)\\n\\t\\t})\\n\\t}\",\n \"function loadImg(){\\n document.productImg.src = myImgSrc + myImg[i] + myImgEnd;\\n}\",\n \"function loadImage() {\\n\\t\\t$('div.thumbnail a img').on('click', function(){\\n\\t\\t\\tvar image = this.src;\\n\\t\\t\\t$('.image-load').html('');\\n\\t\\t});\\n\\t}\",\n \"function loadImage(imageName, imageLocation)\\n{\\nif (document.images) document.images[imageName].src = imageLocation;\\nreturn true;\\n}\",\n \"function Load_Page(CurrentImageID){\\r\\n\\t\\r\\n\\t\\r\\n\\tvar Image_Number = Loaded_Images[CurrentImageID].number;\\r\\n\\tvar Image_Page = Loaded_Images[CurrentImageID].page\\r\\n\\t\\r\\n\\t// Checks which page direction and if it's the end of the list.\\r\\n\\t\\r\\n\\t// Going towards the left\\r\\n\\tvar backPaging = (Image_Number <= 1 && Image_Page > 1)\\r\\n\\tvar FrontWall = (Image_Page == FirstPage)\\r\\n\\t\\r\\n\\t// Going towards the right\\r\\n\\tvar forwardPaging = (Image_Number >= ImagesPerPage && Image_Page >= 1)\\r\\n\\tvar RearWall = (Image_Number < ImagesPerPage && Image_Page == LastPage)\\r\\n\\tif(backPaging && !FrontWall){\\r\\n\\t\\tvar PageSelect = Image_Page-1\\r\\n\\t\\t// console.debug('backpaging')\\r\\n\\t}else if(forwardPaging && !RearWall){\\r\\n\\t\\tvar PageSelect = Image_Page+1\\r\\n\\t\\t// console.debug('forwardPaging')\\r\\n\\t}else{\\r\\n\\t\\t// console.debug('wall')\\r\\n\\t\\tPageSelect = Image_Page\\r\\n\\t};\\r\\n\\r\\n\\t\\r\\n\\t\\r\\n\\t// Takes the requested page and converts into a URL string to load.\\r\\n\\tif(backPaging || forwardPaging){\\r\\n\\t$nav_thumb_img.show();\\r\\n\\tPageSelect -= 1\\r\\n\\tPageSelect = PageSelect*ImagesPerPage\\r\\n\\t\\r\\n\\tif(document.URL.indexOf('pid=') > -1){\\r\\n\\t\\tvar requestURL = document.URL.replace(/pid\\\\=[0-9]{1,}/,'pid='+PageSelect);\\r\\n\\t}else{\\r\\n\\t\\tvar requestURL = document.URL+'&pid='+PageSelect;\\r\\n\\t};\\r\\n\\t// console.debug(requestURL+' Loading...')\\r\\n\\tGM_xmlhttpRequest({\\r\\n\\t\\tmethod: \\\"GET\\\",\\r\\n\\t\\turl: requestURL,\\r\\n\\t\\tonload: function(retour) {\\r\\n\\t\\t\\t// console.debug(retour)\\r\\n\\t\\t\\t$nav_thumb_img.hide();\\r\\n\\t\\t\\tResponseHTML = $(retour.responseText);\\r\\n\\t\\t\\tvar ImageNumber = 0\\r\\n\\t\\t\\t$('.content span.thumb', ResponseHTML).each(function(){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tvar $this_span = $(this)\\r\\n\\t\\t\\t\\tvar ImageID = $this_span.attr('id');\\r\\n\\t\\t\\t\\tvar ImageThumb = $('img.preview' ,$this_span).attr('src');\\r\\n\\t\\t\\t\\tvar ImageTags = $('img.preview' ,$this_span).attr('alt');\\r\\n\\t\\t\\t\\tvar ImagePage = parseInt($('#paginator .pagination b', ResponseHTML).text());\\r\\n\\t\\t\\t\\tvar ImageMain = ImageThumb.replace('thumbnail_','').replace(\\\"/r34/thumbnails/\\\",'//images/').replace(\\\"/rule34/thumbnails/\\\",'/rule34//images/')\\r\\n\\t\\t\\t\\tvar ImageLink = $('a[href^=\\\"'+Setting_ImageLinkBegins+'\\\"]',$this_span).attr('href');\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// console.debug(ImageMain);\\r\\n\\t\\t\\t\\t// http://cdn.rule34.xxx/r34/thumbnails/1354/thumbnail_23a69eecacb1cd8c36045e45657800e8f257e950.jpg?1411722\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tImageNumber++\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tAddImage(ImageID,ImageThumb,ImageMain,ImagePage,ImageNumber,ImageLink,ImageTags)\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSort_images();\\r\\n\\t\\t\\tvar Cur_Image_ID = $('.image_nav_content img.main_img').data('ImageId')\\r\\n\\t\\t\\tvar Image_Number2 = Loaded_Images_array.indexOf(Cur_Image_ID);\\r\\n\\t\\t\\tif(backPaging){\\r\\n\\t\\t\\t\\tImage_Number2--\\r\\n\\t\\t\\t\\t// console.debug('backPaging')\\r\\n\\t\\t\\t}else if(forwardPaging){\\r\\n\\t\\t\\t\\tImage_Number2++\\r\\n\\t\\t\\t\\t// console.debug('forwardPaging')\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t// console.debug(Cur_Image_ID+' ID, Number: '+Image_Number2)\\t\\t\\t\\r\\n\\t\\t\\tNew_Image = Loaded_Images_array[Image_Number2]\\r\\n\\t\\t\\t// console.debug(New_Image)\\r\\n\\t\\t\\tLoadImage(New_Image);\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t});\\r\\n\\t};\\r\\n \\r\\n}\",\n \"function preloader() {\\n\\tif (document.images) {\\n\\t\\tvar img1 = new Image();\\n\\t\\tvar img2 = new Image();\\n\\t\\tvar img3 = new Image();\\n\\t\\tvar img4 = new Image();\\n\\n\\t\\timg1.src = \\\"./imgs/sunny.jpg\\\";\\n\\t\\timg2.src = \\\"./imgs/sunset.jpg\\\";\\n\\t\\timg3.src = \\\"./imgs/stars.jpg\\\";\\n\\t\\timg4.src = \\\"./imgs/downtown.jpg\\\";\\n\\t}\\n}\",\n \"function preload() {\\n println(\\\"loading images\\\")\\n img = [loadImage(\\\"./assets/AmericaFirst.png\\\"), loadImage(\\\"./assets/AuditTheVote.png\\\"), loadImage(\\\"./assets/Hillary.png\\\"), loadImage(\\\"./assets/MAGA.png\\\"), loadImage(\\\"./assets/TrumpTrain.png\\\")];\\n\\n}\",\n \"function lazyLoad(){\\n\\tvar $images = $('.lazy_load');\\n\\n\\t$images.each(function(){\\n\\t\\tvar $img = $(this),\\n\\t\\t\\tsrc = $img.attr('data-img');\\n\\t\\t$img.attr('src',src);\\n\\t});\\n}\",\n \"function loadImageUrls() {\\n fetch(\\\"https://api.imgflip.com/get_memes\\\")\\n .then((result) => result.json())\\n .then(({ data: { memes: loadedMemes } = {} }) => {\\n memes = loadedMemes;\\n showImage(0);\\n });\\n }\",\n \"function loadImages(imagesToLoad) {\\n\\timagesToLoad.forEach(lazyImage => {\\n\\t\\tthis.fireLazyEvent(lazyImage.image);\\n\\t\\tlazyImage.resolved = true;\\n\\t});\\n}\",\n \"function displayPhotos() {\\n loader.hidden = true;\\n photos.forEach((photo) => {\\n // Create Unspalsh page Link for the image\\n const imageLink = document.createElement(\\\"a\\\");\\n imageLink.setAttribute(\\\"href\\\", photo.links.html);\\n imageLink.setAttribute(\\\"target\\\", \\\"_blank\\\");\\n\\n // Create image element\\n const img = document.createElement(\\\"img\\\");\\n img.setAttribute(\\\"src\\\", photo.urls.regular);\\n img.setAttribute(\\\"alt\\\", photo.alt_description);\\n img.setAttribute(\\\"title\\\", photo.alt_description);\\n\\n imageLink.appendChild(img);\\n imageContainer.appendChild(imageLink);\\n\\n //event listner for image\\n img.addEventListener(\\\"load\\\", imageLoaded);\\n });\\n}\",\n \"function getLoadedImages() {\\r\\n return images;\\r\\n }\",\n \"function preload(){\\n images.forEach(function(elem) {\\n im = new Image();\\n im.src = elem;\\n });\\n}\",\n \"function preloadImages() {\\n var images = [\\n 'btn_action_active.png',\\n\\t'btn_focus_active.png',\\n 'btn_up_active.png',\\n 'btn_right_active.png',\\n 'btn_left_active.png',\\n 'btn_down_active.png',\\n 'prybar.png',\\n 'machete.png',\\n 'sample_dna.png',\\n 'pickaxe.png',\\n 'fuel.png',\\n 'fire_extinguisher.png',\\n 'dynamite.png',\\n 'dna_sampler.png'\\n ];\\n $(images).each(function() {\\n $('![]()
')[0].src = this;\\n (new Image()).src = this;\\n });\\n}\",\n \"function LoadSliderImages(sublist) {\\n\\t\\t\\tvar numImages = sublist.find('.item > a > .src').length;\\n\\t\\t\\tsublist.find('.item > a > .src').each(function(i) {\\n\\t\\t\\t\\tvar img = new Image();\\n\\t\\t\\t\\tvar imgSrc = $(this).html();\\n\\t\\t\\t\\tvar imgAlt = $(this).parent().find('.alt').html();\\n\\t\\n\\t\\t\\t\\t$(this).parent().append(img);\\n\\t\\t\\t \\n\\t\\t\\t\\t// wrap our new image in jQuery, then:\\n\\t\\t\\t\\t$(img).load(function () {\\n\\t\\t\\t\\t\\tnumImages--;\\n\\t\\t\\t\\t\\tif (numImages == 0) {\\n\\t\\t\\t\\t\\t\\tSetSublist(sublist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\tif (i == sublist.find('.item > a > .src').size() - 1) {\\n\\t\\t\\t\\t\\t\\tSetSublist(sublist);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t*/\\n\\t\\t\\t\\t})\\n\\t\\t\\t\\t.error(function () {\\n\\t\\t\\t\\t// notify the user that the image could not be loaded\\n\\t\\t\\t\\t})\\n\\t\\t\\t\\t.attr('src', imgSrc).attr('alt', imgAlt);\\n\\t\\t\\t});\\n\\t\\t}\",\n \"function preloadImages() {\\n\\tif (document.images) {\\n\\t\\tfor (var i = 0; i < preloadImages.arguments.length; i++) {\\n\\t\\t\\t(new Image()).src = preloadImages.arguments[i];\\t\\n\\t\\t}\\n\\t}\\n} // end image preloader\",\n \"function preload(){\\r\\n img=loadImage('https://upload.wikimedia.org/wikipedia/commons/8/81/Dalai_Lama_%2814566605561%29.jpg')\\r\\n\\r\\n img1=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/02/Nelson_Mandela_1994.jpg')\\r\\n\\r\\n img2=loadImage('https://upload.wikimedia.org/wikipedia/commons/0/00/Bill_Clinton_1999_Presidential_Medal_of_Freedom_%281%29.jpg')\\r\\n\\r\\nimg3=loadImage('https://live.staticflickr.com/65535/49245065008_a7082b2a41_b.jpg')\\r\\n}\",\n \"loadImages(): void {\\n let self = this;\\n let items = this.getState().items;\\n for (let i = 0; i < items.length; i++) {\\n let item: ItemType = items[i];\\n // Copy item config\\n let config: ImageViewerConfigType = {...item.viewerConfig};\\n if (_.isEmpty(config)) {\\n config = makeImageViewerConfig();\\n }\\n let url = item.url;\\n let image = new Image();\\n image.crossOrigin = 'Anonymous';\\n self.images.push(image);\\n image.onload = function() {\\n config.imageHeight = this.height;\\n config.imageWidth = this.width;\\n self.store.dispatch({type: types.LOAD_ITEM, index: item.index,\\n config: config});\\n };\\n image.onerror = function() {\\n alert(sprintf('Image %s was not found.', url));\\n };\\n image.src = url;\\n }\\n }\",\n \"function _onImageLoaded() {\\n _imagesToLoad = _imagesToLoad - 1;\\n if (!_imagesToLoad) {\\n $$log(\\\"All images loaded, rendering again.\\\");\\n PP64.renderer.render();\\n }\\n }\",\n \"function fnLoadPngs(){\\n var rslt = navigator.appVersion.match(/MSIE (\\\\d+\\\\.\\\\d+)/, '');\\n var itsAllGood = (rslt != null && Number(rslt[1]) >= 5.5);\\n \\n for (var i = document.images.length - 1, img = null; (img = document.images[i]); i--){\\n if (itsAllGood && img.src.match(/\\\\.png$/i) != null) {\\n var src = img.src;\\n var div = document.createElement(\\\"DIV\\\");\\n \\n div.style.filter = \\\"progid:DXImageTransform.Microsoft.AlphaImageLoader(src='\\\" + src + \\\"', sizing='scale')\\\"\\n div.style.width = img.width + \\\"px\\\";\\n div.style.height = img.height + \\\"px\\\";\\n img.replaceNode(div);\\n }\\n \\n img.style.visibility = \\\"visible\\\";\\n }\\n}\",\n \"function pilau_preload_images() {\\n\\tvar args_len, i, cache_image;\\n\\targs_len = arguments.length;\\n\\tfor ( i = args_len; i--;) {\\n\\t\\tcache_image = document.createElement('img');\\n\\t\\tcache_image.src = arguments[i];\\n\\t\\tcache.push( cache_image );\\n\\t}\\n}\",\n \"function addImages() {\\n var images = ['heroImage', 'legacyLogo'];\\n var img = null;\\n for (var i = 0; i < images.length; i++) {\\n var key = companyInfo['key'];\\n if (companyInfo[images[i]].length > 0) {\\n var url = 'https://media.licdn.com/media' + companyInfo[images[i]];\\n img = $('![]()
');\\n $(img).attr('src', url);\\n img.data('file', null);\\n img.data('name', images[i] + '-' + key);\\n img.data('saved', false);\\n img.data('scraped', true);\\n createThumbnail(img, 'company-image-container');\\n }\\n }\\n}\",\n \"function loadCarousel() {\\n var carousel_images = [\\n \\\"/Content/icons/png/1.jpg\\\",\\n \\\"/Content/icons/png/2.jpg\\\",\\n \\\"/Content/icons/png/3.jpg\\\",\\n \\\"/Content/icons/png/4.jpg\\\",\\n \\\"/Content/icons/png/5.jpg\\\",\\n \\\"/Content/icons/png/6.jpg\\\",\\n \\\"/Content/icons/png/7.jpg\\\",\\n \\\"/Content/icons/png/8.jpg\\\"];\\n\\n $(window).load(function () {\\n $(\\\"#photo_container\\\").isc({\\n imgArray: carousel_images\\n });\\n });\\n }\",\n \"function showLoadedImages(elem) {\\r\\n var i, span, reader, file;\\r\\n document.getElementById(elem).style.display = \\\"inline\\\";\\r\\n document.getElementById(elem).innerHTML = [];\\r\\n for (i = 0; i < images.length; i = i + 1) {\\r\\n file = images[i];\\r\\n reader = new FileReader();\\r\\n reader.onload = (function (file) {\\r\\n var j = i;\\r\\n return function (e) {\\r\\n span = document.createElement('span');\\r\\n span.className = \\\"tile\\\";\\r\\n span.onclick = function () {\\r\\n showImage(j, elem);\\r\\n };\\r\\n span.innerHTML = ['', file.name, '
', file.name, ''].join('');\\r\\n document.getElementById(elem).insertBefore(span, null);\\r\\n };\\r\\n })(file);\\r\\n reader.readAsDataURL(file);\\r\\n }\\r\\n }\",\n \"function beginLoadingImage(arrayIndex, fileName, isGamePic) {\\n if (isGamePic) {\\n gamePics[arrayIndex] = document.createElement(\\\"img\\\");\\n gamePics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\\n gamePics[arrayIndex].src = \\\"images/\\\" + fileName;\\n } else {\\n worldPics[arrayIndex] = document.createElement(\\\"img\\\");\\n worldPics[arrayIndex].onload = countLoadedImageAndLaunchIfReady;\\n worldPics[arrayIndex].src = \\\"images/\\\" + fileName;\\n }\\n}\",\n \"function preload()\\n{\\n dogImage=loadImage(\\\"images/dogImg.png\\\")\\n happyDog=loadImage(\\\"images/Happy.png\\\")\\n //bedroomImg=loadImage(\\\"images/Bed Room.png\\\")\\n//gardenImg=loadImage(\\\"images/Garden.png\\\")\\n//washroomImg=loadImage(\\\"images/Wash Room.png\\\")\\n\\t//load images here\\n}\",\n \"function preloadImages () {\\n\\tif (document.images)\\n\\t\\t{\\n\\t\\t\\tclosed_img = new Image(11,11);\\n\\t\\t\\tclosed_img.src = \\\"images/closed.gif\\\";\\n\\t\\t\\t\\n\\t\\t\\topened_img = new Image(11,11);\\n\\t\\t\\topened_img.src = \\\"images/opened.gif\\\";\\n\\t\\t}\\n\\telse {\\n\\t\\talert (\\\"document.images not found!\\\")\\n\\t}\\n}\",\n \"function loadImages(elem) {\\n if (!elem) {\\n return;\\n }\\n\\n var images = elem.getElementsByTagName('img');\\n\\n var n = images.length;\\n for (var i = 0; i < n; i++) {\\n var image = images[i];\\n\\n if (image.getAttribute('data-src')) {\\n image.src = image.getAttribute('data-src');\\n image.removeAttribute('data-src');\\n }\\n }\\n }\",\n \"function LoadContactRefs() {\\n var imageObjects = $(\\\"img\\\").get();\\n\\n for (var i = 0; i < imageObjects.length; i++) {\\n var img = imageObjects[i];\\n var imageSource = $(img).attr('src');\\n var sourceEnd = imageSource.substring(14, imageSource.length)\\n\\n switch (sourceEnd) {\\n case \\\"github.png\\\": $(img).parent().attr(\\\"href\\\", \\\"https://github.com/captainsalt\\\"); break;\\n case \\\"linkedin.png\\\": $(img).parent().attr(\\\"href\\\", \\\"https://www.linkedin.com/in/david-wright-659006144/\\\"); break;\\n case \\\"stack.png\\\": $(img).parent().attr(\\\"href\\\", \\\"https://stackoverflow.com/users/7107832/captainsalt\\\"); break;\\n }\\n }\\n}\",\n \"function preloadImages() {\\n for (var i = 0; i < numberOfGifsToPreload; i++) {\\n popThenAddImage(fileNamesArray);\\n }\\n }\",\n \"loadImages() {\\n let loadCount = 0;\\n let loadTotal = this.images.length;\\n\\n if (WP.shuffle) {\\n this.images = this.shuffle(this.images);\\n }\\n\\n const imageLoaded = (() => {\\n loadCount++;\\n\\n if (loadCount >= loadTotal) {\\n // All images loaded!\\n this.setupCanvases();\\n this.bindShake();\\n this.loadingComplete();\\n }\\n }).bind(this);\\n\\n for (let image of this.images) {\\n // Create img elements for each image\\n // and save it on the object\\n const size = this.getBestImageSize(image.src);\\n image.img = document.createElement('img'); // image is global\\n image.img.addEventListener('load', imageLoaded, false);\\n image.img.src = image.src[size][0];\\n }\\n }\",\n \"function lazyload(){\\n var scrollTop = $(\\\"html, body\\\").scrollTop();\\n $(\\\"img[data-src]\\\").each(function(){\\n var top = $(this).offset().top - 800;\\n var left = $(this).offset().left;\\n\\n\\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\\\":visible\\\") ){\\n $(this).attr(\\\"src\\\", $(this).attr(\\\"data-src\\\"));\\n }\\n });\\n\\n $(\\\"[data-background-src]\\\").each(function(){\\n var top = $(this).offset().top - 800;\\n var left = $(this).offset().left;\\n if($(this).hasClass(\\\"main-kb-bg\\\")){\\n if(scrollTop >= top){\\n $(this).css(\\\"background-image\\\", \\\"url(\\\"+$(this).attr(\\\"data-background-src\\\")+\\\")\\\");\\n }\\n } else {\\n if(scrollTop >= top && left >= 0 && left < $(window).width() && $(this).is(\\\":visible\\\")){\\n $(this).css(\\\"background-image\\\", \\\"url(\\\"+$(this).attr(\\\"data-background-src\\\")+\\\")\\\");\\n }\\n }\\n\\n });\\n }\",\n \"function loadImages(sources, callback) { \\n\\t\\tfor(var src in sources) { \\t// get num of sources\\n numImages++;\\n }\\n for(var src in sources) {\\n images[src] = new Image();\\n\\t\\t\\timages[src].onload = function() {\\n\\t\\t\\t\\tif(++loadedImages >= numImages) {\\n\\t\\t\\t\\tcallback(images);\\n\\t\\t\\t\\t}\\n\\t\\t\\t};\\n images[src].src = sources[src];\\n }\\n }\",\n \"function loadImages() {\\n var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\\n var urls = opts.urls,\\n _opts$onProgress3 = opts.onProgress,\\n onProgress = _opts$onProgress3 === undefined ? noop : _opts$onProgress3;\\n\\n (0, _assert2.default)(urls.every(function (url) {\\n return typeof url === 'string';\\n }), 'loadImages: {urls} must be array of strings');\\n var count = 0;\\n return Promise.all(urls.map(function (url) {\\n var promise = (0, _browserLoad.loadImage)(url, opts);\\n promise.then(function (file) {\\n return onProgress({\\n progress: ++count / urls.length,\\n count: count,\\n total: urls.length,\\n url: url\\n });\\n });\\n return promise;\\n }));\\n}\",\n \"function createImages()\\n{\\n\\tlargeImg.src = imgArray[0];\\n\\t\\n\\tfor (var i = 0; i < imgArray.length; i++)\\n\\t{\\n\\t\\tfourImgsDiv.innerHTML += \\\"\\\";\\n\\t}\\n}\",\n \"loadImages() {\\n if (this._queue.length > 0) {\\n let img = new Image();\\n let src = this._queue.pop();\\n\\n let name = src.slice(src.lastIndexOf('/') + 1);\\n img.src = src;\\n img.onload = (function() {\\n this.loadImages();\\n }).bind(this);\\n this.images[name] = img;\\n } else {\\n this._callback();\\n }\\n }\",\n \"function loadImages(images, string) {\\n images.forEach((image, index) => {\\n image.style.backgroundImage = \\\"url(./css/img/\\\" + string + (index + 1) + \\\".jpg)\\\";\\n image.style.backgroundSize = \\\"contain\\\";\\n })\\n}\",\n \"function renderImages() {\\n //if ( viewSkins ) { renderSkins(); } // disabled here so plants can be rendered sequentially in plants.js\\n if ( viewSpans ) { renderSpans(); }\\n if ( viewPoints ) { renderPoints(); }\\n if ( viewScaffolding ) { renderScaffolding(); }\\n}\",\n \"function getDirectoryImages() {\\n\\t\\t\\t// show image previews?\\n\\t\\t\\tif (opts.showImgPreview) {\\n\\t\\t\\t\\tdoLoadDirectoryImage($('#browser ul li.GIF, #browser ul li.JPG, #browser ul li.PNG'), 0, sys.currentPathIdx);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function init() {\\n cacheDom();\\n loadImage();\\n }\",\n \"async function loadImages() {\\n let data = arg.splice(1, arg.length - 1);\\n let promise = [];\\n data.forEach(img => {\\n if(typeof img === \\\"string\\\") {\\n let image = Canva2D.API.Preloader(\\\"singleImageOnly\\\", img);\\n promise.push(image);\\n } else if(img.hasOwnProperty(\\\"img\\\") && img.hasOwnProperty(\\\"src\\\")) {\\n let image = Canva2D.API.Preloader(\\\"singleImageOnly\\\", img[\\\"img\\\"], img[\\\"src\\\"]);\\n promise.push(image);\\n } else {\\n let image = Canva2D.API.Preloader(\\\"singleImageOnly\\\", img);\\n promise.push(image);\\n }\\n });\\n return await Promise.all(promise).then(e => {\\n for(const img of e) \\n _IMAGES_STACK.push(img);\\n return _IMAGES_STACK;\\n }).then(e => getImage);\\n }\",\n \"function load_images () {\\n console.log(\\\"load images\\\");\\n\\n GM_addStyle(\\\"#display_img {position: fixed; left: 0px; top: 50px; opacity: 0.6; background-color: #000; width: 100%; height: calc(100% - 50px); display: none;} .postright img {cursor: zoom-in;}\\\");\\n //adds the faded background\\n let div = element(\\\"div\\\").a(\\\"id\\\", \\\"display_img\\\").apthis(document.getElementById(\\\"pagewrapper\\\"));\\n //div that holds the image\\n let div1 = document.createElement(\\\"div\\\");\\n div1.setAttribute(\\\"style\\\", \\\"position: fixed; left: 0px; top: 50px; width: 100%; height: calc(100% - 50px); text-align: center; display: none; cursor: zoom-out;\\\");\\n //the img element that will display the image\\n let img = document.createElement(\\\"img\\\");\\n img.setAttribute(\\\"src\\\", \\\"\\\");\\n img.setAttribute(\\\"id\\\", \\\"display_img_img\\\");\\n div1.appendChild(img);\\n //this causes the faded background and image to disappear\\n document.getElementById(\\\"pagewrapper\\\").appendChild(div1);\\n div1.addEventListener(\\\"click\\\", (event) => {\\n div.style.display = \\\"none\\\";\\n div1.style.display = \\\"none\\\";\\n });\\n\\n let posts = document.getElementsByClassName(\\\"postright\\\");\\n for (let a of posts) {\\n let imgs = a.getElementsByTagName(\\\"img\\\");\\n for (let b of imgs) {\\n b.addEventListener(\\\"click\\\", (event) => {\\n img.setAttribute(\\\"src\\\", event.currentTarget.src);\\n //gets current image size\\n let img_width = event.currentTarget.clientWidth;\\n let img_height = event.currentTarget.clientHeight;\\n //going to be used for the dialation\\n let scale_factor = 1.5;//this is the maximun a small image can be scalled up\\n const display_width = window.innerWidth;\\n const display_height = window.innerHeight - 50;\\n let final_height = 0, final_width = 0;\\n\\n final_height = img_height * scale_factor;\\n final_width = img_width * scale_factor;\\n\\n //this is the best solution to deal with all different screen sizes and images sizes\\n //It have tried making multilayer if/else statemanets but they don't work well for this\\n while (final_height > display_height || final_width > display_width) {\\n scale_factor -= 0.1;\\n final_height = img_height * scale_factor;\\n final_width = img_width * scale_factor;\\n }\\n //makes it cerntered vertically and makes sure it has right hieght and width\\n img.setAttribute(\\\"style\\\", \\\"width:\\\" + final_width + \\\"px; height:\\\" + final_height + \\\"px; position: relative; top:\\\" + (((display_height) / 2) - (final_height / 2)) + \\\"px;\\\");\\n\\n div.style.display = \\\"block\\\";\\n div1.style.display = \\\"block\\\";\\n });\\n }\\n }\\n }\",\n \"function showImages() {\\r\\n const images = document.querySelectorAll('[data-src]');\\r\\n const clientHeight = document.documentElement.clientHeight;\\r\\n for (let img of images) {\\r\\n const coord = img.getBoundingClientRect();\\r\\n let realSrc = img.dataset.src;\\r\\n if (!realSrc) continue;\\r\\n if (coord.top > -clientHeight &&\\r\\n coord.top < clientHeight * 2 ||\\r\\n coord.bottom > -clientHeight &&\\r\\n coord.bottom < clientHeight * 2) {\\r\\n img.src = realSrc;\\r\\n img.dataset.src = '';\\r\\n }\\r\\n }\\r\\n }\",\n \"loadImg() {\\n let loadedCount = 0\\n function onLoad() {\\n loadedCount++\\n if (loadedCount >= this.imgPaths.length) {\\n this.flowStart()\\n }\\n }\\n this.baseImages = this.imgPaths.map(path => {\\n const image = new Image()\\n image.onload = onLoad.bind(this)\\n image.src = path\\n return image\\n })\\n }\",\n \"function loadImage(){\\n $(\\\".image-box\\\").attr(\\\"src\\\", displayedImg.download_url);\\n}\",\n \"function loadImage() {\\n\\t\\t\\tthis.loading = 'eager';\\n\\t\\t\\tif( this.src )\\n\\t\\t\\t\\tthis.src = this.src;\\n\\t\\t\\tif( this.srcset )\\n\\t\\t\\t\\tthis.srcset = this.srcset;\\n\\t\\t}\",\n \"function preloadImages(urls) {\\n urls.forEach(url => {\\n const image = new Image();\\n image.src = url;\\n });\\n}\",\n \"function loadImages(element) {\\n const images = element.querySelectorAll(\\\".menu__slide--image img\\\");\\n images.forEach(image => (image.src = image.dataset.src || image.src));\\n}\",\n \"function preLoad(onLoadAll) {\\n \\n var finished = false;\\n \\n var progressBar = {\\n max : 0,\\n loaded : 0\\n };\\n \\n var updateBar = function() {\\n \\n var percnt = ((progressBar.loaded * 100) / progressBar.max) >> 0;\\n $(\\\"#progress-bar\\\").width(percnt + '%');\\n };\\n \\n var loadImage = function(img) {\\n \\n var e = document.createElement('img');\\n\\n e.onload = function() {\\n\\n progressBar.loaded++;\\n updateBar();\\n\\n if(progressBar.loaded >= progressBar.max) {\\n // once we get here, we are pretty much done, so redirect to the actual page\\n if(!finished) {\\n finished = true;\\n helper.hide('progress-bar', 1000, false);\\n onLoadAll();\\n }\\n }\\n };\\n \\n e.onerror = e.onload;\\n \\n // this will trigger your browser loading the image (and caching it)\\n e.src = img;\\n };\\n \\n //Preload images\\n $.ajax({\\n url: \\\"./json/images.json\\\",\\n success: function(images) {\\n 'use strict';\\n\\n progressBar.max = images.length;\\n\\n var i = 0;\\n\\n while(i < images.length) {\\n loadImage(images[i]);\\n i++;\\n }\\n }\\n });\\n \\n //Preload fonts\\n var canvas = document.createElement('canvas');\\n var ctx = canvas.getContext('2d');\\n ctx.font = '12px Canaro';\\n ctx.fillText('.', 0, 0);\\n}\",\n \"function showImages() {\\n const images = document.querySelectorAll('[data-src]');\\n const clientHeight = document.documentElement.clientHeight;\\n for (let img of images) {\\n const coord = img.getBoundingClientRect();\\n let realSrc = img.dataset.src;\\n if (!realSrc) continue;\\n if (coord.top > -clientHeight &&\\n coord.top < clientHeight * 2 ||\\n coord.bottom > -clientHeight &&\\n coord.bottom < clientHeight * 2) {\\n img.src = realSrc;\\n img.dataset.src = '';\\n }\\n }\\n }\",\n \"function loadImagesSeq() {\\n\\t\\t const button = document.querySelector('#loadImagesSeq');\\n\\t\\t const container = document.querySelector('#image-container');\\n\\t\\t const promises = [];\\n\\t\\t button.addEventListener(\\\"click\\\", (event) => {\\n\\n\\t\\t const images = imageNames();\\n\\n\\t\\t images.forEach((image) => {\\n\\t\\t promises.push(requestInSeq(image, container));\\n\\t\\t });\\n\\t\\t console.log(promises);\\n\\t\\t // when all promises are resolved then this promise is resolved.\\n\\t\\t Promise.all(promises).then((imageDataObjs) => {\\n\\t\\t console.log(imageDataObjs);\\n\\t\\t imageDataObjs.forEach((imageData) => {\\n\\t\\t const imageElement = imageData.imageElement;\\n\\t\\t const imageSrc = imageData.objectURL;\\n\\t\\t imageElement.src = imageSrc;\\n\\t\\t });\\n\\n\\t\\t });\\n\\t\\t });\\n\\n\\n\\t\\t}\",\n \"LoadImage(){\\n var images=[]\\n // hard coded for convenienceproxy to a static serving end point\\n if(this.state.images!=undefined){\\n this.state.images.map(i =>{\\n images.push(\\n this.request.getStamp()+'-' + i\\n )\\n })\\n return images; \\n }\\n else{\\n \\n return null\\n }\\n }\",\n \"function fetch_video_html_images() { \\n var path = window.location.pathname;\\n var page = path.split(\\\"/\\\").pop();\\n\\n if(page === 'video.html') {\\n // Create element\\n const div = document.createElement(\\\"div\\\");\\n div.className = 'video-items';\\n\\n let output = '';\\n const datas = Object.entries(countries);\\n // console.log(datas);\\n\\n datas.forEach(d=> {\\n // console.log(d[1][0]);\\n output += `\\n \\n \\n ${d[0]}\\n \\n `;\\n });\\n\\n div.innerHTML= output;\\n\\n document.querySelector(\\\".video-container\\\").insertAdjacentElement(\\\"beforeend\\\", div);\\n\\n // console.log(output);\\n }\\n }\",\n \"function loadImages(sources, callback) {\\n \\tvar images = {};\\n\\n for(var src in sources) {\\n \\timages[src] = new Image();\\n \\timages[src].onload = callback;\\n \\timages[src].src = sources[src];\\n }\\n return images;\\n }\",\n \"function load_imdb_images () {\\n return new Promise (resolve => {\\n $.spinnerWait (true);\\n userLog (\\\"Det här kan ta några minuter ...\\\", true, 5000)\\n let cmd = '$( pwd )/ld_imdb.js -e ' + $(\\\"#imdbPath\\\").text (); // pwd = present working dir\\n execute (cmd).then ( () => {\\n // $ (\\\"button.updText\\\").css (\\\"float\\\", \\\"right\\\");\\n // $ (\\\"button.updText\\\").hide ();\\n resolve (\\\"Done\\\")\\n });\\n });\\n}\",\n \"function lazyLoad() {\\n lazyImages.forEach(image => {\\n if (image.offsetTop < window.scrollY + 150) {\\n image.style.backgroundImage =\\n `url(${image.getAttribute('data-src')})`;\\n image.classList.add('loaded')\\n }\\n })\\n}\",\n \"function init() {\\n cacheDom();\\n loadImage();\\n }\",\n \"function preloadImages(images) {\\n imagesAmount = images.length;\\n for (var i = 0; i < images.length; i++) {\\n var img = new Image();\\n img.addEventListener('load', imageLoadedCallback, false);\\n img.src = basePath + 'images/' + images[i];\\n }\\n }\",\n \"function displayPages() {\\r\\n // Retrieve the the pages div element.\\r\\n var $pageDiv = $(\\\"#pageDiv\\\");\\r\\n \\r\\n // Clear the page div.\\r\\n while ($pageDiv[0].firstChild)\\r\\n $pageDiv[0].removeChild($pageDiv[0].firstChild);\\r\\n \\r\\n // Iterate through all of the pages in the pagesList.\\r\\n for (var i = 0; i < pageList.length; i++) {\\r\\n var page = pageList[i];\\r\\n \\r\\n // Create a new image element to represent the page.\\r\\n var img = document.createElement(\\\"IMG\\\");\\r\\n img.onload = function() {\\r\\n $(this).hide().pageToggle();\\r\\n };\\r\\n img.src = \\\"/ShowAndTellProject/\\\" + page.audio;\\r\\n img.id = \\\"pageThumbnail\\\";\\r\\n \\r\\n // Add highlight functionality to the image element.\\r\\n highlight(img);\\r\\n \\r\\n // Add the image to the pages div.\\r\\n $pageDiv.append(img); \\r\\n }\\r\\n}\",\n \"function showImages() {\\n var\\n last = imgs.length,\\n current,\\n allImagesDone = true;\\n\\n for (current = 0; current < last; current++) {\\n var img = imgs[current];\\n // if showIfVisible is false, it means we have some waiting images to be\\n // shown\\n if(img !== null && !showIfVisible(img, current)) {\\n allImagesDone = false;\\n }\\n }\\n\\n if (allImagesDone && pageHasLoaded) {\\n }\\n }\",\n \"function LoadImage(ImageID){\\r\\n\\tLoaded_Images_array_current = Loaded_Images_array.indexOf(ImageID);\\r\\n\\t// console.debug(Loaded_Images);\\r\\n\\t\\r\\n\\tvar ImageThumb = Loaded_Images[ImageID].thumb\\r\\n\\tvar ImageMain = Loaded_Images[ImageID].main\\r\\n\\tvar LoadingImage = true;\\r\\n\\r\\n\\t\\r\\n\\t// Sets the link on the image to the image page\\r\\n\\t$nav_content_img.parent().attr('href',Loaded_Images[ImageID].link)\\r\\n\\t\\r\\n\\t// Formats all the tags into a list of links\\r\\n\\tvar ImageTagsFormatted = [];\\r\\n\\tvar ImageTags = Loaded_Images[ImageID].tags.split(\\\" \\\");\\r\\n\\t$.each(ImageTags, function(index, value) {\\r\\n\\t\\tImageTagsFormatted.push(''+value+'');\\r\\n\\t})\\r\\n\\t\\r\\n\\t$('.image_nav_background').show();\\r\\n\\t$image_nav_overlay.show();\\r\\n\\t$nav_thumb_img.show();\\r\\n\\t$text_overlay.empty().append(''+Loaded_Images[ImageID].filename+' | Page '+Loaded_Images[ImageID].page+' | Image '+Loaded_Images[ImageID].number+'
'+ImageTagsFormatted.join(' | '))\\r\\n\\t\\r\\n\\t$nav_content_img\\r\\n\\t.data('ImageId',ImageID)\\r\\n\\t\\r\\n\\tvar current_status = Loaded_Images[ImageID].status;\\r\\n\\t\\r\\n\\t// Loads the image if it's already been verified previously.\\r\\n\\tif(current_status == 'loaded' || current_status == 'error'){\\r\\n\\t\\t$nav_content_img.attr('src',ImageMain)\\r\\n\\t\\tif(current_status != 'loading')$nav_thumb_img.hide();\\r\\n\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',ImageMain)\\r\\n\\t\\t\\r\\n\\t\\tRepositionMainImage();\\r\\n\\t\\r\\n\\t// Checks each image extension until it finds a working one\\r\\n\\t}else if(current_status == 'waiting'){\\r\\n\\t\\tLoaded_Images[ImageID].status = 'loading';\\r\\n\\t\\tGM_xmlhttpRequest({\\r\\n\\t\\t\\tmethod: \\\"GET\\\",\\r\\n\\t\\t\\turl: '/'+Loaded_Images[ImageID].link,\\r\\n\\t\\t\\tonload: function(retour) {\\r\\n\\t\\t\\t\\tLoaded_Images[ImageID].verified = true\\r\\n\\t\\t\\t\\tvar image;\\r\\n\\t\\t\\t\\tvar ResponseHTML = $(retour.responseText);\\r\\n\\t\\t\\t\\tvar ImageServer = $('div.content script:contains(\\\"image\\\"):contains(\\\"domain\\\"):contains(\\\"base_dir\\\")',ResponseHTML).text();\\r\\n\\t\\t\\t\\teval(ImageServer)\\r\\n\\t\\t\\t\\tvar new_image_url = image.domain+\\\"/\\\"+image.base_dir+\\\"/\\\"+image.dir+\\\"/\\\"+image.img;\\r\\n\\t\\t\\t\\tLoaded_Images[ImageID].main = new_image_url\\r\\n\\t\\t\\t\\t$(\\\"![]()
\\\")\\r\\n\\t\\t\\t\\t\\t.attr(\\\"src\\\", new_image_url)\\t\\r\\n\\t\\t\\t\\t\\t.one('load',function(){\\r\\n\\t\\t\\t\\t\\t\\tLoaded_Images[ImageID].status = 'loaded';\\r\\n\\t\\t\\t\\t\\t// Checks to make sure the successfully loading image actually is the one selected, since the load function for a previous image might be called after the user has switched to another.\\r\\n\\t\\t\\t\\t\\t\\tif($nav_content_img.data('ImageId') == ImageID){\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_content_img.attr('src',new_image_url);\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_thumb_img.hide();\\r\\n\\t\\t\\t\\t\\t\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\\r\\n\\t\\t\\t\\t\\t\\t\\tRepositionMainImage();\\r\\n\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t})\\r\\n\\t\\t\\t\\t\\t.one('error',function(){\\r\\n\\t\\t\\t\\t\\t\\tLoaded_Images[ImageID].status = 'error';\\r\\n\\t\\t\\t\\t\\t\\tif($nav_content_img.data('ImageId') == ImageID){\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_content_img.attr('src','/images/404.gif').one('load',function(){RepositionMainImage();});\\r\\n\\t\\t\\t\\t\\t\\t\\t$nav_thumb_img.hide();\\r\\n\\t\\t\\t\\t\\t\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',new_image_url)\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t});;\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\\r\\n\\t\\r\\n\\t// Prevent left and right scrolling in background\\r\\n\\t$('body').css({'overflow-x' : 'hidden', 'overflow-y': 'hidden'})\\r\\n}\",\n \"function findImages(){\\n var parentDir = \\\"./desc/civic_2012\\\";\\n \\n console.log(parentDir);\\n var fileCrowler = function(data){\\n var titlestr = $(data).filter('title').text();\\n // \\\"Directory listing for /Resource/materials/xxx\\\"\\n var thisDirectory = titlestr.slice(titlestr.indexOf('/'), titlestr.length)\\n\\n //List all image file names in the page\\n $(data).find(\\\"a\\\").attr(\\\"href\\\", function (i, filename) {\\n if( filename.match(/\\\\.(jpe?g|png|gif)$/) ) { \\n var fileNameWOExtension = filename.slice(0, filename.lastIndexOf('.'))\\n // var img_html = \\\"\\\".format(thisDirectory + filename, fileNameWOExtension, fileNameWOExtension);\\n // $(\\\"#sm_image\\\").append(img_html);\\n $( \\\".templ\\\" ).appendTo( \\\"#sm_image\\\" );\\n }\\n else{ \\n $.ajax({\\n url: thisDirectory + filename,\\n success: fileCrowler\\n });\\n }\\n });}\\n\\n $.ajax({\\n url: parentDir,\\n success: fileCrowler\\n });\\n}\",\n \"function load_media()\\n{\\n bg_sprite = new Image();\\n bg_sprite.src = \\\"images/Background-stadt_lang.png\\\";\\n box_sprite = new Image();\\n box_sprite.src = \\\"images/Stift.png\\\";\\n main_sprite = new Image();\\n main_sprite.src = \\\"images/IMG_2210_Mini.png\\\";\\n}\",\n \"function startImgStatus(){\\n var img = document.createElement('img'); // Hack to extract absolute url\\n $jQ('img').each(function(){\\n img.src=$jQ(this).attr('src');\\n setLink($jQ(this),'src', img.src);\\n });\\n}\"\n]"},"negative_scores":{"kind":"list like","value":["0.7676688","0.731364","0.73070186","0.71697855","0.7169777","0.7163216","0.7148358","0.7096101","0.70113856","0.6933231","0.6932604","0.6905027","0.6893312","0.6842709","0.68203217","0.6815961","0.68065524","0.6800416","0.6784943","0.6782312","0.6781785","0.67740965","0.67655426","0.67486274","0.6746114","0.6744704","0.67271554","0.67201483","0.66962916","0.6683502","0.66795224","0.66738015","0.66700095","0.66521937","0.6647351","0.66462153","0.663513","0.6633545","0.6631216","0.65984666","0.6582906","0.65764487","0.6570141","0.6568608","0.6567403","0.65654916","0.6552041","0.65471315","0.6530931","0.6512293","0.6509736","0.64923954","0.6491187","0.6486816","0.64857817","0.6484542","0.64781225","0.6456162","0.6448061","0.64363563","0.643174","0.64248437","0.64221454","0.6409288","0.6399283","0.6396185","0.6387334","0.6387277","0.63857067","0.63850623","0.6384308","0.63661546","0.63619304","0.63554865","0.6351606","0.6350221","0.634836","0.63385725","0.6332649","0.63317084","0.6329298","0.63284594","0.63280773","0.63216704","0.63143826","0.6310112","0.6308037","0.6298355","0.6297974","0.62956744","0.6295391","0.628929","0.6289254","0.6287079","0.628348","0.6277684","0.62660134","0.6263837","0.6256909","0.6254528","0.62508744"],"string":"[\n \"0.7676688\",\n \"0.731364\",\n \"0.73070186\",\n \"0.71697855\",\n \"0.7169777\",\n \"0.7163216\",\n \"0.7148358\",\n \"0.7096101\",\n \"0.70113856\",\n \"0.6933231\",\n \"0.6932604\",\n \"0.6905027\",\n \"0.6893312\",\n \"0.6842709\",\n \"0.68203217\",\n \"0.6815961\",\n \"0.68065524\",\n \"0.6800416\",\n \"0.6784943\",\n \"0.6782312\",\n \"0.6781785\",\n \"0.67740965\",\n \"0.67655426\",\n \"0.67486274\",\n \"0.6746114\",\n \"0.6744704\",\n \"0.67271554\",\n \"0.67201483\",\n \"0.66962916\",\n \"0.6683502\",\n \"0.66795224\",\n \"0.66738015\",\n \"0.66700095\",\n \"0.66521937\",\n \"0.6647351\",\n \"0.66462153\",\n \"0.663513\",\n \"0.6633545\",\n \"0.6631216\",\n \"0.65984666\",\n \"0.6582906\",\n \"0.65764487\",\n \"0.6570141\",\n \"0.6568608\",\n \"0.6567403\",\n \"0.65654916\",\n \"0.6552041\",\n \"0.65471315\",\n \"0.6530931\",\n \"0.6512293\",\n \"0.6509736\",\n \"0.64923954\",\n \"0.6491187\",\n \"0.6486816\",\n \"0.64857817\",\n \"0.6484542\",\n \"0.64781225\",\n \"0.6456162\",\n \"0.6448061\",\n \"0.64363563\",\n \"0.643174\",\n \"0.64248437\",\n \"0.64221454\",\n \"0.6409288\",\n \"0.6399283\",\n \"0.6396185\",\n \"0.6387334\",\n \"0.6387277\",\n \"0.63857067\",\n \"0.63850623\",\n \"0.6384308\",\n \"0.63661546\",\n \"0.63619304\",\n \"0.63554865\",\n \"0.6351606\",\n \"0.6350221\",\n \"0.634836\",\n \"0.63385725\",\n \"0.6332649\",\n \"0.63317084\",\n \"0.6329298\",\n \"0.63284594\",\n \"0.63280773\",\n \"0.63216704\",\n \"0.63143826\",\n \"0.6310112\",\n \"0.6308037\",\n \"0.6298355\",\n \"0.6297974\",\n \"0.62956744\",\n \"0.6295391\",\n \"0.628929\",\n \"0.6289254\",\n \"0.6287079\",\n \"0.628348\",\n \"0.6277684\",\n \"0.62660134\",\n \"0.6263837\",\n \"0.6256909\",\n \"0.6254528\",\n \"0.62508744\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81767,"cells":{"query":{"kind":"string","value":"Event Handler for click on picture"},"document":{"kind":"string","value":"function handleUserClick(event) {\n event.preventDefault();\n\n if (event.target.id === 'left') {\n catalogArray[randomIndex1].tallyClicked += 1;\n }\n\n else if (event.target.id === 'center') {\n catalogArray[randomIndex2].tallyClicked += 1;\n }\n\n else if (event.target.id === 'right') {\n catalogArray[randomIndex3].tallyClicked += 1;\n }\n else {\n alert('Pick a product!');\n return;\n }\n console.log('I clicked' + event.target.id);\n\n surveyLength += 1;\n localStorage.setItem('userResults', JSON.stringify(catalogArray));\n\n loadImages();\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["onImageClick() {\n console.log('Clicked Image')\n }","function imgClick(event) {\n\n}","imageClickHandler() {\n\t\tconst {data} = this.props,\n\t\t\tlistOfPhotos = document.querySelector('.gallery__photo-list');\n\n\t\tlistOfPhotos.addEventListener('click', e => {\n\t\t\tconst {target} = e,\n\t\t\t\t{imageMinId: id} = target.dataset;\n\n\t\t\tif (target.tagName !== 'IMG') return;\n\t\t\tthis.props.currentPhoto = +id;\n\t\t\tthis.changeGeneralPhoto(+id);\n\t\t\tthis.selectImageHandler();\n\t\t});\n\t}","function handleClick(event)\n{\n\t// Gets position of click\n\tvar rect = canvas.getBoundingClientRect();\n\tvar posx = event.clientX - rect.left;\n\tvar posy = event.clientY - rect.top;\n\t\n\t// Checks each object to see if it was clicked\n\tfor (var i = 0; i < clickable.length; i++)\n\t{\n\t\t// If image was clicked, runs specified function\n\t\tif (posx >= clickable[i].x && posx <= clickable[i].x + clickable[i].width &&\n\t\t\tposy >= clickable[i].y && posy <= clickable[i].y + clickable[i].height)\n\t\t{\n\t\t\tclickable[i].func();\n\t\t}\n\t}\n}","function clickImage (data){\n\t\t\n\t\t/*click function on each image*/\n\t\tdelegate(\"body\",\"click\",\".clickMe\",(event) => {\n\t\t\t\n\t\t\tevent.preventDefault();\n\t\t\tvar dataCaptionId=getKeyFromClosestElement(event.delegateTarget);\n\t\t\tvar dataCaption = data.caption;\n\t\t\tdataCaption = dataCaption.replace(/\\s+/g, \"\");\n\t\t\t\n\t\t\t//match the id and render pop up with the data\n\t\t\tif (dataCaption == dataCaptionId){\n\t\t\t\trenderPopup(data, container) \n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t}","function onImageClick(event) {\n var imageWrap = document.querySelector('.image_wrap');\n if(!imageWrap.classList.contains('image_displayed')) return;\n\n if(imageWrap.classList.contains('positioning')) {\n var posRel = getPositionRel(event, document.querySelector('.image_wrap .image_con'));\n\n if(posRel.x >= 0 && posRel.x <= 1\n && posRel.y >= 0 && posRel.y <= 1) {\n placePinSelection(posRel);\n event.stopPropagation();\n }\n }\n\n if(imageWrap.classList.contains('moving')) {\n // ignore moving click events, mouse/touch events do everything\n event.stopPropagation();\n event.preventDefault();\n }\n }","function onImgClick () {\n $ ('.img-wrap').one ('click', function (e) {\n console.log ('image clicked');\n console.log (characters);\n attackSound.play ();\n $ ('#selected-character-id').css ('border', 'solid 5px greenyellow');\n $ (this).off (e);\n });\n }","function imgClicked(e)\n{\n\tlargeImg.src = e.target.src;\n}","function handleClick(e) {\n const src = e.currentTarget.querySelector('img').src;\n const href = this.childNodes[0].nextSibling.href;\n overlayLink.href = href;\n overlayLink.innerText = href;\n overlayImage.src = src;\n overlay.classList.add('open');\n }","function clickOnImage(event)\n{\n\tif ($(\"#country_selected\").val() != '0')\n\t{\n\t\tvar e = event || window.event;\n\t\tvar pos = getRelativeCoordinates(event, $(\"#reference\").get(0));\n\t\tvar m = $(\"#marker\").get(0);\n\t\tdisplayMarker(pos.x, pos.y);\n\t}\n}","function clickOnThumbnail() {\n\tgetPhotoUrl($(this));\n\t$container.append($photoviewer.append($photoBox).append($caption));\n\t$photoBox.after($leftClick);\n\t$photoBox.before($rightClick);\n\t$(\"html\").css(\"background\",\"gray\");\n\t//All other images are not visible\n\t$(\".thumbnail\").addClass(\"greyed-out\");\n\t$(\".small-img\").hide();\n\t$leftClick.on(\"click\",leftClick);\n\t$rightClick.on(\"click\",rightClick);\n}","function handleImageClick(event) {\n if (isDragAndDropSupported || !instance) {\n return;\n }\n\n const target = event.target;\n\n fetch(target.src)\n .then((r) => r.blob())\n .then((blob) => {\n const pageIndex = instance.viewState.currentPageIndex;\n const pageInfo = instance.pageInfoForIndex(pageIndex);\n\n insertImageAnnotation(\n new PSPDFKit.Geometry.Rect({\n width: target.width,\n height: target.height,\n left: pageInfo.width / 2 - target.width / 2,\n top: pageInfo.height / 2 - target.height / 2,\n }),\n blob,\n pageIndex\n );\n });\n}","function ChoosePhoto(e) {\n console.log(\"gggg\");\n getPhoto(pictureSource.PHOTOLIBRARY);\n }","function imgClicked(imgId) {\n gMeme.selectedImgId = imgId;\n}","function clickRegularViewFocusImg(e) {\n\n var clickedThing = e.target;\n\n // if clicked element is a single image or the focus img in a gallery\n if (clickedThing.classList.contains('clickme')) {\n\n // define imgToShow\n var imgToShow = clickedThing;\n\n // call NAMED lightbox function\n lightbox(imgToShow);\n\n // call NAMED function to populate lightbox dots\n populateLightboxDots(imgToShow);\n\n } // close if ('clickme')\n} // close function","function handleClick(e) {\n\tSTATE.popupOpen = true\n\tconst elem = closest(e.target, '[data-type=image]')\n\tconst i = parseInt(elem.getAttribute('data-index'), 10)\n\tSTATE.popup.innerHTML = popupContent({ elem: content.parts[i], index: i })\n}","function clickFunc(event) {\n\t//alert(event);\n\tvar e = event;\n\t//console.log(typeof e);\n\t\n\tif(event.target !== event.currentTarget) {\n\t\tvar clickedItem = event.target.id;\n\t\t//alert(\"this is the image id = \"+clickedItem);\n\t}\n \n}","function addEventOpenImages() {\n document.addEventListener('click', function (evt) {\n if (evt.target.parentNode.classList.contains('picture')) {\n evt.preventDefault();\n showImage(evt.target.parentNode);\n }\n });\n }","function clickHandler(event) {\n //take the path from the src attribute of the img node\n //that we clicked on. We get a reference to that node\n //from event.target\n var targetString = event.target.src;\n //take the relevant part of the path from the node\n var targetPath = targetString.split('assets')[1];\n var itemPath;\n\n //look through the ItemImage objects to find the one that\n //corresponds to the image we clicked on\n for (var i = 0; i < items.length; i++) {\n //get the relevant part from the path on the object\n itemPath = items[i].path.split('assets')[1];\n if (itemPath === targetPath) {\n //when we find the right object increment its clicked\n //property\n items[i].clicked += 1;\n }\n }\n\n changePicture();\n}","imageClick(e) {\n e.preventDefault();\n\n if (this.item.link) {\n window.open(this.item.link, '_blank');\n } else {\n this.shadowRoot.querySelector('#image-dialog').open();\n\n HhAnalytics.trackDialogOpen(this.item.internalTitle);\n }\n }","function imageSelect(){\n\tvar getPhoto = document.getElementById(\"userPhoto\");\n\tgetPhoto.click();\n}","initiatePictureCapture(){this.imageInput.trigger('click')}","function handleImgClick(event) {\n if (event.target.id === 'left') {\n allImages[leftImg].clicked += 1;\n console.log(allImages[leftImg].imgname + ' ' + allImages[leftImg].clicked);\n counter += 1;\n pick3();\n }\n if (event.target.id === 'center') {\n allImages[centerImg].clicked += 1;\n console.log(allImages[centerImg].imgname + ' ' + allImages[centerImg].clicked);\n counter += 1;\n pick3();\n }\n if (event.target.id === 'right') {\n allImages[rightImg].clicked += 1;\n console.log(allImages[rightImg].imgname + ' ' + allImages[rightImg].clicked);\n counter += 1;\n pick3();\n }\n if (event.target.id === 'imgContain') {\n alert('You need to click on an image!');\n pick3();\n }\n}","function clickHandler(event) {\r\n console.log(event.target);\r\n var imageName = event.target.alt;\r\n for (var i = 0; i < pictures.length; i++) {\r\n if (pictures[i].name === imageName) {\r\n pictures[i].updateChosen();\r\n picked++;\r\n }\r\n }\r\n\r\n if (picked === 25) {\r\n removeListener();\r\n chartData();\r\n showResults();\r\n var dataAsString = JSON.stringify(pictureData);\r\n localStorage.setItem('data', dataAsString);\r\n var nameAsString = JSON.stringify(labels);\r\n localStorage.setItem('pictures', nameAsString);\r\n }\r\n\r\n previousSet = thisSet;\r\n thisSet = {};\r\n setupImageContainer();\r\n}","function imgClick(event) {\n var clickTargetPath = $(event.target).attr('src'), // find the click target\n $lightbox = $('#image_show'),\n $boxImage = $('#image_show img');\n // check to see if lightbox is already displayed\n if ($lightbox.hasClass('display_img')) {\n closeLightbox();\n return\n }\n // attach a click listener for closing the lightbox\n $(window).click(closeLightbox);\n $boxImage.click(function(evt){\n evt.stopPropagation() // ignore clicks on the lightbox image\n })\n // change lightbox image targete\n $boxImage.attr('src', clickTargetPath);\n // display the lightbox\n $lightbox.addClass('display_img').removeClass('display_none');\n}","function imageClick(){\n\t$('.pic').click(function() { \n\t\tmenuModal.style.display = \"block\";\n\t\twindow.onclick = function(event) {\n\t\t\tif (event.target == menuModal) {\n\t\t\t\tmenuModal.style.display = \"none\";\n\t\t\t}\n\t\t}\n\t});\n}","function mouseClicked(){\n if(current_img == null) current_img = flowers_img;\n if(mouseX>=0 && mouseX=0 && mouseY maxClicks) {\n imagesParent.removeEventListener ('click', picClickHandler);\n setUpList();\n displayChart();\n } else {\n for (var i = 0; i < currentImages.length; i++) {\n productObject[currentImages[i]].timesShown++;\n }\n\n previousImages = currentImages;\n currentImages = [];\n\n var clicked = event.target.getAttribute('id');\n productObject[clicked].timesClicked++;\n\n imagesParent.removeChild(imagesParent.lastChild);\n imagesParent.removeChild(imagesParent.lastChild);\n imagesParent.removeChild(imagesParent.lastChild);\n\n userClicks++;\n setProductState (productObject, currentImages, previousImages, userClicks);\n\n start();\n }\n}","changeModalPicFromHomepage(clickedPhoto) {\n console.log('Target', event);\n console.log('changing pic', clickedPhoto);\n //set the state of the current photo to the photo that was clicked\n this.setState({\n modalCurrentPhoto: clickedPhoto\n });\n }","function clickHandler(e) {\n // Nur bei Linksklick\n if (e.button !== 0) return;\n clickAt(e.offsetX, e.offsetY);\n }","function changeImage(){\n\t\t$('#fileImagen').click();\n\t}","function imgClick(evt){\n\treturn imgDerecha(evt) ? btnnext(evt) : btnback(evt);\n}","handleClick( event ){ }","function clickOnImageLink(e)\n{\n\t// http://pit.dirty.ru/dirty/1/2011/04/15/28284-142540-32deef3d70482f072b516ac3a723533d.gif\n\tvar imgPreview = document.createElement('img');\n\timgPreview.setAttribute('src', this.href );\n\tvar imgLink = document.createElement('a');\n\timgLink.setAttribute('href', '#');\n\t_$.addEvent( imgLink, 'click', function(e) { this.previousSibling.setAttribute('style', this.previousSibling.getAttribute('bkpstyle')); this.parentNode.removeChild(this ); e.preventDefault(); return false; });\n\timgLink.appendChild( imgPreview );\n\t_$.insertAfter(this, imgLink);\n\tthis.setAttribute('bkpstyle', this.getAttribute('style'));\n\tthis.setAttribute('style', 'display: none');\n\te.preventDefault();\n\treturn false;\n}","function actualTakePhoto() {\n $(\"#capture\").click();\n}","function onClick(e) {\n if (e.target.dataset.source === undefined) {\n return;\n }\n onClickModalOpener();\n imagePlacer(onClickUrl(e));\n if (modalEL.classList.contains(\"is-open\")) {\n window.addEventListener(\"keydown\", onEsc);\n document\n .querySelector(\"div.lightbox__overlay\")\n .addEventListener(\"click\", onCloseClick);\n }\n window.addEventListener(\"keydown\", horizontalSlider);\n}","function imageClicked(eventData) {\n let clickInformation = eventData;\n if ( clickInformation.target.className = 'image') {\n if (clickInformation.target.alt === \"rock\") {\n let playerSelection = \"rock\";\n rockImage.classList.add('image','playerWeapon');\n outcome = playRound(playerSelection, computerPlay());\n \n if (playerScore != 5 && compScore != 5) {\n whoWon(outcome);\n \n }\n\n } else if (clickInformation.target.alt === \"paper\") {\n let playerSelection = \"paper\";\n paperImage.classList.add('image','playerWeapon');\n outcome = playRound(playerSelection, computerPlay());\n\n if (playerScore != 5 && compScore != 5) {\n whoWon(outcome);\n \n }\n \n } else if (clickInformation.target.alt === \"scissors\") {\n let playerSelection = \"scissors\";\n scissorsImage.classList.add('image','playerWeapon');\n outcome = playRound(playerSelection, computerPlay());\n\n if (playerScore != 5 && compScore != 5) {\n whoWon(outcome);\n \n }\n }\n }\n \n }","function selectImage(e) {\r\n if(e.target.innerHTML === \"\") //ensures only images can be clicked\r\n removeClasses(e);\r\n\r\n }","function imgOnclickEvt (img, data) {\n\t\treturn function () {\n\t\t\tshowImage (img, data);\n\t\t}\n\t}","render () {\n return (\n \n \n \n )\n }","function selectChoice(event){\n console.log(event.target.id);\n var k = event.target.id;\n console.log('yo', event.target);\n imgObjArr[k].numClicks++;\n console.log('hey', imgObjArr[k]);\n console.log('target clicks:', imgObjArr[k].numClicks);\n if (totalClicks < 25) {\n fillImages();\n } else {\n alert('Thank you for participating in our study!');\n save();\n buildTable();\n }\n}","function clickImage(e){\n if( e.target.id === 'left_goat_img' || e.target.id === 'right_goat_img'){\n pickRandomImages();\n totalClicks++;\n }\n if(event.target.id === 'left_goat_img'){\n leftGoatThatIsOnThePage.likes++;\n }\n if(event.target.id === 'right_goat_img'){\n rightGoatThatIsOnThePage.likes++;\n }\n if(totalClicks === 6){\n //remove event listener\n groupImageSection.removeEventListener('click' , clickImage);\n rightGoatImage.remove();\n leftGoatImage.remove();\n renderChartResults();\n }\n}","function pickedImg() { //the clicked img will be run every other time\n for ( var k = 0; k < imgShort.length; k +=2 ) {\n };\n function clicky(event) {\n var clicked1 = event.target.id;\n document.getElementById('img_box').addEventListener('click', clicky);\n }\n}","function imgClick(e) {\n musicInfo = e.target.alt;\n splitInfo = musicInfo.split('_');\n DOMString.getCurrentMusicVideoTitle.textContent = splitInfo[0];\n DOMString.getCurrentMusicVideoArtist.textContent = splitInfo[1];\n DOMString.getCurrentMusicVideo.src = e.target.dataset.src;\n\n DOMString.getCurrentMusicVideoHeading.classList.add('fadeIn');\n setTimeout(() => DOMString.getCurrentMusicVideoHeading.classList.remove('fadeIn'), 500);\n }","handleJDotterClick() {}","function imgClick(img) {\n window.event.stopPropagation();\n document.querySelector(`#grey-screen`).classList.toggle(\"hide\");\n document.querySelector(`#zoom-img`).src = img;\n}","function thumbnailClickHandler(evt) {\n var target = evt.target;\n if (!target || !target.classList.contains('thumbnail'))\n return;\n\n if (currentView === thumbnailListView || currentView === fullscreenView) {\n showFile(parseInt(target.dataset.index));\n }\n else if (currentView === thumbnailSelectView) {\n updateSelection(target);\n }\n else if (currentView === pickView) {\n cropPickedImage(files[parseInt(target.dataset.index)]);\n }\n}","function img_click(i){\n i.onclick=function(){\n modal.style.display=\"block\";\n modalImg.src=this.src;\n }\n}","function handleImgClick(e){\n modal.style.display = \"block\";\n console.log(e);\n let image=e.currentTarget.src;\n modalImg.src=image;\n captionText.innerHTML = e.currentTarget.getAttribute(\"alt\");\n}","function load_click() {\n if ($('random_front_picture') != null) {\n Event.observe('random_front_picture', 'click', function(e) {\n e.stop()\n to = $('random_front_picture').href \n new Ajax.Request(to)\n })\n }\n}","function choose_img(files_id) { // function choose img upload from file in your folder.\r\n $(\"#\" + files_id).click();\r\n}","clicked(x, y) {}","function clickImage(object){\n document.location = page.PRODUCT + '?id=' + object.id;\n}","function handleImageClick(event) {\n console.log(event.target.alt);\n //iterate through array to check that event has been clicked\n for (var i = 0; i < allProducts.length; i++) {\n if (event.target.alt === allProducts[i].name) {\n allProducts[i].votes++;\n }\n }\n //in order to get a random image which allows new photos to be displayed call randomImage Function\n randomImage();\n}","function uploadAvatar(){\n\t$('#avatarPhoto').click();\n}","putImage(button){\n if(button.code == -1){//al ser clickeada la locación, se enrutará a la página de locaciones y su subbsección respectiva\n switch(this.easyFrame){\n case 0:\n window.location.href = \"location.html#cove\";\n return;\n case 1:\n window.location.href = \"location.html#darkest-dungeon\";\n return;\n case 2:\n window.location.href = \"location.html#ruins\";\n return;\n case 3:\n window.location.href = \"location.html#warrens\";\n return;\n case 4:\n window.location.href = \"location.html#weald\";\n return;\n case 5:\n window.location.href = \"location.html#courtyard\";\n return;\n case 6:\n window.location.href = \"location.html#farmstead\";\n return;\n default:\n return;\n }\n\n }\n //en caso que se clickee un botón, se ajusta el frame de la locación y se vuelve visible, además se le agrega su interactividad\n this.areaPicture.setFrame(button.code);\n this.easyFrame = button.code;\n this.areaPicture.setVisible(true);\n this.areaPicture.setInteractive();\n this.areaPicture.on('clicked', this.putImage, this);\n }","function choiceClick(counter) {\n $('#picture .slick-next').trigger('click');\n $('.img-overlay').find('.click-overlay').parent().next().find('.overlay').addClass('click-overlay');\n $('#picture-array .slick-next').trigger('click');\n $('.image_number').html(counter + 1 + ' of 46');\n}","_onClick({x,y,object}) {\n console.log(\"Clicked icon:\",object);\n }","function on_click(e) {\n cloud.on_click(e.clientX, e.clientY);\n}","function onImageClick(imageId) {\n setMemeImgId(imageId)\n drawImgFromlocal(imageId);\n setTimeout(function () {\n document.querySelector('.header2').style.display = 'none';\n document.querySelector('main').style.display = 'none';\n document.querySelector('.my-info').style.display = 'none';\n document.querySelector('.canvas-btn-container').style.display = 'flex';\n resizeCanvas();\n }, 10)\n}","function handleClick(event)\n{\n}","function clickHandler(theEvent) {\n//outerHTML repalces the whole html including the tags\n var theImage = theEvent.target.outerHTML;\n //changing the class of image_show from display_none to display_img\n imgDiv.className = \"display_img\";\n //changing the html in the image_show by inserting the html from the thumbnail\n imgDiv.innerHTML = theImage;\n}","function handlePlanImage(id) {\n alert(id);\n }","function selectImage(event) {\n\n const button = event.currentTarget\n const buttons = document.querySelectorAll('.images button')\n\n buttons.forEach((button) => {\n button.classList.remove('active')\n })\n //adicionar a classe active para o botão clicado\n button.classList.add('active')\n\n\n //selecionara a imagem clicada\n const image = button.children[0]\n const imageContainer = document.querySelector('.orphanage-details > img')\n //atualizar o container de imagem\n imageContainer.src = image.src\n\n}","handleArrowClick(e) {\n e.preventDefault();\n this.changeMainImage(e.target.name);\n }","function selectAvatar1(event)\n{\n selectAvatar(event, 1);\n}","function canvasClick(e) {\n\tblockus.mouseClicked();\n}","function exeOpenImage(e){ openImage(e.target) }","onClick(event) {\n\t\t// console.log(\"mouse click\");\n\t\tthis.draw(event);\n\t}","handleClick() {}","function imgEvent(){\n alert('This is Void Link');\n}","function setupEventListenersToBigImg() {\n bigImg.addEventListener('click', addClick);\n}","function conduitEventClick(event) {\n var command = this.getMouseEventCommand( event );\n switch( command ) {\n case \"cancel\":\n this.close();\n break;\n case \"searchConduit\":\n this.searchConduit();\n break;\n case \"insertFromConduit\": \n var ids = this.list.getSelectedIDs();\n if( ids.length ) {\n // Actually, we only handle a single photo at a time\n // at this time.\n for (var i = 0; i < ids.length; i++) {\n var asset = {\n name: names[ids[i]],\n // TODO: bells & whistles for the IMG tag?\n body: \"\"\n };\n app.c.createAssetFromEmbed( {\n asset: asset,\n callback: this._gIM( \"handleCreate\" )\n } );\n }\n }\n break;\n }\n}","render() {\n return (\n {this.props.handleClick(this.props.id)} }\n />\n )\n }","function mouseClick(event) {\n const id = event.target.id;\n\n // Check if click was made on the background\n if (id === \"background\")\n return;\n\n // Update selector if it wasn't over the clicked card \n // (mixed controls behaviour bug)\n if (mouseOver !== selectorOver)\n updateSelector(mouseOver);\n\n pickCard();\n}","function func(e) {\r\n // console.log(e.target.parentNode.getAttribute('class'));\r\n var p = e.target\r\n while (p.className !== \"music_image\") {\r\n p = p.parentNode\r\n }\r\n // var change = p.querySelector('img').src;\r\n\r\n changePreview(p.id);\r\n }","function mediaClick(e, data) {\n page = 0;\n $('#imgs').load('/admin/mediaSelector', addImgClickHandler);\n\n $(data.popup).children(\"#next\").click(function(e) {\n $('#imgs').load('/admin/mediaSelector?page=' + ++page, addImgClickHandler);\n });\n\n // Wire up the submit button click event\n $(data.popup).children(\"#submit\")\n .unbind(\"click\")\n .bind(\"click\", function(e) {\n // Get the editor\n var editor = data.editor;\n\n // Get the full url of the image clicked\n var fullUrl = $(data.popup).find(\"#imgToInsert\").val();\n\n // Insert the img tag into the document\n var html = \"\";\n editor.execCommand(data.command, html, null, data.button);\n\n // Hide the popup and set focus back to the editor\n editor.hidePopups();\n editor.focus();\n });\n }","function handleClick(event) {\n var clickedPictures = event.target.alt;\n // var clickdDiv = event.target.id;\n if (clickedPictures) {\n clicked++;\n\n for (var i = 0; i < allPictures.length; i++) {\n if (clickedPictures === allPictures[i].name) {\n allPictures[i].votes++;\n }\n }\n // renderPictures(); // gives us the images after each click!!\n renderPictures();\n\n if (clicked === totalClickedAllowed) {\n\n pictureContener.removeEventListener('click', handleClick);\n\n renderMyChart();\n renderResults();\n\n // lab 13 save data begins\n\n var stringifiedResults = JSON.stringify(allPictures); // \"packs data away\" to be stored, we convert to JSON\n localStorage.setItem('pictureResults', stringifiedResults); // store the data - \"put the box on the shelf\"\n // lab 13 save data ends\n }\n } else {\n alert('please clicked picture ');\n }\n}","function getClickHandler() {\n return function(info, tab) {\n\n // The srcUrl property is only available for image elements.\n var url = info.srcUrl;\n\n alert( url );\n };\n}","function bindClickOnThumbnails(){\n $(\".changedCP\").on('click',function(){\n var pId = this.id;\n closeOverlay();\n closeChangeCoverCatMenu();\n saveSelectedImage(pId);\n removePreviousCatCss();\n });\n}","function addThumbClickHandler(thumb) {\r\n 'use strict';\r\n thumb.addEventListener('click', function (event) {\r\n event.preventDefault();\r\n setDetailsFromThumb(thumb);\r\n\r\n // 7.1.4 - Showing the detail image again\r\n showDetails();\r\n });\r\n}","handlePress(i) {\n\t\tif (i == 1) {\n\t\t\tthis.gotoPhoto();\n\t\t} else if (i == 2) {\n\t\t\tthis.gotoGallery();\n\t\t}\n\t}","selectImage(imgSrc) {\n const {onImageSelected} = this.props;\n if (typeof onImageSelected === \"function\") {\n onImageSelected(imgSrc);\n }\n }","function genericOnClick(info, tab, callback) {\n // Get url of image\n let srcUrl = info.srcUrl;\n console.log(srcUrl);\n\n // Google cloud vision api request body\n let body = {\n \"requests\": [\n {\n \"image\": {\n \"source\": {\n \"imageUri\": srcUrl\n }\n },\n \"features\": [\n {\n \"type\": \"LANDMARK_DETECTION\",\n \"maxResults\": 1\n }\n ]\n }\n ]\n }\n\n // Call Google cloud vision api on image for landmark detection\n fetch(API_URL + API_KEY, {\n method: 'post',\n body: JSON.stringify(body)\n }).then(function(response) {\n return response.json();\n }).then(function(response) {\n // strip landmark from response\n let location = response.responses[0].landmarkAnnotations[0].description;\n\n callback(location);\n })\n .catch((error) => {\n // let user know if could not determine landmark\n alert('Sorry, we could not figure out where this image was taken :(');\n });\n}","function firstImgPastaClicked() {\n console.log(\"view recipe \");\n imageNum = 0;\n passMealId(imageNum);\n}","click() {\n this.get('modal').showModal(this.get('photoFullUrl'));\n }","function superbgimage_click(img) {\n\t\t\t\t\t\t$fullsize.nextSlide();\n\t\t\t\t\t\t$fullsizetimer.startTimer( 7000 );\n\t\t\t\t\t}","function clickHandler(event){\n\t\t\tif(ignoreClick){\n\t\t\t\tignoreClick = false;\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tvar offset = overlay.cumulativeOffset();\t\t\t\n\t\t\ttarget.fire('flotr:click', [{\n\t\t\t\tx: xaxis.min + (event.pageX - offset.left - plotOffset.left) / hozScale,\n\t\t\t\ty: yaxis.max - (event.pageY - offset.top - plotOffset.top) / vertScale\n\t\t\t}]);\n\t\t}","handlePress(i) {\n if (i == 1) {\n this.gotoPhoto();\n } else if (i == 2) {\n this.gotoGallery();\n }\n }"],"string":"[\n \"onImageClick() {\\n console.log('Clicked Image')\\n }\",\n \"function imgClick(event) {\\n\\n}\",\n \"imageClickHandler() {\\n\\t\\tconst {data} = this.props,\\n\\t\\t\\tlistOfPhotos = document.querySelector('.gallery__photo-list');\\n\\n\\t\\tlistOfPhotos.addEventListener('click', e => {\\n\\t\\t\\tconst {target} = e,\\n\\t\\t\\t\\t{imageMinId: id} = target.dataset;\\n\\n\\t\\t\\tif (target.tagName !== 'IMG') return;\\n\\t\\t\\tthis.props.currentPhoto = +id;\\n\\t\\t\\tthis.changeGeneralPhoto(+id);\\n\\t\\t\\tthis.selectImageHandler();\\n\\t\\t});\\n\\t}\",\n \"function handleClick(event)\\n{\\n\\t// Gets position of click\\n\\tvar rect = canvas.getBoundingClientRect();\\n\\tvar posx = event.clientX - rect.left;\\n\\tvar posy = event.clientY - rect.top;\\n\\t\\n\\t// Checks each object to see if it was clicked\\n\\tfor (var i = 0; i < clickable.length; i++)\\n\\t{\\n\\t\\t// If image was clicked, runs specified function\\n\\t\\tif (posx >= clickable[i].x && posx <= clickable[i].x + clickable[i].width &&\\n\\t\\t\\tposy >= clickable[i].y && posy <= clickable[i].y + clickable[i].height)\\n\\t\\t{\\n\\t\\t\\tclickable[i].func();\\n\\t\\t}\\n\\t}\\n}\",\n \"function clickImage (data){\\n\\t\\t\\n\\t\\t/*click function on each image*/\\n\\t\\tdelegate(\\\"body\\\",\\\"click\\\",\\\".clickMe\\\",(event) => {\\n\\t\\t\\t\\n\\t\\t\\tevent.preventDefault();\\n\\t\\t\\tvar dataCaptionId=getKeyFromClosestElement(event.delegateTarget);\\n\\t\\t\\tvar dataCaption = data.caption;\\n\\t\\t\\tdataCaption = dataCaption.replace(/\\\\s+/g, \\\"\\\");\\n\\t\\t\\t\\n\\t\\t\\t//match the id and render pop up with the data\\n\\t\\t\\tif (dataCaption == dataCaptionId){\\n\\t\\t\\t\\trenderPopup(data, container) \\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t});\\n\\t\\t\\n\\t}\",\n \"function onImageClick(event) {\\n var imageWrap = document.querySelector('.image_wrap');\\n if(!imageWrap.classList.contains('image_displayed')) return;\\n\\n if(imageWrap.classList.contains('positioning')) {\\n var posRel = getPositionRel(event, document.querySelector('.image_wrap .image_con'));\\n\\n if(posRel.x >= 0 && posRel.x <= 1\\n && posRel.y >= 0 && posRel.y <= 1) {\\n placePinSelection(posRel);\\n event.stopPropagation();\\n }\\n }\\n\\n if(imageWrap.classList.contains('moving')) {\\n // ignore moving click events, mouse/touch events do everything\\n event.stopPropagation();\\n event.preventDefault();\\n }\\n }\",\n \"function onImgClick () {\\n $ ('.img-wrap').one ('click', function (e) {\\n console.log ('image clicked');\\n console.log (characters);\\n attackSound.play ();\\n $ ('#selected-character-id').css ('border', 'solid 5px greenyellow');\\n $ (this).off (e);\\n });\\n }\",\n \"function imgClicked(e)\\n{\\n\\tlargeImg.src = e.target.src;\\n}\",\n \"function handleClick(e) {\\n const src = e.currentTarget.querySelector('img').src;\\n const href = this.childNodes[0].nextSibling.href;\\n overlayLink.href = href;\\n overlayLink.innerText = href;\\n overlayImage.src = src;\\n overlay.classList.add('open');\\n }\",\n \"function clickOnImage(event)\\n{\\n\\tif ($(\\\"#country_selected\\\").val() != '0')\\n\\t{\\n\\t\\tvar e = event || window.event;\\n\\t\\tvar pos = getRelativeCoordinates(event, $(\\\"#reference\\\").get(0));\\n\\t\\tvar m = $(\\\"#marker\\\").get(0);\\n\\t\\tdisplayMarker(pos.x, pos.y);\\n\\t}\\n}\",\n \"function clickOnThumbnail() {\\n\\tgetPhotoUrl($(this));\\n\\t$container.append($photoviewer.append($photoBox).append($caption));\\n\\t$photoBox.after($leftClick);\\n\\t$photoBox.before($rightClick);\\n\\t$(\\\"html\\\").css(\\\"background\\\",\\\"gray\\\");\\n\\t//All other images are not visible\\n\\t$(\\\".thumbnail\\\").addClass(\\\"greyed-out\\\");\\n\\t$(\\\".small-img\\\").hide();\\n\\t$leftClick.on(\\\"click\\\",leftClick);\\n\\t$rightClick.on(\\\"click\\\",rightClick);\\n}\",\n \"function handleImageClick(event) {\\n if (isDragAndDropSupported || !instance) {\\n return;\\n }\\n\\n const target = event.target;\\n\\n fetch(target.src)\\n .then((r) => r.blob())\\n .then((blob) => {\\n const pageIndex = instance.viewState.currentPageIndex;\\n const pageInfo = instance.pageInfoForIndex(pageIndex);\\n\\n insertImageAnnotation(\\n new PSPDFKit.Geometry.Rect({\\n width: target.width,\\n height: target.height,\\n left: pageInfo.width / 2 - target.width / 2,\\n top: pageInfo.height / 2 - target.height / 2,\\n }),\\n blob,\\n pageIndex\\n );\\n });\\n}\",\n \"function ChoosePhoto(e) {\\n console.log(\\\"gggg\\\");\\n getPhoto(pictureSource.PHOTOLIBRARY);\\n }\",\n \"function imgClicked(imgId) {\\n gMeme.selectedImgId = imgId;\\n}\",\n \"function clickRegularViewFocusImg(e) {\\n\\n var clickedThing = e.target;\\n\\n // if clicked element is a single image or the focus img in a gallery\\n if (clickedThing.classList.contains('clickme')) {\\n\\n // define imgToShow\\n var imgToShow = clickedThing;\\n\\n // call NAMED lightbox function\\n lightbox(imgToShow);\\n\\n // call NAMED function to populate lightbox dots\\n populateLightboxDots(imgToShow);\\n\\n } // close if ('clickme')\\n} // close function\",\n \"function handleClick(e) {\\n\\tSTATE.popupOpen = true\\n\\tconst elem = closest(e.target, '[data-type=image]')\\n\\tconst i = parseInt(elem.getAttribute('data-index'), 10)\\n\\tSTATE.popup.innerHTML = popupContent({ elem: content.parts[i], index: i })\\n}\",\n \"function clickFunc(event) {\\n\\t//alert(event);\\n\\tvar e = event;\\n\\t//console.log(typeof e);\\n\\t\\n\\tif(event.target !== event.currentTarget) {\\n\\t\\tvar clickedItem = event.target.id;\\n\\t\\t//alert(\\\"this is the image id = \\\"+clickedItem);\\n\\t}\\n \\n}\",\n \"function addEventOpenImages() {\\n document.addEventListener('click', function (evt) {\\n if (evt.target.parentNode.classList.contains('picture')) {\\n evt.preventDefault();\\n showImage(evt.target.parentNode);\\n }\\n });\\n }\",\n \"function clickHandler(event) {\\n //take the path from the src attribute of the img node\\n //that we clicked on. We get a reference to that node\\n //from event.target\\n var targetString = event.target.src;\\n //take the relevant part of the path from the node\\n var targetPath = targetString.split('assets')[1];\\n var itemPath;\\n\\n //look through the ItemImage objects to find the one that\\n //corresponds to the image we clicked on\\n for (var i = 0; i < items.length; i++) {\\n //get the relevant part from the path on the object\\n itemPath = items[i].path.split('assets')[1];\\n if (itemPath === targetPath) {\\n //when we find the right object increment its clicked\\n //property\\n items[i].clicked += 1;\\n }\\n }\\n\\n changePicture();\\n}\",\n \"imageClick(e) {\\n e.preventDefault();\\n\\n if (this.item.link) {\\n window.open(this.item.link, '_blank');\\n } else {\\n this.shadowRoot.querySelector('#image-dialog').open();\\n\\n HhAnalytics.trackDialogOpen(this.item.internalTitle);\\n }\\n }\",\n \"function imageSelect(){\\n\\tvar getPhoto = document.getElementById(\\\"userPhoto\\\");\\n\\tgetPhoto.click();\\n}\",\n \"initiatePictureCapture(){this.imageInput.trigger('click')}\",\n \"function handleImgClick(event) {\\n if (event.target.id === 'left') {\\n allImages[leftImg].clicked += 1;\\n console.log(allImages[leftImg].imgname + ' ' + allImages[leftImg].clicked);\\n counter += 1;\\n pick3();\\n }\\n if (event.target.id === 'center') {\\n allImages[centerImg].clicked += 1;\\n console.log(allImages[centerImg].imgname + ' ' + allImages[centerImg].clicked);\\n counter += 1;\\n pick3();\\n }\\n if (event.target.id === 'right') {\\n allImages[rightImg].clicked += 1;\\n console.log(allImages[rightImg].imgname + ' ' + allImages[rightImg].clicked);\\n counter += 1;\\n pick3();\\n }\\n if (event.target.id === 'imgContain') {\\n alert('You need to click on an image!');\\n pick3();\\n }\\n}\",\n \"function clickHandler(event) {\\r\\n console.log(event.target);\\r\\n var imageName = event.target.alt;\\r\\n for (var i = 0; i < pictures.length; i++) {\\r\\n if (pictures[i].name === imageName) {\\r\\n pictures[i].updateChosen();\\r\\n picked++;\\r\\n }\\r\\n }\\r\\n\\r\\n if (picked === 25) {\\r\\n removeListener();\\r\\n chartData();\\r\\n showResults();\\r\\n var dataAsString = JSON.stringify(pictureData);\\r\\n localStorage.setItem('data', dataAsString);\\r\\n var nameAsString = JSON.stringify(labels);\\r\\n localStorage.setItem('pictures', nameAsString);\\r\\n }\\r\\n\\r\\n previousSet = thisSet;\\r\\n thisSet = {};\\r\\n setupImageContainer();\\r\\n}\",\n \"function imgClick(event) {\\n var clickTargetPath = $(event.target).attr('src'), // find the click target\\n $lightbox = $('#image_show'),\\n $boxImage = $('#image_show img');\\n // check to see if lightbox is already displayed\\n if ($lightbox.hasClass('display_img')) {\\n closeLightbox();\\n return\\n }\\n // attach a click listener for closing the lightbox\\n $(window).click(closeLightbox);\\n $boxImage.click(function(evt){\\n evt.stopPropagation() // ignore clicks on the lightbox image\\n })\\n // change lightbox image targete\\n $boxImage.attr('src', clickTargetPath);\\n // display the lightbox\\n $lightbox.addClass('display_img').removeClass('display_none');\\n}\",\n \"function imageClick(){\\n\\t$('.pic').click(function() { \\n\\t\\tmenuModal.style.display = \\\"block\\\";\\n\\t\\twindow.onclick = function(event) {\\n\\t\\t\\tif (event.target == menuModal) {\\n\\t\\t\\t\\tmenuModal.style.display = \\\"none\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t});\\n}\",\n \"function mouseClicked(){\\n if(current_img == null) current_img = flowers_img;\\n if(mouseX>=0 && mouseX=0 && mouseY maxClicks) {\\n imagesParent.removeEventListener ('click', picClickHandler);\\n setUpList();\\n displayChart();\\n } else {\\n for (var i = 0; i < currentImages.length; i++) {\\n productObject[currentImages[i]].timesShown++;\\n }\\n\\n previousImages = currentImages;\\n currentImages = [];\\n\\n var clicked = event.target.getAttribute('id');\\n productObject[clicked].timesClicked++;\\n\\n imagesParent.removeChild(imagesParent.lastChild);\\n imagesParent.removeChild(imagesParent.lastChild);\\n imagesParent.removeChild(imagesParent.lastChild);\\n\\n userClicks++;\\n setProductState (productObject, currentImages, previousImages, userClicks);\\n\\n start();\\n }\\n}\",\n \"changeModalPicFromHomepage(clickedPhoto) {\\n console.log('Target', event);\\n console.log('changing pic', clickedPhoto);\\n //set the state of the current photo to the photo that was clicked\\n this.setState({\\n modalCurrentPhoto: clickedPhoto\\n });\\n }\",\n \"function clickHandler(e) {\\n // Nur bei Linksklick\\n if (e.button !== 0) return;\\n clickAt(e.offsetX, e.offsetY);\\n }\",\n \"function changeImage(){\\n\\t\\t$('#fileImagen').click();\\n\\t}\",\n \"function imgClick(evt){\\n\\treturn imgDerecha(evt) ? btnnext(evt) : btnback(evt);\\n}\",\n \"handleClick( event ){ }\",\n \"function clickOnImageLink(e)\\n{\\n\\t// http://pit.dirty.ru/dirty/1/2011/04/15/28284-142540-32deef3d70482f072b516ac3a723533d.gif\\n\\tvar imgPreview = document.createElement('img');\\n\\timgPreview.setAttribute('src', this.href );\\n\\tvar imgLink = document.createElement('a');\\n\\timgLink.setAttribute('href', '#');\\n\\t_$.addEvent( imgLink, 'click', function(e) { this.previousSibling.setAttribute('style', this.previousSibling.getAttribute('bkpstyle')); this.parentNode.removeChild(this ); e.preventDefault(); return false; });\\n\\timgLink.appendChild( imgPreview );\\n\\t_$.insertAfter(this, imgLink);\\n\\tthis.setAttribute('bkpstyle', this.getAttribute('style'));\\n\\tthis.setAttribute('style', 'display: none');\\n\\te.preventDefault();\\n\\treturn false;\\n}\",\n \"function actualTakePhoto() {\\n $(\\\"#capture\\\").click();\\n}\",\n \"function onClick(e) {\\n if (e.target.dataset.source === undefined) {\\n return;\\n }\\n onClickModalOpener();\\n imagePlacer(onClickUrl(e));\\n if (modalEL.classList.contains(\\\"is-open\\\")) {\\n window.addEventListener(\\\"keydown\\\", onEsc);\\n document\\n .querySelector(\\\"div.lightbox__overlay\\\")\\n .addEventListener(\\\"click\\\", onCloseClick);\\n }\\n window.addEventListener(\\\"keydown\\\", horizontalSlider);\\n}\",\n \"function imageClicked(eventData) {\\n let clickInformation = eventData;\\n if ( clickInformation.target.className = 'image') {\\n if (clickInformation.target.alt === \\\"rock\\\") {\\n let playerSelection = \\\"rock\\\";\\n rockImage.classList.add('image','playerWeapon');\\n outcome = playRound(playerSelection, computerPlay());\\n \\n if (playerScore != 5 && compScore != 5) {\\n whoWon(outcome);\\n \\n }\\n\\n } else if (clickInformation.target.alt === \\\"paper\\\") {\\n let playerSelection = \\\"paper\\\";\\n paperImage.classList.add('image','playerWeapon');\\n outcome = playRound(playerSelection, computerPlay());\\n\\n if (playerScore != 5 && compScore != 5) {\\n whoWon(outcome);\\n \\n }\\n \\n } else if (clickInformation.target.alt === \\\"scissors\\\") {\\n let playerSelection = \\\"scissors\\\";\\n scissorsImage.classList.add('image','playerWeapon');\\n outcome = playRound(playerSelection, computerPlay());\\n\\n if (playerScore != 5 && compScore != 5) {\\n whoWon(outcome);\\n \\n }\\n }\\n }\\n \\n }\",\n \"function selectImage(e) {\\r\\n if(e.target.innerHTML === \\\"\\\") //ensures only images can be clicked\\r\\n removeClasses(e);\\r\\n\\r\\n }\",\n \"function imgOnclickEvt (img, data) {\\n\\t\\treturn function () {\\n\\t\\t\\tshowImage (img, data);\\n\\t\\t}\\n\\t}\",\n \"render () {\\n return (\\n \\n \\n \\n )\\n }\",\n \"function selectChoice(event){\\n console.log(event.target.id);\\n var k = event.target.id;\\n console.log('yo', event.target);\\n imgObjArr[k].numClicks++;\\n console.log('hey', imgObjArr[k]);\\n console.log('target clicks:', imgObjArr[k].numClicks);\\n if (totalClicks < 25) {\\n fillImages();\\n } else {\\n alert('Thank you for participating in our study!');\\n save();\\n buildTable();\\n }\\n}\",\n \"function clickImage(e){\\n if( e.target.id === 'left_goat_img' || e.target.id === 'right_goat_img'){\\n pickRandomImages();\\n totalClicks++;\\n }\\n if(event.target.id === 'left_goat_img'){\\n leftGoatThatIsOnThePage.likes++;\\n }\\n if(event.target.id === 'right_goat_img'){\\n rightGoatThatIsOnThePage.likes++;\\n }\\n if(totalClicks === 6){\\n //remove event listener\\n groupImageSection.removeEventListener('click' , clickImage);\\n rightGoatImage.remove();\\n leftGoatImage.remove();\\n renderChartResults();\\n }\\n}\",\n \"function pickedImg() { //the clicked img will be run every other time\\n for ( var k = 0; k < imgShort.length; k +=2 ) {\\n };\\n function clicky(event) {\\n var clicked1 = event.target.id;\\n document.getElementById('img_box').addEventListener('click', clicky);\\n }\\n}\",\n \"function imgClick(e) {\\n musicInfo = e.target.alt;\\n splitInfo = musicInfo.split('_');\\n DOMString.getCurrentMusicVideoTitle.textContent = splitInfo[0];\\n DOMString.getCurrentMusicVideoArtist.textContent = splitInfo[1];\\n DOMString.getCurrentMusicVideo.src = e.target.dataset.src;\\n\\n DOMString.getCurrentMusicVideoHeading.classList.add('fadeIn');\\n setTimeout(() => DOMString.getCurrentMusicVideoHeading.classList.remove('fadeIn'), 500);\\n }\",\n \"handleJDotterClick() {}\",\n \"function imgClick(img) {\\n window.event.stopPropagation();\\n document.querySelector(`#grey-screen`).classList.toggle(\\\"hide\\\");\\n document.querySelector(`#zoom-img`).src = img;\\n}\",\n \"function thumbnailClickHandler(evt) {\\n var target = evt.target;\\n if (!target || !target.classList.contains('thumbnail'))\\n return;\\n\\n if (currentView === thumbnailListView || currentView === fullscreenView) {\\n showFile(parseInt(target.dataset.index));\\n }\\n else if (currentView === thumbnailSelectView) {\\n updateSelection(target);\\n }\\n else if (currentView === pickView) {\\n cropPickedImage(files[parseInt(target.dataset.index)]);\\n }\\n}\",\n \"function img_click(i){\\n i.onclick=function(){\\n modal.style.display=\\\"block\\\";\\n modalImg.src=this.src;\\n }\\n}\",\n \"function handleImgClick(e){\\n modal.style.display = \\\"block\\\";\\n console.log(e);\\n let image=e.currentTarget.src;\\n modalImg.src=image;\\n captionText.innerHTML = e.currentTarget.getAttribute(\\\"alt\\\");\\n}\",\n \"function load_click() {\\n if ($('random_front_picture') != null) {\\n Event.observe('random_front_picture', 'click', function(e) {\\n e.stop()\\n to = $('random_front_picture').href \\n new Ajax.Request(to)\\n })\\n }\\n}\",\n \"function choose_img(files_id) { // function choose img upload from file in your folder.\\r\\n $(\\\"#\\\" + files_id).click();\\r\\n}\",\n \"clicked(x, y) {}\",\n \"function clickImage(object){\\n document.location = page.PRODUCT + '?id=' + object.id;\\n}\",\n \"function handleImageClick(event) {\\n console.log(event.target.alt);\\n //iterate through array to check that event has been clicked\\n for (var i = 0; i < allProducts.length; i++) {\\n if (event.target.alt === allProducts[i].name) {\\n allProducts[i].votes++;\\n }\\n }\\n //in order to get a random image which allows new photos to be displayed call randomImage Function\\n randomImage();\\n}\",\n \"function uploadAvatar(){\\n\\t$('#avatarPhoto').click();\\n}\",\n \"putImage(button){\\n if(button.code == -1){//al ser clickeada la locación, se enrutará a la página de locaciones y su subbsección respectiva\\n switch(this.easyFrame){\\n case 0:\\n window.location.href = \\\"location.html#cove\\\";\\n return;\\n case 1:\\n window.location.href = \\\"location.html#darkest-dungeon\\\";\\n return;\\n case 2:\\n window.location.href = \\\"location.html#ruins\\\";\\n return;\\n case 3:\\n window.location.href = \\\"location.html#warrens\\\";\\n return;\\n case 4:\\n window.location.href = \\\"location.html#weald\\\";\\n return;\\n case 5:\\n window.location.href = \\\"location.html#courtyard\\\";\\n return;\\n case 6:\\n window.location.href = \\\"location.html#farmstead\\\";\\n return;\\n default:\\n return;\\n }\\n\\n }\\n //en caso que se clickee un botón, se ajusta el frame de la locación y se vuelve visible, además se le agrega su interactividad\\n this.areaPicture.setFrame(button.code);\\n this.easyFrame = button.code;\\n this.areaPicture.setVisible(true);\\n this.areaPicture.setInteractive();\\n this.areaPicture.on('clicked', this.putImage, this);\\n }\",\n \"function choiceClick(counter) {\\n $('#picture .slick-next').trigger('click');\\n $('.img-overlay').find('.click-overlay').parent().next().find('.overlay').addClass('click-overlay');\\n $('#picture-array .slick-next').trigger('click');\\n $('.image_number').html(counter + 1 + ' of 46');\\n}\",\n \"_onClick({x,y,object}) {\\n console.log(\\\"Clicked icon:\\\",object);\\n }\",\n \"function on_click(e) {\\n cloud.on_click(e.clientX, e.clientY);\\n}\",\n \"function onImageClick(imageId) {\\n setMemeImgId(imageId)\\n drawImgFromlocal(imageId);\\n setTimeout(function () {\\n document.querySelector('.header2').style.display = 'none';\\n document.querySelector('main').style.display = 'none';\\n document.querySelector('.my-info').style.display = 'none';\\n document.querySelector('.canvas-btn-container').style.display = 'flex';\\n resizeCanvas();\\n }, 10)\\n}\",\n \"function handleClick(event)\\n{\\n}\",\n \"function clickHandler(theEvent) {\\n//outerHTML repalces the whole html including the tags\\n var theImage = theEvent.target.outerHTML;\\n //changing the class of image_show from display_none to display_img\\n imgDiv.className = \\\"display_img\\\";\\n //changing the html in the image_show by inserting the html from the thumbnail\\n imgDiv.innerHTML = theImage;\\n}\",\n \"function handlePlanImage(id) {\\n alert(id);\\n }\",\n \"function selectImage(event) {\\n\\n const button = event.currentTarget\\n const buttons = document.querySelectorAll('.images button')\\n\\n buttons.forEach((button) => {\\n button.classList.remove('active')\\n })\\n //adicionar a classe active para o botão clicado\\n button.classList.add('active')\\n\\n\\n //selecionara a imagem clicada\\n const image = button.children[0]\\n const imageContainer = document.querySelector('.orphanage-details > img')\\n //atualizar o container de imagem\\n imageContainer.src = image.src\\n\\n}\",\n \"handleArrowClick(e) {\\n e.preventDefault();\\n this.changeMainImage(e.target.name);\\n }\",\n \"function selectAvatar1(event)\\n{\\n selectAvatar(event, 1);\\n}\",\n \"function canvasClick(e) {\\n\\tblockus.mouseClicked();\\n}\",\n \"function exeOpenImage(e){ openImage(e.target) }\",\n \"onClick(event) {\\n\\t\\t// console.log(\\\"mouse click\\\");\\n\\t\\tthis.draw(event);\\n\\t}\",\n \"handleClick() {}\",\n \"function imgEvent(){\\n alert('This is Void Link');\\n}\",\n \"function setupEventListenersToBigImg() {\\n bigImg.addEventListener('click', addClick);\\n}\",\n \"function conduitEventClick(event) {\\n var command = this.getMouseEventCommand( event );\\n switch( command ) {\\n case \\\"cancel\\\":\\n this.close();\\n break;\\n case \\\"searchConduit\\\":\\n this.searchConduit();\\n break;\\n case \\\"insertFromConduit\\\": \\n var ids = this.list.getSelectedIDs();\\n if( ids.length ) {\\n // Actually, we only handle a single photo at a time\\n // at this time.\\n for (var i = 0; i < ids.length; i++) {\\n var asset = {\\n name: names[ids[i]],\\n // TODO: bells & whistles for the IMG tag?\\n body: \\\"\\\"\\n };\\n app.c.createAssetFromEmbed( {\\n asset: asset,\\n callback: this._gIM( \\\"handleCreate\\\" )\\n } );\\n }\\n }\\n break;\\n }\\n}\",\n \"render() {\\n return (\\n {this.props.handleClick(this.props.id)} }\\n />\\n )\\n }\",\n \"function mouseClick(event) {\\n const id = event.target.id;\\n\\n // Check if click was made on the background\\n if (id === \\\"background\\\")\\n return;\\n\\n // Update selector if it wasn't over the clicked card \\n // (mixed controls behaviour bug)\\n if (mouseOver !== selectorOver)\\n updateSelector(mouseOver);\\n\\n pickCard();\\n}\",\n \"function func(e) {\\r\\n // console.log(e.target.parentNode.getAttribute('class'));\\r\\n var p = e.target\\r\\n while (p.className !== \\\"music_image\\\") {\\r\\n p = p.parentNode\\r\\n }\\r\\n // var change = p.querySelector('img').src;\\r\\n\\r\\n changePreview(p.id);\\r\\n }\",\n \"function mediaClick(e, data) {\\n page = 0;\\n $('#imgs').load('/admin/mediaSelector', addImgClickHandler);\\n\\n $(data.popup).children(\\\"#next\\\").click(function(e) {\\n $('#imgs').load('/admin/mediaSelector?page=' + ++page, addImgClickHandler);\\n });\\n\\n // Wire up the submit button click event\\n $(data.popup).children(\\\"#submit\\\")\\n .unbind(\\\"click\\\")\\n .bind(\\\"click\\\", function(e) {\\n // Get the editor\\n var editor = data.editor;\\n\\n // Get the full url of the image clicked\\n var fullUrl = $(data.popup).find(\\\"#imgToInsert\\\").val();\\n\\n // Insert the img tag into the document\\n var html = \\\"\\\";\\n editor.execCommand(data.command, html, null, data.button);\\n\\n // Hide the popup and set focus back to the editor\\n editor.hidePopups();\\n editor.focus();\\n });\\n }\",\n \"function handleClick(event) {\\n var clickedPictures = event.target.alt;\\n // var clickdDiv = event.target.id;\\n if (clickedPictures) {\\n clicked++;\\n\\n for (var i = 0; i < allPictures.length; i++) {\\n if (clickedPictures === allPictures[i].name) {\\n allPictures[i].votes++;\\n }\\n }\\n // renderPictures(); // gives us the images after each click!!\\n renderPictures();\\n\\n if (clicked === totalClickedAllowed) {\\n\\n pictureContener.removeEventListener('click', handleClick);\\n\\n renderMyChart();\\n renderResults();\\n\\n // lab 13 save data begins\\n\\n var stringifiedResults = JSON.stringify(allPictures); // \\\"packs data away\\\" to be stored, we convert to JSON\\n localStorage.setItem('pictureResults', stringifiedResults); // store the data - \\\"put the box on the shelf\\\"\\n // lab 13 save data ends\\n }\\n } else {\\n alert('please clicked picture ');\\n }\\n}\",\n \"function getClickHandler() {\\n return function(info, tab) {\\n\\n // The srcUrl property is only available for image elements.\\n var url = info.srcUrl;\\n\\n alert( url );\\n };\\n}\",\n \"function bindClickOnThumbnails(){\\n $(\\\".changedCP\\\").on('click',function(){\\n var pId = this.id;\\n closeOverlay();\\n closeChangeCoverCatMenu();\\n saveSelectedImage(pId);\\n removePreviousCatCss();\\n });\\n}\",\n \"function addThumbClickHandler(thumb) {\\r\\n 'use strict';\\r\\n thumb.addEventListener('click', function (event) {\\r\\n event.preventDefault();\\r\\n setDetailsFromThumb(thumb);\\r\\n\\r\\n // 7.1.4 - Showing the detail image again\\r\\n showDetails();\\r\\n });\\r\\n}\",\n \"handlePress(i) {\\n\\t\\tif (i == 1) {\\n\\t\\t\\tthis.gotoPhoto();\\n\\t\\t} else if (i == 2) {\\n\\t\\t\\tthis.gotoGallery();\\n\\t\\t}\\n\\t}\",\n \"selectImage(imgSrc) {\\n const {onImageSelected} = this.props;\\n if (typeof onImageSelected === \\\"function\\\") {\\n onImageSelected(imgSrc);\\n }\\n }\",\n \"function genericOnClick(info, tab, callback) {\\n // Get url of image\\n let srcUrl = info.srcUrl;\\n console.log(srcUrl);\\n\\n // Google cloud vision api request body\\n let body = {\\n \\\"requests\\\": [\\n {\\n \\\"image\\\": {\\n \\\"source\\\": {\\n \\\"imageUri\\\": srcUrl\\n }\\n },\\n \\\"features\\\": [\\n {\\n \\\"type\\\": \\\"LANDMARK_DETECTION\\\",\\n \\\"maxResults\\\": 1\\n }\\n ]\\n }\\n ]\\n }\\n\\n // Call Google cloud vision api on image for landmark detection\\n fetch(API_URL + API_KEY, {\\n method: 'post',\\n body: JSON.stringify(body)\\n }).then(function(response) {\\n return response.json();\\n }).then(function(response) {\\n // strip landmark from response\\n let location = response.responses[0].landmarkAnnotations[0].description;\\n\\n callback(location);\\n })\\n .catch((error) => {\\n // let user know if could not determine landmark\\n alert('Sorry, we could not figure out where this image was taken :(');\\n });\\n}\",\n \"function firstImgPastaClicked() {\\n console.log(\\\"view recipe \\\");\\n imageNum = 0;\\n passMealId(imageNum);\\n}\",\n \"click() {\\n this.get('modal').showModal(this.get('photoFullUrl'));\\n }\",\n \"function superbgimage_click(img) {\\n\\t\\t\\t\\t\\t\\t$fullsize.nextSlide();\\n\\t\\t\\t\\t\\t\\t$fullsizetimer.startTimer( 7000 );\\n\\t\\t\\t\\t\\t}\",\n \"function clickHandler(event){\\n\\t\\t\\tif(ignoreClick){\\n\\t\\t\\t\\tignoreClick = false;\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\n\\t\\t\\tvar offset = overlay.cumulativeOffset();\\t\\t\\t\\n\\t\\t\\ttarget.fire('flotr:click', [{\\n\\t\\t\\t\\tx: xaxis.min + (event.pageX - offset.left - plotOffset.left) / hozScale,\\n\\t\\t\\t\\ty: yaxis.max - (event.pageY - offset.top - plotOffset.top) / vertScale\\n\\t\\t\\t}]);\\n\\t\\t}\",\n \"handlePress(i) {\\n if (i == 1) {\\n this.gotoPhoto();\\n } else if (i == 2) {\\n this.gotoGallery();\\n }\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.793244","0.7913272","0.75001377","0.72610736","0.721918","0.7161421","0.71362853","0.7103456","0.7090242","0.70852727","0.70203173","0.70005375","0.6998707","0.6914208","0.69108677","0.6900724","0.6889584","0.6857063","0.68258864","0.68070686","0.680617","0.6804444","0.67902803","0.6771649","0.6767206","0.6744571","0.67265475","0.66947025","0.6666386","0.6619777","0.6583921","0.6579494","0.65726095","0.65481764","0.65460896","0.6545399","0.6538918","0.6527891","0.65266705","0.6515239","0.6506214","0.64951426","0.64866126","0.64859486","0.64675164","0.64639205","0.6430204","0.6425853","0.6423818","0.64160573","0.6412918","0.64090186","0.6407814","0.6406657","0.63945633","0.6387182","0.638589","0.6377641","0.63693595","0.63538444","0.634797","0.63397104","0.6336709","0.63341415","0.6323704","0.63152874","0.630035","0.62993306","0.6297846","0.6292363","0.6276482","0.62634355","0.6251904","0.624599","0.6238629","0.623367","0.6230152","0.6214455","0.6195432","0.6190667","0.6175799","0.6175051","0.6172225","0.6169212","0.61583227","0.6154797","0.61495316","0.61490804","0.6144586","0.6140406","0.61400604","0.6137892","0.61361504","0.61258847","0.6120286","0.6119872","0.61156636","0.611211","0.60905135","0.6090047","0.60857326"],"string":"[\n \"0.793244\",\n \"0.7913272\",\n \"0.75001377\",\n \"0.72610736\",\n \"0.721918\",\n \"0.7161421\",\n \"0.71362853\",\n \"0.7103456\",\n \"0.7090242\",\n \"0.70852727\",\n \"0.70203173\",\n \"0.70005375\",\n \"0.6998707\",\n \"0.6914208\",\n \"0.69108677\",\n \"0.6900724\",\n \"0.6889584\",\n \"0.6857063\",\n \"0.68258864\",\n \"0.68070686\",\n \"0.680617\",\n \"0.6804444\",\n \"0.67902803\",\n \"0.6771649\",\n \"0.6767206\",\n \"0.6744571\",\n \"0.67265475\",\n \"0.66947025\",\n \"0.6666386\",\n \"0.6619777\",\n \"0.6583921\",\n \"0.6579494\",\n \"0.65726095\",\n \"0.65481764\",\n \"0.65460896\",\n \"0.6545399\",\n \"0.6538918\",\n \"0.6527891\",\n \"0.65266705\",\n \"0.6515239\",\n \"0.6506214\",\n \"0.64951426\",\n \"0.64866126\",\n \"0.64859486\",\n \"0.64675164\",\n \"0.64639205\",\n \"0.6430204\",\n \"0.6425853\",\n \"0.6423818\",\n \"0.64160573\",\n \"0.6412918\",\n \"0.64090186\",\n \"0.6407814\",\n \"0.6406657\",\n \"0.63945633\",\n \"0.6387182\",\n \"0.638589\",\n \"0.6377641\",\n \"0.63693595\",\n \"0.63538444\",\n \"0.634797\",\n \"0.63397104\",\n \"0.6336709\",\n \"0.63341415\",\n \"0.6323704\",\n \"0.63152874\",\n \"0.630035\",\n \"0.62993306\",\n \"0.6297846\",\n \"0.6292363\",\n \"0.6276482\",\n \"0.62634355\",\n \"0.6251904\",\n \"0.624599\",\n \"0.6238629\",\n \"0.623367\",\n \"0.6230152\",\n \"0.6214455\",\n \"0.6195432\",\n \"0.6190667\",\n \"0.6175799\",\n \"0.6175051\",\n \"0.6172225\",\n \"0.6169212\",\n \"0.61583227\",\n \"0.6154797\",\n \"0.61495316\",\n \"0.61490804\",\n \"0.6144586\",\n \"0.6140406\",\n \"0.61400604\",\n \"0.6137892\",\n \"0.61361504\",\n \"0.61258847\",\n \"0.6120286\",\n \"0.6119872\",\n \"0.61156636\",\n \"0.611211\",\n \"0.60905135\",\n \"0.6090047\",\n \"0.60857326\"\n]"},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":81768,"cells":{"query":{"kind":"string","value":"Function to Draw Chart"},"document":{"kind":"string","value":"function drawChart() {\n var ctx = canvas.getContext('2d');\n var myBarChart = new Chart(ctx, {\n type: 'bar',\n data: data,\n // options: {\n // responsive: false\n // }\n });\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["_drawChart()\n {\n\n }","function drawChart() {\n stroke(0);\n yAxis();\n xAxis();\n}","function drawChart(arr) {\n drawSleepChart(arr);\n drawStepsChart(arr);\n drawCalorieChart(arr);\n drawHeartRateChart(arr);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'X');\n data.addColumn('number', 'Price');\n \n data.addRows(graphData)\n\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.LineChart(document.getElementById('chart_div'));\n chart.draw(data, fullWidthOptions);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(rendergrafica);\n\n // Set chart options\n var options = {\n 'title': 'Cantidad de laboratorios por categoria',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n\n }","function drawCharts() {\n\tdrawRecommendedInvestmentChart();\n}","function drawChart() {\r\n drawSentimentBreakdown();\r\n drawSentimentTimeline();\r\n drawPopularityTimeline();\r\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(render);\n\n // Set chart options\n var options = {\n 'title': 'Cantidad de laboratorios por sede',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(rendergrafica);\n\n // Set chart options\n var options = {\n 'title': 'cantidad de pruebas por laboratorio',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n\t\t// Get the dataGraphic array form PHP\n\t\tvar dataOptionsGraphic = JSON.parse(jsonDataGraphic);\n\n\t\tfor (col in dataOptionsGraphic) {\n\t\t\tdataOptionsGraphic[col][5] = strTooltipStart + dataOptionsGraphic[col][1] + strTooltipEnd;\n\t\t}\n\n\t\t// Header of the data Graphic\n\t\tvar headDataGraphic = [M.util.get_string('choice', 'evoting'), M.util.get_string('countvote', 'evoting'), {\n\t\t\ttype: 'string',\n\t\t\trole: 'style'\n\t\t}, {\n\t\t\ttype: 'string',\n\t\t\trole: 'annotation'\n\t\t}, 'id', {\n\t\t\t'type': 'string',\n\t\t\t'role': 'tooltip',\n\t\t\t'p': {\n\t\t\t\t'html': true\n\t\t\t}\n\t\t}, {\n\t\t\ttype: 'string'\n\t\t}];\n\t\t// Create the complete data of the Graphic by integrated header data\n\t\tdataOptionsGraphic.splice(0, 0, headDataGraphic);\n\t\toptionsGraph = {\n\t\t\ttitle: \"\",\n\t\t\tallowHtml: true,\n\t\t\theight: 450,\n\t\t\tlegend: {\n\t\t\t\tposition: 'none'\n\t\t\t},\n\t\t\tanimation: {\n\t\t\t\tduration: 500,\n\t\t\t\teasing: 'out'\n\t\t\t},\n\n\t\t\tvAxis: {\n\t\t\t\tgridlines: {\n\t\t\t\t\tcolor: '#000000'\n\t\t\t\t},\n\t\t\t\ttextPosition: 'out',\n\t\t\t\ttextStyle: {\n\t\t\t\t\tcolor: '#007cb7',\n\t\t\t\t\tfontName: 'Oswald, Times-Roman',\n\t\t\t\t\tbold: true,\n\t\t\t\t\titalic: false\n\t\t\t\t}\n\n\t\t\t},\n\t\t\thAxis: {\n\t\t\t\ttitle: M.util.get_string('totalvote', 'evoting') + \" : \" + sumVote,\n\t\t\t\tminValue: \"0\",\n\t\t\t\tmaxValue: max,\n\t\t\t\tgridlines: {\n\t\t\t\t\tcolor: '#e6e6e6'\n\t\t\t\t},\n\t\t\t\ttextStyle: {\n\t\t\t\t\tcolor: '#e6e6e6'\n\t\t\t\t},\n\t\t\t\ttitleTextStyle: {\n\t\t\t\t\tcolor: '#007cb7',\n\t\t\t\t\tfontName: 'Oswald, Times-Roman',\n\t\t\t\t\tbold: false,\n\t\t\t\t\titalic: false\n\t\t\t\t}\n\t\t\t},\n\t\t\tbaselineColor: '#007cb7',\n\t\t\ttooltip: {\n\t\t\t\tisHtml: true\n\t\t\t},\n\n\t\t\tannotations: {\n\t\t\t\ttextStyle: {\n\t\t\t\t\tfontName: 'Oswald,Helvetica,Arial,sans-serif',\n\t\t\t\t\tbold: false,\n\t\t\t\t\titalic: false,\n\t\t\t\t\tcolor: '#007cb7',\n\t\t\t\t\tauraColor: 'rgba(255,255,255,0)',\n\t\t\t\t\topacity: 1,\n\t\t\t\t\tx: 20\n\t\t\t\t},\n\t\t\t\talwaysOutside: false,\n\t\t\t\thighContrast: true,\n\t\t\t\tstemColor: '#000000'\n\t\t\t},\n\t\t\tbackgroundColor: '#f6f6f6',\n\t\t\tchartArea: {\n\t\t\t\tleft: '5%',\n\t\t\t\ttop: '5%',\n\t\t\t\theight: '75%',\n\t\t\t\twidth: '100%'\n\t\t\t}\n\t\t};\n\n\t\tdataGraph = google.visualization.arrayToDataTable(dataOptionsGraphic);\n\t\tdataGraph.setColumnProperty(0, {\n\t\t\tallowHtml: true\n\t\t});\n\t\tviewGraph = new google.visualization.DataView(dataGraph);\n\t\tviewGraph.setColumns([0, 1, 2, 3, 5]);\n\n\t\t// Create and draw the visualization.\n\t\tchart = new google.visualization.BarChart(document.getElementById('chartContainer'));\n\t\t$(\".answerCount\").each(function () {\n\t\t\tidOption = $(this).prop('id');\n\t\t});\n\t\tupdateOptionGraphicMax();\n\n\t\tmanageGoodAnswer();\n\t}","function drawCharts() {\n drawPieChart()\n drawAxisTickColors()\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Acertos', acertos],\n ['Erros', erros]\n ]);\n\n // Set chart options\n var options = {'width':800,\n 'height':600,\n 'backgroundColor': 'none',\n 'fontSize': 15,\n 'is3D':true};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawCharts() {\n /*TOD0: Implement function;\n Un dato interesante del Webstorm es que al escribir tod0\n o TOD0 y vamos a TOD0 (6, parte de abajo) sale que en\n nuestro proyecto tenemos un TOD0 y automaticamente al\n darle click nos reidirecciona a donde se encuentra\n dicho TOD0. Es una manera de hacer una pausa en lo que\n estamos implementado y cuando regresamos al trabajo de\n frente nos ubicamos en la zona donde estabamos trabajando\n o donde queremos trabajar. Recordar que el TOD0 significa\n \"to do\" (por hacer).\n\n Este metodo (drawCharts) al invocar estas 2 metodos hara que se\n dibujen los 2 graficos. Este metodo drawCharts sera invocado en\n el main.js\n */\n drawPieChart()\n drawAxisTickColors()\n}","drawChart () {\r\n\t\t\r\n\t\t// Converts color range value (eg. 'red', 'blue') into the appropriate color array\r\n\t\tthis.colorRange = this.convertColorRange(this.colorRange);\r\n\r\n\t\t// Set width and height of graph based on size of bounding element and margins\r\n\t\tvar width = document.getElementById(this.elementName).offsetWidth - this.marginLeft - this.marginRight;\r\n\t\tvar height = document.getElementById(this.elementName).offsetHeight - this.marginTop - this.marginBottom;\r\n\r\n\t\t// Create axis, streams etc.\t\t\r\n\t\tvar x = d3.time.scale()\r\n\t\t\t.range([0, width]);\r\n\r\n\t\tvar y = d3.scale.linear()\r\n\t\t\t.range([height - 10, 0]);\r\n\r\n\t\tvar z = d3.scale.ordinal()\r\n\t\t\t.range(this.colorRange);\r\n\r\n\t\tvar xAxis = d3.svg.axis()\r\n\t\t\t.scale(x)\r\n\t\t\t.orient('bottom')\r\n\t\t\t.ticks(d3.time.years);\r\n\r\n\t\tvar yAxis = d3.svg.axis()\r\n\t\t\t.scale(y);\r\n\r\n\t\tvar stack = d3.layout.stack()\r\n\t\t\t.offset('silhouette')\r\n\t\t\t.values(function (d) { return d.values; })\r\n\t\t\t.x(function (d) { return d.date; })\r\n\t\t\t.y(function (d) { return d.value; });\r\n\r\n\t\tvar nest = d3.nest()\r\n\t\t\t.key(function (d) { return d.key; });\r\n\r\n\t\tvar area = d3.svg.area()\r\n\t\t\t.interpolate('cardinal')\r\n\t\t\t.x(function (d) { return x(d.date); })\r\n\t\t\t.y0(function (d) { return y(d.y0); })\r\n\t\t\t.y1(function (d) { return y(d.y0 + d.y); });\r\n\t\r\n\t\t// Create SVG area of an appropriate size\r\n\t\tvar svg = d3.select(this.element).append('svg')\r\n\t\t\t.attr('width', width + this.marginLeft + this.marginRight)\r\n\t\t\t.attr('height', height + this.marginTop + this.marginBottom)\r\n\t\t\t.append('g')\r\n\t\t\t.attr('transform', 'translate(' + this.marginLeft + ',' + this.marginTop + ')');\r\n\r\n\t\t// Read CSV file\r\n\t\td3.csv(this.csvfile, function (data) {\r\n\t\t\tvar format = d3.time.format('%Y-%m-%d');\r\n\t\t\tdata.forEach(function (d) {\r\n\t\t\t\td.date = format.parse(d.date);\r\n\t\t\t\td.value = +d.value;\r\n\t\t\t});\r\n\r\n\t\t\tvar layers = stack(nest.entries(data));\r\n\r\n\t\t\tx.domain(d3.extent(data, function (d) { return d.date; }));\r\n\t\t\ty.domain([0, d3.max(data, function (d) { return d.y0 + d.y; })]);\r\n\r\n\t\t\t// Apply data to graph\r\n\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t.data(layers)\r\n\t\t\t\t.enter().append('path')\r\n\t\t\t\t.attr('class', 'layer')\r\n\t\t\t\t.attr('d', function (d) { return area(d.values); })\r\n\t\t\t\t.style('fill', function (d, i) { return z(i); });\r\n\r\n\t\t\t// Add a black outline to streams\r\n\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t.attr('stroke', 'black')\r\n\t\t\t\t.attr('stroke-width', '0.5px');\r\n\r\n\t\t\tsvg.append('g')\r\n\t\t\t\t.attr('class', 'x axis')\r\n\t\t\t\t.attr('transform', 'translate(0,' + height + ')')\r\n\t\t\t\t.call(xAxis);\r\n\r\n\t\t\tsvg.append('g')\r\n\t\t\t\t.attr('class', 'y axis')\r\n\t\t\t\t.attr('transform', 'translate(' + width + ', 0)')\r\n\t\t\t\t.call(yAxis.orient('right'));\r\n\r\n\t\t\tsvg.append('g')\r\n\t\t\t\t.attr('class', 'y axis')\r\n\t\t\t\t.call(yAxis.orient('left'));\r\n\r\n\t\t\t// Other streams fade when one stream is hovered over with the cursor\r\n\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t.attr('opacity', 1)\r\n\t\t\t\t.on('mouseover', function (d, i) {\r\n\t\t\t\t\tsvg.selectAll('.layer').transition()\r\n\t\t\t\t\t\t.duration(250)\r\n\t\t\t\t\t\t.attr('opacity', function (d, j) {\r\n\t\t\t\t\t\t\treturn j !== i ? 0.2 : 1;\r\n\t\t\t\t\t\t});\r\n\t\t\t\t})\r\n\r\n\t\t\t\t// Move the label which appears next to the cursor.\r\n\t\t\t\t.on('mousemove', function (d, i) {\r\n\t\t\t\t\tvar mousePos = d3.mouse(this);\r\n\t\t\t\t\tvar mouseX = mousePos[0];\r\n\t\t\t\t\tvar mouseY = mousePos[1];\r\n\t\t\t\t\tvar mouseElem = document.getElementById('besideMouse');\r\n\t\t\t\t\tdocument.getElementById('besideMouse').style.left = mouseX + 50 + 'px';\r\n\t\t\t\t\tmouseElem.style.top = mouseY - 10 + 'px';\r\n\t\t\t\t\tmouseElem.innerHTML = d.key;\r\n\t\t\t\t})\r\n\t\t\t\r\n\t\t\t\t// Set opacity back to 1 when the cursor is no longer hovering over a stream.\r\n\t\t\t\t.on('mouseout', function (d, i) {\r\n\t\t\t\t\tsvg.selectAll('.layer')\r\n\t\t\t\t\t\t.transition()\r\n\t\t\t\t\t\t.duration(250)\r\n\t\t\t\t\t\t.attr('opacity', '1');\r\n\t\t\t\t\tdocument.getElementById('besideMouse').innerHTML = '';\r\n\t\t\t\t});\r\n\t\t});\r\n\t}","function draw() {\n\t\t\tdrawGrid();\n\t\t\tdrawLabels();\n\t\t\tfor(var i = 0; i < series.length; i++){\n\t\t\t\tdrawSeries(series[i]);\n\t\t\t}\n\t\t}","function drawChart() {\n\n // Create our data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ]);\n\n\n\t\t\t// Instantiate and draw our chart, passing in some options.\n\t\t\tvar chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n\t\t\tchart.draw(data, null);\n\t\t\t}","function drawChart() {\r\n\r\n // Create our data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Task');\r\n data.addColumn('number', 'Hours per Day');\r\n data.addRows([\r\n ['Work', 11],\r\n ['Eat', 2],\r\n ['Commute', 2],\r\n ['Watch TV', 2],\r\n ['Sleep', 7]\r\n ]);\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\r\n chart.draw(data, {width: 400, height: 240, is3D: true, title: 'My Daily Activities'});\r\n }","function drawChart() {\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows(Object.entries(ar_chart));\n\n // Set chart options\n var options = {'title':'Percentage of file size',\n 'width':500,\n 'height':200};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function draw() {\n const data = getData();\n const svg = d3.select('body').append('svg');\n const plot = getPlotArea();\n const paddingGroup = chartUtils.setupSvgAndPaddingGroup(svg, plot);\n const scales = makeScales(data, plot);\n defineDashedLine(svg);\n appendYAxisDashedLines(paddingGroup, scales, plot);\n appendXAxis(paddingGroup, scales, plot);\n appendYAxis(paddingGroup, scales);\n appendBars(paddingGroup, data, scales, plot);\n appendScoreToday(paddingGroup, data, scales);\n appendScoreLastYear(paddingGroup, data, scales);\n appendChartTitle(svg, plot);\n appendYAxisTitle(svg, plot);\n appendFootnote(svg, plot);\n }","function DrawCtrChart()\n{\n // create/delete rows \n if (ctrTable.getNumberOfRows() < contDataPoints.length)\n { \n var numRows = contDataPoints.length - ctrTable.getNumberOfRows();\n ctrTable.addRows(numRows);\n } else {\n for(var i=(ctrTable.getNumberOfRows()-1); i > contDataPoints.length; i--)\n {\n ctrTable.removeRow(i); \n }\n }\n\n // Populate data table with time/cost data points. \n for(var i=0; i < ctrTable.getNumberOfRows(); i++)\n {\n ctrTable.setCell(i, 0, new Date(parseInt(contDataPoints[i].timestamp)));\n ctrTable.setCell(i, 1, (parseInt(contDataPoints[i].clicks)/parseInt(contDataPoints[i].impressions))*100);\n }\n\n // Draw line chart.\n chartOptions.title = 'Ctr Chart';\n ctrChart.draw(ctrView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = google.visualization.arrayToDataTable([\n ['Test Name', 'Passed', 'Failed', 'Skipped']\n ].concat(values));\n\n var options = {\n title: 'Last ' + values.length + ' Test Runs',\n legend: { position: 'bottom' },\n colors: ['green', 'red', 'yellow'],\n backgroundColor: bgColor,\n isStacked: true\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.SteppedAreaChart(document.getElementById('historyChart'));\n chart.draw(data, options);\n \n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Task');\n data.addColumn('number', '% of Time');\n data.addRows([\n ['Setup EEG', 30],\n ['Review EEG', 30],\n ['Troubleshoot Computer', 10],\n ['CME', 10],\n ['Other', 20]\n ]);\n\n // Set chart options\n var options = {'title':'Breakdown of Time at Work',\n 'width':300,\n 'height':300,\n is3D:true,\n 'backgroundColor': {fill:'transparent'}\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('work-chart'));\n chart.draw(data, options);\n }","function drawChart() {\n // define chart to be drawn using DataTable object\n const data = new google.visualization.DataTable();\n\n // add date & time column\n data.addColumn(\"string\", \"Date & Time\");\n\n // add other category columns such as co2\n columns.forEach(column => {\n // find full text in relevent option for the current column\n const fullColumnName = $(`#cmbCategories option[value='${column}']`).text();\n data.addColumn(\"number\", fullColumnName);\n });\n\n // add rows created beforehand\n data.addRows(rows);\n\n // chart options\n const options = {\n hAxis: {\n title: \"Date & Time\"\n },\n vAxis: {\n title: \"Values\"\n },\n width: \"100%\",\n height: 700,\n };\n\n // instantiate and draw the chart\n const chart = new google.visualization.LineChart(document.getElementById(\"outputChart\"));\n\n // after chart is completely loaded and rendered\n google.visualization.events.addListener(chart, \"ready\", function () {\n // enable view chart button\n $(\"#btnViewChart\").attr(\"disabled\", false);\n\n // hide loading spinner\n $(\"#imgLoading\").hide();\n });\n\n chart.draw(data, options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('number', 'Ordua');\n data.addColumn('number', 'Barruko tenperatura');\n data.addColumn('number', 'Kanpoko tenperatura');\n\n data.addRows([\n [10, 14, 6],\n [11, 17, 7],\n [12, 18, 7],\n [13, 20, 8],\n [14, 21, 8],\n [15, 21, 8],\n [16, 21, 9],\n [17, 21, 9],\n [18, 19, 8],\n [19, 18, 7],\n [20, 17, 6],\n\n\n ]);\n\n // Set chart options\n var options = {\n chart: {\n title: 'Etxeko tenperatura',\n subtitle: 'Gradu zentigradutan'\n },\n width: 900,\n height: 300\n };\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.charts.Line(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","draw() {\n const selector = this.selector;\n let gradient;\n if (this.angles.length !== 1) {\n gradient = this.angles.reduce(\n (acc, curr, index) =>\n acc +\n `${this.getColor(index)} ${curr}deg, ${this.getColor(\n index + 1\n )} ${curr}deg, `,\n ''\n );\n let tempGradient = gradient.split(', ');\n tempGradient = tempGradient.slice(0, tempGradient.length - 2);\n gradient = tempGradient.join(', ');\n }\n else {\n gradient = `${this.getColor(0)} 0deg, ${this.getColor(0)} 360deg`;\n }\n\n const chart = document.createElement('DIV');\n const title = document.createElement('H2');\n const chartGraph = document.createElement('DIV');\n const chartData = document.createElement('DIV');\n const chartPercents = document.createElement('P');\n\n chart.setAttribute('class', 'chart');\n title.setAttribute('class', 'chart__title');\n title.textContent = this.title;\n chartGraph.setAttribute('class', `chart__graph chart__${this.chartType}`);\n chartGraph.style.backgroundImage = `conic-gradient(${gradient})`;\n chartData.setAttribute('class', 'chart__data');\n chartPercents.setAttribute('class', 'chart__percents');\n\n this.percents.forEach((percent, index) => {\n const chartPercent = document.createElement('SPAN');\n const chartPiece = document.createElement('I');\n chartPercent.textContent = `${percent}%`;\n chartPercent.setAttribute('class', 'chart__percent');\n chartPiece.setAttribute('class', 'chart__piece');\n chartPiece.style.backgroundColor = this.getColor(index);\n chartPercent.appendChild(chartPiece);\n chartPercents.appendChild(chartPercent);\n });\n chartData.appendChild(chartPercents);\n\n this.data.forEach((data, index) => {\n const chartDataRow = document.createElement('P');\n const chartDataName = document.createElement('SPAN');\n const chartDataValue = document.createElement('SPAN');\n const chartPiece = document.createElement('I');\n chartDataRow.setAttribute('class', 'chart__dataRow');\n chartDataName.setAttribute('class', 'chart__dataName');\n chartDataValue.setAttribute('class', 'chart__dataValue');\n chartDataName.textContent = Object.keys(data)[0];\n chartDataValue.textContent = Object.values(data)[0];\n chartPiece.setAttribute('class', 'chart__piece');\n chartPiece.style.backgroundColor = this.getColor(index);\n chartDataValue.appendChild(chartPiece);\n chartDataRow.appendChild(chartDataName);\n chartDataRow.appendChild(chartDataValue);\n chartData.appendChild(chartDataRow);\n });\n\n chart.appendChild(title);\n chart.appendChild(chartGraph);\n chart.appendChild(chartData);\n chart.dataset.chartId = this.id;\n\n const existId = document.querySelector(`[data-chart-id=\"${this.id}\"]`);\n if(existId){\n existId.parentNode.replaceChild(chart, existId);\n }\n else\n { \n document.querySelector(selector).appendChild(chart);\n }\n }","function drawChart() \n {\n\n // Create our data table.\n var data = new google.visualization.DataTable();\n\n \t // Create and populate the data table.\n \t var yearData = google.visualization.arrayToDataTable(yearRowData);\n \t var yearTotalsData = google.visualization.arrayToDataTable(yearTotalsRowData);\n \t var monthData = google.visualization.arrayToDataTable(monthRowData);\n \t var monthTotalsData = google.visualization.arrayToDataTable(monthTotalsRowData);\n \t var weekData = google.visualization.arrayToDataTable(weekRowData);\n \t var weekTotalsData = google.visualization.arrayToDataTable(weekTotalsRowData);\n \t var dayData = google.visualization.arrayToDataTable(dayRowData);\n \t var dayTotalsData = google.visualization.arrayToDataTable(dayTotalsRowData);\n \n // Instantiate and draw our chart, passing in some options.\n \t var chartAreaSize = {width:\"90%\",height:\"80%\"};\n \t var dayChartAreaSize = {width:\"80%\",height:\"80%\"};\n \t var chartHeight = 300;\n \t var chartWidth = 710;\n \t var pieWidth = 370;\n \t var dayWidth = 400;\n \t var fontPxSize = 14;\n \t \n \t \n // day charts\n if(dayDataExist)\n {\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('dayPieChart'));\n\t pieChart.draw(dayTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('dayPieChart'));\n\t pieChart.draw(dayTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('dayStackChart'));\n\t \t columnChart.draw(dayData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('dayStackChart'));\n\t \t columnChart.draw(dayData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('dayBarChart'));\n\t \t columnChart.draw(dayData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('dayBarChart'));\n\t \t columnChart.draw(dayData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:dayWidth, height:chartHeight, legend:'none', chartArea: dayChartAreaSize, fontSize:fontPxSize });\n\t }\n }\n else\n {\n \t $('#dayPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 1 });\n \t $('#dayStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 1 });\n \t $('#dayBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 1 });\n }\n \n if(weekDataExist)\n {\n\t // weekCharts\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('weekPieChart'));\n\t pieChart.draw(weekTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('weekPieChart'));\n\t pieChart.draw(weekTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('weekStackChart'));\n\t \t columnChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('weekStackChart'));\n\t \t columnChart.draw(weekData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('weekBarChart'));\n\t \t columnChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('weekBarChart'));\n\t \t columnChart.draw(weekData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(weekRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('weekLineChart'));\n\t\t lineChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('weekLineChart'));\n\t\t lineChart.draw(weekData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('weekAreaChart'));\n\t\t \t areaChart.draw(weekData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('weekAreaChart'));\n\t\t \t areaChart.draw(weekData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t } \n\t }\n\t else\n\t {\n\t \t //$(\"#weekLineChart\").html('Chart Not Available');\n\t \t //$(\"#weekAreaChart\").html('Chart Not Available');\n\t \t $('#weekLineChartTab').hide();\n\t \t $( '#lineCharts' ).tabs({ selected: 1 });\n\t \t $('#weekAreaChartTab').hide();\n\t \t $( '#areaCharts' ).tabs({ selected: 1 });\n\t }\n }\n else\n {\n \t $('#weekPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 2 });\n \t $('#weekStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 2 });\n \t $('#weekBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 2 });\n \t $('#weekLineChartTab').hide();\n \t $( '#lineCharts' ).tabs({ selected: 1 });\n \t $('#weekAreaChartTab').hide();\n \t $( '#areaCharts' ).tabs({ selected: 1 });\n }\n \n if(monthDataExist)\n {\n\t // month charts\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('monthPieChart'));\n\t pieChart.draw(monthTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('monthPieChart'));\n\t pieChart.draw(monthTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('monthStackChart'));\n\t \t columnChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('monthStackChart'));\n\t \t columnChart.draw(monthData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('monthBarChart'));\n\t \t columnChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('monthBarChart'));\n\t \t columnChart.draw(monthData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(monthRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('monthLineChart'));\n\t\t lineChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('monthLineChart'));\n\t\t lineChart.draw(monthData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('monthAreaChart'));\n\t\t \t areaChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('monthAreaChart'));\n\t\t \t areaChart.draw(monthData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t }\n\t else\n\t {\n\t \t //$(\"#monthLineChart\").html('Chart Not Available');\n\t \t //$(\"#monthAreaChart\").html('Chart Not Available');\n\t \t $('#monthLineChartTab').hide();\n\t \t $( '#lineCharts' ).tabs({ selected: 2 });\n\t \t $('#monthAreaChartTab').hide();\n\t \t $( '#areaCharts' ).tabs({ selected: 2 });\n\t }\n }\n else\n {\n \t $('#monthPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 3 });\n \t $('#monthStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 3 });\n \t $('#monthBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 3 });\n \t $('#monthLineChartTab').hide();\n \t $( '#lineCharts' ).tabs({ selected: 2 });\n \t $('#monthAreaChartTab').hide();\n \t $( '#areaCharts' ).tabs({ selected: 2 });\n }\n \n if(yearDataExist)\n {\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('yearPieChart'));\n\t pieChart.draw(yearTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('yearPieChart'));\n\t pieChart.draw(yearTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('yearStackChart'));\n\t \t columnChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('yearStackChart'));\n\t \t columnChart.draw(yearData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('yearBarChart'));\n\t \t columnChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('yearBarChart'));\n\t \t columnChart.draw(yearData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(yearRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('yearLineChart'));\n\t\t lineChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('yearLineChart'));\n\t\t lineChart.draw(yearData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('yearAreaChart'));\n\t\t \t areaChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('yearAreaChart'));\n\t\t \t areaChart.draw(yearData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t }\n\t else\n\t {\n\t \t $(\"#yearLineChart\").html('Chart Not Available');\n\t \t $(\"#yearAreaChart\").html('Chart Not Available');\n\t }\n }\n else\n {\n \t $(\"#yearPieChart\").html('Chart Not Available');\n \t $(\"#yearStackChart\").html('Chart Not Available');\n \t $(\"#yearBarChart\").html('Chart Not Available');\n \t $(\"#yearLineChart\").html('Chart Not Available');\n \t $(\"#yearAreaChart\").html('Chart Not Available');\n }\n \n }","function draw(){\n\n drawGrid();\n var seriesIndex;\n\n if(!graph.hasData) {\n return;\n }\n\n if(graph.options.axes.x1.show){\n if(!graph.options.axes.x1.labels || graph.options.axes.x1.labels.length === 0) {\n seriesIndex = graph.options.axes.x1.seriesIndex;\n graph.options.axes.x1.labels= getXLabels(graph.allSeries[seriesIndex].series[0], graph.options.labelDateFormat);\n }\n drawXLabels(graph.options.axes.x1);\n }\n if(graph.options.axes.x2.show && graph.hasData){\n if (!graph.options.axes.x2.labels || graph.options.axes.x2.labels.length === 0) {\n seriesIndex = graph.options.axes.x2.seriesIndex;\n graph.options.axes.x2.labels = getXLabels(graph.allSeries[seriesIndex].series[0], graph.options.labelDateFormat);\n }\n drawXLabels(graph.options.axes.x2);\n }\n\n if (graph.options.axes.y1.show) {\n drawYLabels(graph.maxVals[graph.options.axes.y1.seriesIndex], graph.minVals[graph.options.axes.y1.seriesIndex], graph.options.axes.y1);\n }\n if (graph.options.axes.y2.show) {\n drawYLabels(graph.maxVals[graph.options.axes.y2.seriesIndex], graph.minVals[graph.options.axes.y2.seriesIndex], graph.options.axes.y2);\n }\n }","function DrawHDDChart()\n{\n // create/delete rows \n if (hddTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - hddTable.getNumberOfRows();\n hddTable.addRows(numRows);\n } else {\n for(var i=(hddTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n hddTable.removeRow(i); \n }\n }\n\n // Populate data table with time/hdd data points. \n for(var i=0; i < hddTable.getNumberOfRows(); i++)\n {\n hddTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n hddTable.setCell(i, 1, parseInt(aggrDataPoints[i].hdd));\n }\n\n // Draw line chart.\n chartOptions.title = 'HDD Usage (%)';\n hddChart.draw(hddView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['activos', 5],\n ['inactivos', 5.8],\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Estado de las alumnas',\n 'width': 450,\n 'height': 300\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart() {\n \n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n \n // Set chart options\n var options = {'title':'How Much Pizza I Ate Last Night'};\n \n // Instantiate and draw our chart, passing in some options.\n var piechart = new google.visualization.PieChart(elements.piechart);\n var linechart = new google.charts.Line(elements.linechart);\n var barchart = new google.charts.Bar(elements.barchart);\n piechart.draw(data, options);\n linechart.draw(data, options);\n barchart.draw(data,options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n\n // Set chart options\n var options = {'title':'How Much Pizza I Ate Last Night'};\n\n // Instantiate and draw our chart, passing in some options.\n var piechart = new google.visualization.PieChart(elements.piechart);\n var linechart = new google.charts.Line(elements.linechart);\n var barchart = new google.charts.Bar(elements.barchart);\n piechart.draw(data, options);\n linechart.draw(data, options);\n barchart.draw(data,options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n\n // Set chart options\n var options = {'title':'Global Share',\n 'width':300,\n 'height':200,\n 'is3D': true,};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n 'use strict';\n // Define the chart to be drawn.\n var data = new google.visualization.DataTable();\n var points = [\n ['Nitrogen', 0.3],\n ['Oxygen', 0.21],\n ['Other', 0.01]\n ];\n addData(data, points); // by reference\n var chart = new google.visualization.PieChart(document.getElementById('chart_id'));\n chart.draw(data, null);\n }","function drawChart4() {\n\n // Create the data table.\n var data4 = new google.visualization.DataTable();\n data4.addColumn('string', 'nombre');\n data4.addColumn('number', 'cantidad');\n data4.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de pruebas por escuela sede: '+escuela,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data4, options1);\n\n }","function renderChart() {\n let datasets = [];\n\n if (funcionPoints.length > 0) {\n datasets.push({\n label: funcion,\n data: funcionPoints,\n borderColor: \"purple\",\n borderWidth: 2,\n fill: false,\n showLine: true,\n pointBackgroundColor: \"purple\",\n radius: 0,\n });\n } else {\n alert(\"No hay puntos para la funcion.\");\n }\n\n if (areaPoints.length > 0) {\n datasets.push({\n label: \"Area\",\n data: areaPoints,\n borderColor: \"blue\",\n borderWidth: 2,\n fill: true,\n showLine: true,\n pointBackgroundColor: \"blue\",\n tension: 0,\n radius: 0,\n });\n } else {\n alert(\"No hay puntos para el area.\");\n }\n\n if (insidePoints.length > 0) {\n datasets.push({\n label: \"Punto aleatorio por debajo de la función\",\n data: insidePoints,\n borderColor: \"green\",\n borderWidth: 2,\n fill: false,\n showLine: false,\n pointBackgroundColor: \"green\",\n });\n } else {\n alert(\"No hay puntos aleatorios.\");\n }\n\n if (outsidePoints.length > 0) {\n datasets.push({\n label: \"Punto aleatorio por arriba de la función\",\n data: outsidePoints,\n borderColor: \"red\",\n borderWidth: 2,\n fill: false,\n showLine: false,\n pointBackgroundColor: \"red\",\n });\n } else {\n alert(\"No hay puntos aleatorios.\");\n }\n\n data = { datasets };\n\n if (chart) {\n chart.data = data;\n chart.update();\n }\n }","function draw() {\n\n var isGridDrawn = false;\n\n if(graph.options.errorMessage) {\n var $errorMsg = $('' + graph.options.errorMessage + '')\n .addClass('alert box');\n\n graph.$el.find('.paper').prepend($errorMsg);\n }\n\n if(!graph.allSeries.length) {\n elroi.fn.grid(graph).draw();\n }\n\n $(graph.allSeries).each(function(i) {\n\n if(!isGridDrawn && graph.seriesOptions[i].type != 'pie') {\n elroi.fn.grid(graph).draw();\n isGridDrawn = true;\n }\n\n var type = graph.seriesOptions[i].type;\n elroi.fn[type](graph, graph.allSeries[i].series, i).draw();\n\n });\n\n }","function drawChart1() {\n\n // Create the data table.\n var data1 = new google.visualization.DataTable();\n data1.addColumn('string', 'nombre');\n data1.addColumn('number', 'cantidad');\n data1.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por escuela',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data1, options1);\n\n }","draw() {\n this._updateWidthHeight();\n\n this.initSvg();\n // bar char\n if (this.keysBar) {\n this.aggregateLabelsByKeys(this.selection, this.keysBar);\n }\n\n if (this.keysX && this.keysY) {\n this.aggregateValuesByKeys(this.selection, this.keysX, this.keysY);\n }\n\n this.barChart.draw();\n // scatterplot\n // this.scatter.draw();\n }","function drawChart() {\n var data = google.visualization.arrayToDataTable([\n ['', 'Hours per Day'],\n ['', 8],\n ['', 2],\n ['', 4],\n ['', 2],\n ['', 8]\n ]);\n \n var options = { legend: 'none','width':50, 'height':40};\n \n // var chart = new google.visualization.PieChart(document.getElementById('piechart'));\n // chart.draw(data,options);\n }","function makeCharts() {\n issueChart();\n countChart();\n averageChart();\n}","function drawChart() {\n\n // Create the data table.\n var data = google.visualization.arrayToDataTable([\n ['Scenario Name', 'Duration', {role: 'style'}]\n ].concat(values));\n\n var options = {\n title: 'Scenario Results',\n legend: { position: 'none' },\n vAxis: { title: 'Duration (seconds)'},\n backgroundColor: bgColor\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById('resultChart'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n // Crea la grafica a partir de la tabla\n var data = google.visualization.arrayToDataTable([\n ['Actividades', 'Actividades Esperadas', 'Actividades Presentes'],\n ['1', 33, 40],\n ['2', 117, 96],\n ['3', 166, 210],\n ['4', 117, 66],\n ['5', 66, 21],\n ['6', 33, 40],\n ['7', 117, 96],\n ['8', 150, 190],\n ['9', 103, 50],\n ['10', 200, 210]\n ]);\n\n // Opciones de la grafica\n var options = {\n chart: {\n title: 'Porcentaje de avance',\n subtitle: 'Cantidad',\n },\n bars: 'vertical',\n vAxis: {\n format: 'decimal'\n },\n height: 400,\n width: 1000,\n colors: ['#ffac19', '#63a537']\n };\n\n // Instancia de la grafica a nivel del html para dibujarla\n var chart = new google.charts.Bar(document.getElementById('chart_div'));\n chart.draw(data, google.charts.Bar.convertOptions(options));\n }","function drawChart() {\n\t\t// get the data from the table\n\t\t$(\".pie-chartify\").each( function(i,e){\n\t\t\tvar id = \"chart-\" + i,\n\t\t\t\tdt = dataTableFromTable( e ),\n\t\t\t\topt = {\n\t\t\t\t\t'pieSliceText': 'none',\n\t\t\t\t\t'tooltip': {\n\t\t\t\t\t\t'text': 'percentage'\n\t\t\t\t\t},\n\t\t\t\t\t'chartArea': {\n\t\t\t\t\t'width': '90%',\n\t\t\t\t\t\t'height': '90%'\n\t\t\t\t\t},\n\t\t\t\t\t'width': 600,\n\t\t\t\t\t'height': 400,\n\t\t\t\t\t'legend': {\n\t\t\t\t\t\tposition: 'labeled'\n\t\t\t\t\t},\n\t\t\t\t\t'fontName': 'Helvetica',\n\t\t\t\t\t'fontSize': 14,\n\t\t\t\t\t\"is3D\": true\n\t\t\t\t},\n\t\t\t\tc;\n\t\t\t$(this).after(\"\");\n\n\t\t\tc = new google.visualization.PieChart(\n\t\t\t\tdocument.getElementById(id)\n\t\t\t);\n\t\t\tc.draw(dt, opt);\n\t\t});\n\t}","function drawChart(pItemSel, pItemHeight, pConfigData, pValuesData, pDefaultConfig) {\n\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"pItemSel\": pItemSel,\n \"pItemHeight\": pItemHeight,\n \"pConfigData\": pConfigData,\n \"pValuesData\": pValuesData,\n \"pDefaultConfig\": pDefaultConfig,\n \"featureDetails\": util.featureDetails\n });\n\n var aTypeCharts = [\"pie\", \"donut\", \"gauge\"];\n var isGauge = false;\n var isPie = false;\n var isDonut = false;\n var specialStr = \"\\u200b\";\n\n // sort pValuesData by Time\n function sortArrByTime(pArr, pFormat) {\n\n function customeSort(pFirstValue, pSecondValue) {\n var parseTime = d3.timeParse(pFormat);\n var fD = parseTime(pFirstValue.x);\n var sD = parseTime(pSecondValue.x);\n return new Date(fD).getTime() - new Date(sD).getTime();\n }\n\n try {\n return pArr.sort(customeSort);\n }\n catch (e) {\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while try sort JSON Array by Time Value\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n }\n\n /* search link from data and set window.location.href */\n function executeLink(pData) {\n var key = specialStr + unescape(pData.id);\n var index = pData.index;\n\n if (seriesData[key]) {\n var seriesObj = seriesData[key];\n if (seriesObj.length === 1) {\n index = 0\n }\n\n if (seriesData[key][index] && seriesData[key][index].link) {\n util.link(seriesData[key][index].link);\n }\n }\n }\n\n try {\n var ownTooltip = false;\n\n var chartTitle = setObjectParameter(pConfigData.chartTitle, pDefaultConfig.d3chart.chartTitle || \"\").toString();\n var background = setObjectParameter(pConfigData.background, pDefaultConfig.d3chart.background);\n var backJSON = null;\n\n if (util.isDefinedAndNotNull(background)) {\n backJSON = {\n color: background\n };\n }\n\n /* line */\n var lineStep = setObjectParameter(pConfigData.lineStep, pDefaultConfig.d3chart.line.step);\n\n /* gauge */\n var gaugeMin = setObjectParameter(pConfigData.gaugeMin, pDefaultConfig.d3chart.gauge.min);\n var gaugeMax = setObjectParameter(pConfigData.gaugeMax, pDefaultConfig.d3chart.gauge.max);\n var gaugeType = setObjectParameter(pConfigData.gaugeType, pDefaultConfig.d3chart.gauge.type);\n var gaugeWidth = setObjectParameter(pConfigData.gaugeWidth, pDefaultConfig.d3chart.gauge.width);\n var gaugeArcMinWidth = setObjectParameter(pConfigData.gaugeArcMinWidth, pDefaultConfig.d3chart.gauge.arcMinWidth);\n var gaugeFullCircle = setObjectParameter(pConfigData.gaugeFullCircle, pDefaultConfig.d3chart.gauge.fullCircle, true);\n var gaugeTitle = setObjectParameter(pConfigData.gaugeTitle, pDefaultConfig.d3chart.gauge.title || \"\").toString();\n\n /* Grid */\n var gridX = setObjectParameter(pConfigData.gridX, pDefaultConfig.d3chart.grid.x, true);\n var gridY = setObjectParameter(pConfigData.gridY, pDefaultConfig.d3chart.grid.y, true);\n\n /* heights */\n var heightXAxis = setObjectParameter(pConfigData.xAxisHeight, pDefaultConfig.d3chart.x.axisHeight);\n\n /* Legend */\n var legendShow = setObjectParameter(pConfigData.legendShow, pDefaultConfig.d3chart.legend.show, true);\n var legendPosition = setObjectParameter(pConfigData.legendPosition, pDefaultConfig.d3chart.legend.position);\n\n /* padding */\n var chartPadding = util.jsonSaveExtend(null, pDefaultConfig.d3chart.padding);\n\n if (util.isDefinedAndNotNull(pConfigData.paddingBottom)) {\n chartPadding.bottom = pConfigData.paddingBottom;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingLeft)) {\n chartPadding.left = pConfigData.paddingLeft;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingRight)) {\n chartPadding.right = pConfigData.paddingRight;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingTop)) {\n chartPadding.top = pConfigData.paddingTop;\n }\n\n /* Axis */\n var rotateAxis = setObjectParameter(pConfigData.rotateAxis, pDefaultConfig.d3chart.rotateAxis, true);\n var axisLabelPosition = setObjectParameter(pConfigData.axisLabelPosition, pDefaultConfig.d3chart.axisLabelPosition);\n\n var xAxisLabelPosition = null;\n var yAxisLabelPosition = null;\n\n switch (axisLabelPosition) {\n case \"inner1\":\n xAxisLabelPosition = \"inner-left\";\n yAxisLabelPosition = \"inner-bottom\";\n break;\n case \"inner2\":\n xAxisLabelPosition = \"inner-center\";\n yAxisLabelPosition = \"inner-middle\";\n break;\n case \"inner3\":\n xAxisLabelPosition = \"inner-right\";\n yAxisLabelPosition = \"inner-top\";\n break;\n case \"outer1\":\n xAxisLabelPosition = \"outer-left\";\n yAxisLabelPosition = \"outer-bottom\";\n break;\n case \"outer2\":\n xAxisLabelPosition = \"outer-center\";\n yAxisLabelPosition = \"outer-middle\";\n break;\n case \"outer3\":\n xAxisLabelPosition = \"outer-right\";\n yAxisLabelPosition = \"outer-top\";\n break;\n default:\n break;\n }\n\n if (rotateAxis) {\n var xAxisLabelPositionTmp = xAxisLabelPosition;\n xAxisLabelPosition = yAxisLabelPosition;\n yAxisLabelPosition = xAxisLabelPositionTmp;\n }\n\n /* tooltip */\n var tooltipShow = setObjectParameter(pConfigData.tooltipShow, pDefaultConfig.d3chart.tooltip.show, true);\n var tooltipGrouped = setObjectParameter(pConfigData.tooltipGrouped, pDefaultConfig.d3chart.tooltip.grouped, true);\n\n /* Transition duration */\n var transitionDuration = setObjectParameter(pConfigData.transitionDuration || pDefaultConfig.d3chart.transitionDuration);\n\n /* x Axis */\n var xShow = setObjectParameter(pConfigData.xShow, pDefaultConfig.d3chart.x.show, true);\n var xLabel = setObjectParameter(pConfigData.xLabel, pDefaultConfig.d3chart.x.label || \"\").toString();\n var xType = setObjectParameter(pConfigData.xType, pDefaultConfig.d3chart.x.type);\n var xAxisTimeFormat = null;\n var xName = null;\n\n /* x ticks */\n var xTickCutAfter = setObjectParameter(pConfigData.xTickCutAfter, pDefaultConfig.d3chart.x.tick.cutAfter);\n var xTickMaxNumber = setObjectParameter(pConfigData.xTickMaxNumber, pDefaultConfig.d3chart.x.tick.maxNumber);\n var xTickRotation = setObjectParameter(pConfigData.xTickRotation, pDefaultConfig.d3chart.x.tick.rotation);\n var xTickMultiline = setObjectParameter(pConfigData.xTickMultiline, pDefaultConfig.d3chart.x.tick.multiline, true);\n var xTickFit = setObjectParameter(pConfigData.xTickFit, pDefaultConfig.d3chart.x.tick.fit, true);\n var xTickAutoRotate = setObjectParameter(pConfigData.xTickAutoRotate, pDefaultConfig.d3chart.x.tick.autoRotate, true);\n var xTickTimeFormat = null;\n\n if (xType == \"category\" || xType == \"timeseries\") {\n xName = \"x\";\n }\n\n if (xType == \"timeseries\") {\n xAxisTimeFormat = setObjectParameter(pConfigData.xTimeFormat, pDefaultConfig.d3chart.x.timeFormat);\n xTickTimeFormat = setObjectParameter(pConfigData.xTickTimeFormat, pDefaultConfig.d3chart.x.tick.timeFormat);\n // sort data because of tooltip index\n sortArrByTime(pValuesData, xAxisTimeFormat);\n }\n\n /* cut string if category names are to long */\n if (xType == \"category\") {\n xTickTimeFormat = function (index, categoryName) {\n return util.cutString(categoryName, xTickCutAfter);\n };\n }\n\n /* y Axis */\n var yLabel = setObjectParameter(pConfigData.yLabel, pDefaultConfig.d3chart.y.label || \"\").toString();\n var yLog = setObjectParameter(pConfigData.yLog, pDefaultConfig.d3chart.y.log, true);\n var yType = null;\n if (yLog) {\n yType = \"log\";\n }\n var yMin = pConfigData.yMin || pDefaultConfig.d3chart.y.min;\n var yMax = pConfigData.yMax || pDefaultConfig.d3chart.y.max;\n var yCulling = pConfigData.yTickMaxNumber || pDefaultConfig.d3chart.y.tick.maxNumber;\n var yUnit = pConfigData.yUnit || pDefaultConfig.d3chart.y.unit;\n\n /* y2 Axis */\n var y2Show = false;\n var y2Label = setObjectParameter(pConfigData.y2Label, pDefaultConfig.d3chart.y2.label || \"\").toString();\n var y2Log = setObjectParameter(pConfigData.y2Log, pDefaultConfig.d3chart.y2.log, true);\n var y2Type = null;\n if (y2Log) {\n y2Type = \"log\";\n }\n var y2Min = setObjectParameter(pConfigData.y2Min, pDefaultConfig.d3chart.y2.min);\n var y2Max = setObjectParameter(pConfigData.y2Max, pDefaultConfig.d3chart.y2.max);\n var y2Culling = setObjectParameter(pConfigData.y2TickMaxNumber, pDefaultConfig.d3chart.y2.tick.maxNumber);\n var y2Unit = setObjectParameter(pConfigData.y2Unit, pDefaultConfig.d3chart.y2.unit);\n\n /* Zoom and Subchart */\n var zoomEnabled = setObjectParameter(pConfigData.zoomEnabled, pDefaultConfig.d3chart.zoom.enabled, true);\n var zoomType = setObjectParameter(pConfigData.zoomType, pDefaultConfig.d3chart.zoom.type);\n var showSubChart = false;\n\n if (zoomEnabled) {\n if (zoomType == \"scroll\") {\n showSubChart = false;\n } else if (zoomType == \"subchart\") {\n showSubChart = true;\n zoomEnabled = false;\n } else if (zoomType == \"drag\") {\n zoomEnabled = true;\n showSubChart = false;\n }\n } else {\n showSubChart = false;\n }\n\n var zoomRescale = setObjectParameter(pConfigData.zoomRescale, pDefaultConfig.d3chart.zoom.rescale, true);\n\n /* Prepare Data for Render */\n var dataArr = [];\n var categoriesArr = [];\n var groupsArr = [];\n var colorsJSON = {};\n var typesJSON = {};\n var axesJSON = {};\n var namesJSON = {};\n var groupJSON = {};\n var seriesCnt = 0;\n var seriesData = util.groupObjectArray(pValuesData, 'seriesID');\n\n if (seriesData) {\n /* Add Categories or time values to x Axis when correct type is set */\n if (xType == \"category\" || xType == \"timeseries\") {\n categoriesArr.push(\"x\");\n var xCatObj = util.groupObjectArray(pValuesData, \"x\");\n var xCatArr = Object.keys(xCatObj);\n\n $.each(xCatArr, function (dIdx, dataValues) {\n categoriesArr.push((setObjectParameter(dataValues.replace(specialStr, \"\"), null)));\n });\n }\n\n dataArr.push(categoriesArr);\n\n /* Transform data for billboard.js */\n $.each(seriesData, function (idx, seriesData) {\n var series;\n seriesCnt++;\n if (seriesData[0] && seriesData[0].seriesID) {\n series = seriesData[0];\n var dataKey = escape(series.seriesID);\n colorsJSON[dataKey] = series.color;\n typesJSON[dataKey] = series.type;\n\n /* check if atypechart*/\n if (aTypeCharts.indexOf(series.type) >= 0) {\n zoomEnabled = false;\n }\n\n if (series.type === \"gauge\") {\n isGauge = true;\n }\n\n if (series.type === \"pie\") {\n isPie = true;\n }\n\n if (series.type === \"donut\") {\n isDonut = true;\n }\n\n if (util.isDefinedAndNotNull(series.tooltip)) {\n ownTooltip = true;\n }\n\n axesJSON[dataKey] = (series.yAxis || \"y\");\n if (util.isDefinedAndNotNull(series.groupID)) {\n var groupID = escape(series.groupID.toString());\n if (groupJSON[groupID]) {\n groupJSON[groupID].push(dataKey);\n } else {\n groupJSON[groupID] = [];\n groupJSON[groupID].push(dataKey);\n }\n }\n\n if (series.yAxis == \"y2\") {\n y2Show = true;\n }\n namesJSON[dataKey] = (setObjectParameter(series.label, dataKey));\n\n var arr = [];\n arr.push(dataKey);\n if (xType == \"category\" || xType == \"timeseries\") {\n $.each(xCatObj, function (dIdx, dataValues) {\n var setValueY = null;\n var setValueZ = null;\n $.each(dataValues, function (sIDx, sDataValues) {\n if (escape(sDataValues.seriesID) == dataKey) {\n setValueY = sDataValues.y;\n if (sDataValues.z) {\n setValueZ = sDataValues.z;\n }\n }\n });\n if (setValueZ !== null) {\n arr.push({\n \"y\": setValueY,\n \"z\": setValueZ\n });\n } else {\n arr.push(setValueY);\n }\n });\n } else {\n $.each(seriesData, function (dIdx, dataValues) {\n var setValueY = setObjectParameter(dataValues.y, null);\n if (dataValues.z) {\n var setValueZ = dataValues.z;\n arr.push({\n \"y\": setValueY,\n \"z\": setValueZ\n });\n } else {\n arr.push(setValueY);\n }\n });\n }\n\n dataArr.push(arr);\n\n } else {\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"No seriesID found in seriesID Cursor\",\n \"featureDetails\": util.featureDetails\n });\n }\n\n });\n\n /* Group JSON to Array */\n $.each(groupJSON, function (dIdx, jsonObj) {\n groupsArr.push(jsonObj);\n });\n\n /* Labels and Datapoints */\n var dataLabels = setObjectParameter(pConfigData.showDataLabels, pDefaultConfig.d3chart.showDataLabels, true);\n\n if (isPie || isDonut) {\n dataLabels = {\n colors: \"white\"\n };\n } else if (isGauge) {\n dataLabels = {\n colors: (gaugeType === \"single\" && seriesCnt > 1) ? \"white\" : \"inherit\"\n };\n }\n var showDataPoints = setObjectParameter(pConfigData.showDataPoints, pDefaultConfig.d3chart.showDataPoints, true);\n\n var showAbsoluteValues = setObjectParameter(pConfigData.showAbsoluteValues, pDefaultConfig.d3chart.showAbsoluteValues);\n var absoluteFormatting;\n\n if (showAbsoluteValues) {\n absoluteFormatting = function (value, ratio, id) {\n return value + yUnit;\n }\n }\n\n var ttContent;\n if (ownTooltip) {\n ttContent = function (d) {\n var div = $(\"\");\n div.addClass(\"bb-tooltip\");\n div.addClass(\"bida-chart-tooltip-custome\");\n $.each(d, function (i, pData) {\n var key = specialStr + unescape(pData.id);\n var index = pData.index;\n\n if (seriesData[key]) {\n var seriesObj = seriesData[key];\n if (seriesObj.length === 1) {\n index = 0\n }\n if (seriesData[key][index] && util.isDefinedAndNotNull(seriesData[key][index].tooltip)) {\n var ttS = seriesData[key][index].tooltip;\n if (pRequireHTMLEscape !== false) {\n ttS = util.escapeHTML(ttS);\n }\n div.append(ttS);\n div.append(\"
\");\n }\n }\n });\n return div[0].outerHTML;\n }\n }\n\n try {\n var chartContIDSel = pItemSel + \"bbc\";\n var chartContID = chartContIDSel.replace(\"#\", \"\");\n var chartCont = $(\"\");\n chartCont.attr(\"id\", chartContID);\n\n $(pItemSel).append(chartCont);\n\n var bbData = {\n bindto: chartContIDSel,\n background: backJSON,\n title: {\n text: chartTitle\n },\n size: {\n height: pItemHeight\n },\n data: {\n x: xName,\n xFormat: xAxisTimeFormat,\n columns: dataArr,\n types: typesJSON,\n groups: groupsArr,\n colors: colorsJSON,\n labels: dataLabels,\n axes: axesJSON,\n names: namesJSON,\n onclick: function (pData) {\n executeLink(pData);\n }\n },\n pie: {\n label: {\n format: absoluteFormatting,\n threshold: 0.05\n }\n },\n donut: {\n label: {\n format: absoluteFormatting,\n threshold: 0.05\n }\n },\n line: {\n step: {\n type: lineStep\n }\n },\n gauge: {\n label: {\n format: absoluteFormatting,\n threshold: (gaugeType === \"single\") ? 0.05 : null\n },\n fullCircle: gaugeFullCircle,\n min: gaugeMin,\n max: gaugeMax,\n type: gaugeType,\n width: gaugeWidth,\n title: gaugeTitle,\n arc: {\n minWidth: gaugeArcMinWidth\n }\n },\n radar: {\n direction: {\n clockwise: true\n }\n },\n subchart: {\n show: showSubChart\n },\n zoom: {\n type: zoomType,\n enabled: zoomEnabled,\n rescale: zoomRescale\n },\n transition: {\n duration: transitionDuration\n },\n legend: {\n show: legendShow,\n position: legendPosition\n },\n tooltip: {\n show: tooltipShow,\n grouped: tooltipGrouped,\n contents: ttContent\n },\n grid: {\n x: {\n show: gridX,\n },\n y: {\n show: gridY\n }\n },\n point: {\n show: showDataPoints\n },\n axis: {\n rotated: rotateAxis,\n x: {\n show: xShow,\n label: {\n text: xLabel,\n position: xAxisLabelPosition\n },\n type: xType,\n tick: {\n culling: {\n max: xTickMaxNumber\n },\n autorotate: xTickAutoRotate,\n rotate: xTickRotation,\n multiline: xTickMultiline,\n format: xTickTimeFormat,\n fit: xTickFit\n },\n height: heightXAxis\n },\n y: {\n label: {\n text: yLabel,\n position: yAxisLabelPosition\n },\n type: yType,\n max: yMax,\n min: yMin,\n tick: {\n culling: {\n max: yCulling\n },\n format: function (d) {\n return d + yUnit\n }\n }\n },\n y2: {\n show: y2Show,\n label: {\n text: y2Label,\n position: yAxisLabelPosition\n },\n type: y2Type,\n max: y2Max,\n min: y2Min,\n tick: {\n culling: {\n max: y2Culling\n },\n format: function (d) {\n return d + y2Unit\n }\n }\n }\n },\n padding: chartPadding\n };\n\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"finalChartData\": bbData,\n \"featureDetails\": util.featureDetails\n });\n\n var chart = bb.generate(bbData);\n\n /* reset zoom on right click */\n if (zoomEnabled) {\n $(chartContIDSel).contextmenu(function (evt) {\n evt.preventDefault();\n chart.unzoom();\n });\n }\n\n /* execute resize */\n function resize() {\n if (!document.hidden && chartCont.is(\":visible\")) {\n chart.resize({\n height: pItemHeight\n });\n }\n }\n\n // bind resize events\n $(window).resize(function () {\n resize();\n });\n\n /* dirty workaround because in APEX sometimes chart renders in wrong size hope apexDev Team will bring us layout change events also for tabs, collapsible so on */\n function stopResizeWA() {\n if (timers.innerItemsIntervals && timers.innerItemsIntervals[pItemSel]) {\n clearInterval(timers.innerItemsIntervals[pItemSel]);\n }\n }\n\n function startResizeWA() {\n timers.innerItemsIntervals[pItemSel] = setInterval(function () {\n if ($(pItemSel).length === 0) {\n clearInterval(timers.innerItemsIntervals[pItemSel]);\n } else {\n if (chartCont.is(\":visible\")) {\n if (!util.isBetween(chartCont.width(), chartCont.find(\"svg\").width(), resizeRange)) {\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Chart has resize problem\",\n \"featureDetails\": util.featureDetails\n });\n resize();\n }\n\n }\n }\n }, timers.defTime);\n }\n\n stopResizeWA();\n startResizeWA();\n\n /* stop when tab is not active */\n document.addEventListener(\"visibilitychange\", function () {\n if (document.hidden) {\n stopResizeWA();\n } else {\n startResizeWA();\n }\n });\n\n } catch (e) {\n $(pItemSel).empty();\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while try to render chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n } else {\n util.noDataMessage.show(pItemSel, pDefaultConfig.noDataMessage);\n }\n } catch (e) {\n $(pItemSel).empty();\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while prepare data for chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n }","function drawChart4() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'InstallationDate');\n data.addColumn('number', 'Number of Meters');\n data.addRows(installationsPerDate());\n\n // Set chart options\n var options = {\n 'title': 'Installations Per Date',\n 'width': 250,\n 'height': 200,\n };\n\n // Instantiate and draw our chart, passing in some options.\n // var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n var chart = new google.visualization.PieChart(document.getElementById('chart_div4'));\n chart.draw(data, options);\n}","drawCanvas(arrData) {\n const W = +this.elements.$tags.contentWrap.getBoundingClientRect().width;\n const H = +this.panel.svgHeight;\n const dateFrom = this.range.from.clone();\n const dateTo = this.range.to.clone();\n\n // область визуализации с данными (график)\n const margin = this.elements.sizes.marginAreaVis;\n const widthAreaVis = W - margin.left - margin.right;\n const heightAreaVis = H - margin.top - margin.bottom;\n const heightRowBar = parseInt(heightAreaVis / arrData.length, 10);\n\n const xScaleDuration = d3.scaleTime()\n .domain([0, new Date(dateTo).getTime() - new Date(dateFrom).getTime()])\n .range([0, widthAreaVis]);\n\n const xScaleTime = d3.scaleTime()\n .domain([new Date(dateFrom).getTime(), new Date(dateTo).getTime()])\n .range([0, widthAreaVis]);\n\n const canvasElement = d3.select(document.createElement('canvas'))\n .datum(arrData) // data binding\n .attr('width', widthAreaVis)\n .attr('height', heightAreaVis);\n\n const context = canvasElement.node().getContext('2d');\n\n // clear canvas\n context.fillStyle = 'rgba(0,0,0, 0)';\n context.rect(0, 0, canvasElement.attr('width'), canvasElement.attr('height'));\n context.fill();\n\n let top = 0;\n const sizeDiv = 1; // dividing line\n\n _.forEach(arrData, (changes, i, arr) => {\n _.forEach(changes, (d) => {\n context.beginPath();\n context.fillStyle = d.color;\n context.rect(\n xScaleTime(d.start) < 0 ? 0 : xScaleTime(d.start),\n top, xScaleDuration(d.ms),\n arr.length - 1 !== i ? heightRowBar - sizeDiv : heightRowBar,\n );\n context.fill();\n context.closePath();\n });\n\n top += heightRowBar;\n });\n return canvasElement.node();\n }","function drawChart() {\r\n\r\n // Create the data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Country');\r\n data.addColumn('number', 'Population');\r\n data.addColumn('number', 'Area');\r\n data.addColumn('number', 'Occupancy');\r\n data.addRows([\r\n [cdata.name, cdata.population,cdata.area,(cdata.area/cdata.population)]\r\n \r\n \r\n ]);\r\n\r\n // Set chart options\r\n var options = {'title':'Population Area Ratio of '+cdata.name,\r\n 'width':250,\r\n 'height':300};\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.BarChart(document.getElementById('bc1'));\r\n chart.draw(data, options);\r\n }","function drawChart() {\n const canvas = document.createElement('canvas');\n let data = [];\n let min = Infinity;\n let max = 0;\n for (let i = 0; i < TIMINGS.length; i++) {\n let series = TIMINGS[i];\n min = Math.min(min, Math.min(...series));\n max = Math.max(max, Math.max(...series));\n }\n\n for (let i = 0; i < TIMINGS.length; i++) {\n let series = TIMINGS[i];\n data.push({\n data: bellCurvify(series, min, max),\n label: getFileName(PATHS[i]),\n\n borderColor: COLORS[i % COLORS.length],\n fill: false\n });\n }\n const context = canvas.getContext('2d');\n let labels = [];\n for (let i = min; i <= max; i++) {\n labels.push('' + i);\n }\n document.body.appendChild(canvas);\n new Chart(context, {\n type: 'line',\n data: {\n labels: labels,\n datasets: data\n },\n options: {}\n });\n}","function drawChart() {\n ctx.beginPath();\n ctx.strokeStyle = \"blue\";\n var firstElement = true;\n ctx.font = \"10px sans-serif\";\n //plot each entry if it is in the range\n for (let entry of entries) {\n //check if entry is in the range of xmin and xmax, otherwise ignore it\n if (entry.date > xMin && entry.date < xMax) {\n //calculate location of pace coordinate\n let m = entry.getMin();\n let s = entry.getSec();\n let paceLocation = (m * 4) + (s / 15);\n\n //calculate location of date coordinate\n //plan - we have 60 blocks of usable space, can get date in ms with getTime()\n //range=xmax-min\n //value=date-xmin\n //value=value*60blocks\n let xRange = xMax.getTime() - xMin.getTime();\n let dateLocation = (entry.date.getTime() - xMin.getTime());\n dateLocation = ((dateLocation / xRange) * 60) + 5;//add 5 for axis offset\n ctx.strokeText(m + \":\" + s + \" \", blocks(dateLocation), blocks(40 - paceLocation - 1));\n \n //start at this first element\n if (firstElement) { ctx.moveTo(blocks(dateLocation), blocks(40 - paceLocation)); }\n\n //connect remaining data points\n ctx.lineTo(blocks(dateLocation), blocks(40 - paceLocation));\n ctx.arc(blocks(dateLocation), blocks(40 - paceLocation), 2, 0, Math.PI * 2, true);\n firstElement = false;\n }\n }\n ctx.font = \"12px sans-serif\";\n ctx.stroke();\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Color');\n data.addColumn('number', 'Ranking');\n\n data.addRows(graphData);\n\n // Set chart options\n var options = {\n title: 'T-Shirt Rankings',\n height: 600,\n legend: {position: 'none'},\n vAxis: {format:'#'}\n };\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n\n\t// Create the data table.\n\tvar data = new google.visualization.DataTable();\n\tdata.addColumn('string', 'Topping');\n\tdata.addColumn('number', 'Amt In Dollars');\n\tdata.addRows([\n\t [names.name1, values.expenseNameOne],\n\t [names.name2, values.expenseNameTwo],\n\t [names.name3, values.expenseNameThree],\n\t [names.name4, values.expenseNameFour],\n\t [names.name5, values.expenseNameFive]\n\t]);\n\n\t// Set chart options\n\tvar options = {'title':'MY EXPENSES',\n\t\t\t\t 'width':800,\n\t\t\t\t 'height':500};\n\n\t// Instantiate and draw our chart, passing in some options.\n\tvar chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n\tchart.draw(data, options);\n }","function drawChart() {\r\n\r\n // Create the data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Country');\r\n data.addColumn('number', 'Population');\r\n data.addColumn('number', 'Area');\r\n data.addColumn('number', 'Occupancy');\r\n data.addRows([\r\n [countrydata.name, countrydata.population,countrydata.area,(countrydata.area/countrydata.population)]\r\n \r\n \r\n ]);\r\n\r\n // Set chart options\r\n var options = {'title':'Population Area Ratio of '+countrydata.name,\r\n 'width':250,\r\n 'height':300};\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.ColumnChart(document.getElementById('bc2'));\r\n chart.draw(data, options);\r\n }","function drawChart1() {\n\n // Create the data table.\n var data1 = new google.visualization.DataTable();\n data1.addColumn('string', 'nombre');\n data1.addColumn('number', 'cantidad');\n data1.addRows(render);\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por escuela sede: '+sede,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data1, options1);\n\n }","function drawChart(x1, y1, x2, y2, x3, y3) {\n var data1 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x1],\n ['Absent', y1],\n ]);\n var data2 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x2],\n ['Absent', y2],\n ]);\n var data3 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x3],\n ['Absent', y3],\n ]);\n\n // Display the chart inside the element with id=\"piechart\"\n var chart1 = new google.visualization.PieChart(document.getElementById('piechart1'));\n var chart2 = new google.visualization.PieChart(document.getElementById('piechart2'));\n var chart3 = new google.visualization.PieChart(document.getElementById('piechart3'));\n chart1.draw(data1);\n chart2.draw(data2);\n chart3.draw(data3);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Category');\n data.addColumn('number', 'Amount');\n data.addRows(myData);\n\n // Set chart options\n var options = {'width':500,\n 'height':400};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function DrawClicksChart()\n{\n // create/delete rows \n if (clicksTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - clicksTable.getNumberOfRows();\n clicksTable.addRows(numRows);\n } else {\n for(var i=(clicksTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n clicksTable.removeRow(i); \n }\n }\n\n // Populate data table with time/clicks data points. \n for(var i=0; i < clicksTable.getNumberOfRows(); i++)\n {\n clicksTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n clicksTable.setCell(i, 1, parseInt(aggrDataPoints[i].clicks));\n }\n\n // Draw line chart.\n chartOptions.title = 'Clicks Chart';\n clicksChart.draw(clicksView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Day');\n data.addColumn('number', 'Hours');\n data.addRows([\n ['Sunday', 166860],\n ['Monday', 91133.5],\n ['Tuesday', 91133.5],\n ['Wednesday', 91133.5],\n ['Thursday', 91133.5],\n ['Friday', 91133.5],\n ['Saturday', 94222],\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Hours of free parking per day of the week',\n 'width': 300,\n 'height': 150,\n pieHole: .4\n };\n\n // Instantiate and draw our chart, passing in some options.\n // var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart(data,Container,width,height,arrBuckets,props) {\n\n// alert(\"Drawing chart\");\n\n var csvfile = arrBuckets.timeline.title + \",\" + arrBuckets.value.title + '\\n';\n \n var dataValues = d3.map(data, function(d,i) {csvfile += d.timeline+ \",\" + d.value + '\\n';\n return d.timeline + \",\" + d.value;});\n \n var chartDiv = document.getElementById(Container[0][0].id);\n var win = window\n , doc = document\n , ele = doc.documentElement\n , bdy = doc.getElementsByTagName(\"body\")[0]\n , screenWidth = screen.width;\n\n var main_margin = {top: 15, right: 15, bottom: 15, left: 15};\n\n chartDiv.style.top = main_margin.top + \"px\";\n chartDiv.style.left = main_margin.left + \"px\";\n chartDiv.style.width = width - main_margin.left - main_margin.right + \"px\";\n chartDiv.style.height = height - main_margin.top - main_margin.bottom + \"px\";\n\n mygraph = new Dygraph(\n chartDiv,\n csvfile, // CSV file\n props\n );\n\n}","function DrawRevenueChart()\n{\n // create/delete rows \n if (revenueTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - revenueTable.getNumberOfRows();\n revenueTable.addRows(numRows);\n } else {\n for(var i=(revenueTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n revenueTable.removeRow(i); \n }\n }\n\n // Populate data table with time/revenue data points. \n for(var i=0; i < revenueTable.getNumberOfRows(); i++)\n {\n revenueTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n revenueTable.setCell(i, 1, parseFloat(aggrDataPoints[i].revenue));\n }\n\n // Draw line chart.\n chartOptions.title = 'Revenue Chart';\n revenueChart.draw(revenueView, chartOptions); \n}","function drawChart() {\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Weather Element');\n data.addColumn('number', 'Dec');\n data.addColumn('number', 'Feb');\n data.addColumn('number', 'Jan');\n data.addColumn('number', 'Nov');\n data.addColumn('number', 'Oct');\n data.addColumn('number', 'Sep');\n\n data.addRows([\n ['Snow - Heavy', 6,0,2,2,0,0],\n ['Snow - Light', 2,0,0,0,0,0],\n ['Snow - Normal', 4,0,2,0,0,0]\n ]);\n\n var options = {\n 'title': 'Snowy Weather by Months',\n 'width': 500,\n 'height': 600,\n 'isStacked': true};\n \n var chart = new google.visualization.ColumnChart(document.getElementById('chart_div2'));\n chart.draw(data, options);\n }","function drawChart() { \n var data =window.google.visualization.arrayToDataTable([\n ['Location', 'Pending Request','Approved Request'],\n ['Bangalore', 8,10],\n ['Gurgaon', 2,12],\n ['Chennai', 4,2],\n ['UK', 2,8],\n ]);\n var options = {'width':500, 'height':300};\n var chart = new window.google.visualization.PieChart(document.getElementById(self.props.id));\n chart.draw(data, options); \n }","function DrawRAMChart()\n{\n // create/delete rows \n if (ramTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - ramTable.getNumberOfRows();\n ramTable.addRows(numRows);\n } else {\n for(var i=(ramTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n ramTable.removeRow(i); \n }\n }\n\n // Populate data table with time/ram data points. \n for(var i=0; i < ramTable.getNumberOfRows(); i++)\n {\n ramTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n ramTable.setCell(i, 1, parseFloat(aggrDataPoints[i].ram));\n }\n\n // Draw line chart.\n chartOptions.title = 'RAM Usage (%)';\n ramChart.draw(ramView, chartOptions); \n}","function DrawCostChart()\n{\n // create/delete rows \n if (costTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - costTable.getNumberOfRows();\n costTable.addRows(numRows);\n } else {\n for(var i=(costTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n costTable.removeRow(i); \n }\n }\n \n // Populate data table with time/cost data points. \n for(var i=0; i < costTable.getNumberOfRows(); i++)\n {\n //if(parseFloat(aggrDataPoints[i].cost) < 500) continue;\n costTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n costTable.setCell(i, 1, parseFloat(aggrDataPoints[i].cost));\n }\n\n // Draw line chart.\n chartOptions.title = 'Cost Chart';\n costChart.draw(costView, chartOptions); \n}","function drawChart() {\n console.log(\"drawChart ran\");\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Day');\n data.addColumn('number', 'Temperature');\n var i = 0;\n /*Loops through the days of the week and for each\n day there is weather info it adds a row */\n for (i = 0; i < days_of_the_week.length; i++) {\n if (day_and_temp_map.has(days_of_the_week[i])) {\n data.addRow([days_of_the_week[i], day_and_temp_map.get(days_of_the_week[i])]);\n }\n }\n\n // Set chart options\n var options = {\n 'title': 'Weather forecast chart',\n 'width': 500,\n 'height': 300\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function DrawMarginChart()\n{\n // create/delete rows \n if (marginTable.getNumberOfRows() < contDataPoints.length)\n { \n var numRows = contDataPoints.length - marginTable.getNumberOfRows();\n marginTable.addRows(numRows);\n } else {\n for(var i=(marginTable.getNumberOfRows()-1); i > contDataPoints.length; i--)\n {\n marginTable.removeRow(i); \n }\n }\n\n // Populate data table with time/cost data points. \n for(var i=0; i < marginTable.getNumberOfRows(); i++)\n {\n marginTable.setCell(i, 0, new Date(parseInt(contDataPoints[i].timestamp)));\n marginTable.setCell(i, 1, (parseFloat(contDataPoints[i].cost)-parseFloat(contDataPoints[i].revenue))/parseFloat(contDataPoints[i].revenue));\n }\n\n // Draw line chart.\n chartOptions.title = 'Margin Chart';\n marginChart.draw(marginView, chartOptions); \n}","function drawChart() {\n details.html('');\n wrap.html('');\n\n svg = wrap.append('svg')\n .attr('width', width + margin.left + margin.right)\n .attr('height', height + margin.top + margin.bottom);\n\n change = details.append('div').attr('class', 'change');\n range = details.append('div').attr('class', 'range');\n showHigh = range.append('span').attr('class', 'high');\n showLow = range.append('span').attr('class', 'low');\n volume = details.append('div').attr('class', 'volume');\n\n bg = svg.append('rect')\n .attr('width', width + margin.left + margin.right)\n .attr('height', height + margin.top + margin.bottom)\n .style({opacity: 0});\n\n pointer = svg.append('path')\n .attr('class', 'pointer')\n .attr('d', 'M 0 0 L 7 -7 L 40 -7 L 40 7 L 7 7 L 0 0')\n .attr('transform', 'translate(' +\n (width + margin.left) + ',' +\n (height + margin.top) + ')');\n\n svg.append('rect').attr('width', width + margin.left + margin.right)\n .attr('class', 'timeBackground')\n .attr('height', margin.bottom)\n .attr('transform', 'translate(0,' + (height + margin.top) + ')');\n\n gEnter = svg.append('g')\n .attr('transform', 'translate(' + margin.left + ',' + margin.top + ')');\n\n gEnter.append('g').attr('class', 'grid');\n gEnter.append('path').attr('class', 'line');\n\n gEnter.append('g').attr('class', 'x axis');\n gEnter.append('g').attr('class', 'price axis')\n .attr('transform', 'translate(' + width + ', 0)');\n\n flipping = false;\n flip = svg.append('g').attr('class', 'flip')\n .attr('width', margin.right)\n .attr('height', margin.bottom)\n .attr('transform', 'translate(' +\n (width + margin.left) + ',' +\n (height + margin.top) + ')')\n .on('click', function() {\n d3.event.stopPropagation();\n flipping = true;\n\n dropdownA.selected(self.counter);\n dropdownB.selected(self.base);\n dropdowns.selectAll('div').remove();\n\n dropdowns.append('div')\n .attr('class', 'base dropdowns')\n .attr('id', 'base' + self.index)\n .call(dropdownA);\n\n dropdowns.append('div')\n .attr('class', 'counter dropdowns')\n .attr('id', 'quote' + self.index)\n .call(dropdownB);\n\n self.load();\n\n flipping = false;\n\n if (markets.options.fixed) {\n header.html('' +\n getName(self.base.issuer, self.base.currency) +\n '' + baseCurrency + '/' +\n counterCurrency + '' +\n getName(self.counter.issuer, self.counter.currency) +\n '');\n }\n });\n\n flip.append('rect')\n .attr({\n width: margin.right,\n height: margin.bottom\n });\n\n flip.append('text').text('Flip')\n .attr({\n 'text-anchor': 'middle',\n y: margin.bottom * 4 / 5,\n x: margin.right / 2\n });\n\n horizontal = gEnter.append('line')\n .attr('class', 'horizontal')\n .attr({x1: 0, x2: width})\n .attr('transform', 'translate(0,' + height + ')');\n lastPrice = gEnter.append('text')\n .attr('class', 'lastPrice')\n .style('text-anchor', 'middle')\n .attr('x', (width + margin.left) / 2);\n }","function drawChart(percentagesByDay) {\n // Load the Visualization API and the appropriate packages, setting a callback\n // to run when the API is loaded.\n google.load('visualization', '1.0', {'packages':['corechart']});\n google.setOnLoadCallback(function() {\n drawChartCallback(percentagesByDay);\n });\n}","function DrawCPUChart()\n{\n // create/delete rows \n if (cpuTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - cpuTable.getNumberOfRows();\n cpuTable.addRows(numRows);\n } else {\n for(var i=(cpuTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n cpuTable.removeRow(i); \n }\n }\n \n // Populate data table with time/cpu data points. \n for(var i=0; i < cpuTable.getNumberOfRows(); i++)\n {\n //if(parseFloat(aggrDataPoints[i].cpu) < 500) continue;\n cpuTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n cpuTable.setCell(i, 1, parseFloat(aggrDataPoints[i].cpu));\n }\n\n // Draw line chart.\n chartOptions.title = 'CPU Usage (%)';\n cpuChart.draw(cpuView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Tricipital', parseInt(document.getElementById('tricipital').value, 10)],\n ['subescapular', parseInt(document.getElementById('subescapular').value, 10)],\n ['suprailiaca', parseInt(document.getElementById('suprailiaca').value, 10)],\n ['abdominal', parseInt(document.getElementById('abdominal').value, 10)],\n ['quadriceps', parseInt(document.getElementById('quadriceps').value, 10)]\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Percentual de dobras cutâneas em mm³',\n 'margin': 0,\n 'padding': 0,\n 'width': 450,\n 'height': 350\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawchart() {\r\n const filters = getFilters();\r\n const drawData = filterData(\r\n filters[\"startDate\"],\r\n filters[\"endDate\"],\r\n filters[\"provincesFilter\"]\r\n );\r\n timeLapseChart = new TimeLapseChart(\"timelapse-chart\");\r\n timeLapseChart\r\n .setTitle(\"COVID-19 ARGENTINA - EVOLUCIÓN EN EL TIEMPO\")\r\n .setColumnsStyles(columnNames)\r\n .addDatasets(drawData)\r\n .render();\r\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Activity');\n data.addColumn('number', 'Completed');\n data.addRows([\n ['Courses', 3],\n ['Posts', 1],\n ['Job Offers', 1],\n ['Tutorials', 1],\n ['Projects', 2]\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Your activity on Udabuddy',\n 'width': '100%',\n 'height': '100%'\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById(\n 'chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n\t var data = google.visualization.arrayToDataTable([\n\t ['Tool', 'Rating'],\n\t ['Visual Studio', 5],\n\t ['Eclipse', 3],\n\t ['Notepad++', 2],\n\t \n\t \n\t]);\n\n\t // Optional; add a title and set the width and height of the chart\n\t var options = { 'width':'94%', 'height':250,\n\t\tcolors: ['#e81e68', '#999999','#efefef'],\n\t\tis3D: true,\n\t\tbackgroundColor: 'rgb(24,27,46)',\n\t\tlegend: {textStyle: {color: 'white'},position:'bottom'}\n\t\t};\n\n\t // Display the chart inside the element with id=\"piechart\"\n\t var chart = new google.visualization.PieChart(document.getElementById('codetool'));\n\t chart.draw(data, options);\n\t}","function drawChart(idgraph) {\n\n \tvar myData;\n \t\n \t// Create the data table.\n\tvar typeChart = $('#type-select').children(':selected').attr('id');\n\tvar options;\n\tvar chart;\n\tswitch(typeChart) {\n\t\tcase \"scatter\" :\n\t\t\toptions = {\n\t\t\t\ttitle: X + ' vs. ' + Y,\n\t\t\t\twidth: 800,\n\t\t\t\theight: 480,\n\t\t\t\ttitleX: X,\n\t\t\t\ttitleY: Y,\n\t\t\t\tlegend: 'none',\n\t\t\t\tpointSize: 5\n\t\t\t};\n\t\t\tmyData = JSONextractNumber(X,Y,activeData);\n\t\t\tchart = new google.visualization.ScatterChart(document.getElementById(idgraph));\t\t\t\n\t\t\tbreak;\n\t\tcase \"bar\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractString(X,Y,activeData);\n\t\t\tchart = new google.visualization.BarChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"column\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractSort(X,Y,activeData);\n\t\t\tchart = new google.visualization.ColumnChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"line\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractSort(X,Y,activeData);\n\t\t\tchart = new google.visualization.LineChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"pie\" :\n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractCount(X,activeData);\n\t\t\tchart = new google.visualization.PieChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tdefault : \n\t\t\tbreak;\n\t}\n\n var data = google.visualization.arrayToDataTable(myData);\n chart.draw(data, options);\n\n}","function ChartsBarchart() {\n}","function drawChart(){\n\n\tdataTable = new google.visualization.DataTable(data);\n\toptions.hAxis.ticks = dataTable.getDistinctValues(0);\n\n\tview = new google.visualization.DataView(dataTable);\n\t\n\toptions['series'] = Series();\n options['selectionMode'] = 'multiple';\n options['tooltip'] = {\n 'isHtml': true,\n trigger: 'both'\n }\n\n\tchart = new google.visualization.LineChart(document.getElementById(containerId));\n\n\tchart.draw(view, options);\n\n\t//google.visualization.drawChart({\n\t//\t\"containerId\": containerId,\n\t//\t\"chartType\": chartType,\n\t//\t\"options\": options,\n\t//\t\"dataTable\": data,\n\t//\t\"view\": view\n\t//})\n}","function drawChart() {\n\t\n\n\t// Create our data table.\n\tjQuery.getJSON('/data/stats.json', function(stat_data) {\n\t\t\n\t\tjQuery.each(stat_data.entries, function(num, chart_info){\n\t\t\t\n\t\t\tvar data = new google.visualization.DataTable();\n\t\t\t\n\t\t\tif (chart_info.chart_type == \"Pie chart\"){\n\n\t\t\t\tdata.addColumn('string', chart_info.column_label);\n\t\t\t\tdata.addColumn('number', chart_info.numeric_label);\n\t\t\t\n\t\t\t\tdata.addRows(chart_info.stats.length);\n\t\t\t\n\t\t\t\tfor (var i=0; i < chart_info.stats.length; i++){\n\t\t\t\t\tfor(var j=0; j < chart_info.stats[i].length; j++){\n\t\t\t\t\t\tdata.setValue(i, j, chart_info.stats[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\tvar chart = new google.visualization.PieChart(document.getElementById(chart_info.chart_div));\n\t\t\t\tchart.draw(data, {width: 750, height: 500, title: chart_info.chart_title});\n\t\t\t\t\n\t\t\t}\n\t\t\telse{\n\t\t\t\t\n\t\t\t\tdata.addColumn('string', 'Sectors');\n\t\t\t for (var i = 0; i < chart_info.stats.length; ++i) {\n\t\t\t data.addColumn('number', chart_info.stats[i][0]); \n\t\t\t }\n\n\n\t\t\t data.addRows(chart_info.axis_labels.length);\n\n\t\t\t for (var j = 0; j < chart_info.axis_labels.length; ++j) { \n\t\t\t data.setValue(j, 0, chart_info.axis_labels[j]); \n\t\t\t }\n\t\t\t\n\t\t\t for (var i = 0; i < chart_info.stats.length; ++i) {\n\t\t\t for (var j = 1; j < chart_info.stats[i].length; ++j) {\n\t\t\t data.setValue(j-1, i+1, chart_info.stats[i][j]); \n\t\t\t }\n\t\t\t }\n\t\t\t\n\t\t\t\t\n\t\t\t\tif (chart_info.chart_type == \"Vertical bar chart\"){\n\t\t\t\t\tvar chart = new google.visualization.ColumnChart(document.getElementById(chart_info.chart_div));\n\t\t\t\t\tchart.draw(data,{width: \"100%\", height: 700, title: chart_info.chart_title, vAxis: {title: \"NGOs\"}, hAxis: {title: \"Sectors\"}});\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tvar chart = new google.visualization.BarChart(document.getElementById(chart_info.chart_div));\n\t\t\t\t\tchart.draw(data,{width: \"100%\", height: 700, title: chart_info.chart_title, vAxis: {title: \"Sectors\"}, hAxis: {title: \"NGOs\"}});\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\n\t\t});\n\t\t\n\t\t\n\t});\n\t\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Value');\n data.addRows([\n ['', 3],\n ]);\n\n // Set chart options\n var options = {'title':'Parameter #1',\n 'width':'100%',\n 'height': 105,\n 'backgroundColor': { fill:'transparent' }};\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.BarChart(document.getElementById('chart1'));\n chart1.draw(data, options);\n var chart2 = new google.visualization.BarChart(document.getElementById('chart2'));\n chart2.draw(data, options);\n var chart3 = new google.visualization.BarChart(document.getElementById('chart3'));\n chart3.draw(data, options);\n var chart4 = new google.visualization.BarChart(document.getElementById('chart4'));\n chart4.draw(data, options);\n var chart5 = new google.visualization.BarChart(document.getElementById('chart5'));\n chart5.draw(data, options);\n var chart6 = new google.visualization.BarChart(document.getElementById('chart6'));\n chart6.draw(data, options);\n var chart7 = new google.visualization.BarChart(document.getElementById('chart7'));\n chart7.draw(data, options);\n var chart8 = new google.visualization.BarChart(document.getElementById('chart8'));\n chart8.draw(data, options);\n var chart9 = new google.visualization.BarChart(document.getElementById('chart9'));\n chart9.draw(data, options);\n var chart10 = new google.visualization.BarChart(document.getElementById('chart10'));\n chart10.draw(data, options);\n }","function drawChart() {\n\t\t\t\t\tvar data = google.visualization.arrayToDataTable(\n\t\t\t\t\tInventArray, false);\n\t\t\t\t\tconsole.log(data);\n\n\t\t\t\t\t // Optional; add a title and set the width and height of the chart\n\t\t\t\t\tvar options = {'title':'Average Stock', 'width':350, 'height':300, 'chartArea': {'width': '100%', 'height': '80%'}, pieSliceText:'value-and-percentage'};\n\n\t\t\t\t\t// Display the chart inside the element with id=\"piechart\"\n\t\t\t\t\tvar chart = new google.visualization.PieChart(document.getElementById('piechart'));\n\t\t\t\t\tchart.draw(data, options);\n\t\t\t\t}","function drawChart() {\r\n var data = google.visualization.arrayToDataTable([\r\n ['Task', 'Hours per Day'],\r\n ['windows', 8],\r\n ['MacOS', 4],\r\n ['Android', 1],\r\n ['iOS', 2],\r\n ['その他', 2]\r\n]);\r\n\r\n // Optional; add a title and set the width and height of the chart\r\n var options = {'width':400, 'height':260};\r\n\r\n // Display the chart inside the element with id=\"piechart\"\r\n var chart = new google.visualization.PieChart(document.getElementById('checkOs'));\r\n chart.draw(data, options);\r\n}","function drawChart() {\n\t var data = google.visualization.arrayToDataTable([\n\t ['Task', 'Hours per Day'],\n\t ['Work', 8],\n\t ['Eat', 2],\n\t ['TV', 4],\n\t ['Gym', 2],\n\t ['Sleep', 8]\n\t]);\n\n\t // Optional; add a title and set the width and height of the chart\n\t var options = {'title':'My Average Day', 'width':300, 'height':340};\n\n\t // Display the chart inside the element with id=\"piechart\"\n\t var chart = new google.visualization.PieChart(document.getElementById('piechart'));\n\t chart.draw(data, options);\n\t}","function drawChart( pItemSel, pItemHeight, pConfigData, pValuesData, pDefaultConfig, pContainer ) {\n\n apex.debug.info( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"pItemSel\": pItemSel,\n \"pItemHeight\": pItemHeight,\n \"pConfigData\": pConfigData,\n \"pValuesData\": pValuesData,\n \"pDefaultConfig\": pDefaultConfig,\n \"featureDetails\": util.featureDetails\n } );\n\n // eslint-disable-next-line no-undef\n const d3JS = d3;\n\n const aTypeCharts = [\"pie\", \"donut\", \"gauge\"],\n specialStr = \"\\u200b\",\n seriesData = util.groupObjectArray( pValuesData, 'seriesID' );\n\n let isGauge = false,\n isPie = false,\n isDonut = false;\n\n // sort pValuesData by Time\n function sortArrByTime( pArr, pFormat ) {\n\n function customeSort( pFirstValue, pSecondValue ) {\n const parseTime = d3JS.timeParse( pFormat ),\n fD = parseTime( pFirstValue.x ),\n sD = parseTime( pSecondValue.x );\n return new Date( fD ).getTime() - new Date( sD ).getTime();\n }\n\n try {\n return pArr.sort( customeSort );\n }\n catch ( e ) {\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while try sort JSON Array by Time Value\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n }\n\n /* search link from data and set window.location.href */\n function executeLink( pData ) {\n const key = specialStr + unescape( pData.id );\n let index = pData.index;\n\n if ( seriesData[key] ) {\n const seriesObj = seriesData[key];\n if ( seriesObj.length === 1 ) {\n index = 0;\n }\n\n if ( seriesData[key][index] && seriesData[key][index].link ) {\n util.link( seriesData[key][index].link, seriesData[key][index].linkTarget );\n }\n }\n }\n\n try {\n const chartTitle = setObjectParameter( pConfigData.chartTitle, pDefaultConfig.d3JSchart.chartTitle || \"\" ).toString(),\n background = setObjectParameter( pConfigData.background, pDefaultConfig.d3JSchart.background );\n let backJSON = null,\n ownTooltip = false;\n\n if ( util.isDefinedAndNotNull( background ) ) {\n backJSON = {\n color: background\n };\n }\n\n /* line */\n const lineStep = setObjectParameter( pConfigData.lineStep, pDefaultConfig.d3JSchart.line.step );\n\n /* gauge */\n const gaugeMin = setObjectParameter( pConfigData.gaugeMin, pDefaultConfig.d3JSchart.gauge.min ),\n gaugeMax = setObjectParameter( pConfigData.gaugeMax, pDefaultConfig.d3JSchart.gauge.max ),\n gaugeType = setObjectParameter( pConfigData.gaugeType, pDefaultConfig.d3JSchart.gauge.type ),\n gaugeWidth = setObjectParameter( pConfigData.gaugeWidth, pDefaultConfig.d3JSchart.gauge.width ),\n gaugeArcMinWidth = setObjectParameter( pConfigData.gaugeArcMinWidth, pDefaultConfig.d3JSchart.gauge.arcMinWidth ),\n gaugeFullCircle = setObjectParameter( pConfigData.gaugeFullCircle, pDefaultConfig.d3JSchart.gauge.fullCircle, true ),\n gaugeTitle = setObjectParameter( pConfigData.gaugeTitle, pDefaultConfig.d3JSchart.gauge.title || \"\" ).toString();\n\n /* Grid */\n const gridX = setObjectParameter( pConfigData.gridX, pDefaultConfig.d3JSchart.grid.x, true ),\n gridY = setObjectParameter( pConfigData.gridY, pDefaultConfig.d3JSchart.grid.y, true );\n\n /* heights */\n const heightXAxis = setObjectParameter( pConfigData.xAxisHeight, pDefaultConfig.d3JSchart.x.axisHeight );\n\n /* Legend */\n const legendShow = setObjectParameter( pConfigData.legendShow, pDefaultConfig.d3JSchart.legend.show, true ),\n legendPosition = setObjectParameter( pConfigData.legendPosition, pDefaultConfig.d3JSchart.legend.position );\n\n /* padding */\n const chartPadding = util.jsonSaveExtend( null, pDefaultConfig.d3JSchart.padding );\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingBottom ) ) {\n chartPadding.bottom = pConfigData.paddingBottom;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingLeft ) ) {\n chartPadding.left = pConfigData.paddingLeft;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingRight ) ) {\n chartPadding.right = pConfigData.paddingRight;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingTop ) ) {\n chartPadding.top = pConfigData.paddingTop;\n }\n\n /* Axis */\n const rotateAxis = setObjectParameter( pConfigData.rotateAxis, pDefaultConfig.d3JSchart.rotateAxis, true ),\n axisLabelPosition = setObjectParameter( pConfigData.axisLabelPosition, pDefaultConfig.d3JSchart.axisLabelPosition );\n\n let xAxisLabelPosition = null,\n yAxisLabelPosition = null;\n\n switch ( axisLabelPosition ) {\n case \"inner1\":\n xAxisLabelPosition = \"inner-left\";\n yAxisLabelPosition = \"inner-bottom\";\n break;\n case \"inner2\":\n xAxisLabelPosition = \"inner-center\";\n yAxisLabelPosition = \"inner-middle\";\n break;\n case \"inner3\":\n xAxisLabelPosition = \"inner-right\";\n yAxisLabelPosition = \"inner-top\";\n break;\n case \"outer1\":\n xAxisLabelPosition = \"outer-left\";\n yAxisLabelPosition = \"outer-bottom\";\n break;\n case \"outer2\":\n xAxisLabelPosition = \"outer-center\";\n yAxisLabelPosition = \"outer-middle\";\n break;\n case \"outer3\":\n xAxisLabelPosition = \"outer-right\";\n yAxisLabelPosition = \"outer-top\";\n break;\n default:\n break;\n }\n\n if ( rotateAxis ) {\n const xAxisLabelPositionTmp = xAxisLabelPosition;\n xAxisLabelPosition = yAxisLabelPosition;\n yAxisLabelPosition = xAxisLabelPositionTmp;\n }\n\n /* tooltip */\n const tooltipShow = setObjectParameter( pConfigData.tooltipShow, pDefaultConfig.d3JSchart.tooltip.show, true ),\n tooltipGrouped = setObjectParameter( pConfigData.tooltipGrouped, pDefaultConfig.d3JSchart.tooltip.grouped, true );\n\n /* Transition duration */\n const transitionDuration = setObjectParameter( pConfigData.transitionDuration || pDefaultConfig.d3JSchart.transitionDuration );\n\n /* x Axis */\n const xShow = setObjectParameter( pConfigData.xShow, pDefaultConfig.d3JSchart.x.show, true ),\n xLabel = setObjectParameter( pConfigData.xLabel, pDefaultConfig.d3JSchart.x.label || \"\" ).toString();\n let xType = setObjectParameter( pConfigData.xType, pDefaultConfig.d3JSchart.x.type ),\n xAxisTimeFormat = null,\n xName = null;\n\n /* x ticks */\n const xTickCutAfter = setObjectParameter( pConfigData.xTickCutAfter, pDefaultConfig.d3JSchart.x.tick.cutAfter ),\n xTickMaxNumber = setObjectParameter( pConfigData.xTickMaxNumber, pDefaultConfig.d3JSchart.x.tick.maxNumber ),\n xTickRotation = setObjectParameter( pConfigData.xTickRotation, pDefaultConfig.d3JSchart.x.tick.rotation ),\n xTickMultiline = setObjectParameter( pConfigData.xTickMultiline, pDefaultConfig.d3JSchart.x.tick.multiline, true ),\n xTickFit = setObjectParameter( pConfigData.xTickFit, pDefaultConfig.d3JSchart.x.tick.fit, true ),\n xTickAutoRotate = setObjectParameter( pConfigData.xTickAutoRotate, pDefaultConfig.d3JSchart.x.tick.autoRotate, true );\n let xTickTimeFormat = null;\n\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n xName = \"x\";\n }\n\n if ( xType === \"timeseries\" ) {\n xAxisTimeFormat = setObjectParameter( pConfigData.xTimeFormat, pDefaultConfig.d3JSchart.x.timeFormat );\n xTickTimeFormat = setObjectParameter( pConfigData.xTickTimeFormat, pDefaultConfig.d3JSchart.x.tick.timeFormat );\n // sort data because of tooltip index\n sortArrByTime( pValuesData, xAxisTimeFormat );\n }\n\n /* cut string if category names are to long */\n if ( xType === \"category\" ) {\n xTickTimeFormat = function ( index, categoryName ) {\n return util.cutString( categoryName, xTickCutAfter );\n };\n }\n\n /* y Axis */\n const yLabel = setObjectParameter( pConfigData.yLabel, pDefaultConfig.d3JSchart.y.label || \"\" ).toString(),\n yLog = setObjectParameter( pConfigData.yLog, pDefaultConfig.d3JSchart.y.log, true );\n let yType = null;\n if ( yLog ) {\n yType = \"log\";\n }\n const yMin = pConfigData.yMin || pDefaultConfig.d3JSchart.y.min,\n yMax = pConfigData.yMax || pDefaultConfig.d3JSchart.y.max,\n yCulling = pConfigData.yTickMaxNumber || pDefaultConfig.d3JSchart.y.tick.maxNumber,\n yUnit = pConfigData.yUnit || pDefaultConfig.d3JSchart.y.unit;\n\n /* y2 Axis */\n const y2Label = setObjectParameter( pConfigData.y2Label, pDefaultConfig.d3JSchart.y2.label || \"\" ).toString(),\n y2Log = setObjectParameter( pConfigData.y2Log, pDefaultConfig.d3JSchart.y2.log, true );\n let y2Type = null,\n y2Show = false;\n if ( y2Log ) {\n y2Type = \"log\";\n }\n const y2Min = setObjectParameter( pConfigData.y2Min, pDefaultConfig.d3JSchart.y2.min ),\n y2Max = setObjectParameter( pConfigData.y2Max, pDefaultConfig.d3JSchart.y2.max ),\n y2Culling = setObjectParameter( pConfigData.y2TickMaxNumber, pDefaultConfig.d3JSchart.y2.tick.maxNumber ),\n y2Unit = setObjectParameter( pConfigData.y2Unit, pDefaultConfig.d3JSchart.y2.unit );\n\n /* Zoom and Subchart */\n const zoomType = setObjectParameter( pConfigData.zoomType, pDefaultConfig.d3JSchart.zoom.type );\n let showSubChart = false,\n zoomEnabled = setObjectParameter( pConfigData.zoomEnabled, pDefaultConfig.d3JSchart.zoom.enabled, true );\n\n const charThreshold = setObjectParameter( pConfigData.threshold, pDefaultConfig.d3JSchart.threshold );\n\n if ( zoomEnabled ) {\n if ( zoomType === \"scroll\" ) {\n showSubChart = false;\n } else if ( zoomType === \"subchart\" ) {\n showSubChart = true;\n zoomEnabled = false;\n } else if ( zoomType === \"drag\" ) {\n zoomEnabled = true;\n showSubChart = false;\n }\n } else {\n showSubChart = false;\n }\n\n const zoomRescale = setObjectParameter( pConfigData.zoomRescale, pDefaultConfig.d3JSchart.zoom.rescale, true );\n\n /* Prepare Data for Render */\n const dataArr = [],\n categoriesArr = [],\n groupsArr = [],\n colorsJSON = {},\n typesJSON = {},\n axesJSON = {},\n namesJSON = {},\n groupJSON = {},\n xCatObj = util.groupObjectArray( pValuesData, \"x\" );\n\n let seriesCnt = 0;\n\n if ( seriesData ) {\n /* Add Categories or time values to x Axis when correct type is set */\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n categoriesArr.push( \"x\" );\n const xCatArr = Object.keys( xCatObj );\n\n $.each( xCatArr, function ( dIdx, dataValues ) {\n categoriesArr.push( ( setObjectParameter( dataValues.replace( specialStr, \"\" ), null ) ) );\n } );\n }\n\n dataArr.push( categoriesArr );\n\n /* Transform data for billboard.js */\n $.each( seriesData, function ( idx, seriesData ) {\n let series;\n seriesCnt += 1;\n if ( seriesData[0] && seriesData[0].seriesID ) {\n series = seriesData[0];\n const dataKey = escape( series.seriesID );\n colorsJSON[dataKey] = series.color;\n typesJSON[dataKey] = series.type;\n\n /* check if atypechart*/\n if ( aTypeCharts.indexOf( series.type ) >= 0 ) {\n zoomEnabled = false;\n }\n\n if ( series.type === \"gauge\" ) {\n isGauge = true;\n }\n\n if ( series.type === \"pie\" ) {\n isPie = true;\n }\n\n if ( series.type === \"donut\" ) {\n isDonut = true;\n }\n\n if ( util.isDefinedAndNotNull( series.tooltip ) ) {\n ownTooltip = true;\n }\n\n axesJSON[dataKey] = ( series.yAxis || \"y\" );\n if ( util.isDefinedAndNotNull( series.groupID ) ) {\n const groupID = escape( series.groupID.toString() );\n if ( groupJSON[groupID] ) {\n groupJSON[groupID].push( dataKey );\n } else {\n groupJSON[groupID] = [];\n groupJSON[groupID].push( dataKey );\n }\n }\n\n if ( series.yAxis === \"y2\" ) {\n y2Show = true;\n }\n namesJSON[dataKey] = ( setObjectParameter( series.label, dataKey ) );\n\n const arr = [];\n arr.push( dataKey );\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n $.each( xCatObj, function ( dIdx, dataValues ) {\n let setValueY = null,\n setValueZ = null;\n $.each( dataValues, function ( sIDx, sDataValues ) {\n if ( escape( sDataValues.seriesID ) === dataKey ) {\n setValueY = sDataValues.y;\n if ( sDataValues.z ) {\n setValueZ = sDataValues.z;\n }\n }\n } );\n if ( setValueZ !== null ) {\n arr.push( {\n \"y\": setValueY,\n \"z\": setValueZ\n } );\n } else {\n arr.push( setValueY );\n }\n } );\n } else {\n $.each( seriesData, function ( dIdx, dataValues ) {\n const setValueY = setObjectParameter( dataValues.y, null );\n if ( dataValues.z ) {\n const setValueZ = dataValues.z;\n arr.push( {\n \"y\": setValueY,\n \"z\": setValueZ\n } );\n } else {\n arr.push( setValueY );\n }\n } );\n }\n\n dataArr.push( arr );\n\n } else {\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"No seriesID found in seriesID Cursor\",\n \"featureDetails\": util.featureDetails\n } );\n }\n\n } );\n\n /* Group JSON to Array */\n $.each( groupJSON, function ( dIdx, jsonObj ) {\n groupsArr.push( jsonObj );\n } );\n\n /* Labels and Datapoints */\n let dataLabels = setObjectParameter( pConfigData.showDataLabels, pDefaultConfig.d3JSchart.showDataLabels, true );\n\n if ( isPie || isDonut ) {\n dataLabels = {\n colors: \"white\"\n };\n } else if ( isGauge ) {\n dataLabels = {\n colors: ( gaugeType === \"single\" && seriesCnt > 1 ) ? \"white\" : \"inherit\"\n };\n }\n const showDataPoints = setObjectParameter( pConfigData.showDataPoints, pDefaultConfig.d3JSchart.showDataPoints, true ),\n showAbsoluteValues = setObjectParameter( pConfigData.showAbsoluteValues, pDefaultConfig.d3JSchart.showAbsoluteValues );\n let absoluteFormatting;\n\n if ( showAbsoluteValues ) {\n absoluteFormatting = function ( value ) {\n return value + yUnit;\n };\n }\n\n let ttContent;\n if ( ownTooltip ) {\n ttContent = function ( d ) {\n const div = $( \"\" );\n div.addClass( \"bb-tooltip\" );\n div.addClass( \"bida-chart-tooltip-custome\" );\n $.each( d, function ( i, pData ) {\n const key = specialStr + unescape( pData.id ),\n seriesObj = seriesData[key],\n index = pData.index;\n \n if ( seriesObj && seriesObj[index] && util.isDefinedAndNotNull( seriesObj[index].tooltip ) && util.isDefinedAndNotNull( pData.value ) ) {\n const subDiv = $( \"\" );\n\n let ttS = seriesObj[index].tooltip;\n if ( pRequireHTMLEscape !== false ) {\n ttS = util.escapeHTML( ttS );\n }\n subDiv.append( ttS );\n div.append( subDiv );\n }\n } );\n return div[0].outerHTML;\n };\n }\n\n try {\n const chartContIDSel = pItemSel + \"bbc\",\n chartContID = chartContIDSel.replace( \"#\", \"\" ),\n chartCont = $( \"\" );\n chartCont.attr( \"id\", chartContID );\n\n $( pItemSel ).append( chartCont );\n\n const bbData = {\n bindto: chartContIDSel,\n background: backJSON,\n title: {\n text: chartTitle\n },\n size: {\n height: pItemHeight\n },\n data: {\n x: xName,\n xFormat: xAxisTimeFormat,\n columns: dataArr,\n types: typesJSON,\n groups: groupsArr,\n colors: colorsJSON,\n labels: dataLabels,\n axes: axesJSON,\n names: namesJSON,\n onclick: function ( pData ) {\n executeLink( pData );\n }\n },\n pie: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n }\n },\n donut: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n }\n },\n line: {\n step: {\n type: lineStep\n }\n },\n gauge: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n },\n fullCircle: gaugeFullCircle,\n min: gaugeMin,\n max: gaugeMax,\n type: gaugeType,\n width: gaugeWidth,\n title: gaugeTitle,\n arc: {\n minWidth: gaugeArcMinWidth\n }\n },\n radar: {\n direction: {\n clockwise: true\n }\n },\n subchart: {\n show: showSubChart\n },\n zoom: {\n type: zoomType,\n enabled: zoomEnabled,\n rescale: zoomRescale\n },\n transition: {\n duration: transitionDuration\n },\n legend: {\n show: legendShow,\n position: legendPosition\n },\n tooltip: {\n show: tooltipShow,\n grouped: tooltipGrouped,\n contents: ttContent\n },\n grid: {\n x: {\n show: gridX,\n },\n y: {\n show: gridY\n }\n },\n point: {\n show: showDataPoints\n },\n axis: {\n rotated: rotateAxis,\n x: {\n show: xShow,\n label: {\n text: xLabel,\n position: xAxisLabelPosition\n },\n type: xType,\n tick: {\n culling: {\n max: xTickMaxNumber\n },\n autorotate: xTickAutoRotate,\n rotate: xTickRotation,\n multiline: xTickMultiline,\n format: xTickTimeFormat,\n fit: xTickFit\n },\n height: heightXAxis\n },\n y: {\n label: {\n text: yLabel,\n position: yAxisLabelPosition\n },\n type: yType,\n max: yMax,\n min: yMin,\n tick: {\n culling: {\n max: yCulling\n },\n format: function ( d ) {\n return d + yUnit;\n }\n }\n },\n y2: {\n show: y2Show,\n label: {\n text: y2Label,\n position: yAxisLabelPosition\n },\n type: y2Type,\n max: y2Max,\n min: y2Min,\n tick: {\n culling: {\n max: y2Culling\n },\n format: function ( d ) {\n return d + y2Unit;\n }\n }\n }\n },\n padding: chartPadding\n };\n\n apex.debug.info( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"finalChartData\": bbData,\n \"featureDetails\": util.featureDetails\n } );\n\n // eslint-disable-next-line no-undef\n const chart = bb.generate( bbData );\n\n /* reset zoom on right click */\n if ( zoomEnabled ) {\n $( chartContIDSel ).contextmenu( function ( evt ) {\n evt.preventDefault();\n chart.unzoom();\n } );\n }\n\n /* execute resize */\n pContainer.on( \"resize\", function() {\n chart.resize( {\n height: pItemHeight\n } );\n } );\n\n } catch ( e ) {\n $( pItemSel ).empty();\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while try to render chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n } else {\n util.noDataMessage.show( pItemSel, pDefaultConfig.noDataMessage );\n }\n } catch ( e ) {\n $( pItemSel ).empty();\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while prepare data for chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n }","function winInit() {\n myDIV = document.getElementById(\"myDIV\");\n myCanvas = document.getElementById('myCanvas');\n ctx = myCanvas.getContext(\"2d\");\n\n exampleCanvas = document.getElementById('exampleCanvas');\n ctx2 = exampleCanvas.getContext(\"2d\");\n\n drawColumnChart({\n ctx: ctx,\n canvas: myCanvas,\n xData: [1,2,3,4,5,6],\n yData: [10,30,20,10,20,60],\n cvx: myCanvas.width/6, // canvas.width / antall kolonner (6)\n cvy: 500,\n number: 6,\n widthPx: 50,\n yScale: 7,\n barColor: \"Green\",\n textColor: \"Pink\"\n });\n\n drawHtmlTable(myDIV, [\"nice\", \"verynice\", \"reallynice\"], [\"1\", \"13231231212\", \"38218942\", \"1\", \"2\", \"3\"]);\n\n drawPieChart(ctx2, exampleCanvas, [1,2,3], [\"Red\", \"blue\", \"yellow\"]);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'FIO');\n data.addColumn('number', 'Count');\n i = 0; \n\n names = document.querySelectorAll('.DName');\n values = document.querySelectorAll('.DCount');\n\n while (i + 1 <= names.length) {\n data.addRows([\n [names[i].innerText, +values[i].innerText]\n ]);\n i++;\n }\n\n // Set chart options\n var options = {\n 'title': 'Кругова діаграма',\n 'width': 500,\n 'height': 500\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","draw() {\n this.plot = this.svg.append('g')\n .classed(\"plot\", true)\n .attr('transform', `translate(${this.margin.left},${this.margin.top})`);\n\n // Add the background\n this.plot.append(\"rect\")\n .attrs({\n fill: \"white\",\n x: 0,\n y: 0,\n height: this.innerHeight,\n width: this.innerWidth\n });\n\n if ( this.opts.nav !== false ) {\n this.drawNav();\n }\n\n // Add the title\n this.svg.append('text')\n .attr('transform', `translate(${this.width / 2},${this.margin.top / 2})`)\n .attr(\"class\", \"chart-title\")\n .attr('x', 0)\n .attr('y', 0)\n .text(this.title);\n }","function drawChart(){\n canvas = d3.select(\"#chart\").append(\"svg\")\n .attr(\"class\",\"variationChart\")\n .attr(\"width\", width)\n .attr(\"height\", height + margin.top + margin.bottom)\n .append(\"g\")\n}","function drawChart(reactionData) {\n var reactionDataTable = new google.visualization.DataTable();\n reactionDataTable.addColumn('number', 'Time');\n reactionDataTable.addColumn('number', 'Reaction');\n reactionDataTable.addRows(reactionData);\n\n var options = {\n title: 'Reactions over Time',\n curveType: 'function',\n width: 900,\n height: 500,\n legend: 'none',\n hAxis: {title: 'Time'},\n vAxis: {title: 'Reaction'}\n };\n // set the chart handle\n var chart = new google.visualization.LineChart(document.getElementById('chart_div'));\n\n //var chart = new google.visualization.ScatterChart(document.getElementById('chart_div'));\n chart.draw(reactionDataTable, options);\n }","function drawChart() {\n\t//creates x and y axis and names them\n\tvar data = new google.visualization.DataTable();\n\tdata.addColumn('number', 'Num of itarations');\n\tdata.addColumn('number', 'Cost');\n\n\tdata.addRows(loss);//add the loss array which holds how the network is preforming\n\t \n\t//gives the chart a name and changes its size\n\tvar options = {\n\t\tchart: {\n\t\t\ttitle: 'The Cost of the network',\n\t\t},\n\t\twidth: window.innerWidth*0.4,\n\t\theight: window.innerHeight*0.2\n\t};\n\t\n\t//crates the chart\n\tvar chart = new google.charts.Line(document.getElementById('line_top_x'));\n\t\n\t//remove goggles error when the loss array is empty\n\tgoogle.visualization.events.addListener(chart, 'error', function (googleError) {\n\t\tgoogle.visualization.errors.removeError(googleError.id);\n\t});\n\t//shows the chart\n\tchart.draw(data, google.charts.Line.convertOptions(options));\n }","function draw(count1, count2, id){\n \n google.charts.setOnLoadCallback(drawChart(count1, count2, id));\n }","function draw_chart(c){\n c.beginPath();\n c.strokeStyle = \"red\";\n c.moveTo(count_block(5),count_block(40));\n\n var xplot = 10;\n for(let j=0; j < data.length; j++){\n var data_in_blocks = data[j]/100; \n \n \n c.strokeText(data[j].toString(), count_block(xplot), count_block(40-data_in_blocks)-10);\n c.lineTo(count_block(xplot), count_block(40-data_in_blocks));\n c.arc(count_block(xplot), count_block(40-data_in_blocks), 3,0, Math.PI*2, true);\n xplot+=5;\n \n }\n c.stroke();\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Budget');\n data.addColumn('number', 'Amount');\n data.addRows([\n ['Income', total_income],\n ['Expense', total_expense]\n ]);\n\n // Set chart options\n var options = {'title':'Income/Expense Pie Chart',\n 'width':400,\n 'height':300};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart() {\n\n// n.b. need all these retrieved;\n var chart5_ovs = parseFloat(document.getElementById('chart5_ovs').value);\n var chart5_hormo = parseFloat(document.getElementById('chart5_hormo').value);\n var chart5_chemo_add = parseFloat(document.getElementById('chart5_chemo_add').value);\n var chart5_tram_add = parseFloat(document.getElementById('chart5_tram_add').value);\n var chart10_ovs = parseFloat(document.getElementById('chart10_ovs').value);\n var chart10_hormo = parseFloat(document.getElementById('chart10_hormo').value);\n var chart10_chemo_add = parseFloat(document.getElementById('chart10_chemo_add').value);\n var chart10_tram_add = parseFloat(document.getElementById('chart10_tram_add').value);\n var types=['Year','Survival with no Adjuvant treatment',\n 'Benefit of Adjuvant Hormone therapy'];\n if ( chart5_chemo_add > 0.0001 ) {\n types[types.length]='Additional benefit of Adjuvant Chemotherapy';\n }\n if ( chart5_tram_add > 0.0001 ) {\n types[types.length]='Additional benefit of Trastuzumab';\n }\n types[types.length]= { role: 'annotation' };\n var yr5 = ['Five years', chart5_ovs, chart5_hormo];\n var yr10 = ['Ten years', chart10_ovs, chart10_hormo];\n if ( chart5_chemo_add > 0.0001 ) {\n yr5[yr5.length]= chart5_chemo_add;\n yr10[yr10.length]= chart10_chemo_add;\n }\n if ( chart5_tram_add > 0.0001 ) {\n yr5[yr5.length]= chart5_tram_add;\n yr10[yr10.length]= chart10_tram_add;\n }\n yr5[yr5.length]= '';\n yr10[yr10.length]= '';\n var data = google.visualization.arrayToDataTable([types,yr5,yr10]);\n\n// alternate construction - cant get this to work\n// var data = google.visualization.DataTable();\n// data.addColumn({ type: 'number', label: 'Five years', id: 'year5', role: 'annotation' });\n// data.addColumn({ type: 'number', label: 'Ten years', id: 'year10', role: 'annotation' });\n// data.addRow([10, 24]);\n// data.addRow([16, 22]);\n\n var view = new google.visualization.DataView(data);\n// n.b. view.setColumns() Specifies which columns are visible in this view. Any columns not specified will be hidden\n var setcols=[0,1,{ calc: \"stringify\",sourceColumn: 1,type: \"string\",role: \"annotation\" }];\n// only set the hormo benefit value (column 2) to be displayed if it's > 0.0\n// n.b. hormo value is always in the data array so always index 2\n if ( chart5_hormo > 0.0001 ) {\n setcols[setcols.length]= 2;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 2,type: \"string\",role: \"annotation\" };\n } else {\n// setcols[setcols.length]= 2; # not needed as not displaying ??\n }\n// n.b. if present chemo is always index 3 and traz always index 4 (no traz without chemo)\n if ( chart5_chemo_add > 0.0001 ) {\n setcols[setcols.length]= 3;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 3,type: \"string\",role: \"annotation\" };\n } else {\n// setcols[setcols.length]= 3;\n }\n if ( chart5_tram_add > 0.0001 ) {\n setcols[setcols.length]= 4;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 4,type: \"string\",role: \"annotation\" };\n// setcols[setcols.length]= 5;\n }\n setcols[setcols.length]= types.length - 1;\n view.setColumns(setcols);\n// view.setColumns([0, // this example for labelling of 2 data regimes in bar chart\n// 1,{ calc: \"stringify\",sourceColumn: 1,type: \"string\",role: \"annotation\" },\n// 2,{ calc: \"stringify\",sourceColumn: 2,type: \"string\",role: \"annotation\" },3]);\n\n// n.b. height & width are set as same as in img block\n// legend:{ alignment: 'bottom', textStyle: { fontSize: getFontSize(), overflow: 'auto'} }\n// legend: {position: 'bottom', alignment: 'center', maxLines: 4, textStyle: { overflow: 'none'}},\n// legend is uncontrolable - especially for long labels like we have! so don't use and replace with static png\n// n.b. give chart max y-axis of 105 so top category value label has enough room to display\n// tooltips: {isHtml: true, showColorCode: true},\n// colors: ['#666699','#00ff00','#ff9900','#00aa99'],\n// n.b. since new release of google charts on 23/2/15 for ER -ve (0 hormo) we now need to remove the green\n// from the colours vector as it's being used for the chemo i.e. zero hormo is not being interpretted\n// properly seemingly a bug - corrected 17/3/15 by emd\n var cols = ['#666699'];\n if ( chart5_hormo > 0.001 ) {\n cols[cols.length]= '#00ff00';\n }\n cols[cols.length]= '#ff9900';\n cols[cols.length]= '#00aa99';\n var options = {\n title: 'Overall Survival at 5 and 10 years (percent)',\n colors: cols,\n vAxis: {maxValue: 105, ticks: [0,10,20,30,40,50,60,70,80,90,100]},\n chartArea: {left:40, top:30, width:'70%', height:'65%'},\n legend: {position: 'none'},\n bar: {groupWidth: \"50%\"},\n isStacked: true,\n width: 360,\n height: 460\n };\n\n var chart_div = document.getElementById('chart1');\n var chart = new google.visualization.ColumnChart(chart_div);\n\n// n.b. currently turned off as causes tooltips NOT to be displayed on mouseover -must have tooltips!\n // Wait for the chart to finish drawing before calling the getImageURI() method.\n// google.visualization.events.addListener(chart, 'ready', function () {\n// chart_div.innerHTML = '';\n// console.log(chart_div.innerHTML);\n// });\n\n// chart.draw(data, options); // use this form if not using the view object for labelling\n chart.draw(view, options);\n\n }","function chartEmergingNow_Draw(ele, dataset) {\n // Variables\n ele = \"#\" + ele;\n $(ele +\" svg\").remove();\n\n // Data\n var data = null;\n if(dataset === \"InterestsPassions\"){\n data = appData[activeAudience].psychographics.categoriesData[activeInterestsPassionsCategory].analyses[0].emergingNow;\n }\n if(dataset === \"InsightsTrends\"){\n data = appData[activeAudience].insightstrends.categoriesData[activeInsightsTrendsCategory].emergingNow;\n }\n\n // Dimensions\n w = $(ele).width();\n var h = 110;\n\n var radius = 10;\n var max_n = 0;\n for (var d in data) {\n max_n = Math.max(data[d].value, max_n);\n }\n var dx = w / max_n;\n var dy = 30;\n\n // Draw\n var svg = d3.select(ele)\n .append(\"svg\")\n .attr(\"width\", w)\n .attr(\"height\", h);\n \n // Bars\n var bars = svg.selectAll(\".bar\")\n .data(data)\n .enter()\n .append(\"rect\")\n .attr(\"class\", function(d, i) { return \"bar\"; })\n .attr(\"x\", function(d, i) { return 0; })\n .attr(\"y\", function(d, i) { return (dy + 10) * i; })\n .attr(\"width\", function(d, i) { return (d.value / max_n) * 100 + '%'; })\n .attr(\"height\", dy)\n .attr(\"rx\", radius)\n .attr(\"ry\", radius)\n .attr( \"fill\", function( d, i ) { return chartEmergingNow_ColorSeries( i ); });\n\n // Labels\n var text = svg.selectAll(\"text\")\n .data(data)\n .enter()\n .append(\"text\")\n .attr(\"class\", function(d, i) { return \"label\";} )\n .attr(\"x\", 10)\n .attr(\"y\", function(d, i) { return ((dy + 10) * i) + 20;} )\n .attr(\"font-size\", \"12px\")\n .attr(\"font-weight\", \"bold\")\n .attr(\"fill\", \"#ffffff\")\n .text( function(d) { return d.insight; } );\n\n}","function drawEmployeeChart() {\r\n\r\n\t\t// ----- first chart ---------\r\n\t\t// Create the data table.\r\n\t\tvar dataTable = google.visualization.arrayToDataTable([\r\n\t\t\t['Type', 'Count'],\r\n\t\t\t['Masked', data['total_employee'] - data['total_result_employee']],\r\n\t\t\t['Unmasked', data['total_result_employee']]\r\n\t\t]);\r\n\r\n\t\t// Set chart options\r\n\t\tvar options = {\r\n\t\t\t'width': 500,\r\n\t\t\t'height': 400,\r\n\t\t\tbackgroundColor: 'transparent',colors: ['#809cb5', '#34485c'],\r\n\t\t\tlegend:{textStyle:{fontSize:'14', fontName: 'Montserrat'}}\r\n\t\t};\r\n\t\tvar title = { 'title': 'Employee Ratio' , \r\n\t\t\t\t\t titleTextStyle: {fontSize:'16', fontName: 'Montserrat'}\r\n\r\n\t\t\t\t};\r\n\r\n\t\t// Instantiate and draw our chart, passing in some options.\r\n\t\tvar chart = new google.visualization.PieChart(document.getElementById('chart1_div'));\r\n\t\tchart.draw(dataTable, { ...title, ...options });\r\n\r\n\r\n\t\t// ----- second chart ---------\r\n\t\tdataTable = google.visualization.arrayToDataTable([\r\n\t\t\t['Type', 'Count'],\r\n\t\t\t['Visitor', data['total_result'] - data['total_result_employee_occurance']],\r\n\t\t\t['Employee', data['total_result_employee_occurance']]\r\n\t\t]);\r\n\t\ttitle = { 'title': 'Unmasked Occurance Ratio' ,\r\n\t\t\t\ttitleTextStyle: {fontSize:'16', fontName: 'Montserrat'}};\r\n\t\tchart = new google.visualization.PieChart(document.getElementById('chart2_div'));\r\n\t\tchart.draw(dataTable, { ...title, ...options });\r\n\t}","function drawChart3() {\n var data3\n // Create the data table.\n data3 = new google.visualization.DataTable();\n data3.addColumn('string', 'nombre');\n data3.addColumn('number', 'cantidad');\n data3.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por actividad escuela: '+escuela,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data3, options1);\n\n }","function DrawImpressionsChart()\n{\n // create/delete rows \n if (impressionsTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - impressionsTable.getNumberOfRows();\n impressionsTable.addRows(numRows);\n } else {\n for(var i=(impressionsTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n impressionsTable.removeRow(i); \n }\n }\n\n // Populate data table with time/impressions data points. \n for(var i=0; i < impressionsTable.getNumberOfRows(); i++)\n {\n impressionsTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n impressionsTable.setCell(i, 1, parseInt(aggrDataPoints[i].impressions));\n }\n\n // Draw line chart.\n chartOptions.title = 'Impressions Chart';\n impressionsChart.draw(impressionsView, chartOptions); \n}","function drawChart() {\n const data = new google.visualization.DataTable();\n data.addColumn('string', 'Animal');\n data.addColumn('number', 'Count');\n data.addRows([\n ['2001', 23],\n ['2002', 22],\n ['2003', 23],\n ['2004', 23],\n ['2005', 28],\n ['2006', 28],\n ['2007', 25],\n ['2008', 28],\n ['2009', 27],\n ['2010', 6],\n ['2015', 18],\n ['2016', 18]\n ]);\n\n const options = {\n 'title': 'Distribution of BIONICLE sets per year (2001-2010; 2015-2016)',\n 'width':600,\n 'height':600\n };\n\n const chart = new google.visualization.PieChart(\n document.getElementById('chart-container'));\n chart.draw(data, options);\n}","function renderPieChart() {\n var i, x, y, r, a1, a2, set, sum;\n\n x = width / 2;\n y = height / 2;\n r = Math.min(x, y) - 2;\n a1 = 1.5 * Math.PI;\n a2 = 0;\n set = sets[0];\n sum = sumSet(set);\n\n for (i = 0; i < set.length; i++) {\n ctx.fillStyle = colorOf(i);\n ctx.beginPath();\n a2 = a1 + (set[i] / sum) * (2 * Math.PI);\n\n // TODO opts.wedge\n ctx.arc(x, y, r, a1, a2, false);\n ctx.lineTo(x, y);\n ctx.fill();\n a1 = a2;\n }\n }","function draw(datatable) {\n // Define look and feel parameters using options object to override defaults.\n var width = options.width || 300;\n var backgroundColor = options.backgroundColor;\n var globalStyle = options.globalStyle || {fontFamily:'sans-serif'};\n var titleStyle = options.titleStyle || {fontWeight:'bold'};\n var captionStyle = options.captionStyle || {fontSize:'0.70em'};\n var powerRange = options.powerRange || 6000;\n var title = options.title || source;\n\n // Create a datatable with this source's data and baseline.\n datatable = addBaseline(datatable);\n\n // Get the top-level div where this visualization should go.\n element = document.getElementById(viz_id);\n\n // Now add the elements.\n addGlobalStyle(element, backgroundColor, width, globalStyle);\n addTitleDiv(element, viz_id, title, titleStyle);\n addMeterDiv(element, viz_id, datatable, backgroundColor, width, powerRange);\n addCaptionDiv(element, viz_id, captionStyle, datatable);\n }","function drawChart() {\n\n\t// empty the container to generate chart with updated width\n\tdocument.getElementById(\"value-chart\").innerHTML = \"\";\n\n\t// get the new width of the container that will hold the chart\n\tlet chartContainerWidth = document.getElementById('chart-container').clientWidth;\n\tlet chartWidth = chartContainerWidth - 20;\n\n\t// obtain the height of the table\n\tlet tableHeight = document.getElementById('table-data').clientHeight;\n\t// assign the height of the chart to be equal to the height of the table \n\t// remove 30px to account for the chart title\n\tlet chartHeight = tableHeight - 30; // height of svg container for chart \n\t\n\t// define chart data\n\tlet dataChart = d3.zip(arrayIds, arrayNames, arrayValue2);\n\n\t// define y scale\n\tlet yScale = d3.scaleBand()\n\t\t\t\t\t.domain(d3.range(arrayIds.length))\n\t\t\t\t\t.rangeRound([0, chartHeight])\n\t\t\t\t\t.round(true)\n\t\t\t\t\t.paddingInner(0.05);\n\n\t// define x scale\n\tlet xScale = d3.scaleLinear()\n\t\t\t\t\t.domain([0, d3.max(arrayValue2)]) // +10 to show labels above\n\t\t\t\t\t.range([40, chartWidth]);\t\t\n\n\t// create SVG element\n\tlet svgSales = d3.select(\"#value-chart\") // select by id\n\t\t\t\t.append(\"svg\") // insert the
Wrong: \\\" + incorrect + \\\"
Trivia written by Glen Weldon for NPR podcast 'Pop Culture Happy Hour.' Weldon is the author of 'The Caped Crusade: Batman and the Rise of Nerd Culture.'
\\\");\\n\\t\\t$(\\\".choice\\\").hide();\\n\\t\\t$(\\\"#startBtn\\\").show();\\n\\t}\\n\\t}\",\n \"function endTracking() {\\n tryingToTrack = false;\\n timeCounter = 0;\\n\\n $(\\\"#stopTrackingMe\\\").css({\\n \\\"display\\\": \\\"none\\\"\\n });\\n $(\\\"#extendTrackingMe\\\").css({\\n \\\"display\\\": \\\"none\\\"\\n });\\n $(\\\"#extendTrackingMe\\\").on('click', () => {\\n alert(\\\"Timer set to 30 mins\\\")\\n });\\n $(\\\"#startTrackingMe\\\").css({\\n \\\"display\\\": \\\"inline-block\\\"\\n });\\n }\",\n \"function nextQuestion() {\\n if (questionCounter < questions.length) {\\n time = 15;\\n $(\\\"#gameScreen\\\").html(\\\"You have \\\" + time + \\\" seconds left!
\\\");\\n questionContent();\\n timer();\\n userTimeout();\\n }\\n else {\\n resultsScreen();\\n }\\n\\n }\",\n \"function nextQuestion() {\\n\\t\\tif (questionCounter < questions.length) {\\n\\t\\t\\ttime = 15;\\n\\t\\t\\t$(\\\".gameScreen\\\").html(\\\"You have \\\" + time + \\\" seconds left!
\\\");\\n\\t\\t\\tquestionContent();\\n\\t\\t\\ttimer();\\n\\t\\t\\ttimesUp();\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tresultsScreen();\\n\\t\\t}\\n\\t}\",\n \"function goToLastQuestion(){ \\r\\n\\tcount--\\r\\n\\tupdateItems();\\r\\n}\",\n \"function nextQuestion(event) {\\n\\n\\n // condition uses click event to add to user score if correct ansser is made //\\n if (event.target.value === questions[currentQuesIndex].correctAns) {\\n score++;\\n } else {\\n time -= 5;\\n counter.textContent = time + \\\" Seconds left on quiz.\\\";\\n }\\n\\n\\n\\n // Condition executes next question\\n if (currentQuesIndex < questions.length) {\\n currentQuesIndex++;\\n // moves to next section once condition is met\\n } if (currentQuesIndex === questions.length) {\\n\\n quizEl.style.display = \\\"none\\\";\\n // this function call takes user to results section\\n quizResults();\\n return;\\n\\n }\\n showQuestion();\\n}\",\n \"function nextQuestion() {\\n if (questionCounter < questions.length)\\n { time = 10;\\n $(\\\"#gameScreen\\\").html(\\\"You have \\\" + time + \\n \\\" seconds left!
\\\");\\n questionContent();\\n timer();\\n userTimeout();\\n \\n }\\n \\n else {\\n resultsScreen();\\n }\\n\\t}\",\n \"function incorrect() {\\n timeLeft -=20;\\n nextQuestion();\\n}\",\n \"function tally() {\\r\\n alert('You are have reached the end of the game! Your answers gave you a cool rating of: ' + correct);\\r\\n alert('Explore the rest of the page to check out more about me that wasn\\\\'t included in the game!');\\r\\n\\r\\n }\",\n \"function checkGameEnd() {\\n if(count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function() {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function checkGameEnd() {\\n if(count === question.length) {\\n $(\\\"#time-holder\\\").hide();\\n showResults();\\n count = 0;\\n $(\\\".start\\\").show();\\n $(\\\".start\\\").on(\\\"click\\\", function() {\\n resetResults();\\n startGame();\\n });\\n }\\n }\",\n \"function after_response(choice) {\\n\\n // measure rt\\n var end_time = Date.now();\\n var rt = end_time - start_time;\\n response.choice = data.prompt_type == \\\"count\\\" ? parseInt(choice) : choice;\\n response.rt = rt;\\n\\n // after a valid response, the stimulus will have the CSS class 'responded'\\n // which can be used to provide visual feedback that a response was recorded\\n display_element.querySelector('#scene-stimulus').className += ' responded';\\n\\n // disable all the buttons after a response\\n var btns = document.querySelectorAll('.scene-choice-button button');\\n for(var i=0; iCorrect Answers: \\\" + correctAnswer + \\\"
\\\");\\n $(\\\"main\\\").append(\\\"Wrong Answers: \\\" + wrongAnswer + \\\"
\\\");\\n $(\\\"main\\\").append(\\\"Missed Answers: \\\" + missedAnswer + \\\"
\\\");\\n\\n time = 30;\\n clicked = false;\\n count =0;\\n correctAnswer = 0;\\n wrongAnswer = 0;\\n missedAnswer = 0;\\n\\n $(\\\"main\\\").append(\\\"\\\");\\n $(\\\"#start-button\\\").on(\\\"click\\\", timingQuestion);\\n }\\n }\",\n \"function correctAnswer(){\\n $(\\\"#timer\\\").text(\\\"You are correct!\\\"); \\n if (clickCount == 0) {\\n correct++;\\n }; \\n clickCount++; //used to prevent multiple clicks adding to the total amount\\n clearInterval(timeInterval); \\n roundEnd();\\n $(\\\"button\\\").remove(); //used to remove previous events from existing buttons\\n $(\\\"#choice-container\\\").html('')\\n }\"\n]"},"negative_scores":{"kind":"list like","value":["0.64227456","0.6413096","0.6383165","0.6315035","0.61615896","0.6158293","0.6154531","0.61421865","0.61421865","0.6108407","0.60826856","0.60767287","0.6074042","0.6061887","0.60602075","0.6058682","0.60495466","0.6020223","0.6019584","0.60044336","0.5961336","0.5948536","0.5941623","0.5940533","0.5930909","0.5922732","0.5918794","0.5917989","0.5916928","0.59047616","0.59028244","0.5901223","0.59007424","0.5899033","0.5888634","0.58700985","0.58596915","0.58575135","0.5834327","0.58333564","0.58283097","0.58141315","0.5812859","0.5809388","0.5805613","0.58001727","0.5798387","0.57858586","0.57813084","0.57790124","0.5776532","0.5774767","0.57726187","0.57705057","0.5762136","0.5744722","0.5743024","0.57420653","0.5737513","0.5737474","0.57348746","0.572924","0.57273334","0.5726199","0.57247525","0.57216424","0.57031","0.5702565","0.5701889","0.5698703","0.56970567","0.5694414","0.56874555","0.5686841","0.56852555","0.567838","0.5674172","0.56570846","0.5655508","0.5654415","0.56490713","0.5644633","0.5635947","0.5631291","0.5627927","0.56263185","0.5623375","0.5619338","0.5615136","0.561425","0.561425","0.5613537","0.5613175","0.5610761","0.5610715","0.56096053","0.5608574","0.56063783","0.56061655","0.5602974"],"string":"[\n \"0.64227456\",\n \"0.6413096\",\n \"0.6383165\",\n \"0.6315035\",\n \"0.61615896\",\n \"0.6158293\",\n \"0.6154531\",\n \"0.61421865\",\n \"0.61421865\",\n \"0.6108407\",\n \"0.60826856\",\n \"0.60767287\",\n \"0.6074042\",\n \"0.6061887\",\n \"0.60602075\",\n \"0.6058682\",\n \"0.60495466\",\n \"0.6020223\",\n \"0.6019584\",\n \"0.60044336\",\n \"0.5961336\",\n \"0.5948536\",\n \"0.5941623\",\n \"0.5940533\",\n \"0.5930909\",\n \"0.5922732\",\n \"0.5918794\",\n \"0.5917989\",\n \"0.5916928\",\n \"0.59047616\",\n \"0.59028244\",\n \"0.5901223\",\n \"0.59007424\",\n \"0.5899033\",\n \"0.5888634\",\n \"0.58700985\",\n \"0.58596915\",\n \"0.58575135\",\n \"0.5834327\",\n \"0.58333564\",\n \"0.58283097\",\n \"0.58141315\",\n \"0.5812859\",\n \"0.5809388\",\n \"0.5805613\",\n \"0.58001727\",\n \"0.5798387\",\n \"0.57858586\",\n \"0.57813084\",\n \"0.57790124\",\n \"0.5776532\",\n \"0.5774767\",\n \"0.57726187\",\n \"0.57705057\",\n \"0.5762136\",\n \"0.5744722\",\n \"0.5743024\",\n \"0.57420653\",\n \"0.5737513\",\n \"0.5737474\",\n \"0.57348746\",\n \"0.572924\",\n \"0.57273334\",\n \"0.5726199\",\n \"0.57247525\",\n \"0.57216424\",\n \"0.57031\",\n \"0.5702565\",\n \"0.5701889\",\n \"0.5698703\",\n \"0.56970567\",\n \"0.5694414\",\n \"0.56874555\",\n \"0.5686841\",\n \"0.56852555\",\n \"0.567838\",\n \"0.5674172\",\n \"0.56570846\",\n \"0.5655508\",\n \"0.5654415\",\n \"0.56490713\",\n \"0.5644633\",\n \"0.5635947\",\n \"0.5631291\",\n \"0.5627927\",\n \"0.56263185\",\n \"0.5623375\",\n \"0.5619338\",\n \"0.5615136\",\n \"0.561425\",\n \"0.561425\",\n \"0.5613537\",\n \"0.5613175\",\n \"0.5610761\",\n \"0.5610715\",\n \"0.56096053\",\n \"0.5608574\",\n \"0.56063783\",\n \"0.56061655\",\n \"0.5602974\"\n]"},"document_score":{"kind":"string","value":"0.66317606"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":81766,"cells":{"query":{"kind":"string","value":"Function to Load Images to Page"},"document":{"kind":"string","value":"function loadImages() {\n if (surveyLength > 24) {\n surveyEnd();\n }\n\n lastIndex = [];\n\n lastIndex.push(randomIndex1);\n lastIndex.push(randomIndex2);\n lastIndex.push(randomIndex3);\n\n //Re-assigning the variables for each picture\n randomIndexGenerator();\n\n //While loop to prevent double choices AND no prior choice repeats\n while (randomIndex1 === lastIndex[0] || randomIndex1 === lastIndex[1] || randomIndex1 === lastIndex[2] || randomIndex2 === lastIndex[0] || randomIndex2 === lastIndex[1] || randomIndex2 === lastIndex[2] || randomIndex3 === lastIndex[0] || randomIndex3 === lastIndex[1] || randomIndex3 === lastIndex[2] || randomIndex1 === randomIndex2 || randomIndex1 === randomIndex3 || randomIndex2 === randomIndex3) {\n randomIndexGenerator();\n }\n //Makes leftImg's src property equal to the fileName of the indexed item\n leftImg.src = catalogArray[randomIndex1].filePath;\n centerImg.src = catalogArray[randomIndex2].filePath;\n rightImg.src = catalogArray[randomIndex3].filePath;\n\n //Adds 1 to the display tally property of the indexed object\n catalogArray[randomIndex1].tallyDisplayed += 1;\n catalogArray[randomIndex2].tallyDisplayed += 1;\n catalogArray[randomIndex3].tallyDisplayed += 1;\n\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function loadImages() {\n\t\t const button = document.querySelector('#loadImages');\n\t\t const container = document.querySelector('#image-container');\n\n\t\t button.addEventListener(\"click\", (event) => {\n\n\t\t const images = imageNames();\n\t\t images.forEach((image) => {\n\t\t requestFor(image, container).then(imageData => {\n\t\t const imageElement = imageData.imageElement;\n\t\t const imageSrc = imageData.objectURL;\n\t\t imageElement.src = imageSrc;\n\t\t });\n\t\t });\n\t\t });\n\t\t}","function load_images() {\n data.each(function(frame) {\n var imgs = []\n frame.images.each(function(imgstr) {\n var img = new Image(IMG_WIDTH, IMG_HEIGHT);\n img.src = \"/img/\" + imgstr;\n img.style.float = \"left\";\n imgs.push(img); \n });\n frame['imageobjs'] = imgs;\n }) \n }","function getImages() {\n\t$.get(\"resources/get_images.php\", {\"page\": globalPage}).success(function(data) {\n\t\tglobalPage++;\n\t\t\n\t\tvar imgz = JSON.parse(data).images;\n\t\tgenerateThumbnails(imgz);\n\t\tgenerateShowMoreButton(imgz);\n\t}).fail(function() {\n\t\twindow.location.replace(\"index.php\");\n\t});\n}","function renderImages() {\n $('.landing-page').addClass('hidden');\n $('.img-round').removeClass('hidden');\n updateSrcs();\n currentOffset+=100;\n }","function start_loadImages()\n {\n methods.loadImages(\n function() {\n methods.getDataURI();\n run_app();\n },\n imagesRack.imgList\n );\n }","function loadImages() {\r\n new Image('(\"Robot\") Bag','/images/bag.jpg', 0);\r\n new Image('Bathroom Phone Holder','/images/bathroom.jpg', 0);\r\n new Image('Breakfast Maker','/images/breakfast.jpg', 0);\r\n new Image('Meatball Bubblegum','/images/bubblegum.jpg', 0);\r\n new Image('Chair','/images/chair.jpg', 0);\r\n new Image('Cthulhu','/images/cthulhu.jpg', 0);\r\n new Image('Duck Mask','/images/dog-duck.jpg', 0);\r\n new Image('Dragon','/images/dragon.jpg', 0);\r\n new Image('U-Pensils','/images/pen.jpg', 0);\r\n new Image('Pet Sweep','/images/pet-sweep.jpg', 0);\r\n new Image('Pizza Scissors','/images/scissors.jpg', 0);\r\n new Image('Shark Blanket','/images/shark.jpg', 0);\r\n new Image('Baby Sweep','/images/sweep.png', 0);\r\n new Image('TaunTaun Sleepingbag','/images/tauntaun.jpg', 0);\r\n new Image('Unicorn Meat','/images/unicorn.jpg', 0);\r\n new Image('USB','/images/usb.gif', 0);\r\n new Image('Water Can','/images/water-can.jpg', 0);\r\n new Image('Wine Glass','/images/wine-glass.jpg', 0);\r\n new Image('boots', '/images/boots.jpg', 0);\r\n new Image('banana','/images/banana.jpg', 0);\r\n }","function loadAllImages() {\n var images = document.querySelectorAll('img[data-src]');\n\n for (var i = 0; i < images.length; i++) {\n ImageLoader.load(images[i]);\n }\n }","function loadImages() {\n $('img[data-src]').each(function () {\n var src = $(this).data('src');\n var style = $(this).data('style');\n $(this).attr('src', src);\n $(this).attr('style', style);\n });\n}","function loadImages() {\n var files = [ 'outer_light.png', 'layer_down_light.png',\n 'layer_up_light.png', 'angle_prev_light.png',\n 'angle_next_light.png', 'linked_data_light.png',\n 'raw_scan_light.png', 'dig_positive_light.png',\n 'text_view_light.png', 'vector_view_light.png',\n 'overlays_light.png', 'thumbnails_light.png',\n '3d_view_light.png', 'step_back_light.png',\n 'step_fwd_light.png', 'minimize_light.png' ];\n\n var i = 0;\n for (i = 0; i < files.length; i++) {\n btnImages[i] = new Image(); btnImages[i].src = files[i];\n }\n}","function findImagesToLoad() {\n\tsetLazyImagePositions.call(this);\n\tconst imagesToLoad = getImagesInView(this.images);\n\tloadImages.call(this, imagesToLoad);\n}","function LoadImages()\n{\n\tvar loadedImages = 0;\n\tvar numImages = 0;\n\tfor (var src in ImgList)\n\t{\n\t\tnumImages++;\n\t}\n\tfor (var src in ImgList)\n\t{\n\t\tImgs[src] = new Image();\n\t\tImgs[src].onload = function()\n\t\t{\n\t\t\tloadedImages = loadedImages +1;\n\t\t\tif(loadedImages >= numImages)\n\t\t\t{\n\t\t\t\t//Finished loading!\n\t\t\t\ttstsetup();\n\t\t\t\tImgsFinished = 1;\n\t\t\t}\n\t\t};\n\n\t\tif (src < 6)\n\t\t{\n\t\t\tImgs[src].src = ImgList[src];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tImgs[src].src = ImgURL + ImgList[src];\n\t\t}\n\t}\n}","function fetchImages() {\n $.getJSON(\"/images.php\", function(data) {\n preloadImages(data);\n }); \n }","function loadImages() {\n bsImage = new Image();\n bsImage.src = \"resources/resources/images/spritesheets/buttons_1.png\";\n wallImag = new Image();\n wallImag.src = \"resources/resources/images/spritesheets/jungle_wall.png\";\n ssImage = new Image();\n ssImage.src = \"resources/resources/images/spritesheets/sprites_final.png\";\n window.setTimeout(setup, 1500);\n aImage = new Image();\n aImage.src = \"resources/resources/images/spritesheets/uparr.png\"\n}","function loadImages(div){\r\n\tvar images = [];\r\n\tjQuery.each(jQuery(div+' img'), function(i,img){\r\n\t\tif(!jQuery(img).attr('src') || jQuery(img).attr('src')==''){\r\n\t\t\timages.push(img);\r\n\t\t}\r\n\t});\r\n\tjQuery(images).each( function(i,image) {\r\n\t\tjQuery(this).attr('src',jQuery(this).attr('longdesc'));\r\n\t});\r\n}","function loadImage() {\n var baseUrl = 'https://source.unsplash.com/category';\n var category = 'nature';\n var size = '1920x1080';\n\n var source = baseUrl + '/' + category + '/' + size;\n\n buildElement(source)\n .then(render);\n }","function loadImages() {\r\n var files = document.getElementById('images').files, i, file, reader;\r\n for (i = 0; i < files.length; i = i + 1) {\r\n file = files[i];\r\n if (file.name.endsWith(\".jpg\") || file.name.endsWith(\".gif\") || file.name.endsWith(\".png\")) {\r\n images.push(file);\r\n }\r\n }\r\n if (images.length > 0) {\r\n showLoadedImages(\"list\");\r\n } else {\r\n alert(\"No images found. Try another directory.\");\r\n }\r\n }","function loadVisiblePages() {\n // Fetch page images that are currently shown on the site\n var firstVisibleImageLinks = $('#imageList li>a').not('.page-text').withinviewport();\n $.each(firstVisibleImageLinks, function(index, aEl) {\n var imgEl = $(aEl).find('img');\n // Check if the image is already loaded\n if( $(imgEl).attr('src') !== '' )\n return;\n\n // Load page images via Ajax\n $.get( \"ajax/image/page\", { \"imageId\" : globalImageType, \"pageId\" : $(aEl).attr('data-pageid'), \"width\" : 150 } )\n .always(function( data ) {\n // Remove broken image icon first\n var nextEl = $(imgEl).next();\n if( nextEl.length !== 0 ) {\n $(nextEl).remove();\n }\n })\n .done(function( data ) {\n $(imgEl).attr('src', \"data:image/jpeg;base64, \" + data);\n })\n .fail(function( data ) {\n $(imgEl).after('broken_image');\n });\n });\n}","function loadImage() {\n\n // image file not loaded yet? => load image file\n if ( !resource ) jQuery( '', file.name, '
', file.name, '
', file.name, '
'+ImageTagsFormatted.join(' | '))\r\n\t\r\n\t$nav_content_img\r\n\t.data('ImageId',ImageID)\r\n\t\r\n\tvar current_status = Loaded_Images[ImageID].status;\r\n\t\r\n\t// Loads the image if it's already been verified previously.\r\n\tif(current_status == 'loaded' || current_status == 'error'){\r\n\t\t$nav_content_img.attr('src',ImageMain)\r\n\t\tif(current_status != 'loading')$nav_thumb_img.hide();\r\n\t\t$('.main_image_direct_link',$text_overlay).attr('href',ImageMain)\r\n\t\t\r\n\t\tRepositionMainImage();\r\n\t\r\n\t// Checks each image extension until it finds a working one\r\n\t}else if(current_status == 'waiting'){\r\n\t\tLoaded_Images[ImageID].status = 'loading';\r\n\t\tGM_xmlhttpRequest({\r\n\t\t\tmethod: \"GET\",\r\n\t\t\turl: '/'+Loaded_Images[ImageID].link,\r\n\t\t\tonload: function(retour) {\r\n\t\t\t\tLoaded_Images[ImageID].verified = true\r\n\t\t\t\tvar image;\r\n\t\t\t\tvar ResponseHTML = $(retour.responseText);\r\n\t\t\t\tvar ImageServer = $('div.content script:contains(\"image\"):contains(\"domain\"):contains(\"base_dir\")',ResponseHTML).text();\r\n\t\t\t\teval(ImageServer)\r\n\t\t\t\tvar new_image_url = image.domain+\"/\"+image.base_dir+\"/\"+image.dir+\"/\"+image.img;\r\n\t\t\t\tLoaded_Images[ImageID].main = new_image_url\r\n\t\t\t\t$(\"
', file.name, '
', file.name, '
', file.name, '
'+ImageTagsFormatted.join(' | '))\\r\\n\\t\\r\\n\\t$nav_content_img\\r\\n\\t.data('ImageId',ImageID)\\r\\n\\t\\r\\n\\tvar current_status = Loaded_Images[ImageID].status;\\r\\n\\t\\r\\n\\t// Loads the image if it's already been verified previously.\\r\\n\\tif(current_status == 'loaded' || current_status == 'error'){\\r\\n\\t\\t$nav_content_img.attr('src',ImageMain)\\r\\n\\t\\tif(current_status != 'loading')$nav_thumb_img.hide();\\r\\n\\t\\t$('.main_image_direct_link',$text_overlay).attr('href',ImageMain)\\r\\n\\t\\t\\r\\n\\t\\tRepositionMainImage();\\r\\n\\t\\r\\n\\t// Checks each image extension until it finds a working one\\r\\n\\t}else if(current_status == 'waiting'){\\r\\n\\t\\tLoaded_Images[ImageID].status = 'loading';\\r\\n\\t\\tGM_xmlhttpRequest({\\r\\n\\t\\t\\tmethod: \\\"GET\\\",\\r\\n\\t\\t\\turl: '/'+Loaded_Images[ImageID].link,\\r\\n\\t\\t\\tonload: function(retour) {\\r\\n\\t\\t\\t\\tLoaded_Images[ImageID].verified = true\\r\\n\\t\\t\\t\\tvar image;\\r\\n\\t\\t\\t\\tvar ResponseHTML = $(retour.responseText);\\r\\n\\t\\t\\t\\tvar ImageServer = $('div.content script:contains(\\\"image\\\"):contains(\\\"domain\\\"):contains(\\\"base_dir\\\")',ResponseHTML).text();\\r\\n\\t\\t\\t\\teval(ImageServer)\\r\\n\\t\\t\\t\\tvar new_image_url = image.domain+\\\"/\\\"+image.base_dir+\\\"/\\\"+image.dir+\\\"/\\\"+image.img;\\r\\n\\t\\t\\t\\tLoaded_Images[ImageID].main = new_image_url\\r\\n\\t\\t\\t\\t$(\\\"
\n \n
\n )\n }","function selectChoice(event){\n console.log(event.target.id);\n var k = event.target.id;\n console.log('yo', event.target);\n imgObjArr[k].numClicks++;\n console.log('hey', imgObjArr[k]);\n console.log('target clicks:', imgObjArr[k].numClicks);\n if (totalClicks < 25) {\n fillImages();\n } else {\n alert('Thank you for participating in our study!');\n save();\n buildTable();\n }\n}","function clickImage(e){\n if( e.target.id === 'left_goat_img' || e.target.id === 'right_goat_img'){\n pickRandomImages();\n totalClicks++;\n }\n if(event.target.id === 'left_goat_img'){\n leftGoatThatIsOnThePage.likes++;\n }\n if(event.target.id === 'right_goat_img'){\n rightGoatThatIsOnThePage.likes++;\n }\n if(totalClicks === 6){\n //remove event listener\n groupImageSection.removeEventListener('click' , clickImage);\n rightGoatImage.remove();\n leftGoatImage.remove();\n renderChartResults();\n }\n}","function pickedImg() { //the clicked img will be run every other time\n for ( var k = 0; k < imgShort.length; k +=2 ) {\n };\n function clicky(event) {\n var clicked1 = event.target.id;\n document.getElementById('img_box').addEventListener('click', clicky);\n }\n}","function imgClick(e) {\n musicInfo = e.target.alt;\n splitInfo = musicInfo.split('_');\n DOMString.getCurrentMusicVideoTitle.textContent = splitInfo[0];\n DOMString.getCurrentMusicVideoArtist.textContent = splitInfo[1];\n DOMString.getCurrentMusicVideo.src = e.target.dataset.src;\n\n DOMString.getCurrentMusicVideoHeading.classList.add('fadeIn');\n setTimeout(() => DOMString.getCurrentMusicVideoHeading.classList.remove('fadeIn'), 500);\n }","handleJDotterClick() {}","function imgClick(img) {\n window.event.stopPropagation();\n document.querySelector(`#grey-screen`).classList.toggle(\"hide\");\n document.querySelector(`#zoom-img`).src = img;\n}","function thumbnailClickHandler(evt) {\n var target = evt.target;\n if (!target || !target.classList.contains('thumbnail'))\n return;\n\n if (currentView === thumbnailListView || currentView === fullscreenView) {\n showFile(parseInt(target.dataset.index));\n }\n else if (currentView === thumbnailSelectView) {\n updateSelection(target);\n }\n else if (currentView === pickView) {\n cropPickedImage(files[parseInt(target.dataset.index)]);\n }\n}","function img_click(i){\n i.onclick=function(){\n modal.style.display=\"block\";\n modalImg.src=this.src;\n }\n}","function handleImgClick(e){\n modal.style.display = \"block\";\n console.log(e);\n let image=e.currentTarget.src;\n modalImg.src=image;\n captionText.innerHTML = e.currentTarget.getAttribute(\"alt\");\n}","function load_click() {\n if ($('random_front_picture') != null) {\n Event.observe('random_front_picture', 'click', function(e) {\n e.stop()\n to = $('random_front_picture').href \n new Ajax.Request(to)\n })\n }\n}","function choose_img(files_id) { // function choose img upload from file in your folder.\r\n $(\"#\" + files_id).click();\r\n}","clicked(x, y) {}","function clickImage(object){\n document.location = page.PRODUCT + '?id=' + object.id;\n}","function handleImageClick(event) {\n console.log(event.target.alt);\n //iterate through array to check that event has been clicked\n for (var i = 0; i < allProducts.length; i++) {\n if (event.target.alt === allProducts[i].name) {\n allProducts[i].votes++;\n }\n }\n //in order to get a random image which allows new photos to be displayed call randomImage Function\n randomImage();\n}","function uploadAvatar(){\n\t$('#avatarPhoto').click();\n}","putImage(button){\n if(button.code == -1){//al ser clickeada la locación, se enrutará a la página de locaciones y su subbsección respectiva\n switch(this.easyFrame){\n case 0:\n window.location.href = \"location.html#cove\";\n return;\n case 1:\n window.location.href = \"location.html#darkest-dungeon\";\n return;\n case 2:\n window.location.href = \"location.html#ruins\";\n return;\n case 3:\n window.location.href = \"location.html#warrens\";\n return;\n case 4:\n window.location.href = \"location.html#weald\";\n return;\n case 5:\n window.location.href = \"location.html#courtyard\";\n return;\n case 6:\n window.location.href = \"location.html#farmstead\";\n return;\n default:\n return;\n }\n\n }\n //en caso que se clickee un botón, se ajusta el frame de la locación y se vuelve visible, además se le agrega su interactividad\n this.areaPicture.setFrame(button.code);\n this.easyFrame = button.code;\n this.areaPicture.setVisible(true);\n this.areaPicture.setInteractive();\n this.areaPicture.on('clicked', this.putImage, this);\n }","function choiceClick(counter) {\n $('#picture .slick-next').trigger('click');\n $('.img-overlay').find('.click-overlay').parent().next().find('.overlay').addClass('click-overlay');\n $('#picture-array .slick-next').trigger('click');\n $('.image_number').html(counter + 1 + ' of 46');\n}","_onClick({x,y,object}) {\n console.log(\"Clicked icon:\",object);\n }","function on_click(e) {\n cloud.on_click(e.clientX, e.clientY);\n}","function onImageClick(imageId) {\n setMemeImgId(imageId)\n drawImgFromlocal(imageId);\n setTimeout(function () {\n document.querySelector('.header2').style.display = 'none';\n document.querySelector('main').style.display = 'none';\n document.querySelector('.my-info').style.display = 'none';\n document.querySelector('.canvas-btn-container').style.display = 'flex';\n resizeCanvas();\n }, 10)\n}","function handleClick(event)\n{\n}","function clickHandler(theEvent) {\n//outerHTML repalces the whole html including the tags\n var theImage = theEvent.target.outerHTML;\n //changing the class of image_show from display_none to display_img\n imgDiv.className = \"display_img\";\n //changing the html in the image_show by inserting the html from the thumbnail\n imgDiv.innerHTML = theImage;\n}","function handlePlanImage(id) {\n alert(id);\n }","function selectImage(event) {\n\n const button = event.currentTarget\n const buttons = document.querySelectorAll('.images button')\n\n buttons.forEach((button) => {\n button.classList.remove('active')\n })\n //adicionar a classe active para o botão clicado\n button.classList.add('active')\n\n\n //selecionara a imagem clicada\n const image = button.children[0]\n const imageContainer = document.querySelector('.orphanage-details > img')\n //atualizar o container de imagem\n imageContainer.src = image.src\n\n}","handleArrowClick(e) {\n e.preventDefault();\n this.changeMainImage(e.target.name);\n }","function selectAvatar1(event)\n{\n selectAvatar(event, 1);\n}","function canvasClick(e) {\n\tblockus.mouseClicked();\n}","function exeOpenImage(e){ openImage(e.target) }","onClick(event) {\n\t\t// console.log(\"mouse click\");\n\t\tthis.draw(event);\n\t}","handleClick() {}","function imgEvent(){\n alert('This is Void Link');\n}","function setupEventListenersToBigImg() {\n bigImg.addEventListener('click', addClick);\n}","function conduitEventClick(event) {\n var command = this.getMouseEventCommand( event );\n switch( command ) {\n case \"cancel\":\n this.close();\n break;\n case \"searchConduit\":\n this.searchConduit();\n break;\n case \"insertFromConduit\": \n var ids = this.list.getSelectedIDs();\n if( ids.length ) {\n // Actually, we only handle a single photo at a time\n // at this time.\n for (var i = 0; i < ids.length; i++) {\n var asset = {\n name: names[ids[i]],\n // TODO: bells & whistles for the IMG tag?\n body: \"\\n \\n
\\n )\\n }\",\n \"function selectChoice(event){\\n console.log(event.target.id);\\n var k = event.target.id;\\n console.log('yo', event.target);\\n imgObjArr[k].numClicks++;\\n console.log('hey', imgObjArr[k]);\\n console.log('target clicks:', imgObjArr[k].numClicks);\\n if (totalClicks < 25) {\\n fillImages();\\n } else {\\n alert('Thank you for participating in our study!');\\n save();\\n buildTable();\\n }\\n}\",\n \"function clickImage(e){\\n if( e.target.id === 'left_goat_img' || e.target.id === 'right_goat_img'){\\n pickRandomImages();\\n totalClicks++;\\n }\\n if(event.target.id === 'left_goat_img'){\\n leftGoatThatIsOnThePage.likes++;\\n }\\n if(event.target.id === 'right_goat_img'){\\n rightGoatThatIsOnThePage.likes++;\\n }\\n if(totalClicks === 6){\\n //remove event listener\\n groupImageSection.removeEventListener('click' , clickImage);\\n rightGoatImage.remove();\\n leftGoatImage.remove();\\n renderChartResults();\\n }\\n}\",\n \"function pickedImg() { //the clicked img will be run every other time\\n for ( var k = 0; k < imgShort.length; k +=2 ) {\\n };\\n function clicky(event) {\\n var clicked1 = event.target.id;\\n document.getElementById('img_box').addEventListener('click', clicky);\\n }\\n}\",\n \"function imgClick(e) {\\n musicInfo = e.target.alt;\\n splitInfo = musicInfo.split('_');\\n DOMString.getCurrentMusicVideoTitle.textContent = splitInfo[0];\\n DOMString.getCurrentMusicVideoArtist.textContent = splitInfo[1];\\n DOMString.getCurrentMusicVideo.src = e.target.dataset.src;\\n\\n DOMString.getCurrentMusicVideoHeading.classList.add('fadeIn');\\n setTimeout(() => DOMString.getCurrentMusicVideoHeading.classList.remove('fadeIn'), 500);\\n }\",\n \"handleJDotterClick() {}\",\n \"function imgClick(img) {\\n window.event.stopPropagation();\\n document.querySelector(`#grey-screen`).classList.toggle(\\\"hide\\\");\\n document.querySelector(`#zoom-img`).src = img;\\n}\",\n \"function thumbnailClickHandler(evt) {\\n var target = evt.target;\\n if (!target || !target.classList.contains('thumbnail'))\\n return;\\n\\n if (currentView === thumbnailListView || currentView === fullscreenView) {\\n showFile(parseInt(target.dataset.index));\\n }\\n else if (currentView === thumbnailSelectView) {\\n updateSelection(target);\\n }\\n else if (currentView === pickView) {\\n cropPickedImage(files[parseInt(target.dataset.index)]);\\n }\\n}\",\n \"function img_click(i){\\n i.onclick=function(){\\n modal.style.display=\\\"block\\\";\\n modalImg.src=this.src;\\n }\\n}\",\n \"function handleImgClick(e){\\n modal.style.display = \\\"block\\\";\\n console.log(e);\\n let image=e.currentTarget.src;\\n modalImg.src=image;\\n captionText.innerHTML = e.currentTarget.getAttribute(\\\"alt\\\");\\n}\",\n \"function load_click() {\\n if ($('random_front_picture') != null) {\\n Event.observe('random_front_picture', 'click', function(e) {\\n e.stop()\\n to = $('random_front_picture').href \\n new Ajax.Request(to)\\n })\\n }\\n}\",\n \"function choose_img(files_id) { // function choose img upload from file in your folder.\\r\\n $(\\\"#\\\" + files_id).click();\\r\\n}\",\n \"clicked(x, y) {}\",\n \"function clickImage(object){\\n document.location = page.PRODUCT + '?id=' + object.id;\\n}\",\n \"function handleImageClick(event) {\\n console.log(event.target.alt);\\n //iterate through array to check that event has been clicked\\n for (var i = 0; i < allProducts.length; i++) {\\n if (event.target.alt === allProducts[i].name) {\\n allProducts[i].votes++;\\n }\\n }\\n //in order to get a random image which allows new photos to be displayed call randomImage Function\\n randomImage();\\n}\",\n \"function uploadAvatar(){\\n\\t$('#avatarPhoto').click();\\n}\",\n \"putImage(button){\\n if(button.code == -1){//al ser clickeada la locación, se enrutará a la página de locaciones y su subbsección respectiva\\n switch(this.easyFrame){\\n case 0:\\n window.location.href = \\\"location.html#cove\\\";\\n return;\\n case 1:\\n window.location.href = \\\"location.html#darkest-dungeon\\\";\\n return;\\n case 2:\\n window.location.href = \\\"location.html#ruins\\\";\\n return;\\n case 3:\\n window.location.href = \\\"location.html#warrens\\\";\\n return;\\n case 4:\\n window.location.href = \\\"location.html#weald\\\";\\n return;\\n case 5:\\n window.location.href = \\\"location.html#courtyard\\\";\\n return;\\n case 6:\\n window.location.href = \\\"location.html#farmstead\\\";\\n return;\\n default:\\n return;\\n }\\n\\n }\\n //en caso que se clickee un botón, se ajusta el frame de la locación y se vuelve visible, además se le agrega su interactividad\\n this.areaPicture.setFrame(button.code);\\n this.easyFrame = button.code;\\n this.areaPicture.setVisible(true);\\n this.areaPicture.setInteractive();\\n this.areaPicture.on('clicked', this.putImage, this);\\n }\",\n \"function choiceClick(counter) {\\n $('#picture .slick-next').trigger('click');\\n $('.img-overlay').find('.click-overlay').parent().next().find('.overlay').addClass('click-overlay');\\n $('#picture-array .slick-next').trigger('click');\\n $('.image_number').html(counter + 1 + ' of 46');\\n}\",\n \"_onClick({x,y,object}) {\\n console.log(\\\"Clicked icon:\\\",object);\\n }\",\n \"function on_click(e) {\\n cloud.on_click(e.clientX, e.clientY);\\n}\",\n \"function onImageClick(imageId) {\\n setMemeImgId(imageId)\\n drawImgFromlocal(imageId);\\n setTimeout(function () {\\n document.querySelector('.header2').style.display = 'none';\\n document.querySelector('main').style.display = 'none';\\n document.querySelector('.my-info').style.display = 'none';\\n document.querySelector('.canvas-btn-container').style.display = 'flex';\\n resizeCanvas();\\n }, 10)\\n}\",\n \"function handleClick(event)\\n{\\n}\",\n \"function clickHandler(theEvent) {\\n//outerHTML repalces the whole html including the tags\\n var theImage = theEvent.target.outerHTML;\\n //changing the class of image_show from display_none to display_img\\n imgDiv.className = \\\"display_img\\\";\\n //changing the html in the image_show by inserting the html from the thumbnail\\n imgDiv.innerHTML = theImage;\\n}\",\n \"function handlePlanImage(id) {\\n alert(id);\\n }\",\n \"function selectImage(event) {\\n\\n const button = event.currentTarget\\n const buttons = document.querySelectorAll('.images button')\\n\\n buttons.forEach((button) => {\\n button.classList.remove('active')\\n })\\n //adicionar a classe active para o botão clicado\\n button.classList.add('active')\\n\\n\\n //selecionara a imagem clicada\\n const image = button.children[0]\\n const imageContainer = document.querySelector('.orphanage-details > img')\\n //atualizar o container de imagem\\n imageContainer.src = image.src\\n\\n}\",\n \"handleArrowClick(e) {\\n e.preventDefault();\\n this.changeMainImage(e.target.name);\\n }\",\n \"function selectAvatar1(event)\\n{\\n selectAvatar(event, 1);\\n}\",\n \"function canvasClick(e) {\\n\\tblockus.mouseClicked();\\n}\",\n \"function exeOpenImage(e){ openImage(e.target) }\",\n \"onClick(event) {\\n\\t\\t// console.log(\\\"mouse click\\\");\\n\\t\\tthis.draw(event);\\n\\t}\",\n \"handleClick() {}\",\n \"function imgEvent(){\\n alert('This is Void Link');\\n}\",\n \"function setupEventListenersToBigImg() {\\n bigImg.addEventListener('click', addClick);\\n}\",\n \"function conduitEventClick(event) {\\n var command = this.getMouseEventCommand( event );\\n switch( command ) {\\n case \\\"cancel\\\":\\n this.close();\\n break;\\n case \\\"searchConduit\\\":\\n this.searchConduit();\\n break;\\n case \\\"insertFromConduit\\\": \\n var ids = this.list.getSelectedIDs();\\n if( ids.length ) {\\n // Actually, we only handle a single photo at a time\\n // at this time.\\n for (var i = 0; i < ids.length; i++) {\\n var asset = {\\n name: names[ids[i]],\\n // TODO: bells & whistles for the IMG tag?\\n body: \\\"Chart Not Available
');\n\t \t //$(\"#weekAreaChart\").html('Chart Not Available
');\n\t \t $('#weekLineChartTab').hide();\n\t \t $( '#lineCharts' ).tabs({ selected: 1 });\n\t \t $('#weekAreaChartTab').hide();\n\t \t $( '#areaCharts' ).tabs({ selected: 1 });\n\t }\n }\n else\n {\n \t $('#weekPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 2 });\n \t $('#weekStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 2 });\n \t $('#weekBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 2 });\n \t $('#weekLineChartTab').hide();\n \t $( '#lineCharts' ).tabs({ selected: 1 });\n \t $('#weekAreaChartTab').hide();\n \t $( '#areaCharts' ).tabs({ selected: 1 });\n }\n \n if(monthDataExist)\n {\n\t // month charts\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('monthPieChart'));\n\t pieChart.draw(monthTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('monthPieChart'));\n\t pieChart.draw(monthTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('monthStackChart'));\n\t \t columnChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('monthStackChart'));\n\t \t columnChart.draw(monthData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('monthBarChart'));\n\t \t columnChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('monthBarChart'));\n\t \t columnChart.draw(monthData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(monthRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('monthLineChart'));\n\t\t lineChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('monthLineChart'));\n\t\t lineChart.draw(monthData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('monthAreaChart'));\n\t\t \t areaChart.draw(monthData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('monthAreaChart'));\n\t\t \t areaChart.draw(monthData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t }\n\t else\n\t {\n\t \t //$(\"#monthLineChart\").html('Chart Not Available
');\n\t \t //$(\"#monthAreaChart\").html('Chart Not Available
');\n\t \t $('#monthLineChartTab').hide();\n\t \t $( '#lineCharts' ).tabs({ selected: 2 });\n\t \t $('#monthAreaChartTab').hide();\n\t \t $( '#areaCharts' ).tabs({ selected: 2 });\n\t }\n }\n else\n {\n \t $('#monthPieChartTab').hide();\n \t $( '#pieCharts' ).tabs({ selected: 3 });\n \t $('#monthStackChartTab').hide();\n \t $( '#stackCharts' ).tabs({ selected: 3 });\n \t $('#monthBarChartTab').hide();\n \t $( '#barCharts' ).tabs({ selected: 3 });\n \t $('#monthLineChartTab').hide();\n \t $( '#lineCharts' ).tabs({ selected: 2 });\n \t $('#monthAreaChartTab').hide();\n \t $( '#areaCharts' ).tabs({ selected: 2 });\n }\n \n if(yearDataExist)\n {\n\t if(useNormalCharts)\n\t {\n\t \t var pieChart = new google.visualization.PieChart(document.getElementById('yearPieChart'));\n\t pieChart.draw(yearTotalsData, {enableInteractivity:false, colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var pieChart = new google.visualization.ImagePieChart(document.getElementById('yearPieChart'));\n\t pieChart.draw(yearTotalsData, {colors:chartColors, title:\"\", width:pieWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('yearStackChart'));\n\t \t columnChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('yearStackChart'));\n\t \t columnChart.draw(yearData, {colors:chartColors, title:\"\", isStacked:true, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t \n\t if(useNormalCharts)\n\t {\n\t \t var columnChart = new google.visualization.ColumnChart(document.getElementById('yearBarChart'));\n\t \t columnChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", isStacked:false, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t else\n\t {\n\t \t var columnChart = new google.visualization.ImageBarChart(document.getElementById('yearBarChart'));\n\t \t columnChart.draw(yearData, {colors:chartColors, title:\"\", isStacked:false, isVertical:true, width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t }\n\t\t \n\t if(yearRowData.length > 2)\n\t {\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var lineChart = new google.visualization.LineChart(document.getElementById('yearLineChart'));\n\t\t lineChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t else\n\t\t {\n\t\t \t var lineChart = new google.visualization.ImageLineChart(document.getElementById('yearLineChart'));\n\t\t lineChart.draw(yearData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize });\n\t\t }\n\t\t\n\t\t if(useNormalCharts)\n\t\t {\n\t\t \t var areaChart = new google.visualization.AreaChart(document.getElementById('yearAreaChart'));\n\t\t \t areaChart.draw(yearData, {enableInteractivity:false, colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t\t else\n\t\t {\n\t\t \t var areaChart = new google.visualization.ImageAreaChart(document.getElementById('yearAreaChart'));\n\t\t \t areaChart.draw(yearData, {colors:chartColors, title:\"\", width:chartWidth, height:chartHeight, legend:'none', chartArea: chartAreaSize, fontSize:fontPxSize }); \n\t\t }\n\t }\n\t else\n\t {\n\t \t $(\"#yearLineChart\").html('Chart Not Available
');\n\t \t $(\"#yearAreaChart\").html('Chart Not Available
');\n\t }\n }\n else\n {\n \t $(\"#yearPieChart\").html('Chart Not Available
');\n \t $(\"#yearStackChart\").html('Chart Not Available
');\n \t $(\"#yearBarChart\").html('Chart Not Available
');\n \t $(\"#yearLineChart\").html('Chart Not Available
');\n \t $(\"#yearAreaChart\").html('Chart Not Available
');\n }\n \n }","function draw(){\n\n drawGrid();\n var seriesIndex;\n\n if(!graph.hasData) {\n return;\n }\n\n if(graph.options.axes.x1.show){\n if(!graph.options.axes.x1.labels || graph.options.axes.x1.labels.length === 0) {\n seriesIndex = graph.options.axes.x1.seriesIndex;\n graph.options.axes.x1.labels= getXLabels(graph.allSeries[seriesIndex].series[0], graph.options.labelDateFormat);\n }\n drawXLabels(graph.options.axes.x1);\n }\n if(graph.options.axes.x2.show && graph.hasData){\n if (!graph.options.axes.x2.labels || graph.options.axes.x2.labels.length === 0) {\n seriesIndex = graph.options.axes.x2.seriesIndex;\n graph.options.axes.x2.labels = getXLabels(graph.allSeries[seriesIndex].series[0], graph.options.labelDateFormat);\n }\n drawXLabels(graph.options.axes.x2);\n }\n\n if (graph.options.axes.y1.show) {\n drawYLabels(graph.maxVals[graph.options.axes.y1.seriesIndex], graph.minVals[graph.options.axes.y1.seriesIndex], graph.options.axes.y1);\n }\n if (graph.options.axes.y2.show) {\n drawYLabels(graph.maxVals[graph.options.axes.y2.seriesIndex], graph.minVals[graph.options.axes.y2.seriesIndex], graph.options.axes.y2);\n }\n }","function DrawHDDChart()\n{\n // create/delete rows \n if (hddTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - hddTable.getNumberOfRows();\n hddTable.addRows(numRows);\n } else {\n for(var i=(hddTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n hddTable.removeRow(i); \n }\n }\n\n // Populate data table with time/hdd data points. \n for(var i=0; i < hddTable.getNumberOfRows(); i++)\n {\n hddTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n hddTable.setCell(i, 1, parseInt(aggrDataPoints[i].hdd));\n }\n\n // Draw line chart.\n chartOptions.title = 'HDD Usage (%)';\n hddChart.draw(hddView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['activos', 5],\n ['inactivos', 5.8],\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Estado de las alumnas',\n 'width': 450,\n 'height': 300\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart() {\n \n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n \n // Set chart options\n var options = {'title':'How Much Pizza I Ate Last Night'};\n \n // Instantiate and draw our chart, passing in some options.\n var piechart = new google.visualization.PieChart(elements.piechart);\n var linechart = new google.charts.Line(elements.linechart);\n var barchart = new google.charts.Bar(elements.barchart);\n piechart.draw(data, options);\n linechart.draw(data, options);\n barchart.draw(data,options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n\n // Set chart options\n var options = {'title':'How Much Pizza I Ate Last Night'};\n\n // Instantiate and draw our chart, passing in some options.\n var piechart = new google.visualization.PieChart(elements.piechart);\n var linechart = new google.charts.Line(elements.linechart);\n var barchart = new google.charts.Bar(elements.barchart);\n piechart.draw(data, options);\n linechart.draw(data, options);\n barchart.draw(data,options);\n }","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Mushrooms', 3],\n ['Onions', 1],\n ['Olives', 1],\n ['Zucchini', 1],\n ['Pepperoni', 2]\n ]);\n\n // Set chart options\n var options = {'title':'Global Share',\n 'width':300,\n 'height':200,\n 'is3D': true,};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n 'use strict';\n // Define the chart to be drawn.\n var data = new google.visualization.DataTable();\n var points = [\n ['Nitrogen', 0.3],\n ['Oxygen', 0.21],\n ['Other', 0.01]\n ];\n addData(data, points); // by reference\n var chart = new google.visualization.PieChart(document.getElementById('chart_id'));\n chart.draw(data, null);\n }","function drawChart4() {\n\n // Create the data table.\n var data4 = new google.visualization.DataTable();\n data4.addColumn('string', 'nombre');\n data4.addColumn('number', 'cantidad');\n data4.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de pruebas por escuela sede: '+escuela,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data4, options1);\n\n }","function renderChart() {\n let datasets = [];\n\n if (funcionPoints.length > 0) {\n datasets.push({\n label: funcion,\n data: funcionPoints,\n borderColor: \"purple\",\n borderWidth: 2,\n fill: false,\n showLine: true,\n pointBackgroundColor: \"purple\",\n radius: 0,\n });\n } else {\n alert(\"No hay puntos para la funcion.\");\n }\n\n if (areaPoints.length > 0) {\n datasets.push({\n label: \"Area\",\n data: areaPoints,\n borderColor: \"blue\",\n borderWidth: 2,\n fill: true,\n showLine: true,\n pointBackgroundColor: \"blue\",\n tension: 0,\n radius: 0,\n });\n } else {\n alert(\"No hay puntos para el area.\");\n }\n\n if (insidePoints.length > 0) {\n datasets.push({\n label: \"Punto aleatorio por debajo de la función\",\n data: insidePoints,\n borderColor: \"green\",\n borderWidth: 2,\n fill: false,\n showLine: false,\n pointBackgroundColor: \"green\",\n });\n } else {\n alert(\"No hay puntos aleatorios.\");\n }\n\n if (outsidePoints.length > 0) {\n datasets.push({\n label: \"Punto aleatorio por arriba de la función\",\n data: outsidePoints,\n borderColor: \"red\",\n borderWidth: 2,\n fill: false,\n showLine: false,\n pointBackgroundColor: \"red\",\n });\n } else {\n alert(\"No hay puntos aleatorios.\");\n }\n\n data = { datasets };\n\n if (chart) {\n chart.data = data;\n chart.update();\n }\n }","function draw() {\n\n var isGridDrawn = false;\n\n if(graph.options.errorMessage) {\n var $errorMsg = $('' + graph.options.errorMessage + '
')\n .addClass('alert box');\n\n graph.$el.find('.paper').prepend($errorMsg);\n }\n\n if(!graph.allSeries.length) {\n elroi.fn.grid(graph).draw();\n }\n\n $(graph.allSeries).each(function(i) {\n\n if(!isGridDrawn && graph.seriesOptions[i].type != 'pie') {\n elroi.fn.grid(graph).draw();\n isGridDrawn = true;\n }\n\n var type = graph.seriesOptions[i].type;\n elroi.fn[type](graph, graph.allSeries[i].series, i).draw();\n\n });\n\n }","function drawChart1() {\n\n // Create the data table.\n var data1 = new google.visualization.DataTable();\n data1.addColumn('string', 'nombre');\n data1.addColumn('number', 'cantidad');\n data1.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por escuela',\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data1, options1);\n\n }","draw() {\n this._updateWidthHeight();\n\n this.initSvg();\n // bar char\n if (this.keysBar) {\n this.aggregateLabelsByKeys(this.selection, this.keysBar);\n }\n\n if (this.keysX && this.keysY) {\n this.aggregateValuesByKeys(this.selection, this.keysX, this.keysY);\n }\n\n this.barChart.draw();\n // scatterplot\n // this.scatter.draw();\n }","function drawChart() {\n var data = google.visualization.arrayToDataTable([\n ['', 'Hours per Day'],\n ['', 8],\n ['', 2],\n ['', 4],\n ['', 2],\n ['', 8]\n ]);\n \n var options = { legend: 'none','width':50, 'height':40};\n \n // var chart = new google.visualization.PieChart(document.getElementById('piechart'));\n // chart.draw(data,options);\n }","function makeCharts() {\n issueChart();\n countChart();\n averageChart();\n}","function drawChart() {\n\n // Create the data table.\n var data = google.visualization.arrayToDataTable([\n ['Scenario Name', 'Duration', {role: 'style'}]\n ].concat(values));\n\n var options = {\n title: 'Scenario Results',\n legend: { position: 'none' },\n vAxis: { title: 'Duration (seconds)'},\n backgroundColor: bgColor\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById('resultChart'));\n chart.draw(data, options);\n\n }","function drawChart() {\n\n // Crea la grafica a partir de la tabla\n var data = google.visualization.arrayToDataTable([\n ['Actividades', 'Actividades Esperadas', 'Actividades Presentes'],\n ['1', 33, 40],\n ['2', 117, 96],\n ['3', 166, 210],\n ['4', 117, 66],\n ['5', 66, 21],\n ['6', 33, 40],\n ['7', 117, 96],\n ['8', 150, 190],\n ['9', 103, 50],\n ['10', 200, 210]\n ]);\n\n // Opciones de la grafica\n var options = {\n chart: {\n title: 'Porcentaje de avance',\n subtitle: 'Cantidad',\n },\n bars: 'vertical',\n vAxis: {\n format: 'decimal'\n },\n height: 400,\n width: 1000,\n colors: ['#ffac19', '#63a537']\n };\n\n // Instancia de la grafica a nivel del html para dibujarla\n var chart = new google.charts.Bar(document.getElementById('chart_div'));\n chart.draw(data, google.charts.Bar.convertOptions(options));\n }","function drawChart() {\n\t\t// get the data from the table\n\t\t$(\".pie-chartify\").each( function(i,e){\n\t\t\tvar id = \"chart-\" + i,\n\t\t\t\tdt = dataTableFromTable( e ),\n\t\t\t\topt = {\n\t\t\t\t\t'pieSliceText': 'none',\n\t\t\t\t\t'tooltip': {\n\t\t\t\t\t\t'text': 'percentage'\n\t\t\t\t\t},\n\t\t\t\t\t'chartArea': {\n\t\t\t\t\t'width': '90%',\n\t\t\t\t\t\t'height': '90%'\n\t\t\t\t\t},\n\t\t\t\t\t'width': 600,\n\t\t\t\t\t'height': 400,\n\t\t\t\t\t'legend': {\n\t\t\t\t\t\tposition: 'labeled'\n\t\t\t\t\t},\n\t\t\t\t\t'fontName': 'Helvetica',\n\t\t\t\t\t'fontSize': 14,\n\t\t\t\t\t\"is3D\": true\n\t\t\t\t},\n\t\t\t\tc;\n\t\t\t$(this).after(\"\");\n\n\t\t\tc = new google.visualization.PieChart(\n\t\t\t\tdocument.getElementById(id)\n\t\t\t);\n\t\t\tc.draw(dt, opt);\n\t\t});\n\t}","function drawChart(pItemSel, pItemHeight, pConfigData, pValuesData, pDefaultConfig) {\n\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"pItemSel\": pItemSel,\n \"pItemHeight\": pItemHeight,\n \"pConfigData\": pConfigData,\n \"pValuesData\": pValuesData,\n \"pDefaultConfig\": pDefaultConfig,\n \"featureDetails\": util.featureDetails\n });\n\n var aTypeCharts = [\"pie\", \"donut\", \"gauge\"];\n var isGauge = false;\n var isPie = false;\n var isDonut = false;\n var specialStr = \"\\u200b\";\n\n // sort pValuesData by Time\n function sortArrByTime(pArr, pFormat) {\n\n function customeSort(pFirstValue, pSecondValue) {\n var parseTime = d3.timeParse(pFormat);\n var fD = parseTime(pFirstValue.x);\n var sD = parseTime(pSecondValue.x);\n return new Date(fD).getTime() - new Date(sD).getTime();\n }\n\n try {\n return pArr.sort(customeSort);\n }\n catch (e) {\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while try sort JSON Array by Time Value\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n }\n\n /* search link from data and set window.location.href */\n function executeLink(pData) {\n var key = specialStr + unescape(pData.id);\n var index = pData.index;\n\n if (seriesData[key]) {\n var seriesObj = seriesData[key];\n if (seriesObj.length === 1) {\n index = 0\n }\n\n if (seriesData[key][index] && seriesData[key][index].link) {\n util.link(seriesData[key][index].link);\n }\n }\n }\n\n try {\n var ownTooltip = false;\n\n var chartTitle = setObjectParameter(pConfigData.chartTitle, pDefaultConfig.d3chart.chartTitle || \"\").toString();\n var background = setObjectParameter(pConfigData.background, pDefaultConfig.d3chart.background);\n var backJSON = null;\n\n if (util.isDefinedAndNotNull(background)) {\n backJSON = {\n color: background\n };\n }\n\n /* line */\n var lineStep = setObjectParameter(pConfigData.lineStep, pDefaultConfig.d3chart.line.step);\n\n /* gauge */\n var gaugeMin = setObjectParameter(pConfigData.gaugeMin, pDefaultConfig.d3chart.gauge.min);\n var gaugeMax = setObjectParameter(pConfigData.gaugeMax, pDefaultConfig.d3chart.gauge.max);\n var gaugeType = setObjectParameter(pConfigData.gaugeType, pDefaultConfig.d3chart.gauge.type);\n var gaugeWidth = setObjectParameter(pConfigData.gaugeWidth, pDefaultConfig.d3chart.gauge.width);\n var gaugeArcMinWidth = setObjectParameter(pConfigData.gaugeArcMinWidth, pDefaultConfig.d3chart.gauge.arcMinWidth);\n var gaugeFullCircle = setObjectParameter(pConfigData.gaugeFullCircle, pDefaultConfig.d3chart.gauge.fullCircle, true);\n var gaugeTitle = setObjectParameter(pConfigData.gaugeTitle, pDefaultConfig.d3chart.gauge.title || \"\").toString();\n\n /* Grid */\n var gridX = setObjectParameter(pConfigData.gridX, pDefaultConfig.d3chart.grid.x, true);\n var gridY = setObjectParameter(pConfigData.gridY, pDefaultConfig.d3chart.grid.y, true);\n\n /* heights */\n var heightXAxis = setObjectParameter(pConfigData.xAxisHeight, pDefaultConfig.d3chart.x.axisHeight);\n\n /* Legend */\n var legendShow = setObjectParameter(pConfigData.legendShow, pDefaultConfig.d3chart.legend.show, true);\n var legendPosition = setObjectParameter(pConfigData.legendPosition, pDefaultConfig.d3chart.legend.position);\n\n /* padding */\n var chartPadding = util.jsonSaveExtend(null, pDefaultConfig.d3chart.padding);\n\n if (util.isDefinedAndNotNull(pConfigData.paddingBottom)) {\n chartPadding.bottom = pConfigData.paddingBottom;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingLeft)) {\n chartPadding.left = pConfigData.paddingLeft;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingRight)) {\n chartPadding.right = pConfigData.paddingRight;\n }\n\n if (util.isDefinedAndNotNull(pConfigData.paddingTop)) {\n chartPadding.top = pConfigData.paddingTop;\n }\n\n /* Axis */\n var rotateAxis = setObjectParameter(pConfigData.rotateAxis, pDefaultConfig.d3chart.rotateAxis, true);\n var axisLabelPosition = setObjectParameter(pConfigData.axisLabelPosition, pDefaultConfig.d3chart.axisLabelPosition);\n\n var xAxisLabelPosition = null;\n var yAxisLabelPosition = null;\n\n switch (axisLabelPosition) {\n case \"inner1\":\n xAxisLabelPosition = \"inner-left\";\n yAxisLabelPosition = \"inner-bottom\";\n break;\n case \"inner2\":\n xAxisLabelPosition = \"inner-center\";\n yAxisLabelPosition = \"inner-middle\";\n break;\n case \"inner3\":\n xAxisLabelPosition = \"inner-right\";\n yAxisLabelPosition = \"inner-top\";\n break;\n case \"outer1\":\n xAxisLabelPosition = \"outer-left\";\n yAxisLabelPosition = \"outer-bottom\";\n break;\n case \"outer2\":\n xAxisLabelPosition = \"outer-center\";\n yAxisLabelPosition = \"outer-middle\";\n break;\n case \"outer3\":\n xAxisLabelPosition = \"outer-right\";\n yAxisLabelPosition = \"outer-top\";\n break;\n default:\n break;\n }\n\n if (rotateAxis) {\n var xAxisLabelPositionTmp = xAxisLabelPosition;\n xAxisLabelPosition = yAxisLabelPosition;\n yAxisLabelPosition = xAxisLabelPositionTmp;\n }\n\n /* tooltip */\n var tooltipShow = setObjectParameter(pConfigData.tooltipShow, pDefaultConfig.d3chart.tooltip.show, true);\n var tooltipGrouped = setObjectParameter(pConfigData.tooltipGrouped, pDefaultConfig.d3chart.tooltip.grouped, true);\n\n /* Transition duration */\n var transitionDuration = setObjectParameter(pConfigData.transitionDuration || pDefaultConfig.d3chart.transitionDuration);\n\n /* x Axis */\n var xShow = setObjectParameter(pConfigData.xShow, pDefaultConfig.d3chart.x.show, true);\n var xLabel = setObjectParameter(pConfigData.xLabel, pDefaultConfig.d3chart.x.label || \"\").toString();\n var xType = setObjectParameter(pConfigData.xType, pDefaultConfig.d3chart.x.type);\n var xAxisTimeFormat = null;\n var xName = null;\n\n /* x ticks */\n var xTickCutAfter = setObjectParameter(pConfigData.xTickCutAfter, pDefaultConfig.d3chart.x.tick.cutAfter);\n var xTickMaxNumber = setObjectParameter(pConfigData.xTickMaxNumber, pDefaultConfig.d3chart.x.tick.maxNumber);\n var xTickRotation = setObjectParameter(pConfigData.xTickRotation, pDefaultConfig.d3chart.x.tick.rotation);\n var xTickMultiline = setObjectParameter(pConfigData.xTickMultiline, pDefaultConfig.d3chart.x.tick.multiline, true);\n var xTickFit = setObjectParameter(pConfigData.xTickFit, pDefaultConfig.d3chart.x.tick.fit, true);\n var xTickAutoRotate = setObjectParameter(pConfigData.xTickAutoRotate, pDefaultConfig.d3chart.x.tick.autoRotate, true);\n var xTickTimeFormat = null;\n\n if (xType == \"category\" || xType == \"timeseries\") {\n xName = \"x\";\n }\n\n if (xType == \"timeseries\") {\n xAxisTimeFormat = setObjectParameter(pConfigData.xTimeFormat, pDefaultConfig.d3chart.x.timeFormat);\n xTickTimeFormat = setObjectParameter(pConfigData.xTickTimeFormat, pDefaultConfig.d3chart.x.tick.timeFormat);\n // sort data because of tooltip index\n sortArrByTime(pValuesData, xAxisTimeFormat);\n }\n\n /* cut string if category names are to long */\n if (xType == \"category\") {\n xTickTimeFormat = function (index, categoryName) {\n return util.cutString(categoryName, xTickCutAfter);\n };\n }\n\n /* y Axis */\n var yLabel = setObjectParameter(pConfigData.yLabel, pDefaultConfig.d3chart.y.label || \"\").toString();\n var yLog = setObjectParameter(pConfigData.yLog, pDefaultConfig.d3chart.y.log, true);\n var yType = null;\n if (yLog) {\n yType = \"log\";\n }\n var yMin = pConfigData.yMin || pDefaultConfig.d3chart.y.min;\n var yMax = pConfigData.yMax || pDefaultConfig.d3chart.y.max;\n var yCulling = pConfigData.yTickMaxNumber || pDefaultConfig.d3chart.y.tick.maxNumber;\n var yUnit = pConfigData.yUnit || pDefaultConfig.d3chart.y.unit;\n\n /* y2 Axis */\n var y2Show = false;\n var y2Label = setObjectParameter(pConfigData.y2Label, pDefaultConfig.d3chart.y2.label || \"\").toString();\n var y2Log = setObjectParameter(pConfigData.y2Log, pDefaultConfig.d3chart.y2.log, true);\n var y2Type = null;\n if (y2Log) {\n y2Type = \"log\";\n }\n var y2Min = setObjectParameter(pConfigData.y2Min, pDefaultConfig.d3chart.y2.min);\n var y2Max = setObjectParameter(pConfigData.y2Max, pDefaultConfig.d3chart.y2.max);\n var y2Culling = setObjectParameter(pConfigData.y2TickMaxNumber, pDefaultConfig.d3chart.y2.tick.maxNumber);\n var y2Unit = setObjectParameter(pConfigData.y2Unit, pDefaultConfig.d3chart.y2.unit);\n\n /* Zoom and Subchart */\n var zoomEnabled = setObjectParameter(pConfigData.zoomEnabled, pDefaultConfig.d3chart.zoom.enabled, true);\n var zoomType = setObjectParameter(pConfigData.zoomType, pDefaultConfig.d3chart.zoom.type);\n var showSubChart = false;\n\n if (zoomEnabled) {\n if (zoomType == \"scroll\") {\n showSubChart = false;\n } else if (zoomType == \"subchart\") {\n showSubChart = true;\n zoomEnabled = false;\n } else if (zoomType == \"drag\") {\n zoomEnabled = true;\n showSubChart = false;\n }\n } else {\n showSubChart = false;\n }\n\n var zoomRescale = setObjectParameter(pConfigData.zoomRescale, pDefaultConfig.d3chart.zoom.rescale, true);\n\n /* Prepare Data for Render */\n var dataArr = [];\n var categoriesArr = [];\n var groupsArr = [];\n var colorsJSON = {};\n var typesJSON = {};\n var axesJSON = {};\n var namesJSON = {};\n var groupJSON = {};\n var seriesCnt = 0;\n var seriesData = util.groupObjectArray(pValuesData, 'seriesID');\n\n if (seriesData) {\n /* Add Categories or time values to x Axis when correct type is set */\n if (xType == \"category\" || xType == \"timeseries\") {\n categoriesArr.push(\"x\");\n var xCatObj = util.groupObjectArray(pValuesData, \"x\");\n var xCatArr = Object.keys(xCatObj);\n\n $.each(xCatArr, function (dIdx, dataValues) {\n categoriesArr.push((setObjectParameter(dataValues.replace(specialStr, \"\"), null)));\n });\n }\n\n dataArr.push(categoriesArr);\n\n /* Transform data for billboard.js */\n $.each(seriesData, function (idx, seriesData) {\n var series;\n seriesCnt++;\n if (seriesData[0] && seriesData[0].seriesID) {\n series = seriesData[0];\n var dataKey = escape(series.seriesID);\n colorsJSON[dataKey] = series.color;\n typesJSON[dataKey] = series.type;\n\n /* check if atypechart*/\n if (aTypeCharts.indexOf(series.type) >= 0) {\n zoomEnabled = false;\n }\n\n if (series.type === \"gauge\") {\n isGauge = true;\n }\n\n if (series.type === \"pie\") {\n isPie = true;\n }\n\n if (series.type === \"donut\") {\n isDonut = true;\n }\n\n if (util.isDefinedAndNotNull(series.tooltip)) {\n ownTooltip = true;\n }\n\n axesJSON[dataKey] = (series.yAxis || \"y\");\n if (util.isDefinedAndNotNull(series.groupID)) {\n var groupID = escape(series.groupID.toString());\n if (groupJSON[groupID]) {\n groupJSON[groupID].push(dataKey);\n } else {\n groupJSON[groupID] = [];\n groupJSON[groupID].push(dataKey);\n }\n }\n\n if (series.yAxis == \"y2\") {\n y2Show = true;\n }\n namesJSON[dataKey] = (setObjectParameter(series.label, dataKey));\n\n var arr = [];\n arr.push(dataKey);\n if (xType == \"category\" || xType == \"timeseries\") {\n $.each(xCatObj, function (dIdx, dataValues) {\n var setValueY = null;\n var setValueZ = null;\n $.each(dataValues, function (sIDx, sDataValues) {\n if (escape(sDataValues.seriesID) == dataKey) {\n setValueY = sDataValues.y;\n if (sDataValues.z) {\n setValueZ = sDataValues.z;\n }\n }\n });\n if (setValueZ !== null) {\n arr.push({\n \"y\": setValueY,\n \"z\": setValueZ\n });\n } else {\n arr.push(setValueY);\n }\n });\n } else {\n $.each(seriesData, function (dIdx, dataValues) {\n var setValueY = setObjectParameter(dataValues.y, null);\n if (dataValues.z) {\n var setValueZ = dataValues.z;\n arr.push({\n \"y\": setValueY,\n \"z\": setValueZ\n });\n } else {\n arr.push(setValueY);\n }\n });\n }\n\n dataArr.push(arr);\n\n } else {\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"No seriesID found in seriesID Cursor\",\n \"featureDetails\": util.featureDetails\n });\n }\n\n });\n\n /* Group JSON to Array */\n $.each(groupJSON, function (dIdx, jsonObj) {\n groupsArr.push(jsonObj);\n });\n\n /* Labels and Datapoints */\n var dataLabels = setObjectParameter(pConfigData.showDataLabels, pDefaultConfig.d3chart.showDataLabels, true);\n\n if (isPie || isDonut) {\n dataLabels = {\n colors: \"white\"\n };\n } else if (isGauge) {\n dataLabels = {\n colors: (gaugeType === \"single\" && seriesCnt > 1) ? \"white\" : \"inherit\"\n };\n }\n var showDataPoints = setObjectParameter(pConfigData.showDataPoints, pDefaultConfig.d3chart.showDataPoints, true);\n\n var showAbsoluteValues = setObjectParameter(pConfigData.showAbsoluteValues, pDefaultConfig.d3chart.showAbsoluteValues);\n var absoluteFormatting;\n\n if (showAbsoluteValues) {\n absoluteFormatting = function (value, ratio, id) {\n return value + yUnit;\n }\n }\n\n var ttContent;\n if (ownTooltip) {\n ttContent = function (d) {\n var div = $(\"\");\n div.addClass(\"bb-tooltip\");\n div.addClass(\"bida-chart-tooltip-custome\");\n $.each(d, function (i, pData) {\n var key = specialStr + unescape(pData.id);\n var index = pData.index;\n\n if (seriesData[key]) {\n var seriesObj = seriesData[key];\n if (seriesObj.length === 1) {\n index = 0\n }\n if (seriesData[key][index] && util.isDefinedAndNotNull(seriesData[key][index].tooltip)) {\n var ttS = seriesData[key][index].tooltip;\n if (pRequireHTMLEscape !== false) {\n ttS = util.escapeHTML(ttS);\n }\n div.append(ttS);\n div.append(\"\");\n }\n }\n });\n return div[0].outerHTML;\n }\n }\n\n try {\n var chartContIDSel = pItemSel + \"bbc\";\n var chartContID = chartContIDSel.replace(\"#\", \"\");\n var chartCont = $(\"\");\n chartCont.attr(\"id\", chartContID);\n\n $(pItemSel).append(chartCont);\n\n var bbData = {\n bindto: chartContIDSel,\n background: backJSON,\n title: {\n text: chartTitle\n },\n size: {\n height: pItemHeight\n },\n data: {\n x: xName,\n xFormat: xAxisTimeFormat,\n columns: dataArr,\n types: typesJSON,\n groups: groupsArr,\n colors: colorsJSON,\n labels: dataLabels,\n axes: axesJSON,\n names: namesJSON,\n onclick: function (pData) {\n executeLink(pData);\n }\n },\n pie: {\n label: {\n format: absoluteFormatting,\n threshold: 0.05\n }\n },\n donut: {\n label: {\n format: absoluteFormatting,\n threshold: 0.05\n }\n },\n line: {\n step: {\n type: lineStep\n }\n },\n gauge: {\n label: {\n format: absoluteFormatting,\n threshold: (gaugeType === \"single\") ? 0.05 : null\n },\n fullCircle: gaugeFullCircle,\n min: gaugeMin,\n max: gaugeMax,\n type: gaugeType,\n width: gaugeWidth,\n title: gaugeTitle,\n arc: {\n minWidth: gaugeArcMinWidth\n }\n },\n radar: {\n direction: {\n clockwise: true\n }\n },\n subchart: {\n show: showSubChart\n },\n zoom: {\n type: zoomType,\n enabled: zoomEnabled,\n rescale: zoomRescale\n },\n transition: {\n duration: transitionDuration\n },\n legend: {\n show: legendShow,\n position: legendPosition\n },\n tooltip: {\n show: tooltipShow,\n grouped: tooltipGrouped,\n contents: ttContent\n },\n grid: {\n x: {\n show: gridX,\n },\n y: {\n show: gridY\n }\n },\n point: {\n show: showDataPoints\n },\n axis: {\n rotated: rotateAxis,\n x: {\n show: xShow,\n label: {\n text: xLabel,\n position: xAxisLabelPosition\n },\n type: xType,\n tick: {\n culling: {\n max: xTickMaxNumber\n },\n autorotate: xTickAutoRotate,\n rotate: xTickRotation,\n multiline: xTickMultiline,\n format: xTickTimeFormat,\n fit: xTickFit\n },\n height: heightXAxis\n },\n y: {\n label: {\n text: yLabel,\n position: yAxisLabelPosition\n },\n type: yType,\n max: yMax,\n min: yMin,\n tick: {\n culling: {\n max: yCulling\n },\n format: function (d) {\n return d + yUnit\n }\n }\n },\n y2: {\n show: y2Show,\n label: {\n text: y2Label,\n position: yAxisLabelPosition\n },\n type: y2Type,\n max: y2Max,\n min: y2Min,\n tick: {\n culling: {\n max: y2Culling\n },\n format: function (d) {\n return d + y2Unit\n }\n }\n }\n },\n padding: chartPadding\n };\n\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"finalChartData\": bbData,\n \"featureDetails\": util.featureDetails\n });\n\n var chart = bb.generate(bbData);\n\n /* reset zoom on right click */\n if (zoomEnabled) {\n $(chartContIDSel).contextmenu(function (evt) {\n evt.preventDefault();\n chart.unzoom();\n });\n }\n\n /* execute resize */\n function resize() {\n if (!document.hidden && chartCont.is(\":visible\")) {\n chart.resize({\n height: pItemHeight\n });\n }\n }\n\n // bind resize events\n $(window).resize(function () {\n resize();\n });\n\n /* dirty workaround because in APEX sometimes chart renders in wrong size hope apexDev Team will bring us layout change events also for tabs, collapsible so on */\n function stopResizeWA() {\n if (timers.innerItemsIntervals && timers.innerItemsIntervals[pItemSel]) {\n clearInterval(timers.innerItemsIntervals[pItemSel]);\n }\n }\n\n function startResizeWA() {\n timers.innerItemsIntervals[pItemSel] = setInterval(function () {\n if ($(pItemSel).length === 0) {\n clearInterval(timers.innerItemsIntervals[pItemSel]);\n } else {\n if (chartCont.is(\":visible\")) {\n if (!util.isBetween(chartCont.width(), chartCont.find(\"svg\").width(), resizeRange)) {\n apex.debug.info({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Chart has resize problem\",\n \"featureDetails\": util.featureDetails\n });\n resize();\n }\n\n }\n }\n }, timers.defTime);\n }\n\n stopResizeWA();\n startResizeWA();\n\n /* stop when tab is not active */\n document.addEventListener(\"visibilitychange\", function () {\n if (document.hidden) {\n stopResizeWA();\n } else {\n startResizeWA();\n }\n });\n\n } catch (e) {\n $(pItemSel).empty();\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while try to render chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n } else {\n util.noDataMessage.show(pItemSel, pDefaultConfig.noDataMessage);\n }\n } catch (e) {\n $(pItemSel).empty();\n util.errorMessage.show(pItemSel, pDefaultConfig.errorMessage);\n apex.debug.error({\n \"fct\": util.featureDetails.name + \" - \" + \"drawChart\",\n \"msg\": \"Error while prepare data for chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n });\n }\n }","function drawChart4() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'InstallationDate');\n data.addColumn('number', 'Number of Meters');\n data.addRows(installationsPerDate());\n\n // Set chart options\n var options = {\n 'title': 'Installations Per Date',\n 'width': 250,\n 'height': 200,\n };\n\n // Instantiate and draw our chart, passing in some options.\n // var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n var chart = new google.visualization.PieChart(document.getElementById('chart_div4'));\n chart.draw(data, options);\n}","drawCanvas(arrData) {\n const W = +this.elements.$tags.contentWrap.getBoundingClientRect().width;\n const H = +this.panel.svgHeight;\n const dateFrom = this.range.from.clone();\n const dateTo = this.range.to.clone();\n\n // область визуализации с данными (график)\n const margin = this.elements.sizes.marginAreaVis;\n const widthAreaVis = W - margin.left - margin.right;\n const heightAreaVis = H - margin.top - margin.bottom;\n const heightRowBar = parseInt(heightAreaVis / arrData.length, 10);\n\n const xScaleDuration = d3.scaleTime()\n .domain([0, new Date(dateTo).getTime() - new Date(dateFrom).getTime()])\n .range([0, widthAreaVis]);\n\n const xScaleTime = d3.scaleTime()\n .domain([new Date(dateFrom).getTime(), new Date(dateTo).getTime()])\n .range([0, widthAreaVis]);\n\n const canvasElement = d3.select(document.createElement('canvas'))\n .datum(arrData) // data binding\n .attr('width', widthAreaVis)\n .attr('height', heightAreaVis);\n\n const context = canvasElement.node().getContext('2d');\n\n // clear canvas\n context.fillStyle = 'rgba(0,0,0, 0)';\n context.rect(0, 0, canvasElement.attr('width'), canvasElement.attr('height'));\n context.fill();\n\n let top = 0;\n const sizeDiv = 1; // dividing line\n\n _.forEach(arrData, (changes, i, arr) => {\n _.forEach(changes, (d) => {\n context.beginPath();\n context.fillStyle = d.color;\n context.rect(\n xScaleTime(d.start) < 0 ? 0 : xScaleTime(d.start),\n top, xScaleDuration(d.ms),\n arr.length - 1 !== i ? heightRowBar - sizeDiv : heightRowBar,\n );\n context.fill();\n context.closePath();\n });\n\n top += heightRowBar;\n });\n return canvasElement.node();\n }","function drawChart() {\r\n\r\n // Create the data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Country');\r\n data.addColumn('number', 'Population');\r\n data.addColumn('number', 'Area');\r\n data.addColumn('number', 'Occupancy');\r\n data.addRows([\r\n [cdata.name, cdata.population,cdata.area,(cdata.area/cdata.population)]\r\n \r\n \r\n ]);\r\n\r\n // Set chart options\r\n var options = {'title':'Population Area Ratio of '+cdata.name,\r\n 'width':250,\r\n 'height':300};\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.BarChart(document.getElementById('bc1'));\r\n chart.draw(data, options);\r\n }","function drawChart() {\n const canvas = document.createElement('canvas');\n let data = [];\n let min = Infinity;\n let max = 0;\n for (let i = 0; i < TIMINGS.length; i++) {\n let series = TIMINGS[i];\n min = Math.min(min, Math.min(...series));\n max = Math.max(max, Math.max(...series));\n }\n\n for (let i = 0; i < TIMINGS.length; i++) {\n let series = TIMINGS[i];\n data.push({\n data: bellCurvify(series, min, max),\n label: getFileName(PATHS[i]),\n\n borderColor: COLORS[i % COLORS.length],\n fill: false\n });\n }\n const context = canvas.getContext('2d');\n let labels = [];\n for (let i = min; i <= max; i++) {\n labels.push('' + i);\n }\n document.body.appendChild(canvas);\n new Chart(context, {\n type: 'line',\n data: {\n labels: labels,\n datasets: data\n },\n options: {}\n });\n}","function drawChart() {\n ctx.beginPath();\n ctx.strokeStyle = \"blue\";\n var firstElement = true;\n ctx.font = \"10px sans-serif\";\n //plot each entry if it is in the range\n for (let entry of entries) {\n //check if entry is in the range of xmin and xmax, otherwise ignore it\n if (entry.date > xMin && entry.date < xMax) {\n //calculate location of pace coordinate\n let m = entry.getMin();\n let s = entry.getSec();\n let paceLocation = (m * 4) + (s / 15);\n\n //calculate location of date coordinate\n //plan - we have 60 blocks of usable space, can get date in ms with getTime()\n //range=xmax-min\n //value=date-xmin\n //value=value*60blocks\n let xRange = xMax.getTime() - xMin.getTime();\n let dateLocation = (entry.date.getTime() - xMin.getTime());\n dateLocation = ((dateLocation / xRange) * 60) + 5;//add 5 for axis offset\n ctx.strokeText(m + \":\" + s + \" \", blocks(dateLocation), blocks(40 - paceLocation - 1));\n \n //start at this first element\n if (firstElement) { ctx.moveTo(blocks(dateLocation), blocks(40 - paceLocation)); }\n\n //connect remaining data points\n ctx.lineTo(blocks(dateLocation), blocks(40 - paceLocation));\n ctx.arc(blocks(dateLocation), blocks(40 - paceLocation), 2, 0, Math.PI * 2, true);\n firstElement = false;\n }\n }\n ctx.font = \"12px sans-serif\";\n ctx.stroke();\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Color');\n data.addColumn('number', 'Ranking');\n\n data.addRows(graphData);\n\n // Set chart options\n var options = {\n title: 'T-Shirt Rankings',\n height: 600,\n legend: {position: 'none'},\n vAxis: {format:'#'}\n };\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n\n\t// Create the data table.\n\tvar data = new google.visualization.DataTable();\n\tdata.addColumn('string', 'Topping');\n\tdata.addColumn('number', 'Amt In Dollars');\n\tdata.addRows([\n\t [names.name1, values.expenseNameOne],\n\t [names.name2, values.expenseNameTwo],\n\t [names.name3, values.expenseNameThree],\n\t [names.name4, values.expenseNameFour],\n\t [names.name5, values.expenseNameFive]\n\t]);\n\n\t// Set chart options\n\tvar options = {'title':'MY EXPENSES',\n\t\t\t\t 'width':800,\n\t\t\t\t 'height':500};\n\n\t// Instantiate and draw our chart, passing in some options.\n\tvar chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n\tchart.draw(data, options);\n }","function drawChart() {\r\n\r\n // Create the data table.\r\n var data = new google.visualization.DataTable();\r\n data.addColumn('string', 'Country');\r\n data.addColumn('number', 'Population');\r\n data.addColumn('number', 'Area');\r\n data.addColumn('number', 'Occupancy');\r\n data.addRows([\r\n [countrydata.name, countrydata.population,countrydata.area,(countrydata.area/countrydata.population)]\r\n \r\n \r\n ]);\r\n\r\n // Set chart options\r\n var options = {'title':'Population Area Ratio of '+countrydata.name,\r\n 'width':250,\r\n 'height':300};\r\n\r\n // Instantiate and draw our chart, passing in some options.\r\n var chart = new google.visualization.ColumnChart(document.getElementById('bc2'));\r\n chart.draw(data, options);\r\n }","function drawChart1() {\n\n // Create the data table.\n var data1 = new google.visualization.DataTable();\n data1.addColumn('string', 'nombre');\n data1.addColumn('number', 'cantidad');\n data1.addRows(render);\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por escuela sede: '+sede,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data1, options1);\n\n }","function drawChart(x1, y1, x2, y2, x3, y3) {\n var data1 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x1],\n ['Absent', y1],\n ]);\n var data2 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x2],\n ['Absent', y2],\n ]);\n var data3 = google.visualization.arrayToDataTable([\n ['Attendance', 'Count'],\n ['Present', x3],\n ['Absent', y3],\n ]);\n\n // Display the chart inside the
element with id=\"piechart\"\n var chart1 = new google.visualization.PieChart(document.getElementById('piechart1'));\n var chart2 = new google.visualization.PieChart(document.getElementById('piechart2'));\n var chart3 = new google.visualization.PieChart(document.getElementById('piechart3'));\n chart1.draw(data1);\n chart2.draw(data2);\n chart3.draw(data3);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Category');\n data.addColumn('number', 'Amount');\n data.addRows(myData);\n\n // Set chart options\n var options = {'width':500,\n 'height':400};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function DrawClicksChart()\n{\n // create/delete rows \n if (clicksTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - clicksTable.getNumberOfRows();\n clicksTable.addRows(numRows);\n } else {\n for(var i=(clicksTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n clicksTable.removeRow(i); \n }\n }\n\n // Populate data table with time/clicks data points. \n for(var i=0; i < clicksTable.getNumberOfRows(); i++)\n {\n clicksTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n clicksTable.setCell(i, 1, parseInt(aggrDataPoints[i].clicks));\n }\n\n // Draw line chart.\n chartOptions.title = 'Clicks Chart';\n clicksChart.draw(clicksView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Day');\n data.addColumn('number', 'Hours');\n data.addRows([\n ['Sunday', 166860],\n ['Monday', 91133.5],\n ['Tuesday', 91133.5],\n ['Wednesday', 91133.5],\n ['Thursday', 91133.5],\n ['Friday', 91133.5],\n ['Saturday', 94222],\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Hours of free parking per day of the week',\n 'width': 300,\n 'height': 150,\n pieHole: .4\n };\n\n // Instantiate and draw our chart, passing in some options.\n // var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart(data,Container,width,height,arrBuckets,props) {\n\n// alert(\"Drawing chart\");\n\n var csvfile = arrBuckets.timeline.title + \",\" + arrBuckets.value.title + '\\n';\n \n var dataValues = d3.map(data, function(d,i) {csvfile += d.timeline+ \",\" + d.value + '\\n';\n return d.timeline + \",\" + d.value;});\n \n var chartDiv = document.getElementById(Container[0][0].id);\n var win = window\n , doc = document\n , ele = doc.documentElement\n , bdy = doc.getElementsByTagName(\"body\")[0]\n , screenWidth = screen.width;\n\n var main_margin = {top: 15, right: 15, bottom: 15, left: 15};\n\n chartDiv.style.top = main_margin.top + \"px\";\n chartDiv.style.left = main_margin.left + \"px\";\n chartDiv.style.width = width - main_margin.left - main_margin.right + \"px\";\n chartDiv.style.height = height - main_margin.top - main_margin.bottom + \"px\";\n\n mygraph = new Dygraph(\n chartDiv,\n csvfile, // CSV file\n props\n );\n\n}","function DrawRevenueChart()\n{\n // create/delete rows \n if (revenueTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - revenueTable.getNumberOfRows();\n revenueTable.addRows(numRows);\n } else {\n for(var i=(revenueTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n revenueTable.removeRow(i); \n }\n }\n\n // Populate data table with time/revenue data points. \n for(var i=0; i < revenueTable.getNumberOfRows(); i++)\n {\n revenueTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n revenueTable.setCell(i, 1, parseFloat(aggrDataPoints[i].revenue));\n }\n\n // Draw line chart.\n chartOptions.title = 'Revenue Chart';\n revenueChart.draw(revenueView, chartOptions); \n}","function drawChart() {\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Weather Element');\n data.addColumn('number', 'Dec');\n data.addColumn('number', 'Feb');\n data.addColumn('number', 'Jan');\n data.addColumn('number', 'Nov');\n data.addColumn('number', 'Oct');\n data.addColumn('number', 'Sep');\n\n data.addRows([\n ['Snow - Heavy', 6,0,2,2,0,0],\n ['Snow - Light', 2,0,0,0,0,0],\n ['Snow - Normal', 4,0,2,0,0,0]\n ]);\n\n var options = {\n 'title': 'Snowy Weather by Months',\n 'width': 500,\n 'height': 600,\n 'isStacked': true};\n \n var chart = new google.visualization.ColumnChart(document.getElementById('chart_div2'));\n chart.draw(data, options);\n }","function drawChart() { \n var data =window.google.visualization.arrayToDataTable([\n ['Location', 'Pending Request','Approved Request'],\n ['Bangalore', 8,10],\n ['Gurgaon', 2,12],\n ['Chennai', 4,2],\n ['UK', 2,8],\n ]);\n var options = {'width':500, 'height':300};\n var chart = new window.google.visualization.PieChart(document.getElementById(self.props.id));\n chart.draw(data, options); \n }","function DrawRAMChart()\n{\n // create/delete rows \n if (ramTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - ramTable.getNumberOfRows();\n ramTable.addRows(numRows);\n } else {\n for(var i=(ramTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n ramTable.removeRow(i); \n }\n }\n\n // Populate data table with time/ram data points. \n for(var i=0; i < ramTable.getNumberOfRows(); i++)\n {\n ramTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n ramTable.setCell(i, 1, parseFloat(aggrDataPoints[i].ram));\n }\n\n // Draw line chart.\n chartOptions.title = 'RAM Usage (%)';\n ramChart.draw(ramView, chartOptions); \n}","function DrawCostChart()\n{\n // create/delete rows \n if (costTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - costTable.getNumberOfRows();\n costTable.addRows(numRows);\n } else {\n for(var i=(costTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n costTable.removeRow(i); \n }\n }\n \n // Populate data table with time/cost data points. \n for(var i=0; i < costTable.getNumberOfRows(); i++)\n {\n //if(parseFloat(aggrDataPoints[i].cost) < 500) continue;\n costTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n costTable.setCell(i, 1, parseFloat(aggrDataPoints[i].cost));\n }\n\n // Draw line chart.\n chartOptions.title = 'Cost Chart';\n costChart.draw(costView, chartOptions); \n}","function drawChart() {\n console.log(\"drawChart ran\");\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Day');\n data.addColumn('number', 'Temperature');\n var i = 0;\n /*Loops through the days of the week and for each\n day there is weather info it adds a row */\n for (i = 0; i < days_of_the_week.length; i++) {\n if (day_and_temp_map.has(days_of_the_week[i])) {\n data.addRow([days_of_the_week[i], day_and_temp_map.get(days_of_the_week[i])]);\n }\n }\n\n // Set chart options\n var options = {\n 'title': 'Weather forecast chart',\n 'width': 500,\n 'height': 300\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.BarChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function DrawMarginChart()\n{\n // create/delete rows \n if (marginTable.getNumberOfRows() < contDataPoints.length)\n { \n var numRows = contDataPoints.length - marginTable.getNumberOfRows();\n marginTable.addRows(numRows);\n } else {\n for(var i=(marginTable.getNumberOfRows()-1); i > contDataPoints.length; i--)\n {\n marginTable.removeRow(i); \n }\n }\n\n // Populate data table with time/cost data points. \n for(var i=0; i < marginTable.getNumberOfRows(); i++)\n {\n marginTable.setCell(i, 0, new Date(parseInt(contDataPoints[i].timestamp)));\n marginTable.setCell(i, 1, (parseFloat(contDataPoints[i].cost)-parseFloat(contDataPoints[i].revenue))/parseFloat(contDataPoints[i].revenue));\n }\n\n // Draw line chart.\n chartOptions.title = 'Margin Chart';\n marginChart.draw(marginView, chartOptions); \n}","function drawChart() {\n details.html('');\n wrap.html('');\n\n svg = wrap.append('svg')\n .attr('width', width + margin.left + margin.right)\n .attr('height', height + margin.top + margin.bottom);\n\n change = details.append('div').attr('class', 'change');\n range = details.append('div').attr('class', 'range');\n showHigh = range.append('span').attr('class', 'high');\n showLow = range.append('span').attr('class', 'low');\n volume = details.append('div').attr('class', 'volume');\n\n bg = svg.append('rect')\n .attr('width', width + margin.left + margin.right)\n .attr('height', height + margin.top + margin.bottom)\n .style({opacity: 0});\n\n pointer = svg.append('path')\n .attr('class', 'pointer')\n .attr('d', 'M 0 0 L 7 -7 L 40 -7 L 40 7 L 7 7 L 0 0')\n .attr('transform', 'translate(' +\n (width + margin.left) + ',' +\n (height + margin.top) + ')');\n\n svg.append('rect').attr('width', width + margin.left + margin.right)\n .attr('class', 'timeBackground')\n .attr('height', margin.bottom)\n .attr('transform', 'translate(0,' + (height + margin.top) + ')');\n\n gEnter = svg.append('g')\n .attr('transform', 'translate(' + margin.left + ',' + margin.top + ')');\n\n gEnter.append('g').attr('class', 'grid');\n gEnter.append('path').attr('class', 'line');\n\n gEnter.append('g').attr('class', 'x axis');\n gEnter.append('g').attr('class', 'price axis')\n .attr('transform', 'translate(' + width + ', 0)');\n\n flipping = false;\n flip = svg.append('g').attr('class', 'flip')\n .attr('width', margin.right)\n .attr('height', margin.bottom)\n .attr('transform', 'translate(' +\n (width + margin.left) + ',' +\n (height + margin.top) + ')')\n .on('click', function() {\n d3.event.stopPropagation();\n flipping = true;\n\n dropdownA.selected(self.counter);\n dropdownB.selected(self.base);\n dropdowns.selectAll('div').remove();\n\n dropdowns.append('div')\n .attr('class', 'base dropdowns')\n .attr('id', 'base' + self.index)\n .call(dropdownA);\n\n dropdowns.append('div')\n .attr('class', 'counter dropdowns')\n .attr('id', 'quote' + self.index)\n .call(dropdownB);\n\n self.load();\n\n flipping = false;\n\n if (markets.options.fixed) {\n header.html('' +\n getName(self.base.issuer, self.base.currency) +\n '' + baseCurrency + '/' +\n counterCurrency + '' +\n getName(self.counter.issuer, self.counter.currency) +\n '');\n }\n });\n\n flip.append('rect')\n .attr({\n width: margin.right,\n height: margin.bottom\n });\n\n flip.append('text').text('Flip')\n .attr({\n 'text-anchor': 'middle',\n y: margin.bottom * 4 / 5,\n x: margin.right / 2\n });\n\n horizontal = gEnter.append('line')\n .attr('class', 'horizontal')\n .attr({x1: 0, x2: width})\n .attr('transform', 'translate(0,' + height + ')');\n lastPrice = gEnter.append('text')\n .attr('class', 'lastPrice')\n .style('text-anchor', 'middle')\n .attr('x', (width + margin.left) / 2);\n }","function drawChart(percentagesByDay) {\n // Load the Visualization API and the appropriate packages, setting a callback\n // to run when the API is loaded.\n google.load('visualization', '1.0', {'packages':['corechart']});\n google.setOnLoadCallback(function() {\n drawChartCallback(percentagesByDay);\n });\n}","function DrawCPUChart()\n{\n // create/delete rows \n if (cpuTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - cpuTable.getNumberOfRows();\n cpuTable.addRows(numRows);\n } else {\n for(var i=(cpuTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n cpuTable.removeRow(i); \n }\n }\n \n // Populate data table with time/cpu data points. \n for(var i=0; i < cpuTable.getNumberOfRows(); i++)\n {\n //if(parseFloat(aggrDataPoints[i].cpu) < 500) continue;\n cpuTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n cpuTable.setCell(i, 1, parseFloat(aggrDataPoints[i].cpu));\n }\n\n // Draw line chart.\n chartOptions.title = 'CPU Usage (%)';\n cpuChart.draw(cpuView, chartOptions); \n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Slices');\n data.addRows([\n ['Tricipital', parseInt(document.getElementById('tricipital').value, 10)],\n ['subescapular', parseInt(document.getElementById('subescapular').value, 10)],\n ['suprailiaca', parseInt(document.getElementById('suprailiaca').value, 10)],\n ['abdominal', parseInt(document.getElementById('abdominal').value, 10)],\n ['quadriceps', parseInt(document.getElementById('quadriceps').value, 10)]\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Percentual de dobras cutâneas em mm³',\n 'margin': 0,\n 'padding': 0,\n 'width': 450,\n 'height': 350\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","function drawchart() {\r\n const filters = getFilters();\r\n const drawData = filterData(\r\n filters[\"startDate\"],\r\n filters[\"endDate\"],\r\n filters[\"provincesFilter\"]\r\n );\r\n timeLapseChart = new TimeLapseChart(\"timelapse-chart\");\r\n timeLapseChart\r\n .setTitle(\"COVID-19 ARGENTINA - EVOLUCIÓN EN EL TIEMPO\")\r\n .setColumnsStyles(columnNames)\r\n .addDatasets(drawData)\r\n .render();\r\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Activity');\n data.addColumn('number', 'Completed');\n data.addRows([\n ['Courses', 3],\n ['Posts', 1],\n ['Job Offers', 1],\n ['Tutorials', 1],\n ['Projects', 2]\n ]);\n\n // Set chart options\n var options = {\n 'title': 'Your activity on Udabuddy',\n 'width': '100%',\n 'height': '100%'\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.ColumnChart(document.getElementById(\n 'chart_div'));\n chart.draw(data, options);\n }","function drawChart() {\n\t var data = google.visualization.arrayToDataTable([\n\t ['Tool', 'Rating'],\n\t ['Visual Studio', 5],\n\t ['Eclipse', 3],\n\t ['Notepad++', 2],\n\t \n\t \n\t]);\n\n\t // Optional; add a title and set the width and height of the chart\n\t var options = { 'width':'94%', 'height':250,\n\t\tcolors: ['#e81e68', '#999999','#efefef'],\n\t\tis3D: true,\n\t\tbackgroundColor: 'rgb(24,27,46)',\n\t\tlegend: {textStyle: {color: 'white'},position:'bottom'}\n\t\t};\n\n\t // Display the chart inside the
element with id=\"piechart\"\n\t var chart = new google.visualization.PieChart(document.getElementById('codetool'));\n\t chart.draw(data, options);\n\t}","function drawChart(idgraph) {\n\n \tvar myData;\n \t\n \t// Create the data table.\n\tvar typeChart = $('#type-select').children(':selected').attr('id');\n\tvar options;\n\tvar chart;\n\tswitch(typeChart) {\n\t\tcase \"scatter\" :\n\t\t\toptions = {\n\t\t\t\ttitle: X + ' vs. ' + Y,\n\t\t\t\twidth: 800,\n\t\t\t\theight: 480,\n\t\t\t\ttitleX: X,\n\t\t\t\ttitleY: Y,\n\t\t\t\tlegend: 'none',\n\t\t\t\tpointSize: 5\n\t\t\t};\n\t\t\tmyData = JSONextractNumber(X,Y,activeData);\n\t\t\tchart = new google.visualization.ScatterChart(document.getElementById(idgraph));\t\t\t\n\t\t\tbreak;\n\t\tcase \"bar\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractString(X,Y,activeData);\n\t\t\tchart = new google.visualization.BarChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"column\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractSort(X,Y,activeData);\n\t\t\tchart = new google.visualization.ColumnChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"line\" : \n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractSort(X,Y,activeData);\n\t\t\tchart = new google.visualization.LineChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tcase \"pie\" :\n\t\t\toptions = {\n\t\t\t title: X + ' vs. ' + Y,\n\t\t\t vAxis: {title: X, titleTextStyle: {color: 'red'}},\n\t\t\t hAxis: {title: Y, titleTextStyle: {color: 'red'}},\n\t\t\t width: 800,\n\t\t\t height: 480\n\t\t\t};\n\t\t\tmyData = JSONextractCount(X,activeData);\n\t\t\tchart = new google.visualization.PieChart(document.getElementById(idgraph));\n\t\t\tbreak;\n\t\tdefault : \n\t\t\tbreak;\n\t}\n\n var data = google.visualization.arrayToDataTable(myData);\n chart.draw(data, options);\n\n}","function ChartsBarchart() {\n}","function drawChart(){\n\n\tdataTable = new google.visualization.DataTable(data);\n\toptions.hAxis.ticks = dataTable.getDistinctValues(0);\n\n\tview = new google.visualization.DataView(dataTable);\n\t\n\toptions['series'] = Series();\n options['selectionMode'] = 'multiple';\n options['tooltip'] = {\n 'isHtml': true,\n trigger: 'both'\n }\n\n\tchart = new google.visualization.LineChart(document.getElementById(containerId));\n\n\tchart.draw(view, options);\n\n\t//google.visualization.drawChart({\n\t//\t\"containerId\": containerId,\n\t//\t\"chartType\": chartType,\n\t//\t\"options\": options,\n\t//\t\"dataTable\": data,\n\t//\t\"view\": view\n\t//})\n}","function drawChart() {\n\t\n\n\t// Create our data table.\n\tjQuery.getJSON('/data/stats.json', function(stat_data) {\n\t\t\n\t\tjQuery.each(stat_data.entries, function(num, chart_info){\n\t\t\t\n\t\t\tvar data = new google.visualization.DataTable();\n\t\t\t\n\t\t\tif (chart_info.chart_type == \"Pie chart\"){\n\n\t\t\t\tdata.addColumn('string', chart_info.column_label);\n\t\t\t\tdata.addColumn('number', chart_info.numeric_label);\n\t\t\t\n\t\t\t\tdata.addRows(chart_info.stats.length);\n\t\t\t\n\t\t\t\tfor (var i=0; i < chart_info.stats.length; i++){\n\t\t\t\t\tfor(var j=0; j < chart_info.stats[i].length; j++){\n\t\t\t\t\t\tdata.setValue(i, j, chart_info.stats[i][j]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\tvar chart = new google.visualization.PieChart(document.getElementById(chart_info.chart_div));\n\t\t\t\tchart.draw(data, {width: 750, height: 500, title: chart_info.chart_title});\n\t\t\t\t\n\t\t\t}\n\t\t\telse{\n\t\t\t\t\n\t\t\t\tdata.addColumn('string', 'Sectors');\n\t\t\t for (var i = 0; i < chart_info.stats.length; ++i) {\n\t\t\t data.addColumn('number', chart_info.stats[i][0]); \n\t\t\t }\n\n\n\t\t\t data.addRows(chart_info.axis_labels.length);\n\n\t\t\t for (var j = 0; j < chart_info.axis_labels.length; ++j) { \n\t\t\t data.setValue(j, 0, chart_info.axis_labels[j]); \n\t\t\t }\n\t\t\t\n\t\t\t for (var i = 0; i < chart_info.stats.length; ++i) {\n\t\t\t for (var j = 1; j < chart_info.stats[i].length; ++j) {\n\t\t\t data.setValue(j-1, i+1, chart_info.stats[i][j]); \n\t\t\t }\n\t\t\t }\n\t\t\t\n\t\t\t\t\n\t\t\t\tif (chart_info.chart_type == \"Vertical bar chart\"){\n\t\t\t\t\tvar chart = new google.visualization.ColumnChart(document.getElementById(chart_info.chart_div));\n\t\t\t\t\tchart.draw(data,{width: \"100%\", height: 700, title: chart_info.chart_title, vAxis: {title: \"NGOs\"}, hAxis: {title: \"Sectors\"}});\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tvar chart = new google.visualization.BarChart(document.getElementById(chart_info.chart_div));\n\t\t\t\t\tchart.draw(data,{width: \"100%\", height: 700, title: chart_info.chart_title, vAxis: {title: \"Sectors\"}, hAxis: {title: \"NGOs\"}});\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\n\t\t});\n\t\t\n\t\t\n\t});\n\t\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Topping');\n data.addColumn('number', 'Value');\n data.addRows([\n ['', 3],\n ]);\n\n // Set chart options\n var options = {'title':'Parameter #1',\n 'width':'100%',\n 'height': 105,\n 'backgroundColor': { fill:'transparent' }};\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.BarChart(document.getElementById('chart1'));\n chart1.draw(data, options);\n var chart2 = new google.visualization.BarChart(document.getElementById('chart2'));\n chart2.draw(data, options);\n var chart3 = new google.visualization.BarChart(document.getElementById('chart3'));\n chart3.draw(data, options);\n var chart4 = new google.visualization.BarChart(document.getElementById('chart4'));\n chart4.draw(data, options);\n var chart5 = new google.visualization.BarChart(document.getElementById('chart5'));\n chart5.draw(data, options);\n var chart6 = new google.visualization.BarChart(document.getElementById('chart6'));\n chart6.draw(data, options);\n var chart7 = new google.visualization.BarChart(document.getElementById('chart7'));\n chart7.draw(data, options);\n var chart8 = new google.visualization.BarChart(document.getElementById('chart8'));\n chart8.draw(data, options);\n var chart9 = new google.visualization.BarChart(document.getElementById('chart9'));\n chart9.draw(data, options);\n var chart10 = new google.visualization.BarChart(document.getElementById('chart10'));\n chart10.draw(data, options);\n }","function drawChart() {\n\t\t\t\t\tvar data = google.visualization.arrayToDataTable(\n\t\t\t\t\tInventArray, false);\n\t\t\t\t\tconsole.log(data);\n\n\t\t\t\t\t // Optional; add a title and set the width and height of the chart\n\t\t\t\t\tvar options = {'title':'Average Stock', 'width':350, 'height':300, 'chartArea': {'width': '100%', 'height': '80%'}, pieSliceText:'value-and-percentage'};\n\n\t\t\t\t\t// Display the chart inside the
element with id=\"piechart\"\n\t\t\t\t\tvar chart = new google.visualization.PieChart(document.getElementById('piechart'));\n\t\t\t\t\tchart.draw(data, options);\n\t\t\t\t}","function drawChart() {\r\n var data = google.visualization.arrayToDataTable([\r\n ['Task', 'Hours per Day'],\r\n ['windows', 8],\r\n ['MacOS', 4],\r\n ['Android', 1],\r\n ['iOS', 2],\r\n ['その他', 2]\r\n]);\r\n\r\n // Optional; add a title and set the width and height of the chart\r\n var options = {'width':400, 'height':260};\r\n\r\n // Display the chart inside the
element with id=\"piechart\"\r\n var chart = new google.visualization.PieChart(document.getElementById('checkOs'));\r\n chart.draw(data, options);\r\n}","function drawChart() {\n\t var data = google.visualization.arrayToDataTable([\n\t ['Task', 'Hours per Day'],\n\t ['Work', 8],\n\t ['Eat', 2],\n\t ['TV', 4],\n\t ['Gym', 2],\n\t ['Sleep', 8]\n\t]);\n\n\t // Optional; add a title and set the width and height of the chart\n\t var options = {'title':'My Average Day', 'width':300, 'height':340};\n\n\t // Display the chart inside the
element with id=\"piechart\"\n\t var chart = new google.visualization.PieChart(document.getElementById('piechart'));\n\t chart.draw(data, options);\n\t}","function drawChart( pItemSel, pItemHeight, pConfigData, pValuesData, pDefaultConfig, pContainer ) {\n\n apex.debug.info( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"pItemSel\": pItemSel,\n \"pItemHeight\": pItemHeight,\n \"pConfigData\": pConfigData,\n \"pValuesData\": pValuesData,\n \"pDefaultConfig\": pDefaultConfig,\n \"featureDetails\": util.featureDetails\n } );\n\n // eslint-disable-next-line no-undef\n const d3JS = d3;\n\n const aTypeCharts = [\"pie\", \"donut\", \"gauge\"],\n specialStr = \"\\u200b\",\n seriesData = util.groupObjectArray( pValuesData, 'seriesID' );\n\n let isGauge = false,\n isPie = false,\n isDonut = false;\n\n // sort pValuesData by Time\n function sortArrByTime( pArr, pFormat ) {\n\n function customeSort( pFirstValue, pSecondValue ) {\n const parseTime = d3JS.timeParse( pFormat ),\n fD = parseTime( pFirstValue.x ),\n sD = parseTime( pSecondValue.x );\n return new Date( fD ).getTime() - new Date( sD ).getTime();\n }\n\n try {\n return pArr.sort( customeSort );\n }\n catch ( e ) {\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while try sort JSON Array by Time Value\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n }\n\n /* search link from data and set window.location.href */\n function executeLink( pData ) {\n const key = specialStr + unescape( pData.id );\n let index = pData.index;\n\n if ( seriesData[key] ) {\n const seriesObj = seriesData[key];\n if ( seriesObj.length === 1 ) {\n index = 0;\n }\n\n if ( seriesData[key][index] && seriesData[key][index].link ) {\n util.link( seriesData[key][index].link, seriesData[key][index].linkTarget );\n }\n }\n }\n\n try {\n const chartTitle = setObjectParameter( pConfigData.chartTitle, pDefaultConfig.d3JSchart.chartTitle || \"\" ).toString(),\n background = setObjectParameter( pConfigData.background, pDefaultConfig.d3JSchart.background );\n let backJSON = null,\n ownTooltip = false;\n\n if ( util.isDefinedAndNotNull( background ) ) {\n backJSON = {\n color: background\n };\n }\n\n /* line */\n const lineStep = setObjectParameter( pConfigData.lineStep, pDefaultConfig.d3JSchart.line.step );\n\n /* gauge */\n const gaugeMin = setObjectParameter( pConfigData.gaugeMin, pDefaultConfig.d3JSchart.gauge.min ),\n gaugeMax = setObjectParameter( pConfigData.gaugeMax, pDefaultConfig.d3JSchart.gauge.max ),\n gaugeType = setObjectParameter( pConfigData.gaugeType, pDefaultConfig.d3JSchart.gauge.type ),\n gaugeWidth = setObjectParameter( pConfigData.gaugeWidth, pDefaultConfig.d3JSchart.gauge.width ),\n gaugeArcMinWidth = setObjectParameter( pConfigData.gaugeArcMinWidth, pDefaultConfig.d3JSchart.gauge.arcMinWidth ),\n gaugeFullCircle = setObjectParameter( pConfigData.gaugeFullCircle, pDefaultConfig.d3JSchart.gauge.fullCircle, true ),\n gaugeTitle = setObjectParameter( pConfigData.gaugeTitle, pDefaultConfig.d3JSchart.gauge.title || \"\" ).toString();\n\n /* Grid */\n const gridX = setObjectParameter( pConfigData.gridX, pDefaultConfig.d3JSchart.grid.x, true ),\n gridY = setObjectParameter( pConfigData.gridY, pDefaultConfig.d3JSchart.grid.y, true );\n\n /* heights */\n const heightXAxis = setObjectParameter( pConfigData.xAxisHeight, pDefaultConfig.d3JSchart.x.axisHeight );\n\n /* Legend */\n const legendShow = setObjectParameter( pConfigData.legendShow, pDefaultConfig.d3JSchart.legend.show, true ),\n legendPosition = setObjectParameter( pConfigData.legendPosition, pDefaultConfig.d3JSchart.legend.position );\n\n /* padding */\n const chartPadding = util.jsonSaveExtend( null, pDefaultConfig.d3JSchart.padding );\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingBottom ) ) {\n chartPadding.bottom = pConfigData.paddingBottom;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingLeft ) ) {\n chartPadding.left = pConfigData.paddingLeft;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingRight ) ) {\n chartPadding.right = pConfigData.paddingRight;\n }\n\n if ( util.isDefinedAndNotNull( pConfigData.paddingTop ) ) {\n chartPadding.top = pConfigData.paddingTop;\n }\n\n /* Axis */\n const rotateAxis = setObjectParameter( pConfigData.rotateAxis, pDefaultConfig.d3JSchart.rotateAxis, true ),\n axisLabelPosition = setObjectParameter( pConfigData.axisLabelPosition, pDefaultConfig.d3JSchart.axisLabelPosition );\n\n let xAxisLabelPosition = null,\n yAxisLabelPosition = null;\n\n switch ( axisLabelPosition ) {\n case \"inner1\":\n xAxisLabelPosition = \"inner-left\";\n yAxisLabelPosition = \"inner-bottom\";\n break;\n case \"inner2\":\n xAxisLabelPosition = \"inner-center\";\n yAxisLabelPosition = \"inner-middle\";\n break;\n case \"inner3\":\n xAxisLabelPosition = \"inner-right\";\n yAxisLabelPosition = \"inner-top\";\n break;\n case \"outer1\":\n xAxisLabelPosition = \"outer-left\";\n yAxisLabelPosition = \"outer-bottom\";\n break;\n case \"outer2\":\n xAxisLabelPosition = \"outer-center\";\n yAxisLabelPosition = \"outer-middle\";\n break;\n case \"outer3\":\n xAxisLabelPosition = \"outer-right\";\n yAxisLabelPosition = \"outer-top\";\n break;\n default:\n break;\n }\n\n if ( rotateAxis ) {\n const xAxisLabelPositionTmp = xAxisLabelPosition;\n xAxisLabelPosition = yAxisLabelPosition;\n yAxisLabelPosition = xAxisLabelPositionTmp;\n }\n\n /* tooltip */\n const tooltipShow = setObjectParameter( pConfigData.tooltipShow, pDefaultConfig.d3JSchart.tooltip.show, true ),\n tooltipGrouped = setObjectParameter( pConfigData.tooltipGrouped, pDefaultConfig.d3JSchart.tooltip.grouped, true );\n\n /* Transition duration */\n const transitionDuration = setObjectParameter( pConfigData.transitionDuration || pDefaultConfig.d3JSchart.transitionDuration );\n\n /* x Axis */\n const xShow = setObjectParameter( pConfigData.xShow, pDefaultConfig.d3JSchart.x.show, true ),\n xLabel = setObjectParameter( pConfigData.xLabel, pDefaultConfig.d3JSchart.x.label || \"\" ).toString();\n let xType = setObjectParameter( pConfigData.xType, pDefaultConfig.d3JSchart.x.type ),\n xAxisTimeFormat = null,\n xName = null;\n\n /* x ticks */\n const xTickCutAfter = setObjectParameter( pConfigData.xTickCutAfter, pDefaultConfig.d3JSchart.x.tick.cutAfter ),\n xTickMaxNumber = setObjectParameter( pConfigData.xTickMaxNumber, pDefaultConfig.d3JSchart.x.tick.maxNumber ),\n xTickRotation = setObjectParameter( pConfigData.xTickRotation, pDefaultConfig.d3JSchart.x.tick.rotation ),\n xTickMultiline = setObjectParameter( pConfigData.xTickMultiline, pDefaultConfig.d3JSchart.x.tick.multiline, true ),\n xTickFit = setObjectParameter( pConfigData.xTickFit, pDefaultConfig.d3JSchart.x.tick.fit, true ),\n xTickAutoRotate = setObjectParameter( pConfigData.xTickAutoRotate, pDefaultConfig.d3JSchart.x.tick.autoRotate, true );\n let xTickTimeFormat = null;\n\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n xName = \"x\";\n }\n\n if ( xType === \"timeseries\" ) {\n xAxisTimeFormat = setObjectParameter( pConfigData.xTimeFormat, pDefaultConfig.d3JSchart.x.timeFormat );\n xTickTimeFormat = setObjectParameter( pConfigData.xTickTimeFormat, pDefaultConfig.d3JSchart.x.tick.timeFormat );\n // sort data because of tooltip index\n sortArrByTime( pValuesData, xAxisTimeFormat );\n }\n\n /* cut string if category names are to long */\n if ( xType === \"category\" ) {\n xTickTimeFormat = function ( index, categoryName ) {\n return util.cutString( categoryName, xTickCutAfter );\n };\n }\n\n /* y Axis */\n const yLabel = setObjectParameter( pConfigData.yLabel, pDefaultConfig.d3JSchart.y.label || \"\" ).toString(),\n yLog = setObjectParameter( pConfigData.yLog, pDefaultConfig.d3JSchart.y.log, true );\n let yType = null;\n if ( yLog ) {\n yType = \"log\";\n }\n const yMin = pConfigData.yMin || pDefaultConfig.d3JSchart.y.min,\n yMax = pConfigData.yMax || pDefaultConfig.d3JSchart.y.max,\n yCulling = pConfigData.yTickMaxNumber || pDefaultConfig.d3JSchart.y.tick.maxNumber,\n yUnit = pConfigData.yUnit || pDefaultConfig.d3JSchart.y.unit;\n\n /* y2 Axis */\n const y2Label = setObjectParameter( pConfigData.y2Label, pDefaultConfig.d3JSchart.y2.label || \"\" ).toString(),\n y2Log = setObjectParameter( pConfigData.y2Log, pDefaultConfig.d3JSchart.y2.log, true );\n let y2Type = null,\n y2Show = false;\n if ( y2Log ) {\n y2Type = \"log\";\n }\n const y2Min = setObjectParameter( pConfigData.y2Min, pDefaultConfig.d3JSchart.y2.min ),\n y2Max = setObjectParameter( pConfigData.y2Max, pDefaultConfig.d3JSchart.y2.max ),\n y2Culling = setObjectParameter( pConfigData.y2TickMaxNumber, pDefaultConfig.d3JSchart.y2.tick.maxNumber ),\n y2Unit = setObjectParameter( pConfigData.y2Unit, pDefaultConfig.d3JSchart.y2.unit );\n\n /* Zoom and Subchart */\n const zoomType = setObjectParameter( pConfigData.zoomType, pDefaultConfig.d3JSchart.zoom.type );\n let showSubChart = false,\n zoomEnabled = setObjectParameter( pConfigData.zoomEnabled, pDefaultConfig.d3JSchart.zoom.enabled, true );\n\n const charThreshold = setObjectParameter( pConfigData.threshold, pDefaultConfig.d3JSchart.threshold );\n\n if ( zoomEnabled ) {\n if ( zoomType === \"scroll\" ) {\n showSubChart = false;\n } else if ( zoomType === \"subchart\" ) {\n showSubChart = true;\n zoomEnabled = false;\n } else if ( zoomType === \"drag\" ) {\n zoomEnabled = true;\n showSubChart = false;\n }\n } else {\n showSubChart = false;\n }\n\n const zoomRescale = setObjectParameter( pConfigData.zoomRescale, pDefaultConfig.d3JSchart.zoom.rescale, true );\n\n /* Prepare Data for Render */\n const dataArr = [],\n categoriesArr = [],\n groupsArr = [],\n colorsJSON = {},\n typesJSON = {},\n axesJSON = {},\n namesJSON = {},\n groupJSON = {},\n xCatObj = util.groupObjectArray( pValuesData, \"x\" );\n\n let seriesCnt = 0;\n\n if ( seriesData ) {\n /* Add Categories or time values to x Axis when correct type is set */\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n categoriesArr.push( \"x\" );\n const xCatArr = Object.keys( xCatObj );\n\n $.each( xCatArr, function ( dIdx, dataValues ) {\n categoriesArr.push( ( setObjectParameter( dataValues.replace( specialStr, \"\" ), null ) ) );\n } );\n }\n\n dataArr.push( categoriesArr );\n\n /* Transform data for billboard.js */\n $.each( seriesData, function ( idx, seriesData ) {\n let series;\n seriesCnt += 1;\n if ( seriesData[0] && seriesData[0].seriesID ) {\n series = seriesData[0];\n const dataKey = escape( series.seriesID );\n colorsJSON[dataKey] = series.color;\n typesJSON[dataKey] = series.type;\n\n /* check if atypechart*/\n if ( aTypeCharts.indexOf( series.type ) >= 0 ) {\n zoomEnabled = false;\n }\n\n if ( series.type === \"gauge\" ) {\n isGauge = true;\n }\n\n if ( series.type === \"pie\" ) {\n isPie = true;\n }\n\n if ( series.type === \"donut\" ) {\n isDonut = true;\n }\n\n if ( util.isDefinedAndNotNull( series.tooltip ) ) {\n ownTooltip = true;\n }\n\n axesJSON[dataKey] = ( series.yAxis || \"y\" );\n if ( util.isDefinedAndNotNull( series.groupID ) ) {\n const groupID = escape( series.groupID.toString() );\n if ( groupJSON[groupID] ) {\n groupJSON[groupID].push( dataKey );\n } else {\n groupJSON[groupID] = [];\n groupJSON[groupID].push( dataKey );\n }\n }\n\n if ( series.yAxis === \"y2\" ) {\n y2Show = true;\n }\n namesJSON[dataKey] = ( setObjectParameter( series.label, dataKey ) );\n\n const arr = [];\n arr.push( dataKey );\n if ( xType === \"category\" || xType === \"timeseries\" ) {\n $.each( xCatObj, function ( dIdx, dataValues ) {\n let setValueY = null,\n setValueZ = null;\n $.each( dataValues, function ( sIDx, sDataValues ) {\n if ( escape( sDataValues.seriesID ) === dataKey ) {\n setValueY = sDataValues.y;\n if ( sDataValues.z ) {\n setValueZ = sDataValues.z;\n }\n }\n } );\n if ( setValueZ !== null ) {\n arr.push( {\n \"y\": setValueY,\n \"z\": setValueZ\n } );\n } else {\n arr.push( setValueY );\n }\n } );\n } else {\n $.each( seriesData, function ( dIdx, dataValues ) {\n const setValueY = setObjectParameter( dataValues.y, null );\n if ( dataValues.z ) {\n const setValueZ = dataValues.z;\n arr.push( {\n \"y\": setValueY,\n \"z\": setValueZ\n } );\n } else {\n arr.push( setValueY );\n }\n } );\n }\n\n dataArr.push( arr );\n\n } else {\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"No seriesID found in seriesID Cursor\",\n \"featureDetails\": util.featureDetails\n } );\n }\n\n } );\n\n /* Group JSON to Array */\n $.each( groupJSON, function ( dIdx, jsonObj ) {\n groupsArr.push( jsonObj );\n } );\n\n /* Labels and Datapoints */\n let dataLabels = setObjectParameter( pConfigData.showDataLabels, pDefaultConfig.d3JSchart.showDataLabels, true );\n\n if ( isPie || isDonut ) {\n dataLabels = {\n colors: \"white\"\n };\n } else if ( isGauge ) {\n dataLabels = {\n colors: ( gaugeType === \"single\" && seriesCnt > 1 ) ? \"white\" : \"inherit\"\n };\n }\n const showDataPoints = setObjectParameter( pConfigData.showDataPoints, pDefaultConfig.d3JSchart.showDataPoints, true ),\n showAbsoluteValues = setObjectParameter( pConfigData.showAbsoluteValues, pDefaultConfig.d3JSchart.showAbsoluteValues );\n let absoluteFormatting;\n\n if ( showAbsoluteValues ) {\n absoluteFormatting = function ( value ) {\n return value + yUnit;\n };\n }\n\n let ttContent;\n if ( ownTooltip ) {\n ttContent = function ( d ) {\n const div = $( \"\" );\n div.addClass( \"bb-tooltip\" );\n div.addClass( \"bida-chart-tooltip-custome\" );\n $.each( d, function ( i, pData ) {\n const key = specialStr + unescape( pData.id ),\n seriesObj = seriesData[key],\n index = pData.index;\n \n if ( seriesObj && seriesObj[index] && util.isDefinedAndNotNull( seriesObj[index].tooltip ) && util.isDefinedAndNotNull( pData.value ) ) {\n const subDiv = $( \"
\" );\n\n let ttS = seriesObj[index].tooltip;\n if ( pRequireHTMLEscape !== false ) {\n ttS = util.escapeHTML( ttS );\n }\n subDiv.append( ttS );\n div.append( subDiv );\n }\n } );\n return div[0].outerHTML;\n };\n }\n\n try {\n const chartContIDSel = pItemSel + \"bbc\",\n chartContID = chartContIDSel.replace( \"#\", \"\" ),\n chartCont = $( \"\" );\n chartCont.attr( \"id\", chartContID );\n\n $( pItemSel ).append( chartCont );\n\n const bbData = {\n bindto: chartContIDSel,\n background: backJSON,\n title: {\n text: chartTitle\n },\n size: {\n height: pItemHeight\n },\n data: {\n x: xName,\n xFormat: xAxisTimeFormat,\n columns: dataArr,\n types: typesJSON,\n groups: groupsArr,\n colors: colorsJSON,\n labels: dataLabels,\n axes: axesJSON,\n names: namesJSON,\n onclick: function ( pData ) {\n executeLink( pData );\n }\n },\n pie: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n }\n },\n donut: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n }\n },\n line: {\n step: {\n type: lineStep\n }\n },\n gauge: {\n label: {\n format: absoluteFormatting,\n threshold: charThreshold\n },\n fullCircle: gaugeFullCircle,\n min: gaugeMin,\n max: gaugeMax,\n type: gaugeType,\n width: gaugeWidth,\n title: gaugeTitle,\n arc: {\n minWidth: gaugeArcMinWidth\n }\n },\n radar: {\n direction: {\n clockwise: true\n }\n },\n subchart: {\n show: showSubChart\n },\n zoom: {\n type: zoomType,\n enabled: zoomEnabled,\n rescale: zoomRescale\n },\n transition: {\n duration: transitionDuration\n },\n legend: {\n show: legendShow,\n position: legendPosition\n },\n tooltip: {\n show: tooltipShow,\n grouped: tooltipGrouped,\n contents: ttContent\n },\n grid: {\n x: {\n show: gridX,\n },\n y: {\n show: gridY\n }\n },\n point: {\n show: showDataPoints\n },\n axis: {\n rotated: rotateAxis,\n x: {\n show: xShow,\n label: {\n text: xLabel,\n position: xAxisLabelPosition\n },\n type: xType,\n tick: {\n culling: {\n max: xTickMaxNumber\n },\n autorotate: xTickAutoRotate,\n rotate: xTickRotation,\n multiline: xTickMultiline,\n format: xTickTimeFormat,\n fit: xTickFit\n },\n height: heightXAxis\n },\n y: {\n label: {\n text: yLabel,\n position: yAxisLabelPosition\n },\n type: yType,\n max: yMax,\n min: yMin,\n tick: {\n culling: {\n max: yCulling\n },\n format: function ( d ) {\n return d + yUnit;\n }\n }\n },\n y2: {\n show: y2Show,\n label: {\n text: y2Label,\n position: yAxisLabelPosition\n },\n type: y2Type,\n max: y2Max,\n min: y2Min,\n tick: {\n culling: {\n max: y2Culling\n },\n format: function ( d ) {\n return d + y2Unit;\n }\n }\n }\n },\n padding: chartPadding\n };\n\n apex.debug.info( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"finalChartData\": bbData,\n \"featureDetails\": util.featureDetails\n } );\n\n // eslint-disable-next-line no-undef\n const chart = bb.generate( bbData );\n\n /* reset zoom on right click */\n if ( zoomEnabled ) {\n $( chartContIDSel ).contextmenu( function ( evt ) {\n evt.preventDefault();\n chart.unzoom();\n } );\n }\n\n /* execute resize */\n pContainer.on( \"resize\", function() {\n chart.resize( {\n height: pItemHeight\n } );\n } );\n\n } catch ( e ) {\n $( pItemSel ).empty();\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while try to render chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n } else {\n util.noDataMessage.show( pItemSel, pDefaultConfig.noDataMessage );\n }\n } catch ( e ) {\n $( pItemSel ).empty();\n util.errorMessage.show( pItemSel, pDefaultConfig.errorMessage );\n apex.debug.error( {\n \"fct\": `${util.featureDetails.name} - drawChart`,\n \"msg\": \"Error while prepare data for chart\",\n \"err\": e,\n \"featureDetails\": util.featureDetails\n } );\n }\n }","function winInit() {\n myDIV = document.getElementById(\"myDIV\");\n myCanvas = document.getElementById('myCanvas');\n ctx = myCanvas.getContext(\"2d\");\n\n exampleCanvas = document.getElementById('exampleCanvas');\n ctx2 = exampleCanvas.getContext(\"2d\");\n\n drawColumnChart({\n ctx: ctx,\n canvas: myCanvas,\n xData: [1,2,3,4,5,6],\n yData: [10,30,20,10,20,60],\n cvx: myCanvas.width/6, // canvas.width / antall kolonner (6)\n cvy: 500,\n number: 6,\n widthPx: 50,\n yScale: 7,\n barColor: \"Green\",\n textColor: \"Pink\"\n });\n\n drawHtmlTable(myDIV, [\"nice\", \"verynice\", \"reallynice\"], [\"1\", \"13231231212\", \"38218942\", \"1\", \"2\", \"3\"]);\n\n drawPieChart(ctx2, exampleCanvas, [1,2,3], [\"Red\", \"blue\", \"yellow\"]);\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'FIO');\n data.addColumn('number', 'Count');\n i = 0; \n\n names = document.querySelectorAll('.DName');\n values = document.querySelectorAll('.DCount');\n\n while (i + 1 <= names.length) {\n data.addRows([\n [names[i].innerText, +values[i].innerText]\n ]);\n i++;\n }\n\n // Set chart options\n var options = {\n 'title': 'Кругова діаграма',\n 'width': 500,\n 'height': 500\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n }","draw() {\n this.plot = this.svg.append('g')\n .classed(\"plot\", true)\n .attr('transform', `translate(${this.margin.left},${this.margin.top})`);\n\n // Add the background\n this.plot.append(\"rect\")\n .attrs({\n fill: \"white\",\n x: 0,\n y: 0,\n height: this.innerHeight,\n width: this.innerWidth\n });\n\n if ( this.opts.nav !== false ) {\n this.drawNav();\n }\n\n // Add the title\n this.svg.append('text')\n .attr('transform', `translate(${this.width / 2},${this.margin.top / 2})`)\n .attr(\"class\", \"chart-title\")\n .attr('x', 0)\n .attr('y', 0)\n .text(this.title);\n }","function drawChart(){\n canvas = d3.select(\"#chart\").append(\"svg\")\n .attr(\"class\",\"variationChart\")\n .attr(\"width\", width)\n .attr(\"height\", height + margin.top + margin.bottom)\n .append(\"g\")\n}","function drawChart(reactionData) {\n var reactionDataTable = new google.visualization.DataTable();\n reactionDataTable.addColumn('number', 'Time');\n reactionDataTable.addColumn('number', 'Reaction');\n reactionDataTable.addRows(reactionData);\n\n var options = {\n title: 'Reactions over Time',\n curveType: 'function',\n width: 900,\n height: 500,\n legend: 'none',\n hAxis: {title: 'Time'},\n vAxis: {title: 'Reaction'}\n };\n // set the chart handle\n var chart = new google.visualization.LineChart(document.getElementById('chart_div'));\n\n //var chart = new google.visualization.ScatterChart(document.getElementById('chart_div'));\n chart.draw(reactionDataTable, options);\n }","function drawChart() {\n\t//creates x and y axis and names them\n\tvar data = new google.visualization.DataTable();\n\tdata.addColumn('number', 'Num of itarations');\n\tdata.addColumn('number', 'Cost');\n\n\tdata.addRows(loss);//add the loss array which holds how the network is preforming\n\t \n\t//gives the chart a name and changes its size\n\tvar options = {\n\t\tchart: {\n\t\t\ttitle: 'The Cost of the network',\n\t\t},\n\t\twidth: window.innerWidth*0.4,\n\t\theight: window.innerHeight*0.2\n\t};\n\t\n\t//crates the chart\n\tvar chart = new google.charts.Line(document.getElementById('line_top_x'));\n\t\n\t//remove goggles error when the loss array is empty\n\tgoogle.visualization.events.addListener(chart, 'error', function (googleError) {\n\t\tgoogle.visualization.errors.removeError(googleError.id);\n\t});\n\t//shows the chart\n\tchart.draw(data, google.charts.Line.convertOptions(options));\n }","function draw(count1, count2, id){\n \n google.charts.setOnLoadCallback(drawChart(count1, count2, id));\n }","function draw_chart(c){\n c.beginPath();\n c.strokeStyle = \"red\";\n c.moveTo(count_block(5),count_block(40));\n\n var xplot = 10;\n for(let j=0; j < data.length; j++){\n var data_in_blocks = data[j]/100; \n \n \n c.strokeText(data[j].toString(), count_block(xplot), count_block(40-data_in_blocks)-10);\n c.lineTo(count_block(xplot), count_block(40-data_in_blocks));\n c.arc(count_block(xplot), count_block(40-data_in_blocks), 3,0, Math.PI*2, true);\n xplot+=5;\n \n }\n c.stroke();\n}","function drawChart() {\n\n // Create the data table.\n var data = new google.visualization.DataTable();\n data.addColumn('string', 'Budget');\n data.addColumn('number', 'Amount');\n data.addRows([\n ['Income', total_income],\n ['Expense', total_expense]\n ]);\n\n // Set chart options\n var options = {'title':'Income/Expense Pie Chart',\n 'width':400,\n 'height':300};\n\n // Instantiate and draw our chart, passing in some options.\n var chart = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart.draw(data, options);\n}","function drawChart() {\n\n// n.b. need all these retrieved;\n var chart5_ovs = parseFloat(document.getElementById('chart5_ovs').value);\n var chart5_hormo = parseFloat(document.getElementById('chart5_hormo').value);\n var chart5_chemo_add = parseFloat(document.getElementById('chart5_chemo_add').value);\n var chart5_tram_add = parseFloat(document.getElementById('chart5_tram_add').value);\n var chart10_ovs = parseFloat(document.getElementById('chart10_ovs').value);\n var chart10_hormo = parseFloat(document.getElementById('chart10_hormo').value);\n var chart10_chemo_add = parseFloat(document.getElementById('chart10_chemo_add').value);\n var chart10_tram_add = parseFloat(document.getElementById('chart10_tram_add').value);\n var types=['Year','Survival with no Adjuvant treatment',\n 'Benefit of Adjuvant Hormone therapy'];\n if ( chart5_chemo_add > 0.0001 ) {\n types[types.length]='Additional benefit of Adjuvant Chemotherapy';\n }\n if ( chart5_tram_add > 0.0001 ) {\n types[types.length]='Additional benefit of Trastuzumab';\n }\n types[types.length]= { role: 'annotation' };\n var yr5 = ['Five years', chart5_ovs, chart5_hormo];\n var yr10 = ['Ten years', chart10_ovs, chart10_hormo];\n if ( chart5_chemo_add > 0.0001 ) {\n yr5[yr5.length]= chart5_chemo_add;\n yr10[yr10.length]= chart10_chemo_add;\n }\n if ( chart5_tram_add > 0.0001 ) {\n yr5[yr5.length]= chart5_tram_add;\n yr10[yr10.length]= chart10_tram_add;\n }\n yr5[yr5.length]= '';\n yr10[yr10.length]= '';\n var data = google.visualization.arrayToDataTable([types,yr5,yr10]);\n\n// alternate construction - cant get this to work\n// var data = google.visualization.DataTable();\n// data.addColumn({ type: 'number', label: 'Five years', id: 'year5', role: 'annotation' });\n// data.addColumn({ type: 'number', label: 'Ten years', id: 'year10', role: 'annotation' });\n// data.addRow([10, 24]);\n// data.addRow([16, 22]);\n\n var view = new google.visualization.DataView(data);\n// n.b. view.setColumns() Specifies which columns are visible in this view. Any columns not specified will be hidden\n var setcols=[0,1,{ calc: \"stringify\",sourceColumn: 1,type: \"string\",role: \"annotation\" }];\n// only set the hormo benefit value (column 2) to be displayed if it's > 0.0\n// n.b. hormo value is always in the data array so always index 2\n if ( chart5_hormo > 0.0001 ) {\n setcols[setcols.length]= 2;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 2,type: \"string\",role: \"annotation\" };\n } else {\n// setcols[setcols.length]= 2; # not needed as not displaying ??\n }\n// n.b. if present chemo is always index 3 and traz always index 4 (no traz without chemo)\n if ( chart5_chemo_add > 0.0001 ) {\n setcols[setcols.length]= 3;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 3,type: \"string\",role: \"annotation\" };\n } else {\n// setcols[setcols.length]= 3;\n }\n if ( chart5_tram_add > 0.0001 ) {\n setcols[setcols.length]= 4;\n setcols[setcols.length]= { calc: \"stringify\",sourceColumn: 4,type: \"string\",role: \"annotation\" };\n// setcols[setcols.length]= 5;\n }\n setcols[setcols.length]= types.length - 1;\n view.setColumns(setcols);\n// view.setColumns([0, // this example for labelling of 2 data regimes in bar chart\n// 1,{ calc: \"stringify\",sourceColumn: 1,type: \"string\",role: \"annotation\" },\n// 2,{ calc: \"stringify\",sourceColumn: 2,type: \"string\",role: \"annotation\" },3]);\n\n// n.b. height & width are set as same as in img block\n// legend:{ alignment: 'bottom', textStyle: { fontSize: getFontSize(), overflow: 'auto'} }\n// legend: {position: 'bottom', alignment: 'center', maxLines: 4, textStyle: { overflow: 'none'}},\n// legend is uncontrolable - especially for long labels like we have! so don't use and replace with static png\n// n.b. give chart max y-axis of 105 so top category value label has enough room to display\n// tooltips: {isHtml: true, showColorCode: true},\n// colors: ['#666699','#00ff00','#ff9900','#00aa99'],\n// n.b. since new release of google charts on 23/2/15 for ER -ve (0 hormo) we now need to remove the green\n// from the colours vector as it's being used for the chemo i.e. zero hormo is not being interpretted\n// properly seemingly a bug - corrected 17/3/15 by emd\n var cols = ['#666699'];\n if ( chart5_hormo > 0.001 ) {\n cols[cols.length]= '#00ff00';\n }\n cols[cols.length]= '#ff9900';\n cols[cols.length]= '#00aa99';\n var options = {\n title: 'Overall Survival at 5 and 10 years (percent)',\n colors: cols,\n vAxis: {maxValue: 105, ticks: [0,10,20,30,40,50,60,70,80,90,100]},\n chartArea: {left:40, top:30, width:'70%', height:'65%'},\n legend: {position: 'none'},\n bar: {groupWidth: \"50%\"},\n isStacked: true,\n width: 360,\n height: 460\n };\n\n var chart_div = document.getElementById('chart1');\n var chart = new google.visualization.ColumnChart(chart_div);\n\n// n.b. currently turned off as causes tooltips NOT to be displayed on mouseover -must have tooltips!\n // Wait for the chart to finish drawing before calling the getImageURI() method.\n// google.visualization.events.addListener(chart, 'ready', function () {\n// chart_div.innerHTML = '';\n// console.log(chart_div.innerHTML);\n// });\n\n// chart.draw(data, options); // use this form if not using the view object for labelling\n chart.draw(view, options);\n\n }","function chartEmergingNow_Draw(ele, dataset) {\n // Variables\n ele = \"#\" + ele;\n $(ele +\" svg\").remove();\n\n // Data\n var data = null;\n if(dataset === \"InterestsPassions\"){\n data = appData[activeAudience].psychographics.categoriesData[activeInterestsPassionsCategory].analyses[0].emergingNow;\n }\n if(dataset === \"InsightsTrends\"){\n data = appData[activeAudience].insightstrends.categoriesData[activeInsightsTrendsCategory].emergingNow;\n }\n\n // Dimensions\n w = $(ele).width();\n var h = 110;\n\n var radius = 10;\n var max_n = 0;\n for (var d in data) {\n max_n = Math.max(data[d].value, max_n);\n }\n var dx = w / max_n;\n var dy = 30;\n\n // Draw\n var svg = d3.select(ele)\n .append(\"svg\")\n .attr(\"width\", w)\n .attr(\"height\", h);\n \n // Bars\n var bars = svg.selectAll(\".bar\")\n .data(data)\n .enter()\n .append(\"rect\")\n .attr(\"class\", function(d, i) { return \"bar\"; })\n .attr(\"x\", function(d, i) { return 0; })\n .attr(\"y\", function(d, i) { return (dy + 10) * i; })\n .attr(\"width\", function(d, i) { return (d.value / max_n) * 100 + '%'; })\n .attr(\"height\", dy)\n .attr(\"rx\", radius)\n .attr(\"ry\", radius)\n .attr( \"fill\", function( d, i ) { return chartEmergingNow_ColorSeries( i ); });\n\n // Labels\n var text = svg.selectAll(\"text\")\n .data(data)\n .enter()\n .append(\"text\")\n .attr(\"class\", function(d, i) { return \"label\";} )\n .attr(\"x\", 10)\n .attr(\"y\", function(d, i) { return ((dy + 10) * i) + 20;} )\n .attr(\"font-size\", \"12px\")\n .attr(\"font-weight\", \"bold\")\n .attr(\"fill\", \"#ffffff\")\n .text( function(d) { return d.insight; } );\n\n}","function drawEmployeeChart() {\r\n\r\n\t\t// ----- first chart ---------\r\n\t\t// Create the data table.\r\n\t\tvar dataTable = google.visualization.arrayToDataTable([\r\n\t\t\t['Type', 'Count'],\r\n\t\t\t['Masked', data['total_employee'] - data['total_result_employee']],\r\n\t\t\t['Unmasked', data['total_result_employee']]\r\n\t\t]);\r\n\r\n\t\t// Set chart options\r\n\t\tvar options = {\r\n\t\t\t'width': 500,\r\n\t\t\t'height': 400,\r\n\t\t\tbackgroundColor: 'transparent',colors: ['#809cb5', '#34485c'],\r\n\t\t\tlegend:{textStyle:{fontSize:'14', fontName: 'Montserrat'}}\r\n\t\t};\r\n\t\tvar title = { 'title': 'Employee Ratio' , \r\n\t\t\t\t\t titleTextStyle: {fontSize:'16', fontName: 'Montserrat'}\r\n\r\n\t\t\t\t};\r\n\r\n\t\t// Instantiate and draw our chart, passing in some options.\r\n\t\tvar chart = new google.visualization.PieChart(document.getElementById('chart1_div'));\r\n\t\tchart.draw(dataTable, { ...title, ...options });\r\n\r\n\r\n\t\t// ----- second chart ---------\r\n\t\tdataTable = google.visualization.arrayToDataTable([\r\n\t\t\t['Type', 'Count'],\r\n\t\t\t['Visitor', data['total_result'] - data['total_result_employee_occurance']],\r\n\t\t\t['Employee', data['total_result_employee_occurance']]\r\n\t\t]);\r\n\t\ttitle = { 'title': 'Unmasked Occurance Ratio' ,\r\n\t\t\t\ttitleTextStyle: {fontSize:'16', fontName: 'Montserrat'}};\r\n\t\tchart = new google.visualization.PieChart(document.getElementById('chart2_div'));\r\n\t\tchart.draw(dataTable, { ...title, ...options });\r\n\t}","function drawChart3() {\n var data3\n // Create the data table.\n data3 = new google.visualization.DataTable();\n data3.addColumn('string', 'nombre');\n data3.addColumn('number', 'cantidad');\n data3.addRows(render);\n\n // Set chart options\n var options1 = {\n 'title': 'Cantidad de laboratorios por actividad escuela: '+escuela,\n\n\n };\n\n // Instantiate and draw our chart, passing in some options.\n var chart1 = new google.visualization.PieChart(document.getElementById('chart_div'));\n chart1.draw(data3, options1);\n\n }","function DrawImpressionsChart()\n{\n // create/delete rows \n if (impressionsTable.getNumberOfRows() < aggrDataPoints.length)\n { \n var numRows = aggrDataPoints.length - impressionsTable.getNumberOfRows();\n impressionsTable.addRows(numRows);\n } else {\n for(var i=(impressionsTable.getNumberOfRows()-1); i >= aggrDataPoints.length; i--)\n {\n impressionsTable.removeRow(i); \n }\n }\n\n // Populate data table with time/impressions data points. \n for(var i=0; i < impressionsTable.getNumberOfRows(); i++)\n {\n impressionsTable.setCell(i, 0, new Date(parseInt(aggrDataPoints[i].timestamp)));\n impressionsTable.setCell(i, 1, parseInt(aggrDataPoints[i].impressions));\n }\n\n // Draw line chart.\n chartOptions.title = 'Impressions Chart';\n impressionsChart.draw(impressionsView, chartOptions); \n}","function drawChart() {\n const data = new google.visualization.DataTable();\n data.addColumn('string', 'Animal');\n data.addColumn('number', 'Count');\n data.addRows([\n ['2001', 23],\n ['2002', 22],\n ['2003', 23],\n ['2004', 23],\n ['2005', 28],\n ['2006', 28],\n ['2007', 25],\n ['2008', 28],\n ['2009', 27],\n ['2010', 6],\n ['2015', 18],\n ['2016', 18]\n ]);\n\n const options = {\n 'title': 'Distribution of BIONICLE sets per year (2001-2010; 2015-2016)',\n 'width':600,\n 'height':600\n };\n\n const chart = new google.visualization.PieChart(\n document.getElementById('chart-container'));\n chart.draw(data, options);\n}","function renderPieChart() {\n var i, x, y, r, a1, a2, set, sum;\n\n x = width / 2;\n y = height / 2;\n r = Math.min(x, y) - 2;\n a1 = 1.5 * Math.PI;\n a2 = 0;\n set = sets[0];\n sum = sumSet(set);\n\n for (i = 0; i < set.length; i++) {\n ctx.fillStyle = colorOf(i);\n ctx.beginPath();\n a2 = a1 + (set[i] / sum) * (2 * Math.PI);\n\n // TODO opts.wedge\n ctx.arc(x, y, r, a1, a2, false);\n ctx.lineTo(x, y);\n ctx.fill();\n a1 = a2;\n }\n }","function draw(datatable) {\n // Define look and feel parameters using options object to override defaults.\n var width = options.width || 300;\n var backgroundColor = options.backgroundColor;\n var globalStyle = options.globalStyle || {fontFamily:'sans-serif'};\n var titleStyle = options.titleStyle || {fontWeight:'bold'};\n var captionStyle = options.captionStyle || {fontSize:'0.70em'};\n var powerRange = options.powerRange || 6000;\n var title = options.title || source;\n\n // Create a datatable with this source's data and baseline.\n datatable = addBaseline(datatable);\n\n // Get the top-level div where this visualization should go.\n element = document.getElementById(viz_id);\n\n // Now add the elements.\n addGlobalStyle(element, backgroundColor, width, globalStyle);\n addTitleDiv(element, viz_id, title, titleStyle);\n addMeterDiv(element, viz_id, datatable, backgroundColor, width, powerRange);\n addCaptionDiv(element, viz_id, captionStyle, datatable);\n }","function drawChart() {\n\n\t// empty the container to generate chart with updated width\n\tdocument.getElementById(\"value-chart\").innerHTML = \"\";\n\n\t// get the new width of the container that will hold the chart\n\tlet chartContainerWidth = document.getElementById('chart-container').clientWidth;\n\tlet chartWidth = chartContainerWidth - 20;\n\n\t// obtain the height of the table\n\tlet tableHeight = document.getElementById('table-data').clientHeight;\n\t// assign the height of the chart to be equal to the height of the table \n\t// remove 30px to account for the chart title\n\tlet chartHeight = tableHeight - 30; // height of svg container for chart \n\t\n\t// define chart data\n\tlet dataChart = d3.zip(arrayIds, arrayNames, arrayValue2);\n\n\t// define y scale\n\tlet yScale = d3.scaleBand()\n\t\t\t\t\t.domain(d3.range(arrayIds.length))\n\t\t\t\t\t.rangeRound([0, chartHeight])\n\t\t\t\t\t.round(true)\n\t\t\t\t\t.paddingInner(0.05);\n\n\t// define x scale\n\tlet xScale = d3.scaleLinear()\n\t\t\t\t\t.domain([0, d3.max(arrayValue2)]) // +10 to show labels above\n\t\t\t\t\t.range([40, chartWidth]);\t\t\n\n\t// create SVG element\n\tlet svgSales = d3.select(\"#value-chart\") // select by id\n\t\t\t\t.append(\"svg\") // insert the