cline 1.0.1 → 1.0.3

package/node_modules/better-sqlite3/src/util/helpers.cpp

@@ -0,0 +1,109 @@
+inline v8::Local<v8::String> StringFromUtf8(v8::Isolate* isolate, const char* data, int length) {
+	return v8::String::NewFromUtf8(isolate, data, v8::NewStringType::kNormal, length).ToLocalChecked();
+}
+
+inline v8::Local<v8::String> InternalizedFromUtf8(v8::Isolate* isolate, const char* data, int length) {
+	return v8::String::NewFromUtf8(isolate, data, v8::NewStringType::kInternalized, length).ToLocalChecked();
+}
+
+inline v8::Local<v8::Value> InternalizedFromUtf8OrNull(v8::Isolate* isolate, const char* data, int length) {
+	if (data == NULL) return v8::Null(isolate);
+	return InternalizedFromUtf8(isolate, data, length);
+}
+
+inline v8::Local<v8::String> InternalizedFromLatin1(v8::Isolate* isolate, const char* str) {
+	return v8::String::NewFromOneByte(isolate, reinterpret_cast<const uint8_t*>(str), v8::NewStringType::kInternalized).ToLocalChecked();
+}
+
+inline void SetFrozen(v8::Isolate* isolate, v8::Local<v8::Context> ctx, v8::Local<v8::Object> obj, v8::Global<v8::String>& key, v8::Local<v8::Value> value) {
+	obj->DefineOwnProperty(ctx, key.Get(isolate), value, static_cast<v8::PropertyAttribute>(v8::DontDelete | v8::ReadOnly)).FromJust();
+}
+
+void ThrowError(const char* message) { EasyIsolate; isolate->ThrowException(v8::Exception::Error(StringFromUtf8(isolate, message, -1))); }
+void ThrowTypeError(const char* message) { EasyIsolate; isolate->ThrowException(v8::Exception::TypeError(StringFromUtf8(isolate, message, -1))); }
+void ThrowRangeError(const char* message) { EasyIsolate; isolate->ThrowException(v8::Exception::RangeError(StringFromUtf8(isolate, message, -1))); }
+
+// Determines whether to skip the given character at the start of an SQL string.
+inline bool IS_SKIPPED(char c) {
+	return c == ' ' || c == ';' || (c >= '\t' && c <= '\r');
+}
+
+// Allocates an empty array, without calling constructors/initializers.
+template<class T> inline T* ALLOC_ARRAY(size_t count) {
+	return static_cast<T*>(::operator new[](count * sizeof(T)));
+}
+
+// Deallocates an array, without calling destructors.
+template<class T> inline void FREE_ARRAY(T* array_pointer) {
+	::operator delete[](array_pointer);
+}
+
+v8::Local<v8::FunctionTemplate> NewConstructorTemplate(
+	v8::Isolate* isolate,
+	v8::Local<v8::External> data,
+	v8::FunctionCallback func,
+	const char* name
+) {
+	v8::Local<v8::FunctionTemplate> t = v8::FunctionTemplate::New(isolate, func, data);
+	t->InstanceTemplate()->SetInternalFieldCount(1);
+	t->SetClassName(InternalizedFromLatin1(isolate, name));
+	return t;
+}
+
+void SetPrototypeMethod(
+	v8::Isolate* isolate,
+	v8::Local<v8::External> data,
+	v8::Local<v8::FunctionTemplate> recv,
+	const char* name,
+	v8::FunctionCallback func
+) {
+	v8::HandleScope scope(isolate);
+	recv->PrototypeTemplate()->Set(
+		InternalizedFromLatin1(isolate, name),
+		v8::FunctionTemplate::New(isolate, func, data, v8::Signature::New(isolate, recv))
+	);
+}
+
+void SetPrototypeSymbolMethod(
+	v8::Isolate* isolate,
+	v8::Local<v8::External> data,
+	v8::Local<v8::FunctionTemplate> recv,
+	v8::Local<v8::Symbol> symbol,
+	v8::FunctionCallback func
+) {
+	v8::HandleScope scope(isolate);
+	recv->PrototypeTemplate()->Set(
+		symbol,
+		v8::FunctionTemplate::New(isolate, func, data, v8::Signature::New(isolate, recv))
+	);
+}
+
+void SetPrototypeGetter(
+	v8::Isolate* isolate,
+	v8::Local<v8::External> data,
+	v8::Local<v8::FunctionTemplate> recv,
+	const char* name,
+	v8::AccessorNameGetterCallback func
+) {
+	v8::HandleScope scope(isolate);
+	recv->InstanceTemplate()->SetNativeDataProperty(
+		InternalizedFromLatin1(isolate, name),
+		func,
+		0,
+		data
+	);
+}
+
+#if defined(V8_ENABLE_SANDBOX)
+// When V8 Sandbox is enabled (in newer Electron versions), we need to use Buffer::Copy
+// instead of Buffer::New to ensure the ArrayBuffer backing store is allocated inside the sandbox
+static inline v8::MaybeLocal<v8::Object> BufferSandboxNew(v8::Isolate* isolate, char* data, size_t length, void (*finalizeCallback)(char*, void*), void* finalizeHint) {
+    v8::MaybeLocal<v8::Object> buffer = node::Buffer::Copy(isolate, data, length);
+    finalizeCallback(data, finalizeHint);
+    return buffer;
+}
+#define SAFE_NEW_BUFFER(env, data, length, finalizeCallback, finalizeHint) BufferSandboxNew(env, data, length, finalizeCallback, finalizeHint)
+#else
+// When V8 Sandbox is not enabled, we can use the more efficient Buffer::New
+#define SAFE_NEW_BUFFER(env, data, length, finalizeCallback, finalizeHint) node::Buffer::New(env, data, length, finalizeCallback, finalizeHint)
+#endif

package/node_modules/better-sqlite3/src/util/macros.cpp

@@ -0,0 +1,63 @@
+#define NODE_ARGUMENTS const v8::FunctionCallbackInfo<v8::Value>&
+#define NODE_ARGUMENTS_POINTER const v8::FunctionCallbackInfo<v8::Value>*
+#define NODE_METHOD(name) void name(NODE_ARGUMENTS info)
+#define NODE_GETTER(name) void name(v8::Local<v8::Name> _, const v8::PropertyCallbackInfo<v8::Value>& info)
+#define INIT(name) v8::Local<v8::Function> name(v8::Isolate* isolate, v8::Local<v8::External> data)
+
+#define EasyIsolate v8::Isolate* isolate = v8::Isolate::GetCurrent()
+#define OnlyIsolate info.GetIsolate()
+#define OnlyContext isolate->GetCurrentContext()
+#define OnlyAddon static_cast<Addon*>(info.Data().As<v8::External>()->Value())
+#define UseIsolate v8::Isolate* isolate = OnlyIsolate
+#define UseContext v8::Local<v8::Context> ctx = OnlyContext
+#define UseAddon Addon* addon = OnlyAddon
+#define Unwrap node::ObjectWrap::Unwrap
+
+#define REQUIRE_ARGUMENT_ANY(at, var)                                          \
+	if (info.Length() <= (at()))                                               \
+		return ThrowTypeError("Expected a "#at" argument");                    \
+	var = info[at()]
+
+#define _REQUIRE_ARGUMENT(at, var, Type, message, ...)                         \
+	if (info.Length() <= (at()) || !info[at()]->Is##Type())                    \
+		return ThrowTypeError("Expected "#at" argument to be "#message);       \
+	var = (info[at()].As<v8::Type>())__VA_ARGS__
+
+#define REQUIRE_ARGUMENT_INT32(at, var)                                        \
+	_REQUIRE_ARGUMENT(at, var, Int32, a 32-bit signed integer, ->Value())
+#define REQUIRE_ARGUMENT_BOOLEAN(at, var)                                      \
+	_REQUIRE_ARGUMENT(at, var, Boolean, a boolean, ->Value())
+#define REQUIRE_ARGUMENT_STRING(at, var)                                       \
+	_REQUIRE_ARGUMENT(at, var, String, a string)
+#define REQUIRE_ARGUMENT_OBJECT(at, var)                                       \
+	_REQUIRE_ARGUMENT(at, var, Object, an object)
+#define REQUIRE_ARGUMENT_FUNCTION(at, var)                                     \
+	_REQUIRE_ARGUMENT(at, var, Function, a function)
+
+#define REQUIRE_DATABASE_OPEN(db)                                              \
+	if (!db->open)                                                             \
+		return ThrowTypeError("The database connection is not open")
+#define REQUIRE_DATABASE_NOT_BUSY(db)                                          \
+	if (db->busy)                                                              \
+		return ThrowTypeError("This database connection is busy executing a query")
+#define REQUIRE_DATABASE_NO_ITERATORS(db)                                      \
+	if (db->iterators)                                                         \
+		return ThrowTypeError("This database connection is busy executing a query")
+#define REQUIRE_DATABASE_NO_ITERATORS_UNLESS_UNSAFE(db)                        \
+	if (!db->unsafe_mode) {                                                    \
+		REQUIRE_DATABASE_NO_ITERATORS(db);                                     \
+	} ((void)0)
+#define REQUIRE_STATEMENT_NOT_LOCKED(stmt)                                     \
+	if (stmt->locked)                                                          \
+		return ThrowTypeError("This statement is busy executing a query")
+
+#define first() 0
+#define second() 1
+#define third() 2
+#define fourth() 3
+#define fifth() 4
+#define sixth() 5
+#define seventh() 6
+#define eighth() 7
+#define ninth() 8
+#define tenth() 9

package/node_modules/better-sqlite3/src/util/query-macros.cpp

@@ -0,0 +1,71 @@
+#define STATEMENT_BIND(handle)                                                 \
+	Binder binder(handle);                                                     \
+	if (!binder.Bind(info, info.Length(), stmt)) {                             \
+		sqlite3_clear_bindings(handle);                                        \
+		return;                                                                \
+	} ((void)0)
+
+#define STATEMENT_THROW_LOGIC()                                                \
+	db->ThrowDatabaseError();                                                  \
+	if (!bound) { sqlite3_clear_bindings(handle); }                            \
+	return
+
+#define STATEMENT_RETURN_LOGIC(return_value)                                   \
+	info.GetReturnValue().Set(return_value);                                   \
+	if (!bound) { sqlite3_clear_bindings(handle); }                            \
+	return
+
+#define STATEMENT_START_LOGIC(RETURNS_DATA_CHECK, MUTATE_CHECK)                \
+	Statement* stmt = Unwrap<Statement>(info.This());                          \
+	RETURNS_DATA_CHECK();                                                      \
+	sqlite3_stmt* handle = stmt->handle;                                       \
+	Database* db = stmt->db;                                                   \
+	REQUIRE_DATABASE_OPEN(db->GetState());                                     \
+	REQUIRE_DATABASE_NOT_BUSY(db->GetState());                                 \
+	MUTATE_CHECK();                                                            \
+	const bool bound = stmt->bound;                                            \
+	if (!bound) {                                                              \
+		STATEMENT_BIND(handle);                                                \
+	} else if (info.Length() > 0) {                                            \
+		return ThrowTypeError("This statement already has bound parameters");  \
+	} ((void)0)
+
+
+#define STATEMENT_THROW() db->GetState()->busy = false; STATEMENT_THROW_LOGIC()
+#define STATEMENT_RETURN(x) db->GetState()->busy = false; STATEMENT_RETURN_LOGIC(x)
+#define STATEMENT_START(x, y)                                                  \
+	STATEMENT_START_LOGIC(x, y);                                               \
+	db->GetState()->busy = true;                                               \
+	UseIsolate;                                                                \
+	if (db->Log(isolate, handle)) {                                            \
+		STATEMENT_THROW();                                                     \
+	} ((void)0)
+
+
+#define DOES_NOT_MUTATE() REQUIRE_STATEMENT_NOT_LOCKED(stmt)
+#define DOES_MUTATE()                                                          \
+	REQUIRE_STATEMENT_NOT_LOCKED(stmt);                                        \
+	REQUIRE_DATABASE_NO_ITERATORS_UNLESS_UNSAFE(db->GetState())
+#define DOES_ADD_ITERATOR()                                                    \
+	DOES_NOT_MUTATE();                                                         \
+	if (db->GetState()->iterators == USHRT_MAX)                                \
+		return ThrowRangeError("Too many active database iterators")
+#define REQUIRE_STATEMENT_RETURNS_DATA()                                       \
+	if (!stmt->returns_data)                                                   \
+		return ThrowTypeError("This statement does not return data. Use run() instead")
+#define ALLOW_ANY_STATEMENT()                                                  \
+	((void)0)
+
+
+#define _FUNCTION_START(type)                                                  \
+	type* self = static_cast<type*>(sqlite3_user_data(invocation));            \
+	v8::Isolate* isolate = self->isolate;                                      \
+	v8::HandleScope scope(isolate)
+
+#define FUNCTION_START()                                                       \
+	_FUNCTION_START(CustomFunction)
+
+#define AGGREGATE_START()                                                      \
+	_FUNCTION_START(CustomAggregate);                                          \
+	Accumulator* acc = self->GetAccumulator(invocation);                       \
+	if (acc->value.IsEmpty()) return

package/node_modules/better-sqlite3/src/util/row-builder.cpp

@@ -0,0 +1,49 @@
+class RowBuilder {
+public:
+
+	explicit RowBuilder(
+		v8::Isolate* isolate,
+		sqlite3_stmt* handle,
+		bool safe_ints
+	) :
+		isolate(isolate),
+		handle(handle),
+		column_count(-1),
+		safe_ints(safe_ints),
+		keys(isolate) {}
+
+	v8::Local<v8::Value> GetRowJS() {
+		if (column_count < 0) {
+			column_count = sqlite3_column_count(handle);
+			keys.reserve(column_count);
+			for (int i = 0; i < column_count; ++i) {
+				keys.emplace_back(
+					InternalizedFromUtf8(isolate, sqlite3_column_name(handle, i), -1)
+						.As<v8::Name>()
+				);
+			}
+		}
+
+		v8::LocalVector<v8::Value> values(isolate);
+		values.reserve(column_count);
+		for (int i = 0; i < column_count; ++i) {
+			values.emplace_back(
+				Data::GetValueJS(isolate, handle, i, safe_ints)
+			);
+		}
+
+		return v8::Object::New(isolate,
+			v8::Object::New(isolate)->GetPrototype(),
+			keys.data(),
+			values.data(),
+			column_count
+		);
+	}
+
+private:
+	v8::Isolate* isolate;
+	sqlite3_stmt* handle;
+	int column_count;
+	const bool safe_ints;
+	v8::LocalVector<v8::Name> keys;
+};

package/node_modules/events-universal/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/events-universal/README.md

@@ -0,0 +1,17 @@
+# events-universal
+
+Universal wrapper for the Node.js `events` module.
+
+```
+npm i events-universal
+```
+
+## Usage
+
+```js
+const EventEmitter = require('events-universal')
+```
+
+## License
+
+Apache-2.0

package/node_modules/events-universal/bare.js

@@ -0,0 +1 @@
+module.exports = require('bare-events')

package/node_modules/events-universal/default.js

@@ -0,0 +1 @@
+module.exports = require('events')

package/node_modules/events-universal/index.js

@@ -0,0 +1 @@
+module.exports = require('bare-events')

package/node_modules/events-universal/package.json

@@ -0,0 +1,39 @@
+{
+  "name": "events-universal",
+  "version": "1.0.1",
+  "description": "Universal wrapper for the Node.js events module",
+  "exports": {
+    "./package": "./package.json",
+    ".": {
+      "bare": "./bare.js",
+      "react-native": "./react-native.js",
+      "default": "./default.js"
+    }
+  },
+  "files": [
+    "index.js",
+    "default.js",
+    "bare.js",
+    "react-native.js"
+  ],
+  "scripts": {
+    "test": "prettier . --check"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/holepunchto/events-universal.git"
+  },
+  "author": "Holepunch",
+  "license": "Apache-2.0",
+  "bugs": {
+    "url": "https://github.com/holepunchto/events-universal/issues"
+  },
+  "homepage": "https://github.com/holepunchto/events-universal#readme",
+  "dependencies": {
+    "bare-events": "^2.7.0"
+  },
+  "devDependencies": {
+    "prettier": "^3.4.2",
+    "prettier-config-holepunch": "^1.0.0"
+  }
+}

package/node_modules/events-universal/react-native.js

@@ -0,0 +1 @@
+module.exports = require('bare-events')

package/node_modules/{fs-constants → fast-fifo}/LICENSE

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2018 Mathias Buus
+Copyright (c) 2019 Mathias Buus
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

package/node_modules/fast-fifo/README.md

@@ -0,0 +1,78 @@
+# fast-fifo
+
+A fast fifo implementation similar to the one powering nextTick in Node.js core
+
+```
+npm install fast-fifo
+```
+
+Uses a linked list of growing fixed sized arrays to implement the FIFO to avoid
+allocating a wrapper object for each item.
+
+## Usage
+
+``` js
+const FIFO = require('fast-fifo')
+
+const q = new FIFO()
+
+q.push('hello')
+q.push('world')
+
+q.shift() // returns hello
+q.shift() // returns world
+```
+
+## API
+
+#### `q = new FIFO()`
+
+Create a new FIFO.
+
+#### `q.push(value)`
+
+Push a value to the FIFO. `value` can be anything other than undefined.
+
+#### `value = q.shift()`
+
+Return the oldest value from the FIFO.
+
+#### `q.clear()`
+
+Remove all values from the FIFO.
+
+#### `bool = q.isEmpty()`
+
+Returns `true` if the FIFO is empty and false otherwise.
+
+#### `value = q.peek()`
+
+Return the oldest value from the FIFO without shifting it out.
+
+#### `len = q.length`
+
+Get the number of entries remaining in the FIFO.
+
+## Benchmarks
+
+Included in bench.js is a simple benchmark that benchmarks this against a simple
+linked list based FIFO.
+
+On my machine the benchmark looks like this:
+
+```
+fifo bulk push and shift: 2881.508ms
+fifo individual push and shift: 3248.437ms
+fast-fifo bulk push and shift: 1606.972ms
+fast-fifo individual push and shift: 1328.064ms
+fifo bulk push and shift: 3266.902ms
+fifo individual push and shift: 3320.944ms
+fast-fifo bulk push and shift: 1858.307ms
+fast-fifo individual push and shift: 1516.983ms
+```
+
+YMMV
+
+## License
+
+MIT