UrgentcareCLI 0.1.1 → 0.2.3
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/lib/UrgentCare/CLI.rb +57 -22
- data/lib/UrgentCare/Office.rb +1 -5
- data/lib/UrgentCare/Scraper.rb +71 -0
- data/lib/UrgentCare/version.rb +2 -2
- data/lib/UrgentCare.rb +2 -1
- metadata +27 -321
- data/.gitignore +0 -11
- data/.rspec +0 -3
- data/.travis.yml +0 -5
- data/CODE_OF_CONDUCT.md +0 -74
- data/Gemfile +0 -12
- data/Gemfile.lock +0 -84
- data/LICENSE.txt +0 -21
- data/Notes +0 -41
- data/README.md +0 -41
- data/Rakefile +0 -8
- data/UrgentCare.gemspec +0 -39
- data/background.jpg +0 -0
- data/data.txt +0 -4
- data/lib/Urgentcare/Scraper.rb +0 -78
- data/node_modules/.bin/rimraf +0 -1
- data/node_modules/.package-lock.json +0 -250
- data/node_modules/balanced-match/.github/FUNDING.yml +0 -2
- data/node_modules/balanced-match/LICENSE.md +0 -21
- data/node_modules/balanced-match/README.md +0 -97
- data/node_modules/balanced-match/index.js +0 -62
- data/node_modules/balanced-match/package.json +0 -48
- data/node_modules/brace-expansion/LICENSE +0 -21
- data/node_modules/brace-expansion/README.md +0 -129
- data/node_modules/brace-expansion/index.js +0 -201
- data/node_modules/brace-expansion/package.json +0 -47
- data/node_modules/concat-map/.travis.yml +0 -4
- data/node_modules/concat-map/LICENSE +0 -18
- data/node_modules/concat-map/README.markdown +0 -62
- data/node_modules/concat-map/example/map.js +0 -6
- data/node_modules/concat-map/index.js +0 -13
- data/node_modules/concat-map/package.json +0 -43
- data/node_modules/concat-map/test/map.js +0 -39
- data/node_modules/core-util-is/LICENSE +0 -19
- data/node_modules/core-util-is/README.md +0 -3
- data/node_modules/core-util-is/float.patch +0 -604
- data/node_modules/core-util-is/lib/util.js +0 -107
- data/node_modules/core-util-is/package.json +0 -32
- data/node_modules/core-util-is/test.js +0 -68
- data/node_modules/fs.realpath/LICENSE +0 -43
- data/node_modules/fs.realpath/README.md +0 -33
- data/node_modules/fs.realpath/index.js +0 -66
- data/node_modules/fs.realpath/old.js +0 -303
- data/node_modules/fs.realpath/package.json +0 -26
- data/node_modules/glob/LICENSE +0 -21
- data/node_modules/glob/README.md +0 -375
- data/node_modules/glob/changelog.md +0 -67
- data/node_modules/glob/common.js +0 -234
- data/node_modules/glob/glob.js +0 -788
- data/node_modules/glob/package.json +0 -51
- data/node_modules/glob/sync.js +0 -484
- data/node_modules/immediate/LICENSE.txt +0 -20
- data/node_modules/immediate/README.md +0 -93
- data/node_modules/immediate/dist/immediate.js +0 -75
- data/node_modules/immediate/dist/immediate.min.js +0 -1
- data/node_modules/immediate/lib/browser.js +0 -69
- data/node_modules/immediate/lib/index.js +0 -73
- data/node_modules/immediate/package.json +0 -42
- data/node_modules/inflight/LICENSE +0 -15
- data/node_modules/inflight/README.md +0 -37
- data/node_modules/inflight/inflight.js +0 -54
- data/node_modules/inflight/package.json +0 -29
- data/node_modules/inherits/LICENSE +0 -16
- data/node_modules/inherits/README.md +0 -42
- data/node_modules/inherits/inherits.js +0 -9
- data/node_modules/inherits/inherits_browser.js +0 -27
- data/node_modules/inherits/package.json +0 -29
- data/node_modules/isarray/.npmignore +0 -1
- data/node_modules/isarray/.travis.yml +0 -4
- data/node_modules/isarray/Makefile +0 -6
- data/node_modules/isarray/README.md +0 -60
- data/node_modules/isarray/component.json +0 -19
- data/node_modules/isarray/index.js +0 -5
- data/node_modules/isarray/package.json +0 -45
- data/node_modules/isarray/test.js +0 -20
- data/node_modules/jszip/.codeclimate.yml +0 -16
- data/node_modules/jszip/.editorconfig +0 -8
- data/node_modules/jszip/.jshintignore +0 -1
- data/node_modules/jszip/.jshintrc +0 -21
- data/node_modules/jszip/.travis.yml +0 -17
- data/node_modules/jszip/CHANGES.md +0 -163
- data/node_modules/jszip/LICENSE.markdown +0 -651
- data/node_modules/jszip/README.markdown +0 -35
- data/node_modules/jszip/dist/jszip.js +0 -30
- data/node_modules/jszip/dist/jszip.min.js +0 -13
- data/node_modules/jszip/index.d.ts +0 -270
- data/node_modules/jszip/lib/base64.js +0 -106
- data/node_modules/jszip/lib/compressedObject.js +0 -74
- data/node_modules/jszip/lib/compressions.js +0 -14
- data/node_modules/jszip/lib/crc32.js +0 -77
- data/node_modules/jszip/lib/defaults.js +0 -11
- data/node_modules/jszip/lib/external.js +0 -19
- data/node_modules/jszip/lib/flate.js +0 -85
- data/node_modules/jszip/lib/generate/ZipFileWorker.js +0 -540
- data/node_modules/jszip/lib/generate/index.js +0 -57
- data/node_modules/jszip/lib/index.js +0 -52
- data/node_modules/jszip/lib/license_header.js +0 -11
- data/node_modules/jszip/lib/load.js +0 -81
- data/node_modules/jszip/lib/nodejs/NodejsStreamInputAdapter.js +0 -74
- data/node_modules/jszip/lib/nodejs/NodejsStreamOutputAdapter.js +0 -42
- data/node_modules/jszip/lib/nodejsUtils.js +0 -57
- data/node_modules/jszip/lib/object.js +0 -389
- data/node_modules/jszip/lib/readable-stream-browser.js +0 -9
- data/node_modules/jszip/lib/reader/ArrayReader.js +0 -57
- data/node_modules/jszip/lib/reader/DataReader.js +0 -116
- data/node_modules/jszip/lib/reader/NodeBufferReader.js +0 -19
- data/node_modules/jszip/lib/reader/StringReader.js +0 -38
- data/node_modules/jszip/lib/reader/Uint8ArrayReader.js +0 -22
- data/node_modules/jszip/lib/reader/readerFor.js +0 -28
- data/node_modules/jszip/lib/signature.js +0 -7
- data/node_modules/jszip/lib/stream/ConvertWorker.js +0 -26
- data/node_modules/jszip/lib/stream/Crc32Probe.js +0 -24
- data/node_modules/jszip/lib/stream/DataLengthProbe.js +0 -29
- data/node_modules/jszip/lib/stream/DataWorker.js +0 -116
- data/node_modules/jszip/lib/stream/GenericWorker.js +0 -263
- data/node_modules/jszip/lib/stream/StreamHelper.js +0 -212
- data/node_modules/jszip/lib/support.js +0 -38
- data/node_modules/jszip/lib/utf8.js +0 -275
- data/node_modules/jszip/lib/utils.js +0 -476
- data/node_modules/jszip/lib/zipEntries.js +0 -262
- data/node_modules/jszip/lib/zipEntry.js +0 -294
- data/node_modules/jszip/lib/zipObject.js +0 -133
- data/node_modules/jszip/package.json +0 -63
- data/node_modules/jszip/vendor/FileSaver.js +0 -247
- data/node_modules/lie/README.md +0 -62
- data/node_modules/lie/dist/lie.js +0 -350
- data/node_modules/lie/dist/lie.min.js +0 -1
- data/node_modules/lie/dist/lie.polyfill.js +0 -358
- data/node_modules/lie/dist/lie.polyfill.min.js +0 -1
- data/node_modules/lie/lib/browser.js +0 -273
- data/node_modules/lie/lib/index.js +0 -298
- data/node_modules/lie/license.md +0 -7
- data/node_modules/lie/lie.d.ts +0 -244
- data/node_modules/lie/package.json +0 -69
- data/node_modules/lie/polyfill.js +0 -4
- data/node_modules/minimatch/LICENSE +0 -15
- data/node_modules/minimatch/README.md +0 -209
- data/node_modules/minimatch/minimatch.js +0 -923
- data/node_modules/minimatch/package.json +0 -30
- data/node_modules/once/LICENSE +0 -15
- data/node_modules/once/README.md +0 -79
- data/node_modules/once/once.js +0 -42
- data/node_modules/once/package.json +0 -33
- data/node_modules/pako/CHANGELOG.md +0 -164
- data/node_modules/pako/LICENSE +0 -21
- data/node_modules/pako/README.md +0 -191
- data/node_modules/pako/dist/pako.js +0 -6818
- data/node_modules/pako/dist/pako.min.js +0 -1
- data/node_modules/pako/dist/pako_deflate.js +0 -3997
- data/node_modules/pako/dist/pako_deflate.min.js +0 -1
- data/node_modules/pako/dist/pako_inflate.js +0 -3300
- data/node_modules/pako/dist/pako_inflate.min.js +0 -1
- data/node_modules/pako/index.js +0 -14
- data/node_modules/pako/lib/deflate.js +0 -400
- data/node_modules/pako/lib/inflate.js +0 -423
- data/node_modules/pako/lib/utils/common.js +0 -105
- data/node_modules/pako/lib/utils/strings.js +0 -187
- data/node_modules/pako/lib/zlib/README +0 -59
- data/node_modules/pako/lib/zlib/adler32.js +0 -51
- data/node_modules/pako/lib/zlib/constants.js +0 -68
- data/node_modules/pako/lib/zlib/crc32.js +0 -59
- data/node_modules/pako/lib/zlib/deflate.js +0 -1874
- data/node_modules/pako/lib/zlib/gzheader.js +0 -58
- data/node_modules/pako/lib/zlib/inffast.js +0 -345
- data/node_modules/pako/lib/zlib/inflate.js +0 -1556
- data/node_modules/pako/lib/zlib/inftrees.js +0 -343
- data/node_modules/pako/lib/zlib/messages.js +0 -32
- data/node_modules/pako/lib/zlib/trees.js +0 -1222
- data/node_modules/pako/lib/zlib/zstream.js +0 -47
- data/node_modules/pako/package.json +0 -44
- data/node_modules/path-is-absolute/index.js +0 -20
- data/node_modules/path-is-absolute/license +0 -21
- data/node_modules/path-is-absolute/package.json +0 -43
- data/node_modules/path-is-absolute/readme.md +0 -59
- data/node_modules/process-nextick-args/index.js +0 -45
- data/node_modules/process-nextick-args/license.md +0 -19
- data/node_modules/process-nextick-args/package.json +0 -25
- data/node_modules/process-nextick-args/readme.md +0 -18
- data/node_modules/readable-stream/.travis.yml +0 -34
- data/node_modules/readable-stream/CONTRIBUTING.md +0 -38
- data/node_modules/readable-stream/GOVERNANCE.md +0 -136
- data/node_modules/readable-stream/LICENSE +0 -47
- data/node_modules/readable-stream/README.md +0 -58
- data/node_modules/readable-stream/doc/wg-meetings/2015-01-30.md +0 -60
- data/node_modules/readable-stream/duplex-browser.js +0 -1
- data/node_modules/readable-stream/duplex.js +0 -1
- data/node_modules/readable-stream/lib/_stream_duplex.js +0 -131
- data/node_modules/readable-stream/lib/_stream_passthrough.js +0 -47
- data/node_modules/readable-stream/lib/_stream_readable.js +0 -1019
- data/node_modules/readable-stream/lib/_stream_transform.js +0 -214
- data/node_modules/readable-stream/lib/_stream_writable.js +0 -687
- data/node_modules/readable-stream/lib/internal/streams/BufferList.js +0 -79
- data/node_modules/readable-stream/lib/internal/streams/destroy.js +0 -74
- data/node_modules/readable-stream/lib/internal/streams/stream-browser.js +0 -1
- data/node_modules/readable-stream/lib/internal/streams/stream.js +0 -1
- data/node_modules/readable-stream/package.json +0 -52
- data/node_modules/readable-stream/passthrough.js +0 -1
- data/node_modules/readable-stream/readable-browser.js +0 -7
- data/node_modules/readable-stream/readable.js +0 -19
- data/node_modules/readable-stream/transform.js +0 -1
- data/node_modules/readable-stream/writable-browser.js +0 -1
- data/node_modules/readable-stream/writable.js +0 -8
- data/node_modules/rimraf/LICENSE +0 -15
- data/node_modules/rimraf/README.md +0 -101
- data/node_modules/rimraf/bin.js +0 -50
- data/node_modules/rimraf/package.json +0 -29
- data/node_modules/rimraf/rimraf.js +0 -372
- data/node_modules/safe-buffer/LICENSE +0 -21
- data/node_modules/safe-buffer/README.md +0 -584
- data/node_modules/safe-buffer/index.d.ts +0 -187
- data/node_modules/safe-buffer/index.js +0 -62
- data/node_modules/safe-buffer/package.json +0 -37
- data/node_modules/selenium-webdriver/CHANGES.md +0 -1114
- data/node_modules/selenium-webdriver/LICENSE +0 -202
- data/node_modules/selenium-webdriver/NOTICE +0 -2
- data/node_modules/selenium-webdriver/README.md +0 -229
- data/node_modules/selenium-webdriver/chrome.js +0 -295
- data/node_modules/selenium-webdriver/chromium.js +0 -829
- data/node_modules/selenium-webdriver/devtools/CDPConnection.js +0 -35
- data/node_modules/selenium-webdriver/edge.js +0 -224
- data/node_modules/selenium-webdriver/example/chrome_android.js +0 -45
- data/node_modules/selenium-webdriver/example/chrome_mobile_emulation.js +0 -46
- data/node_modules/selenium-webdriver/example/firefox_channels.js +0 -84
- data/node_modules/selenium-webdriver/example/google_search.js +0 -50
- data/node_modules/selenium-webdriver/example/google_search_test.js +0 -70
- data/node_modules/selenium-webdriver/example/headless.js +0 -63
- data/node_modules/selenium-webdriver/example/logging.js +0 -64
- data/node_modules/selenium-webdriver/firefox.js +0 -789
- data/node_modules/selenium-webdriver/http/index.js +0 -324
- data/node_modules/selenium-webdriver/http/util.js +0 -172
- data/node_modules/selenium-webdriver/ie.js +0 -503
- data/node_modules/selenium-webdriver/index.js +0 -825
- data/node_modules/selenium-webdriver/io/exec.js +0 -162
- data/node_modules/selenium-webdriver/io/index.js +0 -348
- data/node_modules/selenium-webdriver/io/zip.js +0 -223
- data/node_modules/selenium-webdriver/lib/atoms/find-elements.js +0 -123
- data/node_modules/selenium-webdriver/lib/atoms/get-attribute.js +0 -101
- data/node_modules/selenium-webdriver/lib/atoms/is-displayed.js +0 -101
- data/node_modules/selenium-webdriver/lib/atoms/mutation-listener.js +0 -55
- data/node_modules/selenium-webdriver/lib/by.js +0 -415
- data/node_modules/selenium-webdriver/lib/capabilities.js +0 -553
- data/node_modules/selenium-webdriver/lib/command.js +0 -206
- data/node_modules/selenium-webdriver/lib/error.js +0 -605
- data/node_modules/selenium-webdriver/lib/http.js +0 -704
- data/node_modules/selenium-webdriver/lib/input.js +0 -946
- data/node_modules/selenium-webdriver/lib/logging.js +0 -661
- data/node_modules/selenium-webdriver/lib/promise.js +0 -285
- data/node_modules/selenium-webdriver/lib/proxy.js +0 -212
- data/node_modules/selenium-webdriver/lib/session.js +0 -77
- data/node_modules/selenium-webdriver/lib/symbols.js +0 -37
- data/node_modules/selenium-webdriver/lib/until.js +0 -429
- data/node_modules/selenium-webdriver/lib/webdriver.js +0 -2919
- data/node_modules/selenium-webdriver/net/index.js +0 -107
- data/node_modules/selenium-webdriver/net/portprober.js +0 -75
- data/node_modules/selenium-webdriver/opera.js +0 -406
- data/node_modules/selenium-webdriver/package.json +0 -54
- data/node_modules/selenium-webdriver/proxy.js +0 -32
- data/node_modules/selenium-webdriver/remote/index.js +0 -624
- data/node_modules/selenium-webdriver/safari.js +0 -168
- data/node_modules/selenium-webdriver/testing/index.js +0 -504
- data/node_modules/set-immediate-shim/index.js +0 -7
- data/node_modules/set-immediate-shim/package.json +0 -34
- data/node_modules/set-immediate-shim/readme.md +0 -31
- data/node_modules/string_decoder/.travis.yml +0 -50
- data/node_modules/string_decoder/LICENSE +0 -48
- data/node_modules/string_decoder/README.md +0 -47
- data/node_modules/string_decoder/lib/string_decoder.js +0 -296
- data/node_modules/string_decoder/package.json +0 -31
- data/node_modules/tmp/CHANGELOG.md +0 -288
- data/node_modules/tmp/LICENSE +0 -21
- data/node_modules/tmp/README.md +0 -365
- data/node_modules/tmp/lib/tmp.js +0 -780
- data/node_modules/tmp/node_modules/.bin/rimraf +0 -1
- data/node_modules/tmp/node_modules/rimraf/CHANGELOG.md +0 -65
- data/node_modules/tmp/node_modules/rimraf/LICENSE +0 -15
- data/node_modules/tmp/node_modules/rimraf/README.md +0 -101
- data/node_modules/tmp/node_modules/rimraf/bin.js +0 -68
- data/node_modules/tmp/node_modules/rimraf/package.json +0 -32
- data/node_modules/tmp/node_modules/rimraf/rimraf.js +0 -360
- data/node_modules/tmp/package.json +0 -58
- data/node_modules/util-deprecate/History.md +0 -16
- data/node_modules/util-deprecate/LICENSE +0 -24
- data/node_modules/util-deprecate/README.md +0 -53
- data/node_modules/util-deprecate/browser.js +0 -67
- data/node_modules/util-deprecate/node.js +0 -6
- data/node_modules/util-deprecate/package.json +0 -27
- data/node_modules/wrappy/LICENSE +0 -15
- data/node_modules/wrappy/README.md +0 -36
- data/node_modules/wrappy/package.json +0 -29
- data/node_modules/wrappy/wrappy.js +0 -33
- data/node_modules/ws/LICENSE +0 -21
- data/node_modules/ws/README.md +0 -496
- data/node_modules/ws/browser.js +0 -8
- data/node_modules/ws/index.js +0 -10
- data/node_modules/ws/lib/buffer-util.js +0 -129
- data/node_modules/ws/lib/constants.js +0 -10
- data/node_modules/ws/lib/event-target.js +0 -184
- data/node_modules/ws/lib/extension.js +0 -223
- data/node_modules/ws/lib/limiter.js +0 -55
- data/node_modules/ws/lib/permessage-deflate.js +0 -517
- data/node_modules/ws/lib/receiver.js +0 -507
- data/node_modules/ws/lib/sender.js +0 -405
- data/node_modules/ws/lib/stream.js +0 -165
- data/node_modules/ws/lib/validation.js +0 -104
- data/node_modules/ws/lib/websocket-server.js +0 -418
- data/node_modules/ws/lib/websocket.js +0 -942
- data/node_modules/ws/package.json +0 -56
- data/package-lock.json +0 -458
- data/package.json +0 -5
- data/selenium.log +0 -1
- data/spec.md +0 -6
- data/test.data +0 -2110
@@ -1,343 +0,0 @@
|
|
1
|
-
'use strict';
|
2
|
-
|
3
|
-
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
|
4
|
-
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
|
5
|
-
//
|
6
|
-
// This software is provided 'as-is', without any express or implied
|
7
|
-
// warranty. In no event will the authors be held liable for any damages
|
8
|
-
// arising from the use of this software.
|
9
|
-
//
|
10
|
-
// Permission is granted to anyone to use this software for any purpose,
|
11
|
-
// including commercial applications, and to alter it and redistribute it
|
12
|
-
// freely, subject to the following restrictions:
|
13
|
-
//
|
14
|
-
// 1. The origin of this software must not be misrepresented; you must not
|
15
|
-
// claim that you wrote the original software. If you use this software
|
16
|
-
// in a product, an acknowledgment in the product documentation would be
|
17
|
-
// appreciated but is not required.
|
18
|
-
// 2. Altered source versions must be plainly marked as such, and must not be
|
19
|
-
// misrepresented as being the original software.
|
20
|
-
// 3. This notice may not be removed or altered from any source distribution.
|
21
|
-
|
22
|
-
var utils = require('../utils/common');
|
23
|
-
|
24
|
-
var MAXBITS = 15;
|
25
|
-
var ENOUGH_LENS = 852;
|
26
|
-
var ENOUGH_DISTS = 592;
|
27
|
-
//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
|
28
|
-
|
29
|
-
var CODES = 0;
|
30
|
-
var LENS = 1;
|
31
|
-
var DISTS = 2;
|
32
|
-
|
33
|
-
var lbase = [ /* Length codes 257..285 base */
|
34
|
-
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
|
35
|
-
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
|
36
|
-
];
|
37
|
-
|
38
|
-
var lext = [ /* Length codes 257..285 extra */
|
39
|
-
16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
|
40
|
-
19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
|
41
|
-
];
|
42
|
-
|
43
|
-
var dbase = [ /* Distance codes 0..29 base */
|
44
|
-
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
|
45
|
-
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
|
46
|
-
8193, 12289, 16385, 24577, 0, 0
|
47
|
-
];
|
48
|
-
|
49
|
-
var dext = [ /* Distance codes 0..29 extra */
|
50
|
-
16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
|
51
|
-
23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
|
52
|
-
28, 28, 29, 29, 64, 64
|
53
|
-
];
|
54
|
-
|
55
|
-
module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)
|
56
|
-
{
|
57
|
-
var bits = opts.bits;
|
58
|
-
//here = opts.here; /* table entry for duplication */
|
59
|
-
|
60
|
-
var len = 0; /* a code's length in bits */
|
61
|
-
var sym = 0; /* index of code symbols */
|
62
|
-
var min = 0, max = 0; /* minimum and maximum code lengths */
|
63
|
-
var root = 0; /* number of index bits for root table */
|
64
|
-
var curr = 0; /* number of index bits for current table */
|
65
|
-
var drop = 0; /* code bits to drop for sub-table */
|
66
|
-
var left = 0; /* number of prefix codes available */
|
67
|
-
var used = 0; /* code entries in table used */
|
68
|
-
var huff = 0; /* Huffman code */
|
69
|
-
var incr; /* for incrementing code, index */
|
70
|
-
var fill; /* index for replicating entries */
|
71
|
-
var low; /* low bits for current root entry */
|
72
|
-
var mask; /* mask for low root bits */
|
73
|
-
var next; /* next available space in table */
|
74
|
-
var base = null; /* base value table to use */
|
75
|
-
var base_index = 0;
|
76
|
-
// var shoextra; /* extra bits table to use */
|
77
|
-
var end; /* use base and extra for symbol > end */
|
78
|
-
var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */
|
79
|
-
var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */
|
80
|
-
var extra = null;
|
81
|
-
var extra_index = 0;
|
82
|
-
|
83
|
-
var here_bits, here_op, here_val;
|
84
|
-
|
85
|
-
/*
|
86
|
-
Process a set of code lengths to create a canonical Huffman code. The
|
87
|
-
code lengths are lens[0..codes-1]. Each length corresponds to the
|
88
|
-
symbols 0..codes-1. The Huffman code is generated by first sorting the
|
89
|
-
symbols by length from short to long, and retaining the symbol order
|
90
|
-
for codes with equal lengths. Then the code starts with all zero bits
|
91
|
-
for the first code of the shortest length, and the codes are integer
|
92
|
-
increments for the same length, and zeros are appended as the length
|
93
|
-
increases. For the deflate format, these bits are stored backwards
|
94
|
-
from their more natural integer increment ordering, and so when the
|
95
|
-
decoding tables are built in the large loop below, the integer codes
|
96
|
-
are incremented backwards.
|
97
|
-
|
98
|
-
This routine assumes, but does not check, that all of the entries in
|
99
|
-
lens[] are in the range 0..MAXBITS. The caller must assure this.
|
100
|
-
1..MAXBITS is interpreted as that code length. zero means that that
|
101
|
-
symbol does not occur in this code.
|
102
|
-
|
103
|
-
The codes are sorted by computing a count of codes for each length,
|
104
|
-
creating from that a table of starting indices for each length in the
|
105
|
-
sorted table, and then entering the symbols in order in the sorted
|
106
|
-
table. The sorted table is work[], with that space being provided by
|
107
|
-
the caller.
|
108
|
-
|
109
|
-
The length counts are used for other purposes as well, i.e. finding
|
110
|
-
the minimum and maximum length codes, determining if there are any
|
111
|
-
codes at all, checking for a valid set of lengths, and looking ahead
|
112
|
-
at length counts to determine sub-table sizes when building the
|
113
|
-
decoding tables.
|
114
|
-
*/
|
115
|
-
|
116
|
-
/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
|
117
|
-
for (len = 0; len <= MAXBITS; len++) {
|
118
|
-
count[len] = 0;
|
119
|
-
}
|
120
|
-
for (sym = 0; sym < codes; sym++) {
|
121
|
-
count[lens[lens_index + sym]]++;
|
122
|
-
}
|
123
|
-
|
124
|
-
/* bound code lengths, force root to be within code lengths */
|
125
|
-
root = bits;
|
126
|
-
for (max = MAXBITS; max >= 1; max--) {
|
127
|
-
if (count[max] !== 0) { break; }
|
128
|
-
}
|
129
|
-
if (root > max) {
|
130
|
-
root = max;
|
131
|
-
}
|
132
|
-
if (max === 0) { /* no symbols to code at all */
|
133
|
-
//table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */
|
134
|
-
//table.bits[opts.table_index] = 1; //here.bits = (var char)1;
|
135
|
-
//table.val[opts.table_index++] = 0; //here.val = (var short)0;
|
136
|
-
table[table_index++] = (1 << 24) | (64 << 16) | 0;
|
137
|
-
|
138
|
-
|
139
|
-
//table.op[opts.table_index] = 64;
|
140
|
-
//table.bits[opts.table_index] = 1;
|
141
|
-
//table.val[opts.table_index++] = 0;
|
142
|
-
table[table_index++] = (1 << 24) | (64 << 16) | 0;
|
143
|
-
|
144
|
-
opts.bits = 1;
|
145
|
-
return 0; /* no symbols, but wait for decoding to report error */
|
146
|
-
}
|
147
|
-
for (min = 1; min < max; min++) {
|
148
|
-
if (count[min] !== 0) { break; }
|
149
|
-
}
|
150
|
-
if (root < min) {
|
151
|
-
root = min;
|
152
|
-
}
|
153
|
-
|
154
|
-
/* check for an over-subscribed or incomplete set of lengths */
|
155
|
-
left = 1;
|
156
|
-
for (len = 1; len <= MAXBITS; len++) {
|
157
|
-
left <<= 1;
|
158
|
-
left -= count[len];
|
159
|
-
if (left < 0) {
|
160
|
-
return -1;
|
161
|
-
} /* over-subscribed */
|
162
|
-
}
|
163
|
-
if (left > 0 && (type === CODES || max !== 1)) {
|
164
|
-
return -1; /* incomplete set */
|
165
|
-
}
|
166
|
-
|
167
|
-
/* generate offsets into symbol table for each length for sorting */
|
168
|
-
offs[1] = 0;
|
169
|
-
for (len = 1; len < MAXBITS; len++) {
|
170
|
-
offs[len + 1] = offs[len] + count[len];
|
171
|
-
}
|
172
|
-
|
173
|
-
/* sort symbols by length, by symbol order within each length */
|
174
|
-
for (sym = 0; sym < codes; sym++) {
|
175
|
-
if (lens[lens_index + sym] !== 0) {
|
176
|
-
work[offs[lens[lens_index + sym]]++] = sym;
|
177
|
-
}
|
178
|
-
}
|
179
|
-
|
180
|
-
/*
|
181
|
-
Create and fill in decoding tables. In this loop, the table being
|
182
|
-
filled is at next and has curr index bits. The code being used is huff
|
183
|
-
with length len. That code is converted to an index by dropping drop
|
184
|
-
bits off of the bottom. For codes where len is less than drop + curr,
|
185
|
-
those top drop + curr - len bits are incremented through all values to
|
186
|
-
fill the table with replicated entries.
|
187
|
-
|
188
|
-
root is the number of index bits for the root table. When len exceeds
|
189
|
-
root, sub-tables are created pointed to by the root entry with an index
|
190
|
-
of the low root bits of huff. This is saved in low to check for when a
|
191
|
-
new sub-table should be started. drop is zero when the root table is
|
192
|
-
being filled, and drop is root when sub-tables are being filled.
|
193
|
-
|
194
|
-
When a new sub-table is needed, it is necessary to look ahead in the
|
195
|
-
code lengths to determine what size sub-table is needed. The length
|
196
|
-
counts are used for this, and so count[] is decremented as codes are
|
197
|
-
entered in the tables.
|
198
|
-
|
199
|
-
used keeps track of how many table entries have been allocated from the
|
200
|
-
provided *table space. It is checked for LENS and DIST tables against
|
201
|
-
the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
|
202
|
-
the initial root table size constants. See the comments in inftrees.h
|
203
|
-
for more information.
|
204
|
-
|
205
|
-
sym increments through all symbols, and the loop terminates when
|
206
|
-
all codes of length max, i.e. all codes, have been processed. This
|
207
|
-
routine permits incomplete codes, so another loop after this one fills
|
208
|
-
in the rest of the decoding tables with invalid code markers.
|
209
|
-
*/
|
210
|
-
|
211
|
-
/* set up for code type */
|
212
|
-
// poor man optimization - use if-else instead of switch,
|
213
|
-
// to avoid deopts in old v8
|
214
|
-
if (type === CODES) {
|
215
|
-
base = extra = work; /* dummy value--not used */
|
216
|
-
end = 19;
|
217
|
-
|
218
|
-
} else if (type === LENS) {
|
219
|
-
base = lbase;
|
220
|
-
base_index -= 257;
|
221
|
-
extra = lext;
|
222
|
-
extra_index -= 257;
|
223
|
-
end = 256;
|
224
|
-
|
225
|
-
} else { /* DISTS */
|
226
|
-
base = dbase;
|
227
|
-
extra = dext;
|
228
|
-
end = -1;
|
229
|
-
}
|
230
|
-
|
231
|
-
/* initialize opts for loop */
|
232
|
-
huff = 0; /* starting code */
|
233
|
-
sym = 0; /* starting code symbol */
|
234
|
-
len = min; /* starting code length */
|
235
|
-
next = table_index; /* current table to fill in */
|
236
|
-
curr = root; /* current table index bits */
|
237
|
-
drop = 0; /* current bits to drop from code for index */
|
238
|
-
low = -1; /* trigger new sub-table when len > root */
|
239
|
-
used = 1 << root; /* use root table entries */
|
240
|
-
mask = used - 1; /* mask for comparing low */
|
241
|
-
|
242
|
-
/* check available table space */
|
243
|
-
if ((type === LENS && used > ENOUGH_LENS) ||
|
244
|
-
(type === DISTS && used > ENOUGH_DISTS)) {
|
245
|
-
return 1;
|
246
|
-
}
|
247
|
-
|
248
|
-
/* process all codes and make table entries */
|
249
|
-
for (;;) {
|
250
|
-
/* create table entry */
|
251
|
-
here_bits = len - drop;
|
252
|
-
if (work[sym] < end) {
|
253
|
-
here_op = 0;
|
254
|
-
here_val = work[sym];
|
255
|
-
}
|
256
|
-
else if (work[sym] > end) {
|
257
|
-
here_op = extra[extra_index + work[sym]];
|
258
|
-
here_val = base[base_index + work[sym]];
|
259
|
-
}
|
260
|
-
else {
|
261
|
-
here_op = 32 + 64; /* end of block */
|
262
|
-
here_val = 0;
|
263
|
-
}
|
264
|
-
|
265
|
-
/* replicate for those indices with low len bits equal to huff */
|
266
|
-
incr = 1 << (len - drop);
|
267
|
-
fill = 1 << curr;
|
268
|
-
min = fill; /* save offset to next table */
|
269
|
-
do {
|
270
|
-
fill -= incr;
|
271
|
-
table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;
|
272
|
-
} while (fill !== 0);
|
273
|
-
|
274
|
-
/* backwards increment the len-bit code huff */
|
275
|
-
incr = 1 << (len - 1);
|
276
|
-
while (huff & incr) {
|
277
|
-
incr >>= 1;
|
278
|
-
}
|
279
|
-
if (incr !== 0) {
|
280
|
-
huff &= incr - 1;
|
281
|
-
huff += incr;
|
282
|
-
} else {
|
283
|
-
huff = 0;
|
284
|
-
}
|
285
|
-
|
286
|
-
/* go to next symbol, update count, len */
|
287
|
-
sym++;
|
288
|
-
if (--count[len] === 0) {
|
289
|
-
if (len === max) { break; }
|
290
|
-
len = lens[lens_index + work[sym]];
|
291
|
-
}
|
292
|
-
|
293
|
-
/* create new sub-table if needed */
|
294
|
-
if (len > root && (huff & mask) !== low) {
|
295
|
-
/* if first time, transition to sub-tables */
|
296
|
-
if (drop === 0) {
|
297
|
-
drop = root;
|
298
|
-
}
|
299
|
-
|
300
|
-
/* increment past last table */
|
301
|
-
next += min; /* here min is 1 << curr */
|
302
|
-
|
303
|
-
/* determine length of next table */
|
304
|
-
curr = len - drop;
|
305
|
-
left = 1 << curr;
|
306
|
-
while (curr + drop < max) {
|
307
|
-
left -= count[curr + drop];
|
308
|
-
if (left <= 0) { break; }
|
309
|
-
curr++;
|
310
|
-
left <<= 1;
|
311
|
-
}
|
312
|
-
|
313
|
-
/* check for enough space */
|
314
|
-
used += 1 << curr;
|
315
|
-
if ((type === LENS && used > ENOUGH_LENS) ||
|
316
|
-
(type === DISTS && used > ENOUGH_DISTS)) {
|
317
|
-
return 1;
|
318
|
-
}
|
319
|
-
|
320
|
-
/* point entry in root table to sub-table */
|
321
|
-
low = huff & mask;
|
322
|
-
/*table.op[low] = curr;
|
323
|
-
table.bits[low] = root;
|
324
|
-
table.val[low] = next - opts.table_index;*/
|
325
|
-
table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;
|
326
|
-
}
|
327
|
-
}
|
328
|
-
|
329
|
-
/* fill in remaining table entry if code is incomplete (guaranteed to have
|
330
|
-
at most one remaining entry, since if the code is incomplete, the
|
331
|
-
maximum code length that was allowed to get this far is one bit) */
|
332
|
-
if (huff !== 0) {
|
333
|
-
//table.op[next + huff] = 64; /* invalid code marker */
|
334
|
-
//table.bits[next + huff] = len - drop;
|
335
|
-
//table.val[next + huff] = 0;
|
336
|
-
table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
|
337
|
-
}
|
338
|
-
|
339
|
-
/* set return parameters */
|
340
|
-
//opts.table_index += used;
|
341
|
-
opts.bits = root;
|
342
|
-
return 0;
|
343
|
-
};
|
@@ -1,32 +0,0 @@
|
|
1
|
-
'use strict';
|
2
|
-
|
3
|
-
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
|
4
|
-
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
|
5
|
-
//
|
6
|
-
// This software is provided 'as-is', without any express or implied
|
7
|
-
// warranty. In no event will the authors be held liable for any damages
|
8
|
-
// arising from the use of this software.
|
9
|
-
//
|
10
|
-
// Permission is granted to anyone to use this software for any purpose,
|
11
|
-
// including commercial applications, and to alter it and redistribute it
|
12
|
-
// freely, subject to the following restrictions:
|
13
|
-
//
|
14
|
-
// 1. The origin of this software must not be misrepresented; you must not
|
15
|
-
// claim that you wrote the original software. If you use this software
|
16
|
-
// in a product, an acknowledgment in the product documentation would be
|
17
|
-
// appreciated but is not required.
|
18
|
-
// 2. Altered source versions must be plainly marked as such, and must not be
|
19
|
-
// misrepresented as being the original software.
|
20
|
-
// 3. This notice may not be removed or altered from any source distribution.
|
21
|
-
|
22
|
-
module.exports = {
|
23
|
-
2: 'need dictionary', /* Z_NEED_DICT 2 */
|
24
|
-
1: 'stream end', /* Z_STREAM_END 1 */
|
25
|
-
0: '', /* Z_OK 0 */
|
26
|
-
'-1': 'file error', /* Z_ERRNO (-1) */
|
27
|
-
'-2': 'stream error', /* Z_STREAM_ERROR (-2) */
|
28
|
-
'-3': 'data error', /* Z_DATA_ERROR (-3) */
|
29
|
-
'-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */
|
30
|
-
'-5': 'buffer error', /* Z_BUF_ERROR (-5) */
|
31
|
-
'-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */
|
32
|
-
};
|