appium-mac2-driver 4.5.1 → 4.6.0

package/node_modules/async-lock/lib/index.js

@@ -0,0 +1,312 @@
+'use strict';
+
+var AsyncLock = function (opts) {
+	opts = opts || {};
+
+	this.Promise = opts.Promise || Promise;
+
+	// format: {key : [fn, fn]}
+	// queues[key] = null indicates no job running for key
+	this.queues = Object.create(null);
+
+	// lock is reentrant for same domain
+	this.domainReentrant = opts.domainReentrant || false;
+	if (this.domainReentrant) {
+		if (typeof process === 'undefined' || typeof process.domain === 'undefined') {
+			throw new Error(
+				'Domain-reentrant locks require `process.domain` to exist. Please flip `opts.domainReentrant = false`, ' +
+				'use a NodeJS version that still implements Domain, or install a browser polyfill.');
+		}
+		// domain of current running func {key : fn}
+		this.domains = Object.create(null);
+	}
+
+	this.timeout = opts.timeout || AsyncLock.DEFAULT_TIMEOUT;
+	this.maxOccupationTime = opts.maxOccupationTime || AsyncLock.DEFAULT_MAX_OCCUPATION_TIME;
+	this.maxExecutionTime = opts.maxExecutionTime || AsyncLock.DEFAULT_MAX_EXECUTION_TIME;
+	if (opts.maxPending === Infinity || (Number.isInteger(opts.maxPending) && opts.maxPending >= 0)) {
+		this.maxPending = opts.maxPending;
+	} else {
+		this.maxPending = AsyncLock.DEFAULT_MAX_PENDING;
+	}
+};
+
+AsyncLock.DEFAULT_TIMEOUT = 0; //Never
+AsyncLock.DEFAULT_MAX_OCCUPATION_TIME = 0; //Never
+AsyncLock.DEFAULT_MAX_EXECUTION_TIME = 0; //Never
+AsyncLock.DEFAULT_MAX_PENDING = 1000;
+
+/**
+ * Acquire Locks
+ *
+ * @param {String|Array} key 	resource key or keys to lock
+ * @param {function} fn 	async function
+ * @param {function} cb 	callback function, otherwise will return a promise
+ * @param {Object} opts 	options
+ */
+AsyncLock.prototype.acquire = function (key, fn, cb, opts) {
+	if (Array.isArray(key)) {
+		return this._acquireBatch(key, fn, cb, opts);
+	}
+
+	if (typeof (fn) !== 'function') {
+		throw new Error('You must pass a function to execute');
+	}
+
+	// faux-deferred promise using new Promise() (as Promise.defer is deprecated)
+	var deferredResolve = null;
+	var deferredReject = null;
+	var deferred = null;
+
+	if (typeof (cb) !== 'function') {
+		opts = cb;
+		cb = null;
+
+		// will return a promise
+		deferred = new this.Promise(function(resolve, reject) {
+			deferredResolve = resolve;
+			deferredReject = reject;
+		});
+	}
+
+	opts = opts || {};
+
+	var resolved = false;
+	var timer = null;
+	var occupationTimer = null;
+	var executionTimer = null;
+	var self = this;
+
+	var done = function (locked, err, ret) {
+
+		if (occupationTimer) {
+			clearTimeout(occupationTimer);
+			occupationTimer = null;
+		}
+
+		if (executionTimer) {
+			clearTimeout(executionTimer);
+			executionTimer = null;
+		}
+
+		if (locked) {
+			if (!!self.queues[key] && self.queues[key].length === 0) {
+				delete self.queues[key];
+			}
+			if (self.domainReentrant) {
+				delete self.domains[key];
+			}
+		}
+
+		if (!resolved) {
+			if (!deferred) {
+				if (typeof (cb) === 'function') {
+					cb(err, ret);
+				}
+			}
+			else {
+				//promise mode
+				if (err) {
+					deferredReject(err);
+				}
+				else {
+					deferredResolve(ret);
+				}
+			}
+			resolved = true;
+		}
+
+		if (locked) {
+			//run next func
+			if (!!self.queues[key] && self.queues[key].length > 0) {
+				self.queues[key].shift()();
+			}
+		}
+	};
+
+	var exec = function (locked) {
+		if (resolved) { // may due to timed out
+			return done(locked);
+		}
+
+		if (timer) {
+			clearTimeout(timer);
+			timer = null;
+		}
+
+		if (self.domainReentrant && locked) {
+			self.domains[key] = process.domain;
+		}
+
+		var maxExecutionTime = opts.maxExecutionTime || self.maxExecutionTime;
+		if (maxExecutionTime) {
+			executionTimer = setTimeout(function () {
+				if (!!self.queues[key]) {
+					done(locked, new Error('Maximum execution time is exceeded ' + key));
+				}
+			}, maxExecutionTime);
+		}
+
+		// Callback mode
+		if (fn.length === 1) {
+			var called = false;
+			try {
+				fn(function (err, ret) {
+					if (!called) {
+						called = true;
+						done(locked, err, ret);
+					}
+				});
+			} catch (err) {
+				// catching error thrown in user function fn
+				if (!called) {
+					called = true;
+					done(locked, err);
+				}
+			}
+		}
+		else {
+			// Promise mode
+			self._promiseTry(function () {
+				return fn();
+			})
+			.then(function(ret){
+				done(locked, undefined, ret);
+			}, function(error){
+				done(locked, error);
+			});
+		}
+	};
+
+	if (self.domainReentrant && !!process.domain) {
+		exec = process.domain.bind(exec);
+	}
+
+	var maxPending = opts.maxPending || self.maxPending;
+
+	if (!self.queues[key]) {
+		self.queues[key] = [];
+		exec(true);
+	}
+	else if (self.domainReentrant && !!process.domain && process.domain === self.domains[key]) {
+		// If code is in the same domain of current running task, run it directly
+		// Since lock is re-enterable
+		exec(false);
+	}
+	else if (self.queues[key].length >= maxPending) {
+		done(false, new Error('Too many pending tasks in queue ' + key));
+	}
+	else {
+		var taskFn = function () {
+			exec(true);
+		};
+		if (opts.skipQueue) {
+			self.queues[key].unshift(taskFn);
+		} else {
+			self.queues[key].push(taskFn);
+		}
+
+		var timeout = opts.timeout || self.timeout;
+		if (timeout) {
+			timer = setTimeout(function () {
+				timer = null;
+				done(false, new Error('async-lock timed out in queue ' + key));
+			}, timeout);
+		}
+	}
+
+	var maxOccupationTime = opts.maxOccupationTime || self.maxOccupationTime;
+		if (maxOccupationTime) {
+			occupationTimer = setTimeout(function () {
+				if (!!self.queues[key]) {
+					done(false, new Error('Maximum occupation time is exceeded in queue ' + key));
+				}
+			}, maxOccupationTime);
+		}
+
+	if (deferred) {
+		return deferred;
+	}
+};
+
+/*
+ * Below is how this function works:
+ *
+ * Equivalent code:
+ * self.acquire(key1, function(cb){
+ *     self.acquire(key2, function(cb){
+ *         self.acquire(key3, fn, cb);
+ *     }, cb);
+ * }, cb);
+ *
+ * Equivalent code:
+ * var fn3 = getFn(key3, fn);
+ * var fn2 = getFn(key2, fn3);
+ * var fn1 = getFn(key1, fn2);
+ * fn1(cb);
+ */
+AsyncLock.prototype._acquireBatch = function (keys, fn, cb, opts) {
+	if (typeof (cb) !== 'function') {
+		opts = cb;
+		cb = null;
+	}
+
+	var self = this;
+	var getFn = function (key, fn) {
+		return function (cb) {
+			self.acquire(key, fn, cb, opts);
+		};
+	};
+
+	var fnx = keys.reduceRight(function (prev, key) {
+		return getFn(key, prev);
+	}, fn);
+
+	if (typeof (cb) === 'function') {
+		fnx(cb);
+	}
+	else {
+		return new this.Promise(function (resolve, reject) {
+			// check for promise mode in case keys is empty array
+			if (fnx.length === 1) {
+				fnx(function (err, ret) {
+					if (err) {
+						reject(err);
+					}
+					else {
+						resolve(ret);
+					}
+				});
+			} else {
+				resolve(fnx());
+			}
+		});
+	}
+};
+
+/*
+ *	Whether there is any running or pending asyncFunc
+ *
+ *	@param {String} key
+ */
+AsyncLock.prototype.isBusy = function (key) {
+	if (!key) {
+		return Object.keys(this.queues).length > 0;
+	}
+	else {
+		return !!this.queues[key];
+	}
+};
+
+/**
+ * Promise.try() implementation to become independent of Q-specific methods
+ */
+AsyncLock.prototype._promiseTry = function(fn) {
+	try {
+		return this.Promise.resolve(fn());
+	} catch (e) {
+		return this.Promise.reject(e);
+	}
+};
+
+module.exports = AsyncLock;

package/node_modules/async-lock/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "async-lock",
+  "description": "Lock on asynchronous code",
+  "version": "1.4.1",
+  "author": {
+    "name": "Rogier Schouten",
+    "url": "https://github.com/rogierschouten/",
+    "email": "github@workingcode.ninja"
+  },
+  "private": false,
+  "homepage": "https://github.com/rogierschouten/async-lock",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/rogierschouten/async-lock.git"
+  },
+  "bugs": {
+    "url": "https://github.com/rogierschouten/async-lock/issues"
+  },
+  "license": "MIT",
+  "keywords": [
+    "lock",
+    "async",
+    "concurrency",
+    "critical",
+    "section",
+    "mutex"
+  ],
+  "engines": {},
+  "scripts": {
+    "start": "grunt",
+    "test": "grunt test"
+  },
+  "devDependencies": {
+    "bluebird": "^3.5.1",
+    "grunt": "^1.0.4",
+    "grunt-cli": "^1.2.0",
+    "grunt-contrib-clean": "^1.1.0",
+    "grunt-contrib-jshint": "^3.2.0",
+    "grunt-contrib-watch": "^1.1.0",
+    "grunt-env": "^1.0.1",
+    "grunt-mocha-test": "^0.13.3",
+    "load-grunt-tasks": "^4.0.0",
+    "lodash": "^4.17.20",
+    "mocha": "^10.2.0",
+    "q": "^1.5.1",
+    "should": "^13.2.1"
+  }
+}

package/node_modules/bare-buffer/CMakeLists.txt

@@ -0,0 +1,30 @@
+cmake_minimum_required(VERSION 4.0)
+
+find_package(cmake-bare REQUIRED PATHS node_modules/cmake-bare)
+find_package(cmake-fetch REQUIRED PATHS node_modules/cmake-fetch)
+
+project(bare_buffer C)
+
+fetch_package("github:holepunchto/libutf#dca86e6")
+fetch_package("github:holepunchto/libbase64#078ad06")
+fetch_package("github:holepunchto/libhex#a4a2c84")
+
+add_bare_module(bare_buffer)
+
+target_sources(
+  ${bare_buffer}
+  PRIVATE
+    binding.c
+)
+
+target_link_libraries(
+  ${bare_buffer}
+  PRIVATE
+    $<TARGET_OBJECTS:utf>
+    $<TARGET_OBJECTS:base64>
+    $<TARGET_OBJECTS:hex>
+  PUBLIC
+    utf
+    base64
+    hex
+)

package/node_modules/bare-buffer/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/node_modules/bare-buffer/README.md

@@ -0,0 +1,26 @@
+# bare-buffer
+
+Native buffers for JavaScript.
+
+```
+npm i bare-buffer
+```
+
+## Usage
+
+```js
+const Buffer = require('bare-buffer')
+
+const message = Buffer.from('hello')
+const empty = Buffer.alloc(16)
+const buffer = Buffer.allocUnsafe(4).fill(123)
+const combined = Buffer.concat([buffer, buffer])
+```
+
+## API
+
+See the [`bare-buffer` reference](https://docs.pears.com/reference/bare/modules/bare-buffer).
+
+## License
+
+Apache-2.0