appium-mac2-driver 4.5.1 → 4.6.1

package/node_modules/vary/index.js

@@ -0,0 +1,149 @@
+/*!
+ * vary
+ * Copyright(c) 2014-2017 Douglas Christopher Wilson
+ * MIT Licensed
+ */
+
+'use strict'
+
+/**
+ * Module exports.
+ */
+
+module.exports = vary
+module.exports.append = append
+
+/**
+ * RegExp to match field-name in RFC 7230 sec 3.2
+ *
+ * field-name    = token
+ * token         = 1*tchar
+ * tchar         = "!" / "#" / "$" / "%" / "&" / "'" / "*"
+ *               / "+" / "-" / "." / "^" / "_" / "`" / "|" / "~"
+ *               / DIGIT / ALPHA
+ *               ; any VCHAR, except delimiters
+ */
+
+var FIELD_NAME_REGEXP = /^[!#$%&'*+\-.^_`|~0-9A-Za-z]+$/
+
+/**
+ * Append a field to a vary header.
+ *
+ * @param {String} header
+ * @param {String|Array} field
+ * @return {String}
+ * @public
+ */
+
+function append (header, field) {
+  if (typeof header !== 'string') {
+    throw new TypeError('header argument is required')
+  }
+
+  if (!field) {
+    throw new TypeError('field argument is required')
+  }
+
+  // get fields array
+  var fields = !Array.isArray(field)
+    ? parse(String(field))
+    : field
+
+  // assert on invalid field names
+  for (var j = 0; j < fields.length; j++) {
+    if (!FIELD_NAME_REGEXP.test(fields[j])) {
+      throw new TypeError('field argument contains an invalid header name')
+    }
+  }
+
+  // existing, unspecified vary
+  if (header === '*') {
+    return header
+  }
+
+  // enumerate current values
+  var val = header
+  var vals = parse(header.toLowerCase())
+
+  // unspecified vary
+  if (fields.indexOf('*') !== -1 || vals.indexOf('*') !== -1) {
+    return '*'
+  }
+
+  for (var i = 0; i < fields.length; i++) {
+    var fld = fields[i].toLowerCase()
+
+    // append value (case-preserving)
+    if (vals.indexOf(fld) === -1) {
+      vals.push(fld)
+      val = val
+        ? val + ', ' + fields[i]
+        : fields[i]
+    }
+  }
+
+  return val
+}
+
+/**
+ * Parse a vary header into an array.
+ *
+ * @param {String} header
+ * @return {Array}
+ * @private
+ */
+
+function parse (header) {
+  var end = 0
+  var list = []
+  var start = 0
+
+  // gather tokens
+  for (var i = 0, len = header.length; i < len; i++) {
+    switch (header.charCodeAt(i)) {
+      case 0x20: /*   */
+        if (start === end) {
+          start = end = i + 1
+        }
+        break
+      case 0x2c: /* , */
+        list.push(header.substring(start, end))
+        start = end = i + 1
+        break
+      default:
+        end = i + 1
+        break
+    }
+  }
+
+  // final token
+  list.push(header.substring(start, end))
+
+  return list
+}
+
+/**
+ * Mark that a request is varied on a header field.
+ *
+ * @param {Object} res
+ * @param {String|Array} field
+ * @public
+ */
+
+function vary (res, field) {
+  if (!res || !res.getHeader || !res.setHeader) {
+    // quack quack
+    throw new TypeError('res argument is required')
+  }
+
+  // get existing header
+  var val = res.getHeader('Vary') || ''
+  var header = Array.isArray(val)
+    ? val.join(', ')
+    : String(val)
+
+  // set new header
+  if ((val = append(header, field))) {
+    res.setHeader('Vary', val)
+  }
+}

package/node_modules/vary/package.json

@@ -0,0 +1,43 @@
+{
+  "name": "vary",
+  "description": "Manipulate the HTTP Vary header",
+  "version": "1.1.2",
+  "author": "Douglas Christopher Wilson <doug@somethingdoug.com>",
+  "license": "MIT",
+  "keywords": [
+    "http",
+    "res",
+    "vary"
+  ],
+  "repository": "jshttp/vary",
+  "devDependencies": {
+    "beautify-benchmark": "0.2.4",
+    "benchmark": "2.1.4",
+    "eslint": "3.19.0",
+    "eslint-config-standard": "10.2.1",
+    "eslint-plugin-import": "2.7.0",
+    "eslint-plugin-markdown": "1.0.0-beta.6",
+    "eslint-plugin-node": "5.1.1",
+    "eslint-plugin-promise": "3.5.0",
+    "eslint-plugin-standard": "3.0.1",
+    "istanbul": "0.4.5",
+    "mocha": "2.5.3",
+    "supertest": "1.1.0"
+  },
+  "files": [
+    "HISTORY.md",
+    "LICENSE",
+    "README.md",
+    "index.js"
+  ],
+  "engines": {
+    "node": ">= 0.8"
+  },
+  "scripts": {
+    "bench": "node benchmark/index.js",
+    "lint": "eslint --plugin markdown --ext js,md .",
+    "test": "mocha --reporter spec --bail --check-leaks test/",
+    "test-cov": "istanbul cover node_modules/mocha/bin/_mocha -- --reporter dot --check-leaks test/",
+    "test-travis": "istanbul cover node_modules/mocha/bin/_mocha --report lcovonly -- --reporter spec --check-leaks test/"
+  }
+}

package/node_modules/wbuf/README.md

@@ -0,0 +1,26 @@
+# wbuf
+
+#### LICENSE
+
+This software is licensed under the MIT License.
+
+Copyright Fedor Indutny, 2014.
+
+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.

package/node_modules/wbuf/index.js

@@ -0,0 +1,425 @@
+var assert = require('minimalistic-assert');
+var Buffer = require('buffer').Buffer;
+
+function WBuf() {
+  this.buffers = [];
+  this.toReserve = 0;
+  this.size = 0;
+  this.maxSize = 0;
+  this.avail = 0;
+
+  this.last = null;
+  this.offset = 0;
+
+  // Used in slicing
+  this.sliceQueue = null;
+
+  this.forceReserve = false;
+
+  // Mostly a constant
+  this.reserveRate = 64;
+}
+module.exports = WBuf;
+
+WBuf.prototype.reserve = function reserve(n) {
+  this.toReserve += n;
+
+  // Force reservation of extra bytes
+  if (this.forceReserve)
+    this.toReserve = Math.max(this.toReserve, this.reserveRate);
+};
+
+WBuf.prototype._ensure = function _ensure(n) {
+  if (this.avail >= n)
+    return;
+
+  if (this.toReserve === 0)
+    this.toReserve = this.reserveRate;
+
+  this.toReserve = Math.max(n - this.avail, this.toReserve);
+
+  if (this.avail === 0)
+    this._next();
+};
+
+WBuf.prototype._next = function _next() {
+  var buf;
+  if (this.sliceQueue === null) {
+    // Most common case
+    buf = new Buffer(this.toReserve);
+  } else {
+    // Only for `.slice()` results
+    buf = this.sliceQueue.shift();
+    if (this.sliceQueue.length === 0)
+      this.sliceQueue = null;
+  }
+
+  this.toReserve = 0;
+
+  this.buffers.push(buf);
+  this.avail = buf.length;
+  this.offset = 0;
+  this.last = buf;
+};
+
+WBuf.prototype._rangeCheck = function _rangeCheck() {
+  if (this.maxSize !== 0 && this.size > this.maxSize)
+    throw new RangeError('WBuf overflow');
+};
+
+WBuf.prototype._move = function _move(n) {
+  this.size += n;
+  if (this.avail === 0)
+    this.last = null;
+
+  this._rangeCheck();
+};
+
+WBuf.prototype.slice = function slice(start, end) {
+  assert(0 <= start && start <= this.size);
+  assert(0 <= end && end <= this.size);
+
+  if (this.last === null)
+    this._next();
+
+  var res = new WBuf();
+
+  // Only last chunk is requested
+  if (start >= this.size - this.offset) {
+    res.buffers.push(this.last);
+    res.last = this.last;
+    res.offset = start - this.size + this.offset;
+    res.maxSize = end - start;
+    res.avail = res.maxSize;
+
+    return res;
+  }
+
+  var startIndex = -1;
+  var startOffset = 0;
+  var endIndex = -1;
+
+  // Find buffer indices
+  var offset = 0;
+  for (var i = 0; i < this.buffers.length; i++) {
+    var buf = this.buffers[i];
+    var next = offset + buf.length;
+
+    // Found the start
+    if (start >= offset && start <= next) {
+      startIndex = i;
+      startOffset = start - offset;
+      if (endIndex !== -1)
+        break;
+    }
+    if (end >= offset && end <= next) {
+      endIndex = i;
+      if (startIndex !== -1)
+        break;
+    }
+
+    offset = next;
+  }
+
+  res.last = this.buffers[startIndex];
+  res.offset = startOffset;
+  res.maxSize = end - start;
+
+  // Multi-buffer slice
+  if (startIndex < endIndex) {
+    res.sliceQueue = this.buffers.slice(startIndex + 1, endIndex + 1);
+
+    res.last = res.last.slice(res.offset);
+    res.offset = 0;
+  }
+
+  res.avail = res.last.length - res.offset;
+  res.buffers.push(res.last);
+
+  return res;
+};
+
+WBuf.prototype.skip = function skip(n) {
+  if (n === 0)
+    return this.slice(this.size, this.size);
+
+  this._ensure(n);
+
+  var left = n;
+  while (left > 0) {
+    var toSkip = Math.min(left, this.avail);
+    left -= toSkip;
+    this.size += toSkip;
+    if (toSkip === this.avail) {
+      if (left !== 0) {
+        this._next();
+      } else {
+        this.avail -= toSkip;
+        this.offset += toSkip;
+      }
+    } else {
+      this.offset += toSkip;
+      this.avail -= toSkip;
+    }
+  }
+
+  this._rangeCheck();
+
+  return this.slice(this.size - n, this.size);
+};
+
+WBuf.prototype.write = function write(str) {
+  var len = 0;
+  for (var i = 0; i < str.length; i++) {
+    var c = str.charCodeAt(i);
+    if (c > 255)
+      len += 2;
+    else
+      len += 1;
+  }
+  this.reserve(len);
+  for (var i = 0; i < str.length; i++) {
+    var c = str.charCodeAt(i);
+    var hi = c >>> 8;
+    var lo = c & 0xff;
+
+    if (hi)
+      this.writeUInt8(hi);
+    this.writeUInt8(lo);
+  }
+};
+
+WBuf.prototype.copyFrom = function copyFrom(buf, start, end) {
+  var off = start === undefined ? 0 : start;
+  var len = end === undefined ? buf.length : end;
+  if (off === len)
+    return;
+
+  this._ensure(len - off);
+  while (off < len) {
+    var toCopy = Math.min(len - off, this.avail);
+    buf.copy(this.last, this.offset, off, off + toCopy);
+    off += toCopy;
+    this.size += toCopy;
+    if (toCopy === this.avail) {
+      if (off !== len) {
+        this._next();
+      } else {
+        this.avail = 0;
+        this.offset += toCopy;
+      }
+    } else {
+      this.offset += toCopy;
+      this.avail -= toCopy;
+    }
+  }
+
+  this._rangeCheck();
+};
+
+WBuf.prototype.writeUInt8 = function writeUInt8(v) {
+  this._ensure(1);
+
+  this.last[this.offset++] = v;
+  this.avail--;
+  this._move(1);
+};
+
+WBuf.prototype.writeUInt16BE = function writeUInt16BE(v) {
+  this._ensure(2);
+
+  // Fast case - everything fits into the last buffer
+  if (this.avail >= 2) {
+    this.last.writeUInt16BE(v, this.offset);
+    this.offset += 2;
+    this.avail -= 2;
+
+  // One byte here, one byte there
+  } else {
+    this.last[this.offset] = (v >>> 8);
+    this._next();
+    this.last[this.offset++] = v & 0xff;
+    this.avail--;
+  }
+
+  this._move(2);
+};
+
+WBuf.prototype.writeUInt24BE = function writeUInt24BE(v) {
+  this._ensure(3);
+
+  // Fast case - everything fits into the last buffer
+  if (this.avail >= 3) {
+    this.last.writeUInt16BE(v >>> 8, this.offset);
+    this.last[this.offset + 2] = v & 0xff;
+    this.offset += 3;
+    this.avail -= 3;
+    this._move(3);
+
+  // Two bytes here
+  } else if (this.avail >= 2) {
+    this.last.writeUInt16BE(v >>> 8, this.offset);
+    this._next();
+    this.last[this.offset++] = v & 0xff;
+    this.avail--;
+    this._move(3);
+
+  // Just one byte here
+  } else {
+    this.last[this.offset] = v >>> 16;
+    this._move(1);
+    this._next();
+    this.writeUInt16BE(v & 0xffff);
+  }
+};
+
+WBuf.prototype.writeUInt32BE = function writeUInt32BE(v) {
+  this._ensure(4);
+
+  // Fast case - everything fits into the last buffer
+  if (this.avail >= 4) {
+    this.last.writeUInt32BE(v, this.offset);
+    this.offset += 4;
+    this.avail -= 4;
+    this._move(4);
+
+  // Three bytes here
+  } else if (this.avail >= 3) {
+    this.writeUInt24BE(v >>> 8);
+    this._next();
+    this.last[this.offset++] = v & 0xff;
+    this.avail--;
+    this._move(1);
+
+  // Slow case, who cares
+  } else {
+    this.writeUInt16BE(v >>> 16);
+    this.writeUInt16BE(v & 0xffff);
+  }
+};
+
+WBuf.prototype.writeUInt16LE = function writeUInt16LE(num) {
+  var r = ((num & 0xff) << 8) | (num >>> 8);
+  this.writeUInt16BE(r);
+};
+
+WBuf.prototype.writeUInt24LE = function writeUInt24LE(num) {
+  var r = ((num & 0xff) << 16) | (((num >>> 8) & 0xff) << 8) | (num >>> 16);
+  this.writeUInt24BE(r);
+};
+
+WBuf.prototype.writeUInt32LE = function writeUInt32LE(num) {
+  this._ensure(4);
+
+  // Fast case - everything fits into the last buffer
+  if (this.avail >= 4) {
+    this.last.writeUInt32LE(num, this.offset);
+    this.offset += 4;
+    this.avail -= 4;
+    this._move(4);
+
+  // Three bytes here
+  } else if (this.avail >= 3) {
+    this.writeUInt24LE(num & 0xffffff);
+    this._next();
+    this.last[this.offset++] = num >>> 24;
+    this.avail--;
+    this._move(1);
+
+  // Slow case, who cares
+  } else {
+    this.writeUInt16LE(num & 0xffff);
+    this.writeUInt16LE(num >>> 16);
+  }
+};
+
+WBuf.prototype.render = function render() {
+  var left = this.size;
+  var out = [];
+
+  for (var i = 0; i < this.buffers.length && left >= 0; i++) {
+    var buf = this.buffers[i];
+    left -= buf.length;
+    if (left >= 0) {
+      out.push(buf);
+    } else {
+      out.push(buf.slice(0, buf.length + left));
+    }
+  }
+
+  return out;
+};
+
+// Signed APIs
+WBuf.prototype.writeInt8 = function writeInt8(num) {
+  if (num < 0)
+    return this.writeUInt8(0x100 + num);
+  else
+    return this.writeUInt8(num);
+};
+
+function toUnsigned16(num) {
+  if (num < 0)
+    return 0x10000 + num;
+  else
+    return num;
+}
+
+WBuf.prototype.writeInt16LE = function writeInt16LE(num) {
+  this.writeUInt16LE(toUnsigned16(num));
+};
+
+WBuf.prototype.writeInt16BE = function writeInt16BE(num) {
+  this.writeUInt16BE(toUnsigned16(num));
+};
+
+function toUnsigned24(num) {
+  if (num < 0)
+    return 0x1000000 + num;
+  else
+    return num;
+}
+
+WBuf.prototype.writeInt24LE = function writeInt24LE(num) {
+  this.writeUInt24LE(toUnsigned24(num));
+};
+
+WBuf.prototype.writeInt24BE = function writeInt24BE(num) {
+  this.writeUInt24BE(toUnsigned24(num));
+};
+
+function toUnsigned32(num) {
+  if (num < 0)
+    return (0xffffffff + num) + 1;
+  else
+    return num;
+}
+
+WBuf.prototype.writeInt32LE = function writeInt32LE(num) {
+  this.writeUInt32LE(toUnsigned32(num));
+};
+
+WBuf.prototype.writeInt32BE = function writeInt32BE(num) {
+  this.writeUInt32BE(toUnsigned32(num));
+};
+
+WBuf.prototype.writeComb = function writeComb(size, endian, value) {
+  if (size === 1)
+    return this.writeUInt8(value);
+
+  if (endian === 'le') {
+    if (size === 2)
+      this.writeUInt16LE(value);
+    else if (size === 3)
+      this.writeUInt24LE(value);
+    else if (size === 4)
+      this.writeUInt32LE(value);
+  } else {
+    if (size === 2)
+      this.writeUInt16BE(value);
+    else if (size === 3)
+      this.writeUInt24BE(value);
+    else if (size === 4)
+      this.writeUInt32BE(value);
+  }
+};

package/node_modules/wbuf/package.json

@@ -0,0 +1,29 @@
+{
+  "name": "wbuf",
+  "version": "1.7.3",
+  "description": "Write buffer",
+  "main": "index.js",
+  "scripts": {
+    "test": "mocha test/**/*-test.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git@github.com:indutny/wbuf"
+  },
+  "keywords": [
+    "Write",
+    "Buffer"
+  ],
+  "author": "Fedor Indutny <fedor@indutny.com>",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/indutny/wbuf/issues"
+  },
+  "homepage": "https://github.com/indutny/wbuf",
+  "devDependencies": {
+    "mocha": "^5.0.4"
+  },
+  "dependencies": {
+    "minimalistic-assert": "^1.0.0"
+  }
+}