Oracle OpenSearch Dashboards Licenses
------------------------------ Top-Level License -------------------------------
SPDX:Apache-2.0
---------------------------------- Copyright -----------------------------------
Copyright (c) 2007-2014 IOLA and Ole Laursen
Copyright (c) 2007-2014 IOLA and Ole Laursen.
Copyright (c) 2008, Three Dub Media (http://threedubmedia.com)
Copyright (c) 2010 "Cowboy" Ben Alman
Copyright (c) 2010 Xuan Luo.
Copyright (c) 2010, Ajax.org B.V.
Copyright (c) 2011 Brandon Aaron (http://brandonaaron.net)
Copyright (c) 2011 Guillermo Rauch <guillermo@learnboost.com>
Copyright (c) 2011-2015 Twitter, Inc
Copyright (c) 2013-2014 sha.js contributors
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2014 Steven Skelton
Copyright (c) 2014-2016, Jon Schlinkert.
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright (c) 2014-2020 Teambition
Copyright (c) 2014-present Sebastian McKenzie and other contributors
Copyright (c) 2014-present, Jon Schlinkert.
Copyright (c) 2015, Jon Schlinkert.
Copyright (c) 2015-present, Ben Mosher
Copyright (c) 2015-present, Jon Schlinkert.
Copyright (c) 2016-2018 The Inter UI Project Authors (me@rsms.me)
Copyright (c) 2016-present, jszhou
Copyright (c) 2017 Brandon Keepers
Copyright (c) 2018 Cody Olsen
Copyright (c) Brian Zengel <https://github.com/bczengel>, Ilya Mochalov <https://github.com/chrootsu>
Copyright (c) Elasticsearch BV
Copyright (c) JS Foundation and other contributors <https://js.foundation/>
Copyright (c) Microsoft Corporation.
Copyright 2009-2021 Elasticsearch B.V.
Copyright 2015 The Rubik Project Authors (https://github.com/googlefonts/rubik)
----------------------------------- Notices ------------------------------------
OpenSearch (https://opensearch.org/)
Copyright OpenSearch Contributors
This product includes software, including Kibana source code,
developed by Elasticsearch (http://www.elastic.co).
Copyright 2009-2021 Elasticsearch B.V.
This product includes software developed by The Apache Software
Foundation (http://www.apache.org/)
This product includes software developed by
Joda.org (http://www.joda.org/).
---
Pretty handling of logarithmic axes.
Copyright (c) 2007-2014 IOLA and Ole Laursen.
Licensed under the MIT license.
Created by Arne de Laat
Set axis.mode to "log" and make the axis logarithmic using transform:
axis: {
mode: 'log',
transform: function(v) {v <= 0 ? Math.log(v) / Math.LN10 : null},
inverseTransform: function(v) {Math.pow(10, v)}
}
The transform filters negative and zero values, because those are
invalid on logarithmic scales.
This plugin tries to create good looking logarithmic ticks, using
unicode superscript characters. If all data to be plotted is between two
powers of ten then the default flot tick generator and renderer are
used. Logarithmic ticks are places at powers of ten and at half those
values if there are not to many ticks already (e.g. [1, 5, 10, 50, 100]).
For details, see https://github.com/flot/flot/pull/1328
---
This module was heavily inspired by the externals plugin that ships with webpack@97d58d31
MIT License http://www.opensource.org/licenses/mit-license.php
Author Tobias Koppers @sokra
---
This product includes code that is based on Ace editor, which was available
under a "BSD" license.
Distributed under the BSD license:
Copyright (c) 2010, Ajax.org B.V.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Ajax.org B.V. nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL AJAX.ORG B.V. BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---
This product includes code that is based on Ace editor, which was available
under a "BSD" license.
Distributed under the BSD license:
Copyright (c) 2010, Ajax.org B.V.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Ajax.org B.V. nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL AJAX.ORG B.V. BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
---
This product includes code that is based on flot-charts, which was available
under a "MIT" license.
The MIT License (MIT)
Copyright (c) 2007-2014 IOLA and Ole Laursen
---
Based on the scroll-into-view-if-necessary module from npm
https://github.com/stipsan/compute-scroll-into-view/blob/master/src/index.ts#L269-L340
MIT License
Copyright (c) 2018 Cody Olsen
---
MIT License
Copyright (c) 2014-present Sebastian McKenzie and other contributors
---
This product bundles bootstrap@3.3.6 which is available under a
"MIT" license.
The MIT License (MIT)
Copyright (c) 2011-2015 Twitter, Inc
---
This product bundles childnode-remove which is available under a
"MIT" license.
The MIT License (MIT)
Copyright (c) 2016-present, jszhou
https://github.com/jserz/js_piece
---
This product bundles code based on probot-metadata@1.0.0 which is
available under a "MIT" license.
ISC License
Copyright (c) 2017 Brandon Keepers
-------------------------- Fourth Party Dependencies ---------------------------
----------------------------------- Licenses -----------------------------------
- MIT
- Apache-2.0
- BSD-2-Clause
- BSD-3-Clause
- ISC
- Python-2.0
- Unlicense
- CC0-1.0
- WTFPL
- Public Domain
- CC-BY-3.0
- BSD-0-Clause
--------------------------------- (separator) ----------------------------------
== Dependency
@adobe/css-tools
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2022 Jean-Philippe Zolesio <holblin@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@ampproject/remapping
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Google LLC
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/branch-keystore-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/cache-material
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/caching-materials-manager-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/client-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/crc32
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS Crypto Tools Team', 'email': 'aws-cryptools@amazon.com', 'url': 'https://docs.aws.amazon.com/aws-crypto-tools/index.html?id=docs_gateway#lang/en_us'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/decrypt-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/encrypt-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/hkdf-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/kdf-ctr-mode-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/kms-keyring-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/kms-keyring
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/material-management-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/material-management
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/raw-aes-keyring-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/raw-keyring
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/raw-rsa-keyring-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/serialize
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/sha256-browser
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS Crypto Tools Team', 'email': 'aws-cryptools@amazon.com', 'url': 'https://docs.aws.amazon.com/aws-crypto-tools/index.html?id=docs_gateway#lang/en_us'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/sha256-js
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS Crypto Tools Team', 'email': 'aws-cryptools@amazon.com', 'url': 'https://docs.aws.amazon.com/aws-crypto-tools/index.html?id=docs_gateway#lang/en_us'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/supports-web-crypto
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS Crypto Tools Team', 'email': 'aws-cryptools@amazon.com', 'url': 'https://docs.aws.amazon.com/aws-crypto-tools/index.html?id=docs_gateway#lang/en_us'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-crypto/util
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS Crypto Tools Team', 'email': 'aws-cryptools@amazon.com', 'url': 'https://docs.aws.amazon.com/aws-crypto-tools/index.html?id=docs_gateway#lang/en_us'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/abort-controller
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/client-dynamodb
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/client-kms
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/client-sso
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/client-sts
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/core
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS SDK for JavaScript Team', 'url': 'https://aws.amazon.com/javascript/'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-env
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-http
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS SDK for JavaScript Team', 'url': 'https://aws.amazon.com/javascript/'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-ini
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-process
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-sso
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/credential-provider-web-identity
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/endpoint-cache
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/middleware-endpoint-discovery
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/middleware-host-header
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/middleware-logger
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/middleware-recursion-detection
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/middleware-user-agent
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/nested-clients
== License Type
SPDX:Apache-2.0
== Copyright
{'name': 'AWS SDK for JavaScript Team', 'url': 'https://aws.amazon.com/javascript/'}
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/node-http-handler
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/protocol-http
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/region-config-resolver
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/signature-v4
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/token-providers
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/types
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/util-dynamodb
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/util-endpoints
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/util-locate-window
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/util-user-agent-browser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/util-user-agent-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@aws-sdk/util-utf8-browser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/cli
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/code-frame
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/compat-data
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/core
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/generator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-annotate-as-pure
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-builder-binary-assignment-operator-visitor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-compilation-targets
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-create-class-features-plugin
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-create-regexp-features-plugin
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-define-polyfill-provider
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Nicolò Ribaudo and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-environment-visitor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-function-name
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-hoist-variables
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-member-expression-to-functions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-module-imports
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-module-transforms
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-optimise-call-expression
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-plugin-utils
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-remap-async-to-generator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-replace-supers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-simple-access
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-skip-transparent-expression-wrappers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-split-export-declaration
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-string-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-validator-identifier
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-validator-option
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helper-wrap-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/helpers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */_regeneratorRuntime=function(){return e};var t,e={},r=Object.prototype,n=r.hasOwnProperty,o=Object.defineProperty||function(t,e,r){t[e]=r.value},i="function"==typeof Symbol?Symbol:{},a=i.iterator||"@@iterator",c=i.asyncIterator||"@@asyncIterator",u=i.toStringTag||"@@toStringTag";function define(t,e,r){return Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}),t[e]}try{define({},"")}catch(t){define=function(t,e,r){return t[e]=r}}function wrap(t,e,r,n){var i=e&&e.prototype instanceof Generator?e:Generator,a=Object.create(i.prototype),c=new Context(n||[]);return o(a,"_invoke",{value:makeInvokeMethod(t,r,c)}),a}function tryCatch(t,e,r){try{return{type:"normal",arg:t.call(e,r)}}catch(t){return{type:"throw",arg:t}}}e.wrap=wrap;var h="suspendedStart",l="suspendedYield",f="executing",s="completed",y={};function Generator(){}function GeneratorFunction(){}function GeneratorFunctionPrototype(){}var p={};define(p,a,(function(){return this}));var d=Object.getPrototypeOf,v=d&&d(d(values([])));v&&v!==r&&n.call(v,a)&&(p=v);var g=GeneratorFunctionPrototype.prototype=Generator.prototype=Object.create(p);function defineIteratorMethods(t){["next","throw","return"].forEach((function(e){define(t,e,(function(t){return this._invoke(e,t)}))}))}function AsyncIterator(t,e){function invoke(r,o,i,a){var c=tryCatch(t[r],t,o);if("throw"!==c.type){var u=c.arg,h=u.value;return h&&"object"==typeof h&&n.call(h,"__await")?e.resolve(h.__await).then((function(t){invoke("next",t,i,a)}),(function(t){invoke("throw",t,i,a)})):e.resolve(h).then((function(t){u.value=t,i(u)}),(function(t){return invoke("throw",t,i,a)}))}a(c.arg)}var r;o(this,"_invoke",{value:function(t,n){function callInvokeWithMethodAndArg(){return new e((function(e,r){invoke(t,n,e,r)}))}return r=r?r.then(callInvokeWithMethodAndArg,callInvokeWithMethodAndArg):callInvokeWithMethodAndArg()}})}function makeInvokeMethod(e,r,n){var o=h;return function(i,a){if(o===f)throw Error("Generator is already running");if(o===s){if("throw"===i)throw a;return{value:t,done:!0}}for(n.method=i,n.arg=a;;){var c=n.delegate;if(c){var u=maybeInvokeDelegate(c,n);if(u){if(u===y)continue;return u}}if("next"===n.method)n.sent=n._sent=n.arg;else if("throw"===n.method){if(o===h)throw o=s,n.arg;n.dispatchException(n.arg)}else"return"===n.method&&n.abrupt("return",n.arg);o=f;var p=tryCatch(e,r,n);if("normal"===p.type){if(o=n.done?s:l,p.arg===y)continue;return{value:p.arg,done:n.done}}"throw"===p.type&&(o=s,n.method="throw",n.arg=p.arg)}}}function maybeInvokeDelegate(e,r){var n=r.method,o=e.iterator[n];if(o===t)return r.delegate=null,"throw"===n&&e.iterator.return&&(r.method="return",r.arg=t,maybeInvokeDelegate(e,r),"throw"===r.method)||"return"!==n&&(r.method="throw",r.arg=new TypeError("The iterator does not provide a \'"+n+"\' method")),y;var i=tryCatch(o,e.iterator,r.arg);if("throw"===i.type)return r.method="throw",r.arg=i.arg,r.delegate=null,y;var a=i.arg;return a?a.done?(r[e.resultName]=a.value,r.next=e.nextLoc,"return"!==r.method&&(r.method="next",r.arg=t),r.delegate=null,y):a:(r.method="throw",r.arg=new TypeError("iterator result is not an object"),r.delegate=null,y)}function pushTryEntry(t){var e={tryLoc:t[0]};1 in t&&(e.catchLoc=t[1]),2 in t&&(e.finallyLoc=t[2],e.afterLoc=t[3]),this.tryEntries.push(e)}function resetTryEntry(t){var e=t.completion||{};e.type="normal",delete e.arg,t.completion=e}function Context(t){this.tryEntries=[{tryLoc:"root"}],t.forEach(pushTryEntry,this),this.reset(!0)}function values(e){if(e||""===e){var r=e[a];if(r)return r.call(e);if("function"==typeof e.next)return e;if(!isNaN(e.length)){var o=-1,i=function next(){for(;++o<e.length;)if(n.call(e,o))return next.value=e[o],next.done=!1,next;return next.value=t,next.done=!0,next};return i.next=i}}throw new TypeError(typeof e+" is not iterable")}return GeneratorFunction.prototype=GeneratorFunctionPrototype,o(g,"constructor",{value:GeneratorFunctionPrototype,configurable:!0}),o(GeneratorFunctionPrototype,"constructor",{value:GeneratorFunction,configurable:!0}),GeneratorFunction.displayName=define(GeneratorFunctionPrototype,u,"GeneratorFunction"),e.isGeneratorFunction=function(t){var e="function"==typeof t&&t.constructor;return!!e&&(e===GeneratorFunction||"GeneratorFunction"===(e.displayName||e.name))},e.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,GeneratorFunctionPrototype):(t.__proto__=GeneratorFunctionPrototype,define(t,u,"GeneratorFunction")),t.prototype=Object.create(g),t},e.awrap=function(t){return{__await:t}},defineIteratorMethods(AsyncIterator.prototype),define(AsyncIterator.prototype,c,(function(){return this})),e.AsyncIterator=AsyncIterator,e.async=function(t,r,n,o,i){void 0===i&&(i=Promise);var a=new AsyncIterator(wrap(t,r,n,o),i);return e.isGeneratorFunction(r)?a:a.next().then((function(t){return t.done?t.value:a.next()}))},defineIteratorMethods(g),define(g,u,"Generator"),define(g,a,(function(){return this})),define(g,"toString",(function(){return"[object Generator]"})),e.keys=function(t){var e=Object(t),r=[];for(var n in e)r.push(n);return r.reverse(),function next(){for(;r.length;){var t=r.pop();if(t in e)return next.value=t,next.done=!1,next}return next.done=!0,next}},e.values=values,Context.prototype={constructor:Context,reset:function(e){if(this.prev=0,this.next=0,this.sent=this._sent=t,this.done=!1,this.delegate=null,this.method="next",this.arg=t,this.tryEntries.forEach(resetTryEntry),!e)for(var r in this)"t"===r.charAt(0)&&n.call(this,r)&&!isNaN(+r.slice(1))&&(this[r]=t)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if("throw"===t.type)throw t.arg;return this.rval},dispatchException:function(e){if(this.done)throw e;var r=this;function handle(n,o){return a.type="throw",a.arg=e,r.next=n,o&&(r.method="next",r.arg=t),!!o}for(var o=this.tryEntries.length-1;o>=0;--o){var i=this.tryEntries[o],a=i.completion;if("root"===i.tryLoc)return handle("end");if(i.tryLoc<=this.prev){var c=n.call(i,"catchLoc"),u=n.call(i,"finallyLoc");if(c&&u){if(this.prev<i.catchLoc)return handle(i.catchLoc,!0);if(this.prev<i.finallyLoc)return handle(i.finallyLoc)}else if(c){if(this.prev<i.catchLoc)return handle(i.catchLoc,!0)}else{if(!u)throw Error("try statement without catch or finally");if(this.prev<i.finallyLoc)return handle(i.finallyLoc)}}}},abrupt:function(t,e){for(var r=this.tryEntries.length-1;r>=0;--r){var o=this.tryEntries[r];if(o.tryLoc<=this.prev&&n.call(o,"finallyLoc")&&this.prev<o.finallyLoc){var i=o;break}}i&&("break"===t||"continue"===t)&&i.tryLoc<=e&&e<=i.finallyLoc&&(i=null);var a=i?i.completion:{};return a.type=t,a.arg=e,i?(this.method="next",this.next=i.finallyLoc,y):this.complete(a)},complete:function(t,e){if("throw"===t.type)throw t.arg;return"break"===t.type||"continue"===t.type?this.next=t.arg:"return"===t.type?(this.rval=this.arg=t.arg,this.method="return",this.next="end"):"normal"===t.type&&e&&(this.next=e),y},finish:function(t){for(var e=this.tryEntries.length-1;e>=0;--e){var r=this.tryEntries[e];if(r.finallyLoc===t)return this.complete(r.completion,r.afterLoc),resetTryEntry(r),y}},catch:function(t){for(var e=this.tryEntries.length-1;e>=0;--e){var r=this.tryEntries[e];if(r.tryLoc===t){var n=r.completion;if("throw"===n.type){var o=n.arg;resetTryEntry(r)}return o}}throw Error("illegal catch attempt")},delegateYield:function(e,r,n){return this.delegate={iterator:values(e),resultName:r,nextLoc:n},"next"===this.method&&(this.arg=t),y}},e}', {
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/highlight
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/parser
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2014 by various contributors (see AUTHORS)
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-bugfix-firefox-class-in-computed-class-key
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-bugfix-safari-class-field-initializer-scope
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-class-properties
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-decorators
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-export-default-from
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-nullish-coalescing-operator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-object-rest-spread
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-optional-chaining
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-private-methods
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-proposal-private-property-in-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-async-generators
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-class-properties
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-class-static-block
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-decorators
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-dynamic-import
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-export-namespace-from
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-flow
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-import-assertions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-import-attributes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-import-meta
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-json-strings
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-jsx
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-logical-assignment-operators
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-nullish-coalescing-operator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-numeric-separator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-object-rest-spread
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-optional-catch-binding
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-optional-chaining
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-private-property-in-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-top-level-await
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-typescript
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-syntax-unicode-sets-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-arrow-functions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-async-generator-functions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-async-to-generator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-block-scoped-functions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-block-scoping
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-class-properties
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-class-static-block
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-classes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-computed-properties
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-destructuring
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-dotall-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-duplicate-keys
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-duplicate-named-capturing-groups-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-dynamic-import
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-exponentiation-operator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-export-namespace-from
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-flow-strip-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-for-of
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-function-name
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-json-strings
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-literals
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-logical-assignment-operators
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-member-expression-literals
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-modules-amd
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-modules-commonjs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-modules-systemjs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-modules-umd
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-named-capturing-groups-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-new-target
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-nullish-coalescing-operator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-numeric-separator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-object-rest-spread
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-object-super
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-optional-catch-binding
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-optional-chaining
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-parameters
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-private-methods
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-private-property-in-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-property-literals
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-react-display-name
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-react-jsx-development
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-react-jsx
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-react-pure-annotations
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-regenerator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-regexp-modifiers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-reserved-words
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-shorthand-properties
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-spread
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-sticky-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-template-literals
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-typeof-symbol
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-typescript
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-unicode-escapes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-unicode-property-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-unicode-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/plugin-transform-unicode-sets-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/preset-env
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/preset-flow
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/preset-modules
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Babel
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/preset-react
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/preset-typescript
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/register
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/regjsgen
== License Type
SPDX:MIT
== Copyright
Copyright 2014-2020 Benjamin Tan <https://ofcr.se/>
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/runtime
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/template
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/traverse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@babel/types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@base2/pretty-print-object
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2015, Yeoman team
--------------------------------- (separator) ----------------------------------
== Dependency
@bcoe/v8-coverage
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Contributors
Copyright © 2015-2017 Charles Samborski
--------------------------------- (separator) ----------------------------------
== Dependency
@cnakazawa/watch
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2010-2011 Mikeal Rogers
--------------------------------- (separator) ----------------------------------
== Dependency
@colors/colors
== License Type
SPDX:MIT
== Copyright
Copyright (c) DABH (https://github.com/DABH)
Copyright (c) Marak Squires
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
@dagrejs/dagre
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Chris Pettitt
Copyright (c) 2014, Chris Pettitt
--------------------------------- (separator) ----------------------------------
== Dependency
@dagrejs/graphlib
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Chris Pettitt
Copyright (c) 2014, Chris Pettitt
--------------------------------- (separator) ----------------------------------
== Dependency
@discoveryjs/json-ext
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Roman Dvornov <rdvornov@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/charts
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2017 Evgeny Poberezkin
Copyright 2018 Observable, Inc.
Copyright 2019 Elastic and contributors
== Notices
This product includes code that is adapted from fast-deep-equal@3.1.1,
which is available under a "MIT" license.
MIT License
Copyright (c) 2017 Evgeny Poberezkin
---
This product also includes code that is adapted from d3-delaunay@5.2.1,
which is available under a "ISC" license.
Copyright 2018 Observable, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/datemath
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/ecs-helpers
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Elastic and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/ecs-pino-format
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Elastic and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/eslint-config-kibana
== License Type
SPDX:Apache-2.0
== Copyright
Spencer Alger <email@spalger.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/eui
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (C) Paul Johnston 1999 - 2009
Copyright (c) 2002 Cynthia Brewer, Mark Harrower,
Copyright (c) 2002 Cynthia Brewer, Mark Harrower, and The
Copyright (c) 2010, Ajax.org B.V.
Copyright (c) 2011-2019, Gregor Aisch
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright (c) 2014-present, Facebook, Inc.
Copyright (c) 2016 Federico Zivolo and contributors
Copyright (c) 2017-2018 GitHub, Inc.
Copyright (c) 2018 HackerOne Inc and individual contributors
Copyright (c) 2018 Jed Watson.
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Microsoft Corporation.
Copyright (c) Microsoft Corporation. All rights reserved.
Copyright 2006 Google Inc.
Copyright 2012-2018 Elasticsearch B.V.
Copyright 2018 The diff-match-patch Authors.
Copyright 2021 OpenSearch Contributors
== Notices
OpenSearch UI
Copyright 2021 OpenSearch Contributors
This product includes software, including EUI source code, developed by Elasticsearch (http://www.elastic.co).
Copyright 2012-2018 Elasticsearch B.V.
---
This product bundles code based on react-datepicker@2.0.0 which is
available under a "MIT" license.
The MIT License (MIT)
Copyright (c) 2018 HackerOne Inc and individual contributors
--
This product bundles code based on @types/react-datepicker@1.8.0 which is
available under a "MIT" license.
MIT License
Copyright (c) Microsoft Corporation. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/good
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/node-crypto
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2012–2016 Elasticsearch BV
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/numeral
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Adam Draper
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/request-crypto
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2017 Elasticsearch BV
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/safer-lodash-set
== License Type
SPDX:MIT
== Copyright
Copyright (c) Brian Zengel <https://github.com/bczengel>, Ilya Mochalov <https://github.com/chrootsu>
Copyright (c) Elasticsearch BV
Copyright (c) JS Foundation and other contributors <https://js.foundation/>
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/core
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/css
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/hash
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/is-prop-valid
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/memoize
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/serialize
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/sheet
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/stylis
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/unitless
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/utils
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@emotion/weak-memoize
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@fast-csv/format
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2019 C2FO
--------------------------------- (separator) ----------------------------------
== Dependency
@fast-csv/parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2019 C2FO
--------------------------------- (separator) ----------------------------------
== Dependency
@gar/promisify
== License Type
SPDX:MIT
== Copyright
Copyright © 2020-2022 Michael Garvin
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/accept
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
Copyright (c) 2015-2016, Mark Bradshaw
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/ammo
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/b64
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (C) 1999 Masanao Izumo <iz@onicos.co.jp>
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/boom
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/bounce
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2017-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/bourne
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2019-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/call
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>, MIT Licensed, http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
Copyright (c) 2017-2019 Justin Ridgewell, MIT Licensed, https://github.com/jridgewell/safe-decode-string-component
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/catbox-memory
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/catbox
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/content
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/cookie
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/cryptiles
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/file
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2019-2020, Project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/good-squeeze
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014-2016, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/h2o2
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/hapi
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2011, Yahoo Inc.
Copyright (c) 2011-2014, Walmart
Copyright (c) 2011-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/heavy
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2013-2014, Walmart.
Copyright (c) 2013-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/hoek
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2011, Yahoo Inc.
Copyright (c) 2011-2014, Walmart
Copyright (c) 2011-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/inert
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
Copyright (c) 2014-2019, Gil Pedersen
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/iron
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/mimos
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/nigel
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/oppsy
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2015-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/pez
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2011-2013 Felix Geisendörfer, Andrew Kelley
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/podium
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2016-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/shot
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2021, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/somever
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2018-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/statehood
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/subtext
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2019, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/teamwork
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2015-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/topo
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/validate
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/vise
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Walmart.
Copyright (c) 2014-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/vision
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2015, Walmart.
Copyright (c) 2012-2020, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@hapi/wreck
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart.
Copyright (c) 2012-2022, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@istanbuljs/load-nyc-config
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2019, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@istanbuljs/schema
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 CFWare, LLC
--------------------------------- (separator) ----------------------------------
== Dependency
@jest/transform
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@jest/types
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@jridgewell/gen-mapping
== License Type
SPDX:MIT
== Copyright
Copyright 2022 Justin Ridgewell <jridgewell@google.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@jridgewell/resolve-uri
== License Type
SPDX:MIT
== Copyright
Copyright 2019 Justin Ridgewell <jridgewell@google.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@jridgewell/set-array
== License Type
SPDX:MIT
== Copyright
Copyright 2022 Justin Ridgewell <jridgewell@google.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@jridgewell/source-map
== License Type
SPDX:MIT
== Copyright
Copyright 2019 Justin Ridgewell <jridgewell@google.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@jridgewell/sourcemap-codec
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Rich Harris
--------------------------------- (separator) ----------------------------------
== Dependency
@jridgewell/trace-mapping
== License Type
SPDX:MIT
== Copyright
Copyright 2022 Justin Ridgewell <justin@ridgewell.name>
--------------------------------- (separator) ----------------------------------
== Dependency
@kwsites/file-exists
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Steve King
--------------------------------- (separator) ----------------------------------
== Dependency
@kwsites/promise-deferred
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 kwsites
--------------------------------- (separator) ----------------------------------
== Dependency
@lmdb/lmdb-darwin-arm64
== License Type
SPDX:MIT
== Copyright
[Copyright (c) 2014 Timur Kristóf](https://github.com/venemo/node-lmdb/)
--------------------------------- (separator) ----------------------------------
== Dependency
@mapbox/hast-util-table-cell-style
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2018, Mapbox
--------------------------------- (separator) ----------------------------------
== Dependency
@mdx-js/mdx
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-2019 Compositor, Inc. and Vercel, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
@mdx-js/react
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-2018 Compositor and Vercel, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
@mdx-js/util
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 John Otander
--------------------------------- (separator) ----------------------------------
== Dependency
@mrmlnc/readdir-enhanced
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 James Messinger
--------------------------------- (separator) ----------------------------------
== Dependency
@msgpackr-extract/msgpackr-extract-darwin-arm64
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Kris Zyp
--------------------------------- (separator) ----------------------------------
== Dependency
@nicolo-ribaudo/chokidar-2
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>\n */\n\nmodule.exports = mixin;\n\n/**\n * Mixin source map support into `compiler`.\n *\n * @param {Object} `compiler`\n * @api public\n */\n\nfunction mixin(compiler) {\n define(compiler, '_comment', compiler.comment);\n compiler.map = new utils.SourceMap.SourceMapGenerator();\n compiler.position = { line: 1, column: 1 };\n compiler.content = {};\n compiler.files = {};\n\n for (var key in exports) {\n define(compiler, key, exports[key]);\n }\n}\n\n/**\n * Update position.\n *\n * @param {String} str\n */\n\nexports.updatePosition = function(str) {\n var lines = str.match(/\\n/g);\n if (lines) this.position.line += lines.length;\n var i = str.lastIndexOf('\\n');\n this.position.column = ~i ? str.length - i : this.position.column + str.length;\n};\n\n/**\n * Emit `str` with `position`.\n *\n * @param {String} str\n * @param {Object} [pos]\n * @return {String}\n */\n\nexports.emit = function(str, node) {\n var position = node.position || {};\n var source = position.source;\n if (source) {\n if (position.filepath) {\n source = utils.unixify(position.filepath);\n }\n\n this.map.addMapping({\n source: source,\n generated: {\n line: this.position.line,\n column: Math.max(this.position.column - 1, 0)\n },\n original: {\n line: position.start.line,\n column: position.start.column - 1\n }\n });\n\n if (position.content) {\n this.addContent(source, position);\n }\n if (position.filepath) {\n this.addFile(source, position);\n }\n\n this.updatePosition(str);\n this.output += str;\n }\n return str;\n};\n\n/**\n * Adds a file to the source map output if it has not already been added\n * @param {String} `file`\n * @param {Object} `pos`\n */\n\nexports.addFile = function(file, position) {\n if (typeof position.content !== 'string') return;\n if (Object.prototype.hasOwnProperty.call(this.files, file)) return;\n this.files[file] = position.content;\n};\n\n/**\n * Adds a content source to the source map output if it has not already been added\n * @param {String} `source`\n * @param {Object} `position`\n */\n\nexports.addContent = function(source, position) {\n if (typeof position.content !== 'string') return;\n if (Object.prototype.hasOwnProperty.call(this.content, source)) return;\n this.map.setSourceContent(source, position.content);\n};\n\n/**\n * Applies any original source maps to the output and embeds the source file\n * contents in the source map.\n */\n\nexports.applySourceMaps = function() {\n Object.keys(this.files).forEach(function(file) {\n var content = this.files[file];\n this.map.setSourceContent(file, content);\n\n if (this.options.inputSourcemaps === true) {\n var originalMap = utils.sourceMapResolve.resolveSync(content, file, fs.readFileSync);\n if (originalMap) {\n var map = new utils.SourceMap.SourceMapConsumer(originalMap.map);\n var relativeTo = originalMap.sourcesRelativeTo;\n this.map.applySourceMap(map, file, utils.unixify(path.dirname(relativeTo)));\n }\n }\n }, this);\n};\n\n/**\n * Process comments, drops sourceMap comments.\n * @param {Object} node\n */\n\nexports.comment = function(node) {\n if (/^# sourceMappingURL=/.test(node.comment)) {\n return this.emit('', node.position);\n }\n return this._comment(node);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/lib/source-maps.js?");
Copyright (c) 2014-2015 Jon Schlinkert, contributors.\n * Licensed under the MIT License\n */\n\n\n\nvar isObject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\n\nmodule.exports = function pick(obj, keys) {\n if (!isObject(obj) && typeof obj !== 'function') {\n return {};\n }\n\n var res = {};\n if (typeof keys === 'string') {\n if (keys in obj) {\n res[keys] = obj[keys];\n }\n return res;\n }\n\n var len = keys.length;\n var idx = -1;\n\n while (++idx < len) {\n var key = keys[idx];\n if (key in obj) {\n res[key] = obj[key];\n }\n }\n return res;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/object.pick/index.js?");
Copyright (c) 2014-2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar split = __webpack_require__(/*! split-string */ \"./node_modules/split-string/index.js\");\nvar extend = __webpack_require__(/*! extend-shallow */ \"./node_modules/extend-shallow/index.js\");\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\nvar isObject = __webpack_require__(/*! is-extendable */ \"./node_modules/is-extendable/index.js\");\n\nmodule.exports = function(obj, prop, val) {\n if (!isObject(obj)) {\n return obj;\n }\n\n if (Array.isArray(prop)) {\n prop = [].concat.apply([], prop).join('.');\n }\n\n if (typeof prop !== 'string') {\n return obj;\n }\n\n var keys = split(prop, {sep: '.', brackets: true}).filter(isValidKey);\n var len = keys.length;\n var idx = -1;\n var current = obj;\n\n while (++idx < len) {\n var key = keys[idx];\n if (idx !== len - 1) {\n if (!isObject(current[key])) {\n current[key] = {};\n }\n current = current[key];\n continue;\n }\n\n if (isPlainObject(current[key]) && isPlainObject(val)) {\n current[key] = extend({}, current[key], val);\n } else {\n current[key] = val;\n }\n }\n\n return obj;\n};\n\nfunction isValidKey(key) {\n return key !== '__proto__' && key !== 'constructor' && key !== 'prototype';\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/set-value/index.js?");
Copyright (c) 2014-2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/has-values/node_modules/kind-of/index.js\");\nvar isNumber = __webpack_require__(/*! is-number */ \"./node_modules/is-number/index.js\");\n\nmodule.exports = function hasValue(val) {\n // is-number checks for NaN and other edge cases\n if (isNumber(val)) {\n return true;\n }\n\n switch (typeOf(val)) {\n case 'null':\n case 'boolean':\n case 'function':\n return true;\n case 'string':\n case 'arguments':\n return val.length !== 0;\n case 'error':\n return val.message !== '';\n case 'array':\n var len = val.length;\n if (len === 0) {\n return false;\n }\n for (var i = 0; i < len; i++) {\n if (hasValue(val[i])) {\n return true;\n }\n }\n return false;\n case 'file':\n case 'map':\n case 'set':\n return val.size !== 0;\n case 'object':\n var keys = Object.keys(val);\n if (keys.length === 0) {\n return false;\n }\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n if (hasValue(val[key])) {\n return true;\n }\n }\n return false;\n default: {\n return false;\n }\n }\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/has-values/index.js?");
Copyright (c) 2014-2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar util = __webpack_require__(/*! util */ \"util\");\nvar isNumber = __webpack_require__(/*! is-number */ \"./node_modules/is-number/index.js\");\nvar extend = __webpack_require__(/*! extend-shallow */ \"./node_modules/extend-shallow/index.js\");\nvar repeat = __webpack_require__(/*! repeat-string */ \"./node_modules/repeat-string/index.js\");\nvar toRegex = __webpack_require__(/*! to-regex-range */ \"./node_modules/to-regex-range/index.js\");\n\n/**\n * Return a range of numbers or letters.\n *\n * @param {String} `start` Start of the range\n * @param {String} `stop` End of the range\n * @param {String} `step` Increment or decrement to use.\n * @param {Function} `fn` Custom function to modify each element in the range.\n * @return {Array}\n */\n\nfunction fillRange(start, stop, step, options) {\n if (typeof start === 'undefined') {\n return [];\n }\n\n if (typeof stop === 'undefined' || start === stop) {\n // special case, for handling negative zero\n var isString = typeof start === 'string';\n if (isNumber(start) && !toNumber(start)) {\n return [isString ? '0' : 0];\n }\n return [start];\n }\n\n if (typeof step !== 'number' && typeof step !== 'string') {\n options = step;\n step = undefined;\n }\n\n if (typeof options === 'function') {\n options = { transform: options };\n }\n\n var opts = extend({step: step}, options);\n if (opts.step && !isValidNumber(opts.step)) {\n if (opts.strictRanges === true) {\n throw new TypeError('expected options.step to be a number');\n }\n return [];\n }\n\n opts.isNumber = isValidNumber(start) && isValidNumber(stop);\n if (!opts.isNumber && !isValid(start, stop)) {\n if (opts.strictRanges === true) {\n throw new RangeError('invalid range arguments: ' + util.inspect([start, stop]));\n }\n return [];\n }\n\n opts.isPadded = isPadded(start) || isPadded(stop);\n opts.toString = opts.stringify\n || typeof opts.step === 'string'\n || typeof start === 'string'\n || typeof stop === 'string'\n || !opts.isNumber;\n\n if (opts.isPadded) {\n opts.maxLength = Math.max(String(start).length, String(stop).length);\n }\n\n // support legacy minimatch/fill-range options\n if (typeof opts.optimize === 'boolean') opts.toRegex = opts.optimize;\n if (typeof opts.makeRe === 'boolean') opts.toRegex = opts.makeRe;\n return expand(start, stop, opts);\n}\n\nfunction expand(start, stop, options) {\n var a = options.isNumber ? toNumber(start) : start.charCodeAt(0);\n var b = options.isNumber ? toNumber(stop) : stop.charCodeAt(0);\n\n var step = Math.abs(toNumber(options.step)) || 1;\n if (options.toRegex && step === 1) {\n return toRange(a, b, start, stop, options);\n }\n\n var zero = {greater: [], lesser: []};\n var asc = a < b;\n var arr = new Array(Math.round((asc ? b - a : a - b) / step));\n var idx = 0;\n\n while (asc ? a <= b : a >= b) {\n var val = options.isNumber ? a : String.fromCharCode(a);\n if (options.toRegex && (val >= 0 || !options.isNumber)) {\n zero.greater.push(val);\n } else {\n zero.lesser.push(Math.abs(val));\n }\n\n if (options.isPadded) {\n val = zeros(val, options);\n }\n\n if (options.toString) {\n val = String(val);\n }\n\n if (typeof options.transform === 'function') {\n arr[idx++] = options.transform(val, a, b, step, idx, arr, options);\n } else {\n arr[idx++] = val;\n }\n\n if (asc) {\n a += step;\n } else {\n a -= step;\n }\n }\n\n if (options.toRegex === true) {\n return toSequence(arr, zero, options);\n }\n return arr;\n}\n\nfunction toRange(a, b, start, stop, options) {\n if (options.isPadded) {\n return toRegex(start, stop, options);\n }\n\n if (options.isNumber) {\n return toRegex(Math.min(a, b), Math.max(a, b), options);\n }\n\n var start = String.fromCharCode(Math.min(a, b));\n var stop = String.fromCharCode(Math.max(a, b));\n return '[' + start + '-' + stop + ']';\n}\n\nfunction toSequence(arr, zeros, options) {\n var greater = '', lesser = '';\n if (zeros.greater.length) {\n greater = zeros.greater.join('|');\n }\n if (zeros.lesser.length) {\n lesser = '-(' + zeros.lesser.join('|') + ')';\n }\n var res = greater && lesser\n ? greater + '|' + lesser\n : greater || lesser;\n\n if (options.capture) {\n return '(' + res + ')';\n }\n return res;\n}\n\nfunction zeros(val, options) {\n if (options.isPadded) {\n var str = String(val);\n var len = str.length;\n var dash = '';\n if (str.charAt(0) === '-') {\n dash = '-';\n str = str.slice(1);\n }\n var diff = options.maxLength - len;\n var pad = repeat('0', diff);\n val = (dash + pad + str);\n }\n if (options.stringify) {\n return String(val);\n }\n return val;\n}\n\nfunction toNumber(val) {\n return Number(val) || 0;\n}\n\nfunction isPadded(str) {\n return /^-?0\\d/.test(str);\n}\n\nfunction isValid(min, max) {\n return (isValidNumber(min) || isValidLetter(min))\n && (isValidNumber(max) || isValidLetter(max));\n}\n\nfunction isValidLetter(ch) {\n return typeof ch === 'string' && ch.length === 1 && /^\\w+$/.test(ch);\n}\n\nfunction isValidNumber(n) {\n return isNumber(n) && !/\\./.test(n);\n}\n\n/**\n * Expose `fillRange`\n * @type {Function}\n */\n\nmodule.exports = fillRange;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/fill-range/index.js?");
Copyright (c) 2014-2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\n/**\n * Results cache\n */\n\nvar res = '';\nvar cache;\n\n/**\n * Expose `repeat`\n */\n\nmodule.exports = repeat;\n\n/**\n * Repeat the given `string` the specified `number`\n * of times.\n *\n * **Example:**\n *\n * ```js\n * var repeat = require('repeat-string');\n * repeat('A', 5);\n * //=> AAAAA\n * ```\n *\n * @param {String} `string` The string to repeat\n * @param {Number} `number` The number of times to repeat the string\n * @return {String} Repeated string\n * @api public\n */\n\nfunction repeat(str, num) {\n if (typeof str !== 'string') {\n throw new TypeError('expected a string');\n }\n\n // cover common, quick use cases\n if (num === 1) return str;\n if (num === 2) return str + str;\n\n var max = str.length * num;\n if (cache !== str || typeof cache === 'undefined') {\n cache = str;\n res = '';\n } else if (res.length >= max) {\n return res.substr(0, max);\n }\n\n while (max > res.length && num > 1) {\n if (num & 1) {\n res += str;\n }\n\n num >>= 1;\n str += str;\n }\n\n res += str;\n res = res.substr(0, max);\n return res;\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/repeat-string/index.js?");
Copyright (c) 2014-2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nmodule.exports = function hasValue(o, noZero) {\n if (o === null || o === undefined) {\n return false;\n }\n\n if (typeof o === 'boolean') {\n return true;\n }\n\n if (typeof o === 'number') {\n if (o === 0 && noZero === true) {\n return false;\n }\n return true;\n }\n\n if (o.length !== undefined) {\n return o.length !== 0;\n }\n\n for (var key in o) {\n if (o.hasOwnProperty(key)) {\n return true;\n }\n }\n return false;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/unset-value/node_modules/has-values/index.js?");
Copyright (c) 2014-2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nmodule.exports = function unique(arr) {\n if (!Array.isArray(arr)) {\n throw new TypeError('array-unique expects an array.');\n }\n\n var len = arr.length;\n var i = -1;\n\n while (i++ < len) {\n var j = i + 1;\n\n for (; j < arr.length; ++j) {\n if (arr[i] === arr[j]) {\n arr.splice(j--, 1);\n }\n }\n }\n return arr;\n};\n\nmodule.exports.immutable = function uniqueImmutable(arr) {\n if (!Array.isArray(arr)) {\n throw new TypeError('array-unique expects an array.');\n }\n\n var arrLen = arr.length;\n var newArr = new Array(arrLen);\n\n for (var i = 0; i < arrLen; i++) {\n newArr[i] = arr[i];\n }\n\n return module.exports(newArr);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/array-unique/index.js?");
Copyright (c) 2014-2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar isArray = __webpack_require__(/*! isarray */ \"./node_modules/isarray/index.js\");\n\nmodule.exports = function isObject(val) {\n return val != null && typeof val === 'object' && isArray(val) === false;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/unset-value/node_modules/has-value/node_modules/isobject/index.js?");
Copyright (c) 2014-2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/is-number/node_modules/kind-of/index.js\");\n\nmodule.exports = function isNumber(num) {\n var type = typeOf(num);\n\n if (type === 'string') {\n if (!num.trim()) return false;\n } else if (type !== 'number') {\n return false;\n }\n\n return (num - num + 1) >= 0;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-number/index.js?");
Copyright (c) 2014-2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\nmodule.exports = function(obj, prop, a, b, c) {\n if (!isObject(obj) || !prop) {\n return obj;\n }\n\n prop = toString(prop);\n\n // allowing for multiple properties to be passed as\n // a string or array, but much faster (3-4x) than doing\n // `[].slice.call(arguments)`\n if (a) prop += '.' + toString(a);\n if (b) prop += '.' + toString(b);\n if (c) prop += '.' + toString(c);\n\n if (prop in obj) {\n return obj[prop];\n }\n\n var segs = prop.split('.');\n var len = segs.length;\n var i = -1;\n\n while (obj && (++i < len)) {\n var key = segs[i];\n while (key[key.length - 1] === '\\\\') {\n key = key.slice(0, -1) + '.' + segs[++i];\n }\n obj = obj[key];\n }\n return obj;\n};\n\nfunction isObject(val) {\n return val !== null && (typeof val === 'object' || typeof val === 'function');\n}\n\nfunction toString(val) {\n if (!val) return '';\n if (Array.isArray(val)) {\n return val.join('.');\n }\n return val;\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/get-value/index.js?");
Copyright (c) 2014-2016, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar isObject = __webpack_require__(/*! isobject */ \"./node_modules/unset-value/node_modules/has-value/node_modules/isobject/index.js\");\nvar hasValues = __webpack_require__(/*! has-values */ \"./node_modules/unset-value/node_modules/has-values/index.js\");\nvar get = __webpack_require__(/*! get-value */ \"./node_modules/get-value/index.js\");\n\nmodule.exports = function(obj, prop, noZero) {\n if (isObject(obj)) {\n return hasValues(get(obj, prop), noZero);\n }\n return hasValues(obj, prop);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/unset-value/node_modules/has-value/index.js?");
Copyright (c) 2014-2016, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\nmodule.exports = function isExtglob(str) {\n if (typeof str !== 'string' || str === '') {\n return false;\n }\n\n var match;\n while ((match = /(\\\\).|([@?!+*]\\(.*\\))/g.exec(str))) {\n if (match[2]) return true;\n str = str.slice(match.index + match[0].length);\n }\n\n return false;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-extglob/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar isObject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\nvar hasValues = __webpack_require__(/*! has-values */ \"./node_modules/has-values/index.js\");\nvar get = __webpack_require__(/*! get-value */ \"./node_modules/get-value/index.js\");\n\nmodule.exports = function(val, prop) {\n return hasValues(isObject(val) && prop ? get(val, prop) : val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/has-value/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nmodule.exports = function (arr) {\n return flat(arr, []);\n};\n\nfunction flat(arr, res) {\n var i = 0, cur;\n var len = arr.length;\n for (; i < len; i++) {\n cur = arr[i];\n Array.isArray(cur) ? flat(cur, res) : res.push(cur);\n }\n return res;\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/arr-flatten/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nmodule.exports = function diff(arr/*, arrays*/) {\n var len = arguments.length;\n var idx = 0;\n while (++idx < len) {\n arr = diffArray(arr, arguments[idx]);\n }\n return arr;\n};\n\nfunction diffArray(one, two) {\n if (!Array.isArray(two)) {\n return one.slice();\n }\n\n var tlen = two.length\n var olen = one.length;\n var idx = -1;\n var arr = [];\n\n while (++idx < olen) {\n var ele = one[idx];\n\n var hasEle = false;\n for (var i = 0; i < tlen; i++) {\n var val = two[i];\n\n if (ele === val) {\n hasEle = true;\n break;\n }\n }\n\n if (hasEle === false) {\n arr.push(ele);\n }\n }\n return arr;\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/arr-diff/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nmodule.exports = function forIn(obj, fn, thisArg) {\n for (var key in obj) {\n if (fn.call(thisArg, obj[key], key, obj) === false) {\n break;\n }\n }\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/for-in/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nmodule.exports = function isObject(val) {\n return val != null && typeof val === 'object' && Array.isArray(val) === false;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/isobject/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isObject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\n\nfunction isObjectObject(o) {\n return isObject(o) === true\n && Object.prototype.toString.call(o) === '[object Object]';\n}\n\nmodule.exports = function isPlainObject(o) {\n var ctor,prot;\n\n if (isObjectObject(o) === false) return false;\n\n // If has modified constructor\n ctor = o.constructor;\n if (typeof ctor !== 'function') return false;\n\n // If has modified prototype\n prot = ctor.prototype;\n if (isObjectObject(prot) === false) return false;\n\n // If constructor does not have an Object-specific method\n if (prot.hasOwnProperty('isPrototypeOf') === false) {\n return false;\n }\n\n // Most likely a plain Object\n return true;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-plain-object/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\nvar isExtglob = __webpack_require__(/*! is-extglob */ \"./node_modules/is-extglob/index.js\");\nvar chars = { '{': '}', '(': ')', '[': ']'};\nvar strictRegex = /\\\\(.)|(^!|\\*|[\\].+)]\\?|\\[[^\\\\\\]]+\\]|\\{[^\\\\}]+\\}|\\(\\?[:!=][^\\\\)]+\\)|\\([^|]+\\|[^\\\\)]+\\))/;\nvar relaxedRegex = /\\\\(.)|(^!|[*?{}()[\\]]|\\(\\?)/;\n\nmodule.exports = function isGlob(str, options) {\n if (typeof str !== 'string' || str === '') {\n return false;\n }\n\n if (isExtglob(str)) {\n return true;\n }\n\n var regex = strictRegex;\n var match;\n\n // optionally relax regex\n if (options && options.strict === false) {\n regex = relaxedRegex;\n }\n\n while ((match = regex.exec(str))) {\n if (match[2]) return true;\n var idx = match.index + match[0].length;\n\n // if an open bracket/brace/paren is escaped,\n // set the index to the next closing character\n var open = match[1];\n var close = open ? chars[open] : null;\n if (open && close) {\n var n = str.indexOf(close, idx);\n if (n !== -1) {\n idx = n + 1;\n }\n }\n\n str = str.slice(idx);\n }\n return false;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-glob/index.js?");
Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\nvar removeTrailingSeparator = __webpack_require__(/*! remove-trailing-separator */ \"./node_modules/remove-trailing-separator/index.js\");\n\nmodule.exports = function normalizePath(str, stripTrailing) {\n if (typeof str !== 'string') {\n throw new TypeError('expected a string');\n }\n str = str.replace(/[\\\\\\/]+/g, '/');\n if (stripTrailing !== false) {\n str = removeTrailingSeparator(str);\n }\n return str;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/anymatch/node_modules/normalize-path/index.js?");
Copyright (c) 2014-2018, Jon Schlinkert.\n * Released under the MIT License.\n */\n\nmodule.exports = function(path, stripTrailing) {\n if (typeof path !== 'string') {\n throw new TypeError('expected path to be a string');\n }\n\n if (path === '\\\\' || path === '/') return '/';\n\n var len = path.length;\n if (len <= 1) return path;\n\n // ensure that win32 namespaces has two leading slashes, so that the path is\n // handled properly by the win32 version of path.parse() after being normalized\n // https://msdn.microsoft.com/library/windows/desktop/aa365247(v=vs.85).aspx#namespaces\n var prefix = '';\n if (len > 4 && path[3] === '\\\\') {\n var ch = path[2];\n if ((ch === '?' || ch === '.') && path.slice(0, 2) === '\\\\\\\\') {\n path = path.slice(2);\n prefix = '//';\n }\n }\n\n var segs = path.split(/[/\\\\]+/);\n if (stripTrailing !== false && segs[segs.length - 1] === '') {\n segs.pop();\n }\n return prefix + segs.join('/');\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/normalize-path/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/is-descriptor/index.js\");\n\nmodule.exports = function defineProperty(obj, prop, val) {\n if (typeof obj !== 'object' && typeof obj !== 'function') {\n throw new TypeError('expected an object or function.');\n }\n\n if (typeof prop !== 'string') {\n throw new TypeError('expected `prop` to be a string.');\n }\n\n if (isDescriptor(val) && ('set' in val || 'get' in val)) {\n return Object.defineProperty(obj, prop, val);\n }\n\n return Object.defineProperty(obj, prop, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/base/node_modules/define-property/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/is-descriptor/index.js\");\n\nmodule.exports = function defineProperty(obj, prop, val) {\n if (typeof obj !== 'object' && typeof obj !== 'function') {\n throw new TypeError('expected an object or function.');\n }\n\n if (typeof prop !== 'string') {\n throw new TypeError('expected `prop` to be a string.');\n }\n\n if (isDescriptor(val) && ('set' in val || 'get' in val)) {\n return Object.defineProperty(obj, prop, val);\n }\n\n return Object.defineProperty(obj, prop, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/extglob/node_modules/define-property/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/is-descriptor/index.js\");\n\nmodule.exports = function defineProperty(obj, prop, val) {\n if (typeof obj !== 'object' && typeof obj !== 'function') {\n throw new TypeError('expected an object or function.');\n }\n\n if (typeof prop !== 'string') {\n throw new TypeError('expected `prop` to be a string.');\n }\n\n if (isDescriptor(val) && ('set' in val || 'get' in val)) {\n return Object.defineProperty(obj, prop, val);\n }\n\n return Object.defineProperty(obj, prop, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon-node/node_modules/define-property/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isObject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\n\nmodule.exports = function visit(thisArg, method, target, val) {\n if (!isObject(thisArg) && typeof thisArg !== 'function') {\n throw new Error('object-visit expects `thisArg` to be an object.');\n }\n\n if (typeof method !== 'string') {\n throw new Error('object-visit expects `method` name to be a string');\n }\n\n if (typeof thisArg[method] !== 'function') {\n return thisArg;\n }\n\n var args = [].slice.call(arguments, 3);\n target = target || {};\n\n for (var key in target) {\n var arr = [key, target[key]].concat(args);\n thisArg[method].apply(thisArg, arr);\n }\n return thisArg;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/object-visit/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isObject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\nvar has = __webpack_require__(/*! has-value */ \"./node_modules/unset-value/node_modules/has-value/index.js\");\n\nmodule.exports = function unset(obj, prop) {\n if (!isObject(obj)) {\n throw new TypeError('expected an object.');\n }\n if (obj.hasOwnProperty(prop)) {\n delete obj[prop];\n return true;\n }\n\n if (has(obj, prop)) {\n var segs = prop.split('.');\n var last = segs.pop();\n while (segs.length && segs[segs.length - 1].slice(-1) === '\\\\') {\n last = segs.pop().slice(0, -1) + '.' + last;\n }\n while (segs.length) obj = obj[prop = segs.shift()];\n return (delete obj[last]);\n }\n return true;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/unset-value/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar repeat = __webpack_require__(/*! repeat-string */ \"./node_modules/repeat-string/index.js\");\nvar isNumber = __webpack_require__(/*! is-number */ \"./node_modules/is-number/index.js\");\nvar cache = {};\n\nfunction toRegexRange(min, max, options) {\n if (isNumber(min) === false) {\n throw new RangeError('toRegexRange: first argument is invalid.');\n }\n\n if (typeof max === 'undefined' || min === max) {\n return String(min);\n }\n\n if (isNumber(max) === false) {\n throw new RangeError('toRegexRange: second argument is invalid.');\n }\n\n options = options || {};\n var relax = String(options.relaxZeros);\n var shorthand = String(options.shorthand);\n var capture = String(options.capture);\n var key = min + ':' + max + '=' + relax + shorthand + capture;\n if (cache.hasOwnProperty(key)) {\n return cache[key].result;\n }\n\n var a = Math.min(min, max);\n var b = Math.max(min, max);\n\n if (Math.abs(a - b) === 1) {\n var result = min + '|' + max;\n if (options.capture) {\n return '(' + result + ')';\n }\n return result;\n }\n\n var isPadded = padding(min) || padding(max);\n var positives = [];\n var negatives = [];\n\n var tok = {min: min, max: max, a: a, b: b};\n if (isPadded) {\n tok.isPadded = isPadded;\n tok.maxLen = String(tok.max).length;\n }\n\n if (a < 0) {\n var newMin = b < 0 ? Math.abs(b) : 1;\n var newMax = Math.abs(a);\n negatives = splitToPatterns(newMin, newMax, tok, options);\n a = tok.a = 0;\n }\n\n if (b >= 0) {\n positives = splitToPatterns(a, b, tok, options);\n }\n\n tok.negatives = negatives;\n tok.positives = positives;\n tok.result = siftPatterns(negatives, positives, options);\n\n if (options.capture && (positives.length + negatives.length) > 1) {\n tok.result = '(' + tok.result + ')';\n }\n\n cache[key] = tok;\n return tok.result;\n}\n\nfunction siftPatterns(neg, pos, options) {\n var onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];\n var onlyPositive = filterPatterns(pos, neg, '', false, options) || [];\n var intersected = filterPatterns(neg, pos, '-?', true, options) || [];\n var subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);\n return subpatterns.join('|');\n}\n\nfunction splitToRanges(min, max) {\n min = Number(min);\n max = Number(max);\n\n var nines = 1;\n var stops = [max];\n var stop = +countNines(min, nines);\n\n while (min <= stop && stop <= max) {\n stops = push(stops, stop);\n nines += 1;\n stop = +countNines(min, nines);\n }\n\n var zeros = 1;\n stop = countZeros(max + 1, zeros) - 1;\n\n while (min < stop && stop <= max) {\n stops = push(stops, stop);\n zeros += 1;\n stop = countZeros(max + 1, zeros) - 1;\n }\n\n stops.sort(compare);\n return stops;\n}\n\n/**\n * Convert a range to a regex pattern\n * @param {Number} `start`\n * @param {Number} `stop`\n * @return {String}\n */\n\nfunction rangeToPattern(start, stop, options) {\n if (start === stop) {\n return {pattern: String(start), digits: []};\n }\n\n var zipped = zip(String(start), String(stop));\n var len = zipped.length, i = -1;\n\n var pattern = '';\n var digits = 0;\n\n while (++i < len) {\n var numbers = zipped[i];\n var startDigit = numbers[0];\n var stopDigit = numbers[1];\n\n if (startDigit === stopDigit) {\n pattern += startDigit;\n\n } else if (startDigit !== '0' || stopDigit !== '9') {\n pattern += toCharacterClass(startDigit, stopDigit);\n\n } else {\n digits += 1;\n }\n }\n\n if (digits) {\n pattern += options.shorthand ? '\\\\d' : '[0-9]';\n }\n\n return { pattern: pattern, digits: [digits] };\n}\n\nfunction splitToPatterns(min, max, tok, options) {\n var ranges = splitToRanges(min, max);\n var len = ranges.length;\n var idx = -1;\n\n var tokens = [];\n var start = min;\n var prev;\n\n while (++idx < len) {\n var range = ranges[idx];\n var obj = rangeToPattern(start, range, options);\n var zeros = '';\n\n if (!tok.isPadded && prev && prev.pattern === obj.pattern) {\n if (prev.digits.length > 1) {\n prev.digits.pop();\n }\n prev.digits.push(obj.digits[0]);\n prev.string = prev.pattern + toQuantifier(prev.digits);\n start = range + 1;\n continue;\n }\n\n if (tok.isPadded) {\n zeros = padZeros(range, tok);\n }\n\n obj.string = zeros + obj.pattern + toQuantifier(obj.digits);\n tokens.push(obj);\n start = range + 1;\n prev = obj;\n }\n\n return tokens;\n}\n\nfunction filterPatterns(arr, comparison, prefix, intersection, options) {\n var res = [];\n\n for (var i = 0; i < arr.length; i++) {\n var tok = arr[i];\n var ele = tok.string;\n\n if (options.relaxZeros !== false) {\n if (prefix === '-' && ele.charAt(0) === '0') {\n if (ele.charAt(1) === '{') {\n ele = '0*' + ele.replace(/^0\\{\\d+\\}/, '');\n } else {\n ele = '0*' + ele.slice(1);\n }\n }\n }\n\n if (!intersection && !contains(comparison, 'string', ele)) {\n res.push(prefix + ele);\n }\n\n if (intersection && contains(comparison, 'string', ele)) {\n res.push(prefix + ele);\n }\n }\n return res;\n}\n\n/**\n * Zip strings (`for in` can be used on string characters)\n */\n\nfunction zip(a, b) {\n var arr = [];\n for (var ch in a) arr.push([a[ch], b[ch]]);\n return arr;\n}\n\nfunction compare(a, b) {\n return a > b ? 1 : b > a ? -1 : 0;\n}\n\nfunction push(arr, ele) {\n if (arr.indexOf(ele) === -1) arr.push(ele);\n return arr;\n}\n\nfunction contains(arr, key, val) {\n for (var i = 0; i < arr.length; i++) {\n if (arr[i][key] === val) {\n return true;\n }\n }\n return false;\n}\n\nfunction countNines(min, len) {\n return String(min).slice(0, -len) + repeat('9', len);\n}\n\nfunction countZeros(integer, zeros) {\n return integer - (integer % Math.pow(10, zeros));\n}\n\nfunction toQuantifier(digits) {\n var start = digits[0];\n var stop = digits[1] ? (',' + digits[1]) : '';\n if (!stop && (!start || start === 1)) {\n return '';\n }\n return '{' + start + stop + '}';\n}\n\nfunction toCharacterClass(a, b) {\n return '[' + a + ((b - a === 1) ? '' : '-') + b + ']';\n}\n\nfunction padding(str) {\n return /^-?(0+)\\d/.exec(str);\n}\n\nfunction padZeros(val, tok) {\n if (tok.isPadded) {\n var diff = Math.abs(tok.maxLen - String(val).length);\n switch (diff) {\n case 0:\n return '';\n case 1:\n return '0';\n default: {\n return '0{' + diff + '}';\n }\n }\n }\n return val;\n}\n\n/**\n * Expose `toRegexRange`\n */\n\nmodule.exports = toRegexRange;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/to-regex-range/index.js?");
Copyright (c) 2015, 2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar visit = __webpack_require__(/*! object-visit */ \"./node_modules/object-visit/index.js\");\nvar mapVisit = __webpack_require__(/*! map-visit */ \"./node_modules/map-visit/index.js\");\n\nmodule.exports = function(collection, method, val) {\n var result;\n\n if (typeof val === 'string' && (method in collection)) {\n var args = [].slice.call(arguments, 2);\n result = collection[method].apply(collection, args);\n } else if (Array.isArray(val)) {\n result = mapVisit.apply(null, arguments);\n } else {\n result = visit.apply(null, arguments);\n }\n\n if (typeof result !== 'undefined') {\n return result;\n }\n\n return collection;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/collection-visit/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\n/**\n * Copy a descriptor from one object to another.\n *\n * ```js\n * function App() {\n * this.cache = {};\n * }\n * App.prototype.set = function(key, val) {\n * this.cache[key] = val;\n * return this;\n * };\n * Object.defineProperty(App.prototype, 'count', {\n * get: function() {\n * return Object.keys(this.cache).length;\n * }\n * });\n *\n * copy(App.prototype, 'count', 'len');\n *\n * // create an instance\n * var app = new App();\n *\n * app.set('a', true);\n * app.set('b', true);\n * app.set('c', true);\n *\n * console.log(app.count);\n * //=> 3\n * console.log(app.len);\n * //=> 3\n * ```\n * @name copy\n * @param {Object} `receiver` The target object\n * @param {Object} `provider` The provider object\n * @param {String} `from` The key to copy on provider.\n * @param {String} `to` Optionally specify a new key name to use.\n * @return {Object}\n * @api public\n */\n\nmodule.exports = function copyDescriptor(receiver, provider, from, to) {\n if (!isObject(provider) && typeof provider !== 'function') {\n to = from;\n from = provider;\n provider = receiver;\n }\n if (!isObject(receiver) && typeof receiver !== 'function') {\n throw new TypeError('expected the first argument to be an object');\n }\n if (!isObject(provider) && typeof provider !== 'function') {\n throw new TypeError('expected provider to be an object');\n }\n\n if (typeof to !== 'string') {\n to = from;\n }\n if (typeof from !== 'string') {\n throw new TypeError('expected key to be a string');\n }\n\n if (!(from in provider)) {\n throw new Error('property \"' + from + '\" does not exist');\n }\n\n var val = Object.getOwnPropertyDescriptor(provider, from);\n if (val) Object.defineProperty(receiver, to, val);\n};\n\nfunction isObject(val) {\n return {}.toString.call(val) === '[object Object]';\n}\n\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/copy-descriptor/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nmodule.exports = function isExtendable(val) {\n return typeof val !== 'undefined' && val !== null\n && (typeof val === 'object' || typeof val === 'function');\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-extendable/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nmodule.exports = function(receiver, objects) {\n if (receiver === null || typeof receiver === 'undefined') {\n throw new TypeError('expected first argument to be an object.');\n }\n\n if (typeof objects === 'undefined' || typeof Symbol === 'undefined') {\n return receiver;\n }\n\n if (typeof Object.getOwnPropertySymbols !== 'function') {\n return receiver;\n }\n\n var isEnumerable = Object.prototype.propertyIsEnumerable;\n var target = Object(receiver);\n var len = arguments.length, i = 0;\n\n while (++i < len) {\n var provider = Object(arguments[i]);\n var names = Object.getOwnPropertySymbols(provider);\n\n for (var j = 0; j < names.length; j++) {\n var key = names[j];\n\n if (isEnumerable.call(provider, key)) {\n target[key] = provider[key];\n }\n }\n }\n return target;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/assign-symbols/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar hasOwn = Object.prototype.hasOwnProperty;\n\n/**\n * Expose `MapCache`\n */\n\nmodule.exports = MapCache;\n\n/**\n * Creates a cache object to store key/value pairs.\n *\n * ```js\n * var cache = new MapCache();\n * ```\n *\n * @api public\n */\n\nfunction MapCache(data) {\n this.__data__ = data || {};\n}\n\n/**\n * Adds `value` to `key` on the cache.\n *\n * ```js\n * cache.set('foo', 'bar');\n * ```\n *\n * @param {String} `key` The key of the value to cache.\n * @param {*} `value` The value to cache.\n * @returns {Object} Returns the `Cache` object for chaining.\n * @api public\n */\n\nMapCache.prototype.set = function mapSet(key, value) {\n if (key !== '__proto__') {\n this.__data__[key] = value;\n }\n return this;\n};\n\n/**\n * Gets the cached value for `key`.\n *\n * ```js\n * cache.get('foo');\n * //=> 'bar'\n * ```\n *\n * @param {String} `key` The key of the value to get.\n * @returns {*} Returns the cached value.\n * @api public\n */\n\nMapCache.prototype.get = function mapGet(key) {\n return key === '__proto__' ? undefined : this.__data__[key];\n};\n\n/**\n * Checks if a cached value for `key` exists.\n *\n * ```js\n * cache.has('foo');\n * //=> true\n * ```\n *\n * @param {String} `key` The key of the entry to check.\n * @returns {Boolean} Returns `true` if an entry for `key` exists, else `false`.\n * @api public\n */\n\nMapCache.prototype.has = function mapHas(key) {\n return key !== '__proto__' && hasOwn.call(this.__data__, key);\n};\n\n/**\n * Removes `key` and its value from the cache.\n *\n * ```js\n * cache.del('foo');\n * ```\n * @title .del\n * @param {String} `key` The key of the value to remove.\n * @returns {Boolean} Returns `true` if the entry was removed successfully, else `false`.\n * @api public\n */\n\nMapCache.prototype.del = function mapDelete(key) {\n return this.has(key) && delete this.__data__[key];\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/map-cache/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/define-property/node_modules/is-descriptor/index.js\");\n\nmodule.exports = function defineProperty(obj, prop, val) {\n if (typeof obj !== 'object' && typeof obj !== 'function') {\n throw new TypeError('expected an object or function.');\n }\n\n if (typeof prop !== 'string') {\n throw new TypeError('expected `prop` to be a string.');\n }\n\n if (isDescriptor(val) && ('set' in val || 'get' in val)) {\n return Object.defineProperty(obj, prop, val);\n }\n\n return Object.defineProperty(obj, prop, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/define-property/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/define-property/node_modules/is-accessor-descriptor/node_modules/kind-of/index.js\");\n\n// accessor descriptor properties\nvar accessor = {\n get: 'function',\n set: 'function',\n configurable: 'boolean',\n enumerable: 'boolean'\n};\n\nfunction isAccessorDescriptor(obj, prop) {\n if (typeof prop === 'string') {\n var val = Object.getOwnPropertyDescriptor(obj, prop);\n return typeof val !== 'undefined';\n }\n\n if (typeOf(obj) !== 'object') {\n return false;\n }\n\n if (has(obj, 'value') || has(obj, 'writable')) {\n return false;\n }\n\n if (!has(obj, 'get') || typeof obj.get !== 'function') {\n return false;\n }\n\n // tldr: it's valid to have \"set\" be undefined\n // \"set\" might be undefined if `Object.getOwnPropertyDescriptor`\n // was used to get the value, and only `get` was defined by the user\n if (has(obj, 'set') && typeof obj[key] !== 'function' && typeof obj[key] !== 'undefined') {\n return false;\n }\n\n for (var key in obj) {\n if (!accessor.hasOwnProperty(key)) {\n continue;\n }\n\n if (typeOf(obj[key]) === accessor[key]) {\n continue;\n }\n\n if (typeof obj[key] !== 'undefined') {\n return false;\n }\n }\n return true;\n}\n\nfunction has(obj, key) {\n return {}.hasOwnProperty.call(obj, key);\n}\n\n/**\n * Expose `isAccessorDescriptor`\n */\n\nmodule.exports = isAccessorDescriptor;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/define-property/node_modules/is-accessor-descriptor/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/define-property/node_modules/is-data-descriptor/node_modules/kind-of/index.js\");\n\n// data descriptor properties\nvar data = {\n configurable: 'boolean',\n enumerable: 'boolean',\n writable: 'boolean'\n};\n\nfunction isDataDescriptor(obj, prop) {\n if (typeOf(obj) !== 'object') {\n return false;\n }\n\n if (typeof prop === 'string') {\n var val = Object.getOwnPropertyDescriptor(obj, prop);\n return typeof val !== 'undefined';\n }\n\n if (!('value' in obj) && !('writable' in obj)) {\n return false;\n }\n\n for (var key in obj) {\n if (key === 'value') continue;\n\n if (!data.hasOwnProperty(key)) {\n continue;\n }\n\n if (typeOf(obj[key]) === data[key]) {\n continue;\n }\n\n if (typeof obj[key] !== 'undefined') {\n return false;\n }\n }\n return true;\n}\n\n/**\n * Expose `isDataDescriptor`\n */\n\nmodule.exports = isDataDescriptor;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/define-property/node_modules/is-data-descriptor/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/to-object-path/node_modules/kind-of/index.js\");\n\nmodule.exports = function toPath(args) {\n if (typeOf(args) !== 'arguments') {\n args = arguments;\n }\n return filter(args).join('.');\n};\n\nfunction filter(arr) {\n var len = arr.length;\n var idx = -1;\n var res = [];\n\n while (++idx < len) {\n var ele = arr[idx];\n if (typeOf(ele) === 'arguments' || Array.isArray(ele)) {\n res.push.apply(res, filter(ele));\n } else if (typeof ele === 'string') {\n res.push(ele);\n }\n }\n return res;\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/to-object-path/index.js?");
Copyright (c) 2015, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\nfunction pascalcase(str) {\n if (typeof str !== 'string') {\n throw new TypeError('expected a string.');\n }\n str = str.replace(/([A-Z])/g, ' $1');\n if (str.length === 1) { return str.toUpperCase(); }\n str = str.replace(/^[\\W_]+|[\\W_]+$/g, '').toLowerCase();\n str = str.charAt(0).toUpperCase() + str.slice(1);\n return str.replace(/[\\W_]+(\\w|$)/g, function (_, ch) {\n return ch.toUpperCase();\n });\n}\n\nmodule.exports = pascalcase;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/pascalcase/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nmodule.exports = function base(app, options) {\n if (!isObject(app) && typeof app !== 'function') {\n throw new TypeError('expected an object or function');\n }\n\n var opts = isObject(options) ? options : {};\n var prop = typeof opts.prop === 'string' ? opts.prop : 'fns';\n if (!Array.isArray(app[prop])) {\n define(app, prop, []);\n }\n\n /**\n * Define a plugin function to be passed to use. The only\n * parameter exposed to the plugin is `app`, the object or function.\n * passed to `use(app)`. `app` is also exposed as `this` in plugins.\n *\n * Additionally, **if a plugin returns a function, the function will\n * be pushed onto the `fns` array**, allowing the plugin to be\n * called at a later point by the `run` method.\n *\n * ```js\n * var use = require('use');\n *\n * // define a plugin\n * function foo(app) {\n * // do stuff\n * }\n *\n * var app = function(){};\n * use(app);\n *\n * // register plugins\n * app.use(foo);\n * app.use(bar);\n * app.use(baz);\n * ```\n * @name .use\n * @param {Function} `fn` plugin function to call\n * @api public\n */\n\n define(app, 'use', use);\n\n /**\n * Run all plugins on `fns`. Any plugin that returns a function\n * when called by `use` is pushed onto the `fns` array.\n *\n * ```js\n * var config = {};\n * app.run(config);\n * ```\n * @name .run\n * @param {Object} `value` Object to be modified by plugins.\n * @return {Object} Returns the object passed to `run`\n * @api public\n */\n\n define(app, 'run', function(val) {\n if (!isObject(val)) return;\n\n if (!val.use || !val.run) {\n define(val, prop, val[prop] || []);\n define(val, 'use', use);\n }\n\n if (!val[prop] || val[prop].indexOf(base) === -1) {\n val.use(base);\n }\n\n var self = this || app;\n var fns = self[prop];\n var len = fns.length;\n var idx = -1;\n\n while (++idx < len) {\n val.use(fns[idx]);\n }\n return val;\n });\n\n /**\n * Call plugin `fn`. If a function is returned push it into the\n * `fns` array to be called by the `run` method.\n */\n\n function use(type, fn, options) {\n var offset = 1;\n\n if (typeof type === 'string' || Array.isArray(type)) {\n fn = wrap(type, fn);\n offset++;\n } else {\n options = fn;\n fn = type;\n }\n\n if (typeof fn !== 'function') {\n throw new TypeError('expected a function');\n }\n\n var self = this || app;\n var fns = self[prop];\n\n var args = [].slice.call(arguments, offset);\n args.unshift(self);\n\n if (typeof opts.hook === 'function') {\n opts.hook.apply(self, args);\n }\n\n var val = fn.apply(self, args);\n if (typeof val === 'function' && fns.indexOf(val) === -1) {\n fns.push(val);\n }\n return self;\n }\n\n /**\n * Wrap a named plugin function so that it's only called on objects of the\n * given `type`\n *\n * @param {String} `type`\n * @param {Function} `fn` Plugin function\n * @return {Function}\n */\n\n function wrap(type, fn) {\n return function plugin() {\n return this.type === type ? fn.apply(this, arguments) : plugin;\n };\n }\n\n return app;\n};\n\nfunction isObject(val) {\n return val && typeof val === 'object' && !Array.isArray(val);\n}\n\nfunction define(obj, key, val) {\n Object.defineProperty(obj, key, {\n configurable: true,\n writable: true,\n value: val\n });\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/use/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar extend = __webpack_require__(/*! extend-shallow */ \"./node_modules/split-string/node_modules/extend-shallow/index.js\");\n\nmodule.exports = function(str, options, fn) {\n if (typeof str !== 'string') {\n throw new TypeError('expected a string');\n }\n\n if (typeof options === 'function') {\n fn = options;\n options = null;\n }\n\n // allow separator to be defined as a string\n if (typeof options === 'string') {\n options = { sep: options };\n }\n\n var opts = extend({sep: '.'}, options);\n var quotes = opts.quotes || ['\"', \"'\", '`'];\n var brackets;\n\n if (opts.brackets === true) {\n brackets = {\n '<': '>',\n '(': ')',\n '[': ']',\n '{': '}'\n };\n } else if (opts.brackets) {\n brackets = opts.brackets;\n }\n\n var tokens = [];\n var stack = [];\n var arr = [''];\n var sep = opts.sep;\n var len = str.length;\n var idx = -1;\n var closeIdx;\n\n function expected() {\n if (brackets && stack.length) {\n return brackets[stack[stack.length - 1]];\n }\n }\n\n while (++idx < len) {\n var ch = str[idx];\n var next = str[idx + 1];\n var tok = { val: ch, idx: idx, arr: arr, str: str };\n tokens.push(tok);\n\n if (ch === '\\\\') {\n tok.val = keepEscaping(opts, str, idx) === true ? (ch + next) : next;\n tok.escaped = true;\n if (typeof fn === 'function') {\n fn(tok);\n }\n arr[arr.length - 1] += tok.val;\n idx++;\n continue;\n }\n\n if (brackets && brackets[ch]) {\n stack.push(ch);\n var e = expected();\n var i = idx + 1;\n\n if (str.indexOf(e, i + 1) !== -1) {\n while (stack.length && i < len) {\n var s = str[++i];\n if (s === '\\\\') {\n s++;\n continue;\n }\n\n if (quotes.indexOf(s) !== -1) {\n i = getClosingQuote(str, s, i + 1);\n continue;\n }\n\n e = expected();\n if (stack.length && str.indexOf(e, i + 1) === -1) {\n break;\n }\n\n if (brackets[s]) {\n stack.push(s);\n continue;\n }\n\n if (e === s) {\n stack.pop();\n }\n }\n }\n\n closeIdx = i;\n if (closeIdx === -1) {\n arr[arr.length - 1] += ch;\n continue;\n }\n\n ch = str.slice(idx, closeIdx + 1);\n tok.val = ch;\n tok.idx = idx = closeIdx;\n }\n\n if (quotes.indexOf(ch) !== -1) {\n closeIdx = getClosingQuote(str, ch, idx + 1);\n if (closeIdx === -1) {\n arr[arr.length - 1] += ch;\n continue;\n }\n\n if (keepQuotes(ch, opts) === true) {\n ch = str.slice(idx, closeIdx + 1);\n } else {\n ch = str.slice(idx + 1, closeIdx);\n }\n\n tok.val = ch;\n tok.idx = idx = closeIdx;\n }\n\n if (typeof fn === 'function') {\n fn(tok, tokens);\n ch = tok.val;\n idx = tok.idx;\n }\n\n if (tok.val === sep && tok.split !== false) {\n arr.push('');\n continue;\n }\n\n arr[arr.length - 1] += tok.val;\n }\n\n return arr;\n};\n\nfunction getClosingQuote(str, ch, i, brackets) {\n var idx = str.indexOf(ch, i);\n if (str.charAt(idx - 1) === '\\\\') {\n return getClosingQuote(str, ch, idx + 1);\n }\n return idx;\n}\n\nfunction keepQuotes(ch, opts) {\n if (opts.keepDoubleQuotes === true && ch === '\"') return true;\n if (opts.keepSingleQuotes === true && ch === \"'\") return true;\n return opts.keepQuotes;\n}\n\nfunction keepEscaping(opts, str, idx) {\n if (typeof opts.keepEscaping === 'function') {\n return opts.keepEscaping(str, idx);\n }\n return opts.keepEscaping === true || str[idx + 1] === '\\\\';\n}\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/split-string/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\n\nmodule.exports = function isExtendable(val) {\n return isPlainObject(val) || typeof val === 'function' || Array.isArray(val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/micromatch/node_modules/is-extendable/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\n\nmodule.exports = function isExtendable(val) {\n return isPlainObject(val) || typeof val === 'function' || Array.isArray(val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/mixin-deep/node_modules/is-extendable/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\n\nmodule.exports = function isExtendable(val) {\n return isPlainObject(val) || typeof val === 'function' || Array.isArray(val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/nanomatch/node_modules/is-extendable/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\n\nmodule.exports = function isExtendable(val) {\n return isPlainObject(val) || typeof val === 'function' || Array.isArray(val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/regex-not/node_modules/is-extendable/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\n\nmodule.exports = function isExtendable(val) {\n return isPlainObject(val) || typeof val === 'function' || Array.isArray(val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/split-string/node_modules/is-extendable/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isPlainObject = __webpack_require__(/*! is-plain-object */ \"./node_modules/is-plain-object/index.js\");\n\nmodule.exports = function isExtendable(val) {\n return isPlainObject(val) || typeof val === 'function' || Array.isArray(val);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/to-regex/node_modules/is-extendable/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/define-property/node_modules/kind-of/index.js\");\nvar isAccessor = __webpack_require__(/*! is-accessor-descriptor */ \"./node_modules/define-property/node_modules/is-accessor-descriptor/index.js\");\nvar isData = __webpack_require__(/*! is-data-descriptor */ \"./node_modules/define-property/node_modules/is-data-descriptor/index.js\");\n\nmodule.exports = function isDescriptor(obj, key) {\n if (typeOf(obj) !== 'object') {\n return false;\n }\n if ('get' in obj) {\n return isAccessor(obj, key);\n }\n return isData(obj, key);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/define-property/node_modules/is-descriptor/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/kind-of/index.js\");\n\n// accessor descriptor properties\nvar accessor = {\n get: 'function',\n set: 'function',\n configurable: 'boolean',\n enumerable: 'boolean'\n};\n\nfunction isAccessorDescriptor(obj, prop) {\n if (typeof prop === 'string') {\n var val = Object.getOwnPropertyDescriptor(obj, prop);\n return typeof val !== 'undefined';\n }\n\n if (typeOf(obj) !== 'object') {\n return false;\n }\n\n if (has(obj, 'value') || has(obj, 'writable')) {\n return false;\n }\n\n if (!has(obj, 'get') || typeof obj.get !== 'function') {\n return false;\n }\n\n // tldr: it's valid to have \"set\" be undefined\n // \"set\" might be undefined if `Object.getOwnPropertyDescriptor`\n // was used to get the value, and only `get` was defined by the user\n if (has(obj, 'set') && typeof obj[key] !== 'function' && typeof obj[key] !== 'undefined') {\n return false;\n }\n\n for (var key in obj) {\n if (!accessor.hasOwnProperty(key)) {\n continue;\n }\n\n if (typeOf(obj[key]) === accessor[key]) {\n continue;\n }\n\n if (typeof obj[key] !== 'undefined') {\n return false;\n }\n }\n return true;\n}\n\nfunction has(obj, key) {\n return {}.hasOwnProperty.call(obj, key);\n}\n\n/**\n * Expose `isAccessorDescriptor`\n */\n\nmodule.exports = isAccessorDescriptor;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-accessor-descriptor/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/kind-of/index.js\");\n\nmodule.exports = function isDataDescriptor(obj, prop) {\n // data descriptor properties\n var data = {\n configurable: 'boolean',\n enumerable: 'boolean',\n writable: 'boolean'\n };\n\n if (typeOf(obj) !== 'object') {\n return false;\n }\n\n if (typeof prop === 'string') {\n var val = Object.getOwnPropertyDescriptor(obj, prop);\n return typeof val !== 'undefined';\n }\n\n if (!('value' in obj) && !('writable' in obj)) {\n return false;\n }\n\n for (var key in obj) {\n if (key === 'value') continue;\n\n if (!data.hasOwnProperty(key)) {\n continue;\n }\n\n if (typeOf(obj[key]) === data[key]) {\n continue;\n }\n\n if (typeof obj[key] !== 'undefined') {\n return false;\n }\n }\n return true;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-data-descriptor/index.js?");
Copyright (c) 2015-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar typeOf = __webpack_require__(/*! kind-of */ \"./node_modules/kind-of/index.js\");\nvar isAccessor = __webpack_require__(/*! is-accessor-descriptor */ \"./node_modules/is-accessor-descriptor/index.js\");\nvar isData = __webpack_require__(/*! is-data-descriptor */ \"./node_modules/is-data-descriptor/index.js\");\n\nmodule.exports = function isDescriptor(obj, key) {\n if (typeOf(obj) !== 'object') {\n return false;\n }\n if ('get' in obj) {\n return isAccessor(obj, key);\n }\n return isData(obj, key);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-descriptor/index.js?");
Copyright (c) 2015-2018, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isobject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/is-descriptor/index.js\");\nvar define = (typeof Reflect !== 'undefined' && Reflect.defineProperty)\n ? Reflect.defineProperty\n : Object.defineProperty;\n\nmodule.exports = function defineProperty(obj, key, val) {\n if (!isobject(obj) && typeof obj !== 'function' && !Array.isArray(obj)) {\n throw new TypeError('expected an object, function, or array');\n }\n\n if (typeof key !== 'string') {\n throw new TypeError('expected \"key\" to be a string');\n }\n\n if (isDescriptor(val)) {\n define(obj, key, val);\n return obj;\n }\n\n define(obj, key, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n\n return obj;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/micromatch/node_modules/define-property/index.js?");
Copyright (c) 2015-2018, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isobject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/is-descriptor/index.js\");\nvar define = (typeof Reflect !== 'undefined' && Reflect.defineProperty)\n ? Reflect.defineProperty\n : Object.defineProperty;\n\nmodule.exports = function defineProperty(obj, key, val) {\n if (!isobject(obj) && typeof obj !== 'function' && !Array.isArray(obj)) {\n throw new TypeError('expected an object, function, or array');\n }\n\n if (typeof key !== 'string') {\n throw new TypeError('expected \"key\" to be a string');\n }\n\n if (isDescriptor(val)) {\n define(obj, key, val);\n return obj;\n }\n\n define(obj, key, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n\n return obj;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/nanomatch/node_modules/define-property/index.js?");
Copyright (c) 2015-2018, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar isobject = __webpack_require__(/*! isobject */ \"./node_modules/isobject/index.js\");\nvar isDescriptor = __webpack_require__(/*! is-descriptor */ \"./node_modules/is-descriptor/index.js\");\nvar define = (typeof Reflect !== 'undefined' && Reflect.defineProperty)\n ? Reflect.defineProperty\n : Object.defineProperty;\n\nmodule.exports = function defineProperty(obj, key, val) {\n if (!isobject(obj) && typeof obj !== 'function' && !Array.isArray(obj)) {\n throw new TypeError('expected an object, function, or array');\n }\n\n if (typeof key !== 'string') {\n throw new TypeError('expected \"key\" to be a string');\n }\n\n if (isDescriptor(val)) {\n define(obj, key, val);\n return obj;\n }\n\n define(obj, key, {\n configurable: true,\n enumerable: false,\n writable: true,\n value: val\n });\n\n return obj;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/to-regex/node_modules/define-property/index.js?");
Copyright (c) 2015-present, Jon Schlinkert.\n * Licensed under the MIT license.\n */\n\n\n\nmodule.exports = function repeat(ele, num) {\n if (Array.prototype.fill) {\n return new Array(num).fill(ele);\n }\n\n var arr = new Array(num);\n\n for (var i = 0; i < num; i++) {\n arr[i] = ele;\n }\n\n return arr;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/repeat-element/index.js?");
Copyright (c) 2016, Jon Schlinkert.\n * Licensed under the MIT License.\n */\n\n\n\nvar copy = __webpack_require__(/*! object-copy */ \"./node_modules/object-copy/index.js\");\nvar define = __webpack_require__(/*! define-property */ \"./node_modules/define-property/index.js\");\nvar util = __webpack_require__(/*! util */ \"util\");\n\n/**\n * Returns a function for extending the static properties,\n * prototype properties, and descriptors from the `Parent`\n * constructor onto `Child` constructors.\n *\n * ```js\n * var extend = require('static-extend');\n * Parent.extend = extend(Parent);\n *\n * // optionally pass a custom merge function as the second arg\n * Parent.extend = extend(Parent, function(Child) {\n * Child.prototype.mixin = function(key, val) {\n * Child.prototype[key] = val;\n * };\n * });\n *\n * // extend \"child\" constructors\n * Parent.extend(Child);\n *\n * // optionally define prototype methods as the second arg\n * Parent.extend(Child, {\n * foo: function() {},\n * bar: function() {}\n * });\n * ```\n * @param {Function} `Parent` Parent ctor\n * @param {Function} `extendFn` Optional extend function for handling any necessary custom merging. Useful when updating methods that require a specific prototype.\n * @param {Function} `Child` Child ctor\n * @param {Object} `proto` Optionally pass additional prototype properties to inherit.\n * @return {Object}\n * @api public\n */\n\nfunction extend(Parent, extendFn) {\n if (typeof Parent !== 'function') {\n throw new TypeError('expected Parent to be a function.');\n }\n\n return function(Ctor, proto) {\n if (typeof Ctor !== 'function') {\n throw new TypeError('expected Ctor to be a function.');\n }\n\n util.inherits(Ctor, Parent);\n copy(Ctor, Parent);\n\n // proto can be null or a plain object\n if (typeof proto === 'object') {\n var obj = Object.create(proto);\n\n for (var k in obj) {\n Ctor.prototype[k] = obj[k];\n }\n }\n\n // keep a reference to the parent prototype\n define(Ctor.prototype, '_parent_', {\n configurable: true,\n set: function() {},\n get: function() {\n return Parent.prototype;\n }\n });\n\n if (typeof extendFn === 'function') {\n extendFn(Ctor, Parent);\n }\n\n Ctor.extend = extend(Ctor, extendFn);\n };\n};\n\n/**\n * Expose `extend`\n */\n\nmodule.exports = extend;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/static-extend/index.js?");
Copyright (c) 2016-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n\n\nvar MapCache = __webpack_require__(/*! map-cache */ \"./node_modules/map-cache/index.js\");\n\n/**\n * Create a new `FragmentCache` with an optional object to use for `caches`.\n *\n * ```js\n * var fragment = new FragmentCache();\n * ```\n * @name FragmentCache\n * @param {String} `cacheName`\n * @return {Object} Returns the [map-cache][] instance.\n * @api public\n */\n\nfunction FragmentCache(caches) {\n this.caches = caches || {};\n}\n\n/**\n * Prototype\n */\n\nFragmentCache.prototype = {\n\n /**\n * Get cache `name` from the `fragment.caches` object. Creates a new\n * `MapCache` if it doesn't already exist.\n *\n * ```js\n * var cache = fragment.cache('files');\n * console.log(fragment.caches.hasOwnProperty('files'));\n * //=> true\n * ```\n * @name .cache\n * @param {String} `cacheName`\n * @return {Object} Returns the [map-cache][] instance.\n * @api public\n */\n\n cache: function(cacheName) {\n return this.caches[cacheName] || (this.caches[cacheName] = new MapCache());\n },\n\n /**\n * Set a value for property `key` on cache `name`\n *\n * ```js\n * fragment.set('files', 'somefile.js', new File({path: 'somefile.js'}));\n * ```\n * @name .set\n * @param {String} `name`\n * @param {String} `key` Property name to set\n * @param {any} `val` The value of `key`\n * @return {Object} The cache instance for chaining\n * @api public\n */\n\n set: function(cacheName, key, val) {\n var cache = this.cache(cacheName);\n cache.set(key, val);\n return cache;\n },\n\n /**\n * Returns true if a non-undefined value is set for `key` on fragment cache `name`.\n *\n * ```js\n * var cache = fragment.cache('files');\n * cache.set('somefile.js');\n *\n * console.log(cache.has('somefile.js'));\n * //=> true\n *\n * console.log(cache.has('some-other-file.js'));\n * //=> false\n * ```\n * @name .has\n * @param {String} `name` Cache name\n * @param {String} `key` Optionally specify a property to check for on cache `name`\n * @return {Boolean}\n * @api public\n */\n\n has: function(cacheName, key) {\n return typeof this.get(cacheName, key) !== 'undefined';\n },\n\n /**\n * Get `name`, or if specified, the value of `key`. Invokes the [cache]() method,\n * so that cache `name` will be created it doesn't already exist. If `key` is not passed,\n * the entire cache (`name`) is returned.\n *\n * ```js\n * var Vinyl = require('vinyl');\n * var cache = fragment.cache('files');\n * cache.set('somefile.js', new Vinyl({path: 'somefile.js'}));\n * console.log(cache.get('somefile.js'));\n * //=> <File \"somefile.js\">\n * ```\n * @name .get\n * @param {String} `name`\n * @return {Object} Returns cache `name`, or the value of `key` if specified\n * @api public\n */\n\n get: function(name, key) {\n var cache = this.cache(name);\n if (typeof key === 'string') {\n return cache.get(key);\n }\n return cache;\n }\n};\n\n/**\n * Expose `FragmentCache`\n */\n\nexports = module.exports = FragmentCache;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/fragment-cache/index.js?");
Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\nexports.SourceMapGenerator = __webpack_require__(/*! ./lib/source-map-generator */ \"./node_modules/snapdragon/node_modules/source-map/lib/source-map-generator.js\").SourceMapGenerator;\nexports.SourceMapConsumer = __webpack_require__(/*! ./lib/source-map-consumer */ \"./node_modules/snapdragon/node_modules/source-map/lib/source-map-consumer.js\").SourceMapConsumer;\nexports.SourceNode = __webpack_require__(/*! ./lib/source-node */ \"./node_modules/snapdragon/node_modules/source-map/lib/source-node.js\").SourceNode;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/source-map.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n/**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\nfunction getArg(aArgs, aName, aDefaultValue) {\n if (aName in aArgs) {\n return aArgs[aName];\n } else if (arguments.length === 3) {\n return aDefaultValue;\n } else {\n throw new Error('\"' + aName + '\" is a required argument.');\n }\n}\nexports.getArg = getArg;\n\nvar urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.]*)(?::(\\d+))?(\\S*)$/;\nvar dataUrlRegexp = /^data:.+\\,.+$/;\n\nfunction urlParse(aUrl) {\n var match = aUrl.match(urlRegexp);\n if (!match) {\n return null;\n }\n return {\n scheme: match[1],\n auth: match[2],\n host: match[3],\n port: match[4],\n path: match[5]\n };\n}\nexports.urlParse = urlParse;\n\nfunction urlGenerate(aParsedUrl) {\n var url = '';\n if (aParsedUrl.scheme) {\n url += aParsedUrl.scheme + ':';\n }\n url += '//';\n if (aParsedUrl.auth) {\n url += aParsedUrl.auth + '@';\n }\n if (aParsedUrl.host) {\n url += aParsedUrl.host;\n }\n if (aParsedUrl.port) {\n url += \":\" + aParsedUrl.port\n }\n if (aParsedUrl.path) {\n url += aParsedUrl.path;\n }\n return url;\n}\nexports.urlGenerate = urlGenerate;\n\n/**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '<dir>/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\nfunction normalize(aPath) {\n var path = aPath;\n var url = urlParse(aPath);\n if (url) {\n if (!url.path) {\n return aPath;\n }\n path = url.path;\n }\n var isAbsolute = exports.isAbsolute(path);\n\n var parts = path.split(/\\/+/);\n for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n part = parts[i];\n if (part === '.') {\n parts.splice(i, 1);\n } else if (part === '..') {\n up++;\n } else if (up > 0) {\n if (part === '') {\n // The first part is blank if the path is absolute. Trying to go\n // above the root is a no-op. Therefore we can remove all '..' parts\n // directly after the root.\n parts.splice(i + 1, up);\n up = 0;\n } else {\n parts.splice(i, 2);\n up--;\n }\n }\n }\n path = parts.join('/');\n\n if (path === '') {\n path = isAbsolute ? '/' : '.';\n }\n\n if (url) {\n url.path = path;\n return urlGenerate(url);\n }\n return path;\n}\nexports.normalize = normalize;\n\n/**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n * scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n * first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n * is updated with the result and aRoot is returned. Otherwise the result\n * is returned.\n * - If aPath is absolute, the result is aPath.\n * - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\nfunction join(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n if (aPath === \"\") {\n aPath = \".\";\n }\n var aPathUrl = urlParse(aPath);\n var aRootUrl = urlParse(aRoot);\n if (aRootUrl) {\n aRoot = aRootUrl.path || '/';\n }\n\n // `join(foo, '//www.example.org')`\n if (aPathUrl && !aPathUrl.scheme) {\n if (aRootUrl) {\n aPathUrl.scheme = aRootUrl.scheme;\n }\n return urlGenerate(aPathUrl);\n }\n\n if (aPathUrl || aPath.match(dataUrlRegexp)) {\n return aPath;\n }\n\n // `join('http://', 'www.example.com')`\n if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n aRootUrl.host = aPath;\n return urlGenerate(aRootUrl);\n }\n\n var joined = aPath.charAt(0) === '/'\n ? aPath\n : normalize(aRoot.replace(/\\/+$/, '') + '/' + aPath);\n\n if (aRootUrl) {\n aRootUrl.path = joined;\n return urlGenerate(aRootUrl);\n }\n return joined;\n}\nexports.join = join;\n\nexports.isAbsolute = function (aPath) {\n return aPath.charAt(0) === '/' || !!aPath.match(urlRegexp);\n};\n\n/**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\nfunction relative(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n\n aRoot = aRoot.replace(/\\/$/, '');\n\n // It is possible for the path to be above the root. In this case, simply\n // checking whether the root is a prefix of the path won't work. Instead, we\n // need to remove components from the root one by one, until either we find\n // a prefix that fits, or we run out of components to remove.\n var level = 0;\n while (aPath.indexOf(aRoot + '/') !== 0) {\n var index = aRoot.lastIndexOf(\"/\");\n if (index < 0) {\n return aPath;\n }\n\n // If the only part of the root that is left is the scheme (i.e. http://,\n // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n // have exhausted all components, so the path is not relative to the root.\n aRoot = aRoot.slice(0, index);\n if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n return aPath;\n }\n\n ++level;\n }\n\n // Make sure we add a \"../\" for each component we removed from the root.\n return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n}\nexports.relative = relative;\n\nvar supportsNullProto = (function () {\n var obj = Object.create(null);\n return !('__proto__' in obj);\n}());\n\nfunction identity (s) {\n return s;\n}\n\n/**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\nfunction toSetString(aStr) {\n if (isProtoString(aStr)) {\n return '$' + aStr;\n }\n\n return aStr;\n}\nexports.toSetString = supportsNullProto ? identity : toSetString;\n\nfunction fromSetString(aStr) {\n if (isProtoString(aStr)) {\n return aStr.slice(1);\n }\n\n return aStr;\n}\nexports.fromSetString = supportsNullProto ? identity : fromSetString;\n\nfunction isProtoString(s) {\n if (!s) {\n return false;\n }\n\n var length = s.length;\n\n if (length < 9 /* \"__proto__\".length */) {\n return false;\n }\n\n if (s.charCodeAt(length - 1) !== 95 /* '_' */ ||\n s.charCodeAt(length - 2) !== 95 /* '_' */ ||\n s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n s.charCodeAt(length - 8) !== 95 /* '_' */ ||\n s.charCodeAt(length - 9) !== 95 /* '_' */) {\n return false;\n }\n\n for (var i = length - 10; i >= 0; i--) {\n if (s.charCodeAt(i) !== 36 /* '$' */) {\n return false;\n }\n }\n\n return true;\n}\n\n/**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\nfunction compareByOriginalPositions(mappingA, mappingB, onlyCompareOriginal) {\n var cmp = mappingA.source - mappingB.source;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0 || onlyCompareOriginal) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n return mappingA.name - mappingB.name;\n}\nexports.compareByOriginalPositions = compareByOriginalPositions;\n\n/**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\nfunction compareByGeneratedPositionsDeflated(mappingA, mappingB, onlyCompareGenerated) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0 || onlyCompareGenerated) {\n return cmp;\n }\n\n cmp = mappingA.source - mappingB.source;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return mappingA.name - mappingB.name;\n}\nexports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\nfunction strcmp(aStr1, aStr2) {\n if (aStr1 === aStr2) {\n return 0;\n }\n\n if (aStr1 > aStr2) {\n return 1;\n }\n\n return -1;\n}\n\n/**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\nfunction compareByGeneratedPositionsInflated(mappingA, mappingB) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n}\nexports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/util.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n// It turns out that some (most?) JavaScript engines don't self-host\n// `Array.prototype.sort`. This makes sense because C++ will likely remain\n// faster than JS when doing raw CPU-intensive sorting. However, when using a\n// custom comparator function, calling back and forth between the VM's C++ and\n// JIT'd JS is rather slow *and* loses JIT type information, resulting in\n// worse generated code for the comparator function than would be optimal. In\n// fact, when sorting with a comparator, these costs outweigh the benefits of\n// sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n// a ~3500ms mean speed-up in `bench/bench.html`.\n\n/**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n * The array.\n * @param {Number} x\n * The index of the first item.\n * @param {Number} y\n * The index of the second item.\n */\nfunction swap(ary, x, y) {\n var temp = ary[x];\n ary[x] = ary[y];\n ary[y] = temp;\n}\n\n/**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n * The lower bound on the range.\n * @param {Number} high\n * The upper bound on the range.\n */\nfunction randomIntInRange(low, high) {\n return Math.round(low + (Math.random() * (high - low)));\n}\n\n/**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n * @param {Number} p\n * Start index of the array\n * @param {Number} r\n * End index of the array\n */\nfunction doQuickSort(ary, comparator, p, r) {\n // If our lower bound is less than our upper bound, we (1) partition the\n // array into two pieces and (2) recurse on each half. If it is not, this is\n // the empty array and our base case.\n\n if (p < r) {\n // (1) Partitioning.\n //\n // The partitioning chooses a pivot between `p` and `r` and moves all\n // elements that are less than or equal to the pivot to the before it, and\n // all the elements that are greater than it after it. The effect is that\n // once partition is done, the pivot is in the exact place it will be when\n // the array is put in sorted order, and it will not need to be moved\n // again. This runs in O(n) time.\n\n // Always choose a random pivot so that an input array which is reverse\n // sorted does not cause O(n^2) running time.\n var pivotIndex = randomIntInRange(p, r);\n var i = p - 1;\n\n swap(ary, pivotIndex, r);\n var pivot = ary[r];\n\n // Immediately after `j` is incremented in this loop, the following hold\n // true:\n //\n // * Every element in `ary[p .. i]` is less than or equal to the pivot.\n //\n // * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n for (var j = p; j < r; j++) {\n if (comparator(ary[j], pivot) <= 0) {\n i += 1;\n swap(ary, i, j);\n }\n }\n\n swap(ary, i + 1, j);\n var q = i + 1;\n\n // (2) Recurse on each half.\n\n doQuickSort(ary, comparator, p, q - 1);\n doQuickSort(ary, comparator, q + 1, r);\n }\n}\n\n/**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n */\nexports.quickSort = function (ary, comparator) {\n doQuickSort(ary, comparator, 0, ary.length - 1);\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/quick-sort.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nexports.GREATEST_LOWER_BOUND = 1;\nexports.LEAST_UPPER_BOUND = 2;\n\n/**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n */\nfunction recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {\n // This function terminates when one of the following is true:\n //\n // 1. We find the exact element we are looking for.\n //\n // 2. We did not find the exact element, but we can return the index of\n // the next-closest element.\n //\n // 3. We did not find the exact element, and there is no next-closest\n // element than the one we are searching for, so we return -1.\n var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n var cmp = aCompare(aNeedle, aHaystack[mid], true);\n if (cmp === 0) {\n // Found the element we are looking for.\n return mid;\n }\n else if (cmp > 0) {\n // Our needle is greater than aHaystack[mid].\n if (aHigh - mid > 1) {\n // The element is in the upper half.\n return recursiveSearch(mid, aHigh, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // The exact needle element was not found in this haystack. Determine if\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return aHigh < aHaystack.length ? aHigh : -1;\n } else {\n return mid;\n }\n }\n else {\n // Our needle is less than aHaystack[mid].\n if (mid - aLow > 1) {\n // The element is in the lower half.\n return recursiveSearch(aLow, mid, aNeedle, aHaystack, aCompare, aBias);\n }\n\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return mid;\n } else {\n return aLow < 0 ? -1 : aLow;\n }\n }\n}\n\n/**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n * array and returns -1, 0, or 1 depending on whether the needle is less\n * than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\nexports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n if (aHaystack.length === 0) {\n return -1;\n }\n\n var index = recursiveSearch(-1, aHaystack.length, aNeedle, aHaystack,\n aCompare, aBias || exports.GREATEST_LOWER_BOUND);\n if (index < 0) {\n return -1;\n }\n\n // We have found either the exact element, or the next-closest element than\n // the one we are searching for. However, there may be more than one such\n // element. Make sure we always return the smallest of these.\n while (index - 1 >= 0) {\n if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n break;\n }\n --index;\n }\n\n return index;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/binary-search.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar SourceMapGenerator = __webpack_require__(/*! ./source-map-generator */ \"./node_modules/snapdragon/node_modules/source-map/lib/source-map-generator.js\").SourceMapGenerator;\nvar util = __webpack_require__(/*! ./util */ \"./node_modules/snapdragon/node_modules/source-map/lib/util.js\");\n\n// Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n// operating systems these days (capturing the result).\nvar REGEX_NEWLINE = /(\\r?\\n)/;\n\n// Newline character code for charCodeAt() comparisons\nvar NEWLINE_CODE = 10;\n\n// Private symbol for identifying `SourceNode`s when multiple versions of\n// the source-map library are loaded. This MUST NOT CHANGE across\n// versions!\nvar isSourceNode = \"$$$isSourceNode$$$\";\n\n/**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n * generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\nfunction SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n this.children = [];\n this.sourceContents = {};\n this.line = aLine == null ? null : aLine;\n this.column = aColumn == null ? null : aColumn;\n this.source = aSource == null ? null : aSource;\n this.name = aName == null ? null : aName;\n this[isSourceNode] = true;\n if (aChunks != null) this.add(aChunks);\n}\n\n/**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n * SourceMapConsumer should be relative to.\n */\nSourceNode.fromStringWithSourceMap =\n function SourceNode_fromStringWithSourceMap(aGeneratedCode, aSourceMapConsumer, aRelativePath) {\n // The SourceNode we want to fill with the generated code\n // and the SourceMap\n var node = new SourceNode();\n\n // All even indices of this array are one line of the generated code,\n // while all odd indices are the newlines between two adjacent lines\n // (since `REGEX_NEWLINE` captures its match).\n // Processed fragments are accessed by calling `shiftNextLine`.\n var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n var remainingLinesIndex = 0;\n var shiftNextLine = function() {\n var lineContents = getNextLine();\n // The last line of a file might not have a newline.\n var newLine = getNextLine() || \"\";\n return lineContents + newLine;\n\n function getNextLine() {\n return remainingLinesIndex < remainingLines.length ?\n remainingLines[remainingLinesIndex++] : undefined;\n }\n };\n\n // We need to remember the position of \"remainingLines\"\n var lastGeneratedLine = 1, lastGeneratedColumn = 0;\n\n // The generate SourceNodes we need a code range.\n // To extract it current and last mapping is used.\n // Here we store the last mapping.\n var lastMapping = null;\n\n aSourceMapConsumer.eachMapping(function (mapping) {\n if (lastMapping !== null) {\n // We add the code from \"lastMapping\" to \"mapping\":\n // First check if there is a new line in between.\n if (lastGeneratedLine < mapping.generatedLine) {\n // Associate first line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n lastGeneratedLine++;\n lastGeneratedColumn = 0;\n // The remaining code is added without mapping\n } else {\n // There is no new line in between.\n // Associate the code between \"lastGeneratedColumn\" and\n // \"mapping.generatedColumn\" with \"lastMapping\"\n var nextLine = remainingLines[remainingLinesIndex];\n var code = nextLine.substr(0, mapping.generatedColumn -\n lastGeneratedColumn);\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn -\n lastGeneratedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n addMappingWithCode(lastMapping, code);\n // No more remaining code, continue\n lastMapping = mapping;\n return;\n }\n }\n // We add the generated code until the first mapping\n // to the SourceNode without any mapping.\n // Each line is added as separate string.\n while (lastGeneratedLine < mapping.generatedLine) {\n node.add(shiftNextLine());\n lastGeneratedLine++;\n }\n if (lastGeneratedColumn < mapping.generatedColumn) {\n var nextLine = remainingLines[remainingLinesIndex];\n node.add(nextLine.substr(0, mapping.generatedColumn));\n remainingLines[remainingLinesIndex] = nextLine.substr(mapping.generatedColumn);\n lastGeneratedColumn = mapping.generatedColumn;\n }\n lastMapping = mapping;\n }, this);\n // We have processed all mappings.\n if (remainingLinesIndex < remainingLines.length) {\n if (lastMapping) {\n // Associate the remaining code in the current line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n }\n // and add the remaining lines without any mapping\n node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n }\n\n // Copy sourcesContent into SourceNode\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aRelativePath != null) {\n sourceFile = util.join(aRelativePath, sourceFile);\n }\n node.setSourceContent(sourceFile, content);\n }\n });\n\n return node;\n\n function addMappingWithCode(mapping, code) {\n if (mapping === null || mapping.source === undefined) {\n node.add(code);\n } else {\n var source = aRelativePath\n ? util.join(aRelativePath, mapping.source)\n : mapping.source;\n node.add(new SourceNode(mapping.originalLine,\n mapping.originalColumn,\n source,\n code,\n mapping.name));\n }\n }\n };\n\n/**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.add = function SourceNode_add(aChunk) {\n if (Array.isArray(aChunk)) {\n aChunk.forEach(function (chunk) {\n this.add(chunk);\n }, this);\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n if (aChunk) {\n this.children.push(aChunk);\n }\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\nSourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n if (Array.isArray(aChunk)) {\n for (var i = aChunk.length-1; i >= 0; i--) {\n this.prepend(aChunk[i]);\n }\n }\n else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n this.children.unshift(aChunk);\n }\n else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" + aChunk\n );\n }\n return this;\n};\n\n/**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walk = function SourceNode_walk(aFn) {\n var chunk;\n for (var i = 0, len = this.children.length; i < len; i++) {\n chunk = this.children[i];\n if (chunk[isSourceNode]) {\n chunk.walk(aFn);\n }\n else {\n if (chunk !== '') {\n aFn(chunk, { source: this.source,\n line: this.line,\n column: this.column,\n name: this.name });\n }\n }\n }\n};\n\n/**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\nSourceNode.prototype.join = function SourceNode_join(aSep) {\n var newChildren;\n var i;\n var len = this.children.length;\n if (len > 0) {\n newChildren = [];\n for (i = 0; i < len-1; i++) {\n newChildren.push(this.children[i]);\n newChildren.push(aSep);\n }\n newChildren.push(this.children[i]);\n this.children = newChildren;\n }\n return this;\n};\n\n/**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\nSourceNode.prototype.replaceRight = function SourceNode_replaceRight(aPattern, aReplacement) {\n var lastChild = this.children[this.children.length - 1];\n if (lastChild[isSourceNode]) {\n lastChild.replaceRight(aPattern, aReplacement);\n }\n else if (typeof lastChild === 'string') {\n this.children[this.children.length - 1] = lastChild.replace(aPattern, aReplacement);\n }\n else {\n this.children.push(''.replace(aPattern, aReplacement));\n }\n return this;\n};\n\n/**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\nSourceNode.prototype.setSourceContent =\n function SourceNode_setSourceContent(aSourceFile, aSourceContent) {\n this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n };\n\n/**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\nSourceNode.prototype.walkSourceContents =\n function SourceNode_walkSourceContents(aFn) {\n for (var i = 0, len = this.children.length; i < len; i++) {\n if (this.children[i][isSourceNode]) {\n this.children[i].walkSourceContents(aFn);\n }\n }\n\n var sources = Object.keys(this.sourceContents);\n for (var i = 0, len = sources.length; i < len; i++) {\n aFn(util.fromSetString(sources[i]), this.sourceContents[sources[i]]);\n }\n };\n\n/**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\nSourceNode.prototype.toString = function SourceNode_toString() {\n var str = \"\";\n this.walk(function (chunk) {\n str += chunk;\n });\n return str;\n};\n\n/**\n * Returns the string representation of this source node along with a source\n * map.\n */\nSourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(aArgs) {\n var generated = {\n code: \"\",\n line: 1,\n column: 0\n };\n var map = new SourceMapGenerator(aArgs);\n var sourceMappingActive = false;\n var lastOriginalSource = null;\n var lastOriginalLine = null;\n var lastOriginalColumn = null;\n var lastOriginalName = null;\n this.walk(function (chunk, original) {\n generated.code += chunk;\n if (original.source !== null\n && original.line !== null\n && original.column !== null) {\n if(lastOriginalSource !== original.source\n || lastOriginalLine !== original.line\n || lastOriginalColumn !== original.column\n || lastOriginalName !== original.name) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n lastOriginalSource = original.source;\n lastOriginalLine = original.line;\n lastOriginalColumn = original.column;\n lastOriginalName = original.name;\n sourceMappingActive = true;\n } else if (sourceMappingActive) {\n map.addMapping({\n generated: {\n line: generated.line,\n column: generated.column\n }\n });\n lastOriginalSource = null;\n sourceMappingActive = false;\n }\n for (var idx = 0, length = chunk.length; idx < length; idx++) {\n if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n generated.line++;\n generated.column = 0;\n // Mappings end at eol\n if (idx + 1 === length) {\n lastOriginalSource = null;\n sourceMappingActive = false;\n } else if (sourceMappingActive) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n } else {\n generated.column++;\n }\n }\n });\n this.walkSourceContents(function (sourceFile, sourceContent) {\n map.setSourceContent(sourceFile, sourceContent);\n });\n\n return { code: generated.code, map: map };\n};\n\nexports.SourceNode = SourceNode;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/source-node.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar base64VLQ = __webpack_require__(/*! ./base64-vlq */ \"./node_modules/snapdragon/node_modules/source-map/lib/base64-vlq.js\");\nvar util = __webpack_require__(/*! ./util */ \"./node_modules/snapdragon/node_modules/source-map/lib/util.js\");\nvar ArraySet = __webpack_require__(/*! ./array-set */ \"./node_modules/snapdragon/node_modules/source-map/lib/array-set.js\").ArraySet;\nvar MappingList = __webpack_require__(/*! ./mapping-list */ \"./node_modules/snapdragon/node_modules/source-map/lib/mapping-list.js\").MappingList;\n\n/**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n * - file: The filename of the generated source.\n * - sourceRoot: A root for all relative URLs in this source map.\n */\nfunction SourceMapGenerator(aArgs) {\n if (!aArgs) {\n aArgs = {};\n }\n this._file = util.getArg(aArgs, 'file', null);\n this._sourceRoot = util.getArg(aArgs, 'sourceRoot', null);\n this._skipValidation = util.getArg(aArgs, 'skipValidation', false);\n this._sources = new ArraySet();\n this._names = new ArraySet();\n this._mappings = new MappingList();\n this._sourcesContents = null;\n}\n\nSourceMapGenerator.prototype._version = 3;\n\n/**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\nSourceMapGenerator.fromSourceMap =\n function SourceMapGenerator_fromSourceMap(aSourceMapConsumer) {\n var sourceRoot = aSourceMapConsumer.sourceRoot;\n var generator = new SourceMapGenerator({\n file: aSourceMapConsumer.file,\n sourceRoot: sourceRoot\n });\n aSourceMapConsumer.eachMapping(function (mapping) {\n var newMapping = {\n generated: {\n line: mapping.generatedLine,\n column: mapping.generatedColumn\n }\n };\n\n if (mapping.source != null) {\n newMapping.source = mapping.source;\n if (sourceRoot != null) {\n newMapping.source = util.relative(sourceRoot, newMapping.source);\n }\n\n newMapping.original = {\n line: mapping.originalLine,\n column: mapping.originalColumn\n };\n\n if (mapping.name != null) {\n newMapping.name = mapping.name;\n }\n }\n\n generator.addMapping(newMapping);\n });\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n generator.setSourceContent(sourceFile, content);\n }\n });\n return generator;\n };\n\n/**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n * - generated: An object with the generated line and column positions.\n * - original: An object with the original line and column positions.\n * - source: The original source file (relative to the sourceRoot).\n * - name: An optional original token name for this mapping.\n */\nSourceMapGenerator.prototype.addMapping =\n function SourceMapGenerator_addMapping(aArgs) {\n var generated = util.getArg(aArgs, 'generated');\n var original = util.getArg(aArgs, 'original', null);\n var source = util.getArg(aArgs, 'source', null);\n var name = util.getArg(aArgs, 'name', null);\n\n if (!this._skipValidation) {\n this._validateMapping(generated, original, source, name);\n }\n\n if (source != null) {\n source = String(source);\n if (!this._sources.has(source)) {\n this._sources.add(source);\n }\n }\n\n if (name != null) {\n name = String(name);\n if (!this._names.has(name)) {\n this._names.add(name);\n }\n }\n\n this._mappings.add({\n generatedLine: generated.line,\n generatedColumn: generated.column,\n originalLine: original != null && original.line,\n originalColumn: original != null && original.column,\n source: source,\n name: name\n });\n };\n\n/**\n * Set the source content for a source file.\n */\nSourceMapGenerator.prototype.setSourceContent =\n function SourceMapGenerator_setSourceContent(aSourceFile, aSourceContent) {\n var source = aSourceFile;\n if (this._sourceRoot != null) {\n source = util.relative(this._sourceRoot, source);\n }\n\n if (aSourceContent != null) {\n // Add the source content to the _sourcesContents map.\n // Create a new _sourcesContents map if the property is null.\n if (!this._sourcesContents) {\n this._sourcesContents = Object.create(null);\n }\n this._sourcesContents[util.toSetString(source)] = aSourceContent;\n } else if (this._sourcesContents) {\n // Remove the source file from the _sourcesContents map.\n // If the _sourcesContents map is empty, set the property to null.\n delete this._sourcesContents[util.toSetString(source)];\n if (Object.keys(this._sourcesContents).length === 0) {\n this._sourcesContents = null;\n }\n }\n };\n\n/**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n * If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n * to be applied. If relative, it is relative to the SourceMapConsumer.\n * This parameter is needed when the two source maps aren't in the same\n * directory, and the source map to be applied contains relative source\n * paths. If so, those relative source paths need to be rewritten\n * relative to the SourceMapGenerator.\n */\nSourceMapGenerator.prototype.applySourceMap =\n function SourceMapGenerator_applySourceMap(aSourceMapConsumer, aSourceFile, aSourceMapPath) {\n var sourceFile = aSourceFile;\n // If aSourceFile is omitted, we will use the file property of the SourceMap\n if (aSourceFile == null) {\n if (aSourceMapConsumer.file == null) {\n throw new Error(\n 'SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, ' +\n 'or the source map\\'s \"file\" property. Both were omitted.'\n );\n }\n sourceFile = aSourceMapConsumer.file;\n }\n var sourceRoot = this._sourceRoot;\n // Make \"sourceFile\" relative if an absolute Url is passed.\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n // Applying the SourceMap can add and remove items from the sources and\n // the names array.\n var newSources = new ArraySet();\n var newNames = new ArraySet();\n\n // Find mappings for the \"sourceFile\"\n this._mappings.unsortedForEach(function (mapping) {\n if (mapping.source === sourceFile && mapping.originalLine != null) {\n // Check if it can be mapped by the source map, then update the mapping.\n var original = aSourceMapConsumer.originalPositionFor({\n line: mapping.originalLine,\n column: mapping.originalColumn\n });\n if (original.source != null) {\n // Copy mapping\n mapping.source = original.source;\n if (aSourceMapPath != null) {\n mapping.source = util.join(aSourceMapPath, mapping.source)\n }\n if (sourceRoot != null) {\n mapping.source = util.relative(sourceRoot, mapping.source);\n }\n mapping.originalLine = original.line;\n mapping.originalColumn = original.column;\n if (original.name != null) {\n mapping.name = original.name;\n }\n }\n }\n\n var source = mapping.source;\n if (source != null && !newSources.has(source)) {\n newSources.add(source);\n }\n\n var name = mapping.name;\n if (name != null && !newNames.has(name)) {\n newNames.add(name);\n }\n\n }, this);\n this._sources = newSources;\n this._names = newNames;\n\n // Copy sourcesContents of applied map.\n aSourceMapConsumer.sources.forEach(function (sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aSourceMapPath != null) {\n sourceFile = util.join(aSourceMapPath, sourceFile);\n }\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n this.setSourceContent(sourceFile, content);\n }\n }, this);\n };\n\n/**\n * A mapping can have one of the three levels of data:\n *\n * 1. Just the generated position.\n * 2. The Generated position, original position, and original source.\n * 3. Generated and original position, original source, as well as a name\n * token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\nSourceMapGenerator.prototype._validateMapping =\n function SourceMapGenerator_validateMapping(aGenerated, aOriginal, aSource,\n aName) {\n // When aOriginal is truthy but has empty values for .line and .column,\n // it is most likely a programmer error. In this case we throw a very\n // specific error message to try to guide them the right way.\n // For example: https://github.com/Polymer/polymer-bundler/pull/519\n if (aOriginal && typeof aOriginal.line !== 'number' && typeof aOriginal.column !== 'number') {\n throw new Error(\n 'original.line and original.column are not numbers -- you probably meant to omit ' +\n 'the original mapping entirely and only map the generated position. If so, pass ' +\n 'null for the original mapping instead of an object with empty or null values.'\n );\n }\n\n if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aGenerated.line > 0 && aGenerated.column >= 0\n && !aOriginal && !aSource && !aName) {\n // Case 1.\n return;\n }\n else if (aGenerated && 'line' in aGenerated && 'column' in aGenerated\n && aOriginal && 'line' in aOriginal && 'column' in aOriginal\n && aGenerated.line > 0 && aGenerated.column >= 0\n && aOriginal.line > 0 && aOriginal.column >= 0\n && aSource) {\n // Cases 2 and 3.\n return;\n }\n else {\n throw new Error('Invalid mapping: ' + JSON.stringify({\n generated: aGenerated,\n source: aSource,\n original: aOriginal,\n name: aName\n }));\n }\n };\n\n/**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\nSourceMapGenerator.prototype._serializeMappings =\n function SourceMapGenerator_serializeMappings() {\n var previousGeneratedColumn = 0;\n var previousGeneratedLine = 1;\n var previousOriginalColumn = 0;\n var previousOriginalLine = 0;\n var previousName = 0;\n var previousSource = 0;\n var result = '';\n var next;\n var mapping;\n var nameIdx;\n var sourceIdx;\n\n var mappings = this._mappings.toArray();\n for (var i = 0, len = mappings.length; i < len; i++) {\n mapping = mappings[i];\n next = ''\n\n if (mapping.generatedLine !== previousGeneratedLine) {\n previousGeneratedColumn = 0;\n while (mapping.generatedLine !== previousGeneratedLine) {\n next += ';';\n previousGeneratedLine++;\n }\n }\n else {\n if (i > 0) {\n if (!util.compareByGeneratedPositionsInflated(mapping, mappings[i - 1])) {\n continue;\n }\n next += ',';\n }\n }\n\n next += base64VLQ.encode(mapping.generatedColumn\n - previousGeneratedColumn);\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (mapping.source != null) {\n sourceIdx = this._sources.indexOf(mapping.source);\n next += base64VLQ.encode(sourceIdx - previousSource);\n previousSource = sourceIdx;\n\n // lines are stored 0-based in SourceMap spec version 3\n next += base64VLQ.encode(mapping.originalLine - 1\n - previousOriginalLine);\n previousOriginalLine = mapping.originalLine - 1;\n\n next += base64VLQ.encode(mapping.originalColumn\n - previousOriginalColumn);\n previousOriginalColumn = mapping.originalColumn;\n\n if (mapping.name != null) {\n nameIdx = this._names.indexOf(mapping.name);\n next += base64VLQ.encode(nameIdx - previousName);\n previousName = nameIdx;\n }\n }\n\n result += next;\n }\n\n return result;\n };\n\nSourceMapGenerator.prototype._generateSourcesContent =\n function SourceMapGenerator_generateSourcesContent(aSources, aSourceRoot) {\n return aSources.map(function (source) {\n if (!this._sourcesContents) {\n return null;\n }\n if (aSourceRoot != null) {\n source = util.relative(aSourceRoot, source);\n }\n var key = util.toSetString(source);\n return Object.prototype.hasOwnProperty.call(this._sourcesContents, key)\n ? this._sourcesContents[key]\n : null;\n }, this);\n };\n\n/**\n * Externalize the source map.\n */\nSourceMapGenerator.prototype.toJSON =\n function SourceMapGenerator_toJSON() {\n var map = {\n version: this._version,\n sources: this._sources.toArray(),\n names: this._names.toArray(),\n mappings: this._serializeMappings()\n };\n if (this._file != null) {\n map.file = this._file;\n }\n if (this._sourceRoot != null) {\n map.sourceRoot = this._sourceRoot;\n }\n if (this._sourcesContents) {\n map.sourcesContent = this._generateSourcesContent(map.sources, map.sourceRoot);\n }\n\n return map;\n };\n\n/**\n * Render the source map being generated to a string.\n */\nSourceMapGenerator.prototype.toString =\n function SourceMapGenerator_toString() {\n return JSON.stringify(this.toJSON());\n };\n\nexports.SourceMapGenerator = SourceMapGenerator;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/source-map-generator.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar intToCharMap = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'.split('');\n\n/**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\nexports.encode = function (number) {\n if (0 <= number && number < intToCharMap.length) {\n return intToCharMap[number];\n }\n throw new TypeError(\"Must be between 0 and 63: \" + number);\n};\n\n/**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\nexports.decode = function (charCode) {\n var bigA = 65; // 'A'\n var bigZ = 90; // 'Z'\n\n var littleA = 97; // 'a'\n var littleZ = 122; // 'z'\n\n var zero = 48; // '0'\n var nine = 57; // '9'\n\n var plus = 43; // '+'\n var slash = 47; // '/'\n\n var littleOffset = 26;\n var numberOffset = 52;\n\n // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n if (bigA <= charCode && charCode <= bigZ) {\n return (charCode - bigA);\n }\n\n // 26 - 51: abcdefghijklmnopqrstuvwxyz\n if (littleA <= charCode && charCode <= littleZ) {\n return (charCode - littleA + littleOffset);\n }\n\n // 52 - 61: 0123456789\n if (zero <= charCode && charCode <= nine) {\n return (charCode - zero + numberOffset);\n }\n\n // 62: +\n if (charCode == plus) {\n return 62;\n }\n\n // 63: /\n if (charCode == slash) {\n return 63;\n }\n\n // Invalid base64 digit.\n return -1;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/base64.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = __webpack_require__(/*! ./util */ \"./node_modules/snapdragon/node_modules/source-map/lib/util.js\");\nvar binarySearch = __webpack_require__(/*! ./binary-search */ \"./node_modules/snapdragon/node_modules/source-map/lib/binary-search.js\");\nvar ArraySet = __webpack_require__(/*! ./array-set */ \"./node_modules/snapdragon/node_modules/source-map/lib/array-set.js\").ArraySet;\nvar base64VLQ = __webpack_require__(/*! ./base64-vlq */ \"./node_modules/snapdragon/node_modules/source-map/lib/base64-vlq.js\");\nvar quickSort = __webpack_require__(/*! ./quick-sort */ \"./node_modules/snapdragon/node_modules/source-map/lib/quick-sort.js\").quickSort;\n\nfunction SourceMapConsumer(aSourceMap) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = JSON.parse(aSourceMap.replace(/^\\)\\]\\}'/, ''));\n }\n\n return sourceMap.sections != null\n ? new IndexedSourceMapConsumer(sourceMap)\n : new BasicSourceMapConsumer(sourceMap);\n}\n\nSourceMapConsumer.fromSourceMap = function(aSourceMap) {\n return BasicSourceMapConsumer.fromSourceMap(aSourceMap);\n}\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nSourceMapConsumer.prototype._version = 3;\n\n// `__generatedMappings` and `__originalMappings` are arrays that hold the\n// parsed mapping coordinates from the source map's \"mappings\" attribute. They\n// are lazily instantiated, accessed via the `_generatedMappings` and\n// `_originalMappings` getters respectively, and we only parse the mappings\n// and create these arrays once queried for a source location. We jump through\n// these hoops because there can be many thousands of mappings, and parsing\n// them is expensive, so we only want to do it if we must.\n//\n// Each object in the arrays is of the form:\n//\n// {\n// generatedLine: The line number in the generated code,\n// generatedColumn: The column number in the generated code,\n// source: The path to the original source file that generated this\n// chunk of code,\n// originalLine: The line number in the original source that\n// corresponds to this chunk of generated code,\n// originalColumn: The column number in the original source that\n// corresponds to this chunk of generated code,\n// name: The name of the original symbol which generated this chunk of\n// code.\n// }\n//\n// All properties except for `generatedLine` and `generatedColumn` can be\n// `null`.\n//\n// `_generatedMappings` is ordered by the generated positions.\n//\n// `_originalMappings` is ordered by the original positions.\n\nSourceMapConsumer.prototype.__generatedMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_generatedMappings', {\n get: function () {\n if (!this.__generatedMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__generatedMappings;\n }\n});\n\nSourceMapConsumer.prototype.__originalMappings = null;\nObject.defineProperty(SourceMapConsumer.prototype, '_originalMappings', {\n get: function () {\n if (!this.__originalMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__originalMappings;\n }\n});\n\nSourceMapConsumer.prototype._charIsMappingSeparator =\n function SourceMapConsumer_charIsMappingSeparator(aStr, index) {\n var c = aStr.charAt(index);\n return c === \";\" || c === \",\";\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n throw new Error(\"Subclasses must implement _parseMappings\");\n };\n\nSourceMapConsumer.GENERATED_ORDER = 1;\nSourceMapConsumer.ORIGINAL_ORDER = 2;\n\nSourceMapConsumer.GREATEST_LOWER_BOUND = 1;\nSourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n/**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n * The function that is called with each mapping.\n * @param Object aContext\n * Optional. If specified, this object will be the value of `this` every\n * time that `aCallback` is called.\n * @param aOrder\n * Either `SourceMapConsumer.GENERATED_ORDER` or\n * `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n * iterate over the mappings sorted by the generated file's line/column\n * order or the original's source/line/column order, respectively. Defaults to\n * `SourceMapConsumer.GENERATED_ORDER`.\n */\nSourceMapConsumer.prototype.eachMapping =\n function SourceMapConsumer_eachMapping(aCallback, aContext, aOrder) {\n var context = aContext || null;\n var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n var mappings;\n switch (order) {\n case SourceMapConsumer.GENERATED_ORDER:\n mappings = this._generatedMappings;\n break;\n case SourceMapConsumer.ORIGINAL_ORDER:\n mappings = this._originalMappings;\n break;\n default:\n throw new Error(\"Unknown order of iteration.\");\n }\n\n var sourceRoot = this.sourceRoot;\n mappings.map(function (mapping) {\n var source = mapping.source === null ? null : this._sources.at(mapping.source);\n if (source != null && sourceRoot != null) {\n source = util.join(sourceRoot, source);\n }\n return {\n source: source,\n generatedLine: mapping.generatedLine,\n generatedColumn: mapping.generatedColumn,\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: mapping.name === null ? null : this._names.at(mapping.name)\n };\n }, this).forEach(aCallback, context);\n };\n\n/**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source.\n * - column: Optional. the column number in the original source.\n *\n * and an array of objects is returned, each with the following properties:\n *\n * - line: The line number in the generated source, or null.\n * - column: The column number in the generated source, or null.\n */\nSourceMapConsumer.prototype.allGeneratedPositionsFor =\n function SourceMapConsumer_allGeneratedPositionsFor(aArgs) {\n var line = util.getArg(aArgs, 'line');\n\n // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n // returns the index of the closest mapping less than the needle. By\n // setting needle.originalColumn to 0, we thus find the last mapping for\n // the given line, provided such a mapping exists.\n var needle = {\n source: util.getArg(aArgs, 'source'),\n originalLine: line,\n originalColumn: util.getArg(aArgs, 'column', 0)\n };\n\n if (this.sourceRoot != null) {\n needle.source = util.relative(this.sourceRoot, needle.source);\n }\n if (!this._sources.has(needle.source)) {\n return [];\n }\n needle.source = this._sources.indexOf(needle.source);\n\n var mappings = [];\n\n var index = this._findMapping(needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n binarySearch.LEAST_UPPER_BOUND);\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (aArgs.column === undefined) {\n var originalLine = mapping.originalLine;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we found. Since\n // mappings are sorted, this is guaranteed to find all mappings for\n // the line we found.\n while (mapping && mapping.originalLine === originalLine) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n } else {\n var originalColumn = mapping.originalColumn;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we were searching for.\n // Since mappings are sorted, this is guaranteed to find all mappings for\n // the line we are searching for.\n while (mapping &&\n mapping.originalLine === line &&\n mapping.originalColumn == originalColumn) {\n mappings.push({\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n });\n\n mapping = this._originalMappings[++index];\n }\n }\n }\n\n return mappings;\n };\n\nexports.SourceMapConsumer = SourceMapConsumer;\n\n/**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The only parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - sources: An array of URLs to the original source files.\n * - names: An array of identifiers which can be referrenced by individual mappings.\n * - sourceRoot: Optional. The URL root from which all sources are relative.\n * - sourcesContent: Optional. An array of contents of the original source files.\n * - mappings: A string of base64 VLQs which contain the actual mappings.\n * - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n * {\n * version : 3,\n * file: \"out.js\",\n * sourceRoot : \"\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AA,AB;;ABCDE;\"\n * }\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\nfunction BasicSourceMapConsumer(aSourceMap) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = JSON.parse(aSourceMap.replace(/^\\)\\]\\}'/, ''));\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sources = util.getArg(sourceMap, 'sources');\n // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n // requires the array) to play nice here.\n var names = util.getArg(sourceMap, 'names', []);\n var sourceRoot = util.getArg(sourceMap, 'sourceRoot', null);\n var sourcesContent = util.getArg(sourceMap, 'sourcesContent', null);\n var mappings = util.getArg(sourceMap, 'mappings');\n var file = util.getArg(sourceMap, 'file', null);\n\n // Once again, Sass deviates from the spec and supplies the version as a\n // string rather than a number, so we use loose equality checking here.\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n sources = sources\n .map(String)\n // Some source maps produce relative source paths like \"./foo.js\" instead of\n // \"foo.js\". Normalize these first so that future comparisons will succeed.\n // See bugzil.la/1090768.\n .map(util.normalize)\n // Always ensure that absolute sources are internally stored relative to\n // the source root, if the source root is absolute. Not doing this would\n // be particularly problematic when the source root is a prefix of the\n // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n .map(function (source) {\n return sourceRoot && util.isAbsolute(sourceRoot) && util.isAbsolute(source)\n ? util.relative(sourceRoot, source)\n : source;\n });\n\n // Pass `true` below to allow duplicate names and sources. While source maps\n // are intended to be compressed and deduplicated, the TypeScript compiler\n // sometimes generates source maps with duplicates in them. See Github issue\n // #72 and bugzil.la/889492.\n this._names = ArraySet.fromArray(names.map(String), true);\n this._sources = ArraySet.fromArray(sources, true);\n\n this.sourceRoot = sourceRoot;\n this.sourcesContent = sourcesContent;\n this._mappings = mappings;\n this.file = file;\n}\n\nBasicSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nBasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n/**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n * The source map that will be consumed.\n * @returns BasicSourceMapConsumer\n */\nBasicSourceMapConsumer.fromSourceMap =\n function SourceMapConsumer_fromSourceMap(aSourceMap) {\n var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n var names = smc._names = ArraySet.fromArray(aSourceMap._names.toArray(), true);\n var sources = smc._sources = ArraySet.fromArray(aSourceMap._sources.toArray(), true);\n smc.sourceRoot = aSourceMap._sourceRoot;\n smc.sourcesContent = aSourceMap._generateSourcesContent(smc._sources.toArray(),\n smc.sourceRoot);\n smc.file = aSourceMap._file;\n\n // Because we are modifying the entries (by converting string sources and\n // names to indices into the sources and names ArraySets), we have to make\n // a copy of the entry or else bad things happen. Shared mutable state\n // strikes again! See github issue #191.\n\n var generatedMappings = aSourceMap._mappings.toArray().slice();\n var destGeneratedMappings = smc.__generatedMappings = [];\n var destOriginalMappings = smc.__originalMappings = [];\n\n for (var i = 0, length = generatedMappings.length; i < length; i++) {\n var srcMapping = generatedMappings[i];\n var destMapping = new Mapping;\n destMapping.generatedLine = srcMapping.generatedLine;\n destMapping.generatedColumn = srcMapping.generatedColumn;\n\n if (srcMapping.source) {\n destMapping.source = sources.indexOf(srcMapping.source);\n destMapping.originalLine = srcMapping.originalLine;\n destMapping.originalColumn = srcMapping.originalColumn;\n\n if (srcMapping.name) {\n destMapping.name = names.indexOf(srcMapping.name);\n }\n\n destOriginalMappings.push(destMapping);\n }\n\n destGeneratedMappings.push(destMapping);\n }\n\n quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n return smc;\n };\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nBasicSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(BasicSourceMapConsumer.prototype, 'sources', {\n get: function () {\n return this._sources.toArray().map(function (s) {\n return this.sourceRoot != null ? util.join(this.sourceRoot, s) : s;\n }, this);\n }\n});\n\n/**\n * Provide the JIT with a nice shape / hidden class.\n */\nfunction Mapping() {\n this.generatedLine = 0;\n this.generatedColumn = 0;\n this.source = null;\n this.originalLine = null;\n this.originalColumn = null;\n this.name = null;\n}\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nBasicSourceMapConsumer.prototype._parseMappings =\n function SourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n var generatedLine = 1;\n var previousGeneratedColumn = 0;\n var previousOriginalLine = 0;\n var previousOriginalColumn = 0;\n var previousSource = 0;\n var previousName = 0;\n var length = aStr.length;\n var index = 0;\n var cachedSegments = {};\n var temp = {};\n var originalMappings = [];\n var generatedMappings = [];\n var mapping, str, segment, end, value;\n\n while (index < length) {\n if (aStr.charAt(index) === ';') {\n generatedLine++;\n index++;\n previousGeneratedColumn = 0;\n }\n else if (aStr.charAt(index) === ',') {\n index++;\n }\n else {\n mapping = new Mapping();\n mapping.generatedLine = generatedLine;\n\n // Because each offset is encoded relative to the previous one,\n // many segments often have the same encoding. We can exploit this\n // fact by caching the parsed variable length fields of each segment,\n // allowing us to avoid a second parse if we encounter the same\n // segment again.\n for (end = index; end < length; end++) {\n if (this._charIsMappingSeparator(aStr, end)) {\n break;\n }\n }\n str = aStr.slice(index, end);\n\n segment = cachedSegments[str];\n if (segment) {\n index += str.length;\n } else {\n segment = [];\n while (index < end) {\n base64VLQ.decode(aStr, index, temp);\n value = temp.value;\n index = temp.rest;\n segment.push(value);\n }\n\n if (segment.length === 2) {\n throw new Error('Found a source, but no line and column');\n }\n\n if (segment.length === 3) {\n throw new Error('Found a source and line, but no column');\n }\n\n cachedSegments[str] = segment;\n }\n\n // Generated column.\n mapping.generatedColumn = previousGeneratedColumn + segment[0];\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (segment.length > 1) {\n // Original source.\n mapping.source = previousSource + segment[1];\n previousSource += segment[1];\n\n // Original line.\n mapping.originalLine = previousOriginalLine + segment[2];\n previousOriginalLine = mapping.originalLine;\n // Lines are stored 0-based\n mapping.originalLine += 1;\n\n // Original column.\n mapping.originalColumn = previousOriginalColumn + segment[3];\n previousOriginalColumn = mapping.originalColumn;\n\n if (segment.length > 4) {\n // Original name.\n mapping.name = previousName + segment[4];\n previousName += segment[4];\n }\n }\n\n generatedMappings.push(mapping);\n if (typeof mapping.originalLine === 'number') {\n originalMappings.push(mapping);\n }\n }\n }\n\n quickSort(generatedMappings, util.compareByGeneratedPositionsDeflated);\n this.__generatedMappings = generatedMappings;\n\n quickSort(originalMappings, util.compareByOriginalPositions);\n this.__originalMappings = originalMappings;\n };\n\n/**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\nBasicSourceMapConsumer.prototype._findMapping =\n function SourceMapConsumer_findMapping(aNeedle, aMappings, aLineName,\n aColumnName, aComparator, aBias) {\n // To return the position we are searching for, we must first find the\n // mapping for the given position and then return the opposite position it\n // points to. Because the mappings are sorted, we can use binary search to\n // find the best mapping.\n\n if (aNeedle[aLineName] <= 0) {\n throw new TypeError('Line must be greater than or equal to 1, got '\n + aNeedle[aLineName]);\n }\n if (aNeedle[aColumnName] < 0) {\n throw new TypeError('Column must be greater than or equal to 0, got '\n + aNeedle[aColumnName]);\n }\n\n return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n };\n\n/**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\nBasicSourceMapConsumer.prototype.computeColumnSpans =\n function SourceMapConsumer_computeColumnSpans() {\n for (var index = 0; index < this._generatedMappings.length; ++index) {\n var mapping = this._generatedMappings[index];\n\n // Mappings do not contain a field for the last generated columnt. We\n // can come up with an optimistic estimate, however, by assuming that\n // mappings are contiguous (i.e. given two consecutive mappings, the\n // first mapping ends where the second one starts).\n if (index + 1 < this._generatedMappings.length) {\n var nextMapping = this._generatedMappings[index + 1];\n\n if (mapping.generatedLine === nextMapping.generatedLine) {\n mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n continue;\n }\n }\n\n // The last mapping for each line spans the entire line.\n mapping.lastGeneratedColumn = Infinity;\n }\n };\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source.\n * - column: The column number in the generated source.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null.\n * - column: The column number in the original source, or null.\n * - name: The original identifier, or null.\n */\nBasicSourceMapConsumer.prototype.originalPositionFor =\n function SourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._generatedMappings,\n \"generatedLine\",\n \"generatedColumn\",\n util.compareByGeneratedPositionsDeflated,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._generatedMappings[index];\n\n if (mapping.generatedLine === needle.generatedLine) {\n var source = util.getArg(mapping, 'source', null);\n if (source !== null) {\n source = this._sources.at(source);\n if (this.sourceRoot != null) {\n source = util.join(this.sourceRoot, source);\n }\n }\n var name = util.getArg(mapping, 'name', null);\n if (name !== null) {\n name = this._names.at(name);\n }\n return {\n source: source,\n line: util.getArg(mapping, 'originalLine', null),\n column: util.getArg(mapping, 'originalColumn', null),\n name: name\n };\n }\n }\n\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nBasicSourceMapConsumer.prototype.hasContentsOfAllSources =\n function BasicSourceMapConsumer_hasContentsOfAllSources() {\n if (!this.sourcesContent) {\n return false;\n }\n return this.sourcesContent.length >= this._sources.size() &&\n !this.sourcesContent.some(function (sc) { return sc == null; });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nBasicSourceMapConsumer.prototype.sourceContentFor =\n function SourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n if (!this.sourcesContent) {\n return null;\n }\n\n if (this.sourceRoot != null) {\n aSource = util.relative(this.sourceRoot, aSource);\n }\n\n if (this._sources.has(aSource)) {\n return this.sourcesContent[this._sources.indexOf(aSource)];\n }\n\n var url;\n if (this.sourceRoot != null\n && (url = util.urlParse(this.sourceRoot))) {\n // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n // many users. We can help them out when they expect file:// URIs to\n // behave like it would if they were running a local HTTP server. See\n // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n var fileUriAbsPath = aSource.replace(/^file:\\/\\//, \"\");\n if (url.scheme == \"file\"\n && this._sources.has(fileUriAbsPath)) {\n return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)]\n }\n\n if ((!url.path || url.path == \"/\")\n && this._sources.has(\"/\" + aSource)) {\n return this.sourcesContent[this._sources.indexOf(\"/\" + aSource)];\n }\n }\n\n // This function is used recursively from\n // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n // don't want to throw if we can't find the source - we just want to\n // return null, so we provide a flag to exit gracefully.\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source.\n * - column: The column number in the original source.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null.\n * - column: The column number in the generated source, or null.\n */\nBasicSourceMapConsumer.prototype.generatedPositionFor =\n function SourceMapConsumer_generatedPositionFor(aArgs) {\n var source = util.getArg(aArgs, 'source');\n if (this.sourceRoot != null) {\n source = util.relative(this.sourceRoot, source);\n }\n if (!this._sources.has(source)) {\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n }\n source = this._sources.indexOf(source);\n\n var needle = {\n source: source,\n originalLine: util.getArg(aArgs, 'line'),\n originalColumn: util.getArg(aArgs, 'column')\n };\n\n var index = this._findMapping(\n needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n util.getArg(aArgs, 'bias', SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (mapping.source === needle.source) {\n return {\n line: util.getArg(mapping, 'generatedLine', null),\n column: util.getArg(mapping, 'generatedColumn', null),\n lastColumn: util.getArg(mapping, 'lastGeneratedColumn', null)\n };\n }\n }\n\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n };\n\nexports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n/**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The only parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - file: Optional. The generated file this source map is associated with.\n * - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n * - offset: The offset into the original specified at which this section\n * begins to apply, defined as an object with a \"line\" and \"column\"\n * field.\n * - map: A source map definition. This source map could also be indexed,\n * but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n * {\n * version : 3,\n * file: \"app.js\",\n * sections: [{\n * offset: {line:100, column:10},\n * map: {\n * version : 3,\n * file: \"section.js\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AAAA,E;;ABCDE;\"\n * }\n * }],\n * }\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\nfunction IndexedSourceMapConsumer(aSourceMap) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === 'string') {\n sourceMap = JSON.parse(aSourceMap.replace(/^\\)\\]\\}'/, ''));\n }\n\n var version = util.getArg(sourceMap, 'version');\n var sections = util.getArg(sourceMap, 'sections');\n\n if (version != this._version) {\n throw new Error('Unsupported version: ' + version);\n }\n\n this._sources = new ArraySet();\n this._names = new ArraySet();\n\n var lastOffset = {\n line: -1,\n column: 0\n };\n this._sections = sections.map(function (s) {\n if (s.url) {\n // The url field will require support for asynchronicity.\n // See https://github.com/mozilla/source-map/issues/16\n throw new Error('Support for url field in sections not implemented.');\n }\n var offset = util.getArg(s, 'offset');\n var offsetLine = util.getArg(offset, 'line');\n var offsetColumn = util.getArg(offset, 'column');\n\n if (offsetLine < lastOffset.line ||\n (offsetLine === lastOffset.line && offsetColumn < lastOffset.column)) {\n throw new Error('Section offsets must be ordered and non-overlapping.');\n }\n lastOffset = offset;\n\n return {\n generatedOffset: {\n // The offset fields are 0-based, but we use 1-based indices when\n // encoding/decoding from VLQ.\n generatedLine: offsetLine + 1,\n generatedColumn: offsetColumn + 1\n },\n consumer: new SourceMapConsumer(util.getArg(s, 'map'))\n }\n });\n}\n\nIndexedSourceMapConsumer.prototype = Object.create(SourceMapConsumer.prototype);\nIndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n/**\n * The version of the source mapping spec that we are consuming.\n */\nIndexedSourceMapConsumer.prototype._version = 3;\n\n/**\n * The list of original sources.\n */\nObject.defineProperty(IndexedSourceMapConsumer.prototype, 'sources', {\n get: function () {\n var sources = [];\n for (var i = 0; i < this._sections.length; i++) {\n for (var j = 0; j < this._sections[i].consumer.sources.length; j++) {\n sources.push(this._sections[i].consumer.sources[j]);\n }\n }\n return sources;\n }\n});\n\n/**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source.\n * - column: The column number in the generated source.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null.\n * - column: The column number in the original source, or null.\n * - name: The original identifier, or null.\n */\nIndexedSourceMapConsumer.prototype.originalPositionFor =\n function IndexedSourceMapConsumer_originalPositionFor(aArgs) {\n var needle = {\n generatedLine: util.getArg(aArgs, 'line'),\n generatedColumn: util.getArg(aArgs, 'column')\n };\n\n // Find the section containing the generated position we're trying to map\n // to an original position.\n var sectionIndex = binarySearch.search(needle, this._sections,\n function(needle, section) {\n var cmp = needle.generatedLine - section.generatedOffset.generatedLine;\n if (cmp) {\n return cmp;\n }\n\n return (needle.generatedColumn -\n section.generatedOffset.generatedColumn);\n });\n var section = this._sections[sectionIndex];\n\n if (!section) {\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n }\n\n return section.consumer.originalPositionFor({\n line: needle.generatedLine -\n (section.generatedOffset.generatedLine - 1),\n column: needle.generatedColumn -\n (section.generatedOffset.generatedLine === needle.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n bias: aArgs.bias\n });\n };\n\n/**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\nIndexedSourceMapConsumer.prototype.hasContentsOfAllSources =\n function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n return this._sections.every(function (s) {\n return s.consumer.hasContentsOfAllSources();\n });\n };\n\n/**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\nIndexedSourceMapConsumer.prototype.sourceContentFor =\n function IndexedSourceMapConsumer_sourceContentFor(aSource, nullOnMissing) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n var content = section.consumer.sourceContentFor(aSource, true);\n if (content) {\n return content;\n }\n }\n if (nullOnMissing) {\n return null;\n }\n else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n/**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source.\n * - column: The column number in the original source.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null.\n * - column: The column number in the generated source, or null.\n */\nIndexedSourceMapConsumer.prototype.generatedPositionFor =\n function IndexedSourceMapConsumer_generatedPositionFor(aArgs) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n // Only consider this section if the requested source is in the list of\n // sources of the consumer.\n if (section.consumer.sources.indexOf(util.getArg(aArgs, 'source')) === -1) {\n continue;\n }\n var generatedPosition = section.consumer.generatedPositionFor(aArgs);\n if (generatedPosition) {\n var ret = {\n line: generatedPosition.line +\n (section.generatedOffset.generatedLine - 1),\n column: generatedPosition.column +\n (section.generatedOffset.generatedLine === generatedPosition.line\n ? section.generatedOffset.generatedColumn - 1\n : 0)\n };\n return ret;\n }\n }\n\n return {\n line: null,\n column: null\n };\n };\n\n/**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\nIndexedSourceMapConsumer.prototype._parseMappings =\n function IndexedSourceMapConsumer_parseMappings(aStr, aSourceRoot) {\n this.__generatedMappings = [];\n this.__originalMappings = [];\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n var sectionMappings = section.consumer._generatedMappings;\n for (var j = 0; j < sectionMappings.length; j++) {\n var mapping = sectionMappings[j];\n\n var source = section.consumer._sources.at(mapping.source);\n if (section.consumer.sourceRoot !== null) {\n source = util.join(section.consumer.sourceRoot, source);\n }\n this._sources.add(source);\n source = this._sources.indexOf(source);\n\n var name = section.consumer._names.at(mapping.name);\n this._names.add(name);\n name = this._names.indexOf(name);\n\n // The mappings coming from the consumer for the section have\n // generated positions relative to the start of the section, so we\n // need to offset them to be relative to the start of the concatenated\n // generated file.\n var adjustedMapping = {\n source: source,\n generatedLine: mapping.generatedLine +\n (section.generatedOffset.generatedLine - 1),\n generatedColumn: mapping.generatedColumn +\n (section.generatedOffset.generatedLine === mapping.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: name\n };\n\n this.__generatedMappings.push(adjustedMapping);\n if (typeof adjustedMapping.originalLine === 'number') {\n this.__originalMappings.push(adjustedMapping);\n }\n }\n }\n\n quickSort(this.__generatedMappings, util.compareByGeneratedPositionsDeflated);\n quickSort(this.__originalMappings, util.compareByOriginalPositions);\n };\n\nexports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/source-map-consumer.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = __webpack_require__(/*! ./util */ \"./node_modules/snapdragon/node_modules/source-map/lib/util.js\");\nvar has = Object.prototype.hasOwnProperty;\nvar hasNativeMap = typeof Map !== \"undefined\";\n\n/**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\nfunction ArraySet() {\n this._array = [];\n this._set = hasNativeMap ? new Map() : Object.create(null);\n}\n\n/**\n * Static method for creating ArraySet instances from an existing array.\n */\nArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {\n var set = new ArraySet();\n for (var i = 0, len = aArray.length; i < len; i++) {\n set.add(aArray[i], aAllowDuplicates);\n }\n return set;\n};\n\n/**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\nArraySet.prototype.size = function ArraySet_size() {\n return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;\n};\n\n/**\n * Add the given string to this set.\n *\n * @param String aStr\n */\nArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);\n var idx = this._array.length;\n if (!isDuplicate || aAllowDuplicates) {\n this._array.push(aStr);\n }\n if (!isDuplicate) {\n if (hasNativeMap) {\n this._set.set(aStr, idx);\n } else {\n this._set[sStr] = idx;\n }\n }\n};\n\n/**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\nArraySet.prototype.has = function ArraySet_has(aStr) {\n if (hasNativeMap) {\n return this._set.has(aStr);\n } else {\n var sStr = util.toSetString(aStr);\n return has.call(this._set, sStr);\n }\n};\n\n/**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\nArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n if (hasNativeMap) {\n var idx = this._set.get(aStr);\n if (idx >= 0) {\n return idx;\n }\n } else {\n var sStr = util.toSetString(aStr);\n if (has.call(this._set, sStr)) {\n return this._set[sStr];\n }\n }\n\n throw new Error('\"' + aStr + '\" is not in the set.');\n};\n\n/**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\nArraySet.prototype.at = function ArraySet_at(aIdx) {\n if (aIdx >= 0 && aIdx < this._array.length) {\n return this._array[aIdx];\n }\n throw new Error('No element indexed by ' + aIdx);\n};\n\n/**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\nArraySet.prototype.toArray = function ArraySet_toArray() {\n return this._array.slice();\n};\n\nexports.ArraySet = ArraySet;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/array-set.js?");
Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided\n * with the distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar base64 = __webpack_require__(/*! ./base64 */ \"./node_modules/snapdragon/node_modules/source-map/lib/base64.js\");\n\n// A single base 64 digit can contain 6 bits of data. For the base 64 variable\n// length quantities we use in the source map spec, the first bit is the sign,\n// the next four bits are the actual value, and the 6th bit is the\n// continuation bit. The continuation bit tells us whether there are more\n// digits in this value following this digit.\n//\n// Continuation\n// | Sign\n// | |\n// V V\n// 101011\n\nvar VLQ_BASE_SHIFT = 5;\n\n// binary: 100000\nvar VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n// binary: 011111\nvar VLQ_BASE_MASK = VLQ_BASE - 1;\n\n// binary: 100000\nvar VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n/**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n * 2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\nfunction toVLQSigned(aValue) {\n return aValue < 0\n ? ((-aValue) << 1) + 1\n : (aValue << 1) + 0;\n}\n\n/**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n * 4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\nfunction fromVLQSigned(aValue) {\n var isNegative = (aValue & 1) === 1;\n var shifted = aValue >> 1;\n return isNegative\n ? -shifted\n : shifted;\n}\n\n/**\n * Returns the base 64 VLQ encoded value.\n */\nexports.encode = function base64VLQ_encode(aValue) {\n var encoded = \"\";\n var digit;\n\n var vlq = toVLQSigned(aValue);\n\n do {\n digit = vlq & VLQ_BASE_MASK;\n vlq >>>= VLQ_BASE_SHIFT;\n if (vlq > 0) {\n // There are still more digits in this value, so we must make sure the\n // continuation bit is marked.\n digit |= VLQ_CONTINUATION_BIT;\n }\n encoded += base64.encode(digit);\n } while (vlq > 0);\n\n return encoded;\n};\n\n/**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\nexports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n var strLen = aStr.length;\n var result = 0;\n var shift = 0;\n var continuation, digit;\n\n do {\n if (aIndex >= strLen) {\n throw new Error(\"Expected more digits in base 64 VLQ value.\");\n }\n\n digit = base64.decode(aStr.charCodeAt(aIndex++));\n if (digit === -1) {\n throw new Error(\"Invalid base64 digit: \" + aStr.charAt(aIndex - 1));\n }\n\n continuation = !!(digit & VLQ_CONTINUATION_BIT);\n digit &= VLQ_BASE_MASK;\n result = result + (digit << shift);\n shift += VLQ_BASE_SHIFT;\n } while (continuation);\n\n aOutParam.value = fromVLQSigned(result);\n aOutParam.rest = aIndex;\n};\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/base64-vlq.js?");
Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\nvar util = __webpack_require__(/*! ./util */ \"./node_modules/snapdragon/node_modules/source-map/lib/util.js\");\n\n/**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\nfunction generatedPositionAfter(mappingA, mappingB) {\n // Optimized for most common case\n var lineA = mappingA.generatedLine;\n var lineB = mappingB.generatedLine;\n var columnA = mappingA.generatedColumn;\n var columnB = mappingB.generatedColumn;\n return lineB > lineA || lineB == lineA && columnB >= columnA ||\n util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0;\n}\n\n/**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\nfunction MappingList() {\n this._array = [];\n this._sorted = true;\n // Serves as infimum\n this._last = {generatedLine: -1, generatedColumn: 0};\n}\n\n/**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\nMappingList.prototype.unsortedForEach =\n function MappingList_forEach(aCallback, aThisArg) {\n this._array.forEach(aCallback, aThisArg);\n };\n\n/**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\nMappingList.prototype.add = function MappingList_add(aMapping) {\n if (generatedPositionAfter(this._last, aMapping)) {\n this._last = aMapping;\n this._array.push(aMapping);\n } else {\n this._sorted = false;\n this._array.push(aMapping);\n }\n};\n\n/**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\nMappingList.prototype.toArray = function MappingList_toArray() {\n if (!this._sorted) {\n this._array.sort(util.compareByGeneratedPositionsInflated);\n this._sorted = true;\n }\n return this._array;\n};\n\nexports.MappingList = MappingList;\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/snapdragon/node_modules/source-map/lib/mapping-list.js?");
Copyright 2014 Simon Lydell\n// X11 (“MIT”) Licensed. (See LICENSE.)\n\nvoid (function(root, factory) {\n if (true) {\n !(__WEBPACK_AMD_DEFINE_FACTORY__ = (factory),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ?\n\t\t(__WEBPACK_AMD_DEFINE_FACTORY__.call(exports, __webpack_require__, exports, module)) :\n\t\t__WEBPACK_AMD_DEFINE_FACTORY__),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__))\n } else {}\n}(this, function() {\n\n var innerRegex = /[#@] sourceMappingURL=([^\\s'\"]*)/\n\n var regex = RegExp(\n \"(?:\" +\n \"/\\\\*\" +\n \"(?:\\\\s*\\r?\\n(?://)?)?\" +\n \"(?:\" + innerRegex.source + \")\" +\n \"\\\\s*\" +\n \"\\\\*/\" +\n \"|\" +\n \"//(?:\" + innerRegex.source + \")\" +\n \")\" +\n \"\\\\s*\"\n )\n\n return {\n\n regex: regex,\n _innerRegex: innerRegex,\n\n getFrom: function(code) {\n var match = code.match(regex)\n return (match ? match[1] || match[2] || \"\" : null)\n },\n\n existsIn: function(code) {\n return regex.test(code)\n },\n\n removeFrom: function(code) {\n return code.replace(regex, \"\")\n },\n\n insertBefore: function(code, string) {\n var match = code.match(regex)\n if (match) {\n return code.slice(0, match.index) + string + code.slice(match.index)\n } else {\n return code + string\n }\n }\n }\n\n}));\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/source-map-url/source-map-url.js?");
Copyright 2014 Simon Lydell\r\n// X11 (“MIT”) Licensed. (See LICENSE.)\r\n\r\nvar path = __webpack_require__(/*! path */ \"path\")\r\n\r\n\"use strict\"\r\n\r\nfunction urix(aPath) {\r\n if (path.sep === \"\\\\\") {\r\n return aPath\r\n .replace(/\\\\/g, \"/\")\r\n .replace(/^[a-z]:\\/?/i, \"/\")\r\n }\r\n return aPath\r\n}\r\n\r\nmodule.exports = urix\r\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/urix/index.js?");
Copyright © 2015-2018, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n(function(factory) {\n if (exports && typeof exports === 'object' && \"object\" !== 'undefined') {\n module.exports = factory();\n } else if (true) {\n !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_FACTORY__ = (factory),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ = (typeof __WEBPACK_AMD_DEFINE_FACTORY__ === 'function' ?\n\t\t(__WEBPACK_AMD_DEFINE_FACTORY__.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__)) : __WEBPACK_AMD_DEFINE_FACTORY__),\n\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\n } else {}\n})(function() {\n 'use strict';\n return function isWindows() {\n return process && (process.platform === 'win32' || /^(msys|cygwin)$/.test(process.env.OSTYPE));\n };\n});\n\n\n//# sourceURL=webpack://@nicolo-ribaudo/chokidar-2/./node_modules/is-windows/index.js?");
--------------------------------- (separator) ----------------------------------
== Dependency
@node-rs/xxhash-darwin-arm64
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020-present LongYinan
--------------------------------- (separator) ----------------------------------
== Dependency
@node-rs/xxhash
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020-present LongYinan
--------------------------------- (separator) ----------------------------------
== Dependency
@nodelib/fs.scandir
== License Type
SPDX:MIT
== Copyright
Copyright (c) Denis Malinochkin
--------------------------------- (separator) ----------------------------------
== Dependency
@nodelib/fs.stat
== License Type
SPDX:MIT
== Copyright
Copyright (c) Denis Malinochkin
--------------------------------- (separator) ----------------------------------
== Dependency
@nodelib/fs.walk
== License Type
SPDX:MIT
== Copyright
Copyright (c) Denis Malinochkin
--------------------------------- (separator) ----------------------------------
== Dependency
@npmcli/fs
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2011-2017 JP Richardson
--------------------------------- (separator) ----------------------------------
== Dependency
@npmcli/move-file
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
Copyright (c) npm, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
@opensearch/datemath
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@opensearch-dashboards-test/opensearch-dashboards-test-library
== License Type
SPDX:ISC
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@opensearch-project/opensearch
== License Type
SPDX:Apache-2.0
== Copyright
opensearch-project
--------------------------------- (separator) ----------------------------------
== Dependency
@opentelemetry/api
== License Type
SPDX:Apache-2.0
== Copyright
OpenTelemetry Authors
--------------------------------- (separator) ----------------------------------
== Dependency
@opentelemetry/core
== License Type
SPDX:Apache-2.0
== Copyright
OpenTelemetry Authors
--------------------------------- (separator) ----------------------------------
== Dependency
@opentelemetry/resources
== License Type
SPDX:Apache-2.0
== Copyright
OpenTelemetry Authors
--------------------------------- (separator) ----------------------------------
== Dependency
@opentelemetry/sdk-metrics
== License Type
SPDX:Apache-2.0
== Copyright
OpenTelemetry Authors
--------------------------------- (separator) ----------------------------------
== Dependency
@opentelemetry/semantic-conventions
== License Type
SPDX:Apache-2.0
== Copyright
OpenTelemetry Authors
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/ace
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2010, Ajax.org B.V.
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/analytics
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/apm-config-loader
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/babel-preset
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/config-schema
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/config
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/cross-platform
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/dev-utils
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/eslint-import-resolver-opensearch-dashboards
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/eslint-plugin-eslint
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2015-present, Ben Mosher
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/expect
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Guillermo Rauch <guillermo@learnboost.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/i18n
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/interpreter
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/logging
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/monaco
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/opensearch-archiver
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/opensearch
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/optimizer
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2014-present Sebastian McKenzie and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/plugin-generator
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/plugin-helpers
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/pm
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2014-2016, Jon Schlinkert.
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright (c) 2014-2020 Teambition
Copyright (c) 2014-present, Jon Schlinkert.
Copyright (c) 2015, Jon Schlinkert.
Copyright (c) 2015-present, Jon Schlinkert.
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/std
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/stylelint-config
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/stylelint-plugin-stylelint
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/telemetry-tools
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/test-subj-selector
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/test
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2017 Brandon Keepers
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/ui-framework
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/ui-shared-deps
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2007-2014 IOLA and Ole Laursen
Copyright (c) 2007-2014 IOLA and Ole Laursen.
Copyright (c) 2008, Three Dub Media (http://threedubmedia.com)
Copyright (c) 2010 "Cowboy" Ben Alman
Copyright (c) 2010 Xuan Luo.
Copyright (c) 2011 Brandon Aaron (http://brandonaaron.net)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/utility-types
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@osd/utils
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
@popperjs/core
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Federico Zivolo
--------------------------------- (separator) ----------------------------------
== Dependency
@reduxjs/toolkit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Mark Erikson
Copyright (c) Facebook, Inc. and its affiliates.
Copyright 2018-2021 the Deno authors. All rights reserved. MIT license.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/abort-controller
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/config-resolver
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/core
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/credential-provider-imds
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/eventstream-codec
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/fetch-http-handler
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/hash-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/invalid-dependency
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/is-array-buffer
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/middleware-content-length
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/middleware-endpoint
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/middleware-retry
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/middleware-serde
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/middleware-stack
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/node-config-provider
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/node-http-handler
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/property-provider
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/protocol-http
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/querystring-builder
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/querystring-parser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/service-error-classification
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/shared-ini-file-loader
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/signature-v4
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/smithy-client
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/types
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/url-parser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-base64
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-body-length-browser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-body-length-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-buffer-from
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-config-provider
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-defaults-mode-browser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-defaults-mode-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-endpoints
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2021 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-hex-encoding
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-middleware
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2021 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-retry
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2021 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-stream
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-uri-escape
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-utf8
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@smithy/util-waiter
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018-2020 Amazon.com, Inc. or its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-actions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-backgrounds
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-controls
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-docs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-essentials
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-knobs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Storybook contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-measure
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-outline
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-postcss
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Storybook contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-toolbars
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addon-viewport
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/addons
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/api
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/builder-webpack4
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/channel-postmessage
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/channel-websocket
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/channels
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/client-api
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/client-logger
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/components
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Facebook, Inc.
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/core-client
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/core-common
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/core-events
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/core-server
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/core
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/csf-tools
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/docs-tools
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/manager-webpack4
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2017 Kirollos Risk (http://kiro.me)
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
Copyright (c) 2021 Nathan Bubna; Licensed (MIT OR GPL-3.0) */
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Microsoft Corporation.
Copyright (c) Remix Software Inc.
Copyright 2009-2020 by contributors, MIT License
Copyright 2013-2016 by Paul Miller (http://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/mdx1-csf
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Storybook contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/node-logger
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/postinstall
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/preview-web
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/react-docgen-typescript-plugin
== License Type
SPDX:MIT
== Copyright
Copyright (c) Andrew Lisowski <lisowski54@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/react
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/router
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
Copyright (c) Microsoft Corporation.
Copyright (c) Remix Software Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/semver
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/source-loader
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/store
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/telemetry
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/theming
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@storybook/ui
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2017 Kirollos Risk (http://kiro.me)
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2017 Kadira Inc. <hello@kadira.io>
Copyright (c) 2021 Nathan Bubna; Licensed (MIT OR GPL-3.0) */(function(module){(function(window,define){var _={version:"2.13.1",areas:{},apis:{},// utilities
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/chroma-js
== License Type
SPDX:MIT
== Copyright
[{'name': 'Sebastian Brückner', 'url': 'https://github.com/invliD', 'githubUsername': 'invliD'}, {'name': 'Marcin Pacholec', 'url': 'https://github.com/mpacholec', 'githubUsername': 'mpacholec'}, {'name': 'Charlie Zhuo', 'url': 'https://github.com/CharlieZhuo', 'githubUsername': 'CharlieZhuo'}]
--------------------------------- (separator) ----------------------------------
== Dependency
@types/duplexify
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/graceful-fs
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/hast
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/hoist-non-react-statics
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/istanbul-lib-coverage
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/istanbul-lib-report
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/istanbul-reports
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/js-cookie
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/lru-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/mdast
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/minimatch
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/ndjson
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/node-jose
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/node
== License Type
SPDX:MIT
== Copyright
[{'name': 'Microsoft TypeScript', 'githubUsername': 'Microsoft', 'url': 'https://github.com/Microsoft'}, {'name': 'Alberto Schiabel', 'githubUsername': 'jkomyno', 'url': 'https://github.com/jkomyno'}, {'name': 'Alvis HT Tang', 'githubUsername': 'alvis', 'url': 'https://github.com/alvis'}, {'name': 'Andrew Makarov', 'githubUsername': 'r3nya', 'url': 'https://github.com/r3nya'}, {'name': 'Benjamin Toueg', 'githubUsername': 'btoueg', 'url': 'https://github.com/btoueg'}, {'name': 'Chigozirim C.', 'githubUsername': 'smac89', 'url': 'https://github.com/smac89'}, {'name': 'David Junger', 'githubUsername': 'touffy', 'url': 'https://github.com/touffy'}, {'name': 'Deividas Bakanas', 'githubUsername': 'DeividasBakanas', 'url': 'https://github.com/DeividasBakanas'}, {'name': 'Eugene Y. Q. Shen', 'githubUsername': 'eyqs', 'url': 'https://github.com/eyqs'}, {'name': 'Hannes Magnusson', 'githubUsername': 'Hannes-Magnusson-CK', 'url': 'https://github.com/Hannes-Magnusson-CK'}, {'name': 'Huw', 'githubUsername': 'hoo29', 'url': 'https://github.com/hoo29'}, {'name': 'Kelvin Jin', 'githubUsername': 'kjin', 'url': 'https://github.com/kjin'}, {'name': 'Klaus Meinhardt', 'githubUsername': 'ajafff', 'url': 'https://github.com/ajafff'}, {'name': 'Lishude', 'githubUsername': 'islishude', 'url': 'https://github.com/islishude'}, {'name': 'Mariusz Wiktorczyk', 'githubUsername': 'mwiktorczyk', 'url': 'https://github.com/mwiktorczyk'}, {'name': 'Mohsen Azimi', 'githubUsername': 'mohsen1', 'url': 'https://github.com/mohsen1'}, {'name': 'Nicolas Even', 'githubUsername': 'n-e', 'url': 'https://github.com/n-e'}, {'name': 'Nikita Galkin', 'githubUsername': 'galkin', 'url': 'https://github.com/galkin'}, {'name': 'Parambir Singh', 'githubUsername': 'parambirs', 'url': 'https://github.com/parambirs'}, {'name': 'Sebastian Silbermann', 'githubUsername': 'eps1lon', 'url': 'https://github.com/eps1lon'}, {'name': 'Thomas den Hollander', 'githubUsername': 'ThomasdenH', 'url': 'https://github.com/ThomasdenH'}, {'name': 'Wilco Bakker', 'githubUsername': 'WilcoBakker', 'url': 'https://github.com/WilcoBakker'}, {'name': 'wwwy3y3', 'githubUsername': 'wwwy3y3', 'url': 'https://github.com/wwwy3y3'}, {'name': 'Samuel Ainsworth', 'githubUsername': 'samuela', 'url': 'https://github.com/samuela'}, {'name': 'Kyle Uehlein', 'githubUsername': 'kuehlein', 'url': 'https://github.com/kuehlein'}, {'name': 'Thanik Bhongbhibhat', 'githubUsername': 'bhongy', 'url': 'https://github.com/bhongy'}, {'name': 'Marcin Kopacz', 'githubUsername': 'chyzwar', 'url': 'https://github.com/chyzwar'}, {'name': 'Trivikram Kamat', 'githubUsername': 'trivikr', 'url': 'https://github.com/trivikr'}, {'name': 'Junxiao Shi', 'githubUsername': 'yoursunny', 'url': 'https://github.com/yoursunny'}, {'name': 'Ilia Baryshnikov', 'githubUsername': 'qwelias', 'url': 'https://github.com/qwelias'}, {'name': 'ExE Boss', 'githubUsername': 'ExE-Boss', 'url': 'https://github.com/ExE-Boss'}, {'name': 'Piotr Błażejewicz', 'githubUsername': 'peterblazejewicz', 'url': 'https://github.com/peterblazejewicz'}, {'name': 'Anna Henningsen', 'githubUsername': 'addaleax', 'url': 'https://github.com/addaleax'}, {'name': 'Victor Perin', 'githubUsername': 'victorperin', 'url': 'https://github.com/victorperin'}, {'name': 'Yongsheng Zhang', 'githubUsername': 'ZYSzys', 'url': 'https://github.com/ZYSzys'}, {'name': 'NodeJS Contributors', 'githubUsername': 'NodeJS', 'url': 'https://github.com/NodeJS'}, {'name': 'Linus Unnebäck', 'githubUsername': 'LinusU', 'url': 'https://github.com/LinusU'}, {'name': 'wafuwafu13', 'githubUsername': 'wafuwafu13', 'url': 'https://github.com/wafuwafu13'}, {'name': 'Matteo Collina', 'githubUsername': 'mcollina', 'url': 'https://github.com/mcollina'}, {'name': 'Dmitry Semigradsky', 'githubUsername': 'Semigradsky', 'url': 'https://github.com/Semigradsky'}]
--------------------------------- (separator) ----------------------------------
== Dependency
@types/parse5
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/prop-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/react-beautiful-dnd
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/react-input-autosize
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/react-redux
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/react-window
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/react
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/scheduler
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/source-list-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/tapable
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/tinycolor2
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/uglify-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/unist
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/uuid
== License Type
SPDX:MIT
== Copyright
[{'name': 'Oliver Hoffmann', 'githubUsername': 'iamolivinius', 'url': 'https://github.com/iamolivinius'}, {'name': 'Felipe Ochoa', 'githubUsername': 'felipeochoa', 'url': 'https://github.com/felipeochoa'}, {'name': 'Chris Barth', 'githubUsername': 'cjbarth', 'url': 'https://github.com/cjbarth'}, {'name': 'Linus Unnebäck', 'githubUsername': 'LinusU', 'url': 'https://github.com/LinusU'}, {'name': 'Christoph Tavan', 'githubUsername': 'ctavan', 'url': 'https://github.com/ctavan'}]
--------------------------------- (separator) ----------------------------------
== Dependency
@types/webpack-sources
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/yargs-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/yauzl
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/ast
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/floating-point-hex-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Mauro Bringolf
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-api-error
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-code-frame
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-fsm
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-module-context
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-numbers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-wasm-bytecode
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/helper-wasm-section
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/ieee754
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/leb128
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2012 The Obvious Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/utf8
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/wasm-edit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/wasm-gen
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/wasm-opt
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/wasm-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/wast-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@webassemblyjs/wast-printer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Sven Sauleau <sven@sauleau.com>
--------------------------------- (separator) ----------------------------------
== Dependency
@xobotyi/scrollbar-width
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Anton Zinovyev
--------------------------------- (separator) ----------------------------------
== Dependency
@xtuc/ieee754
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2008, Fair Oaks Labs, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
@xtuc/long
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2020 Daniel Wirtz / The long.js Authors
--------------------------------- (separator) ----------------------------------
== Dependency
@xyflow/react
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019-2024 webkid GmbH
--------------------------------- (separator) ----------------------------------
== Dependency
@xyflow/system
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019-2024 webkid GmbH
--------------------------------- (separator) ----------------------------------
== Dependency
JSONStream
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2011 Dominic Tarr
--------------------------------- (separator) ----------------------------------
== Dependency
abort-controller
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Toru Nagashima
--------------------------------- (separator) ----------------------------------
== Dependency
abortcontroller-polyfill
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 molsson
--------------------------------- (separator) ----------------------------------
== Dependency
accepts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
acorn-import-attributes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Sven Sauleau
--------------------------------- (separator) ----------------------------------
== Dependency
acorn-jsx
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2017 by Ingvar Stepanyan
--------------------------------- (separator) ----------------------------------
== Dependency
acorn-walk
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2018 by various contributors (see AUTHORS)
--------------------------------- (separator) ----------------------------------
== Dependency
acorn
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2018 by various contributors (see AUTHORS)
--------------------------------- (separator) ----------------------------------
== Dependency
address
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2013 - 2014 fengmk2 <fengmk2@gmail.com>
Copyright (C) 2015 - present node-modules and other contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
after-all-results
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
agent-base
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
agentkeepalive
== License Type
SPDX:MIT
== Copyright
Copyright(c) node-modules and other contributors.
Copyright(c) 2012 - 2015 fengmk2 <fengmk2@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
aggregate-error
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
airbnb-js-shims
== License Type
SPDX:MIT
== Copyright
Copyright 2015 Airbnb
--------------------------------- (separator) ----------------------------------
== Dependency
ajv-errors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
ajv-keywords
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
ajv
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2021 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-align
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-colors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Brian Woodward.
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-escapes
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-styles
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-to-html
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Rob Burns
--------------------------------- (separator) ----------------------------------
== Dependency
ansi-wrap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
antlr4-c3
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 - present Mike Lischke
--------------------------------- (separator) ----------------------------------
== Dependency
antlr4ng
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2023 The ANTLR Project. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
anymatch
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2019 Elan Shanker, Paul Miller (https://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
app-root-dir
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Phillip Gates-Idem
--------------------------------- (separator) ----------------------------------
== Dependency
app_link_test
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
append-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Brian Woodward.
--------------------------------- (separator) ----------------------------------
== Dependency
aproba
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
argparse
== License Type
SPDX:Python-2.0
== Copyright
Copyright (C) 1999-2001 Gregory P. Ward.
Copyright (C) 2002, 2003 Python Software Foundation.
Copyright (C) 2010-2020 Python Software Foundation.
Copyright (C) 2020 argparse.js authors
Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam,
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
--------------------------------- (separator) ----------------------------------
== Dependency
aria-hidden
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017 Anton Korzunov
--------------------------------- (separator) ----------------------------------
== Dependency
arr-diff
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
arr-flatten
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
arr-union
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2016, Jon Schlinkert.
Copyright © 2016 [Jon Schlinkert](https://github.com/jonschlinkert)
--------------------------------- (separator) ----------------------------------
== Dependency
array-buffer-byte-length
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
array-find-index
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
array-flatten
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
array-includes
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
array-union
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
array-uniq
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
array-unique
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright (c) 2014-2016, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
array.prototype.find
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Paul Miller (https://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
array.prototype.flat
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
array.prototype.flatmap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
array.prototype.map
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
array.prototype.reduce
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
arraybuffer.prototype.slice
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
arrify
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
asn1.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Fedor Indutny
--------------------------------- (separator) ----------------------------------
== Dependency
assert
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2009 Thomas Robinson <280north.com>
--------------------------------- (separator) ----------------------------------
== Dependency
assign-symbols
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
ast-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Ben Newman <bn@cs.stanford.edu>
--------------------------------- (separator) ----------------------------------
== Dependency
async-each
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Paul Miller (https://paulmillr.com)
Copyright (c) 2016 Paul Miller [(paulmillr.com)](https://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
async-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 EduardoRFS
--------------------------------- (separator) ----------------------------------
== Dependency
async-value-promise
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Stephen Belanger
--------------------------------- (separator) ----------------------------------
== Dependency
async-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Stephen Belanger
--------------------------------- (separator) ----------------------------------
== Dependency
async
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010-2018 Caolan McMahon
--------------------------------- (separator) ----------------------------------
== Dependency
asynckit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Alex Indigo
--------------------------------- (separator) ----------------------------------
== Dependency
at-least-node
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2020 Ryan Zimmerman <opensrc@ryanzim.com>
--------------------------------- (separator) ----------------------------------
== Dependency
atob
== License Type
=== Apache-2.0
At your option you may choose either of the following licenses:
* The MIT License (MIT)
* The Apache License 2.0 (Apache-2.0)
The MIT License (MIT)
Copyright (c) 2015 AJ ONeal
Apache License
Copyright 2015 AJ ONeal
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.
== Copyright
Copyright (c) 2015 AJ ONeal
Copyright 2015 AJ ONeal
copyright 2012-2018 AJ ONeal
--------------------------------- (separator) ----------------------------------
== Dependency
atomic-sleep
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 David Mark Clements
--------------------------------- (separator) ----------------------------------
== Dependency
attr-accept
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Andrey Okonetchnikov
--------------------------------- (separator) ----------------------------------
== Dependency
autobind-decorator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Andrey Popp
copyright 2015, Andrey Popp <8mayday@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
autoprefixer
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Andrey Sitnik <andrey@sitnik.ru>
--------------------------------- (separator) ----------------------------------
== Dependency
available-typed-arrays
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
aws4
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Michael Hart (michael.hart.au@gmail.com)
--------------------------------- (separator) ----------------------------------
== Dependency
axios
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Matt Zabriskie & Collaborators
Copyright (c) 2025 Matt Zabriskie and contributors */
--------------------------------- (separator) ----------------------------------
== Dependency
babel-loader
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2019 Luís Couto <hello@luiscouto.pt>
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-add-module-exports
== License Type
SPDX:MIT
== Copyright
Hiroyuki Usui <i59naga@icloud.com> ("githubUsername" : "59naga" )
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-emotion
== License Type
SPDX:MIT
== Copyright
Copyright (c) Emotion team and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-extract-import-names
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-2020 Compositor and Vercel, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-istanbul
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2016, Istanbul Code Coverage
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-macros
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Kent C. Dodds
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-module-resolver
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Tommy Leunen <tommy.leunen@gmail.com> (tommyleunen.com)
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-polyfill-corejs2
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Nicolò Ribaudo and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-polyfill-corejs3
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Nicolò Ribaudo and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-polyfill-regenerator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present Nicolò Ribaudo and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-react-docgen
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Facebook, Inc.
Copyright (c) 2016 Kadira Inc. <hello@kadira.io>
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-styled-components
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-present Vladimir Danchenkov and Maximilian Stoiber
Copyright © 2016-present Vladimir Danchenkov and Maximilian Stoiber.
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-syntax-jsx
== License Type
SPDX:MIT
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-transform-react-remove-prop-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Nikita Gusakov
--------------------------------- (separator) ----------------------------------
== Dependency
bail
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
balanced-match
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
--------------------------------- (separator) ----------------------------------
== Dependency
base64-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jameson Little
--------------------------------- (separator) ----------------------------------
== Dependency
base64url
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013–2016 Brian J. Brennan
--------------------------------- (separator) ----------------------------------
== Dependency
base
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
basic-auth
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 TJ Holowaychuk
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2015-2016 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
better-opn
== License Type
SPDX:MIT
== Copyright
Copyright 2018 Michael Lin <linzichunzf@hotmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
big-integer
== License Type
SPDX:Unlicense
== Copyright
Copyright (c) 2008-2014 Pivotal Labs
Copyright 2010-2012 Mathias Bynens <http://mths.be/>
Copyright Robert Kieffer <http://broofa.com/>
Copyright Robert Kieffer <http://broofa.com/>
--------------------------------- (separator) ----------------------------------
== Dependency
big.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Michael Mclaughlin
Copyright (c) 2018 Michael Mclaughlin <M8ch88l@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
bignumber.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>
Copyright © `<2023>` `Michael Mclaughlin`
--------------------------------- (separator) ----------------------------------
== Dependency
binary-extensions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com), Paul Miller (https://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
binary-search
== License Type
SPDX:CC0-1.0
== Copyright
The Dark Sky Company, LLC (support@darkskyapp.com)
--------------------------------- (separator) ----------------------------------
== Dependency
bindings
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
bl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2019 bl contributors
Copyright (c) 2013-2019 bl contributors (listed above).
--------------------------------- (separator) ----------------------------------
== Dependency
bluebird
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2017 Petka Antonov
Copyright (c) 2013-2018 Petka Antonov
--------------------------------- (separator) ----------------------------------
== Dependency
bn.js
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2015.
--------------------------------- (separator) ----------------------------------
== Dependency
body-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014-2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
boolbase
== License Type
Copyright (c) 2014-2015, Felix Boehm <me@feedic.com>
== Copyright
Copyright (c) 2014-2015, Felix Boehm <me@feedic.com>
--------------------------------- (separator) ----------------------------------
== Dependency
bowser
== License Type
SPDX:MIT
== Copyright
--------------------------------- (separator) ----------------------------------
== Dependency
boxen
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
bplist-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Near Infinity Corporation
--------------------------------- (separator) ----------------------------------
== Dependency
brace-expansion
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
--------------------------------- (separator) ----------------------------------
== Dependency
brace
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010, Ajax.org B.V.
Copyright 2013 Thorsten Lorenz.
--------------------------------- (separator) ----------------------------------
== Dependency
braces
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
breadth-filter
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Stephen Belanger
--------------------------------- (separator) ----------------------------------
== Dependency
brorand
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2014.
--------------------------------- (separator) ----------------------------------
== Dependency
browserify-aes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 browserify-aes contributors
--------------------------------- (separator) ----------------------------------
== Dependency
browserify-cipher
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Calvin Metcalf & contributors
--------------------------------- (separator) ----------------------------------
== Dependency
browserify-des
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Calvin Metcalf, Fedor Indutny & contributors
--------------------------------- (separator) ----------------------------------
== Dependency
browserify-rsa
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2016 Calvin Metcalf & contributors
--------------------------------- (separator) ----------------------------------
== Dependency
browserify-sign
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2014-2015 Calvin Metcalf and browserify-sign contributors
--------------------------------- (separator) ----------------------------------
== Dependency
browserify-zlib
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015 Devon Govett <devongovett@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
browserslist
== License Type
SPDX:MIT
== Copyright
Copyright 2014 Andrey Sitnik <andrey@sitnik.ru> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
bser
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2015-present Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
buffer-crc32
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Brian J. Brennan
--------------------------------- (separator) ----------------------------------
== Dependency
buffer-equal
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 James Halliday and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
buffer-from
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016, 2018 Linus Unnebäck
--------------------------------- (separator) ----------------------------------
== Dependency
buffer-xor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Daniel Cousens
--------------------------------- (separator) ----------------------------------
== Dependency
buffer
== License Type
SPDX:MIT
== Copyright
Copyright (C) [Feross Aboukhadijeh](http://feross.org), and other contributors. Originally forked from an MIT-licensed module by Romain Beauxis.
Copyright (c) Feross Aboukhadijeh, and other contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
builtin-status-codes
== License Type
SPDX:MIT
== Copyright
Copyright (c) Ben Drucker <bvdrucker@gmail.com> (bendrucker.me)
--------------------------------- (separator) ----------------------------------
== Dependency
bytes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2015 Jed Watson <jed.watson@me.com>
--------------------------------- (separator) ----------------------------------
== Dependency
c8
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
cacache
== License Type
SPDX:ISC
== Copyright
Copyright (c) npm, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
cache-base
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
call-bind-apply-helpers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
call-bind
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
call-bound
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
call-me-maybe
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Eric McCarthy
--------------------------------- (separator) ----------------------------------
== Dependency
callsites
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
camel-case
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
camelcase-css
== License Type
SPDX:MIT
== Copyright
Copyright (c) Steven Vachon <contact@svachon.com> (svachon.com)
--------------------------------- (separator) ----------------------------------
== Dependency
camelcase-keys
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
camelcase
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
camelize
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
case-sensitive-paths-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Alexandre Kirszenberg
Copyright (c) 2016 Michael Pratt
Copyright (c) 2018 Michael Pratt
--------------------------------- (separator) ----------------------------------
== Dependency
ccount
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
chalk
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
character-entities-html4
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
character-entities-legacy
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
character-entities
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
character-reference-invalid
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
chardet
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2018 Dmitry Shirokov
--------------------------------- (separator) ----------------------------------
== Dependency
cheerio
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Matt Mueller
--------------------------------- (separator) ----------------------------------
== Dependency
chokidar
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2019 Paul Miller (https://paulmillr.com), Elan Shanker
--------------------------------- (separator) ----------------------------------
== Dependency
chownr
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
chroma-js
== License Type
=== BSD-3-Clause--modified-by-Google
chroma.js - JavaScript library for color conversions
Copyright (c) 2011-2019, Gregor Aisch
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. The name Gregor Aisch may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL GREGOR AISCH OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------
chroma.js includes colors from colorbrewer2.org, which are released under
the following license:
Copyright (c) 2002 Cynthia Brewer, Mark Harrower,
and The Pennsylvania State University.
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.
------------------------------------------------------
Named colors are taken from X11 Color Names.
http://www.w3.org/TR/css3-color/#svg-color
@preserve
== Copyright
Copyright (c) 2002 Cynthia Brewer, Mark Harrower,
Copyright (c) 2002 Cynthia Brewer, Mark Harrower, and The
Copyright (c) 2011-2019, Gregor Aisch
--------------------------------- (separator) ----------------------------------
== Dependency
chrome-trace-event
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Joyent Inc. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
ci-info
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2021 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
cipher-base
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify contributors
--------------------------------- (separator) ----------------------------------
== Dependency
cjs-module-lexer
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2018 by various contributors (see AUTHORS)
Copyright (C) 2018-2020 Guy Bedford
--------------------------------- (separator) ----------------------------------
== Dependency
class-utils
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
classcat
== License Type
SPDX:MIT
== Copyright
Copyright © Jorge Bucaran <<https://jorgebucaran.com>>
--------------------------------- (separator) ----------------------------------
== Dependency
classnames
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018
Copyright (c) 2018 Jed Watson
Copyright (c) 2018 Jed Watson.
--------------------------------- (separator) ----------------------------------
== Dependency
clean-css
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2017 JakubPawlowicz.com
--------------------------------- (separator) ----------------------------------
== Dependency
clean-stack
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
clean-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 John Agan
--------------------------------- (separator) ----------------------------------
== Dependency
cli-boxes
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
cli-cursor
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
cli-table3
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010 LearnBoost <dev@learnboost.com>
Copyright (c) 2014 James Talmage <james.talmage@jrtechnical.com>
Copyright (c) 2014 James Talmage <james.talmage@jrtechnical.com>
--------------------------------- (separator) ----------------------------------
== Dependency
cli-width
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Ilya Radchenko <ilya@burstcreations.com>
--------------------------------- (separator) ----------------------------------
== Dependency
cliui
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
clone-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
clone-deep
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
clone-stats
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Hugh Kennedy
--------------------------------- (separator) ----------------------------------
== Dependency
clone
== License Type
SPDX:MIT
== Copyright
Copyright © 2011-2015 Paul Vorbach <paul@vorba.ch>
Copyright © 2011-2016 [Paul Vorbach](https://paul.vorba.ch/) and
--------------------------------- (separator) ----------------------------------
== Dependency
cloneable-readable
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Matteo Collina
--------------------------------- (separator) ----------------------------------
== Dependency
collapse-white-space
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
collection-visit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017, Jon Schlinkert
Copyright (c) 2015, 2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
color-convert
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2016 Heather Arthur <fayearthur@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
color-name
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Dmitry Ivanov
--------------------------------- (separator) ----------------------------------
== Dependency
color-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Heather Arthur <fayearthur@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
color-support
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
color
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Heather Arthur
--------------------------------- (separator) ----------------------------------
== Dependency
combined-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Debuggable Limited <felix@debuggable.com>
--------------------------------- (separator) ----------------------------------
== Dependency
comma-separated-tokens
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
commander
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 TJ Holowaychuk <tj@vision-media.ca>
--------------------------------- (separator) ----------------------------------
== Dependency
commondir
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday (mail@substack.net)
--------------------------------- (separator) ----------------------------------
== Dependency
complex.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2022, [Robert Eisele](https://www.xarg.org/)
Copyright (c) 2018 Robert Eisele
Copyright (c) 2020, Robert Eisele (robert@xarg.org)
--------------------------------- (separator) ----------------------------------
== Dependency
component-emitter
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Component contributors <dev@component.io>
--------------------------------- (separator) ----------------------------------
== Dependency
compressible
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014 Jeremiah Senkpiel <fishrock123@rocketmail.com>
Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
compression-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
compression
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014-2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
concat-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 James Halliday and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
concat-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Max Ogden
--------------------------------- (separator) ----------------------------------
== Dependency
console-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Raynos.
--------------------------------- (separator) ----------------------------------
== Dependency
console-control-strings
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2014, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
console-log-level
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2019 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
constants-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
--------------------------------- (separator) ----------------------------------
== Dependency
content-disposition
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
content-type
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
convert-source-map
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Thorsten Lorenz.
--------------------------------- (separator) ----------------------------------
== Dependency
cookie-signature
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 LearnBoost <tj@learnboost.com>
--------------------------------- (separator) ----------------------------------
== Dependency
cookie
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Roman Shtylman <shtylman@gmail.com>
Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
copy-concurrently
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
copy-descriptor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright (c) 2015-2016, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
copy-to-clipboard
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 sudodoki <smd.deluzion@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
core-js-compat
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2025 Denis Pushkarev
--------------------------------- (separator) ----------------------------------
== Dependency
core-js-pure
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2025 Denis Pushkarev
--------------------------------- (separator) ----------------------------------
== Dependency
core-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2022 Denis Pushkarev
--------------------------------- (separator) ----------------------------------
== Dependency
core-util-is
== License Type
SPDX:MIT
== Copyright
Copyright Node.js contributors. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
corePluginStaticAssets
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_app_status
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_plugin_a
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_plugin_appleave
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_plugin_b
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_plugin_chromeless
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_plugin_route_timeouts
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
core_provider_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
cosmiconfig
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 David Clark
--------------------------------- (separator) ----------------------------------
== Dependency
cp-file
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
cpy
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
create-ecdh
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 createECDH contributors
--------------------------------- (separator) ----------------------------------
== Dependency
create-hash
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify contributors
--------------------------------- (separator) ----------------------------------
== Dependency
create-hmac
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify contributors
--------------------------------- (separator) ----------------------------------
== Dependency
cross-spawn
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Made With MOXY Lda <hello@moxy.studio>
--------------------------------- (separator) ----------------------------------
== Dependency
crypto-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Dominic Tarr
--------------------------------- (separator) ----------------------------------
== Dependency
css-box-model
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Alex Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
css-color-keywords
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, Jakob Krigovsky
--------------------------------- (separator) ----------------------------------
== Dependency
css-in-js-utils
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Robin Frischmann
--------------------------------- (separator) ----------------------------------
== Dependency
css-select
== License Type
Copyright (c) Felix Böhm
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
THIS IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS,
EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
css-to-react-native
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jacob Parker and Maximilian Stoiber
Copyright © 2019 Krister Kari, Jacob Parker, and Maximilian Stoiber.
--------------------------------- (separator) ----------------------------------
== Dependency
css-tree
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2016-2019 by Roman Dvornov
Copyright 2011 Mozilla Foundation and contributors
Copyright 2011 The Closure Compiler Authors. All rights reserved.
Copyright 2014 Mozilla Foundation and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
css-what
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
csstype
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-2018 Fredrik Nicol
--------------------------------- (separator) ----------------------------------
== Dependency
currently-unhandled
== License Type
SPDX:MIT
== Copyright
Copyright (c) James Talmage <james@talmage.io> (github.com/jamestalmage)
--------------------------------- (separator) ----------------------------------
== Dependency
custom-event-polyfill
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Evan Krambuhl
--------------------------------- (separator) ----------------------------------
== Dependency
cyclist
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
d3-array
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2016 Mike Bostock
Copyright 2018 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-cloud
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2013, Jason Davies.
Copyright 2017 Mike Bostock.
--------------------------------- (separator) ----------------------------------
== Dependency
d3-collection
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2016, Mike Bostock
Copyright 2018 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-color
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2016 Mike Bostock
Copyright 2020 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-dispatch
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-drag
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-ease
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2001 Robert Penner
Copyright 2010-2021 Mike Bostock
Copyright 2010-2021 Mike Bostock, 2001 Robert Penner
--------------------------------- (separator) ----------------------------------
== Dependency
d3-format
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2015 Mike Bostock
Copyright 2020 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-interpolate
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-path
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2015-2016 Mike Bostock
Copyright 2019 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-scale
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2015 Mike Bostock
Copyright 2017 Mike Bostock.
--------------------------------- (separator) ----------------------------------
== Dependency
d3-selection
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-shape
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2015 Mike Bostock
Copyright 2019 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-time-format
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2017 Mike Bostock
Copyright 2020 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-time
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2010-2016 Mike Bostock
Copyright 2019 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-timer
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-transition
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d3-zoom
== License Type
SPDX:ISC
== Copyright
Copyright 2010-2021 Mike Bostock
--------------------------------- (separator) ----------------------------------
== Dependency
d
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2013-2019, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
dashboard_listing_test_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
dashify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jon Schlinkert
Copyright (c) 2015 Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
data-view-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
data-view-byte-length
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
data-view-byte-offset
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
data_search_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
debug
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2014-2017 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2018-2021 Josh Junon
--------------------------------- (separator) ----------------------------------
== Dependency
decamelize
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
decimal.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Michael Mclaughlin
Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
decode-uri-component
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Sam Verschueren <sam.verschueren@gmail.com> (github.com/SamVerschueren)
--------------------------------- (separator) ----------------------------------
== Dependency
dedent
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Desmond Brand (dmnd@desmondbrand.com)
--------------------------------- (separator) ----------------------------------
== Dependency
deep-freeze-strict
== License Type
This software is released to the public domain.
It is based in part on the deepFreeze function from:
https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Global_Objects/Object/freeze
https://developer.mozilla.org/en-US/docs/Project:Copyrights
== Copyright
James Friend (james@jsdf.co)
--------------------------------- (separator) ----------------------------------
== Dependency
deep-is
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2009 Thomas Robinson <280north.com>
Copyright (c) 2012 James Halliday <mail@substack.net>
Copyright (c) 2012, 2013 Thorsten Lorenz <thlorenz@gmx.de>
--------------------------------- (separator) ----------------------------------
== Dependency
deepmerge
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 James Halliday, Josh Duff, and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
default-browser-id
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
define-data-property
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
define-lazy-prop
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
define-properties
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
define-property
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
del
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
delayed-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Debuggable Limited <felix@debuggable.com>
--------------------------------- (separator) ----------------------------------
== Dependency
delegates
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 TJ Holowaychuk <tj@vision-media.ca>
--------------------------------- (separator) ----------------------------------
== Dependency
depd
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
des.js
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2015.
--------------------------------- (separator) ----------------------------------
== Dependency
destroy
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong me@jongleberry.com
Copyright (c) 2015-2022 Douglas Christopher Wilson doug@somethingdoug.com
--------------------------------- (separator) ----------------------------------
== Dependency
detab
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
detect-libc
== License Type
SPDX:Apache-2.0
== Copyright
--------------------------------- (separator) ----------------------------------
== Dependency
detect-node-es
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Ilya Kantor
--------------------------------- (separator) ----------------------------------
== Dependency
detect-package-manager
== License Type
SPDX:MIT
== Copyright
Copyright (c) EGOIST <0x142857@gmail.com> (https://github.com/egoist)
--------------------------------- (separator) ----------------------------------
== Dependency
detect-port
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 - present node-modules and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
diff-match-patch
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2018 The diff-match-patch Authors.
--------------------------------- (separator) ----------------------------------
== Dependency
diff-sequences
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
diffie-hellman
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Calvin Metcalf
--------------------------------- (separator) ----------------------------------
== Dependency
dir-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) Kevin Mårtensson <kevinmartensson@gmail.com> (github.com/kevva)
--------------------------------- (separator) ----------------------------------
== Dependency
dns-sync
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 skoranga
--------------------------------- (separator) ----------------------------------
== Dependency
docViewLinksPlugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
docViewPlugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
doctrine
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (C) 2012, 2011 [Ariya Hidayat](http://ariya.ofilabs.com/about)
--------------------------------- (separator) ----------------------------------
== Dependency
dom-converter
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Aria Minaei
--------------------------------- (separator) ----------------------------------
== Dependency
dom-helpers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jason Quense
Copyright 2013-2014, Facebook, Inc.
Copyright 2014-2015, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
dom-serializer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 The cheeriojs contributors
--------------------------------- (separator) ----------------------------------
== Dependency
dom-walk
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Raynos.
--------------------------------- (separator) ----------------------------------
== Dependency
domain-browser
== License Type
SPDX:MIT
== Copyright
Copyright © 2013+ Bevry Pty Ltd
--------------------------------- (separator) ----------------------------------
== Dependency
domelementtype
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
domhandler
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
domutils
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
dot-case
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
dotenv-expand
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2016, Scott Motte
--------------------------------- (separator) ----------------------------------
== Dependency
dotenv
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2015, Scott Motte
--------------------------------- (separator) ----------------------------------
== Dependency
dunder-proto
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
duplexify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
ee-first
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong me@jongleberry.com
--------------------------------- (separator) ----------------------------------
== Dependency
ejs
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2112 Matthew Eernisse (mde@fleegix.org)
--------------------------------- (separator) ----------------------------------
== Dependency
elastic-apm-node
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2012, Matt Robenolt
Copyright (c) 2013-2014, Thomas Watson Steen and Elasticsearch B.V.
Copyright (c) 2013-2019, Forrest L Norvell
Copyright (c) 2015-2023, Elasticsearch B.V.
Copyright (c) 2017 Espen Hovlandsdal
Copyright (c) 2018 Mathias Buus
Copyright (c) 2018 Stephen Belanger
Copyright (c) 2020 Evan Wallace
Copyright 2011-2022 Elasticsearch B.V.
== Notices
apm-agent-nodejs
Copyright 2011-2022 Elasticsearch B.V.
# Notice
This project contains several dependencies which have been vendored in
due to a need for minor changes. Where possible changes have been
contributed back to the original project.
## container-info
- **path:** [lib/container-info.js](lib/container-info.js)
- **author:** Stephen Belanger
- **project url:** https://github.com/Qard/container-info
- **original file:** https://github.com/Qard/container-info/blob/master/index.js
- **license:** MIT License (MIT), http://opensource.org/licenses/MIT
```
### Copyright (c) 2018 Stephen Belanger
#### Licensed under MIT License
```
## shimmer
- **path:** [lib/instrumentation/shimmer.js](lib/instrumentation/shimmer.js)
- **author:** Forrest L Norvell
- **project url:** https://github.com/othiym23/shimmer
- **original file:** https://github.com/othiym23/shimmer/blob/master/index.js
- **license:** BSD-2-Clause, http://opensource.org/licenses/BSD-2-Clause
```
Copyright (c) 2013-2019, Forrest L Norvell
All rights reserved.
```
## process-top
- **path:** [lib/metrics/platforms/generic/process-top.js](lib/metrics/platforms/generic/process-top.js)
- **author:** Mathias Buus
- **project url:** https://github.com/mafintosh/process-top
- **original file:** https://github.com/mafintosh/process-top/blob/master/index.js
- **license:** MIT License (MIT), http://opensource.org/licenses/MIT
```
Copyright (c) 2018 Mathias Buus
```
## opentelemetry-js
- **path:** [lib/instrumentation/run-context/](lib/instrumentation/run-context/)
- **author:** OpenTelemetry Authors
- **project url:** https://github.com/open-telemetry/opentelemetry-js
- **original file:** https://github.com/open-telemetry/opentelemetry-js/tree/main/packages/opentelemetry-context-async-hooks/src
- **license:** Apache License 2.0, https://github.com/open-telemetry/opentelemetry-js/blob/main/packages/opentelemetry-context-async-hooks/LICENSE
Parts of "lib/instrumentation/run-context" have been adapted from or influenced
by TypeScript code in `@opentelemetry/context-async-hooks`.
- **path:** [lib/opentelemetry-bridge/otelutils.js](lib/opentelemetry-bridge/otelutils.js)
- **author:** OpenTelemetry Authors
- **project url:** https://github.com/open-telemetry/opentelemetry-js
- **original file:** https://github.com/open-telemetry/opentelemetry-js/tree/main/packages/opentelemetry-core/src/common/time.ts
- **license:** Apache License 2.0, https://github.com/open-telemetry/opentelemetry-js/blob/main/packages/opentelemetry-core/LICENSE
"lib/opentelemetry-bridge/opentelemetry-core-mini/" includes files adapted from
code in `@opentelemetry/core`.
- **path:** [lib/opentelemetry-bridge/opentelemetry-core-mini/](lib/opentelemetry-bridge/opentelemetry-core-mini/)
- **author:** OpenTelemetry Authors
- **project url:** https://github.com/open-telemetry/opentelemetry-js
- **original file:** https://github.com/open-telemetry/opentelemetry-js/tree/main/packages/opentelemetry-core/src/
- **license:** Apache License 2.0, https://github.com/open-telemetry/opentelemetry-js/blob/main/packages/opentelemetry-core/LICENSE
```
Apache License
```
## load-source-map
- **path:** [lib/load-source-map.js](lib/load-source-map.js)
- **author:** Espen Hovlandsdal
- **project url:** https://github.com/rexxars/load-source-map
- **original file:** https://github.com/rexxars/load-source-map/blob/v2.0.0/lib/index.js
- **license:** MIT License (MIT), http://opensource.org/licenses/MIT
```
The MIT License (MIT)
Copyright (c) 2017 Espen Hovlandsdal
```
## esbuild
A small part of esbuild's runtime JS code is used in this project's
"lib/propwrap.js" module.
- **path:** [lib/propwrap.js](lib/propwrap.js)
- **author:** Evan Wallace
- **project url:** https://github.com/evanw/esbuild
- **original file:** https://github.com/evanw/esbuild/blob/v0.14.42/internal/runtime/runtime.go
- **license:** MIT License (MIT), http://opensource.org/licenses/MIT
```
MIT License
Copyright (c) 2020 Evan Wallace
```
## @types/aws-lambda
A subset of `@types/aws-lambda` is vendored to support this project's TypeScript
types without required users to install the extra dependency.
- **path:** [types/aws-lambda.d.ts](types/aws-lambda.d.ts)
- **project url:** https://github.com/DefinitelyTyped/DefinitelyTyped
- **original file:** https://github.com/DefinitelyTyped/DefinitelyTyped/blob/master/types/aws-lambda/handler.d.ts
- **license:** MIT License (MIT), http://opensource.org/licenses/MIT
```
This project is licensed under the MIT license.
Copyrights are respective of each contributor listed at the beginning of each definition file.
```
## Node.js
- **path:** [lib/async-hooks-polyfill.js](lib/async-hooks-polyfill.js)
- **project url:** https://github.com/nodejs/node
- **original file:** https://github.com/nodejs/node/blob/v17.8.0/lib/async_hooks.js
- **license:** Node.js license
```
Copyright Node.js contributors. All rights reserved.
```
--------------------------------- (separator) ----------------------------------
== Dependency
elasticsearch
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2013 Elasticsearch BV
--------------------------------- (separator) ----------------------------------
== Dependency
electron-to-chromium
== License Type
SPDX:ISC
== Copyright
Copyright 2018 Kilian Valkhof
--------------------------------- (separator) ----------------------------------
== Dependency
elliptic
== License Type
SPDX:MIT
== Copyright
Fedor Indutny <fedor@indutny.com>
--------------------------------- (separator) ----------------------------------
== Dependency
emoji-regex
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
emojis-list
== License Type
SPDX:MIT
== Copyright
Copyright © 2015 Kiko Beats
--------------------------------- (separator) ----------------------------------
== Dependency
emoticon
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
encodeurl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
end-of-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
enhanced-resolve
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2016 Tobias Koppers
--------------------------------- (separator) ----------------------------------
== Dependency
entities
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
errno
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2015 [Rod Vagg](https://github.com/rvagg) ([@rvagg](https://twitter.com/rvagg))*
--------------------------------- (separator) ----------------------------------
== Dependency
error-callsites
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2020 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
error-ex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 JD Ballard
--------------------------------- (separator) ----------------------------------
== Dependency
error-stack-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Eric Wendelin and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
es-abstract
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-array-method-boxes-properly
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-define-property
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-errors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-get-iterator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-module-lexer
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2020 by various contributors (see AUTHORS)
Copyright (C) 2018-2022 Guy Bedford
--------------------------------- (separator) ----------------------------------
== Dependency
es-object-atoms
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-set-tostringtag
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
es-shim-unscopables
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es-to-primitive
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
es5-ext
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2008 Matsuza
Copyright (c) 2011-2024, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
es5-shim
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2009-2016 Kristopher Michael Kowal and contributors
Copyright 2009-2020 by contributors, MIT License
--------------------------------- (separator) ----------------------------------
== Dependency
es6-iterator
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2013-2017 Mariusz Nowak (www.medikoo.com)
--------------------------------- (separator) ----------------------------------
== Dependency
es6-promise
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Yehuda Katz, Tom Dale, Stefan Penner and contributors
Copyright (c) 2014 Yehuda Katz, Tom Dale, Stefan Penner and contributors (Conversion to ES6 API by Jake Archibald)
--------------------------------- (separator) ----------------------------------
== Dependency
es6-promisify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mike Hall
--------------------------------- (separator) ----------------------------------
== Dependency
es6-shim
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Paul Miller (https://paulmillr.com)
Copyright 2013-2016 by Paul Miller (http://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
es6-symbol
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2013-2019, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
escalade
== License Type
SPDX:MIT
== Copyright
Copyright (c) Luke Edwards <luke.edwards05@gmail.com> (lukeed.com)
--------------------------------- (separator) ----------------------------------
== Dependency
escape-html
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2013 TJ Holowaychuk
Copyright (c) 2015 Andreas Lubbe
Copyright (c) 2015 Tiancheng "Timothy" Gu
--------------------------------- (separator) ----------------------------------
== Dependency
escape-latex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Dang Mai
--------------------------------- (separator) ----------------------------------
== Dependency
escape-string-regexp
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
escodegen
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (C) 2011-2012 Ariya Hidayat <ariya.hidayat@gmail.com>
Copyright (C) 2012 Arpad Borsos <arpad.borsos@googlemail.com>
Copyright (C) 2012 John Freeman <jfreeman08@gmail.com>
Copyright (C) 2012 Joost-Wim Boekesteijn <joost-wim@boekesteijn.nl>
Copyright (C) 2012 Kris Kowal <kris.kowal@cixar.com>
Copyright (C) 2012 Robert Gust-Bardon <donate@robert.gust-bardon.org>
Copyright (C) 2012 Yusuke Suzuki (twitter: @Constellation) and other contributors.
Copyright (C) 2012 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2012 [Yusuke Suzuki](http://github.com/Constellation)
Copyright (C) 2012-2013 Mathias Bynens <mathias@qiwi.be>
Copyright (C) 2012-2013 Michael Ficarra <escodegen.copyright@michael.ficarra.me>
Copyright (C) 2012-2014 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2013 Irakli Gozalishvili <rfobic@gmail.com>
Copyright (C) 2014 Ivan Nikulin <ifaaan@gmail.com>
Copyright (C) 2015 Ingvar Stepanyan <me@rreverser.com>
--------------------------------- (separator) ----------------------------------
== Dependency
eslint-import-resolver-node
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Ben Mosher
--------------------------------- (separator) ----------------------------------
== Dependency
eslint-import-resolver-webpack
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Ben Mosher
--------------------------------- (separator) ----------------------------------
== Dependency
eslint-module-utils
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Ben Mosher
--------------------------------- (separator) ----------------------------------
== Dependency
eslint-scope
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (C) 2012-2013 Yusuke Suzuki (twitter: @Constellation) and other contributors.
Copyright (C) 2012-2014 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2013 Alex Seville <hi@alexanderseville.com>
Copyright (C) 2014 Thiago de Arruda <tpadilha84@gmail.com>
Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
esniff
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2013-2024, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
esprima
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright JS Foundation and other contributors, https://js.foundation/
--------------------------------- (separator) ----------------------------------
== Dependency
esrecurse
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2014 [Yusuke Suzuki](https://github.com/Constellation)
--------------------------------- (separator) ----------------------------------
== Dependency
estraverse
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (C) 2012 Ariya Hidayat <ariya.hidayat@gmail.com>
Copyright (C) 2012-2013 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2012-2016 [Yusuke Suzuki](http://github.com/Constellation)
Copyright (C) 2014 Yusuke Suzuki <utatane.tea@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
estree-to-babel
== License Type
SPDX:MIT
== Copyright
Copyright (c) coderaiser
--------------------------------- (separator) ----------------------------------
== Dependency
esutils
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (C) 2013 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2013 [Yusuke Suzuki](http://github.com/Constellation)
Copyright (C) 2013-2014 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2014 Ivan Nikulin <ifaaan@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
etag
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2016 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
event-emitter
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2015 Mariusz Nowak (www.medikoo.com)
--------------------------------- (separator) ----------------------------------
== Dependency
event-target-shim
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Toru Nagashima
copyright 2015 Toru Nagashima. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
events
== License Type
SPDX:MIT
== Copyright
Copyright Joyent, Inc. and other Node contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
evp_bytestokey
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify contributors
--------------------------------- (separator) ----------------------------------
== Dependency
exec-sh
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Aleksandr Tsertkov <tsertkov@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
execa
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
exit-hook
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
expand-brackets
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2016, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
expiry-js
== License Type
SPDX:MIT
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
express
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2009-2014 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2013-2014 Roman Shtylman <shtylman+expressjs@gmail.com>
Copyright (c) 2014-2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
ext
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2011-2019, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
extend-shallow
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
extend
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Stefan Thomas
--------------------------------- (separator) ----------------------------------
== Dependency
external-editor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Kevin Gravier
Copyright (c) 2016-2018 Kevin Gravier
--------------------------------- (separator) ----------------------------------
== Dependency
extglob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
fast-csv
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2019 C2FO
--------------------------------- (separator) ----------------------------------
== Dependency
fast-deep-equal
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
fast-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) Denis Malinochkin
--------------------------------- (separator) ----------------------------------
== Dependency
fast-json-parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Matteo Collina
--------------------------------- (separator) ----------------------------------
== Dependency
fast-json-stable-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday
Copyright (c) 2017 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
fast-levenshtein
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 [Ramesh Nair](http://www.hiddentao.com/)
--------------------------------- (separator) ----------------------------------
== Dependency
fast-redact
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019-2020 David Mark Clements
--------------------------------- (separator) ----------------------------------
== Dependency
fast-safe-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 David Mark Clements
Copyright (c) 2017 David Mark Clements & Matteo Collina
Copyright (c) 2018 David Mark Clements, Matteo Collina & Ruben Bridgewater
--------------------------------- (separator) ----------------------------------
== Dependency
fast-shallow-equal
== License Type
SPDX:Unlicense
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
fast-stream-to-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
fast-uri
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2011-2021, Gary Court until https://github.com/garycourt/uri-js/commit/a1acf730b4bba3f1097c9f52e7d9d3aba8cdcaae
Copyright (c) 2021 The Fastify Team
Copyright 2011 Gary Court. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
fast-xml-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Amit Kumar Gupta
Copyright 2013 Timothy J Fontaine <tjfontaine@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
fastest-stable-stringify
== License Type
SPDX:MIT
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
fastq
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015-2020, Matteo Collina <matteo.collina@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
fb-watchman
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2014-present Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
fd-slicer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Andrew Kelley
--------------------------------- (separator) ----------------------------------
== Dependency
fetch-retry
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jon K. Bernhardsen
--------------------------------- (separator) ----------------------------------
== Dependency
figgy-pudding
== License Type
SPDX:ISC
== Copyright
Copyright (c) npm, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
figures
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
file-saver
== License Type
SPDX:MIT
== Copyright
Copyright © 2016 [Eli Grey][1].
--------------------------------- (separator) ----------------------------------
== Dependency
file-selector
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Roland Groza
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
file-system-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Phil Cockfield <phil@cockfield.net> (https://github.com/philcockfield)
--------------------------------- (separator) ----------------------------------
== Dependency
file-uri-to-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Nathan Rajlich <nathan@tootallnate.net>
Copyright (c) 2014 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
filelist
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2112 Matthew Eernisse (mde@fleegix.org)
--------------------------------- (separator) ----------------------------------
== Dependency
fill-range
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, 2017, Jon Schlinkert.
Copyright (c) 2014-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
filter-obj
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
finalhandler
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2022 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
find-babel-config
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Tommy Leunen <tommy.leunen@gmail.com> (tommyleunen.com)
--------------------------------- (separator) ----------------------------------
== Dependency
find-cache-dir
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
find-root
== License Type
SPDX:MIT
== Copyright
Copyright © 2017 jsdnxx
--------------------------------- (separator) ----------------------------------
== Dependency
find-up
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
flat-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Roy Riojas
--------------------------------- (separator) ----------------------------------
== Dependency
flatted
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2018-2020, Andrea Giammarchi, @WebReflection
--------------------------------- (separator) ----------------------------------
== Dependency
flush-write-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
focus-lock
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton
--------------------------------- (separator) ----------------------------------
== Dependency
follow-redirects
== License Type
SPDX:MIT
== Copyright
Copyright 2014–present Olivier Lalonde <olalonde@gmail.com>, James Talmage <james@talmage.io>, Ruben Verborgh
--------------------------------- (separator) ----------------------------------
== Dependency
font-awesome
== License Type
=== MIT
Fonticons, Inc. (https://fontawesome.com)
--------------------------------------------------------------------------------
Font Awesome Free License
Font Awesome Free is free, open source, and GPL friendly. You can use it for
commercial projects, open source projects, or really almost whatever you want.
Full Font Awesome Free license: https://fontawesome.com/license/free.
--------------------------------------------------------------------------------
# Icons: CC BY 4.0 License (https://creativecommons.org/licenses/by/4.0/)
The Font Awesome Free download is licensed under a Creative Commons
Attribution 4.0 International License and applies to all icons packaged
as SVG and JS file types.
--------------------------------------------------------------------------------
# Fonts: SIL OFL 1.1 License
In the Font Awesome Free download, the SIL OFL license applies to all icons
packaged as web and desktop font files.
Copyright (c) 2024 Fonticons, Inc. (https://fontawesome.com)
with Reserved Font Name: "Font Awesome".
--------------------------------------------------------------------------------
# Code: MIT License (https://opensource.org/licenses/MIT)
In the Font Awesome Free download, the MIT license applies to all non-font and
non-icon files.
Copyright 2024 Fonticons, Inc.
--------------------------------------------------------------------------------
# Attribution
Attribution is required by MIT, SIL OFL, and CC BY licenses. Downloaded Font
Awesome Free files already contain embedded comments with sufficient
attribution, so you shouldn't need to do anything additional when using these
files normally.
We've kept attribution comments terse, so we ask that you do not actively work
to remove them from files, especially code. They're a great way for folks to
learn about Font Awesome.
--------------------------------------------------------------------------------
# Brand Icons
All brand icons are trademarks of their respective owners. The use of these
trademarks does not indicate endorsement of the trademark holder by Font
Awesome, nor vice versa. **Please do not use brand logos for any purpose except
to represent the company, product, or service to which they refer.**
== Copyright
Copyright (c) 2024 Fonticons, Inc. (https://fontawesome.com)
Copyright 2024 Fonticons, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
for-each
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Raynos.
--------------------------------- (separator) ----------------------------------
== Dependency
for-in
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
foreground-child
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
fork-ts-checker-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 TypeStrong
--------------------------------- (separator) ----------------------------------
== Dependency
form-data
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Felix Geisendörfer (felix@debuggable.com) and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
forwarded-parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Luigi Pinca
--------------------------------- (separator) ----------------------------------
== Dependency
forwarded
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
fp-ts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-present Giulio Canti
--------------------------------- (separator) ----------------------------------
== Dependency
fraction.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2019, [Robert Eisele](https://www.xarg.org/)
Copyright (c) 2017 Robert Eisele
Copyright (c) 2021, Robert Eisele (robert@xarg.org)
--------------------------------- (separator) ----------------------------------
== Dependency
fragment-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2017, Jon Schlinkert
Copyright (c) 2016-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
fresh
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2016-2017 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
from2
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Hugh Kennedy
--------------------------------- (separator) ----------------------------------
== Dependency
fs-constants
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
fs-extra
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2017 JP Richardson
Copyright (c) 2011-2017 [JP Richardson](https://github.com/jprichardson)
Copyright (c) 2014-2016 Jonathan Ong me@jongleberry.com and Contributors
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
fs-minipass
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
fs-mkdirp-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors (Originally based on code from node-mkdirp - MIT/X11 license - Copyright 2010 James Halliday)
Copyright 2010 James Halliday) with heavy modification to better support custom modes.
--------------------------------- (separator) ----------------------------------
== Dependency
fs-readdir-recursive
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong me@jongleberry.com
--------------------------------- (separator) ----------------------------------
== Dependency
fs-write-stream-atomic
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
fs.realpath
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
fsevents
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2010-2020 by Philipp Dunkel, Ben Noordhuis, Elan Shankar, Paul Miller
Copyright (C) 2010-2020 by Philipp Dunkel, Ben Noordhuis, Elan Shankar, Paul Miller — see LICENSE file.
--------------------------------- (separator) ----------------------------------
== Dependency
function-bind
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Raynos.
--------------------------------- (separator) ----------------------------------
== Dependency
function.prototype.name
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
functions-have-names
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
gauge
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2014, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
gensync
== License Type
SPDX:MIT
== Copyright
Copyright 2018 Logan Smyth <loganfsmyth@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
get-caller-file
== License Type
SPDX:ISC
== Copyright
Copyright 2018 Stefan Penner
--------------------------------- (separator) ----------------------------------
== Dependency
get-intrinsic
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
get-nonce
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Anton Korzunov
--------------------------------- (separator) ----------------------------------
== Dependency
get-package-type
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 CFWare, LLC
--------------------------------- (separator) ----------------------------------
== Dependency
get-proto
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2025 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
get-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
get-symbol-description
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
get-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright (c) 2014-2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
getopts
== License Type
SPDX:MIT
== Copyright
Copyright © Jorge Bucaran <<https://jorgebucaran.com>>
--------------------------------- (separator) ----------------------------------
== Dependency
getos
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 William Blankenship
--------------------------------- (separator) ----------------------------------
== Dependency
github-slugger
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Dan Flettre <fletd01@yahoo.com>
--------------------------------- (separator) ----------------------------------
== Dependency
glob-all
== License Type
SPDX:MIT
== Copyright
Copyright © 2014 Jaime Pillora <dev@jpillora.com>
--------------------------------- (separator) ----------------------------------
== Dependency
glob-parent
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015 Elan Shanker
--------------------------------- (separator) ----------------------------------
== Dependency
glob-promise
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Ahmad Nassri <ahmad@ahmadnassri.com>
--------------------------------- (separator) ----------------------------------
== Dependency
glob-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
glob-to-regexp
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2013, Nick Fitzgerald
--------------------------------- (separator) ----------------------------------
== Dependency
glob
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
global
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Colingo.
--------------------------------- (separator) ----------------------------------
== Dependency
globals
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
globalthis
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
globby
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
gopd
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
graceful-fs
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2011-2022 Isaac Z. Schlueter, Ben Noordhuis, and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
gulp-zip
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
handlebars
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2011-2019 by Yehuda Katz
--------------------------------- (separator) ----------------------------------
== Dependency
has-ansi
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
has-bigints
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
has-flag
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
has-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright (c) 2015-2016, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
has-property-descriptors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
has-proto
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
has-symbols
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
has-tostringtag
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
has-unicode
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2014, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
has-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
has-values
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, 2017, Jon Schlinkert.
Copyright (c) 2014-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
hash-base
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Kirill Fomichev
--------------------------------- (separator) ----------------------------------
== Dependency
hash.js
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2014.
--------------------------------- (separator) ----------------------------------
== Dependency
hasown
== License Type
SPDX:MIT
== Copyright
Copyright (c) Jordan Harband and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
hast-to-hyperscript
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-from-parse5
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-has-property
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-heading-rank
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-is-element
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-parse-selector
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-raw
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-to-html
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-to-parse5
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-to-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer
--------------------------------- (separator) ----------------------------------
== Dependency
hast-util-whitespace
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hastscript
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
he
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
history
== License Type
SPDX:MIT
== Copyright
Copyright (c) React Training 2016-2018
--------------------------------- (separator) ----------------------------------
== Dependency
hjson
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Christian Zangl
Copyright 2014-2017 Christian Zangl, MIT license
--------------------------------- (separator) ----------------------------------
== Dependency
hmac-drbg
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2017.
--------------------------------- (separator) ----------------------------------
== Dependency
hoek
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2011, Yahoo Inc.
Copyright (c) 2011-2014, Walmart
Copyright (c) 2011-2018, Project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
hoist-non-react-statics
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2015, Yahoo! Inc. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
hosted-git-info
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Rebecca Turner
--------------------------------- (separator) ----------------------------------
== Dependency
hpagent
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Tomas Della Vedova
--------------------------------- (separator) ----------------------------------
== Dependency
html-entities
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Dulin Marat
--------------------------------- (separator) ----------------------------------
== Dependency
html-escaper
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2017-present by Andrea Giammarchi - @WebReflection
--------------------------------- (separator) ----------------------------------
== Dependency
html-minifier-terser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010-2019 Juriy "kangax" Zaytsev
Copyright (c) 2014-2016 Zoltan Frombach
--------------------------------- (separator) ----------------------------------
== Dependency
html-tags
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
html-void-elements
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
htmlparser2
== License Type
SPDX:MIT
== Copyright
--------------------------------- (separator) ----------------------------------
== Dependency
http-aws-es
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017 Geoff Wagstaff
--------------------------------- (separator) ----------------------------------
== Dependency
http-errors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong me@jongleberry.com
Copyright (c) 2016 Douglas Christopher Wilson doug@somethingdoug.com
--------------------------------- (separator) ----------------------------------
== Dependency
http-headers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
http-proxy-agent
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
https-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) James Halliday
--------------------------------- (separator) ----------------------------------
== Dependency
https-proxy-agent
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
human-signals
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 ehmicky <ehmicky@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
humanize-ms
== License Type
SPDX:MIT
== Copyright
Copyright(c) 2014 dead_horse <dead_horse@qq.com>
--------------------------------- (separator) ----------------------------------
== Dependency
hyphenate-style-name
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2015, Espen Hovlandsdal
--------------------------------- (separator) ----------------------------------
== Dependency
iconv-lite
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Alexander Shtuchkin
Copyright (c) Microsoft Corporation. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
icss-utils
== License Type
SPDX:ISC
== Copyright
Copyright 2018 Glen Maddern
--------------------------------- (separator) ----------------------------------
== Dependency
ieee754
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2008, Fair Oaks Labs, Inc.
Copyright 2008 Fair Oaks Labs, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
iferr
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Nadav Ivgi
--------------------------------- (separator) ----------------------------------
== Dependency
ignore
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Kael Zhang <i@kael.me>, contributors
--------------------------------- (separator) ----------------------------------
== Dependency
immer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Michel Weststrate
--------------------------------- (separator) ----------------------------------
== Dependency
import-fresh
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
import-in-the-middle
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2017, Contributors"
Copyright (c) 2019 Bryan English.
Copyright 2016 Thomas Watson Steen
Copyright 2021 Datadog, Inc.
Copyright 2024 Datadog, Inc.
Copyright 2024 Node.js contributors. All rights reserved.
== Notices
import-in-the-middle is licensed for use as follows:
Copyright 2024 Node.js contributors. All rights reserved.
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.
This license applies to parts of import-in-the-middle originating from the
https://github.com/DataDog/import-in-the-middle repository:
This product includes software developed at Datadog (https://www.datadoghq.com/).
Copyright 2021 Datadog, Inc.
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.
--------------------------------- (separator) ----------------------------------
== Dependency
imurmurhash
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Gary Court, Jens Taylor
--------------------------------- (separator) ----------------------------------
== Dependency
indent-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
index_patterns_test_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
infer-owner
== License Type
SPDX:ISC
== Copyright
Copyright (c) npm, Inc. and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
inflight
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter
--------------------------------- (separator) ----------------------------------
== Dependency
inherits
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter
--------------------------------- (separator) ----------------------------------
== Dependency
inline-style-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>
--------------------------------- (separator) ----------------------------------
== Dependency
inline-style-prefixer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Robin Frischmann
--------------------------------- (separator) ----------------------------------
== Dependency
inline-style
== License Type
SPDX:MIT
== Copyright
Copyright (c) Ellen Gummesson
--------------------------------- (separator) ----------------------------------
== Dependency
inquirer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Simon Boudrias
Copyright (c) 2016 Simon Boudrias (twitter: [@vaxilart](https://twitter.com/Vaxilart))
--------------------------------- (separator) ----------------------------------
== Dependency
internal-slot
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
interpret
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018 Tyler Kellen <tyler@sleekcode.net>, Blaine Bublitz <blaine.bublitz@gmail.com>, and Eric Schoffstall <yo@contra.io>
--------------------------------- (separator) ----------------------------------
== Dependency
intl-format-cache
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Yahoo! Inc. All rights reserved.
Copyright 2014 Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
intl-messageformat-parser
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2014 Alex Sexton
Copyright 2014 Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
intl-messageformat
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012, Andreas Lind Petersen
Copyright (c) 2014, Yahoo! Inc. All rights reserved.
Copyright 2013 Andy Earnshaw, MIT License
Copyright 2013 Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
intl-relativeformat
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012, Andreas Lind Petersen
Copyright (c) 2014, Yahoo! Inc. All rights reserved.
Copyright 2013 Andy Earnshaw, MIT License
Copyright 2014 Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
invariant
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
ip-address
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2011 by Beau Gunderson
--------------------------------- (separator) ----------------------------------
== Dependency
ip-cidr
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2005 Tom Wu
Copyright (c) 2005-2009 Tom Wu
--------------------------------- (separator) ----------------------------------
== Dependency
ipaddr.js
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2011-2017 whitequark <whitequark@whitequark.org>
--------------------------------- (separator) ----------------------------------
== Dependency
is-absolute-url
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-absolute
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2009-2014, TJ Holowaychuk
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-accessor-descriptor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-alphabetical
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-alphanumerical
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-arguments
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-array-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Chen Gengyuan, Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-arrayish
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 JD Ballard
--------------------------------- (separator) ----------------------------------
== Dependency
is-async-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-bigint
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-binary-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com), Paul Miller (https://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-boolean-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (C) [Feross Aboukhadijeh](http://feross.org).
Copyright (c) Feross Aboukhadijeh
--------------------------------- (separator) ----------------------------------
== Dependency
is-callable
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-ci
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2018 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
is-core-module
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Dave Justice
--------------------------------- (separator) ----------------------------------
== Dependency
is-data-descriptor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-data-view
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-date-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-decimal
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-descriptor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-docker
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-dom
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014
--------------------------------- (separator) ----------------------------------
== Dependency
is-extendable
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
is-extglob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2016, Jon Schlinkert
Copyright (c) 2014-2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-finalizationregistry
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-finite
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-fullwidth-code-point
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Stephen Sugden
--------------------------------- (separator) ----------------------------------
== Dependency
is-generator-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-hexadecimal
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-integer
== License Type
SPDX:WTFPL
== Copyright
Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
Copyright (C) 2004 Sam Hocevar \<sam@hocevar.net>
--------------------------------- (separator) ----------------------------------
== Dependency
is-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-negated-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
is-negative-zero
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-number-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-number
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright (c) 2014-2016, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
is-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Colingo.
--------------------------------- (separator) ----------------------------------
== Dependency
is-path-cwd
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-path-in-cwd
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-path-inside
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-plain-obj
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-plain-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-primitive
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-relative
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-set
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-shared-array-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
is-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-symbol
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-typed-array
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-typedarray
== License Type
SPDX:MIT
== Copyright
Hugh Kennedy <hughskennedy@gmail.com> (http://hughsk.io/)
--------------------------------- (separator) ----------------------------------
== Dependency
is-unc-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-utf8
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2014 Wei Fanzhe
--------------------------------- (separator) ----------------------------------
== Dependency
is-valid-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
is-weakmap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-weakref
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-weakset
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-whitespace-character
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-window
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 W.Y.
--------------------------------- (separator) ----------------------------------
== Dependency
is-windows
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2018, Jon Schlinkert.
Copyright © 2015-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
is-word-character
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-wsl
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
isarray
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Julian Gruber <julian@juliangruber.com>
--------------------------------- (separator) ----------------------------------
== Dependency
isemail
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2008-2011, Dominic Sayers
Copyright (c) 2013-2014, GlobeSherpa
Copyright (c) 2014-2015, Eli Skeggs and Project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
isexe
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
isobject
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
istanbul-lib-coverage
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2012-2015 Yahoo! Inc.
Copyright 2012-2015, Yahoo Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
istanbul-lib-instrument
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2012-2015 Yahoo! Inc.
Copyright 2012-2015, Yahoo Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
istanbul-lib-report
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright 2012-2015 Yahoo! Inc.
Copyright 2012-2015, Yahoo Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
istanbul-reports
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright 2012-2015 Yahoo! Inc.
Copyright 2012-2015, Yahoo Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
iterate-iterator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
iterate-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
jake
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2112 Matthew Eernisse (mde@fleegix.org)
--------------------------------- (separator) ----------------------------------
== Dependency
javascript-natural-sort
== License Type
SPDX:MIT
== Copyright
Jim Palmer (jimpalmer@gmail.com)
--------------------------------- (separator) ----------------------------------
== Dependency
jest-diff
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
Copyright 2018 The diff-match-patch Authors.
--------------------------------- (separator) ----------------------------------
== Dependency
jest-get-type
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
jest-haste-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
jest-regex-util
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
jest-serializer
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
jest-styled-components
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 - present Michele Bertoli
--------------------------------- (separator) ----------------------------------
== Dependency
jest-util
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
jest-worker
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
joi
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart
Copyright (c) 2012-2018, Project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
jquery
== License Type
SPDX:MIT
== Copyright
Copyright OpenJS Foundation and other contributors, https://openjsf.org
--------------------------------- (separator) ----------------------------------
== Dependency
js-cookie
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Copyright 2018 Klaus Hartl, Fagner Brack, GitHub Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
js-string-escape
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Jo Liss
--------------------------------- (separator) ----------------------------------
== Dependency
js-tokens
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014, 2015, 2016, 2017, 2018 Simon Lydell
--------------------------------- (separator) ----------------------------------
== Dependency
js-yaml
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2011-2015 by Vitaly Puzrin
--------------------------------- (separator) ----------------------------------
== Dependency
jsbn
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2003-2005 Tom Wu
Copyright (c) 2005 Tom Wu
Copyright (c) 2005-2009 Tom Wu
--------------------------------- (separator) ----------------------------------
== Dependency
jsesc
== License Type
SPDX:MIT
== Copyright
{'name': 'Mathias Bynens', 'url': 'https://mathiasbynens.be/'}
--------------------------------- (separator) ----------------------------------
== Dependency
json-bigint
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Andrey Sidorov
--------------------------------- (separator) ----------------------------------
== Dependency
json-parse-better-errors
== License Type
SPDX:MIT
== Copyright
Copyright 2017 Kat Marchán
--------------------------------- (separator) ----------------------------------
== Dependency
json-parse-even-better-errors
== License Type
SPDX:MIT
== Copyright
Copyright 2017 Kat Marchán
--------------------------------- (separator) ----------------------------------
== Dependency
json-schema-traverse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
json-stable-stringify-without-jsonify
== License Type
SPDX:MIT
== Copyright
James Halliday <email : mail@substack.net>
--------------------------------- (separator) ----------------------------------
== Dependency
json-stable-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 contributors
--------------------------------- (separator) ----------------------------------
== Dependency
json-stringify-safe
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
json11
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 AMoo-Miki, 2012-2018 Aseem Kishore, and [others].
--------------------------------- (separator) ----------------------------------
== Dependency
json5
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2018 Aseem Kishore, and [others].
--------------------------------- (separator) ----------------------------------
== Dependency
jsonfile
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2015, JP Richardson <jprichardson@gmail.com>
Copyright 2012-2016, JP Richardson <jprichardson@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
jsonify
== License Type
SPDX:Public Domain
== Copyright
{'name': 'Douglas Crockford', 'url': 'http://crockford.com/'}
--------------------------------- (separator) ----------------------------------
== Dependency
jsonparse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2012 Tim Caswell
Copyright (c) 2012 Tim Caswell
--------------------------------- (separator) ----------------------------------
== Dependency
junk
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
kind-of
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
kleur
== License Type
SPDX:MIT
== Copyright
Copyright (c) Luke Edwards <luke.edwards05@gmail.com> (lukeed.com)
--------------------------------- (separator) ----------------------------------
== Dependency
klona
== License Type
SPDX:MIT
== Copyright
Copyright (c) Luke Edwards <luke.edwards05@gmail.com> (lukeed.com)
--------------------------------- (separator) ----------------------------------
== Dependency
lazy-universal-dotenv
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2016-2017 Sebastian Software GmbH
Copyright 2018<br/>[Sebastian Software GmbH](http://www.sebastian-software.de)
--------------------------------- (separator) ----------------------------------
== Dependency
lazystream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 J. Pommerening, contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
lead
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
levn
== License Type
SPDX:MIT
== Copyright
Copyright (c) George Zahariev
--------------------------------- (separator) ----------------------------------
== Dependency
lines-and-columns
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Brian Donovan
--------------------------------- (separator) ----------------------------------
== Dependency
linkify-it
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Vitaly Puzrin.
--------------------------------- (separator) ----------------------------------
== Dependency
lmdb
== License Type
SPDX:MIT
== Copyright
Copyright (C) Yann Collet 2011-2020
Copyright (C) Yann Collet 2016-2020
Copyright (c) 2011-2020, Yann Collet
Copyright (c) 2014 Timur Kristóf](https://github.com/venemo/node-lmdb/)) and LMDB, which has a specific [OpenLDAP license](dependencies/lmdb/libraries/liblmdb/LICENSE),
Copyright 1999-2003 The OpenLDAP Foundation, Redwood City,
Copyright 2012-2021 Howard Chu, Symas Corp.
--------------------------------- (separator) ----------------------------------
== Dependency
load-json-file
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
loader-runner
== License Type
SPDX:MIT
== Copyright
Copyright (c) Tobias Koppers @sokra
--------------------------------- (separator) ----------------------------------
== Dependency
loader-utils
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
locate-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.debounce
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.escaperegexp
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2016 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.find
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.get
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.groupby
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2016 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.isboolean
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2016 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.isequal
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.isfunction
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2016 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.isnil
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2016 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.isundefined
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2015 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.max
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.merge
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.padstart
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.repeat
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.sortby
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
lodash.uniq
== License Type
SPDX:MIT
== Copyright
Copyright 2009-2016 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
Copyright 2012-2016 The Dojo Foundation <http://dojofoundation.org/>
copyright 2009-2016 Jeremy Ashkenas,
--------------------------------- (separator) ----------------------------------
== Dependency
lodash
== License Type
SPDX:MIT
== Copyright
Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
--------------------------------- (separator) ----------------------------------
== Dependency
log-symbols
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
loglevelnext
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Tim Perry
Copyright (c) 2017 Andrew Powell
--------------------------------- (separator) ----------------------------------
== Dependency
long
== License Type
SPDX:Apache-2.0
== Copyright
Daniel Wirtz <dcode@dcode.io>
--------------------------------- (separator) ----------------------------------
== Dependency
loose-envify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Andres Suarez <zertosh@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
loud-rejection
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
lower-case
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
lru-cache
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
lucene
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Ben Ripkens
--------------------------------- (separator) ----------------------------------
== Dependency
make-dir
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
makeerror
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Naitik Shah. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
management_test_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
map-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright (c) 2015-2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
map-obj
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
map-or-similar
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Baz
--------------------------------- (separator) ----------------------------------
== Dependency
map-visit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
mapcap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Stephen Belanger
--------------------------------- (separator) ----------------------------------
== Dependency
markdown-escapes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
markdown-it
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Vitaly Puzrin, Alex Kocharin.
--------------------------------- (separator) ----------------------------------
== Dependency
math-intrinsics
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
mathjs
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (C) 2013-2023 Jos de Jong <wjosdejong@gmail.com>
Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */
Copyright (c) 2020, Robert Eisele (robert@xarg.org)
Copyright (c) 2021, Robert Eisele (robert@xarg.org)
== Notices
math.js
https://github.com/josdejong/mathjs
Copyright (C) 2013-2023 Jos de Jong <wjosdejong@gmail.com>
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
https://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.
--------------------------------- (separator) ----------------------------------
== Dependency
md5.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Kirill Fomichev
--------------------------------- (separator) ----------------------------------
== Dependency
mdast-squeeze-paragraphs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Eugene Sharygin
--------------------------------- (separator) ----------------------------------
== Dependency
mdast-util-definitions
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
mdast-util-to-hast
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
mdast-util-to-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
mdn-data
== License Type
SPDX:CC0-1.0
== Copyright
Mozilla Developer Network
--------------------------------- (separator) ----------------------------------
== Dependency
mdurl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Vitaly Puzrin, Alex Kocharin.
--------------------------------- (separator) ----------------------------------
== Dependency
measured-core
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Yet Another Org and Contributors
Copyright (c) 2012-2017 Felix Geisendörfer and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
measured-reporting
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Yet Another Org and Contributors
Copyright (c) 2012-2017 Felix Geisendörfer and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
media-typer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
memoize-one
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Alexander Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
memoizerific
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Baz
--------------------------------- (separator) ----------------------------------
== Dependency
memory-fs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Tobias Koppers
--------------------------------- (separator) ----------------------------------
== Dependency
meow
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
merge-descriptors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
merge-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) Stephen Sugden <me@stephensugden.com> (stephensugden.com)
--------------------------------- (separator) ----------------------------------
== Dependency
merge2
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2020 Teambition
--------------------------------- (separator) ----------------------------------
== Dependency
methods
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2014 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2015-2016 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
microevent.ts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Christian Speckner <cnspeckn@googlemail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
micromatch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
miller-rabin
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2014
--------------------------------- (separator) ----------------------------------
== Dependency
mime-db
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2015-2022 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
mime-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
mime
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010 Benjamin Thomas, Robert Kieffer
--------------------------------- (separator) ----------------------------------
== Dependency
mimic-fn
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
min-document
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Colingo.
--------------------------------- (separator) ----------------------------------
== Dependency
min-indent
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com), James Kyle <me@thejameskyle.com> (thejameskyle.com)
--------------------------------- (separator) ----------------------------------
== Dependency
mini-create-react-context
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-2019 James Kyle <me@thejameskyle.com>
Copyright (c) 2019-present StringEpsilon <StringEpsilon@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
mini-css-extract-plugin
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minimalistic-assert
== License Type
SPDX:ISC
== Copyright
Copyright 2015 Calvin Metcalf
--------------------------------- (separator) ----------------------------------
== Dependency
minimalistic-crypto-utils
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2017.
--------------------------------- (separator) ----------------------------------
== Dependency
minimatch
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minimist
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minipass-collect
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minipass-flush
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minipass-pipeline
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minipass
== License Type
SPDX:ISC
== Copyright
Copyright (c) npm, Inc. and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
minizlib
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-2023 Isaac Z. Schlueter and Contributors
Copyright (c) 2017-2023 Node.js contributors. All rights reserved.
Copyright (c) 2017-2023 Joyent, Inc. and other Node contributors. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
mississippi
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2020 Max Ogden
--------------------------------- (separator) ----------------------------------
== Dependency
mixin-deep
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, 2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
mkdirp-classic
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 James Halliday (mail@substack.net) and Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
mkdirp
== License Type
SPDX:MIT
== Copyright
Copyright 2010 James Halliday (mail@substack.net)
--------------------------------- (separator) ----------------------------------
== Dependency
mnemonist
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Guillaume Plique (Yomguithereal)
--------------------------------- (separator) ----------------------------------
== Dependency
module-details-from-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
moment-timezone
== License Type
SPDX:MIT
== Copyright
Copyright (c) JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
moment
== License Type
SPDX:MIT
== Copyright
Copyright (c) JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
monaco-editor
== License Type
SPDX:MIT
== Copyright
Copyright (C) David Owens II, owensd.io. All rights reserved.
Copyright (c) 2011-2024, Christopher Jeffrey. (MIT Licensed)
Copyright (c) 2016 - present Microsoft Corporation
Copyright (c) Microsoft Corporation. All rights reserved.
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/**\n * Represents the completion of an asynchronous operation\n */\ninterface Promise<T> {\n /**\n * Attaches a callback that is invoked when the Promise is settled (fulfilled or rejected). The\n * resolved value cannot be modified from the callback.\n * @param onfinally The callback to execute when the Promise is settled (fulfilled or rejected).\n * @returns A Promise for the completion of the callback.\n */\n finally(onfinally?: (() => void) | undefined | null): Promise<T>;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/**\n * The decorator context types provided to class element decorators.\n */\ntype ClassMemberDecoratorContext =\n | ClassMethodDecoratorContext\n | ClassGetterDecoratorContext\n | ClassSetterDecoratorContext\n | ClassFieldDecoratorContext\n | ClassAccessorDecoratorContext;\n\n/**\n * The decorator context types provided to any decorator.\n */\ntype DecoratorContext =\n | ClassDecoratorContext\n | ClassMemberDecoratorContext;\n\ntype DecoratorMetadataObject = Record<PropertyKey, unknown> & object;\n\ntype DecoratorMetadata = typeof globalThis extends { Symbol: { readonly metadata: symbol; }; } ? DecoratorMetadataObject : DecoratorMetadataObject | undefined;\n\n/**\n * Context provided to a class decorator.\n * @template Class The type of the decorated class associated with this context.\n */\ninterface ClassDecoratorContext<\n Class extends abstract new (...args: any) => any = abstract new (...args: any) => any,\n> {\n /** The kind of element that was decorated. */\n readonly kind: "class";\n\n /** The name of the decorated class. */\n readonly name: string | undefined;\n\n /**\n * Adds a callback to be invoked after the class definition has been finalized.\n *\n * @example\n * ```ts\n * function customElement(name: string): ClassDecoratorFunction {\n * return (target, context) => {\n * context.addInitializer(function () {\n * customElements.define(name, this);\n * });\n * }\n * }\n *\n * @customElement("my-element")\n * class MyElement {}\n * ```\n */\n addInitializer(initializer: (this: Class) => void): void;\n\n readonly metadata: DecoratorMetadata;\n}\n\n/**\n * Context provided to a class method decorator.\n * @template This The type on which the class element will be defined. For a static class element, this will be\n * the type of the constructor. For a non-static class element, this will be the type of the instance.\n * @template Value The type of the decorated class method.\n */\ninterface ClassMethodDecoratorContext<\n This = unknown,\n Value extends (this: This, ...args: any) => any = (this: This, ...args: any) => any,\n> {\n /** The kind of class element that was decorated. */\n readonly kind: "method";\n\n /** The name of the decorated class element. */\n readonly name: string | symbol;\n\n /** A value indicating whether the class element is a static (`true`) or instance (`false`) element. */\n readonly static: boolean;\n\n /** A value indicating whether the class element has a private name. */\n readonly private: boolean;\n\n /** An object that can be used to access the current value of the class element at runtime. */\n readonly access: {\n /**\n * Determines whether an object has a property with the same name as the decorated element.\n */\n has(object: This): boolean;\n /**\n * Gets the current value of the method from the provided object.\n *\n * @example\n * let fn = context.access.get(instance);\n */\n get(object: This): Value;\n };\n\n /**\n * Adds a callback to be invoked either before static initializers are run (when\n * decorating a `static` element), or before instance initializers are run (when\n * decorating a non-`static` element).\n *\n * @example\n * ```ts\n * const bound: ClassMethodDecoratorFunction = (value, context) {\n * if (context.private) throw new TypeError("Not supported on private methods.");\n * context.addInitializer(function () {\n * this[context.name] = this[context.name].bind(this);\n * });\n * }\n *\n * class C {\n * message = "Hello";\n *\n * @bound\n * m() {\n * console.log(this.message);\n * }\n * }\n * ```\n */\n addInitializer(initializer: (this: This) => void): void;\n\n readonly metadata: DecoratorMetadata;\n}\n\n/**\n * Context provided to a class getter decorator.\n * @template This The type on which the class element will be defined. For a static class element, this will be\n * the type of the constructor. For a non-static class element, this will be the type of the instance.\n * @template Value The property type of the decorated class getter.\n */\ninterface ClassGetterDecoratorContext<\n This = unknown,\n Value = unknown,\n> {\n /** The kind of class element that was decorated. */\n readonly kind: "getter";\n\n /** The name of the decorated class element. */\n readonly name: string | symbol;\n\n /** A value indicating whether the class element is a static (`true`) or instance (`false`) element. */\n readonly static: boolean;\n\n /** A value indicating whether the class element has a private name. */\n readonly private: boolean;\n\n /** An object that can be used to access the current value of the class element at runtime. */\n readonly access: {\n /**\n * Determines whether an object has a property with the same name as the decorated element.\n */\n has(object: This): boolean;\n /**\n * Invokes the getter on the provided object.\n *\n * @example\n * let value = context.access.get(instance);\n */\n get(object: This): Value;\n };\n\n /**\n * Adds a callback to be invoked either before static initializers are run (when\n * decorating a `static` element), or before instance initializers are run (when\n * decorating a non-`static` element).\n */\n addInitializer(initializer: (this: This) => void): void;\n\n readonly metadata: DecoratorMetadata;\n}\n\n/**\n * Context provided to a class setter decorator.\n * @template This The type on which the class element will be defined. For a static class element, this will be\n * the type of the constructor. For a non-static class element, this will be the type of the instance.\n * @template Value The type of the decorated class setter.\n */\ninterface ClassSetterDecoratorContext<\n This = unknown,\n Value = unknown,\n> {\n /** The kind of class element that was decorated. */\n readonly kind: "setter";\n\n /** The name of the decorated class element. */\n readonly name: string | symbol;\n\n /** A value indicating whether the class element is a static (`true`) or instance (`false`) element. */\n readonly static: boolean;\n\n /** A value indicating whether the class element has a private name. */\n readonly private: boolean;\n\n /** An object that can be used to access the current value of the class element at runtime. */\n readonly access: {\n /**\n * Determines whether an object has a property with the same name as the decorated element.\n */\n has(object: This): boolean;\n /**\n * Invokes the setter on the provided object.\n *\n * @example\n * context.access.set(instance, value);\n */\n set(object: This, value: Value): void;\n };\n\n /**\n * Adds a callback to be invoked either before static initializers are run (when\n * decorating a `static` element), or before instance initializers are run (when\n * decorating a non-`static` element).\n */\n addInitializer(initializer: (this: This) => void): void;\n\n readonly metadata: DecoratorMetadata;\n}\n\n/**\n * Context provided to a class `accessor` field decorator.\n * @template This The type on which the class element will be defined. For a static class element, this will be\n * the type of the constructor. For a non-static class element, this will be the type of the instance.\n * @template Value The type of decorated class field.\n */\ninterface ClassAccessorDecoratorContext<\n This = unknown,\n Value = unknown,\n> {\n /** The kind of class element that was decorated. */\n readonly kind: "accessor";\n\n /** The name of the decorated class element. */\n readonly name: string | symbol;\n\n /** A value indicating whether the class element is a static (`true`) or instance (`false`) element. */\n readonly static: boolean;\n\n /** A value indicating whether the class element has a private name. */\n readonly private: boolean;\n\n /** An object that can be used to access the current value of the class element at runtime. */\n readonly access: {\n /**\n * Determines whether an object has a property with the same name as the decorated element.\n */\n has(object: This): boolean;\n\n /**\n * Invokes the getter on the provided object.\n *\n * @example\n * let value = context.access.get(instance);\n */\n get(object: This): Value;\n\n /**\n * Invokes the setter on the provided object.\n *\n * @example\n * context.access.set(instance, value);\n */\n set(object: This, value: Value): void;\n };\n\n /**\n * Adds a callback to be invoked either before static initializers are run (when\n * decorating a `static` element), or before instance initializers are run (when\n * decorating a non-`static` element).\n */\n addInitializer(initializer: (this: This) => void): void;\n\n readonly metadata: DecoratorMetadata;\n}\n\n/**\n * Describes the target provided to class `accessor` field decorators.\n * @template This The `this` type to which the target applies.\n * @template Value The property type for the class `accessor` field.\n */\ninterface ClassAccessorDecoratorTarget<This, Value> {\n /**\n * Invokes the getter that was defined prior to decorator application.\n *\n * @example\n * let value = target.get.call(instance);\n */\n get(this: This): Value;\n\n /**\n * Invokes the setter that was defined prior to decorator application.\n *\n * @example\n * target.set.call(instance, value);\n */\n set(this: This, value: Value): void;\n}\n\n/**\n * Describes the allowed return value from a class `accessor` field decorator.\n * @template This The `this` type to which the target applies.\n * @template Value The property type for the class `accessor` field.\n */\ninterface ClassAccessorDecoratorResult<This, Value> {\n /**\n * An optional replacement getter function. If not provided, the existing getter function is used instead.\n */\n get?(this: This): Value;\n\n /**\n * An optional replacement setter function. If not provided, the existing setter function is used instead.\n */\n set?(this: This, value: Value): void;\n\n /**\n * An optional initializer mutator that is invoked when the underlying field initializer is evaluated.\n * @param value The incoming initializer value.\n * @returns The replacement initializer value.\n */\n init?(this: This, value: Value): Value;\n}\n\n/**\n * Context provided to a class field decorator.\n * @template This The type on which the class element will be defined. For a static class element, this will be\n * the type of the constructor. For a non-static class element, this will be the type of the instance.\n * @template Value The type of the decorated class field.\n */\ninterface ClassFieldDecoratorContext<\n This = unknown,\n Value = unknown,\n> {\n /** The kind of class element that was decorated. */\n readonly kind: "field";\n\n /** The name of the decorated class element. */\n readonly name: string | symbol;\n\n /** A value indicating whether the class element is a static (`true`) or instance (`false`) element. */\n readonly static: boolean;\n\n /** A value indicating whether the class element has a private name. */\n readonly private: boolean;\n\n /** An object that can be used to access the current value of the class element at runtime. */\n readonly access: {\n /**\n * Determines whether an object has a property with the same name as the decorated element.\n */\n has(object: This): boolean;\n\n /**\n * Gets the value of the field on the provided object.\n */\n get(object: This): Value;\n\n /**\n * Sets the value of the field on the provided object.\n */\n set(object: This, value: Value): void;\n };\n\n /**\n * Adds a callback to be invoked either before static initializers are run (when\n * decorating a `static` element), or before instance initializers are run (when\n * decorating a non-`static` element).\n */\n addInitializer(initializer: (this: This) => void): void;\n\n readonly metadata: DecoratorMetadata;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2015" />\n/// <reference lib="es2016.array.include" />\n/// <reference lib="es2016.intl" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2015.iterable" />\n/// <reference lib="es2015.symbol" />\n\ninterface SymbolConstructor {\n /**\n * A regular expression method that matches the regular expression against a string. Called\n * by the String.prototype.matchAll method.\n */\n readonly matchAll: unique symbol;\n}\n\ninterface RegExp {\n /**\n * Matches a string with this regular expression, and returns an iterable of matches\n * containing the results of that search.\n * @param string A string to search within.\n */\n [Symbol.matchAll](str: string): IterableIterator<RegExpMatchArray>;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2015.iterable" />\n\ninterface ObjectConstructor {\n /**\n * Returns an object created by key-value entries for properties and methods\n * @param entries An iterable object that contains key-value entries for properties and methods.\n */\n fromEntries<T = any>(entries: Iterable<readonly [PropertyKey, T]>): { [k: string]: T; };\n\n /**\n * Returns an object created by key-value entries for properties and methods\n * @param entries An iterable object that contains key-value entries for properties and methods.\n */\n fromEntries(entries: Iterable<readonly any[]>): any;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2015.symbol" />\n/// <reference lib="es2015.symbol.wellknown" />\n\ninterface SharedArrayBuffer {\n /**\n * Read-only. The length of the ArrayBuffer (in bytes).\n */\n readonly byteLength: number;\n\n /**\n * Returns a section of an SharedArrayBuffer.\n */\n slice(begin: number, end?: number): SharedArrayBuffer;\n readonly [Symbol.species]: SharedArrayBuffer;\n readonly [Symbol.toStringTag]: "SharedArrayBuffer";\n}\n\ninterface SharedArrayBufferConstructor {\n readonly prototype: SharedArrayBuffer;\n new (byteLength: number): SharedArrayBuffer;\n}\ndeclare var SharedArrayBuffer: SharedArrayBufferConstructor;\n\ninterface ArrayBufferTypes {\n SharedArrayBuffer: SharedArrayBuffer;\n}\n\ninterface Atomics {\n /**\n * Adds a value to the value at the given position in the array, returning the original value.\n * Until this atomic operation completes, any other read or write operation against the array\n * will block.\n */\n add(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n /**\n * Stores the bitwise AND of a value with the value at the given position in the array,\n * returning the original value. Until this atomic operation completes, any other read or\n * write operation against the array will block.\n */\n and(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n /**\n * Replaces the value at the given position in the array if the original value equals the given\n * expected value, returning the original value. Until this atomic operation completes, any\n * other read or write operation against the array will block.\n */\n compareExchange(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, expectedValue: number, replacementValue: number): number;\n\n /**\n * Replaces the value at the given position in the array, returning the original value. Until\n * this atomic operation completes, any other read or write operation against the array will\n * block.\n */\n exchange(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n /**\n * Returns a value indicating whether high-performance algorithms can use atomic operations\n * (`true`) or must use locks (`false`) for the given number of bytes-per-element of a typed\n * array.\n */\n isLockFree(size: number): boolean;\n\n /**\n * Returns the value at the given position in the array. Until this atomic operation completes,\n * any other read or write operation against the array will block.\n */\n load(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number): number;\n\n /**\n * Stores the bitwise OR of a value with the value at the given position in the array,\n * returning the original value. Until this atomic operation completes, any other read or write\n * operation against the array will block.\n */\n or(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n /**\n * Stores a value at the given position in the array, returning the new value. Until this\n * atomic operation completes, any other read or write operation against the array will block.\n */\n store(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n /**\n * Subtracts a value from the value at the given position in the array, returning the original\n * value. Until this atomic operation completes, any other read or write operation against the\n * array will block.\n */\n sub(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n /**\n * If the value at the given position in the array is equal to the provided value, the current\n * agent is put to sleep causing execution to suspend until the timeout expires (returning\n * `"timed-out"`) or until the agent is awoken (returning `"ok"`); otherwise, returns\n * `"not-equal"`.\n */\n wait(typedArray: Int32Array, index: number, value: number, timeout?: number): "ok" | "not-equal" | "timed-out";\n\n /**\n * Wakes up sleeping agents that are waiting on the given index of the array, returning the\n * number of agents that were awoken.\n * @param typedArray A shared Int32Array.\n * @param index The position in the typedArray to wake up on.\n * @param count The number of sleeping agents to notify. Defaults to +Infinity.\n */\n notify(typedArray: Int32Array, index: number, count?: number): number;\n\n /**\n * Stores the bitwise XOR of a value with the value at the given position in the array,\n * returning the original value. Until this atomic operation completes, any other read or write\n * operation against the array will block.\n */\n xor(typedArray: Int8Array | Uint8Array | Int16Array | Uint16Array | Int32Array | Uint32Array, index: number, value: number): number;\n\n readonly [Symbol.toStringTag]: "Atomics";\n}\n\ndeclare var Atomics: Atomics;\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2016" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2016" />\n/// <reference lib="es2017.object" />\n/// <reference lib="es2017.sharedmemory" />\n/// <reference lib="es2017.string" />\n/// <reference lib="es2017.intl" />\n/// <reference lib="es2017.typedarrays" />\n/// <reference lib="es2017.date" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2017" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2017" />\n/// <reference lib="es2018.asynciterable" />\n/// <reference lib="es2018.asyncgenerator" />\n/// <reference lib="es2018.promise" />\n/// <reference lib="es2018.regexp" />\n/// <reference lib="es2018.intl" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2018" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n/// <reference lib="dom.asynciterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2018" />\n/// <reference lib="es2019.array" />\n/// <reference lib="es2019.object" />\n/// <reference lib="es2019.string" />\n/// <reference lib="es2019.symbol" />\n/// <reference lib="es2019.intl" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2018.intl" />\ndeclare namespace Intl {\n /**\n * A string that is a valid [Unicode BCP 47 Locale Identifier](https://unicode.org/reports/tr35/#Unicode_locale_identifier).\n *\n * For example: "fa", "es-MX", "zh-Hant-TW".\n *\n * See [MDN - Intl - locales argument](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#locales_argument).\n */\n type UnicodeBCP47LocaleIdentifier = string;\n\n /**\n * Unit to use in the relative time internationalized message.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/format#Parameters).\n */\n type RelativeTimeFormatUnit =\n | "year"\n | "years"\n | "quarter"\n | "quarters"\n | "month"\n | "months"\n | "week"\n | "weeks"\n | "day"\n | "days"\n | "hour"\n | "hours"\n | "minute"\n | "minutes"\n | "second"\n | "seconds";\n\n /**\n * Value of the `unit` property in objects returned by\n * `Intl.RelativeTimeFormat.prototype.formatToParts()`. `formatToParts` and\n * `format` methods accept either singular or plural unit names as input,\n * but `formatToParts` only outputs singular (e.g. "day") not plural (e.g.\n * "days").\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/formatToParts#Using_formatToParts).\n */\n type RelativeTimeFormatUnitSingular =\n | "year"\n | "quarter"\n | "month"\n | "week"\n | "day"\n | "hour"\n | "minute"\n | "second";\n\n /**\n * The locale matching algorithm to use.\n *\n * [MDN](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_negotiation).\n */\n type RelativeTimeFormatLocaleMatcher = "lookup" | "best fit";\n\n /**\n * The format of output message.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/RelativeTimeFormat#Parameters).\n */\n type RelativeTimeFormatNumeric = "always" | "auto";\n\n /**\n * The length of the internationalized message.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/RelativeTimeFormat#Parameters).\n */\n type RelativeTimeFormatStyle = "long" | "short" | "narrow";\n\n /**\n * The locale or locales to use\n *\n * See [MDN - Intl - locales argument](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#locales_argument).\n */\n type LocalesArgument = UnicodeBCP47LocaleIdentifier | Locale | readonly (UnicodeBCP47LocaleIdentifier | Locale)[] | undefined;\n\n /**\n * An object with some or all of properties of `options` parameter\n * of `Intl.RelativeTimeFormat` constructor.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/RelativeTimeFormat#Parameters).\n */\n interface RelativeTimeFormatOptions {\n /** The locale matching algorithm to use. For information about this option, see [Intl page](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_negotiation). */\n localeMatcher?: RelativeTimeFormatLocaleMatcher;\n /** The format of output message. */\n numeric?: RelativeTimeFormatNumeric;\n /** The length of the internationalized message. */\n style?: RelativeTimeFormatStyle;\n }\n\n /**\n * An object with properties reflecting the locale\n * and formatting options computed during initialization\n * of the `Intl.RelativeTimeFormat` object\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/resolvedOptions#Description).\n */\n interface ResolvedRelativeTimeFormatOptions {\n locale: UnicodeBCP47LocaleIdentifier;\n style: RelativeTimeFormatStyle;\n numeric: RelativeTimeFormatNumeric;\n numberingSystem: string;\n }\n\n /**\n * An object representing the relative time format in parts\n * that can be used for custom locale-aware formatting.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/formatToParts#Using_formatToParts).\n */\n type RelativeTimeFormatPart =\n | {\n type: "literal";\n value: string;\n }\n | {\n type: Exclude<NumberFormatPartTypes, "literal">;\n value: string;\n unit: RelativeTimeFormatUnitSingular;\n };\n\n interface RelativeTimeFormat {\n /**\n * Formats a value and a unit according to the locale\n * and formatting options of the given\n * [`Intl.RelativeTimeFormat`](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RelativeTimeFormat)\n * object.\n *\n * While this method automatically provides the correct plural forms,\n * the grammatical form is otherwise as neutral as possible.\n *\n * It is the caller\'s responsibility to handle cut-off logic\n * such as deciding between displaying "in 7 days" or "in 1 week".\n * This API does not support relative dates involving compound units.\n * e.g "in 5 days and 4 hours".\n *\n * @param value - Numeric value to use in the internationalized relative time message\n *\n * @param unit - [Unit](https://tc39.es/ecma402/#sec-singularrelativetimeunit) to use in the relative time internationalized message.\n *\n * @throws `RangeError` if `unit` was given something other than `unit` possible values\n *\n * @returns {string} Internationalized relative time message as string\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/format).\n */\n format(value: number, unit: RelativeTimeFormatUnit): string;\n\n /**\n * Returns an array of objects representing the relative time format in parts that can be used for custom locale-aware formatting.\n *\n * @param value - Numeric value to use in the internationalized relative time message\n *\n * @param unit - [Unit](https://tc39.es/ecma402/#sec-singularrelativetimeunit) to use in the relative time internationalized message.\n *\n * @throws `RangeError` if `unit` was given something other than `unit` possible values\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/formatToParts).\n */\n formatToParts(value: number, unit: RelativeTimeFormatUnit): RelativeTimeFormatPart[];\n\n /**\n * Provides access to the locale and options computed during initialization of this `Intl.RelativeTimeFormat` object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/resolvedOptions).\n */\n resolvedOptions(): ResolvedRelativeTimeFormatOptions;\n }\n\n /**\n * The [`Intl.RelativeTimeFormat`](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/RelativeTimeFormat)\n * object is a constructor for objects that enable language-sensitive relative time formatting.\n *\n * [Compatibility](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat#Browser_compatibility).\n */\n const RelativeTimeFormat: {\n /**\n * Creates [Intl.RelativeTimeFormat](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RelativeTimeFormat) objects\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the locales argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/RelativeTimeFormat#Parameters)\n * with some or all of options of `RelativeTimeFormatOptions`.\n *\n * @returns [Intl.RelativeTimeFormat](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RelativeTimeFormat) object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/RelativeTimeFormat).\n */\n new (\n locales?: LocalesArgument,\n options?: RelativeTimeFormatOptions,\n ): RelativeTimeFormat;\n\n /**\n * Returns an array containing those of the provided locales\n * that are supported in date and time formatting\n * without having to fall back to the runtime\'s default locale.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the locales argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/RelativeTimeFormat#Parameters)\n * with some or all of options of the formatting.\n *\n * @returns An array containing those of the provided locales\n * that are supported in date and time formatting\n * without having to fall back to the runtime\'s default locale.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/RelativeTimeFormat/supportedLocalesOf).\n */\n supportedLocalesOf(\n locales?: LocalesArgument,\n options?: RelativeTimeFormatOptions,\n ): UnicodeBCP47LocaleIdentifier[];\n };\n\n interface NumberFormatOptions {\n compactDisplay?: "short" | "long" | undefined;\n notation?: "standard" | "scientific" | "engineering" | "compact" | undefined;\n signDisplay?: "auto" | "never" | "always" | "exceptZero" | undefined;\n unit?: string | undefined;\n unitDisplay?: "short" | "long" | "narrow" | undefined;\n currencyDisplay?: string | undefined;\n currencySign?: string | undefined;\n }\n\n interface ResolvedNumberFormatOptions {\n compactDisplay?: "short" | "long";\n notation?: "standard" | "scientific" | "engineering" | "compact";\n signDisplay?: "auto" | "never" | "always" | "exceptZero";\n unit?: string;\n unitDisplay?: "short" | "long" | "narrow";\n currencyDisplay?: string;\n currencySign?: string;\n }\n\n interface DateTimeFormatOptions {\n calendar?: string | undefined;\n dayPeriod?: "narrow" | "short" | "long" | undefined;\n numberingSystem?: string | undefined;\n\n dateStyle?: "full" | "long" | "medium" | "short" | undefined;\n timeStyle?: "full" | "long" | "medium" | "short" | undefined;\n hourCycle?: "h11" | "h12" | "h23" | "h24" | undefined;\n }\n\n type LocaleHourCycleKey = "h12" | "h23" | "h11" | "h24";\n type LocaleCollationCaseFirst = "upper" | "lower" | "false";\n\n interface LocaleOptions {\n /** A string containing the language, and the script and region if available. */\n baseName?: string;\n /** The part of the Locale that indicates the locale\'s calendar era. */\n calendar?: string;\n /** Flag that defines whether case is taken into account for the locale\'s collation rules. */\n caseFirst?: LocaleCollationCaseFirst;\n /** The collation type used for sorting */\n collation?: string;\n /** The time keeping format convention used by the locale. */\n hourCycle?: LocaleHourCycleKey;\n /** The primary language subtag associated with the locale. */\n language?: string;\n /** The numeral system used by the locale. */\n numberingSystem?: string;\n /** Flag that defines whether the locale has special collation handling for numeric characters. */\n numeric?: boolean;\n /** The region of the world (usually a country) associated with the locale. Possible values are region codes as defined by ISO 3166-1. */\n region?: string;\n /** The script used for writing the particular language used in the locale. Possible values are script codes as defined by ISO 15924. */\n script?: string;\n }\n\n interface Locale extends LocaleOptions {\n /** A string containing the language, and the script and region if available. */\n baseName: string;\n /** The primary language subtag associated with the locale. */\n language: string;\n /** Gets the most likely values for the language, script, and region of the locale based on existing values. */\n maximize(): Locale;\n /** Attempts to remove information about the locale that would be added by calling `Locale.maximize()`. */\n minimize(): Locale;\n /** Returns the locale\'s full locale identifier string. */\n toString(): UnicodeBCP47LocaleIdentifier;\n }\n\n /**\n * Constructor creates [Intl.Locale](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Locale)\n * objects\n *\n * @param tag - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646).\n * For the general form and interpretation of the locales argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Locale/Locale#Parameters) with some or all of options of the locale.\n *\n * @returns [Intl.Locale](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Locale) object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Locale).\n */\n const Locale: {\n new (tag: UnicodeBCP47LocaleIdentifier | Locale, options?: LocaleOptions): Locale;\n };\n\n type DisplayNamesFallback =\n | "code"\n | "none";\n\n type DisplayNamesType =\n | "language"\n | "region"\n | "script"\n | "calendar"\n | "dateTimeField"\n | "currency";\n\n type DisplayNamesLanguageDisplay =\n | "dialect"\n | "standard";\n\n interface DisplayNamesOptions {\n localeMatcher?: RelativeTimeFormatLocaleMatcher;\n style?: RelativeTimeFormatStyle;\n type: DisplayNamesType;\n languageDisplay?: DisplayNamesLanguageDisplay;\n fallback?: DisplayNamesFallback;\n }\n\n interface ResolvedDisplayNamesOptions {\n locale: UnicodeBCP47LocaleIdentifier;\n style: RelativeTimeFormatStyle;\n type: DisplayNamesType;\n fallback: DisplayNamesFallback;\n languageDisplay?: DisplayNamesLanguageDisplay;\n }\n\n interface DisplayNames {\n /**\n * Receives a code and returns a string based on the locale and options provided when instantiating\n * [`Intl.DisplayNames()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames)\n *\n * @param code The `code` to provide depends on the `type` passed to display name during creation:\n * - If the type is `"region"`, code should be either an [ISO-3166 two letters region code](https://www.iso.org/iso-3166-country-codes.html),\n * or a [three digits UN M49 Geographic Regions](https://unstats.un.org/unsd/methodology/m49/).\n * - If the type is `"script"`, code should be an [ISO-15924 four letters script code](https://unicode.org/iso15924/iso15924-codes.html).\n * - If the type is `"language"`, code should be a `languageCode` ["-" `scriptCode`] ["-" `regionCode` ] *("-" `variant` )\n * subsequence of the unicode_language_id grammar in [UTS 35\'s Unicode Language and Locale Identifiers grammar](https://unicode.org/reports/tr35/#Unicode_language_identifier).\n * `languageCode` is either a two letters ISO 639-1 language code or a three letters ISO 639-2 language code.\n * - If the type is `"currency"`, code should be a [3-letter ISO 4217 currency code](https://www.iso.org/iso-4217-currency-codes.html).\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames/of).\n */\n of(code: string): string | undefined;\n /**\n * Returns a new object with properties reflecting the locale and style formatting options computed during the construction of the current\n * [`Intl/DisplayNames`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames) object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames/resolvedOptions).\n */\n resolvedOptions(): ResolvedDisplayNamesOptions;\n }\n\n /**\n * The [`Intl.DisplayNames()`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames)\n * object enables the consistent translation of language, region and script display names.\n *\n * [Compatibility](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames#browser_compatibility).\n */\n const DisplayNames: {\n prototype: DisplayNames;\n\n /**\n * @param locales A string with a BCP 47 language tag, or an array of such strings.\n * For the general form and interpretation of the `locales` argument, see the [Intl](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#locale_identification_and_negotiation)\n * page.\n *\n * @param options An object for setting up a display name.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames/DisplayNames).\n */\n new (locales: LocalesArgument, options: DisplayNamesOptions): DisplayNames;\n\n /**\n * Returns an array containing those of the provided locales that are supported in display names without having to fall back to the runtime\'s default locale.\n *\n * @param locales A string with a BCP 47 language tag, or an array of such strings.\n * For the general form and interpretation of the `locales` argument, see the [Intl](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#locale_identification_and_negotiation)\n * page.\n *\n * @param options An object with a locale matcher.\n *\n * @returns An array of strings representing a subset of the given locale tags that are supported in display names without having to fall back to the runtime\'s default locale.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/DisplayNames/supportedLocalesOf).\n */\n supportedLocalesOf(locales?: LocalesArgument, options?: { localeMatcher?: RelativeTimeFormatLocaleMatcher; }): UnicodeBCP47LocaleIdentifier[];\n };\n\n interface CollatorConstructor {\n new (locales?: LocalesArgument, options?: CollatorOptions): Collator;\n (locales?: LocalesArgument, options?: CollatorOptions): Collator;\n supportedLocalesOf(locales: LocalesArgument, options?: CollatorOptions): string[];\n }\n\n interface DateTimeFormatConstructor {\n new (locales?: LocalesArgument, options?: DateTimeFormatOptions): DateTimeFormat;\n (locales?: LocalesArgument, options?: DateTimeFormatOptions): DateTimeFormat;\n supportedLocalesOf(locales: LocalesArgument, options?: DateTimeFormatOptions): string[];\n }\n\n interface NumberFormatConstructor {\n new (locales?: LocalesArgument, options?: NumberFormatOptions): NumberFormat;\n (locales?: LocalesArgument, options?: NumberFormatOptions): NumberFormat;\n supportedLocalesOf(locales: LocalesArgument, options?: NumberFormatOptions): string[];\n }\n\n interface PluralRulesConstructor {\n new (locales?: LocalesArgument, options?: PluralRulesOptions): PluralRules;\n (locales?: LocalesArgument, options?: PluralRulesOptions): PluralRules;\n\n supportedLocalesOf(locales: LocalesArgument, options?: { localeMatcher?: "lookup" | "best fit"; }): string[];\n }\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2019" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n/// <reference lib="dom.asynciterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2019" />\n/// <reference lib="es2020.bigint" />\n/// <reference lib="es2020.date" />\n/// <reference lib="es2020.number" />\n/// <reference lib="es2020.promise" />\n/// <reference lib="es2020.sharedmemory" />\n/// <reference lib="es2020.string" />\n/// <reference lib="es2020.symbol.wellknown" />\n/// <reference lib="es2020.intl" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2020" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n/// <reference lib="dom.asynciterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2020" />\n/// <reference lib="es2021.promise" />\n/// <reference lib="es2021.string" />\n/// <reference lib="es2021.weakref" />\n/// <reference lib="es2021.intl" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2020.intl" />\n\ninterface BigIntToLocaleStringOptions {\n /**\n * The locale matching algorithm to use.The default is "best fit". For information about this option, see the {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_negotiation Intl page}.\n */\n localeMatcher?: string;\n /**\n * The formatting style to use , the default is "decimal".\n */\n style?: string;\n\n numberingSystem?: string;\n /**\n * The unit to use in unit formatting, Possible values are core unit identifiers, defined in UTS #35, Part 2, Section 6. A subset of units from the full list was selected for use in ECMAScript. Pairs of simple units can be concatenated with "-per-" to make a compound unit. There is no default value; if the style is "unit", the unit property must be provided.\n */\n unit?: string;\n\n /**\n * The unit formatting style to use in unit formatting, the defaults is "short".\n */\n unitDisplay?: string;\n\n /**\n * The currency to use in currency formatting. Possible values are the ISO 4217 currency codes, such as "USD" for the US dollar, "EUR" for the euro, or "CNY" for the Chinese RMB \u2014 see the Current currency & funds code list. There is no default value; if the style is "currency", the currency property must be provided. It is only used when [[Style]] has the value "currency".\n */\n currency?: string;\n\n /**\n * How to display the currency in currency formatting. It is only used when [[Style]] has the value "currency". The default is "symbol".\n *\n * "symbol" to use a localized currency symbol such as \u20AC,\n *\n * "code" to use the ISO currency code,\n *\n * "name" to use a localized currency name such as "dollar"\n */\n currencyDisplay?: string;\n\n /**\n * Whether to use grouping separators, such as thousands separators or thousand/lakh/crore separators. The default is true.\n */\n useGrouping?: boolean;\n\n /**\n * The minimum number of integer digits to use. Possible values are from 1 to 21; the default is 1.\n */\n minimumIntegerDigits?: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21;\n\n /**\n * The minimum number of fraction digits to use. Possible values are from 0 to 20; the default for plain number and percent formatting is 0; the default for currency formatting is the number of minor unit digits provided by the {@link http://www.currency-iso.org/en/home/tables/table-a1.html ISO 4217 currency codes list} (2 if the list doesn\'t provide that information).\n */\n minimumFractionDigits?: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20;\n\n /**\n * The maximum number of fraction digits to use. Possible values are from 0 to 20; the default for plain number formatting is the larger of minimumFractionDigits and 3; the default for currency formatting is the larger of minimumFractionDigits and the number of minor unit digits provided by the {@link http://www.currency-iso.org/en/home/tables/table-a1.html ISO 4217 currency codes list} (2 if the list doesn\'t provide that information); the default for percent formatting is the larger of minimumFractionDigits and 0.\n */\n maximumFractionDigits?: 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20;\n\n /**\n * The minimum number of significant digits to use. Possible values are from 1 to 21; the default is 1.\n */\n minimumSignificantDigits?: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21;\n\n /**\n * The maximum number of significant digits to use. Possible values are from 1 to 21; the default is 21.\n */\n maximumSignificantDigits?: 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21;\n\n /**\n * The formatting that should be displayed for the number, the defaults is "standard"\n *\n * "standard" plain number formatting\n *\n * "scientific" return the order-of-magnitude for formatted number.\n *\n * "engineering" return the exponent of ten when divisible by three\n *\n * "compact" string representing exponent, defaults is using the "short" form\n */\n notation?: string;\n\n /**\n * used only when notation is "compact"\n */\n compactDisplay?: string;\n}\n\ninterface BigInt {\n /**\n * Returns a string representation of an object.\n * @param radix Specifies a radix for converting numeric values to strings.\n */\n toString(radix?: number): string;\n\n /** Returns a string representation appropriate to the host environment\'s current locale. */\n toLocaleString(locales?: Intl.LocalesArgument, options?: BigIntToLocaleStringOptions): string;\n\n /** Returns the primitive value of the specified object. */\n valueOf(): bigint;\n\n readonly [Symbol.toStringTag]: "BigInt";\n}\n\ninterface BigIntConstructor {\n (value: bigint | boolean | number | string): bigint;\n readonly prototype: BigInt;\n\n /**\n * Interprets the low bits of a BigInt as a 2\'s-complement signed integer.\n * All higher bits are discarded.\n * @param bits The number of low bits to use\n * @param int The BigInt whose bits to extract\n */\n asIntN(bits: number, int: bigint): bigint;\n /**\n * Interprets the low bits of a BigInt as an unsigned integer.\n * All higher bits are discarded.\n * @param bits The number of low bits to use\n * @param int The BigInt whose bits to extract\n */\n asUintN(bits: number, int: bigint): bigint;\n}\n\ndeclare var BigInt: BigIntConstructor;\n\n/**\n * A typed array of 64-bit signed integer values. The contents are initialized to 0. If the\n * requested number of bytes could not be allocated, an exception is raised.\n */\ninterface BigInt64Array {\n /** The size in bytes of each element in the array. */\n readonly BYTES_PER_ELEMENT: number;\n\n /** The ArrayBuffer instance referenced by the array. */\n readonly buffer: ArrayBufferLike;\n\n /** The length in bytes of the array. */\n readonly byteLength: number;\n\n /** The offset in bytes of the array. */\n readonly byteOffset: number;\n\n /**\n * Returns the this object after copying a section of the array identified by start and end\n * to the same array starting at position target\n * @param target If target is negative, it is treated as length+target where length is the\n * length of the array.\n * @param start If start is negative, it is treated as length+start. If end is negative, it\n * is treated as length+end.\n * @param end If not specified, length of the this object is used as its default value.\n */\n copyWithin(target: number, start: number, end?: number): this;\n\n /** Yields index, value pairs for every entry in the array. */\n entries(): IterableIterator<[number, bigint]>;\n\n /**\n * Determines whether all the members of an array satisfy the specified test.\n * @param predicate A function that accepts up to three arguments. The every method calls\n * the predicate function for each element in the array until the predicate returns false,\n * or until the end of the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n every(predicate: (value: bigint, index: number, array: BigInt64Array) => boolean, thisArg?: any): boolean;\n\n /**\n * Changes all array elements from `start` to `end` index to a static `value` and returns the modified array\n * @param value value to fill array section with\n * @param start index to start filling the array at. If start is negative, it is treated as\n * length+start where length is the length of the array.\n * @param end index to stop filling the array at. If end is negative, it is treated as\n * length+end.\n */\n fill(value: bigint, start?: number, end?: number): this;\n\n /**\n * Returns the elements of an array that meet the condition specified in a callback function.\n * @param predicate A function that accepts up to three arguments. The filter method calls\n * the predicate function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n filter(predicate: (value: bigint, index: number, array: BigInt64Array) => any, thisArg?: any): BigInt64Array;\n\n /**\n * Returns the value of the first element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found, find\n * immediately returns that element value. Otherwise, find returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n find(predicate: (value: bigint, index: number, array: BigInt64Array) => boolean, thisArg?: any): bigint | undefined;\n\n /**\n * Returns the index of the first element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findIndex immediately returns that element index. Otherwise, findIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findIndex(predicate: (value: bigint, index: number, array: BigInt64Array) => boolean, thisArg?: any): number;\n\n /**\n * Performs the specified action for each element in an array.\n * @param callbackfn A function that accepts up to three arguments. forEach calls the\n * callbackfn function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n forEach(callbackfn: (value: bigint, index: number, array: BigInt64Array) => void, thisArg?: any): void;\n\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: bigint, fromIndex?: number): boolean;\n\n /**\n * Returns the index of the first occurrence of a value in an array.\n * @param searchElement The value to locate in the array.\n * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the\n * search starts at index 0.\n */\n indexOf(searchElement: bigint, fromIndex?: number): number;\n\n /**\n * Adds all the elements of an array separated by the specified separator string.\n * @param separator A string used to separate one element of an array from the next in the\n * resulting String. If omitted, the array elements are separated with a comma.\n */\n join(separator?: string): string;\n\n /** Yields each index in the array. */\n keys(): IterableIterator<number>;\n\n /**\n * Returns the index of the last occurrence of a value in an array.\n * @param searchElement The value to locate in the array.\n * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the\n * search starts at index 0.\n */\n lastIndexOf(searchElement: bigint, fromIndex?: number): number;\n\n /** The length of the array. */\n readonly length: number;\n\n /**\n * Calls a defined callback function on each element of an array, and returns an array that\n * contains the results.\n * @param callbackfn A function that accepts up to three arguments. The map method calls the\n * callbackfn function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n map(callbackfn: (value: bigint, index: number, array: BigInt64Array) => bigint, thisArg?: any): BigInt64Array;\n\n /**\n * Calls the specified callback function for all the elements in an array. The return value of\n * the callback function is the accumulated result, and is provided as an argument in the next\n * call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduce method calls the\n * callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduce(callbackfn: (previousValue: bigint, currentValue: bigint, currentIndex: number, array: BigInt64Array) => bigint): bigint;\n\n /**\n * Calls the specified callback function for all the elements in an array. The return value of\n * the callback function is the accumulated result, and is provided as an argument in the next\n * call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduce method calls the\n * callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduce<U>(callbackfn: (previousValue: U, currentValue: bigint, currentIndex: number, array: BigInt64Array) => U, initialValue: U): U;\n\n /**\n * Calls the specified callback function for all the elements in an array, in descending order.\n * The return value of the callback function is the accumulated result, and is provided as an\n * argument in the next call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls\n * the callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an\n * argument instead of an array value.\n */\n reduceRight(callbackfn: (previousValue: bigint, currentValue: bigint, currentIndex: number, array: BigInt64Array) => bigint): bigint;\n\n /**\n * Calls the specified callback function for all the elements in an array, in descending order.\n * The return value of the callback function is the accumulated result, and is provided as an\n * argument in the next call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls\n * the callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduceRight<U>(callbackfn: (previousValue: U, currentValue: bigint, currentIndex: number, array: BigInt64Array) => U, initialValue: U): U;\n\n /** Reverses the elements in the array. */\n reverse(): this;\n\n /**\n * Sets a value or an array of values.\n * @param array A typed or untyped array of values to set.\n * @param offset The index in the current array at which the values are to be written.\n */\n set(array: ArrayLike<bigint>, offset?: number): void;\n\n /**\n * Returns a section of an array.\n * @param start The beginning of the specified portion of the array.\n * @param end The end of the specified portion of the array.\n */\n slice(start?: number, end?: number): BigInt64Array;\n\n /**\n * Determines whether the specified callback function returns true for any element of an array.\n * @param predicate A function that accepts up to three arguments. The some method calls the\n * predicate function for each element in the array until the predicate returns true, or until\n * the end of the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n some(predicate: (value: bigint, index: number, array: BigInt64Array) => boolean, thisArg?: any): boolean;\n\n /**\n * Sorts the array.\n * @param compareFn The function used to determine the order of the elements. If omitted, the elements are sorted in ascending order.\n */\n sort(compareFn?: (a: bigint, b: bigint) => number | bigint): this;\n\n /**\n * Gets a new BigInt64Array view of the ArrayBuffer store for this array, referencing the elements\n * at begin, inclusive, up to end, exclusive.\n * @param begin The index of the beginning of the array.\n * @param end The index of the end of the array.\n */\n subarray(begin?: number, end?: number): BigInt64Array;\n\n /** Converts the array to a string by using the current locale. */\n toLocaleString(): string;\n\n /** Returns a string representation of the array. */\n toString(): string;\n\n /** Returns the primitive value of the specified object. */\n valueOf(): BigInt64Array;\n\n /** Yields each value in the array. */\n values(): IterableIterator<bigint>;\n\n [Symbol.iterator](): IterableIterator<bigint>;\n\n readonly [Symbol.toStringTag]: "BigInt64Array";\n\n [index: number]: bigint;\n}\n\ninterface BigInt64ArrayConstructor {\n readonly prototype: BigInt64Array;\n new (length?: number): BigInt64Array;\n new (array: Iterable<bigint>): BigInt64Array;\n new (buffer: ArrayBufferLike, byteOffset?: number, length?: number): BigInt64Array;\n\n /** The size in bytes of each element in the array. */\n readonly BYTES_PER_ELEMENT: number;\n\n /**\n * Returns a new array from a set of elements.\n * @param items A set of elements to include in the new array object.\n */\n of(...items: bigint[]): BigInt64Array;\n\n /**\n * Creates an array from an array-like or iterable object.\n * @param arrayLike An array-like or iterable object to convert to an array.\n * @param mapfn A mapping function to call on every element of the array.\n * @param thisArg Value of \'this\' used to invoke the mapfn.\n */\n from(arrayLike: ArrayLike<bigint>): BigInt64Array;\n from<U>(arrayLike: ArrayLike<U>, mapfn: (v: U, k: number) => bigint, thisArg?: any): BigInt64Array;\n}\n\ndeclare var BigInt64Array: BigInt64ArrayConstructor;\n\n/**\n * A typed array of 64-bit unsigned integer values. The contents are initialized to 0. If the\n * requested number of bytes could not be allocated, an exception is raised.\n */\ninterface BigUint64Array {\n /** The size in bytes of each element in the array. */\n readonly BYTES_PER_ELEMENT: number;\n\n /** The ArrayBuffer instance referenced by the array. */\n readonly buffer: ArrayBufferLike;\n\n /** The length in bytes of the array. */\n readonly byteLength: number;\n\n /** The offset in bytes of the array. */\n readonly byteOffset: number;\n\n /**\n * Returns the this object after copying a section of the array identified by start and end\n * to the same array starting at position target\n * @param target If target is negative, it is treated as length+target where length is the\n * length of the array.\n * @param start If start is negative, it is treated as length+start. If end is negative, it\n * is treated as length+end.\n * @param end If not specified, length of the this object is used as its default value.\n */\n copyWithin(target: number, start: number, end?: number): this;\n\n /** Yields index, value pairs for every entry in the array. */\n entries(): IterableIterator<[number, bigint]>;\n\n /**\n * Determines whether all the members of an array satisfy the specified test.\n * @param predicate A function that accepts up to three arguments. The every method calls\n * the predicate function for each element in the array until the predicate returns false,\n * or until the end of the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n every(predicate: (value: bigint, index: number, array: BigUint64Array) => boolean, thisArg?: any): boolean;\n\n /**\n * Changes all array elements from `start` to `end` index to a static `value` and returns the modified array\n * @param value value to fill array section with\n * @param start index to start filling the array at. If start is negative, it is treated as\n * length+start where length is the length of the array.\n * @param end index to stop filling the array at. If end is negative, it is treated as\n * length+end.\n */\n fill(value: bigint, start?: number, end?: number): this;\n\n /**\n * Returns the elements of an array that meet the condition specified in a callback function.\n * @param predicate A function that accepts up to three arguments. The filter method calls\n * the predicate function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n filter(predicate: (value: bigint, index: number, array: BigUint64Array) => any, thisArg?: any): BigUint64Array;\n\n /**\n * Returns the value of the first element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found, find\n * immediately returns that element value. Otherwise, find returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n find(predicate: (value: bigint, index: number, array: BigUint64Array) => boolean, thisArg?: any): bigint | undefined;\n\n /**\n * Returns the index of the first element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findIndex immediately returns that element index. Otherwise, findIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findIndex(predicate: (value: bigint, index: number, array: BigUint64Array) => boolean, thisArg?: any): number;\n\n /**\n * Performs the specified action for each element in an array.\n * @param callbackfn A function that accepts up to three arguments. forEach calls the\n * callbackfn function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n forEach(callbackfn: (value: bigint, index: number, array: BigUint64Array) => void, thisArg?: any): void;\n\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: bigint, fromIndex?: number): boolean;\n\n /**\n * Returns the index of the first occurrence of a value in an array.\n * @param searchElement The value to locate in the array.\n * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the\n * search starts at index 0.\n */\n indexOf(searchElement: bigint, fromIndex?: number): number;\n\n /**\n * Adds all the elements of an array separated by the specified separator string.\n * @param separator A string used to separate one element of an array from the next in the\n * resulting String. If omitted, the array elements are separated with a comma.\n */\n join(separator?: string): string;\n\n /** Yields each index in the array. */\n keys(): IterableIterator<number>;\n\n /**\n * Returns the index of the last occurrence of a value in an array.\n * @param searchElement The value to locate in the array.\n * @param fromIndex The array index at which to begin the search. If fromIndex is omitted, the\n * search starts at index 0.\n */\n lastIndexOf(searchElement: bigint, fromIndex?: number): number;\n\n /** The length of the array. */\n readonly length: number;\n\n /**\n * Calls a defined callback function on each element of an array, and returns an array that\n * contains the results.\n * @param callbackfn A function that accepts up to three arguments. The map method calls the\n * callbackfn function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callbackfn function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n map(callbackfn: (value: bigint, index: number, array: BigUint64Array) => bigint, thisArg?: any): BigUint64Array;\n\n /**\n * Calls the specified callback function for all the elements in an array. The return value of\n * the callback function is the accumulated result, and is provided as an argument in the next\n * call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduce method calls the\n * callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduce(callbackfn: (previousValue: bigint, currentValue: bigint, currentIndex: number, array: BigUint64Array) => bigint): bigint;\n\n /**\n * Calls the specified callback function for all the elements in an array. The return value of\n * the callback function is the accumulated result, and is provided as an argument in the next\n * call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduce method calls the\n * callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduce<U>(callbackfn: (previousValue: U, currentValue: bigint, currentIndex: number, array: BigUint64Array) => U, initialValue: U): U;\n\n /**\n * Calls the specified callback function for all the elements in an array, in descending order.\n * The return value of the callback function is the accumulated result, and is provided as an\n * argument in the next call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls\n * the callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an\n * argument instead of an array value.\n */\n reduceRight(callbackfn: (previousValue: bigint, currentValue: bigint, currentIndex: number, array: BigUint64Array) => bigint): bigint;\n\n /**\n * Calls the specified callback function for all the elements in an array, in descending order.\n * The return value of the callback function is the accumulated result, and is provided as an\n * argument in the next call to the callback function.\n * @param callbackfn A function that accepts up to four arguments. The reduceRight method calls\n * the callbackfn function one time for each element in the array.\n * @param initialValue If initialValue is specified, it is used as the initial value to start\n * the accumulation. The first call to the callbackfn function provides this value as an argument\n * instead of an array value.\n */\n reduceRight<U>(callbackfn: (previousValue: U, currentValue: bigint, currentIndex: number, array: BigUint64Array) => U, initialValue: U): U;\n\n /** Reverses the elements in the array. */\n reverse(): this;\n\n /**\n * Sets a value or an array of values.\n * @param array A typed or untyped array of values to set.\n * @param offset The index in the current array at which the values are to be written.\n */\n set(array: ArrayLike<bigint>, offset?: number): void;\n\n /**\n * Returns a section of an array.\n * @param start The beginning of the specified portion of the array.\n * @param end The end of the specified portion of the array.\n */\n slice(start?: number, end?: number): BigUint64Array;\n\n /**\n * Determines whether the specified callback function returns true for any element of an array.\n * @param predicate A function that accepts up to three arguments. The some method calls the\n * predicate function for each element in the array until the predicate returns true, or until\n * the end of the array.\n * @param thisArg An object to which the this keyword can refer in the predicate function.\n * If thisArg is omitted, undefined is used as the this value.\n */\n some(predicate: (value: bigint, index: number, array: BigUint64Array) => boolean, thisArg?: any): boolean;\n\n /**\n * Sorts the array.\n * @param compareFn The function used to determine the order of the elements. If omitted, the elements are sorted in ascending order.\n */\n sort(compareFn?: (a: bigint, b: bigint) => number | bigint): this;\n\n /**\n * Gets a new BigUint64Array view of the ArrayBuffer store for this array, referencing the elements\n * at begin, inclusive, up to end, exclusive.\n * @param begin The index of the beginning of the array.\n * @param end The index of the end of the array.\n */\n subarray(begin?: number, end?: number): BigUint64Array;\n\n /** Converts the array to a string by using the current locale. */\n toLocaleString(): string;\n\n /** Returns a string representation of the array. */\n toString(): string;\n\n /** Returns the primitive value of the specified object. */\n valueOf(): BigUint64Array;\n\n /** Yields each value in the array. */\n values(): IterableIterator<bigint>;\n\n [Symbol.iterator](): IterableIterator<bigint>;\n\n readonly [Symbol.toStringTag]: "BigUint64Array";\n\n [index: number]: bigint;\n}\n\ninterface BigUint64ArrayConstructor {\n readonly prototype: BigUint64Array;\n new (length?: number): BigUint64Array;\n new (array: Iterable<bigint>): BigUint64Array;\n new (buffer: ArrayBufferLike, byteOffset?: number, length?: number): BigUint64Array;\n\n /** The size in bytes of each element in the array. */\n readonly BYTES_PER_ELEMENT: number;\n\n /**\n * Returns a new array from a set of elements.\n * @param items A set of elements to include in the new array object.\n */\n of(...items: bigint[]): BigUint64Array;\n\n /**\n * Creates an array from an array-like or iterable object.\n * @param arrayLike An array-like or iterable object to convert to an array.\n * @param mapfn A mapping function to call on every element of the array.\n * @param thisArg Value of \'this\' used to invoke the mapfn.\n */\n from(arrayLike: ArrayLike<bigint>): BigUint64Array;\n from<U>(arrayLike: ArrayLike<U>, mapfn: (v: U, k: number) => bigint, thisArg?: any): BigUint64Array;\n}\n\ndeclare var BigUint64Array: BigUint64ArrayConstructor;\n\ninterface DataView {\n /**\n * Gets the BigInt64 value at the specified byte offset from the start of the view. There is\n * no alignment constraint; multi-byte values may be fetched from any offset.\n * @param byteOffset The place in the buffer at which the value should be retrieved.\n * @param littleEndian If false or undefined, a big-endian value should be read.\n */\n getBigInt64(byteOffset: number, littleEndian?: boolean): bigint;\n\n /**\n * Gets the BigUint64 value at the specified byte offset from the start of the view. There is\n * no alignment constraint; multi-byte values may be fetched from any offset.\n * @param byteOffset The place in the buffer at which the value should be retrieved.\n * @param littleEndian If false or undefined, a big-endian value should be read.\n */\n getBigUint64(byteOffset: number, littleEndian?: boolean): bigint;\n\n /**\n * Stores a BigInt64 value at the specified byte offset from the start of the view.\n * @param byteOffset The place in the buffer at which the value should be set.\n * @param value The value to set.\n * @param littleEndian If false or undefined, a big-endian value should be written.\n */\n setBigInt64(byteOffset: number, value: bigint, littleEndian?: boolean): void;\n\n /**\n * Stores a BigUint64 value at the specified byte offset from the start of the view.\n * @param byteOffset The place in the buffer at which the value should be set.\n * @param value The value to set.\n * @param littleEndian If false or undefined, a big-endian value should be written.\n */\n setBigUint64(byteOffset: number, value: bigint, littleEndian?: boolean): void;\n}\n\ndeclare namespace Intl {\n interface NumberFormat {\n format(value: number | bigint): string;\n resolvedOptions(): ResolvedNumberFormatOptions;\n }\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2020.intl" />\n\ninterface Date {\n /**\n * Converts a date and time to a string by using the current or specified locale.\n * @param locales A locale string, array of locale strings, Intl.Locale object, or array of Intl.Locale objects that contain one or more language or locale tags. If you include more than one locale string, list them in descending order of priority so that the first entry is the preferred locale. If you omit this parameter, the default locale of the JavaScript runtime is used.\n * @param options An object that contains one or more properties that specify comparison options.\n */\n toLocaleString(locales?: Intl.LocalesArgument, options?: Intl.DateTimeFormatOptions): string;\n\n /**\n * Converts a date to a string by using the current or specified locale.\n * @param locales A locale string, array of locale strings, Intl.Locale object, or array of Intl.Locale objects that contain one or more language or locale tags. If you include more than one locale string, list them in descending order of priority so that the first entry is the preferred locale. If you omit this parameter, the default locale of the JavaScript runtime is used.\n * @param options An object that contains one or more properties that specify comparison options.\n */\n toLocaleDateString(locales?: Intl.LocalesArgument, options?: Intl.DateTimeFormatOptions): string;\n\n /**\n * Converts a time to a string by using the current or specified locale.\n * @param locales A locale string, array of locale strings, Intl.Locale object, or array of Intl.Locale objects that contain one or more language or locale tags. If you include more than one locale string, list them in descending order of priority so that the first entry is the preferred locale. If you omit this parameter, the default locale of the JavaScript runtime is used.\n * @param options An object that contains one or more properties that specify comparison options.\n */\n toLocaleTimeString(locales?: Intl.LocalesArgument, options?: Intl.DateTimeFormatOptions): string;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2020.intl" />\n\ninterface Number {\n /**\n * Converts a number to a string by using the current or specified locale.\n * @param locales A locale string, array of locale strings, Intl.Locale object, or array of Intl.Locale objects that contain one or more language or locale tags. If you include more than one locale string, list them in descending order of priority so that the first entry is the preferred locale. If you omit this parameter, the default locale of the JavaScript runtime is used.\n * @param options An object that contains one or more properties that specify comparison options.\n */\n toLocaleString(locales?: Intl.LocalesArgument, options?: Intl.NumberFormatOptions): string;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2021" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n/// <reference lib="dom.asynciterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2021" />\n/// <reference lib="es2022.array" />\n/// <reference lib="es2022.error" />\n/// <reference lib="es2022.intl" />\n/// <reference lib="es2022.object" />\n/// <reference lib="es2022.sharedmemory" />\n/// <reference lib="es2022.string" />\n/// <reference lib="es2022.regexp" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2022" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n/// <reference lib="dom.asynciterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2022" />\n/// <reference lib="es2023.array" />\n/// <reference lib="es2023.collection" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es2023" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n/// <reference lib="dom.iterable" />\n/// <reference lib="dom.asynciterable" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es5" />\n/// <reference lib="dom" />\n/// <reference lib="webworker.importscripts" />\n/// <reference lib="scripthost" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/// <reference lib="es5" />\n/// <reference lib="es2015.core" />\n/// <reference lib="es2015.collection" />\n/// <reference lib="es2015.iterable" />\n/// <reference lib="es2015.generator" />\n/// <reference lib="es2015.promise" />\n/// <reference lib="es2015.proxy" />\n/// <reference lib="es2015.reflect" />\n/// <reference lib="es2015.symbol" />\n/// <reference lib="es2015.symbol.wellknown" />\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/////////////////////////////\n/// Window Async Iterable APIs\n/////////////////////////////\n\ninterface FileSystemDirectoryHandle {\n [Symbol.asyncIterator](): AsyncIterableIterator<[string, FileSystemHandle]>;\n entries(): AsyncIterableIterator<[string, FileSystemHandle]>;\n keys(): AsyncIterableIterator<string>;\n values(): AsyncIterableIterator<FileSystemHandle>;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\n/////////////////////////////\n/// Window Iterable APIs\n/////////////////////////////\n\ninterface AudioParam {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/AudioParam/setValueCurveAtTime) */\n setValueCurveAtTime(values: Iterable<number>, startTime: number, duration: number): AudioParam;\n}\n\ninterface AudioParamMap extends ReadonlyMap<string, AudioParam> {\n}\n\ninterface BaseAudioContext {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/BaseAudioContext/createIIRFilter) */\n createIIRFilter(feedforward: Iterable<number>, feedback: Iterable<number>): IIRFilterNode;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/BaseAudioContext/createPeriodicWave) */\n createPeriodicWave(real: Iterable<number>, imag: Iterable<number>, constraints?: PeriodicWaveConstraints): PeriodicWave;\n}\n\ninterface CSSKeyframesRule {\n [Symbol.iterator](): IterableIterator<CSSKeyframeRule>;\n}\n\ninterface CSSNumericArray {\n [Symbol.iterator](): IterableIterator<CSSNumericValue>;\n entries(): IterableIterator<[number, CSSNumericValue]>;\n keys(): IterableIterator<number>;\n values(): IterableIterator<CSSNumericValue>;\n}\n\ninterface CSSRuleList {\n [Symbol.iterator](): IterableIterator<CSSRule>;\n}\n\ninterface CSSStyleDeclaration {\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface CSSTransformValue {\n [Symbol.iterator](): IterableIterator<CSSTransformComponent>;\n entries(): IterableIterator<[number, CSSTransformComponent]>;\n keys(): IterableIterator<number>;\n values(): IterableIterator<CSSTransformComponent>;\n}\n\ninterface CSSUnparsedValue {\n [Symbol.iterator](): IterableIterator<CSSUnparsedSegment>;\n entries(): IterableIterator<[number, CSSUnparsedSegment]>;\n keys(): IterableIterator<number>;\n values(): IterableIterator<CSSUnparsedSegment>;\n}\n\ninterface Cache {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/Cache/addAll) */\n addAll(requests: Iterable<RequestInfo>): Promise<void>;\n}\n\ninterface CanvasPath {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/CanvasRenderingContext2D/roundRect) */\n roundRect(x: number, y: number, w: number, h: number, radii?: number | DOMPointInit | Iterable<number | DOMPointInit>): void;\n}\n\ninterface CanvasPathDrawingStyles {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/CanvasRenderingContext2D/setLineDash) */\n setLineDash(segments: Iterable<number>): void;\n}\n\ninterface DOMRectList {\n [Symbol.iterator](): IterableIterator<DOMRect>;\n}\n\ninterface DOMStringList {\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface DOMTokenList {\n [Symbol.iterator](): IterableIterator<string>;\n entries(): IterableIterator<[number, string]>;\n keys(): IterableIterator<number>;\n values(): IterableIterator<string>;\n}\n\ninterface DataTransferItemList {\n [Symbol.iterator](): IterableIterator<DataTransferItem>;\n}\n\ninterface EventCounts extends ReadonlyMap<string, number> {\n}\n\ninterface FileList {\n [Symbol.iterator](): IterableIterator<File>;\n}\n\ninterface FontFaceSet extends Set<FontFace> {\n}\n\ninterface FormData {\n [Symbol.iterator](): IterableIterator<[string, FormDataEntryValue]>;\n /** Returns an array of key, value pairs for every entry in the list. */\n entries(): IterableIterator<[string, FormDataEntryValue]>;\n /** Returns a list of keys in the list. */\n keys(): IterableIterator<string>;\n /** Returns a list of values in the list. */\n values(): IterableIterator<FormDataEntryValue>;\n}\n\ninterface HTMLAllCollection {\n [Symbol.iterator](): IterableIterator<Element>;\n}\n\ninterface HTMLCollectionBase {\n [Symbol.iterator](): IterableIterator<Element>;\n}\n\ninterface HTMLCollectionOf<T extends Element> {\n [Symbol.iterator](): IterableIterator<T>;\n}\n\ninterface HTMLFormElement {\n [Symbol.iterator](): IterableIterator<Element>;\n}\n\ninterface HTMLSelectElement {\n [Symbol.iterator](): IterableIterator<HTMLOptionElement>;\n}\n\ninterface Headers {\n [Symbol.iterator](): IterableIterator<[string, string]>;\n /** Returns an iterator allowing to go through all key/value pairs contained in this object. */\n entries(): IterableIterator<[string, string]>;\n /** Returns an iterator allowing to go through all keys of the key/value pairs contained in this object. */\n keys(): IterableIterator<string>;\n /** Returns an iterator allowing to go through all values of the key/value pairs contained in this object. */\n values(): IterableIterator<string>;\n}\n\ninterface Highlight extends Set<AbstractRange> {\n}\n\ninterface HighlightRegistry extends Map<string, Highlight> {\n}\n\ninterface IDBDatabase {\n /**\n * Returns a new transaction with the given mode ("readonly" or "readwrite") and scope which can be a single object store name or an array of names.\n *\n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/IDBDatabase/transaction)\n */\n transaction(storeNames: string | Iterable<string>, mode?: IDBTransactionMode, options?: IDBTransactionOptions): IDBTransaction;\n}\n\ninterface IDBObjectStore {\n /**\n * Creates a new index in store with the given name, keyPath and options and returns a new IDBIndex. If the keyPath and options define constraints that cannot be satisfied with the data already in store the upgrade transaction will abort with a "ConstraintError" DOMException.\n *\n * Throws an "InvalidStateError" DOMException if not called within an upgrade transaction.\n *\n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/IDBObjectStore/createIndex)\n */\n createIndex(name: string, keyPath: string | Iterable<string>, options?: IDBIndexParameters): IDBIndex;\n}\n\ninterface MIDIInputMap extends ReadonlyMap<string, MIDIInput> {\n}\n\ninterface MIDIOutput {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/MIDIOutput/send) */\n send(data: Iterable<number>, timestamp?: DOMHighResTimeStamp): void;\n}\n\ninterface MIDIOutputMap extends ReadonlyMap<string, MIDIOutput> {\n}\n\ninterface MediaKeyStatusMap {\n [Symbol.iterator](): IterableIterator<[BufferSource, MediaKeyStatus]>;\n entries(): IterableIterator<[BufferSource, MediaKeyStatus]>;\n keys(): IterableIterator<BufferSource>;\n values(): IterableIterator<MediaKeyStatus>;\n}\n\ninterface MediaList {\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface MessageEvent<T = any> {\n /**\n * @deprecated\n *\n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/MessageEvent/initMessageEvent)\n */\n initMessageEvent(type: string, bubbles?: boolean, cancelable?: boolean, data?: any, origin?: string, lastEventId?: string, source?: MessageEventSource | null, ports?: Iterable<MessagePort>): void;\n}\n\ninterface MimeTypeArray {\n [Symbol.iterator](): IterableIterator<MimeType>;\n}\n\ninterface NamedNodeMap {\n [Symbol.iterator](): IterableIterator<Attr>;\n}\n\ninterface Navigator {\n /**\n * Available only in secure contexts.\n *\n * [MDN Reference](https://developer.mozilla.org/docs/Web/API/Navigator/requestMediaKeySystemAccess)\n */\n requestMediaKeySystemAccess(keySystem: string, supportedConfigurations: Iterable<MediaKeySystemConfiguration>): Promise<MediaKeySystemAccess>;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/Navigator/vibrate) */\n vibrate(pattern: Iterable<number>): boolean;\n}\n\ninterface NodeList {\n [Symbol.iterator](): IterableIterator<Node>;\n /** Returns an array of key, value pairs for every entry in the list. */\n entries(): IterableIterator<[number, Node]>;\n /** Returns an list of keys in the list. */\n keys(): IterableIterator<number>;\n /** Returns an list of values in the list. */\n values(): IterableIterator<Node>;\n}\n\ninterface NodeListOf<TNode extends Node> {\n [Symbol.iterator](): IterableIterator<TNode>;\n /** Returns an array of key, value pairs for every entry in the list. */\n entries(): IterableIterator<[number, TNode]>;\n /** Returns an list of keys in the list. */\n keys(): IterableIterator<number>;\n /** Returns an list of values in the list. */\n values(): IterableIterator<TNode>;\n}\n\ninterface Plugin {\n [Symbol.iterator](): IterableIterator<MimeType>;\n}\n\ninterface PluginArray {\n [Symbol.iterator](): IterableIterator<Plugin>;\n}\n\ninterface RTCRtpTransceiver {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/RTCRtpTransceiver/setCodecPreferences) */\n setCodecPreferences(codecs: Iterable<RTCRtpCodecCapability>): void;\n}\n\ninterface RTCStatsReport extends ReadonlyMap<string, any> {\n}\n\ninterface SVGLengthList {\n [Symbol.iterator](): IterableIterator<SVGLength>;\n}\n\ninterface SVGNumberList {\n [Symbol.iterator](): IterableIterator<SVGNumber>;\n}\n\ninterface SVGPointList {\n [Symbol.iterator](): IterableIterator<DOMPoint>;\n}\n\ninterface SVGStringList {\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface SVGTransformList {\n [Symbol.iterator](): IterableIterator<SVGTransform>;\n}\n\ninterface SourceBufferList {\n [Symbol.iterator](): IterableIterator<SourceBuffer>;\n}\n\ninterface SpeechRecognitionResult {\n [Symbol.iterator](): IterableIterator<SpeechRecognitionAlternative>;\n}\n\ninterface SpeechRecognitionResultList {\n [Symbol.iterator](): IterableIterator<SpeechRecognitionResult>;\n}\n\ninterface StylePropertyMapReadOnly {\n [Symbol.iterator](): IterableIterator<[string, Iterable<CSSStyleValue>]>;\n entries(): IterableIterator<[string, Iterable<CSSStyleValue>]>;\n keys(): IterableIterator<string>;\n values(): IterableIterator<Iterable<CSSStyleValue>>;\n}\n\ninterface StyleSheetList {\n [Symbol.iterator](): IterableIterator<CSSStyleSheet>;\n}\n\ninterface SubtleCrypto {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/SubtleCrypto/deriveKey) */\n deriveKey(algorithm: AlgorithmIdentifier | EcdhKeyDeriveParams | HkdfParams | Pbkdf2Params, baseKey: CryptoKey, derivedKeyType: AlgorithmIdentifier | AesDerivedKeyParams | HmacImportParams | HkdfParams | Pbkdf2Params, extractable: boolean, keyUsages: Iterable<KeyUsage>): Promise<CryptoKey>;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/SubtleCrypto/generateKey) */\n generateKey(algorithm: "Ed25519", extractable: boolean, keyUsages: ReadonlyArray<"sign" | "verify">): Promise<CryptoKeyPair>;\n generateKey(algorithm: RsaHashedKeyGenParams | EcKeyGenParams, extractable: boolean, keyUsages: ReadonlyArray<KeyUsage>): Promise<CryptoKeyPair>;\n generateKey(algorithm: AesKeyGenParams | HmacKeyGenParams | Pbkdf2Params, extractable: boolean, keyUsages: ReadonlyArray<KeyUsage>): Promise<CryptoKey>;\n generateKey(algorithm: AlgorithmIdentifier, extractable: boolean, keyUsages: Iterable<KeyUsage>): Promise<CryptoKeyPair | CryptoKey>;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/SubtleCrypto/importKey) */\n importKey(format: "jwk", keyData: JsonWebKey, algorithm: AlgorithmIdentifier | RsaHashedImportParams | EcKeyImportParams | HmacImportParams | AesKeyAlgorithm, extractable: boolean, keyUsages: ReadonlyArray<KeyUsage>): Promise<CryptoKey>;\n importKey(format: Exclude<KeyFormat, "jwk">, keyData: BufferSource, algorithm: AlgorithmIdentifier | RsaHashedImportParams | EcKeyImportParams | HmacImportParams | AesKeyAlgorithm, extractable: boolean, keyUsages: Iterable<KeyUsage>): Promise<CryptoKey>;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/SubtleCrypto/unwrapKey) */\n unwrapKey(format: KeyFormat, wrappedKey: BufferSource, unwrappingKey: CryptoKey, unwrapAlgorithm: AlgorithmIdentifier | RsaOaepParams | AesCtrParams | AesCbcParams | AesGcmParams, unwrappedKeyAlgorithm: AlgorithmIdentifier | RsaHashedImportParams | EcKeyImportParams | HmacImportParams | AesKeyAlgorithm, extractable: boolean, keyUsages: Iterable<KeyUsage>): Promise<CryptoKey>;\n}\n\ninterface TextTrackCueList {\n [Symbol.iterator](): IterableIterator<TextTrackCue>;\n}\n\ninterface TextTrackList {\n [Symbol.iterator](): IterableIterator<TextTrack>;\n}\n\ninterface TouchList {\n [Symbol.iterator](): IterableIterator<Touch>;\n}\n\ninterface URLSearchParams {\n [Symbol.iterator](): IterableIterator<[string, string]>;\n /** Returns an array of key, value pairs for every entry in the search params. */\n entries(): IterableIterator<[string, string]>;\n /** Returns a list of keys in the search params. */\n keys(): IterableIterator<string>;\n /** Returns a list of values in the search params. */\n values(): IterableIterator<string>;\n}\n\ninterface WEBGL_draw_buffers {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WEBGL_draw_buffers/drawBuffersWEBGL) */\n drawBuffersWEBGL(buffers: Iterable<GLenum>): void;\n}\n\ninterface WEBGL_multi_draw {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WEBGL_multi_draw/multiDrawArraysInstancedWEBGL) */\n multiDrawArraysInstancedWEBGL(mode: GLenum, firstsList: Int32Array | Iterable<GLint>, firstsOffset: number, countsList: Int32Array | Iterable<GLsizei>, countsOffset: number, instanceCountsList: Int32Array | Iterable<GLsizei>, instanceCountsOffset: number, drawcount: GLsizei): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WEBGL_multi_draw/multiDrawArraysWEBGL) */\n multiDrawArraysWEBGL(mode: GLenum, firstsList: Int32Array | Iterable<GLint>, firstsOffset: number, countsList: Int32Array | Iterable<GLsizei>, countsOffset: number, drawcount: GLsizei): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WEBGL_multi_draw/multiDrawElementsInstancedWEBGL) */\n multiDrawElementsInstancedWEBGL(mode: GLenum, countsList: Int32Array | Iterable<GLsizei>, countsOffset: number, type: GLenum, offsetsList: Int32Array | Iterable<GLsizei>, offsetsOffset: number, instanceCountsList: Int32Array | Iterable<GLsizei>, instanceCountsOffset: number, drawcount: GLsizei): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WEBGL_multi_draw/multiDrawElementsWEBGL) */\n multiDrawElementsWEBGL(mode: GLenum, countsList: Int32Array | Iterable<GLsizei>, countsOffset: number, type: GLenum, offsetsList: Int32Array | Iterable<GLsizei>, offsetsOffset: number, drawcount: GLsizei): void;\n}\n\ninterface WebGL2RenderingContextBase {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/clearBuffer) */\n clearBufferfv(buffer: GLenum, drawbuffer: GLint, values: Iterable<GLfloat>, srcOffset?: number): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/clearBuffer) */\n clearBufferiv(buffer: GLenum, drawbuffer: GLint, values: Iterable<GLint>, srcOffset?: number): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/clearBuffer) */\n clearBufferuiv(buffer: GLenum, drawbuffer: GLint, values: Iterable<GLuint>, srcOffset?: number): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/drawBuffers) */\n drawBuffers(buffers: Iterable<GLenum>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/getActiveUniforms) */\n getActiveUniforms(program: WebGLProgram, uniformIndices: Iterable<GLuint>, pname: GLenum): any;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/getUniformIndices) */\n getUniformIndices(program: WebGLProgram, uniformNames: Iterable<string>): Iterable<GLuint> | null;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/invalidateFramebuffer) */\n invalidateFramebuffer(target: GLenum, attachments: Iterable<GLenum>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/invalidateSubFramebuffer) */\n invalidateSubFramebuffer(target: GLenum, attachments: Iterable<GLenum>, x: GLint, y: GLint, width: GLsizei, height: GLsizei): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/transformFeedbackVaryings) */\n transformFeedbackVaryings(program: WebGLProgram, varyings: Iterable<string>, bufferMode: GLenum): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniform) */\n uniform1uiv(location: WebGLUniformLocation | null, data: Iterable<GLuint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniform) */\n uniform2uiv(location: WebGLUniformLocation | null, data: Iterable<GLuint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniform) */\n uniform3uiv(location: WebGLUniformLocation | null, data: Iterable<GLuint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniform) */\n uniform4uiv(location: WebGLUniformLocation | null, data: Iterable<GLuint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniformMatrix) */\n uniformMatrix2x3fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniformMatrix) */\n uniformMatrix2x4fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniformMatrix) */\n uniformMatrix3x2fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniformMatrix) */\n uniformMatrix3x4fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniformMatrix) */\n uniformMatrix4x2fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/uniformMatrix) */\n uniformMatrix4x3fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/vertexAttribI) */\n vertexAttribI4iv(index: GLuint, values: Iterable<GLint>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGL2RenderingContext/vertexAttribI) */\n vertexAttribI4uiv(index: GLuint, values: Iterable<GLuint>): void;\n}\n\ninterface WebGL2RenderingContextOverloads {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform1fv(location: WebGLUniformLocation | null, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform1iv(location: WebGLUniformLocation | null, data: Iterable<GLint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform2fv(location: WebGLUniformLocation | null, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform2iv(location: WebGLUniformLocation | null, data: Iterable<GLint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform3fv(location: WebGLUniformLocation | null, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform3iv(location: WebGLUniformLocation | null, data: Iterable<GLint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform4fv(location: WebGLUniformLocation | null, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform4iv(location: WebGLUniformLocation | null, data: Iterable<GLint>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniformMatrix) */\n uniformMatrix2fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniformMatrix) */\n uniformMatrix3fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniformMatrix) */\n uniformMatrix4fv(location: WebGLUniformLocation | null, transpose: GLboolean, data: Iterable<GLfloat>, srcOffset?: number, srcLength?: GLuint): void;\n}\n\ninterface WebGLRenderingContextBase {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/vertexAttrib) */\n vertexAttrib1fv(index: GLuint, values: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/vertexAttrib) */\n vertexAttrib2fv(index: GLuint, values: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/vertexAttrib) */\n vertexAttrib3fv(index: GLuint, values: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/vertexAttrib) */\n vertexAttrib4fv(index: GLuint, values: Iterable<GLfloat>): void;\n}\n\ninterface WebGLRenderingContextOverloads {\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform1fv(location: WebGLUniformLocation | null, v: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform1iv(location: WebGLUniformLocation | null, v: Iterable<GLint>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform2fv(location: WebGLUniformLocation | null, v: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform2iv(location: WebGLUniformLocation | null, v: Iterable<GLint>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform3fv(location: WebGLUniformLocation | null, v: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform3iv(location: WebGLUniformLocation | null, v: Iterable<GLint>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform4fv(location: WebGLUniformLocation | null, v: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniform) */\n uniform4iv(location: WebGLUniformLocation | null, v: Iterable<GLint>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniformMatrix) */\n uniformMatrix2fv(location: WebGLUniformLocation | null, transpose: GLboolean, value: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniformMatrix) */\n uniformMatrix3fv(location: WebGLUniformLocation | null, transpose: GLboolean, value: Iterable<GLfloat>): void;\n /** [MDN Reference](https://developer.mozilla.org/docs/Web/API/WebGLRenderingContext/uniformMatrix) */\n uniformMatrix4fv(location: WebGLUniformLocation | null, transpose: GLboolean, value: Iterable<GLfloat>): void;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare namespace Intl {\n /**\n * An object with some or all properties of the `Intl.Segmenter` constructor `options` parameter.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/Segmenter#parameters)\n */\n interface SegmenterOptions {\n /** The locale matching algorithm to use. For information about this option, see [Intl page](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_negotiation). */\n localeMatcher?: "best fit" | "lookup" | undefined;\n /** The type of input to be split */\n granularity?: "grapheme" | "word" | "sentence" | undefined;\n }\n\n interface Segmenter {\n /**\n * Returns `Segments` object containing the segments of the input string, using the segmenter\'s locale and granularity.\n *\n * @param input - The text to be segmented as a `string`.\n *\n * @returns A new iterable Segments object containing the segments of the input string, using the segmenter\'s locale and granularity.\n */\n segment(input: string): Segments;\n resolvedOptions(): ResolvedSegmenterOptions;\n }\n\n interface ResolvedSegmenterOptions {\n locale: string;\n granularity: "grapheme" | "word" | "sentence";\n }\n\n interface Segments {\n /**\n * Returns an object describing the segment in the original string that includes the code unit at a specified index.\n *\n * @param codeUnitIndex - A number specifying the index of the code unit in the original input string. If the value is omitted, it defaults to `0`.\n */\n containing(codeUnitIndex?: number): SegmentData;\n\n /** Returns an iterator to iterate over the segments. */\n [Symbol.iterator](): IterableIterator<SegmentData>;\n }\n\n interface SegmentData {\n /** A string containing the segment extracted from the original input string. */\n segment: string;\n /** The code unit index in the original input string at which the segment begins. */\n index: number;\n /** The complete input string that was segmented. */\n input: string;\n /**\n * A boolean value only if granularity is "word"; otherwise, undefined.\n * If granularity is "word", then isWordLike is true when the segment is word-like (i.e., consists of letters/numbers/ideographs/etc.); otherwise, false.\n */\n isWordLike?: boolean;\n }\n\n const Segmenter: {\n prototype: Segmenter;\n\n /**\n * Creates a new `Intl.Segmenter` object.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the `locales` argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/Segmenter#parameters)\n * with some or all options of `SegmenterOptions`.\n *\n * @returns [Intl.Segmenter](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segments) object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter).\n */\n new (locales?: LocalesArgument, options?: SegmenterOptions): Segmenter;\n\n /**\n * Returns an array containing those of the provided locales that are supported without having to fall back to the runtime\'s default locale.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the `locales` argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/supportedLocalesOf#parameters).\n * with some or all possible options.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/Segmenter/supportedLocalesOf)\n */\n supportedLocalesOf(locales: LocalesArgument, options?: Pick<SegmenterOptions, "localeMatcher">): UnicodeBCP47LocaleIdentifier[];\n };\n\n /**\n * Returns a sorted array of the supported collation, calendar, currency, numbering system, timezones, and units by the implementation.\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/supportedValuesOf)\n *\n * @param key A string indicating the category of values to return.\n * @returns A sorted array of the supported values.\n */\n function supportedValuesOf(key: "calendar" | "collation" | "currency" | "numberingSystem" | "timeZone" | "unit"): string[];\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare namespace Intl {\n /**\n * The `Intl.getCanonicalLocales()` method returns an array containing\n * the canonical locale names. Duplicates will be omitted and elements\n * will be validated as structurally valid language tags.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/getCanonicalLocales)\n *\n * @param locale A list of String values for which to get the canonical locale names\n * @returns An array containing the canonical and validated locale names.\n */\n function getCanonicalLocales(locale?: string | readonly string[]): string[];\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare namespace Intl {\n interface DateTimeFormatPartTypesRegistry {\n day: any;\n dayPeriod: any;\n era: any;\n hour: any;\n literal: any;\n minute: any;\n month: any;\n second: any;\n timeZoneName: any;\n weekday: any;\n year: any;\n }\n\n type DateTimeFormatPartTypes = keyof DateTimeFormatPartTypesRegistry;\n\n interface DateTimeFormatPart {\n type: DateTimeFormatPartTypes;\n value: string;\n }\n\n interface DateTimeFormat {\n formatToParts(date?: Date | number): DateTimeFormatPart[];\n }\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare namespace Intl {\n interface DateTimeFormatPartTypesRegistry {\n fractionalSecond: any;\n }\n\n interface DateTimeFormatOptions {\n formatMatcher?: "basic" | "best fit" | "best fit" | undefined;\n dateStyle?: "full" | "long" | "medium" | "short" | undefined;\n timeStyle?: "full" | "long" | "medium" | "short" | undefined;\n dayPeriod?: "narrow" | "short" | "long" | undefined;\n fractionalSecondDigits?: 1 | 2 | 3 | undefined;\n }\n\n interface DateTimeRangeFormatPart extends DateTimeFormatPart {\n source: "startRange" | "endRange" | "shared";\n }\n\n interface DateTimeFormat {\n formatRange(startDate: Date | number | bigint, endDate: Date | number | bigint): string;\n formatRangeToParts(startDate: Date | number | bigint, endDate: Date | number | bigint): DateTimeRangeFormatPart[];\n }\n\n interface ResolvedDateTimeFormatOptions {\n formatMatcher?: "basic" | "best fit" | "best fit";\n dateStyle?: "full" | "long" | "medium" | "short";\n timeStyle?: "full" | "long" | "medium" | "short";\n hourCycle?: "h11" | "h12" | "h23" | "h24";\n dayPeriod?: "narrow" | "short" | "long";\n fractionalSecondDigits?: 1 | 2 | 3;\n }\n\n /**\n * The locale matching algorithm to use.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/ListFormat#parameters).\n */\n type ListFormatLocaleMatcher = "lookup" | "best fit";\n\n /**\n * The format of output message.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/ListFormat#parameters).\n */\n type ListFormatType = "conjunction" | "disjunction" | "unit";\n\n /**\n * The length of the formatted message.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/ListFormat#parameters).\n */\n type ListFormatStyle = "long" | "short" | "narrow";\n\n /**\n * An object with some or all properties of the `Intl.ListFormat` constructor `options` parameter.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/ListFormat#parameters).\n */\n interface ListFormatOptions {\n /** The locale matching algorithm to use. For information about this option, see [Intl page](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_negotiation). */\n localeMatcher?: ListFormatLocaleMatcher | undefined;\n /** The format of output message. */\n type?: ListFormatType | undefined;\n /** The length of the internationalized message. */\n style?: ListFormatStyle | undefined;\n }\n\n interface ResolvedListFormatOptions {\n locale: string;\n style: ListFormatStyle;\n type: ListFormatType;\n }\n\n interface ListFormat {\n /**\n * Returns a string with a language-specific representation of the list.\n *\n * @param list - An iterable object, such as an [Array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array).\n *\n * @throws `TypeError` if `list` includes something other than the possible values.\n *\n * @returns {string} A language-specific formatted string representing the elements of the list.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/format).\n */\n format(list: Iterable<string>): string;\n\n /**\n * Returns an Array of objects representing the different components that can be used to format a list of values in a locale-aware fashion.\n *\n * @param list - An iterable object, such as an [Array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array), to be formatted according to a locale.\n *\n * @throws `TypeError` if `list` includes something other than the possible values.\n *\n * @returns {{ type: "element" | "literal", value: string; }[]} An Array of components which contains the formatted parts from the list.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/formatToParts).\n */\n formatToParts(list: Iterable<string>): { type: "element" | "literal"; value: string; }[];\n\n /**\n * Returns a new object with properties reflecting the locale and style\n * formatting options computed during the construction of the current\n * `Intl.ListFormat` object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/resolvedOptions).\n */\n resolvedOptions(): ResolvedListFormatOptions;\n }\n\n const ListFormat: {\n prototype: ListFormat;\n\n /**\n * Creates [Intl.ListFormat](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat) objects that\n * enable language-sensitive list formatting.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the `locales` argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/ListFormat#parameters)\n * with some or all options of `ListFormatOptions`.\n *\n * @returns [Intl.ListFormatOptions](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat) object.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat).\n */\n new (locales?: LocalesArgument, options?: ListFormatOptions): ListFormat;\n\n /**\n * Returns an array containing those of the provided locales that are\n * supported in list formatting without having to fall back to the runtime\'s default locale.\n *\n * @param locales - A string with a [BCP 47 language tag](http://tools.ietf.org/html/rfc5646), or an array of such strings.\n * For the general form and interpretation of the `locales` argument,\n * see the [`Intl` page](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl#Locale_identification_and_negotiation).\n *\n * @param options - An [object](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/supportedLocalesOf#parameters).\n * with some or all possible options.\n *\n * @returns An array of strings representing a subset of the given locale tags that are supported in list\n * formatting without having to fall back to the runtime\'s default locale.\n *\n * [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/ListFormat/supportedLocalesOf).\n */\n supportedLocalesOf(locales: LocalesArgument, options?: Pick<ListFormatOptions, "localeMatcher">): UnicodeBCP47LocaleIdentifier[];\n };\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare namespace Intl {\n interface DateTimeFormatPartTypesRegistry {\n unknown: any;\n }\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare namespace Reflect {\n /**\n * Calls the function with the specified object as the this value\n * and the elements of specified array as the arguments.\n * @param target The function to call.\n * @param thisArgument The object to be used as the this object.\n * @param argumentsList An array of argument values to be passed to the function.\n */\n function apply<T, A extends readonly any[], R>(\n target: (this: T, ...args: A) => R,\n thisArgument: T,\n argumentsList: Readonly<A>,\n ): R;\n function apply(target: Function, thisArgument: any, argumentsList: ArrayLike<any>): any;\n\n /**\n * Constructs the target with the elements of specified array as the arguments\n * and the specified constructor as the `new.target` value.\n * @param target The constructor to invoke.\n * @param argumentsList An array of argument values to be passed to the constructor.\n * @param newTarget The constructor to be used as the `new.target` object.\n */\n function construct<A extends readonly any[], R>(\n target: new (...args: A) => R,\n argumentsList: Readonly<A>,\n newTarget?: new (...args: any) => any,\n ): R;\n function construct(target: Function, argumentsList: ArrayLike<any>, newTarget?: Function): any;\n\n /**\n * Adds a property to an object, or modifies attributes of an existing property.\n * @param target Object on which to add or modify the property. This can be a native JavaScript object\n * (that is, a user-defined object or a built in object) or a DOM object.\n * @param propertyKey The property name.\n * @param attributes Descriptor for the property. It can be for a data property or an accessor property.\n */\n function defineProperty(target: object, propertyKey: PropertyKey, attributes: PropertyDescriptor & ThisType<any>): boolean;\n\n /**\n * Removes a property from an object, equivalent to `delete target[propertyKey]`,\n * except it won\'t throw if `target[propertyKey]` is non-configurable.\n * @param target Object from which to remove the own property.\n * @param propertyKey The property name.\n */\n function deleteProperty(target: object, propertyKey: PropertyKey): boolean;\n\n /**\n * Gets the property of target, equivalent to `target[propertyKey]` when `receiver === target`.\n * @param target Object that contains the property on itself or in its prototype chain.\n * @param propertyKey The property name.\n * @param receiver The reference to use as the `this` value in the getter function,\n * if `target[propertyKey]` is an accessor property.\n */\n function get<T extends object, P extends PropertyKey>(\n target: T,\n propertyKey: P,\n receiver?: unknown,\n ): P extends keyof T ? T[P] : any;\n\n /**\n * Gets the own property descriptor of the specified object.\n * An own property descriptor is one that is defined directly on the object and is not inherited from the object\'s prototype.\n * @param target Object that contains the property.\n * @param propertyKey The property name.\n */\n function getOwnPropertyDescriptor<T extends object, P extends PropertyKey>(\n target: T,\n propertyKey: P,\n ): TypedPropertyDescriptor<P extends keyof T ? T[P] : any> | undefined;\n\n /**\n * Returns the prototype of an object.\n * @param target The object that references the prototype.\n */\n function getPrototypeOf(target: object): object | null;\n\n /**\n * Equivalent to `propertyKey in target`.\n * @param target Object that contains the property on itself or in its prototype chain.\n * @param propertyKey Name of the property.\n */\n function has(target: object, propertyKey: PropertyKey): boolean;\n\n /**\n * Returns a value that indicates whether new properties can be added to an object.\n * @param target Object to test.\n */\n function isExtensible(target: object): boolean;\n\n /**\n * Returns the string and symbol keys of the own properties of an object. The own properties of an object\n * are those that are defined directly on that object, and are not inherited from the object\'s prototype.\n * @param target Object that contains the own properties.\n */\n function ownKeys(target: object): (string | symbol)[];\n\n /**\n * Prevents the addition of new properties to an object.\n * @param target Object to make non-extensible.\n * @return Whether the object has been made non-extensible.\n */\n function preventExtensions(target: object): boolean;\n\n /**\n * Sets the property of target, equivalent to `target[propertyKey] = value` when `receiver === target`.\n * @param target Object that contains the property on itself or in its prototype chain.\n * @param propertyKey Name of the property.\n * @param receiver The reference to use as the `this` value in the setter function,\n * if `target[propertyKey]` is an accessor property.\n */\n function set<T extends object, P extends PropertyKey>(\n target: T,\n propertyKey: P,\n value: P extends keyof T ? T[P] : any,\n receiver?: any,\n ): boolean;\n function set(target: object, propertyKey: PropertyKey, value: any, receiver?: any): boolean;\n\n /**\n * Sets the prototype of a specified object o to object proto or null.\n * @param target The object to change its prototype.\n * @param proto The value of the new prototype or null.\n * @return Whether setting the prototype was successful.\n */\n function setPrototypeOf(target: object, proto: object | null): boolean;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ndeclare type ClassDecorator = <TFunction extends Function>(target: TFunction) => TFunction | void;\ndeclare type PropertyDecorator = (target: Object, propertyKey: string | symbol) => void;\ndeclare type MethodDecorator = <T>(target: Object, propertyKey: string | symbol, descriptor: TypedPropertyDescriptor<T>) => TypedPropertyDescriptor<T> | void;\ndeclare type ParameterDecorator = (target: Object, propertyKey: string | symbol | undefined, parameterIndex: number) => void;\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface AggregateError extends Error {\n errors: any[];\n}\n\ninterface AggregateErrorConstructor {\n new (errors: Iterable<any>, message?: string): AggregateError;\n (errors: Iterable<any>, message?: string): AggregateError;\n readonly prototype: AggregateError;\n}\n\ndeclare var AggregateError: AggregateErrorConstructor;\n\n/**\n * Represents the completion of an asynchronous operation\n */\ninterface PromiseConstructor {\n /**\n * The any function returns a promise that is fulfilled by the first given promise to be fulfilled, or rejected with an AggregateError containing an array of rejection reasons if all of the given promises are rejected. It resolves all elements of the passed iterable to promises as it runs this algorithm.\n * @param values An array or iterable of Promises.\n * @returns A new Promise.\n */\n any<T extends readonly unknown[] | []>(values: T): Promise<Awaited<T[number]>>;\n\n /**\n * The any function returns a promise that is fulfilled by the first given promise to be fulfilled, or rejected with an AggregateError containing an array of rejection reasons if all of the given promises are rejected. It resolves all elements of the passed iterable to promises as it runs this algorithm.\n * @param values An array or iterable of Promises.\n * @returns A new Promise.\n */\n any<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>>;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Array<T> {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: T, fromIndex?: number): boolean;\n}\n\ninterface ReadonlyArray<T> {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: T, fromIndex?: number): boolean;\n}\n\ninterface Int8Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Uint8Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Uint8ClampedArray {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Int16Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Uint16Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Int32Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Uint32Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Float32Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n\ninterface Float64Array {\n /**\n * Determines whether an array includes a certain element, returning true or false as appropriate.\n * @param searchElement The element to search for.\n * @param fromIndex The position in this array at which to begin searching for searchElement.\n */\n includes(searchElement: number, fromIndex?: number): boolean;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Array<T> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): T | undefined;\n}\n\ninterface ReadonlyArray<T> {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): T | undefined;\n}\n\ninterface Int8Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint8Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint8ClampedArray {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Int16Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint16Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Int32Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Uint32Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Float32Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface Float64Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): number | undefined;\n}\n\ninterface BigInt64Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): bigint | undefined;\n}\n\ninterface BigUint64Array {\n /**\n * Returns the item located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): bigint | undefined;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Array<T> {\n /**\n * Returns the value of the first element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found, find\n * immediately returns that element value. Otherwise, find returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n find<S extends T>(predicate: (value: T, index: number, obj: T[]) => value is S, thisArg?: any): S | undefined;\n find(predicate: (value: T, index: number, obj: T[]) => unknown, thisArg?: any): T | undefined;\n\n /**\n * Returns the index of the first element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findIndex immediately returns that element index. Otherwise, findIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findIndex(predicate: (value: T, index: number, obj: T[]) => unknown, thisArg?: any): number;\n\n /**\n * Changes all array elements from `start` to `end` index to a static `value` and returns the modified array\n * @param value value to fill array section with\n * @param start index to start filling the array at. If start is negative, it is treated as\n * length+start where length is the length of the array.\n * @param end index to stop filling the array at. If end is negative, it is treated as\n * length+end.\n */\n fill(value: T, start?: number, end?: number): this;\n\n /**\n * Returns the this object after copying a section of the array identified by start and end\n * to the same array starting at position target\n * @param target If target is negative, it is treated as length+target where length is the\n * length of the array.\n * @param start If start is negative, it is treated as length+start. If end is negative, it\n * is treated as length+end.\n * @param end If not specified, length of the this object is used as its default value.\n */\n copyWithin(target: number, start: number, end?: number): this;\n}\n\ninterface ArrayConstructor {\n /**\n * Creates an array from an array-like object.\n * @param arrayLike An array-like object to convert to an array.\n */\n from<T>(arrayLike: ArrayLike<T>): T[];\n\n /**\n * Creates an array from an iterable object.\n * @param arrayLike An array-like object to convert to an array.\n * @param mapfn A mapping function to call on every element of the array.\n * @param thisArg Value of \'this\' used to invoke the mapfn.\n */\n from<T, U>(arrayLike: ArrayLike<T>, mapfn: (v: T, k: number) => U, thisArg?: any): U[];\n\n /**\n * Returns a new array from a set of elements.\n * @param items A set of elements to include in the new array object.\n */\n of<T>(...items: T[]): T[];\n}\n\ninterface DateConstructor {\n new (value: number | string | Date): Date;\n}\n\ninterface Function {\n /**\n * Returns the name of the function. Function names are read-only and can not be changed.\n */\n readonly name: string;\n}\n\ninterface Math {\n /**\n * Returns the number of leading zero bits in the 32-bit binary representation of a number.\n * @param x A numeric expression.\n */\n clz32(x: number): number;\n\n /**\n * Returns the result of 32-bit multiplication of two numbers.\n * @param x First number\n * @param y Second number\n */\n imul(x: number, y: number): number;\n\n /**\n * Returns the sign of the x, indicating whether x is positive, negative or zero.\n * @param x The numeric expression to test\n */\n sign(x: number): number;\n\n /**\n * Returns the base 10 logarithm of a number.\n * @param x A numeric expression.\n */\n log10(x: number): number;\n\n /**\n * Returns the base 2 logarithm of a number.\n * @param x A numeric expression.\n */\n log2(x: number): number;\n\n /**\n * Returns the natural logarithm of 1 + x.\n * @param x A numeric expression.\n */\n log1p(x: number): number;\n\n /**\n * Returns the result of (e^x - 1), which is an implementation-dependent approximation to\n * subtracting 1 from the exponential function of x (e raised to the power of x, where e\n * is the base of the natural logarithms).\n * @param x A numeric expression.\n */\n expm1(x: number): number;\n\n /**\n * Returns the hyperbolic cosine of a number.\n * @param x A numeric expression that contains an angle measured in radians.\n */\n cosh(x: number): number;\n\n /**\n * Returns the hyperbolic sine of a number.\n * @param x A numeric expression that contains an angle measured in radians.\n */\n sinh(x: number): number;\n\n /**\n * Returns the hyperbolic tangent of a number.\n * @param x A numeric expression that contains an angle measured in radians.\n */\n tanh(x: number): number;\n\n /**\n * Returns the inverse hyperbolic cosine of a number.\n * @param x A numeric expression that contains an angle measured in radians.\n */\n acosh(x: number): number;\n\n /**\n * Returns the inverse hyperbolic sine of a number.\n * @param x A numeric expression that contains an angle measured in radians.\n */\n asinh(x: number): number;\n\n /**\n * Returns the inverse hyperbolic tangent of a number.\n * @param x A numeric expression that contains an angle measured in radians.\n */\n atanh(x: number): number;\n\n /**\n * Returns the square root of the sum of squares of its arguments.\n * @param values Values to compute the square root for.\n * If no arguments are passed, the result is +0.\n * If there is only one argument, the result is the absolute value.\n * If any argument is +Infinity or -Infinity, the result is +Infinity.\n * If any argument is NaN, the result is NaN.\n * If all arguments are either +0 or \u22120, the result is +0.\n */\n hypot(...values: number[]): number;\n\n /**\n * Returns the integral part of the a numeric expression, x, removing any fractional digits.\n * If x is already an integer, the result is x.\n * @param x A numeric expression.\n */\n trunc(x: number): number;\n\n /**\n * Returns the nearest single precision float representation of a number.\n * @param x A numeric expression.\n */\n fround(x: number): number;\n\n /**\n * Returns an implementation-dependent approximation to the cube root of number.\n * @param x A numeric expression.\n */\n cbrt(x: number): number;\n}\n\ninterface NumberConstructor {\n /**\n * The value of Number.EPSILON is the difference between 1 and the smallest value greater than 1\n * that is representable as a Number value, which is approximately:\n * 2.2204460492503130808472633361816 x 10\u200D\u2212\u200D16.\n */\n readonly EPSILON: number;\n\n /**\n * Returns true if passed value is finite.\n * Unlike the global isFinite, Number.isFinite doesn\'t forcibly convert the parameter to a\n * number. Only finite values of the type number, result in true.\n * @param number A numeric value.\n */\n isFinite(number: unknown): boolean;\n\n /**\n * Returns true if the value passed is an integer, false otherwise.\n * @param number A numeric value.\n */\n isInteger(number: unknown): boolean;\n\n /**\n * Returns a Boolean value that indicates whether a value is the reserved value NaN (not a\n * number). Unlike the global isNaN(), Number.isNaN() doesn\'t forcefully convert the parameter\n * to a number. Only values of the type number, that are also NaN, result in true.\n * @param number A numeric value.\n */\n isNaN(number: unknown): boolean;\n\n /**\n * Returns true if the value passed is a safe integer.\n * @param number A numeric value.\n */\n isSafeInteger(number: unknown): boolean;\n\n /**\n * The value of the largest integer n such that n and n + 1 are both exactly representable as\n * a Number value.\n * The value of Number.MAX_SAFE_INTEGER is 9007199254740991 2^53 \u2212 1.\n */\n readonly MAX_SAFE_INTEGER: number;\n\n /**\n * The value of the smallest integer n such that n and n \u2212 1 are both exactly representable as\n * a Number value.\n * The value of Number.MIN_SAFE_INTEGER is \u22129007199254740991 (\u2212(2^53 \u2212 1)).\n */\n readonly MIN_SAFE_INTEGER: number;\n\n /**\n * Converts a string to a floating-point number.\n * @param string A string that contains a floating-point number.\n */\n parseFloat(string: string): number;\n\n /**\n * Converts A string to an integer.\n * @param string A string to convert into a number.\n * @param radix A value between 2 and 36 that specifies the base of the number in `string`.\n * If this argument is not supplied, strings with a prefix of \'0x\' are considered hexadecimal.\n * All other strings are considered decimal.\n */\n parseInt(string: string, radix?: number): number;\n}\n\ninterface ObjectConstructor {\n /**\n * Copy the values of all of the enumerable own properties from one or more source objects to a\n * target object. Returns the target object.\n * @param target The target object to copy to.\n * @param source The source object from which to copy properties.\n */\n assign<T extends {}, U>(target: T, source: U): T & U;\n\n /**\n * Copy the values of all of the enumerable own properties from one or more source objects to a\n * target object. Returns the target object.\n * @param target The target object to copy to.\n * @param source1 The first source object from which to copy properties.\n * @param source2 The second source object from which to copy properties.\n */\n assign<T extends {}, U, V>(target: T, source1: U, source2: V): T & U & V;\n\n /**\n * Copy the values of all of the enumerable own properties from one or more source objects to a\n * target object. Returns the target object.\n * @param target The target object to copy to.\n * @param source1 The first source object from which to copy properties.\n * @param source2 The second source object from which to copy properties.\n * @param source3 The third source object from which to copy properties.\n */\n assign<T extends {}, U, V, W>(target: T, source1: U, source2: V, source3: W): T & U & V & W;\n\n /**\n * Copy the values of all of the enumerable own properties from one or more source objects to a\n * target object. Returns the target object.\n * @param target The target object to copy to.\n * @param sources One or more source objects from which to copy properties\n */\n assign(target: object, ...sources: any[]): any;\n\n /**\n * Returns an array of all symbol properties found directly on object o.\n * @param o Object to retrieve the symbols from.\n */\n getOwnPropertySymbols(o: any): symbol[];\n\n /**\n * Returns the names of the enumerable string properties and methods of an object.\n * @param o Object that contains the properties and methods. This can be an object that you created or an existing Document Object Model (DOM) object.\n */\n keys(o: {}): string[];\n\n /**\n * Returns true if the values are the same value, false otherwise.\n * @param value1 The first value.\n * @param value2 The second value.\n */\n is(value1: any, value2: any): boolean;\n\n /**\n * Sets the prototype of a specified object o to object proto or null. Returns the object o.\n * @param o The object to change its prototype.\n * @param proto The value of the new prototype or null.\n */\n setPrototypeOf(o: any, proto: object | null): any;\n}\n\ninterface ReadonlyArray<T> {\n /**\n * Returns the value of the first element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found, find\n * immediately returns that element value. Otherwise, find returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n find<S extends T>(predicate: (value: T, index: number, obj: readonly T[]) => value is S, thisArg?: any): S | undefined;\n find(predicate: (value: T, index: number, obj: readonly T[]) => unknown, thisArg?: any): T | undefined;\n\n /**\n * Returns the index of the first element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate find calls predicate once for each element of the array, in ascending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findIndex immediately returns that element index. Otherwise, findIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findIndex(predicate: (value: T, index: number, obj: readonly T[]) => unknown, thisArg?: any): number;\n}\n\ninterface RegExp {\n /**\n * Returns a string indicating the flags of the regular expression in question. This field is read-only.\n * The characters in this string are sequenced and concatenated in the following order:\n *\n * - "g" for global\n * - "i" for ignoreCase\n * - "m" for multiline\n * - "u" for unicode\n * - "y" for sticky\n *\n * If no flags are set, the value is the empty string.\n */\n readonly flags: string;\n\n /**\n * Returns a Boolean value indicating the state of the sticky flag (y) used with a regular\n * expression. Default is false. Read-only.\n */\n readonly sticky: boolean;\n\n /**\n * Returns a Boolean value indicating the state of the Unicode flag (u) used with a regular\n * expression. Default is false. Read-only.\n */\n readonly unicode: boolean;\n}\n\ninterface RegExpConstructor {\n new (pattern: RegExp | string, flags?: string): RegExp;\n (pattern: RegExp | string, flags?: string): RegExp;\n}\n\ninterface String {\n /**\n * Returns a nonnegative integer Number less than 1114112 (0x110000) that is the code point\n * value of the UTF-16 encoded code point starting at the string element at position pos in\n * the String resulting from converting this object to a String.\n * If there is no element at that position, the result is undefined.\n * If a valid UTF-16 surrogate pair does not begin at pos, the result is the code unit at pos.\n */\n codePointAt(pos: number): number | undefined;\n\n /**\n * Returns true if searchString appears as a substring of the result of converting this\n * object to a String, at one or more positions that are\n * greater than or equal to position; otherwise, returns false.\n * @param searchString search string\n * @param position If position is undefined, 0 is assumed, so as to search all of the String.\n */\n includes(searchString: string, position?: number): boolean;\n\n /**\n * Returns true if the sequence of elements of searchString converted to a String is the\n * same as the corresponding elements of this object (converted to a String) starting at\n * endPosition \u2013 length(this). Otherwise returns false.\n */\n endsWith(searchString: string, endPosition?: number): boolean;\n\n /**\n * Returns the String value result of normalizing the string into the normalization form\n * named by form as specified in Unicode Standard Annex #15, Unicode Normalization Forms.\n * @param form Applicable values: "NFC", "NFD", "NFKC", or "NFKD", If not specified default\n * is "NFC"\n */\n normalize(form: "NFC" | "NFD" | "NFKC" | "NFKD"): string;\n\n /**\n * Returns the String value result of normalizing the string into the normalization form\n * named by form as specified in Unicode Standard Annex #15, Unicode Normalization Forms.\n * @param form Applicable values: "NFC", "NFD", "NFKC", or "NFKD", If not specified default\n * is "NFC"\n */\n normalize(form?: string): string;\n\n /**\n * Returns a String value that is made from count copies appended together. If count is 0,\n * the empty string is returned.\n * @param count number of copies to append\n */\n repeat(count: number): string;\n\n /**\n * Returns true if the sequence of elements of searchString converted to a String is the\n * same as the corresponding elements of this object (converted to a String) starting at\n * position. Otherwise returns false.\n */\n startsWith(searchString: string, position?: number): boolean;\n\n /**\n * Returns an `<a>` HTML anchor element and sets the name attribute to the text value\n * @deprecated A legacy feature for browser compatibility\n * @param name\n */\n anchor(name: string): string;\n\n /**\n * Returns a `<big>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n big(): string;\n\n /**\n * Returns a `<blink>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n blink(): string;\n\n /**\n * Returns a `<b>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n bold(): string;\n\n /**\n * Returns a `<tt>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n fixed(): string;\n\n /**\n * Returns a `<font>` HTML element and sets the color attribute value\n * @deprecated A legacy feature for browser compatibility\n */\n fontcolor(color: string): string;\n\n /**\n * Returns a `<font>` HTML element and sets the size attribute value\n * @deprecated A legacy feature for browser compatibility\n */\n fontsize(size: number): string;\n\n /**\n * Returns a `<font>` HTML element and sets the size attribute value\n * @deprecated A legacy feature for browser compatibility\n */\n fontsize(size: string): string;\n\n /**\n * Returns an `<i>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n italics(): string;\n\n /**\n * Returns an `<a>` HTML element and sets the href attribute value\n * @deprecated A legacy feature for browser compatibility\n */\n link(url: string): string;\n\n /**\n * Returns a `<small>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n small(): string;\n\n /**\n * Returns a `<strike>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n strike(): string;\n\n /**\n * Returns a `<sub>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n sub(): string;\n\n /**\n * Returns a `<sup>` HTML element\n * @deprecated A legacy feature for browser compatibility\n */\n sup(): string;\n}\n\ninterface StringConstructor {\n /**\n * Return the String value whose elements are, in order, the elements in the List elements.\n * If length is 0, the empty string is returned.\n */\n fromCodePoint(...codePoints: number[]): string;\n\n /**\n * String.raw is usually used as a tag function of a Tagged Template String. When called as\n * such, the first argument will be a well formed template call site object and the rest\n * parameter will contain the substitution values. It can also be called directly, for example,\n * to interleave strings and values from your own tag function, and in this case the only thing\n * it needs from the first argument is the raw property.\n * @param template A well-formed template string call site representation.\n * @param substitutions A set of substitution values.\n */\n raw(template: { raw: readonly string[] | ArrayLike<string>; }, ...substitutions: any[]): string;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Atomics {\n /**\n * A non-blocking, asynchronous version of wait which is usable on the main thread.\n * Waits asynchronously on a shared memory location and returns a Promise\n * @param typedArray A shared Int32Array or BigInt64Array.\n * @param index The position in the typedArray to wait on.\n * @param value The expected value to test.\n * @param [timeout] The expected value to test.\n */\n waitAsync(typedArray: Int32Array, index: number, value: number, timeout?: number): { async: false; value: "not-equal" | "timed-out"; } | { async: true; value: Promise<"ok" | "timed-out">; };\n\n /**\n * A non-blocking, asynchronous version of wait which is usable on the main thread.\n * Waits asynchronously on a shared memory location and returns a Promise\n * @param typedArray A shared Int32Array or BigInt64Array.\n * @param index The position in the typedArray to wait on.\n * @param value The expected value to test.\n * @param [timeout] The expected value to test.\n */\n waitAsync(typedArray: BigInt64Array, index: number, value: bigint, timeout?: number): { async: false; value: "not-equal" | "timed-out"; } | { async: true; value: Promise<"ok" | "timed-out">; };\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Atomics {\n /**\n * Adds a value to the value at the given position in the array, returning the original value.\n * Until this atomic operation completes, any other read or write operation against the array\n * will block.\n */\n add(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n\n /**\n * Stores the bitwise AND of a value with the value at the given position in the array,\n * returning the original value. Until this atomic operation completes, any other read or\n * write operation against the array will block.\n */\n and(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n\n /**\n * Replaces the value at the given position in the array if the original value equals the given\n * expected value, returning the original value. Until this atomic operation completes, any\n * other read or write operation against the array will block.\n */\n compareExchange(typedArray: BigInt64Array | BigUint64Array, index: number, expectedValue: bigint, replacementValue: bigint): bigint;\n\n /**\n * Replaces the value at the given position in the array, returning the original value. Until\n * this atomic operation completes, any other read or write operation against the array will\n * block.\n */\n exchange(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n\n /**\n * Returns the value at the given position in the array. Until this atomic operation completes,\n * any other read or write operation against the array will block.\n */\n load(typedArray: BigInt64Array | BigUint64Array, index: number): bigint;\n\n /**\n * Stores the bitwise OR of a value with the value at the given position in the array,\n * returning the original value. Until this atomic operation completes, any other read or write\n * operation against the array will block.\n */\n or(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n\n /**\n * Stores a value at the given position in the array, returning the new value. Until this\n * atomic operation completes, any other read or write operation against the array will block.\n */\n store(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n\n /**\n * Subtracts a value from the value at the given position in the array, returning the original\n * value. Until this atomic operation completes, any other read or write operation against the\n * array will block.\n */\n sub(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n\n /**\n * If the value at the given position in the array is equal to the provided value, the current\n * agent is put to sleep causing execution to suspend until the timeout expires (returning\n * `"timed-out"`) or until the agent is awoken (returning `"ok"`); otherwise, returns\n * `"not-equal"`.\n */\n wait(typedArray: BigInt64Array, index: number, value: bigint, timeout?: number): "ok" | "not-equal" | "timed-out";\n\n /**\n * Wakes up sleeping agents that are waiting on the given index of the array, returning the\n * number of agents that were awoken.\n * @param typedArray A shared BigInt64Array.\n * @param index The position in the typedArray to wake up on.\n * @param count The number of sleeping agents to notify. Defaults to +Infinity.\n */\n notify(typedArray: BigInt64Array, index: number, count?: number): number;\n\n /**\n * Stores the bitwise XOR of a value with the value at the given position in the array,\n * returning the original value. Until this atomic operation completes, any other read or write\n * operation against the array will block.\n */\n xor(typedArray: BigInt64Array | BigUint64Array, index: number, value: bigint): bigint;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface DateConstructor {\n /**\n * Returns the number of milliseconds between midnight, January 1, 1970 Universal Coordinated Time (UTC) (or GMT) and the specified date.\n * @param year The full year designation is required for cross-century date accuracy. If year is between 0 and 99 is used, then year is assumed to be 1900 + year.\n * @param monthIndex The month as a number between 0 and 11 (January to December).\n * @param date The date as a number between 1 and 31.\n * @param hours Must be supplied if minutes is supplied. A number from 0 to 23 (midnight to 11pm) that specifies the hour.\n * @param minutes Must be supplied if seconds is supplied. A number from 0 to 59 that specifies the minutes.\n * @param seconds Must be supplied if milliseconds is supplied. A number from 0 to 59 that specifies the seconds.\n * @param ms A number from 0 to 999 that specifies the milliseconds.\n */\n UTC(year: number, monthIndex?: number, date?: number, hours?: number, minutes?: number, seconds?: number, ms?: number): number;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface ErrorOptions {\n cause?: unknown;\n}\n\ninterface Error {\n cause?: unknown;\n}\n\ninterface ErrorConstructor {\n new (message?: string, options?: ErrorOptions): Error;\n (message?: string, options?: ErrorOptions): Error;\n}\n\ninterface EvalErrorConstructor {\n new (message?: string, options?: ErrorOptions): EvalError;\n (message?: string, options?: ErrorOptions): EvalError;\n}\n\ninterface RangeErrorConstructor {\n new (message?: string, options?: ErrorOptions): RangeError;\n (message?: string, options?: ErrorOptions): RangeError;\n}\n\ninterface ReferenceErrorConstructor {\n new (message?: string, options?: ErrorOptions): ReferenceError;\n (message?: string, options?: ErrorOptions): ReferenceError;\n}\n\ninterface SyntaxErrorConstructor {\n new (message?: string, options?: ErrorOptions): SyntaxError;\n (message?: string, options?: ErrorOptions): SyntaxError;\n}\n\ninterface TypeErrorConstructor {\n new (message?: string, options?: ErrorOptions): TypeError;\n (message?: string, options?: ErrorOptions): TypeError;\n}\n\ninterface URIErrorConstructor {\n new (message?: string, options?: ErrorOptions): URIError;\n (message?: string, options?: ErrorOptions): URIError;\n}\n\ninterface AggregateErrorConstructor {\n new (\n errors: Iterable<any>,\n message?: string,\n options?: ErrorOptions,\n ): AggregateError;\n (\n errors: Iterable<any>,\n message?: string,\n options?: ErrorOptions,\n ): AggregateError;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Int8ArrayConstructor {\n new (): Int8Array;\n}\n\ninterface Uint8ArrayConstructor {\n new (): Uint8Array;\n}\n\ninterface Uint8ClampedArrayConstructor {\n new (): Uint8ClampedArray;\n}\n\ninterface Int16ArrayConstructor {\n new (): Int16Array;\n}\n\ninterface Uint16ArrayConstructor {\n new (): Uint16Array;\n}\n\ninterface Int32ArrayConstructor {\n new (): Int32Array;\n}\n\ninterface Uint32ArrayConstructor {\n new (): Uint32Array;\n}\n\ninterface Float32ArrayConstructor {\n new (): Float32Array;\n}\n\ninterface Float64ArrayConstructor {\n new (): Float64Array;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Map<K, V> {\n clear(): void;\n /**\n * @returns true if an element in the Map existed and has been removed, or false if the element does not exist.\n */\n delete(key: K): boolean;\n /**\n * Executes a provided function once per each key/value pair in the Map, in insertion order.\n */\n forEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void;\n /**\n * Returns a specified element from the Map object. If the value that is associated to the provided key is an object, then you will get a reference to that object and any change made to that object will effectively modify it inside the Map.\n * @returns Returns the element associated with the specified key. If no element is associated with the specified key, undefined is returned.\n */\n get(key: K): V | undefined;\n /**\n * @returns boolean indicating whether an element with the specified key exists or not.\n */\n has(key: K): boolean;\n /**\n * Adds a new element with a specified key and value to the Map. If an element with the same key already exists, the element will be updated.\n */\n set(key: K, value: V): this;\n /**\n * @returns the number of elements in the Map.\n */\n readonly size: number;\n}\n\ninterface MapConstructor {\n new (): Map<any, any>;\n new <K, V>(entries?: readonly (readonly [K, V])[] | null): Map<K, V>;\n readonly prototype: Map<any, any>;\n}\ndeclare var Map: MapConstructor;\n\ninterface ReadonlyMap<K, V> {\n forEach(callbackfn: (value: V, key: K, map: ReadonlyMap<K, V>) => void, thisArg?: any): void;\n get(key: K): V | undefined;\n has(key: K): boolean;\n readonly size: number;\n}\n\ninterface WeakMap<K extends WeakKey, V> {\n /**\n * Removes the specified element from the WeakMap.\n * @returns true if the element was successfully removed, or false if it was not present.\n */\n delete(key: K): boolean;\n /**\n * @returns a specified element.\n */\n get(key: K): V | undefined;\n /**\n * @returns a boolean indicating whether an element with the specified key exists or not.\n */\n has(key: K): boolean;\n /**\n * Adds a new element with a specified key and value.\n * @param key Must be an object or symbol.\n */\n set(key: K, value: V): this;\n}\n\ninterface WeakMapConstructor {\n new <K extends WeakKey = WeakKey, V = any>(entries?: readonly (readonly [K, V])[] | null): WeakMap<K, V>;\n readonly prototype: WeakMap<WeakKey, any>;\n}\ndeclare var WeakMap: WeakMapConstructor;\n\ninterface Set<T> {\n /**\n * Appends a new element with a specified value to the end of the Set.\n */\n add(value: T): this;\n\n clear(): void;\n /**\n * Removes a specified value from the Set.\n * @returns Returns true if an element in the Set existed and has been removed, or false if the element does not exist.\n */\n delete(value: T): boolean;\n /**\n * Executes a provided function once per each value in the Set object, in insertion order.\n */\n forEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void;\n /**\n * @returns a boolean indicating whether an element with the specified value exists in the Set or not.\n */\n has(value: T): boolean;\n /**\n * @returns the number of (unique) elements in Set.\n */\n readonly size: number;\n}\n\ninterface SetConstructor {\n new <T = any>(values?: readonly T[] | null): Set<T>;\n readonly prototype: Set<any>;\n}\ndeclare var Set: SetConstructor;\n\ninterface ReadonlySet<T> {\n forEach(callbackfn: (value: T, value2: T, set: ReadonlySet<T>) => void, thisArg?: any): void;\n has(value: T): boolean;\n readonly size: number;\n}\n\ninterface WeakSet<T extends WeakKey> {\n /**\n * Appends a new value to the end of the WeakSet.\n */\n add(value: T): this;\n /**\n * Removes the specified element from the WeakSet.\n * @returns Returns true if the element existed and has been removed, or false if the element does not exist.\n */\n delete(value: T): boolean;\n /**\n * @returns a boolean indicating whether a value exists in the WeakSet or not.\n */\n has(value: T): boolean;\n}\n\ninterface WeakSetConstructor {\n new <T extends WeakKey = WeakKey>(values?: readonly T[] | null): WeakSet<T>;\n readonly prototype: WeakSet<WeakKey>;\n}\ndeclare var WeakSet: WeakSetConstructor;\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface ObjectConstructor {\n /**\n * Determines whether an object has a property with the specified name.\n * @param o An object.\n * @param v A property name.\n */\n hasOwn(o: object, v: PropertyKey): boolean;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface ObjectConstructor {\n /**\n * Returns an array of values of the enumerable properties of an object\n * @param o Object that contains the properties and methods. This can be an object that you created or an existing Document Object Model (DOM) object.\n */\n values<T>(o: { [s: string]: T; } | ArrayLike<T>): T[];\n\n /**\n * Returns an array of values of the enumerable properties of an object\n * @param o Object that contains the properties and methods. This can be an object that you created or an existing Document Object Model (DOM) object.\n */\n values(o: {}): any[];\n\n /**\n * Returns an array of key/values of the enumerable properties of an object\n * @param o Object that contains the properties and methods. This can be an object that you created or an existing Document Object Model (DOM) object.\n */\n entries<T>(o: { [s: string]: T; } | ArrayLike<T>): [string, T][];\n\n /**\n * Returns an array of key/values of the enumerable properties of an object\n * @param o Object that contains the properties and methods. This can be an object that you created or an existing Document Object Model (DOM) object.\n */\n entries(o: {}): [string, any][];\n\n /**\n * Returns an object containing all own property descriptors of an object\n * @param o Object that contains the properties and methods. This can be an object that you created or an existing Document Object Model (DOM) object.\n */\n getOwnPropertyDescriptors<T>(o: T): { [P in keyof T]: TypedPropertyDescriptor<T[P]>; } & { [x: string]: PropertyDescriptor; };\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface PromiseConstructor {\n /**\n * A reference to the prototype.\n */\n readonly prototype: Promise<any>;\n\n /**\n * Creates a new Promise.\n * @param executor A callback used to initialize the promise. This callback is passed two arguments:\n * a resolve callback used to resolve the promise with a value or the result of another promise,\n * and a reject callback used to reject the promise with a provided reason or error.\n */\n new <T>(executor: (resolve: (value: T | PromiseLike<T>) => void, reject: (reason?: any) => void) => void): Promise<T>;\n\n /**\n * Creates a Promise that is resolved with an array of results when all of the provided Promises\n * resolve, or rejected when any Promise is rejected.\n * @param values An array of Promises.\n * @returns A new Promise.\n */\n all<T extends readonly unknown[] | []>(values: T): Promise<{ -readonly [P in keyof T]: Awaited<T[P]>; }>;\n\n // see: lib.es2015.iterable.d.ts\n // all<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>[]>;\n\n /**\n * Creates a Promise that is resolved or rejected when any of the provided Promises are resolved\n * or rejected.\n * @param values An array of Promises.\n * @returns A new Promise.\n */\n race<T extends readonly unknown[] | []>(values: T): Promise<Awaited<T[number]>>;\n\n // see: lib.es2015.iterable.d.ts\n // race<T>(values: Iterable<T | PromiseLike<T>>): Promise<Awaited<T>>;\n\n /**\n * Creates a new rejected promise for the provided reason.\n * @param reason The reason the promise was rejected.\n * @returns A new rejected Promise.\n */\n reject<T = never>(reason?: any): Promise<T>;\n\n /**\n * Creates a new resolved promise.\n * @returns A resolved promise.\n */\n resolve(): Promise<void>;\n /**\n * Creates a new resolved promise for the provided value.\n * @param value A promise.\n * @returns A promise whose internal state matches the provided promise.\n */\n resolve<T>(value: T): Promise<Awaited<T>>;\n /**\n * Creates a new resolved promise for the provided value.\n * @param value A promise.\n * @returns A promise whose internal state matches the provided promise.\n */\n resolve<T>(value: T | PromiseLike<T>): Promise<Awaited<T>>;\n}\n\ndeclare var Promise: PromiseConstructor;\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface PromiseFulfilledResult<T> {\n status: "fulfilled";\n value: T;\n}\n\ninterface PromiseRejectedResult {\n status: "rejected";\n reason: any;\n}\n\ntype PromiseSettledResult<T> = PromiseFulfilledResult<T> | PromiseRejectedResult;\n\ninterface PromiseConstructor {\n /**\n * Creates a Promise that is resolved with an array of results when all\n * of the provided Promises resolve or reject.\n * @param values An array of Promises.\n * @returns A new Promise.\n */\n allSettled<T extends readonly unknown[] | []>(values: T): Promise<{ -readonly [P in keyof T]: PromiseSettledResult<Awaited<T[P]>>; }>;\n\n /**\n * Creates a Promise that is resolved with an array of results when all\n * of the provided Promises resolve or reject.\n * @param values An array of Promises.\n * @returns A new Promise.\n */\n allSettled<T>(values: Iterable<T | PromiseLike<T>>): Promise<PromiseSettledResult<Awaited<T>>[]>;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface ProxyHandler<T extends object> {\n /**\n * A trap method for a function call.\n * @param target The original callable object which is being proxied.\n */\n apply?(target: T, thisArg: any, argArray: any[]): any;\n\n /**\n * A trap for the `new` operator.\n * @param target The original object which is being proxied.\n * @param newTarget The constructor that was originally called.\n */\n construct?(target: T, argArray: any[], newTarget: Function): object;\n\n /**\n * A trap for `Object.defineProperty()`.\n * @param target The original object which is being proxied.\n * @returns A `Boolean` indicating whether or not the property has been defined.\n */\n defineProperty?(target: T, property: string | symbol, attributes: PropertyDescriptor): boolean;\n\n /**\n * A trap for the `delete` operator.\n * @param target The original object which is being proxied.\n * @param p The name or `Symbol` of the property to delete.\n * @returns A `Boolean` indicating whether or not the property was deleted.\n */\n deleteProperty?(target: T, p: string | symbol): boolean;\n\n /**\n * A trap for getting a property value.\n * @param target The original object which is being proxied.\n * @param p The name or `Symbol` of the property to get.\n * @param receiver The proxy or an object that inherits from the proxy.\n */\n get?(target: T, p: string | symbol, receiver: any): any;\n\n /**\n * A trap for `Object.getOwnPropertyDescriptor()`.\n * @param target The original object which is being proxied.\n * @param p The name of the property whose description should be retrieved.\n */\n getOwnPropertyDescriptor?(target: T, p: string | symbol): PropertyDescriptor | undefined;\n\n /**\n * A trap for the `[[GetPrototypeOf]]` internal method.\n * @param target The original object which is being proxied.\n */\n getPrototypeOf?(target: T): object | null;\n\n /**\n * A trap for the `in` operator.\n * @param target The original object which is being proxied.\n * @param p The name or `Symbol` of the property to check for existence.\n */\n has?(target: T, p: string | symbol): boolean;\n\n /**\n * A trap for `Object.isExtensible()`.\n * @param target The original object which is being proxied.\n */\n isExtensible?(target: T): boolean;\n\n /**\n * A trap for `Reflect.ownKeys()`.\n * @param target The original object which is being proxied.\n */\n ownKeys?(target: T): ArrayLike<string | symbol>;\n\n /**\n * A trap for `Object.preventExtensions()`.\n * @param target The original object which is being proxied.\n */\n preventExtensions?(target: T): boolean;\n\n /**\n * A trap for setting a property value.\n * @param target The original object which is being proxied.\n * @param p The name or `Symbol` of the property to set.\n * @param receiver The object to which the assignment was originally directed.\n * @returns A `Boolean` indicating whether or not the property was set.\n */\n set?(target: T, p: string | symbol, newValue: any, receiver: any): boolean;\n\n /**\n * A trap for `Object.setPrototypeOf()`.\n * @param target The original object which is being proxied.\n * @param newPrototype The object\'s new prototype or `null`.\n */\n setPrototypeOf?(target: T, v: object | null): boolean;\n}\n\ninterface ProxyConstructor {\n /**\n * Creates a revocable Proxy object.\n * @param target A target object to wrap with Proxy.\n * @param handler An object whose properties define the behavior of Proxy when an operation is attempted on it.\n */\n revocable<T extends object>(target: T, handler: ProxyHandler<T>): { proxy: T; revoke: () => void; };\n\n /**\n * Creates a Proxy object. The Proxy object allows you to create an object that can be used in place of the\n * original object, but which may redefine fundamental Object operations like getting, setting, and defining\n * properties. Proxy objects are commonly used to log property accesses, validate, format, or sanitize inputs.\n * @param target A target object to wrap with Proxy.\n * @param handler An object whose properties define the behavior of Proxy when an operation is attempted on it.\n */\n new <T extends object>(target: T, handler: ProxyHandler<T>): T;\n}\ndeclare var Proxy: ProxyConstructor;\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface RegExpMatchArray {\n groups?: {\n [key: string]: string;\n };\n}\n\ninterface RegExpExecArray {\n groups?: {\n [key: string]: string;\n };\n}\n\ninterface RegExp {\n /**\n * Returns a Boolean value indicating the state of the dotAll flag (s) used with a regular expression.\n * Default is false. Read-only.\n */\n readonly dotAll: boolean;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface RegExpMatchArray {\n indices?: RegExpIndicesArray;\n}\n\ninterface RegExpExecArray {\n indices?: RegExpIndicesArray;\n}\n\ninterface RegExpIndicesArray extends Array<[number, number]> {\n groups?: {\n [key: string]: [number, number];\n };\n}\n\ninterface RegExp {\n /**\n * Returns a Boolean value indicating the state of the hasIndices flag (d) used with with a regular expression.\n * Default is false. Read-only.\n */\n readonly hasIndices: boolean;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface String {\n /** Removes the trailing white space and line terminator characters from a string. */\n trimEnd(): string;\n\n /** Removes the leading white space and line terminator characters from a string. */\n trimStart(): string;\n\n /**\n * Removes the leading white space and line terminator characters from a string.\n * @deprecated A legacy feature for browser compatibility. Use `trimStart` instead\n */\n trimLeft(): string;\n\n /**\n * Removes the trailing white space and line terminator characters from a string.\n * @deprecated A legacy feature for browser compatibility. Use `trimEnd` instead\n */\n trimRight(): string;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface String {\n /**\n * Replace all instances of a substring in a string, using a regular expression or search string.\n * @param searchValue A string to search for.\n * @param replaceValue A string containing the text to replace for every successful match of searchValue in this string.\n */\n replaceAll(searchValue: string | RegExp, replaceValue: string): string;\n\n /**\n * Replace all instances of a substring in a string, using a regular expression or search string.\n * @param searchValue A string to search for.\n * @param replacer A function that returns the replacement text.\n */\n replaceAll(searchValue: string | RegExp, replacer: (substring: string, ...args: any[]) => string): string;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface String {\n /**\n * Returns a new String consisting of the single UTF-16 code unit located at the specified index.\n * @param index The zero-based index of the desired code unit. A negative index will count back from the last item.\n */\n at(index: number): string | undefined;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface Symbol {\n /**\n * Expose the [[Description]] internal slot of a symbol directly.\n */\n readonly description: string | undefined;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface SymbolConstructor {\n /**\n * A reference to the prototype.\n */\n readonly prototype: Symbol;\n\n /**\n * Returns a new unique Symbol value.\n * @param description Description of the new Symbol object.\n */\n (description?: string | number): symbol;\n\n /**\n * Returns a Symbol object from the global symbol registry matching the given key if found.\n * Otherwise, returns a new symbol with this key.\n * @param key key to search for.\n */\n for(key: string): symbol;\n\n /**\n * Returns a key from the global symbol registry matching the given Symbol if found.\n * Otherwise, returns a undefined.\n * @param sym Symbol to find the key for.\n */\n keyFor(sym: symbol): string | undefined;\n}\n\ndeclare var Symbol: SymbolConstructor;\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ninterface WeakKeyTypes {\n symbol: symbol;\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the "License"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib="true"/>\n\ntype FlatArray<Arr, Depth extends number> = {\n done: Arr;\n recur: Arr extends ReadonlyArray<infer InnerArr> ? FlatArray<InnerArr, [-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20][Depth]>\n : Arr;\n}[Depth extends -1 ? "done" : "recur"];\n\ninterface ReadonlyArray<T> {\n /**\n * Calls a defined callback function on each element of an array. Then, flattens the result into\n * a new array.\n * This is identical to a map followed by flat with depth 1.\n *\n * @param callback A function that accepts up to three arguments. The flatMap method calls the\n * callback function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callback function. If\n * thisArg is omitted, undefined is used as the this value.\n */\n flatMap<U, This = undefined>(\n callback: (this: This, value: T, index: number, array: T[]) => U | ReadonlyArray<U>,\n thisArg?: This,\n ): U[];\n\n /**\n * Returns a new array with all sub-array elements concatenated into it recursively up to the\n * specified depth.\n *\n * @param depth The maximum recursion depth\n */\n flat<A, D extends number = 1>(\n this: A,\n depth?: D,\n ): FlatArray<A, D>[];\n}\n\ninterface Array<T> {\n /**\n * Calls a defined callback function on each element of an array. Then, flattens the result into\n * a new array.\n * This is identical to a map followed by flat with depth 1.\n *\n * @param callback A function that accepts up to three arguments. The flatMap method calls the\n * callback function one time for each element in the array.\n * @param thisArg An object to which the this keyword can refer in the callback function. If\n * thisArg is omitted, undefined is used as the this value.\n */\n flatMap<U, This = undefined>(\n callback: (this: This, value: T, index: number, array: T[]) => U | ReadonlyArray<U>,\n thisArg?: This,\n ): U[];\n\n /**\n * Returns a new array with all sub-array elements concatenated into it recursively up to the\n * specified depth.\n *\n * @param depth The maximum recursion depth\n */\n flat<A, D extends number = 1>(\n this: A,\n depth?: D,\n ): FlatArray<A, D>[];\n}\n';
Copyright (c) Microsoft Corporation. All rights reserved.\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\nthis file except in compliance with the License. You may obtain a copy of the\nLicense at http://www.apache.org/licenses/LICENSE-2.0\n\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\nMERCHANTABLITY OR NON-INFRINGEMENT.\n\nSee the Apache Version 2.0 License for specific language governing permissions\nand limitations under the License.\n***************************************************************************** */\n\n\n/// <reference no-default-lib=\"true\"/>\n\ninterface Array<T> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends T>(predicate: (value: T, index: number, array: T[]) => value is S, thisArg?: any): S | undefined;\n findLast(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): T | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): number;\n\n /**\n * Returns a copy of an array with its elements reversed.\n */\n toReversed(): T[];\n\n /**\n * Returns a copy of an array with its elements sorted.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.\n * ```ts\n * [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: T, b: T) => number): T[];\n\n /**\n * Copies an array and removes elements and, if necessary, inserts new elements in their place. Returns the copied array.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @param items Elements to insert into the copied array in place of the deleted elements.\n * @returns The copied array.\n */\n toSpliced(start: number, deleteCount: number, ...items: T[]): T[];\n\n /**\n * Copies an array and removes elements while returning the remaining elements.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @returns A copy of the original array with the remaining elements.\n */\n toSpliced(start: number, deleteCount?: number): T[];\n\n /**\n * Copies an array, then overwrites the value at the provided index with the\n * given value. If the index is negative, then it replaces from the end\n * of the array.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to write into the copied array.\n * @returns The copied array with the updated value.\n */\n with(index: number, value: T): T[];\n}\n\ninterface ReadonlyArray<T> {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends T>(\n predicate: (value: T, index: number, array: readonly T[]) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: T, index: number, array: readonly T[]) => unknown,\n thisArg?: any,\n ): T | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: T, index: number, array: readonly T[]) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copied array with all of its elements reversed.\n */\n toReversed(): T[];\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending, ASCII character order.\n * ```ts\n * [11, 2, 22, 1].toSorted((a, b) => a - b) // [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: T, b: T) => number): T[];\n\n /**\n * Copies an array and removes elements while, if necessary, inserting new elements in their place, returning the remaining elements.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @param items Elements to insert into the copied array in place of the deleted elements.\n * @returns A copy of the original array with the remaining elements.\n */\n toSpliced(start: number, deleteCount: number, ...items: T[]): T[];\n\n /**\n * Copies an array and removes elements while returning the remaining elements.\n * @param start The zero-based location in the array from which to start removing elements.\n * @param deleteCount The number of elements to remove.\n * @returns A copy of the original array with the remaining elements.\n */\n toSpliced(start: number, deleteCount?: number): T[];\n\n /**\n * Copies an array, then overwrites the value at the provided index with the\n * given value. If the index is negative, then it replaces from the end\n * of the array\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: T): T[];\n}\n\ninterface Int8Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Int8Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: Int8Array) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: Int8Array) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint8Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint8Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint8Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint8Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint8Array;\n}\n\ninterface Uint8Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Uint8Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: Uint8Array) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: Uint8Array) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint8Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint8Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint8Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint8Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint8Array;\n}\n\ninterface Uint8ClampedArray {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Uint8ClampedArray,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: Uint8ClampedArray,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: Uint8ClampedArray,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint8ClampedArray;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint8ClampedArray.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint8ClampedArray(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint8ClampedArray;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint8ClampedArray;\n}\n\ninterface Int16Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Int16Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: Int16Array) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: Int16Array) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Int16Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Int16Array.from([11, 2, -22, 1]);\n * myNums.toSorted((a, b) => a - b) // Int16Array(4) [-22, 1, 2, 11]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Int16Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Int16Array;\n}\n\ninterface Uint16Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Uint16Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: Uint16Array,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: Uint16Array,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint16Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint16Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint16Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint16Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint16Array;\n}\n\ninterface Int32Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Int32Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (value: number, index: number, array: Int32Array) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (value: number, index: number, array: Int32Array) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Int32Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Int32Array.from([11, 2, -22, 1]);\n * myNums.toSorted((a, b) => a - b) // Int32Array(4) [-22, 1, 2, 11]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Int32Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Int32Array;\n}\n\ninterface Uint32Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Uint32Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: Uint32Array,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: Uint32Array,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Uint32Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Uint32Array.from([11, 2, 22, 1]);\n * myNums.toSorted((a, b) => a - b) // Uint32Array(4) [1, 2, 11, 22]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Uint32Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Uint32Array;\n}\n\ninterface Float32Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Float32Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: Float32Array,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: Float32Array,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Float32Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Float32Array.from([11.25, 2, -22.5, 1]);\n * myNums.toSorted((a, b) => a - b) // Float32Array(4) [-22.5, 1, 2, 11.5]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Float32Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Float32Array;\n}\n\ninterface Float64Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends number>(\n predicate: (\n value: number,\n index: number,\n array: Float64Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: number,\n index: number,\n array: Float64Array,\n ) => unknown,\n thisArg?: any,\n ): number | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: number,\n index: number,\n array: Float64Array,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): Float64Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = Float64Array.from([11.25, 2, -22.5, 1]);\n * myNums.toSorted((a, b) => a - b) // Float64Array(4) [-22.5, 1, 2, 11.5]\n * ```\n */\n toSorted(compareFn?: (a: number, b: number) => number): Float64Array;\n\n /**\n * Copies the array and inserts the given number at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: number): Float64Array;\n}\n\ninterface BigInt64Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends bigint>(\n predicate: (\n value: bigint,\n index: number,\n array: BigInt64Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: bigint,\n index: number,\n array: BigInt64Array,\n ) => unknown,\n thisArg?: any,\n ): bigint | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: bigint,\n index: number,\n array: BigInt64Array,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): BigInt64Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = BigInt64Array.from([11n, 2n, -22n, 1n]);\n * myNums.toSorted((a, b) => Number(a - b)) // BigInt64Array(4) [-22n, 1n, 2n, 11n]\n * ```\n */\n toSorted(compareFn?: (a: bigint, b: bigint) => number): BigInt64Array;\n\n /**\n * Copies the array and inserts the given bigint at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: bigint): BigInt64Array;\n}\n\ninterface BigUint64Array {\n /**\n * Returns the value of the last element in the array where predicate is true, and undefined\n * otherwise.\n * @param predicate findLast calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found, findLast\n * immediately returns that element value. Otherwise, findLast returns undefined.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLast<S extends bigint>(\n predicate: (\n value: bigint,\n index: number,\n array: BigUint64Array,\n ) => value is S,\n thisArg?: any,\n ): S | undefined;\n findLast(\n predicate: (\n value: bigint,\n index: number,\n array: BigUint64Array,\n ) => unknown,\n thisArg?: any,\n ): bigint | undefined;\n\n /**\n * Returns the index of the last element in the array where predicate is true, and -1\n * otherwise.\n * @param predicate findLastIndex calls predicate once for each element of the array, in descending\n * order, until it finds one where predicate returns true. If such an element is found,\n * findLastIndex immediately returns that element index. Otherwise, findLastIndex returns -1.\n * @param thisArg If provided, it will be used as the this value for each invocation of\n * predicate. If it is not provided, undefined is used instead.\n */\n findLastIndex(\n predicate: (\n value: bigint,\n index: number,\n array: BigUint64Array,\n ) => unknown,\n thisArg?: any,\n ): number;\n\n /**\n * Copies the array and returns the copy with the elements in reverse order.\n */\n toReversed(): BigUint64Array;\n\n /**\n * Copies and sorts the array.\n * @param compareFn Function used to determine the order of the elements. It is expected to return\n * a negative value if the first argument is less than the second argument, zero if they're equal, and a positive\n * value otherwise. If omitted, the elements are sorted in ascending order.\n * ```ts\n * const myNums = BigUint64Array.from([11n, 2n, 22n, 1n]);\n * myNums.toSorted((a, b) => Number(a - b)) // BigUint64Array(4) [1n, 2n, 11n, 22n]\n * ```\n */\n toSorted(compareFn?: (a: bigint, b: bigint) => number): BigUint64Array;\n\n /**\n * Copies the array and inserts the given bigint at the provided index.\n * @param index The index of the value to overwrite. If the index is\n * negative, then it replaces from the end of the array.\n * @param value The value to insert into the copied array.\n * @returns A copy of the original array with the inserted value.\n */\n with(index: number, value: bigint): BigUint64Array;\n}\n";
--------------------------------- (separator) ----------------------------------
== Dependency
monitor-event-loop-delay
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2018 Elasticsearch BV
--------------------------------- (separator) ----------------------------------
== Dependency
monocle-ts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Giulio Canti
--------------------------------- (separator) ----------------------------------
== Dependency
move-concurrently
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
ms
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Vercel, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
msgpackr-extract
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Kris Zyp
--------------------------------- (separator) ----------------------------------
== Dependency
msgpackr
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Kris Zyp
--------------------------------- (separator) ----------------------------------
== Dependency
mustache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2009 Chris Wanstrath (Ruby)
Copyright (c) 2010-2014 Jan Lehnardt (JavaScript)
Copyright (c) 2010-2015 The mustache.js community
--------------------------------- (separator) ----------------------------------
== Dependency
mute-stream
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
nan
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 NAN WG Members / Collaborators (listed above).
Copyright (c) 2018 NAN contributors
Copyright (c) 2018 [NAN contributors](<https://github.com/nodejs/nan#wg-members--collaborators>)
--------------------------------- (separator) ----------------------------------
== Dependency
nano-css
== License Type
SPDX:Unlicense
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
nanoid
== License Type
SPDX:MIT
== Copyright
Copyright 2017 Andrey Sitnik <andrey@sitnik.ru>
--------------------------------- (separator) ----------------------------------
== Dependency
nanomatch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
negotiator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Federico Romero
Copyright (c) 2012-2014 Isaac Z. Schlueter
Copyright (c) 2014-2015 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
neo-async
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018 Suguru Motegi
--------------------------------- (separator) ----------------------------------
== Dependency
nested-error-stacks
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Matt Lavin <matt.lavin@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
newtype-ts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Giulio Canti
--------------------------------- (separator) ----------------------------------
== Dependency
next-line
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
next-tick
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2012-2020, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
nice-try
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Tobias Reich
--------------------------------- (separator) ----------------------------------
== Dependency
no-case
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
node-addon-api
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Node.js API collaborators
--------------------------------- (separator) ----------------------------------
== Dependency
node-dir
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Nathan Cartwright <fshost@yahoo.com>
--------------------------------- (separator) ----------------------------------
== Dependency
node-emoji
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Daniel Bugl
--------------------------------- (separator) ----------------------------------
== Dependency
node-fetch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 David Frank
--------------------------------- (separator) ----------------------------------
== Dependency
node-forge
== License Type
=== BSD-3-Clause--modified-by-Google
You may use the Forge project under the terms of either the BSD License or the
GNU General Public License (GPL) Version 2.
The BSD License is recommended for most projects. It is simple and easy to
understand and it places almost no restrictions on what you can do with the
Forge project.
If the GPL suits your project better you are also free to use Forge under
that license.
You don't have to do anything special to choose one license or the other and
you don't have to notify anyone which license you are using. You are free to
use this project in commercial projects as long as the copyright header is
left intact.
If you are a commercial entity and use this set of libraries in your
commercial software then reasonable payment to Digital Bazaar, if you can
afford it, is not required but is expected and would be appreciated. If this
library saves you time, then it's saving you money. The cost of developing
the Forge software was on the order of several hundred hours and tens of
thousands of dollars. We are attempting to strike a balance between helping
the development community while not being taken advantage of by lucrative
commercial entities for our efforts.
-------------------------------------------------------------------------------
New BSD License (3-clause)
Copyright (c) 2010, Digital Bazaar, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Digital Bazaar, Inc. nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL DIGITAL BAZAAR BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
GNU GENERAL PUBLIC LICENSE
GNU General Public License, Version 2
== Copyright
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
Copyright (C) Ellis Pritchard, Guardian Unlimited 2003.
Copyright (c) 2003-2005 Tom Wu
Copyright (c) 2005 Tom Wu
Copyright (c) 2005-2009 Tom Wu
Copyright (c) 2008-2013 Digital Bazaar, Inc.
Copyright (c) 2009-2012 Digital Bazaar, Inc.
Copyright (c) 2009-2014 Digital Bazaar, Inc.
Copyright (c) 2009-2015 Digital Bazaar, Inc.
Copyright (c) 2010, Digital Bazaar, Inc.
Copyright (c) 2010-2012 Digital Bazaar, Inc. All rights reserved.
Copyright (c) 2010-2013 Digital Bazaar, Inc.
Copyright (c) 2010-2014 Digital Bazaar, Inc.
Copyright (c) 2010-2014 Digital Bazaar, Inc. All rights reserved.
Copyright (c) 2010-2015 Digital Bazaar, Inc.
Copyright (c) 2010-2018 Digital Bazaar, Inc.
Copyright (c) 2011-2014 Digital Bazaar, Inc. All rights reserved.
Copyright (c) 2012 Kenji Urushima
Copyright (c) 2012 Stefan Siegl <stesie@brokenpipe.de>
Copyright (c) 2012-2014 Digital Bazaar, Inc.
Copyright (c) 2012-2015 Digital Bazaar, Inc.
Copyright (c) 2013 Digital Bazaar, Inc.
Copyright (c) 2013-2014 Digital Bazaar, Inc.
Copyright (c) 2014 Digital Bazaar, Inc.
Copyright (c) 2014 Lautaro Cozzani <lautaro.cozzani@scytl.com>
Copyright (c) 2014-2015 Digital Bazaar, Inc.
Copyright (c) 2017-2019 Digital Bazaar, Inc.
Copyright (c) 2019 Digital Bazaar, Inc.
Copyright 2011-2016 Digital Bazaar, Inc.
Copyright 2011-2017 Digital Bazaar, Inc.
Copyright 2012 Stefan Siegl <stesie@brokenpipe.de>
--------------------------------- (separator) ----------------------------------
== Dependency
node-gyp-build-optional-packages
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
node-int64
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Robert Kieffer
Copyright (c) 2014 Robert Kieffer
--------------------------------- (separator) ----------------------------------
== Dependency
node-jose
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2003-2005 Tom Wu.
Copyright (c) 2015 Cisco Systems, Inc. See LICENSE file.
Copyright (c) 2015 Cisco Systems, Inc. See LICENSE file.
--------------------------------- (separator) ----------------------------------
== Dependency
node-libs-browser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Tobias Koppers
--------------------------------- (separator) ----------------------------------
== Dependency
node-releases
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Sergey Rubanov (https://github.com/chicoxyzzy)
--------------------------------- (separator) ----------------------------------
== Dependency
normalize-package-data
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2013 Meryn Stol
Copyright (c) Meryn Stol ("Author")
--------------------------------- (separator) ----------------------------------
== Dependency
normalize-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
normalize-range
== License Type
SPDX:MIT
== Copyright
Copyright (c) James Talmage <james@talmage.io> (github.com/jamestalmage)
--------------------------------- (separator) ----------------------------------
== Dependency
now-and-later
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blaine Bublitz, Eric Schoffstall and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
npm-run-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
npmlog
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
nth-check
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (separator) ----------------------------------
== Dependency
num2fraction
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 PostCSS
--------------------------------- (separator) ----------------------------------
== Dependency
numeral
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Adam Draper
Copyright (c) 2016 Adam Draper
--------------------------------- (separator) ----------------------------------
== Dependency
object-assign
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
object-copy
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
object-filter-sequence
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2018 Elasticsearch BV
--------------------------------- (separator) ----------------------------------
== Dependency
object-identity-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Stephen Belanger
--------------------------------- (separator) ----------------------------------
== Dependency
object-inspect
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday
--------------------------------- (separator) ----------------------------------
== Dependency
object-keys
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2013 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
object-visit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017, Jon Schlinkert
Copyright (c) 2015, 2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
object.assign
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
object.entries
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
object.fromentries
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
object.getownpropertydescriptors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
object.pick
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015 Jon Schlinkert, contributors.
Copyright (c) 2014-2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
object.values
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
objectorarray
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017 Zhou Hancheng (z308114274@gmail.com)
--------------------------------- (separator) ----------------------------------
== Dependency
obliterator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Guillaume Plique (Yomguithereal)
--------------------------------- (separator) ----------------------------------
== Dependency
on-exit-leak-free
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Matteo Collina
--------------------------------- (separator) ----------------------------------
== Dependency
on-finished
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
on-headers
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
once
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
onetime
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
open
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
opensearchh_client_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
optional-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jason A. Storey
--------------------------------- (separator) ----------------------------------
== Dependency
optionator
== License Type
SPDX:MIT
== Copyright
Copyright (c) George Zahariev
--------------------------------- (separator) ----------------------------------
== Dependency
ordered-binary
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Kris Zyp
--------------------------------- (separator) ----------------------------------
== Dependency
ordered-read-streams
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Artem Medeusheyev
--------------------------------- (separator) ----------------------------------
== Dependency
original-url
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018-2019 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
os-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 CoderPuppy
--------------------------------- (separator) ----------------------------------
== Dependency
os-homedir
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
os-tmpdir
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
osd_sample_panel_action
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
osd_top_nav
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
osd_tp_custom_visualizations
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
osd_tp_run_pipeline
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
own-keys
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
p-all
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-event
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-filter
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-finally
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-limit
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-locate
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-timeout
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
p-try
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
pako
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2014-2017 by Vitaly Puzrin and Andrei Tuputcyn
Copyright (c) <''year''> <''copyright holders''>
--------------------------------- (separator) ----------------------------------
== Dependency
papaparse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Matthew Holt
--------------------------------- (separator) ----------------------------------
== Dependency
parallel-transform
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
param-case
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
parent-module
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
parse-asn1
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, crypto-browserify contributors
--------------------------------- (separator) ----------------------------------
== Dependency
parse-entities
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <mailto:tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
parse-json
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
parse-link-header
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Thorsten Lorenz.
--------------------------------- (separator) ----------------------------------
== Dependency
parse5
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2016 Ivan Nikulin (ifaaan@gmail.com, https://github.com/inikulin)
--------------------------------- (separator) ----------------------------------
== Dependency
parseurl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014-2017 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
pascal-case
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
pascalcase
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
path-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday
--------------------------------- (separator) ----------------------------------
== Dependency
path-dirname
== License Type
SPDX:MIT
== Copyright
Copyright (c) Elan Shanker and Node.js contributors. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
path-exists
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
path-is-absolute
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
path-is-inside
== License Type
=== WTFPL
Dual licensed under WTFPL and MIT:
---
Copyright © 2013–2016 Domenic Denicola <d@domenic.me>
This work is free. You can redistribute it and/or modify it under the
terms of the Do What The Fuck You Want To Public License, Version 2,
as published by Sam Hocevar. See below for more details.
---
The MIT License (MIT)
Copyright © 2013–2016 Domenic Denicola <d@domenic.me>
== Copyright
Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
Copyright © 2013–2016 Domenic Denicola <d@domenic.me>
--------------------------------- (separator) ----------------------------------
== Dependency
path-key
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
path-parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Javier Blanco
--------------------------------- (separator) ----------------------------------
== Dependency
path-to-regexp
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blake Embrey (hello@blakeembrey.com)
--------------------------------- (separator) ----------------------------------
== Dependency
path-type
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
pbkdf2
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Daniel Cousens
--------------------------------- (separator) ----------------------------------
== Dependency
pegjs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010-2016 David Majda
--------------------------------- (separator) ----------------------------------
== Dependency
pend
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Andrew Kelley
--------------------------------- (separator) ----------------------------------
== Dependency
performance-now
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Braveg1rl
Copyright (c) 2017 Braveg1rl
--------------------------------- (separator) ----------------------------------
== Dependency
picocolors
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2021 Alexey Raspopov, Kostiantyn Denysov, Anton Verinov
--------------------------------- (separator) ----------------------------------
== Dependency
picomatch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-present, Jon Schlinkert.
Copyright © 2017-present, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
pify
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
pinkie-promise
== License Type
SPDX:MIT
== Copyright
Copyright (c) Vsevolod Strukchinsky <floatdrop@gmail.com> (github.com/floatdrop)
--------------------------------- (separator) ----------------------------------
== Dependency
pinkie
== License Type
SPDX:MIT
== Copyright
Copyright (c) Vsevolod Strukchinsky <floatdrop@gmail.com> (github.com/floatdrop)
--------------------------------- (separator) ----------------------------------
== Dependency
pino-abstract-transport
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 pino
--------------------------------- (separator) ----------------------------------
== Dependency
pino-std-serializers
== License Type
SPDX:MIT
== Copyright
James Sumners <james.sumners@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
pino
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2024 Matteo Collina, David Mark Clements and the Pino contributors listed at https://github.com/pinojs/pino#the-team and in the README file.
--------------------------------- (separator) ----------------------------------
== Dependency
pirates
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2018 Ari Porad
--------------------------------- (separator) ----------------------------------
== Dependency
pkg-dir
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
pkg-up
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
plugin-error
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
pnp-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright © 2016 Maël Nison**
--------------------------------- (separator) ----------------------------------
== Dependency
polished
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Bryan Braun; Licensed MIT
Copyright (c) 2016-Present Brian Hough and Maximilian Stoiber
Copyright © 2016-2021 Brian Hough, Maximilian Stoiber, & Nik Graf. Licensed under the MIT License, see [LICENSE.md](LICENSE.md) for more information!
--------------------------------- (separator) ----------------------------------
== Dependency
posix-character-classes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
possible-typed-array-names
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-flexbugs-fixes
== License Type
SPDX:MIT
== Copyright
Copyright 2015 Luis Rudge <luis@luisrudge.net>
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-modules-extract-imports
== License Type
SPDX:ISC
== Copyright
Copyright 2015 Glen Maddern
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-modules-local-by-default
== License Type
SPDX:MIT
== Copyright
Copyright 2015 Mark Dalgleish <mark.john.dalgleish@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-modules-scope
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Glen Maddern
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-modules-values
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Glen Maddern
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-selector-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) Ben Briggs <beneb.info@gmail.com> (http://beneb.info)
--------------------------------- (separator) ----------------------------------
== Dependency
postcss-value-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) Bogdan Chadkin <trysound@yandex.ru>
--------------------------------- (separator) ----------------------------------
== Dependency
postcss
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Andrey Sitnik <andrey@sitnik.ru>
--------------------------------- (separator) ----------------------------------
== Dependency
prelude-ls
== License Type
SPDX:MIT
== Copyright
Copyright (c) George Zahariev
--------------------------------- (separator) ----------------------------------
== Dependency
prettier
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2013 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2013-2014 Yusuke Suzuki <utatane.tea@gmail.com>
Copyright (C) 2014 Ivan Nikulin <ifaaan@gmail.com>
Copyright (c) 2014-2016, Jon Schlinkert.
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright (c) 2014-2020 Teambition
Copyright (c) 2014-present, Jon Schlinkert.
Copyright (c) 2015-2017, Jon Schlinkert.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
Copyright (c) Microsoft Corporation.
Copyright © James Long and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
pretty-error
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Aria Minaei
--------------------------------- (separator) ----------------------------------
== Dependency
pretty-format
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
pretty-hrtime
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 [Richardson & Sons, LLC](http://richardsonandsons.com/)
--------------------------------- (separator) ----------------------------------
== Dependency
prismjs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Lea Verou
--------------------------------- (separator) ----------------------------------
== Dependency
process-nextick-args
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Calvin Metcalf
--------------------------------- (separator) ----------------------------------
== Dependency
process-warning
== License Type
SPDX:MIT
== Copyright
Copyright (c) Fastify
--------------------------------- (separator) ----------------------------------
== Dependency
process
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Roman Shtylman <shtylman@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
promise-inflight
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
promise.allsettled
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
promise.prototype.finally
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
prompts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Terkel Gjervig Nielsen
--------------------------------- (separator) ----------------------------------
== Dependency
prop-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
property-information
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <mailto:tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
proxy-addr
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2016 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
proxy-from-env
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2016-2018 Rob Wu <rob@robwu.nl>
--------------------------------- (separator) ----------------------------------
== Dependency
prr
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Rod Vagg [@rvagg](https://twitter.com/rvagg) and licensed under the MIT licence. All rights not explicitly granted in the MIT license are reserved. See the included LICENSE.md file for more details.
Copyright (c) 2014 Rod Vagg
--------------------------------- (separator) ----------------------------------
== Dependency
pseudomap
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
public-encrypt
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Calvin Metcalf
--------------------------------- (separator) ----------------------------------
== Dependency
pump
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
pumpify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
punycode
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
qs
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Nathan LaFreniere and other [contributors](https://github.com/ljharb/qs/graphs/contributors)
--------------------------------- (separator) ----------------------------------
== Dependency
query-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (http://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
querystring-es3
== License Type
SPDX:MIT
== Copyright
Copyright 2012 Irakli Gozalishvili. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
querystringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Unshift.io, Arnout Kazemier, the Contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
queue-microtask
== License Type
SPDX:MIT
== Copyright
Copyright (c) Feross Aboukhadijeh
Copyright (c) [Feross Aboukhadijeh](https://feross.org).
--------------------------------- (separator) ----------------------------------
== Dependency
quick-format-unescaped
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2019 David Mark Clements
--------------------------------- (separator) ----------------------------------
== Dependency
raf-schd
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Alex Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
ramda
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2020 Scott Sauyet and Michael Hurley
--------------------------------- (separator) ----------------------------------
== Dependency
randombytes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify
--------------------------------- (separator) ----------------------------------
== Dependency
randomfill
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify
--------------------------------- (separator) ----------------------------------
== Dependency
range-parser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2015-2016 Douglas Christopher Wilson <doug@somethingdoug.com
--------------------------------- (separator) ----------------------------------
== Dependency
raw-body
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014-2022 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
re-reselect
== License Type
SPDX:MIT
== Copyright
Copyright (c) Andrea Carraro
--------------------------------- (separator) ----------------------------------
== Dependency
react-ace
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 James Hrisho
--------------------------------- (separator) ----------------------------------
== Dependency
react-beautiful-dnd
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright 2019 Atlassian Pty Ltd
--------------------------------- (separator) ----------------------------------
== Dependency
react-clientside-effect
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Dan Abramov
--------------------------------- (separator) ----------------------------------
== Dependency
react-colorful
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Vlad Shilov <omgovich@ya.ru>
--------------------------------- (separator) ----------------------------------
== Dependency
react-docgen-typescript-loader
== License Type
SPDX:MIT
== Copyright
Copyright 2018 Jason Strothmann <jason@jasons.io>
--------------------------------- (separator) ----------------------------------
== Dependency
react-docgen-typescript
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Pavel Vasek
--------------------------------- (separator) ----------------------------------
== Dependency
react-docgen
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-dom
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-dropzone
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Param Aggarwal
--------------------------------- (separator) ----------------------------------
== Dependency
react-element-to-jsx-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Algolia
--------------------------------- (separator) ----------------------------------
== Dependency
react-focus-lock
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton
--------------------------------- (separator) ----------------------------------
== Dependency
react-focus-on
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton
--------------------------------- (separator) ----------------------------------
== Dependency
react-input-autosize
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Jed Watson
Copyright (c) 2018 Jed Watson. [MIT](LICENSE) License.
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-input-range
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2015 David Chin
Copyright 2013-present, Facebook, Inc.
Copyright 2014-2015, Facebook, Inc.
copyright 2015, Andrey Popp <8mayday@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
react-inspector
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Xiaoyi Chen
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-intl
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Yahoo! Inc. All rights reserved.
Copyright (c) Facebook, Inc. and its affiliates.
Copyright 2013 Andy Earnshaw, MIT License
Copyright 2013-2014, Facebook, Inc.
Copyright 2013-2015, Facebook, Inc.
Copyright 2014 Yahoo Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-is
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-lifecycles-compat
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-redux
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2015-present Dan Abramov
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-refresh
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
react-remove-scroll-bar
== License Type
SPDX:MIT
== Copyright
Anton Korzunov <thekashey@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
react-remove-scroll
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton Korzunov
--------------------------------- (separator) ----------------------------------
== Dependency
react-router-dom
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-router
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-select
== License Type
SPDX:MIT
== Copyright
Copyright (c) Jed Watson 2019.
--------------------------------- (separator) ----------------------------------
== Dependency
react-style-singleton
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton Korzunov
--------------------------------- (separator) ----------------------------------
== Dependency
react-transition-group
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) 2018, React Community
Copyright 2013-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-use
== License Type
SPDX:Unlicense
== Copyright
@streamich ("githubUsername" : "streamich" )
--------------------------------- (separator) ----------------------------------
== Dependency
react-virtualized-auto-sizer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Brian Vaughn
--------------------------------- (separator) ----------------------------------
== Dependency
react-window
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Brian Vaughn
--------------------------------- (separator) ----------------------------------
== Dependency
react
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
read-pkg-up
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
read-pkg
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
readable-stream
== License Type
SPDX:MIT
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
readdirp
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2019 Thorsten Lorenz, Paul Miller (<https://paulmillr.com>)
Copyright (c) 2012-2019 Thorsten Lorenz, Paul Miller (https://paulmillr.com)
--------------------------------- (separator) ----------------------------------
== Dependency
real-require
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Paolo Insogna and the real-require contributors
--------------------------------- (separator) ----------------------------------
== Dependency
rechoir
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2019 Tyler Kellen <tyler@sleekcode.net>, Blaine Bublitz <blaine.bublitz@gmail.com>, and Eric Schoffstall <yo@contra.io>
--------------------------------- (separator) ----------------------------------
== Dependency
redent
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
redux-thunk
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-present Dan Abramov
--------------------------------- (separator) ----------------------------------
== Dependency
redux
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-present Dan Abramov
--------------------------------- (separator) ----------------------------------
== Dependency
reflect.getprototypeof
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
refractor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
regenerate
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
regenerator-runtime
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
regenerator-transform
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Facebook, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
regex-not
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016, 2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
regexp.prototype.flags
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
regjsgen
== License Type
SPDX:MIT
== Copyright
Copyright 2014-2020 Benjamin Tan <https://ofcr.se/>
Copyright 2014-2023 Benjamin Tan <https://ofcr.se/>
--------------------------------- (separator) ----------------------------------
== Dependency
regjsparser
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Julian Viereck and Contributors, All Rights Reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
rehype-react
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Mapbox
Copyright (c) 2015 Titus Wormer
Copyright (c) 2016 rhysd
--------------------------------- (separator) ----------------------------------
== Dependency
rehype-slug
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
rehype-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer
--------------------------------- (separator) ----------------------------------
== Dependency
relateurl
== License Type
SPDX:MIT
== Copyright
Copyright (c) Steven Vachon <contact@svachon.com> (svachon.com)
--------------------------------- (separator) ----------------------------------
== Dependency
relative-microtime
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
remark-emoji
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 rhysd
--------------------------------- (separator) ----------------------------------
== Dependency
remark-external-links
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Cédric Delpoux <xuopled@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
remark-footnotes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
remark-mdx
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018-2019 Titus Wormer and John Otander
--------------------------------- (separator) ----------------------------------
== Dependency
remark-parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
remark-rehype
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
remark-slug
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
remark-squeeze-paragraphs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Eugene Sharygin
--------------------------------- (separator) ----------------------------------
== Dependency
remove-bom-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
remove-bom-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
remove-trailing-separator
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017 Tomas Sardyha <darsain@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
rendering_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
renderkid
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Aria Minaei
--------------------------------- (separator) ----------------------------------
== Dependency
repeat-element
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-present, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
repeat-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright (c) 2014-2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
repeating
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
replace-ext
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
require-directory
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Troy Goode <troygoode@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
require-from-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) Vsevolod Strukchinsky <floatdrop@gmail.com> (github.com/floatdrop)
--------------------------------- (separator) ----------------------------------
== Dependency
require-in-the-middle
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2019 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
require-main-filename
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
requires-port
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Unshift.io, Arnout Kazemier, the Contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
reselect
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2018 Reselect Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
resize-observer-polyfill
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Denis Rul
--------------------------------- (separator) ----------------------------------
== Dependency
resolve-from
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
resolve-options
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
resolve-pathname
== License Type
SPDX:MIT
== Copyright
Copyright (c) Michael Jackson 2016-2018
--------------------------------- (separator) ----------------------------------
== Dependency
resolve-url
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Simon Lydell
Copyright 2014 Simon Lydell
--------------------------------- (separator) ----------------------------------
== Dependency
resolve
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 James Halliday
--------------------------------- (separator) ----------------------------------
== Dependency
restore-cursor
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
ret
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2011 by Roly Fentanes
--------------------------------- (separator) ----------------------------------
== Dependency
reusify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Matteo Collina
--------------------------------- (separator) ----------------------------------
== Dependency
rimraf
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
ripemd160
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 crypto-browserify
--------------------------------- (separator) ----------------------------------
== Dependency
rison-node
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2006 Oliver Steele. All rights reserved.
Copyright 2012 rison origninal author
--------------------------------- (separator) ----------------------------------
== Dependency
rsvp
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Yehuda Katz, Tom Dale, Stefan Penner and contributors
Copyright (c) 2016 Yehuda Katz, Tom Dale, Stefan Penner and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
rtl-css-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Kent C. Dodds
--------------------------------- (separator) ----------------------------------
== Dependency
run-async
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Simon Boudrias
Copyright (c) 2014 Simon Boudrias (twitter: @vaxilart)
--------------------------------- (separator) ----------------------------------
== Dependency
run-parallel
== License Type
SPDX:MIT
== Copyright
Copyright (c) Feross Aboukhadijeh
Copyright (c) [Feross Aboukhadijeh](http://feross.org).
--------------------------------- (separator) ----------------------------------
== Dependency
run-queue
== License Type
Copyright Rebecca Turner
== Copyright
Copyright Rebecca Turner
--------------------------------- (separator) ----------------------------------
== Dependency
rxjs
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (c) 2015-2018 Google, Inc., Netflix, Inc., Microsoft Corp. and contributors
Copyright (c) Microsoft Corporation. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
safe-array-concat
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
safe-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (C) [Feross Aboukhadijeh](http://feross.org)
Copyright (c) Feross Aboukhadijeh
--------------------------------- (separator) ----------------------------------
== Dependency
safe-push-apply
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
safe-regex-test
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
safe-regex
== License Type
SPDX:MIT
== Copyright
James C. (Jamie) Davis <davisjam@vt.edu>
--------------------------------- (separator) ----------------------------------
== Dependency
safe-stable-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) Ruben Bridgewater
--------------------------------- (separator) ----------------------------------
== Dependency
safer-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Nikita Skovoroda <chalkerx@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
sax
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
scheduler
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
screenfull
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
secure-json-parse
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2019 The Fastify Team
Copyright (c) 2019, Sideway Inc, and project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
seedrandom
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>
Copyright 2019 David Bau.
--------------------------------- (separator) ----------------------------------
== Dependency
semver
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
send
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk
Copyright (c) 2014-2022 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
serialize-javascript
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Yahoo! Inc. All rights reserved.
Copyright 2014 Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
serve-favicon
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010 Sencha Inc.
Copyright (c) 2011 LearnBoost
Copyright (c) 2011 TJ Holowaychuk
Copyright (c) 2014-2017 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
serve-static
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010 Sencha Inc.
Copyright (c) 2011 LearnBoost
Copyright (c) 2011 TJ Holowaychuk
Copyright (c) 2014-2016 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
set-blocking
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
set-function-length
== License Type
SPDX:MIT
== Copyright
Copyright (c) Jordan Harband and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
set-function-name
== License Type
SPDX:MIT
== Copyright
Copyright (c) Jordan Harband and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
set-harmonic-interval
== License Type
SPDX:Unlicense
== Copyright
streamich ("githubUsername" : "streamich" )
--------------------------------- (separator) ----------------------------------
== Dependency
set-proto
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
set-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
Copyright (c) Jon Schlinkert (https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
setimmediate
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 Barnesandnoble.com, llc, Donavon West, and Domenic Denicola
--------------------------------- (separator) ----------------------------------
== Dependency
setprototypeof
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Wes Todd
--------------------------------- (separator) ----------------------------------
== Dependency
sha.js
== License Type
=== BSD-3-Clause--modified-by-Google
Copyright (c) 2013-2018 sha.js contributors
Copyright (c) 1998 - 2009, Paul Johnston & Contributors
All rights reserved.
== Copyright
Copyright (c) 1998 - 2009, Paul Johnston & Contributors
Copyright (c) 2013-2018 sha.js contributors
--------------------------------- (separator) ----------------------------------
== Dependency
shallow-clone-shim
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
shallow-clone
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-present, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
shallowequal
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Alberto Leal <mailforalberto@gmail.com> (github.com/dashed)
--------------------------------- (separator) ----------------------------------
== Dependency
shebang-command
== License Type
SPDX:MIT
== Copyright
Copyright (c) Kevin Mårtensson <kevinmartensson@gmail.com> (github.com/kevva)
--------------------------------- (separator) ----------------------------------
== Dependency
shebang-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
shelljs
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2010 Ryan McGrath
Copyright (c) 2012 Artur Adib
Copyright (c) 2012, Artur Adib <arturadib@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
side-channel-list
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
side-channel-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2024 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
side-channel-weakmap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
side-channel
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
signal-exit
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
simple-git
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Steve King
--------------------------------- (separator) ----------------------------------
== Dependency
simple-swizzle
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Josh Junon
--------------------------------- (separator) ----------------------------------
== Dependency
sisteransi
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Terkel Gjervig Nielsen
--------------------------------- (separator) ----------------------------------
== Dependency
slash
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
snapdragon-node
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
snapdragon-util
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
snapdragon
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2015-2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
sonic-boom
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Matteo Collina
--------------------------------- (separator) ----------------------------------
== Dependency
source-list-map
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 JS Foundation
Copyright 2011 Mozilla Foundation and contributors
Copyright 2011 The Closure Compiler Authors. All rights reserved.
Copyright 2017 JS Foundation
--------------------------------- (separator) ----------------------------------
== Dependency
source-map-js
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2009-2011, Mozilla Foundation and contributors
Copyright 2009-2011 Mozilla Foundation and contributors
Copyright 2011 Mozilla Foundation and contributors
Copyright 2011 The Closure Compiler Authors. All rights reserved.
Copyright 2014 Mozilla Foundation and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
source-map-resolve
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014, 2015, 2016, 2017, 2018, 2019 Simon Lydell
Copyright (c) 2019 ZHAO Jinxiang
--------------------------------- (separator) ----------------------------------
== Dependency
source-map-support
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Evan Wallace
--------------------------------- (separator) ----------------------------------
== Dependency
source-map-url
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Simon Lydell
Copyright 2014 Simon Lydell
--------------------------------- (separator) ----------------------------------
== Dependency
source-map
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2009-2011, Mozilla Foundation and contributors
Copyright 2009-2011 Mozilla Foundation and contributors
Copyright 2011 Mozilla Foundation and contributors
Copyright 2011 The Closure Compiler Authors. All rights reserved.
Copyright 2014 Mozilla Foundation and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
sourcemap-codec
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Rich Harris
--------------------------------- (separator) ----------------------------------
== Dependency
space-separated-tokens
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
spdx-exceptions
== License Type
SPDX:CC-BY-3.0
== Copyright
Copyright © 2010-2015 Linux Foundation and its Contributors. Licensed
--------------------------------- (separator) ----------------------------------
== Dependency
spdx-expression-parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Kyle E. Mitchell & other authors listed in AUTHORS
--------------------------------- (separator) ----------------------------------
== Dependency
spec-to-console
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
split-on-first
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
split-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
split2
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2014-2018, Matteo Collina <hello@matteocollina.com>
--------------------------------- (separator) ----------------------------------
== Dependency
sprintf-js
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2007-present, Alexandru Marasteanu <hello@alexei.ro>
--------------------------------- (separator) ----------------------------------
== Dependency
sql-summary
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2018 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
ssri
== License Type
SPDX:ISC
== Copyright
Copyright (c) npm, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
stable
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2018 Angry Bytes and contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
stack-generator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Eric Wendelin and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
stackframe
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Eric Wendelin and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
stacktrace-gps
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Eric Wendelin and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
stacktrace-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Yehuda Katz, Tom Dale, Stefan Penner and contributors (Conversion to ES6 API by Jake Archibald)
Copyright (c) 2017 Eric Wendelin and other contributors
Copyright 2011 Mozilla Foundation and contributors
Copyright 2011 The Closure Compiler Authors. All rights reserved.
Copyright 2012-2014, Kit Cambridge | http://kit.mit-license.org */
--------------------------------- (separator) ----------------------------------
== Dependency
state-toggle
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
static-extend
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
statuses
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2016 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
stop-iteration-iterator
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
store2
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 ESHA Research
Copyright (c) 2015 ESHA Research
Copyright (c) 2017 ESHA Research
Copyright (c) 2019 ESHA Research
Copyright (c) 2021 ESHA Research
Copyright (c) 2022, ESHA Research
Copyright (c) 2024 Nathan Bubna; Licensed MIT */
--------------------------------- (separator) ----------------------------------
== Dependency
stream-browserify
== License Type
SPDX:MIT
== Copyright
Copyright (c) James Halliday
--------------------------------- (separator) ----------------------------------
== Dependency
stream-chopper
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
stream-each
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
stream-http
== License Type
SPDX:MIT
== Copyright
Copyright (C) John Hiesey and other contributors.
Copyright (c) 2015 John Hiesey
--------------------------------- (separator) ----------------------------------
== Dependency
stream-shift
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
strict-uri-encode
== License Type
SPDX:MIT
== Copyright
Copyright (c) Kevin Martensson <kevinmartensson@gmail.com> (github.com/kevva)
--------------------------------- (separator) ----------------------------------
== Dependency
string-width
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
string.prototype.matchall
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
string.prototype.padend
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 EcmaScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
string.prototype.padstart
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 EcmaScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
string.prototype.trim
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
string.prototype.trimend
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Khaled Al-Ansari
--------------------------------- (separator) ----------------------------------
== Dependency
string.prototype.trimstart
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Khaled Al-Ansari
--------------------------------- (separator) ----------------------------------
== Dependency
string_decoder
== License Type
SPDX:MIT
== Copyright
Copyright Node.js contributors. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
stringify-entities
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <mailto:tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
strip-ansi
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
strip-bom
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
strip-eof
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
strip-final-newline
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
strip-indent
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
strnum
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Natural Intelligence
--------------------------------- (separator) ----------------------------------
== Dependency
style-to-object
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Menglin "Mark" Xu <mark@remarkablemark.org>
--------------------------------- (separator) ----------------------------------
== Dependency
styled-components
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
Copyright (c) 2016 Sultan Tarimo
Copyright © 2016-present Glen Maddern and Maximilian Stoiber.
--------------------------------- (separator) ----------------------------------
== Dependency
stylis
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-present Sultan Tarimo
--------------------------------- (separator) ----------------------------------
== Dependency
supports-color
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
supports-preserve-symlinks-flag
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2022 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
symbol-observable
== License Type
SPDX:MIT
== Copyright
Copyright (c) Ben Lesh <ben@benlesh.com>
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
symbol.prototype.description
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
synchronous-promise
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2016, Davyd McColl
--------------------------------- (separator) ----------------------------------
== Dependency
tabbable
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 David Clark
--------------------------------- (separator) ----------------------------------
== Dependency
tapable
== License Type
SPDX:MIT
== Copyright
Copyright (c) Tobias Koppers @sokra
--------------------------------- (separator) ----------------------------------
== Dependency
tar-fs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
tar-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
tar
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
terser
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright 2012-2018 (c) Mihai Bazon <mihai.bazon@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
test-exclude
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
text-diff
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2006 Google Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
thread-stream
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2021 Matteo Collina
--------------------------------- (separator) ----------------------------------
== Dependency
throttle-debounce
== License Type
SPDX:MIT
== Copyright
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
Copyright (c) 2010 "Cowboy" Ben Alman
Copyright (c) 2010 "Cowboy" Ben Alman (Dual licensed under the MIT and GPL licenses. http://benalman.com/about/license/)
Copyright (c) Ivan Nikolić <http://ivannikolic.com>
--------------------------------- (separator) ----------------------------------
== Dependency
through2-filter
== License Type
SPDX:MIT
== Copyright
Copyright (c) Bryce B. Baril <bryce@ravenwall.com>
--------------------------------- (separator) ----------------------------------
== Dependency
through2
== License Type
SPDX:MIT
== Copyright
Copyright (c) Rod Vagg (the "Original Author") and additional contributors**
Copyright (c) Rod Vagg [@rvagg](https://twitter.com/rvagg) and additional contributors and licensed under the MIT license. All rights not explicitly granted in the MIT license are reserved. See the included LICENSE file for more details.
--------------------------------- (separator) ----------------------------------
== Dependency
through
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Dominic Tarr
--------------------------------- (separator) ----------------------------------
== Dependency
timers-browserify
== License Type
SPDX:MIT
== Copyright
Copyright © 2012 J. Ryan Stinnett <jryans@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
tiny-emitter
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Scott Corgan
--------------------------------- (separator) ----------------------------------
== Dependency
tiny-invariant
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Alexander Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
tiny-warning
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Alexander Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
tinycolor2
== License Type
SPDX:MIT
== Copyright
Copyright (c), Brian Grinstead, http://briangrinstead.com
--------------------------------- (separator) ----------------------------------
== Dependency
tinygradient
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2020 Damien Sorel
Copyright 2014-2020 Damien "Mistic" Sorel (http://www.strangeplanet.fr)
copyright 2014-2021 Damien "Mistic" Sorel <contact@git.strangeplanet.fr>
--------------------------------- (separator) ----------------------------------
== Dependency
tmp
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011-2017 KARASZI Istvan <github@spam.raszi.hu>
Copyright (c) 2014 KARASZI István
--------------------------------- (separator) ----------------------------------
== Dependency
tmpl
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Naitik Shah. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
to-absolute-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2016, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
to-arraybuffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 John Hiesey
--------------------------------- (separator) ----------------------------------
== Dependency
to-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Mathias Buus
--------------------------------- (separator) ----------------------------------
== Dependency
to-fast-properties
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Petka Antonov
--------------------------------- (separator) ----------------------------------
== Dependency
to-object-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright (c) 2015-2016, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
to-regex-range
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017, Jon Schlinkert.
Copyright (c) 2015-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
to-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2018, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
to-through
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
toggle-selection
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 sudodoki <smd.deluzion@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
toidentifier
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
topo
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2012-2014, Walmart
Copyright (c) 2012-2018, Project contributors
--------------------------------- (separator) ----------------------------------
== Dependency
tr46
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Sebastian Mayr
--------------------------------- (separator) ----------------------------------
== Dependency
tree-kill
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Peter Krumins
--------------------------------- (separator) ----------------------------------
== Dependency
trim-newlines
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
trim-trailing-lines
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <mailto:tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
trim
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>
--------------------------------- (separator) ----------------------------------
== Dependency
trough
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
ts-debounce
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Jakub Chodorowicz
--------------------------------- (separator) ----------------------------------
== Dependency
ts-dedent
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Tamino Martinius
--------------------------------- (separator) ----------------------------------
== Dependency
ts-easing
== License Type
SPDX:Unlicense
== Copyright
streamich ("githubUsername" : "streamich" )
--------------------------------- (separator) ----------------------------------
== Dependency
ts-pnp
== License Type
SPDX:MIT
== Copyright
Copyright © 2016 Maël Nison**
--------------------------------- (separator) ----------------------------------
== Dependency
tslib
== License Type
SPDX:BSD-0-Clause
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
tty-browserify
== License Type
SPDX:MIT
== Copyright
James Halliday (mail@substack.net)
--------------------------------- (separator) ----------------------------------
== Dependency
type-check
== License Type
SPDX:MIT
== Copyright
Copyright (c) George Zahariev
--------------------------------- (separator) ----------------------------------
== Dependency
type-detect
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Jake Luer <jake@alogicalparadox.com> (http://alogicalparadox.com)
--------------------------------- (separator) ----------------------------------
== Dependency
type-fest
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
type-is
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
Copyright (c) 2014-2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
type
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2019-2022, Mariusz Nowak, @medikoo, medikoo.com
--------------------------------- (separator) ----------------------------------
== Dependency
typed-array-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
typed-array-byte-length
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
typed-array-byte-offset
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
typed-array-length
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
typed-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018 Jos de Jong
--------------------------------- (separator) ----------------------------------
== Dependency
typedarray-to-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (C) [Feross Aboukhadijeh](http://feross.org).
Copyright (c) Feross Aboukhadijeh
--------------------------------- (separator) ----------------------------------
== Dependency
typedarray
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2010, Linden Research, Inc.
Copyright (c) 2012, Joshua Bell
--------------------------------- (separator) ----------------------------------
== Dependency
uc.micro
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
uglify-js
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright 2012 (c) Mihai Bazon <mihai.bazon@gmail.com>
Copyright 2012-2019 (c) Mihai Bazon <mihai.bazon@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
ui_settings_plugin
== License Type
SPDX:Apache-2.0
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
unbox-primitive
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
unc-path-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, Jon Schlinkert.
Copyright © 2015 Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
undici-types
== License Type
SPDX:MIT
== Copyright
[{'name': 'Daniele Belardi', 'url': 'https://github.com/dnlup', 'author': True}, {'name': 'Ethan Arrowood', 'url': 'https://github.com/ethan-arrowood', 'author': True}, {'name': 'Matteo Collina', 'url': 'https://github.com/mcollina', 'author': True}, {'name': 'Matthew Aitken', 'url': 'https://github.com/KhafraDev', 'author': True}, {'name': 'Robert Nagy', 'url': 'https://github.com/ronag', 'author': True}, {'name': 'Szymon Marczak', 'url': 'https://github.com/szmarczak', 'author': True}, {'name': 'Tomas Della Vedova', 'url': 'https://github.com/delvedor', 'author': True}]
--------------------------------- (separator) ----------------------------------
== Dependency
unfetch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Jason Miller
--------------------------------- (separator) ----------------------------------
== Dependency
unherit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unicode-byte-truncate
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Thomas Watson Steen
--------------------------------- (separator) ----------------------------------
== Dependency
unicode-canonical-property-names-ecmascript
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
unicode-match-property-ecmascript
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
unicode-match-property-value-ecmascript
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
unicode-property-aliases-ecmascript
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (separator) ----------------------------------
== Dependency
unicode-substring
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Ville Lautanala
--------------------------------- (separator) ----------------------------------
== Dependency
unified
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
union-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert
--------------------------------- (separator) ----------------------------------
== Dependency
unique-filename
== License Type
SPDX:ISC
== Copyright
Copyright npm, Inc
--------------------------------- (separator) ----------------------------------
== Dependency
unique-slug
== License Type
SPDX:ISC
== Copyright
Copyright npm, Inc
--------------------------------- (separator) ----------------------------------
== Dependency
unique-stream
== License Type
SPDX:MIT
== Copyright
Copyright 2014 Eugene Ware
--------------------------------- (separator) ----------------------------------
== Dependency
unist-builder
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Eugene Sharygin
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-generated
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-is
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-position
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-remove-position
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-remove
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Eugene Sharygin
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-stringify-position
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-visit-parents
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unist-util-visit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
universalify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Ryan Zimmerman <opensrc@ryanzim.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unpipe
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
--------------------------------- (separator) ----------------------------------
== Dependency
unset-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017, Jon Schlinkert
Copyright (c) 2015, 2017, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
untildify
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
upath
== License Type
SPDX:MIT
== Copyright
Copyright(c) 2014-2023 Angelos Pikoulas (agelos.pikoulas@gmail.com) a.k.a AnoDyNoS
--------------------------------- (separator) ----------------------------------
== Dependency
update-browserslist-db
== License Type
SPDX:MIT
== Copyright
Copyright 2022 Andrey Sitnik <andrey@sitnik.ru> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
uri-js
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright 2011 Gary Court. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
urix
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Simon Lydell
Copyright 2014 Simon Lydell
--------------------------------- (separator) ----------------------------------
== Dependency
url-parse
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Unshift.io, Arnout Kazemier, the Contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
url
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2002-2008 Kris Kowal <http://cixar.com/~kris.kowal>
Copyright 2014 Joyent, Inc. and other Node contributors.
--------------------------------- (separator) ----------------------------------
== Dependency
use-callback-ref
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton Korzunov
--------------------------------- (separator) ----------------------------------
== Dependency
use-memo-one
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Alexander Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
use-sidecar
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton Korzunov
--------------------------------- (separator) ----------------------------------
== Dependency
use-sync-external-store
== License Type
SPDX:MIT
== Copyright
Copyright (c) Meta Platforms, Inc. and affiliates.
--------------------------------- (separator) ----------------------------------
== Dependency
use
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
Copyright (c) 2015-present, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
util-deprecate
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
util.promisify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
util
== License Type
SPDX:MIT
== Copyright
{'name': 'Joyent', 'url': 'http://www.joyent.com'}
--------------------------------- (separator) ----------------------------------
== Dependency
utila
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Aria Minaei
--------------------------------- (separator) ----------------------------------
== Dependency
utility-types
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Piotr Witek
Copyright (c) 2016 Piotr Witek <mailto:piotrek.witek@gmail.com> (http://piotrwitek.github.io)
Copyright (c) 2016 Piotr Witek <piotrek.witek@gmail.com> (http://piotrwitek.github.io)
--------------------------------- (separator) ----------------------------------
== Dependency
utils-merge
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2017 Jared Hanson
Copyright (c) 2013-2017 Jared Hanson <[http://jaredhanson.net/](http://jaredhanson.net/)>
--------------------------------- (separator) ----------------------------------
== Dependency
uuid-browser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Heiko Mathes
--------------------------------- (separator) ----------------------------------
== Dependency
uuid
== License Type
SPDX:MIT
== Copyright
Copyright (C) Paul Johnston 1999 - 2009
Copyright (c) 2010-2016 Robert Kieffer and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
v8-to-istanbul
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2017, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
value-equal
== License Type
SPDX:MIT
== Copyright
Copyright (c) Michael Jackson 2016-2018
--------------------------------- (separator) ----------------------------------
== Dependency
value-or-function
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Blaine Bublitz, Eric Schoffstall and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
vary
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017 Douglas Christopher Wilson
--------------------------------- (separator) ----------------------------------
== Dependency
vfile-location
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
vfile-message
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
vfile
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday
Copyright (c) 2015 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
vinyl-fs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
vinyl-sourcemap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors (Based on code from gulp-sourcemaps - ISC License - Copyright (c) 2014, Florian Reiterer)
--------------------------------- (separator) ----------------------------------
== Dependency
vinyl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Blaine Bublitz <blaine.bublitz@gmail.com>, Eric Schoffstall <yo@contra.io> and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
vm-browserify
== License Type
SPDX:MIT
== Copyright
James Halliday (mail@substack.net)
--------------------------------- (separator) ----------------------------------
== Dependency
walker
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2013 Naitik Shah
--------------------------------- (separator) ----------------------------------
== Dependency
watchpack-chokidar2
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
weak-lru-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Kris Zyp
--------------------------------- (separator) ----------------------------------
== Dependency
web-namespaces
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
webidl-conversions
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) 2014, Domenic Denicola
--------------------------------- (separator) ----------------------------------
== Dependency
webpack-log
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 webpack-contrib
--------------------------------- (separator) ----------------------------------
== Dependency
webpack-merge
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Juho Vepsalainen
--------------------------------- (separator) ----------------------------------
== Dependency
webpack-sources
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
webpack-virtual-modules
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 SysGears
Copyright © 2017 [SysGears INC]. This source code is licensed under the [MIT] license.
--------------------------------- (separator) ----------------------------------
== Dependency
whatwg-fetch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2023 GitHub, Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
whatwg-url
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015–2016 Sebastian Mayr
--------------------------------- (separator) ----------------------------------
== Dependency
which-boxed-primitive
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
which-builtin-type
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 ECMAScript Shims
--------------------------------- (separator) ----------------------------------
== Dependency
which-collection
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
which-module
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
which-typed-array
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
which
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
wide-align
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
widest-line
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
word-wrap
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2016, Jon Schlinkert
Copyright (c) 2014-2023, Jon Schlinkert.
--------------------------------- (separator) ----------------------------------
== Dependency
wordwrap
== License Type
SPDX:MIT
== Copyright
(no copyright notices found)
--------------------------------- (separator) ----------------------------------
== Dependency
worker-farm
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 LevelUP contributors
Copyright (c) 2014 Rod Vagg [@rvagg](https://twitter.com/rvagg) and licensed under the MIT license. All rights not explicitly granted in the MIT license are reserved. See the included LICENSE.md file for more details.
--------------------------------- (separator) ----------------------------------
== Dependency
worker-rpc
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Christian Speckner <cnspeckn@googlemail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
wrap-ansi
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
wrappy
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
write-file-atomic
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Rebecca Turner
--------------------------------- (separator) ----------------------------------
== Dependency
ws
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Einar Otto Stangvik <einaros@gmail.com>
Copyright (c) 2013 Arnout Kazemier and contributors
Copyright (c) 2016 Luigi Pinca and contributors
--------------------------------- (separator) ----------------------------------
== Dependency
x-default-browser
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jakub Gieryluk
--------------------------------- (separator) ----------------------------------
== Dependency
xml2js
== License Type
SPDX:MIT
== Copyright
--------------------------------- (separator) ----------------------------------
== Dependency
xmlbuilder
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 Ozgur Ozcitak
--------------------------------- (separator) ----------------------------------
== Dependency
xtend
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Raynos.
--------------------------------- (separator) ----------------------------------
== Dependency
y18n
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
yallist
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
yaml
== License Type
SPDX:ISC
== Copyright
Copyright 2018 Eemeli Aro <eemeli@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
yargs-parser
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
yargs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2011 Andrei Mackenzie
Copyright 2010 James Halliday (mail@substack.net); Modified work Copyright 2014 Contributors (ben@npmjs.com)
--------------------------------- (separator) ----------------------------------
== Dependency
yauzl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Josh Wolfe
--------------------------------- (separator) ----------------------------------
== Dependency
yazl
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Josh Wolfe
--------------------------------- (separator) ----------------------------------
== Dependency
yocto-queue
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
zlib
== License Type
Copyright (c) 2011, Konstantin Käfer <kkaefer@gmail.com>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of node-zlib nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL Konstantin Käfer BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
== Copyright
Copyright (c) 2011, Konstantin Käfer <kkaefer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
zustand
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Paul Henschel
--------------------------------- (separator) ----------------------------------
== Dependency
zwitch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
----------------------------------- Licenses -----------------------------------
--------------------------------- (separator) ----------------------------------
== SPDX:Apache-2.0
Apache License
--------------------------------- (separator) ----------------------------------
== SPDX:BSD-0-Clause
--------------------------------- (separator) ----------------------------------
== SPDX:BSD-2-Clause
--------------------------------- (separator) ----------------------------------
== SPDX:BSD-3-Clause
--------------------------------- (separator) ----------------------------------
== SPDX:CC-BY-3.0
Creative Commons Legal Code
Attribution 3.0 Unported
CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
LEGAL SERVICES. DISTRIBUTION OF THIS LICENSE DOES NOT CREATE AN
ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
REGARDING THE INFORMATION PROVIDED, AND DISCLAIMS LIABILITY FOR
DAMAGES RESULTING FROM ITS USE.
License
THE WORK (AS DEFINED BELOW) IS PROVIDED UNDER THE TERMS OF THIS CREATIVE
COMMONS PUBLIC LICENSE ("CCPL" OR "LICENSE"). THE WORK IS PROTECTED BY
COPYRIGHT AND/OR OTHER APPLICABLE LAW. ANY USE OF THE WORK OTHER THAN AS
AUTHORIZED UNDER THIS LICENSE OR COPYRIGHT LAW IS PROHIBITED.
BY EXERCISING ANY RIGHTS TO THE WORK PROVIDED HERE, YOU ACCEPT AND AGREE
TO BE BOUND BY THE TERMS OF THIS LICENSE. TO THE EXTENT THIS LICENSE MAY
BE CONSIDERED TO BE A CONTRACT, THE LICENSOR GRANTS YOU THE RIGHTS
CONTAINED HERE IN CONSIDERATION OF YOUR ACCEPTANCE OF SUCH TERMS AND
CONDITIONS.
1. Definitions
a. "Adaptation" means a work based upon the Work, or upon the Work and
other pre-existing works, such as a translation, adaptation,
derivative work, arrangement of music or other alterations of a
literary or artistic work, or phonogram or performance and includes
cinematographic adaptations or any other form in which the Work may be
recast, transformed, or adapted including in any form recognizably
derived from the original, except that a work that constitutes a
Collection will not be considered an Adaptation for the purpose of
this License. For the avoidance of doubt, where the Work is a musical
work, performance or phonogram, the synchronization of the Work in
timed-relation with a moving image ("synching") will be considered an
Adaptation for the purpose of this License.
b. "Collection" means a collection of literary or artistic works, such as
encyclopedias and anthologies, or performances, phonograms or
broadcasts, or other works or subject matter other than works listed
in Section 1(f) below, which, by reason of the selection and
arrangement of their contents, constitute intellectual creations, in
which the Work is included in its entirety in unmodified form along
with one or more other contributions, each constituting separate and
independent works in themselves, which together are assembled into a
collective whole. A work that constitutes a Collection will not be
considered an Adaptation (as defined above) for the purposes of this
License.
c. "Distribute" means to make available to the public the original and
copies of the Work or Adaptation, as appropriate, through sale or
other transfer of ownership.
d. "Licensor" means the individual, individuals, entity or entities that
offer(s) the Work under the terms of this License.
e. "Original Author" means, in the case of a literary or artistic work,
the individual, individuals, entity or entities who created the Work
or if no individual or entity can be identified, the publisher; and in
addition (i) in the case of a performance the actors, singers,
musicians, dancers, and other persons who act, sing, deliver, declaim,
play in, interpret or otherwise perform literary or artistic works or
expressions of folklore; (ii) in the case of a phonogram the producer
being the person or legal entity who first fixes the sounds of a
performance or other sounds; and, (iii) in the case of broadcasts, the
organization that transmits the broadcast.
f. "Work" means the literary and/or artistic work offered under the terms
of this License including without limitation any production in the
literary, scientific and artistic domain, whatever may be the mode or
form of its expression including digital form, such as a book,
pamphlet and other writing; a lecture, address, sermon or other work
of the same nature; a dramatic or dramatico-musical work; a
choreographic work or entertainment in dumb show; a musical
composition with or without words; a cinematographic work to which are
assimilated works expressed by a process analogous to cinematography;
a work of drawing, painting, architecture, sculpture, engraving or
lithography; a photographic work to which are assimilated works
expressed by a process analogous to photography; a work of applied
art; an illustration, map, plan, sketch or three-dimensional work
relative to geography, topography, architecture or science; a
performance; a broadcast; a phonogram; a compilation of data to the
extent it is protected as a copyrightable work; or a work performed by
a variety or circus performer to the extent it is not otherwise
considered a literary or artistic work.
g. "You" means an individual or entity exercising rights under this
License who has not previously violated the terms of this License with
respect to the Work, or who has received express permission from the
Licensor to exercise rights under this License despite a previous
violation.
h. "Publicly Perform" means to perform public recitations of the Work and
to communicate to the public those public recitations, by any means or
process, including by wire or wireless means or public digital
performances; to make available to the public Works in such a way that
members of the public may access these Works from a place and at a
place individually chosen by them; to perform the Work to the public
by any means or process and the communication to the public of the
performances of the Work, including by public digital performance; to
broadcast and rebroadcast the Work by any means including signs,
sounds or images.
i. "Reproduce" means to make copies of the Work by any means including
without limitation by sound or visual recordings and the right of
fixation and reproducing fixations of the Work, including storage of a
protected performance or phonogram in digital form or other electronic
medium.
2. Fair Dealing Rights. Nothing in this License is intended to reduce,
limit, or restrict any uses free from copyright or rights arising from
limitations or exceptions that are provided for in connection with the
copyright protection under copyright law or other applicable laws.
3. License Grant. Subject to the terms and conditions of this License,
Licensor hereby grants You a worldwide, royalty-free, non-exclusive,
perpetual (for the duration of the applicable copyright) license to
exercise the rights in the Work as stated below:
a. to Reproduce the Work, to incorporate the Work into one or more
Collections, and to Reproduce the Work as incorporated in the
Collections;
b. to create and Reproduce Adaptations provided that any such Adaptation,
including any translation in any medium, takes reasonable steps to
clearly label, demarcate or otherwise identify that changes were made
to the original Work. For example, a translation could be marked "The
original work was translated from English to Spanish," or a
modification could indicate "The original work has been modified.";
c. to Distribute and Publicly Perform the Work including as incorporated
in Collections; and,
d. to Distribute and Publicly Perform Adaptations.
e. For the avoidance of doubt:
i. Non-waivable Compulsory License Schemes. In those jurisdictions in
which the right to collect royalties through any statutory or
compulsory licensing scheme cannot be waived, the Licensor
reserves the exclusive right to collect such royalties for any
exercise by You of the rights granted under this License;
ii. Waivable Compulsory License Schemes. In those jurisdictions in
which the right to collect royalties through any statutory or
compulsory licensing scheme can be waived, the Licensor waives the
exclusive right to collect such royalties for any exercise by You
of the rights granted under this License; and,
iii. Voluntary License Schemes. The Licensor waives the right to
collect royalties, whether individually or, in the event that the
Licensor is a member of a collecting society that administers
voluntary licensing schemes, via that society, from any exercise
by You of the rights granted under this License.
The above rights may be exercised in all media and formats whether now
known or hereafter devised. The above rights include the right to make
such modifications as are technically necessary to exercise the rights in
other media and formats. Subject to Section 8(f), all rights not expressly
granted by Licensor are hereby reserved.
4. Restrictions. The license granted in Section 3 above is expressly made
subject to and limited by the following restrictions:
a. You may Distribute or Publicly Perform the Work only under the terms
of this License. You must include a copy of, or the Uniform Resource
Identifier (URI) for, this License with every copy of the Work You
Distribute or Publicly Perform. You may not offer or impose any terms
on the Work that restrict the terms of this License or the ability of
the recipient of the Work to exercise the rights granted to that
recipient under the terms of the License. You may not sublicense the
Work. You must keep intact all notices that refer to this License and
to the disclaimer of warranties with every copy of the Work You
Distribute or Publicly Perform. When You Distribute or Publicly
Perform the Work, You may not impose any effective technological
measures on the Work that restrict the ability of a recipient of the
Work from You to exercise the rights granted to that recipient under
the terms of the License. This Section 4(a) applies to the Work as
incorporated in a Collection, but this does not require the Collection
apart from the Work itself to be made subject to the terms of this
License. If You create a Collection, upon notice from any Licensor You
must, to the extent practicable, remove from the Collection any credit
as required by Section 4(b), as requested. If You create an
Adaptation, upon notice from any Licensor You must, to the extent
practicable, remove from the Adaptation any credit as required by
Section 4(b), as requested.
b. If You Distribute, or Publicly Perform the Work or any Adaptations or
Collections, You must, unless a request has been made pursuant to
Section 4(a), keep intact all copyright notices for the Work and
provide, reasonable to the medium or means You are utilizing: (i) the
name of the Original Author (or pseudonym, if applicable) if supplied,
and/or if the Original Author and/or Licensor designate another party
or parties (e.g., a sponsor institute, publishing entity, journal) for
attribution ("Attribution Parties") in Licensor's copyright notice,
terms of service or by other reasonable means, the name of such party
or parties; (ii) the title of the Work if supplied; (iii) to the
extent reasonably practicable, the URI, if any, that Licensor
specifies to be associated with the Work, unless such URI does not
refer to the copyright notice or licensing information for the Work;
and (iv) , consistent with Section 3(b), in the case of an Adaptation,
a credit identifying the use of the Work in the Adaptation (e.g.,
"French translation of the Work by Original Author," or "Screenplay
based on original Work by Original Author"). The credit required by
this Section 4 (b) may be implemented in any reasonable manner;
provided, however, that in the case of a Adaptation or Collection, at
a minimum such credit will appear, if a credit for all contributing
authors of the Adaptation or Collection appears, then as part of these
credits and in a manner at least as prominent as the credits for the
other contributing authors. For the avoidance of doubt, You may only
use the credit required by this Section for the purpose of attribution
in the manner set out above and, by exercising Your rights under this
License, You may not implicitly or explicitly assert or imply any
connection with, sponsorship or endorsement by the Original Author,
Licensor and/or Attribution Parties, as appropriate, of You or Your
use of the Work, without the separate, express prior written
permission of the Original Author, Licensor and/or Attribution
Parties.
c. Except as otherwise agreed in writing by the Licensor or as may be
otherwise permitted by applicable law, if You Reproduce, Distribute or
Publicly Perform the Work either by itself or as part of any
Adaptations or Collections, You must not distort, mutilate, modify or
take other derogatory action in relation to the Work which would be
prejudicial to the Original Author's honor or reputation. Licensor
agrees that in those jurisdictions (e.g. Japan), in which any exercise
of the right granted in Section 3(b) of this License (the right to
make Adaptations) would be deemed to be a distortion, mutilation,
modification or other derogatory action prejudicial to the Original
Author's honor and reputation, the Licensor will waive or not assert,
as appropriate, this Section, to the fullest extent permitted by the
applicable national law, to enable You to reasonably exercise Your
right under Section 3(b) of this License (right to make Adaptations)
but not otherwise.
5. Representations, Warranties and Disclaimer
UNLESS OTHERWISE MUTUALLY AGREED TO BY THE PARTIES IN WRITING, LICENSOR
OFFERS THE WORK AS-IS AND MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY
KIND CONCERNING THE WORK, EXPRESS, IMPLIED, STATUTORY OR OTHERWISE,
INCLUDING, WITHOUT LIMITATION, WARRANTIES OF TITLE, MERCHANTIBILITY,
FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF
LATENT OR OTHER DEFECTS, ACCURACY, OR THE PRESENCE OF ABSENCE OF ERRORS,
WHETHER OR NOT DISCOVERABLE. SOME JURISDICTIONS DO NOT ALLOW THE EXCLUSION
OF IMPLIED WARRANTIES, SO SUCH EXCLUSION MAY NOT APPLY TO YOU.
6. Limitation on Liability. EXCEPT TO THE EXTENT REQUIRED BY APPLICABLE
LAW, IN NO EVENT WILL LICENSOR BE LIABLE TO YOU ON ANY LEGAL THEORY FOR
ANY SPECIAL, INCIDENTAL, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY DAMAGES
ARISING OUT OF THIS LICENSE OR THE USE OF THE WORK, EVEN IF LICENSOR HAS
BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
7. Termination
a. This License and the rights granted hereunder will terminate
automatically upon any breach by You of the terms of this License.
Individuals or entities who have received Adaptations or Collections
from You under this License, however, will not have their licenses
terminated provided such individuals or entities remain in full
compliance with those licenses. Sections 1, 2, 5, 6, 7, and 8 will
survive any termination of this License.
b. Subject to the above terms and conditions, the license granted here is
perpetual (for the duration of the applicable copyright in the Work).
Notwithstanding the above, Licensor reserves the right to release the
Work under different license terms or to stop distributing the Work at
any time; provided, however that any such election will not serve to
withdraw this License (or any other license that has been, or is
required to be, granted under the terms of this License), and this
License will continue in full force and effect unless terminated as
stated above.
8. Miscellaneous
a. Each time You Distribute or Publicly Perform the Work or a Collection,
the Licensor offers to the recipient a license to the Work on the same
terms and conditions as the license granted to You under this License.
b. Each time You Distribute or Publicly Perform an Adaptation, Licensor
offers to the recipient a license to the original Work on the same
terms and conditions as the license granted to You under this License.
c. If any provision of this License is invalid or unenforceable under
applicable law, it shall not affect the validity or enforceability of
the remainder of the terms of this License, and without further action
by the parties to this agreement, such provision shall be reformed to
the minimum extent necessary to make such provision valid and
enforceable.
d. No term or provision of this License shall be deemed waived and no
breach consented to unless such waiver or consent shall be in writing
and signed by the party to be charged with such waiver or consent.
e. This License constitutes the entire agreement between the parties with
respect to the Work licensed here. There are no understandings,
agreements or representations with respect to the Work not specified
here. Licensor shall not be bound by any additional provisions that
may appear in any communication from You. This License may not be
modified without the mutual written agreement of the Licensor and You.
f. The rights granted under, and the subject matter referenced, in this
License were drafted utilizing the terminology of the Berne Convention
for the Protection of Literary and Artistic Works (as amended on
September 28, 1979), the Rome Convention of 1961, the WIPO Copyright
Treaty of 1996, the WIPO Performances and Phonograms Treaty of 1996
and the Universal Copyright Convention (as revised on July 24, 1971).
These rights and subject matter take effect in the relevant
jurisdiction in which the License terms are sought to be enforced
according to the corresponding provisions of the implementation of
those treaty provisions in the applicable national law. If the
standard suite of rights granted under applicable copyright law
includes additional rights not granted under this License, such
additional rights are deemed to be included in the License; this
License is not intended to restrict the license of any rights under
applicable law.
Creative Commons Notice
Creative Commons is not a party to this License, and makes no warranty
whatsoever in connection with the Work. Creative Commons will not be
liable to You or any party on any legal theory for any damages
whatsoever, including without limitation any general, special,
incidental or consequential damages arising in connection to this
license. Notwithstanding the foregoing two (2) sentences, if Creative
Commons has expressly identified itself as the Licensor hereunder, it
shall have all rights and obligations of Licensor.
Except for the limited purpose of indicating to the public that the
Work is licensed under the CCPL, Creative Commons does not authorize
the use by either party of the trademark "Creative Commons" or any
related trademark or logo of Creative Commons without the prior
written consent of Creative Commons. Any permitted use will be in
compliance with Creative Commons' then-current trademark usage
guidelines, as may be published on its website or otherwise made
available upon request from time to time. For the avoidance of doubt,
this trademark restriction does not form part of this License.
Creative Commons may be contacted at https://creativecommons.org/.
--------------------------------- (separator) ----------------------------------
== SPDX:CC0-1.0
Creative Commons CC0 1.0 Universal
Creative Commons Legal Code--------------------------------- (separator) ----------------------------------
== SPDX:ISC
--------------------------------- (separator) ----------------------------------
== SPDX:MIT
--------------------------------- (separator) ----------------------------------
== SPDX:Python-2.0
Python Software Foundation License, Version 2
--------------------------------- (separator) ----------------------------------
== SPDX:Unlicense
--------------------------------- (separator) ----------------------------------
== SPDX:WTFPL
=== Attribution helper version: {Major:0 Minor:11 GitVersion:0.10.0-114-g3747dab9 GitCommit:3747dab92eb29c0dbe6409ffbb824b9ae3a04b87 GitTreeState:clean BuildDate:2024-02-28T16:52:52Z GoVersion:go1.22.6 Compiler:gc Platform:darwin/arm64}