OpenSearch Dashboards
Provider: OpenSearch Contributors
Component(s): OpenSearch Dashboards
------------------------------ 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 2014, 2015, 2016, 2017, 2018 Simon Lydell
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
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
---
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
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
---
MIT License
Copyright (c) 2014-present Sebastian McKenzie and other contributors
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
---
This product bundles bootstrap@3.3.6 which is available under a
"MIT" license.
The MIT License (MIT)
Copyright (c) 2011-2015 Twitter, Inc
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
---
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
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
---
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
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-------------------------- Fourth Party Dependencies ---------------------------
----------------------------------- Licenses -----------------------------------
- Apache-2.0
- MIT
- BSD-3-Clause
- BSD-2-Clause
- ISC
- CC0-1.0
- CC-BY-4.0
- Unlicense
- WTFPL
- Public Domain
- BSD-0-Clause
--------------------------------- (separator) ----------------------------------
== Dependency
@ampproject/remapping
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019 Google LLC
--------------------------------- (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/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/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
@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 new 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 new 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 new 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}'),
Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */`;
--------------------------------- (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-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-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-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-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-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-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-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-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/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
@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
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
---
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.
Permission to use, copy, modify, and/or distribute this software for any purpose
with or without fee is hereby granted, provided that the above copyright notice
and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
THIS SOFTWARE.
--------------------------------- (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 2019-2021 Elasticsearch B.V.
Copyright 2020 Elastic and contributors
== Notices
@elastic/ecs-helpers
Copyright 2019-2021 Elasticsearch B.V.
--------------------------------- (separator) ----------------------------------
== Dependency
@elastic/ecs-pino-format
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2019-2021 Elasticsearch B.V.
Copyright 2020 Elastic and contributors
== Notices
@elastic/ecs-pino-format
Copyright 2019-2021 Elasticsearch B.V.
--------------------------------- (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 2011, Sebastian Tschan
Copyright 2012-2018 Elasticsearch B.V.
Copyright 2015, Yahoo! Inc.
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
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
--
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.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE
--------------------------------- (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/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/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
@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
@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/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
@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 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-next
== License Type
SPDX:Apache-2.0
== Copyright
opensearch-project
--------------------------------- (separator) ----------------------------------
== Dependency
@opensearch-project/opensearch
== License Type
SPDX:Apache-2.0
== Copyright
Copyright OpenSearch Contributors
== Notices
OpenSearch (https://opensearch.org/)
Copyright OpenSearch Contributors
This product includes software developed by
Elasticsearch (http://www.elastic.co).
This product includes software developed by The Apache Software
Foundation (http://www.apache.org/).
--------------------------------- (separator) ----------------------------------
== Dependency
@opentelemetry/api
== 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
Ahmad Bamieh <ahmadbamieh@gmail.com>
--------------------------------- (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.
Copyright 2014, 2015, 2016, 2017, 2018 Simon Lydell
--------------------------------- (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
Spencer Alger <email@spalger.com>
--------------------------------- (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
@types/chroma-js
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (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/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/js-cookie
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/json-schema
== 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/node-jose
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/node
== 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/webpack-sources
== License Type
SPDX:MIT
== Copyright
Copyright (c) Microsoft Corporation.
--------------------------------- (separator) ----------------------------------
== Dependency
@types/webpack
== 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-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:MIT
== 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
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
acorn
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012-2018 by various contributors (see AUTHORS)
--------------------------------- (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
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-colors
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Brian Woodward.
Copyright © 2018, [Brian Woodward](https://github.com/doowb).
--------------------------------- (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-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_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.
Copyright © 2017, [Brian Woodward](https://doowb.com).
--------------------------------- (separator) ----------------------------------
== Dependency
aproba
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2015, Rebecca Turner <me@re-becca.org>
--------------------------------- (separator) ----------------------------------
== Dependency
argparse
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2012 by Vitaly Puzrin
Copyright (c) 2012 [Vitaly Puzrin](https://github.com/puzrin).
--------------------------------- (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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
arr-flatten
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
array.prototype.find
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Paul Miller (https://paulmillr.com)
--------------------------------- (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
async-cache
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter
--------------------------------- (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-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
atob
== License Type
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
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction,
and distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by
the copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all
other entities that control, are controlled by, or are under common
control with that entity. For the purposes of this definition,
"control" means (i) the power, direct or indirect, to cause the
direction or management of such entity, whether by contract or
otherwise, or (ii) ownership of fifty percent (50%) or more of the
outstanding shares, or (iii) beneficial ownership of such entity.
"You" (or "Your") shall mean an individual or Legal Entity
exercising permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation
source, and configuration files.
"Object" form shall mean any form resulting from mechanical
transformation or translation of a Source form, including but
not limited to compiled object code, generated documentation,
and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or
Object form, made available under the License, as indicated by a
copyright notice that is included in or attached to the work
(an example is provided in the Appendix below).
"Derivative Works" shall mean any work, whether in Source or Object
form, that is based on (or derived from) the Work and for which the
editorial revisions, annotations, elaborations, or other modifications
represent, as a whole, an original work of authorship. For the purposes
of this License, Derivative Works shall not include works that remain
separable from, or merely link (or bind by name) to the interfaces of,
the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including
the original version of the Work and any modifications or additions
to that Work or Derivative Works thereof, that is intentionally
submitted to Licensor for inclusion in the Work by the copyright owner
or by an individual or Legal Entity authorized to submit on behalf of
the copyright owner. For the purposes of this definition, "submitted"
means any form of electronic, verbal, or written communication sent
to the Licensor or its representatives, including but not limited to
communication on electronic mailing lists, source code control systems,
and issue tracking systems that are managed by, or on behalf of, the
Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise
designated in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity
on behalf of whom a Contribution has been received by Licensor and
subsequently incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
copyright license to reproduce, prepare Derivative Works of,
publicly display, publicly perform, sublicense, and distribute the
Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of
this License, each Contributor hereby grants to You a perpetual,
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
(except as stated in this section) patent license to make, have made,
use, offer to sell, sell, import, and otherwise transfer the Work,
where such license applies only to those patent claims licensable
by such Contributor that are necessarily infringed by their
Contribution(s) alone or by combination of their Contribution(s)
with the Work to which such Contribution(s) was submitted. If You
institute patent litigation against any entity (including a
cross-claim or counterclaim in a lawsuit) alleging that the Work
or a Contribution incorporated within the Work constitutes direct
or contributory patent infringement, then any patent licenses
granted to You under this License for that Work shall terminate
as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the
Work or Derivative Works thereof in any medium, with or without
modifications, and in Source or Object form, provided that You
meet the following conditions:
(a) You must give any other recipients of the Work or
Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices
stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works
that You distribute, all copyright, patent, trademark, and
attribution notices from the Source form of the Work,
excluding those notices that do not pertain to any part of
the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its
distribution, then any Derivative Works that You distribute must
include a readable copy of the attribution notices contained
within such NOTICE file, excluding those notices that do not
pertain to any part of the Derivative Works, in at least one
of the following places: within a NOTICE text file distributed
as part of the Derivative Works; within the Source form or
documentation, if provided along with the Derivative Works; or,
within a display generated by the Derivative Works, if and
wherever such third-party notices normally appear. The contents
of the NOTICE file are for informational purposes only and
do not modify the License. You may add Your own attribution
notices within Derivative Works that You distribute, alongside
or as an addendum to the NOTICE text from the Work, provided
that such additional attribution notices cannot be construed
as modifying the License.
You may add Your own copyright statement to Your modifications and
may provide additional or different license terms and conditions
for use, reproduction, or distribution of Your modifications, or
for any such Derivative Works as a whole, provided Your use,
reproduction, and distribution of the Work otherwise complies with
the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise,
any Contribution intentionally submitted for inclusion in the Work
by You to the Licensor shall be under the terms and conditions of
this License, without any additional terms or conditions.
Notwithstanding the above, nothing herein shall supersede or modify
the terms of any separate license agreement you may have executed
with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade
names, trademarks, service marks, or product names of the Licensor,
except as required for reasonable and customary use in describing the
origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or
agreed to in writing, Licensor provides the Work (and each
Contributor provides its Contributions) on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
implied, including, without limitation, any warranties or conditions
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
PARTICULAR PURPOSE. You are solely responsible for determining the
appropriateness of using or redistributing the Work and assume any
risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory,
whether in tort (including negligence), contract, or otherwise,
unless required by applicable law (such as deliberate and grossly
negligent acts) or agreed to in writing, shall any Contributor be
liable to You for damages, including any direct, indirect, special,
incidental, or consequential damages of any character arising as a
result of this License or out of the use or inability to use the
Work (including but not limited to damages for loss of goodwill,
work stoppage, computer failure or malfunction, or any and all
other commercial damages or losses), even if such Contributor
has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing
the Work or Derivative Works thereof, You may choose to offer,
and charge a fee for, acceptance of support, warranty, indemnity,
or other liability obligations and/or rights consistent with this
License. However, in accepting such obligations, You may act only
on Your own behalf and on Your sole responsibility, not on behalf
of any other Contributor, and only if You agree to indemnify,
defend, and hold each Contributor harmless for any liability
incurred by, or claims asserted against, such Contributor by reason
of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "{}"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright 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
aws-sdk
== License Type
SPDX:Apache-2.0
== Copyright
Copyright (C) Paul Johnston 1999 - 2009
Copyright (c) 1998 - 2009, Paul Johnston & Contributors
Copyright (c) 2013 Dominic Tarr
Copyright 2011, Sebastian Tschan
Copyright 2012-2013 Amazon.com, Inc. or its affiliates. All Rights Reserved.
Copyright 2012-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
== Notices
AWS SDK for JavaScript
Copyright 2012-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.
This product includes software developed at
Amazon Web Services, Inc. (http://aws.amazon.com/).
--------------------------------- (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) ${year} ${lib.author}`;
Copyright (c) 2014-present Matt Zabriskie
Copyright (c) 2024 Matt Zabriskie
--------------------------------- (separator) ----------------------------------
== Dependency
babel-plugin-add-module-exports
== License Type
SPDX:MIT
== Copyright
Hiroyuki Usui <i59naga@icloud.com> ("githubUsername" : "59naga" )
--------------------------------- (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-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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
big.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Michael Mclaughlin
Copyright (c) 2018 Michael Mclaughlin <M8ch88l@gmail.com>
--------------------------------- (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
boolbase
== License Type
Copyright (c) 2014-2015, Felix Boehm <me@feedic.com>
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
== Copyright
Copyright (c) 2014-2015, Felix Boehm <me@feedic.com>
--------------------------------- (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.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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
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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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
caniuse-lite
== License Type
SPDX:CC-BY-4.0
== Copyright
{'name': 'Ben Briggs', 'email': 'beneb.info@gmail.com', 'url': 'http://beneb.info'}
--------------------------------- (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
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
cipher-base
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 crypto-browserify contributors
--------------------------------- (separator) ----------------------------------
== Dependency
class-utils
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017-2018, Jon Schlinkert.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
classnames
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018
Copyright (c) 2018 Jed Watson
Copyright (c) 2018 Jed Watson.
--------------------------------- (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-cursor
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.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-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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
== 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
compression-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (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-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
convert-source-map
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Thorsten Lorenz.
--------------------------------- (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-2023 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
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
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:BSD-3-Clause
== Copyright
Copyright 2010-2016 Mike Bostock
Copyright 2019 Mike Bostock
--------------------------------- (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:BSD-3-Clause
== Copyright
Copyright 2010-2016 Mike Bostock
Copyright 2019 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-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
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_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
deepmerge
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 James Halliday, Josh Duff, and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
define-data-property
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Jordan Harband
--------------------------------- (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
des.js
== License Type
SPDX:MIT
== Copyright
Copyright Fedor Indutny, 2015.
--------------------------------- (separator) ----------------------------------
== Dependency
detect-libc
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2017, 2022 Lovell Fuller
--------------------------------- (separator) ----------------------------------
== Dependency
detect-node-es
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Ilya Kantor
--------------------------------- (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
dom-serializer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 The cheeriojs contributors
--------------------------------- (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
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
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
ejs
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2112 Matthew Eernisse (mde@fleegix.org)
--------------------------------- (separator) ----------------------------------
== Dependency
elastic-apm-http-client
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2019 Elasticsearch BV
Copyright (c) 2018 Stephen Belanger
--------------------------------- (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-2017, Forrest L Norvell
Copyright (c) 2013-2019, Forrest L Norvell
Copyright (c) 2015-2022, Elasticsearch B.V.
Copyright (c) 2016 Thomas Watson Steen
Copyright (c) 2016-2018 Thomas Watson Steen
Copyright (c) 2016-2019 Thomas Watson Steen
Copyright (c) 2017 Espen Hovlandsdal
Copyright (c) 2018 Mathias Buus
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.
async-listener
- **path:** [lib/instrumentation/patch-async.js](lib/instrumentation/patch-async.js)
- **author:** Forrest L Norvell
- **project url:** https://github.com/othiym23/async-listener
- **original file:** https://github.com/othiym23/async-listener/blob/master/index.js
- **license:** BSD-2-Clause, http://opensource.org/licenses/BSD-2-ClauseCopyright (c) 2013-2017, Forrest L Norvell 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 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 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 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
## 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-ClauseCopyright (c) 2013-2019, Forrest L Norvell 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 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 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 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
## 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/MITCopyright (c) 2018 Mathias Buus
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
## 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
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
Definitions.
“License” shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
“Licensor” shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
“Legal Entity” shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, “control” means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
“You” (or “Your”) shall mean an individual or Legal Entity exercising permissions granted by this License.
“Source” form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
“Object” form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
“Work” shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
“Derivative Works” shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
“Contribution” shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, “submitted” means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as “Not a Contribution.”
“Contributor” shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
-
Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
-
Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
-
Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
(a) You must give any other recipients of the Work or Derivative Works a copy of this License; and
(b) You must cause any modified files to carry prominent notices stating that You changed the files; and
(c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
(d) If the Work includes a “NOTICE” text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
-
Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
-
Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
-
Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an “AS IS” BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
-
Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
-
Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following
boilerplate notice, with the fields enclosed by brackets "[]"
replaced with your own identifying information. (Don't include
the brackets!) The text should be enclosed in the appropriate
comment syntax for the file format. We also recommend that a
file or class name and description of purpose be included on the
same "printed page" as the copyright notice for easier
identification within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the “License”); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an “AS IS” BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
## 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/MITThe MIT License (MIT)
Copyright (c) 2017 Espen Hovlandsdal
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
## 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/MITMIT License
Copyright (c) 2020 Evan Wallace
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
## @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/MITThis project is licensed under the MIT license. Copyrights are respective of each contributor listed at the beginning of each definition file.
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
## require-in-the-middle
- **path:** [lib/ritm.js](lib/ritm.js)
- **author:** Thomas Watson Steen
- **project url:** https://github.com/elastic/require-in-the-middle
- **original file:** https://github.com/elastic/require-in-the-middle/blob/v5.2.0/index.js
- **license:** MIT License (MIT), http://opensource.org/licenses/MITThe MIT License (MIT)
Copyright (c) 2016-2019 Thomas Watson Steen
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
--------------------------------- (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
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-2013 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-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-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
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
escalade
== License Type
SPDX:MIT
== Copyright
Copyright (c) Luke Edwards <luke.edwards05@gmail.com> (lukeed.com)
--------------------------------- (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
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
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
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
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
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
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
expiry-js
== License Type
SPDX:MIT
== Copyright
Adriano Di Giovanni <me@adrianodigiovanni.com> (http://adrianodigiovanni.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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-stable-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013 James Halliday
Copyright (c) 2017 Evgeny Poberezkin
--------------------------------- (separator) ----------------------------------
== Dependency
fast-json-stringify
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2018 Matteo Collina
--------------------------------- (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
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
fd-slicer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Andrew Kelley
--------------------------------- (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-selector
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Roland Groza
Copyright (c) Microsoft Corporation.
--------------------------------- (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
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
filter-obj
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.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
flatstr
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 David Mark Clements
--------------------------------- (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
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".
This Font Software is licensed under the SIL Open Font License, Version 1.1.
This license is copied below, and is also available with a FAQ at:
http://scripts.sil.org/OFL
SIL OPEN FONT LICENSE
Version 1.1 - 26 February 2007
PREAMBLE
The goals of the Open Font License (OFL) are to stimulate worldwide
development of collaborative font projects, to support the font creation
efforts of academic and linguistic communities, and to provide a free and
open framework in which fonts may be shared and improved in partnership
with others.
The OFL allows the licensed fonts to be used, studied, modified and
redistributed freely as long as they are not sold by themselves. The
fonts, including any derivative works, can be bundled, embedded,
redistributed and/or sold with any software provided that any reserved
names are not used by derivative works. The fonts and derivatives,
however, cannot be released under any other type of license. The
requirement for fonts to remain under this license does not apply
to any document created using the fonts or their derivatives.
DEFINITIONS
"Font Software" refers to the set of files released by the Copyright
Holder(s) under this license and clearly marked as such. This may
include source files, build scripts and documentation.
"Reserved Font Name" refers to any names specified as such after the
copyright statement(s).
"Original Version" refers to the collection of Font Software components as
distributed by the Copyright Holder(s).
"Modified Version" refers to any derivative made by adding to, deleting,
or substituting — in part or in whole — any of the components of the
Original Version, by changing formats or by porting the Font Software to a
new environment.
"Author" refers to any designer, engineer, programmer, technical
writer or other person who contributed to the Font Software.
PERMISSION & CONDITIONS
Permission is hereby granted, free of charge, to any person obtaining
a copy of the Font Software, to use, study, copy, merge, embed, modify,
redistribute, and sell modified and unmodified copies of the Font
Software, subject to the following conditions:
1) Neither the Font Software nor any of its individual components,
in Original or Modified Versions, may be sold by itself.
2) Original or Modified Versions of the Font Software may be bundled,
redistributed and/or sold with any software, provided that each copy
contains the above copyright notice and this license. These can be
included either as stand-alone text files, human-readable headers or
in the appropriate machine-readable metadata fields within text or
binary files as long as those fields can be easily viewed by the user.
3) No Modified Version of the Font Software may use the Reserved Font
Name(s) unless explicit written permission is granted by the corresponding
Copyright Holder. This restriction only applies to the primary font name as
presented to the users.
4) The name(s) of the Copyright Holder(s) or the Author(s) of the Font
Software shall not be used to promote, endorse or advertise any
Modified Version, except to acknowledge the contribution(s) of the
Copyright Holder(s) and the Author(s) or with their explicit written
permission.
5) The Font Software, modified or unmodified, in part or in whole,
must be distributed entirely under this license, and must not be
distributed under any other license. The requirement for fonts to
remain under this license does not apply to any document created
using the Font Software.
TERMINATION
This license becomes null and void if any of the above conditions are
not met.
DISCLAIMER
THE FONT SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT
OF COPYRIGHT, PATENT, TRADEMARK, OR OTHER RIGHT. IN NO EVENT SHALL THE
COPYRIGHT HOLDER BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
INCLUDING ANY GENERAL, SPECIAL, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL
DAMAGES, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF THE USE OR INABILITY TO USE THE FONT SOFTWARE OR FROM
OTHER DEALINGS IN THE FONT SOFTWARE.
--------------------------------------------------------------------------------
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.
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use, copy,
modify, merge, publish, distribute, sublicense, and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so, subject to the
following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
--------------------------------------------------------------------------------
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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
fp-ts
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017-present Giulio Canti
--------------------------------- (separator) ----------------------------------
== Dependency
fraction.js
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2023 Robert Eisele
Copyright (c) 2023, Robert Eisele (robert@raw.org)
Copyright (c) 2023, [Robert Eisele](https://raw.org/)
--------------------------------- (separator) ----------------------------------
== Dependency
fragment-cache
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2017, Jon Schlinkert
Copyright (c) 2016-2017, Jon Schlinkert.
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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
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-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-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
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
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2017, Jon Schlinkert
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
has-values
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, 2017, Jon Schlinkert.
Copyright (c) 2014-2017, Jon Schlinkert
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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-to-html
== 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
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.
Copyright 2015, Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
hpagent
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Tomas Della Vedova
--------------------------------- (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
Copyright 2010, 2011, Chris Winberry <chris@winberry.net>. All rights reserved.
--------------------------------- (separator) ----------------------------------
== Dependency
http-aws-es
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017 Geoff Wagstaff
--------------------------------- (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
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
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
is-absolute
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2009-2014, TJ Holowaychuk
Copyright (c) 2014-2017, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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-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-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-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.
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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.
Copyright © 2019, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-native
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 W.Y.
--------------------------------- (separator) ----------------------------------
== Dependency
is-negated-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Jon Schlinkert
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
is-negative-zero
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
is-nil
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 W.Y.
--------------------------------- (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
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
is-primitive
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-unc-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
is-weakref
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2020 Inspect JS
--------------------------------- (separator) ----------------------------------
== Dependency
is-whitespace-character
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
is-windows
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2018, Jon Schlinkert.
Copyright © 2015-2018, Jon Schlinkert.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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
jmespath
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2014 James Saryerwinnie
--------------------------------- (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
Copyright 2006, 2015 Klaus Hartl & Fagner Brack
--------------------------------- (separator) ----------------------------------
== Dependency
js-tokens
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014, 2015, 2016, 2017, 2018 Simon Lydell
Copyright 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
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (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
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.
Copyright © 2020, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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.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.isequal
== License Type
SPDX:MIT
== Copyright
Copyright jQuery Foundation and other contributors <https://jquery.org/>
--------------------------------- (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
== License Type
SPDX:MIT
== Copyright
Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
--------------------------------- (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
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
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.
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
map-visit
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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) 2023, Robert Eisele (robert@raw.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-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
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
memoize-one
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2019 Alexander Reardon
--------------------------------- (separator) ----------------------------------
== Dependency
memory-fs
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012-2014 Tobias Koppers
--------------------------------- (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
micromatch
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
Copyright © 2024, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
mimic-fn
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.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) 2017-2022 npm, Inc., Isaac Z. Schlueter, 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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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) 2008 Microsoft Corporation @minifier_do_not_preserve
Copyright (C) David Owens II, owensd.io. All rights reserved.
Copyright (c) 2007-2018 Einar Lielmanis, Liam Newman, and contributors.
Copyright (c) 2011-2014, Christopher Jeffrey. (MIT Licensed)
Copyright (c) 2014 Forbes Lindesay
Copyright (c) 2014 Taylor Hakes
Copyright (c) 2016 - present Microsoft Corporation
Copyright (c) Artyom Shalkhakov. All rights reserved.
Copyright (c) Microsoft Corporation. All rights reserved.
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\n/// <reference no-default-lib=\"true\"/>\n\n" + exports.lib_es2015_symbol_dts + "\ninterface SymbolConstructor {\n /**\n * A method that determines if a constructor object recognizes an object as one of the\n * constructor’s instances. Called by the semantics of the instanceof operator.\n */\n readonly hasInstance: symbol;\n\n /**\n * A Boolean value that if true indicates that an object should flatten to its array elements\n * by Array.prototype.concat.\n */\n readonly isConcatSpreadable: symbol;\n\n /**\n * A regular expression method that matches the regular expression against a string. Called\n * by the String.prototype.match method.\n */\n readonly match: symbol;\n\n /**\n * A regular expression method that replaces matched substrings of a string. Called by the\n * String.prototype.replace method.\n */\n readonly replace: symbol;\n\n /**\n * A regular expression method that returns the index within a string that matches the\n * regular expression. Called by the String.prototype.search method.\n */\n readonly search: symbol;\n\n /**\n * A function valued property that is the constructor function that is used to create\n * derived objects.\n */\n readonly species: symbol;\n\n /**\n * A regular expression method that splits a string at the indices that match the regular\n * expression. Called by the String.prototype.split method.\n */\n readonly split: symbol;\n\n /**\n * A method that converts an object to a corresponding primitive value.\n * Called by the ToPrimitive abstract operation.\n */\n readonly toPrimitive: symbol;\n\n /**\n * A String value that is used in the creation of the default string description of an object.\n * Called by the built-in method Object.prototype.toString.\n */\n readonly toStringTag: symbol;\n\n /**\n * An Object whose own property names are property names that are excluded from the 'with'\n * environment bindings of the associated objects.\n */\n readonly unscopables: symbol;\n}\n\ninterface Symbol {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Array<T> {\n /**\n * Returns an object whose properties have the value 'true'\n * when they will be absent when used in a 'with' statement.\n */\n [Symbol.unscopables](): {\n copyWithin: boolean;\n entries: boolean;\n fill: boolean;\n find: boolean;\n findIndex: boolean;\n keys: boolean;\n values: boolean;\n };\n}\n\ninterface Date {\n /**\n * Converts a Date object to a string.\n */\n [Symbol.toPrimitive](hint: \"default\"): string;\n /**\n * Converts a Date object to a string.\n */\n [Symbol.toPrimitive](hint: \"string\"): string;\n /**\n * Converts a Date object to a number.\n */\n [Symbol.toPrimitive](hint: \"number\"): number;\n /**\n * Converts a Date object to a string or number.\n *\n * @param hint The strings \"number\", \"string\", or \"default\" to specify what primitive to return.\n *\n * @throws {TypeError} If 'hint' was given something other than \"number\", \"string\", or \"default\".\n * @returns A number if 'hint' was \"number\", a string if 'hint' was \"string\" or \"default\".\n */\n [Symbol.toPrimitive](hint: string): string | number;\n}\n\ninterface Map<K, V> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface WeakMap<K extends object, V> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Set<T> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface WeakSet<T extends object> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface JSON {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Function {\n /**\n * Determines whether the given value inherits from this function if this function was used\n * as a constructor function.\n *\n * A constructor function can control which objects are recognized as its instances by\n * 'instanceof' by overriding this method.\n */\n [Symbol.hasInstance](value: any): boolean;\n}\n\ninterface GeneratorFunction {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Math {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Promise<T> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface PromiseConstructor {\n readonly [Symbol.species]: PromiseConstructor;\n}\n\ninterface RegExp {\n /**\n * Matches a string with this regular expression, and returns an array containing the results of\n * that search.\n * @param string A string to search within.\n */\n [Symbol.match](string: string): RegExpMatchArray | null;\n\n /**\n * Replaces text in a string, using this regular expression.\n * @param string A String object or string literal whose contents matching against\n * this regular expression will be replaced\n * @param replaceValue A String object or string literal containing the text to replace for every\n * successful match of this regular expression.\n */\n [Symbol.replace](string: string, replaceValue: string): string;\n\n /**\n * Replaces text in a string, using this regular expression.\n * @param string A String object or string literal whose contents matching against\n * this regular expression will be replaced\n * @param replacer A function that returns the replacement text.\n */\n [Symbol.replace](string: string, replacer: (substring: string, ...args: any[]) => string): string;\n\n /**\n * Finds the position beginning first substring match in a regular expression search\n * using this regular expression.\n *\n * @param string The string to search within.\n */\n [Symbol.search](string: string): number;\n\n /**\n * Returns an array of substrings that were delimited by strings in the original input that\n * match against this regular expression.\n *\n * If the regular expression contains capturing parentheses, then each time this\n * regular expression matches, the results (including any undefined results) of the\n * capturing parentheses are spliced.\n *\n * @param string string value to split\n * @param limit if not undefined, the output array is truncated so that it contains no more\n * than 'limit' elements.\n */\n [Symbol.split](string: string, limit?: number): string[];\n}\n\ninterface RegExpConstructor {\n readonly [Symbol.species]: RegExpConstructor;\n}\n\ninterface String {\n /**\n * Matches a string an object that supports being matched against, and returns an array containing the results of that search.\n * @param matcher An object that supports being matched against.\n */\n match(matcher: { [Symbol.match](string: string): RegExpMatchArray | null; }): RegExpMatchArray | null;\n\n /**\n * Replaces text in a string, using an object that supports replacement within a string.\n * @param searchValue A object can search for and replace matches within a string.\n * @param replaceValue A string containing the text to replace for every successful match of searchValue in this string.\n */\n replace(searchValue: { [Symbol.replace](string: string, replaceValue: string): string; }, replaceValue: string): string;\n\n /**\n * Replaces text in a string, using an object that supports replacement within a string.\n * @param searchValue A object can search for and replace matches within a string.\n * @param replacer A function that returns the replacement text.\n */\n replace(searchValue: { [Symbol.replace](string: string, replacer: (substring: string, ...args: any[]) => string): string; }, replacer: (substring: string, ...args: any[]) => string): string;\n\n /**\n * Finds the first substring match in a regular expression search.\n * @param searcher An object which supports searching within a string.\n */\n search(searcher: { [Symbol.search](string: string): number; }): number;\n\n /**\n * Split a string into substrings using the specified separator and return them as an array.\n * @param splitter An object that can split a string.\n * @param limit A value used to limit the number of elements returned in the array.\n */\n split(splitter: { [Symbol.split](string: string, limit?: number): string[]; }, limit?: number): string[];\n}\n\ninterface ArrayBuffer {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface DataView {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Int8Array {\n readonly [Symbol.toStringTag]: \"Int8Array\";\n}\n\ninterface Uint8Array {\n readonly [Symbol.toStringTag]: \"UInt8Array\";\n}\n\ninterface Uint8ClampedArray {\n readonly [Symbol.toStringTag]: \"Uint8ClampedArray\";\n}\n\ninterface Int16Array {\n readonly [Symbol.toStringTag]: \"Int16Array\";\n}\n\ninterface Uint16Array {\n readonly [Symbol.toStringTag]: \"Uint16Array\";\n}\n\ninterface Int32Array {\n readonly [Symbol.toStringTag]: \"Int32Array\";\n}\n\ninterface Uint32Array {\n readonly [Symbol.toStringTag]: \"Uint32Array\";\n}\n\ninterface Float32Array {\n readonly [Symbol.toStringTag]: \"Float32Array\";\n}\n\ninterface Float64Array {\n readonly [Symbol.toStringTag]: \"Float64Array\";\n}\n\ninterface ArrayConstructor {\n readonly [Symbol.species]: ArrayConstructor;\n}\ninterface MapConstructor {\n readonly [Symbol.species]: MapConstructor;\n}\ninterface SetConstructor {\n readonly [Symbol.species]: SetConstructor;\n}\ninterface ArrayBufferConstructor {\n readonly [Symbol.species]: ArrayBufferConstructor;\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\n/// <reference no-default-lib=\"true\"/>\n\n" + exports.lib_es2015_symbol_dts + "\ninterface SymbolConstructor {\n /**\n * A method that returns the default iterator for an object. Called by the semantics of the\n * for-of statement.\n */\n readonly iterator: symbol;\n}\n\ninterface IteratorResult<T> {\n done: boolean;\n value: T;\n}\n\ninterface Iterator<T> {\n next(value?: any): IteratorResult<T>;\n return?(value?: any): IteratorResult<T>;\n throw?(e?: any): IteratorResult<T>;\n}\n\ninterface Iterable<T> {\n [Symbol.iterator](): Iterator<T>;\n}\n\ninterface IterableIterator<T> extends Iterator<T> {\n [Symbol.iterator](): IterableIterator<T>;\n}\n\ninterface Array<T> {\n /** Iterator */\n [Symbol.iterator](): IterableIterator<T>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, T]>;\n\n /**\n * Returns an iterable of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an iterable of values in the array\n */\n values(): IterableIterator<T>;\n}\n\ninterface ArrayConstructor {\n /**\n * Creates an array from an iterable object.\n * @param iterable An iterable object to convert to an array.\n */\n from<T>(iterable: Iterable<T> | ArrayLike<T>): T[];\n\n /**\n * Creates an array from an iterable object.\n * @param iterable An 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<T, U>(iterable: Iterable<T> | ArrayLike<T>, mapfn: (v: T, k: number) => U, thisArg?: any): U[];\n}\n\ninterface ReadonlyArray<T> {\n /** Iterator of values in the array. */\n [Symbol.iterator](): IterableIterator<T>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, T]>;\n\n /**\n * Returns an iterable of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an iterable of values in the array\n */\n values(): IterableIterator<T>;\n}\n\ninterface IArguments {\n /** Iterator */\n [Symbol.iterator](): IterableIterator<any>;\n}\n\ninterface Map<K, V> {\n /** Returns an iterable of entries in the map. */\n [Symbol.iterator](): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the map.\n */\n entries(): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of keys in the map\n */\n keys(): IterableIterator<K>;\n\n /**\n * Returns an iterable of values in the map\n */\n values(): IterableIterator<V>;\n}\n\ninterface ReadonlyMap<K, V> {\n /** Returns an iterable of entries in the map. */\n [Symbol.iterator](): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the map.\n */\n entries(): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of keys in the map\n */\n keys(): IterableIterator<K>;\n\n /**\n * Returns an iterable of values in the map\n */\n values(): IterableIterator<V>;\n}\n\ninterface MapConstructor {\n new <K, V>(iterable: Iterable<readonly [K, V]>): Map<K, V>;\n}\n\ninterface WeakMap<K extends object, V> { }\n\ninterface WeakMapConstructor {\n new <K extends object, V>(iterable: Iterable<[K, V]>): WeakMap<K, V>;\n}\n\ninterface Set<T> {\n /** Iterates over values in the set. */\n [Symbol.iterator](): IterableIterator<T>;\n /**\n * Returns an iterable of [v,v] pairs for every value `v` in the set.\n */\n entries(): IterableIterator<[T, T]>;\n /**\n * Despite its name, returns an iterable of the values in the set,\n */\n keys(): IterableIterator<T>;\n\n /**\n * Returns an iterable of values in the set.\n */\n values(): IterableIterator<T>;\n}\n\ninterface ReadonlySet<T> {\n /** Iterates over values in the set. */\n [Symbol.iterator](): IterableIterator<T>;\n\n /**\n * Returns an iterable of [v,v] pairs for every value `v` in the set.\n */\n entries(): IterableIterator<[T, T]>;\n\n /**\n * Despite its name, returns an iterable of the values in the set,\n */\n keys(): IterableIterator<T>;\n\n /**\n * Returns an iterable of values in the set.\n */\n values(): IterableIterator<T>;\n}\n\ninterface SetConstructor {\n new <T>(iterable?: Iterable<T> | null): Set<T>;\n}\n\ninterface WeakSet<T extends object> { }\n\ninterface WeakSetConstructor {\n new <T extends object = object>(iterable: Iterable<T>): WeakSet<T>;\n}\n\ninterface Promise<T> { }\n\ninterface PromiseConstructor {\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<TAll>(values: Iterable<TAll | PromiseLike<TAll>>): Promise<TAll[]>;\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>(values: Iterable<T | PromiseLike<T>>): Promise<T>;\n}\n\ndeclare namespace Reflect {\n function enumerate(target: object): IterableIterator<any>;\n}\n\ninterface String {\n /** Iterator */\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface Int8Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Int8ArrayConstructor {\n new (elements: Iterable<number>): Int8Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Int8Array;\n}\n\ninterface Uint8Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint8ArrayConstructor {\n new (elements: Iterable<number>): Uint8Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint8Array;\n}\n\ninterface Uint8ClampedArray {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint8ClampedArrayConstructor {\n new (elements: Iterable<number>): Uint8ClampedArray;\n\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint8ClampedArray;\n}\n\ninterface Int16Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Int16ArrayConstructor {\n new (elements: Iterable<number>): Int16Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Int16Array;\n}\n\ninterface Uint16Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint16ArrayConstructor {\n new (elements: Iterable<number>): Uint16Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint16Array;\n}\n\ninterface Int32Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Int32ArrayConstructor {\n new (elements: Iterable<number>): Int32Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Int32Array;\n}\n\ninterface Uint32Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint32ArrayConstructor {\n new (elements: Iterable<number>): Uint32Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint32Array;\n}\n\ninterface Float32Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Float32ArrayConstructor {\n new (elements: Iterable<number>): Float32Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Float32Array;\n}\n\ninterface Float64Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Float64ArrayConstructor {\n new (elements: Iterable<number>): Float64Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): 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\n/// <reference no-default-lib=\"true\"/>\n\n" + lib_es2015_symbol_dts + "\ninterface SymbolConstructor {\n /**\n * A method that determines if a constructor object recognizes an object as one of the\n * constructor’s instances. Called by the semantics of the instanceof operator.\n */\n readonly hasInstance: symbol;\n\n /**\n * A Boolean value that if true indicates that an object should flatten to its array elements\n * by Array.prototype.concat.\n */\n readonly isConcatSpreadable: symbol;\n\n /**\n * A regular expression method that matches the regular expression against a string. Called\n * by the String.prototype.match method.\n */\n readonly match: symbol;\n\n /**\n * A regular expression method that replaces matched substrings of a string. Called by the\n * String.prototype.replace method.\n */\n readonly replace: symbol;\n\n /**\n * A regular expression method that returns the index within a string that matches the\n * regular expression. Called by the String.prototype.search method.\n */\n readonly search: symbol;\n\n /**\n * A function valued property that is the constructor function that is used to create\n * derived objects.\n */\n readonly species: symbol;\n\n /**\n * A regular expression method that splits a string at the indices that match the regular\n * expression. Called by the String.prototype.split method.\n */\n readonly split: symbol;\n\n /**\n * A method that converts an object to a corresponding primitive value.\n * Called by the ToPrimitive abstract operation.\n */\n readonly toPrimitive: symbol;\n\n /**\n * A String value that is used in the creation of the default string description of an object.\n * Called by the built-in method Object.prototype.toString.\n */\n readonly toStringTag: symbol;\n\n /**\n * An Object whose own property names are property names that are excluded from the 'with'\n * environment bindings of the associated objects.\n */\n readonly unscopables: symbol;\n}\n\ninterface Symbol {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Array<T> {\n /**\n * Returns an object whose properties have the value 'true'\n * when they will be absent when used in a 'with' statement.\n */\n [Symbol.unscopables](): {\n copyWithin: boolean;\n entries: boolean;\n fill: boolean;\n find: boolean;\n findIndex: boolean;\n keys: boolean;\n values: boolean;\n };\n}\n\ninterface Date {\n /**\n * Converts a Date object to a string.\n */\n [Symbol.toPrimitive](hint: \"default\"): string;\n /**\n * Converts a Date object to a string.\n */\n [Symbol.toPrimitive](hint: \"string\"): string;\n /**\n * Converts a Date object to a number.\n */\n [Symbol.toPrimitive](hint: \"number\"): number;\n /**\n * Converts a Date object to a string or number.\n *\n * @param hint The strings \"number\", \"string\", or \"default\" to specify what primitive to return.\n *\n * @throws {TypeError} If 'hint' was given something other than \"number\", \"string\", or \"default\".\n * @returns A number if 'hint' was \"number\", a string if 'hint' was \"string\" or \"default\".\n */\n [Symbol.toPrimitive](hint: string): string | number;\n}\n\ninterface Map<K, V> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface WeakMap<K extends object, V> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Set<T> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface WeakSet<T extends object> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface JSON {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Function {\n /**\n * Determines whether the given value inherits from this function if this function was used\n * as a constructor function.\n *\n * A constructor function can control which objects are recognized as its instances by\n * 'instanceof' by overriding this method.\n */\n [Symbol.hasInstance](value: any): boolean;\n}\n\ninterface GeneratorFunction {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Math {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Promise<T> {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface PromiseConstructor {\n readonly [Symbol.species]: PromiseConstructor;\n}\n\ninterface RegExp {\n /**\n * Matches a string with this regular expression, and returns an array containing the results of\n * that search.\n * @param string A string to search within.\n */\n [Symbol.match](string: string): RegExpMatchArray | null;\n\n /**\n * Replaces text in a string, using this regular expression.\n * @param string A String object or string literal whose contents matching against\n * this regular expression will be replaced\n * @param replaceValue A String object or string literal containing the text to replace for every\n * successful match of this regular expression.\n */\n [Symbol.replace](string: string, replaceValue: string): string;\n\n /**\n * Replaces text in a string, using this regular expression.\n * @param string A String object or string literal whose contents matching against\n * this regular expression will be replaced\n * @param replacer A function that returns the replacement text.\n */\n [Symbol.replace](string: string, replacer: (substring: string, ...args: any[]) => string): string;\n\n /**\n * Finds the position beginning first substring match in a regular expression search\n * using this regular expression.\n *\n * @param string The string to search within.\n */\n [Symbol.search](string: string): number;\n\n /**\n * Returns an array of substrings that were delimited by strings in the original input that\n * match against this regular expression.\n *\n * If the regular expression contains capturing parentheses, then each time this\n * regular expression matches, the results (including any undefined results) of the\n * capturing parentheses are spliced.\n *\n * @param string string value to split\n * @param limit if not undefined, the output array is truncated so that it contains no more\n * than 'limit' elements.\n */\n [Symbol.split](string: string, limit?: number): string[];\n}\n\ninterface RegExpConstructor {\n readonly [Symbol.species]: RegExpConstructor;\n}\n\ninterface String {\n /**\n * Matches a string an object that supports being matched against, and returns an array containing the results of that search.\n * @param matcher An object that supports being matched against.\n */\n match(matcher: { [Symbol.match](string: string): RegExpMatchArray | null; }): RegExpMatchArray | null;\n\n /**\n * Replaces text in a string, using an object that supports replacement within a string.\n * @param searchValue A object can search for and replace matches within a string.\n * @param replaceValue A string containing the text to replace for every successful match of searchValue in this string.\n */\n replace(searchValue: { [Symbol.replace](string: string, replaceValue: string): string; }, replaceValue: string): string;\n\n /**\n * Replaces text in a string, using an object that supports replacement within a string.\n * @param searchValue A object can search for and replace matches within a string.\n * @param replacer A function that returns the replacement text.\n */\n replace(searchValue: { [Symbol.replace](string: string, replacer: (substring: string, ...args: any[]) => string): string; }, replacer: (substring: string, ...args: any[]) => string): string;\n\n /**\n * Finds the first substring match in a regular expression search.\n * @param searcher An object which supports searching within a string.\n */\n search(searcher: { [Symbol.search](string: string): number; }): number;\n\n /**\n * Split a string into substrings using the specified separator and return them as an array.\n * @param splitter An object that can split a string.\n * @param limit A value used to limit the number of elements returned in the array.\n */\n split(splitter: { [Symbol.split](string: string, limit?: number): string[]; }, limit?: number): string[];\n}\n\ninterface ArrayBuffer {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface DataView {\n readonly [Symbol.toStringTag]: string;\n}\n\ninterface Int8Array {\n readonly [Symbol.toStringTag]: \"Int8Array\";\n}\n\ninterface Uint8Array {\n readonly [Symbol.toStringTag]: \"UInt8Array\";\n}\n\ninterface Uint8ClampedArray {\n readonly [Symbol.toStringTag]: \"Uint8ClampedArray\";\n}\n\ninterface Int16Array {\n readonly [Symbol.toStringTag]: \"Int16Array\";\n}\n\ninterface Uint16Array {\n readonly [Symbol.toStringTag]: \"Uint16Array\";\n}\n\ninterface Int32Array {\n readonly [Symbol.toStringTag]: \"Int32Array\";\n}\n\ninterface Uint32Array {\n readonly [Symbol.toStringTag]: \"Uint32Array\";\n}\n\ninterface Float32Array {\n readonly [Symbol.toStringTag]: \"Float32Array\";\n}\n\ninterface Float64Array {\n readonly [Symbol.toStringTag]: \"Float64Array\";\n}\n\ninterface ArrayConstructor {\n readonly [Symbol.species]: ArrayConstructor;\n}\ninterface MapConstructor {\n readonly [Symbol.species]: MapConstructor;\n}\ninterface SetConstructor {\n readonly [Symbol.species]: SetConstructor;\n}\ninterface ArrayBufferConstructor {\n readonly [Symbol.species]: ArrayBufferConstructor;\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\n/// <reference no-default-lib=\"true\"/>\n\n" + lib_es2015_symbol_dts + "\ninterface SymbolConstructor {\n /**\n * A method that returns the default iterator for an object. Called by the semantics of the\n * for-of statement.\n */\n readonly iterator: symbol;\n}\n\ninterface IteratorResult<T> {\n done: boolean;\n value: T;\n}\n\ninterface Iterator<T> {\n next(value?: any): IteratorResult<T>;\n return?(value?: any): IteratorResult<T>;\n throw?(e?: any): IteratorResult<T>;\n}\n\ninterface Iterable<T> {\n [Symbol.iterator](): Iterator<T>;\n}\n\ninterface IterableIterator<T> extends Iterator<T> {\n [Symbol.iterator](): IterableIterator<T>;\n}\n\ninterface Array<T> {\n /** Iterator */\n [Symbol.iterator](): IterableIterator<T>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, T]>;\n\n /**\n * Returns an iterable of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an iterable of values in the array\n */\n values(): IterableIterator<T>;\n}\n\ninterface ArrayConstructor {\n /**\n * Creates an array from an iterable object.\n * @param iterable An iterable object to convert to an array.\n */\n from<T>(iterable: Iterable<T> | ArrayLike<T>): T[];\n\n /**\n * Creates an array from an iterable object.\n * @param iterable An 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<T, U>(iterable: Iterable<T> | ArrayLike<T>, mapfn: (v: T, k: number) => U, thisArg?: any): U[];\n}\n\ninterface ReadonlyArray<T> {\n /** Iterator of values in the array. */\n [Symbol.iterator](): IterableIterator<T>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, T]>;\n\n /**\n * Returns an iterable of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an iterable of values in the array\n */\n values(): IterableIterator<T>;\n}\n\ninterface IArguments {\n /** Iterator */\n [Symbol.iterator](): IterableIterator<any>;\n}\n\ninterface Map<K, V> {\n /** Returns an iterable of entries in the map. */\n [Symbol.iterator](): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the map.\n */\n entries(): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of keys in the map\n */\n keys(): IterableIterator<K>;\n\n /**\n * Returns an iterable of values in the map\n */\n values(): IterableIterator<V>;\n}\n\ninterface ReadonlyMap<K, V> {\n /** Returns an iterable of entries in the map. */\n [Symbol.iterator](): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of key, value pairs for every entry in the map.\n */\n entries(): IterableIterator<[K, V]>;\n\n /**\n * Returns an iterable of keys in the map\n */\n keys(): IterableIterator<K>;\n\n /**\n * Returns an iterable of values in the map\n */\n values(): IterableIterator<V>;\n}\n\ninterface MapConstructor {\n new <K, V>(iterable: Iterable<readonly [K, V]>): Map<K, V>;\n}\n\ninterface WeakMap<K extends object, V> { }\n\ninterface WeakMapConstructor {\n new <K extends object, V>(iterable: Iterable<[K, V]>): WeakMap<K, V>;\n}\n\ninterface Set<T> {\n /** Iterates over values in the set. */\n [Symbol.iterator](): IterableIterator<T>;\n /**\n * Returns an iterable of [v,v] pairs for every value `v` in the set.\n */\n entries(): IterableIterator<[T, T]>;\n /**\n * Despite its name, returns an iterable of the values in the set,\n */\n keys(): IterableIterator<T>;\n\n /**\n * Returns an iterable of values in the set.\n */\n values(): IterableIterator<T>;\n}\n\ninterface ReadonlySet<T> {\n /** Iterates over values in the set. */\n [Symbol.iterator](): IterableIterator<T>;\n\n /**\n * Returns an iterable of [v,v] pairs for every value `v` in the set.\n */\n entries(): IterableIterator<[T, T]>;\n\n /**\n * Despite its name, returns an iterable of the values in the set,\n */\n keys(): IterableIterator<T>;\n\n /**\n * Returns an iterable of values in the set.\n */\n values(): IterableIterator<T>;\n}\n\ninterface SetConstructor {\n new <T>(iterable?: Iterable<T> | null): Set<T>;\n}\n\ninterface WeakSet<T extends object> { }\n\ninterface WeakSetConstructor {\n new <T extends object = object>(iterable: Iterable<T>): WeakSet<T>;\n}\n\ninterface Promise<T> { }\n\ninterface PromiseConstructor {\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<TAll>(values: Iterable<TAll | PromiseLike<TAll>>): Promise<TAll[]>;\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>(values: Iterable<T | PromiseLike<T>>): Promise<T>;\n}\n\ndeclare namespace Reflect {\n function enumerate(target: object): IterableIterator<any>;\n}\n\ninterface String {\n /** Iterator */\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface Int8Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Int8ArrayConstructor {\n new (elements: Iterable<number>): Int8Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Int8Array;\n}\n\ninterface Uint8Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint8ArrayConstructor {\n new (elements: Iterable<number>): Uint8Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint8Array;\n}\n\ninterface Uint8ClampedArray {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint8ClampedArrayConstructor {\n new (elements: Iterable<number>): Uint8ClampedArray;\n\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint8ClampedArray;\n}\n\ninterface Int16Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Int16ArrayConstructor {\n new (elements: Iterable<number>): Int16Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Int16Array;\n}\n\ninterface Uint16Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint16ArrayConstructor {\n new (elements: Iterable<number>): Uint16Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint16Array;\n}\n\ninterface Int32Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Int32ArrayConstructor {\n new (elements: Iterable<number>): Int32Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Int32Array;\n}\n\ninterface Uint32Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Uint32ArrayConstructor {\n new (elements: Iterable<number>): Uint32Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Uint32Array;\n}\n\ninterface Float32Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Float32ArrayConstructor {\n new (elements: Iterable<number>): Float32Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): Float32Array;\n}\n\ninterface Float64Array {\n [Symbol.iterator](): IterableIterator<number>;\n /**\n * Returns an array of key, value pairs for every entry in the array\n */\n entries(): IterableIterator<[number, number]>;\n /**\n * Returns an list of keys in the array\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the array\n */\n values(): IterableIterator<number>;\n}\n\ninterface Float64ArrayConstructor {\n new (elements: Iterable<number>): Float64Array;\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: Iterable<number>, mapfn?: (v: number, k: number) => number, thisArg?: any): 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\n/// <reference no-default-lib=\"true\"/>\n\n\n/////////////////////////////\n/// DOM Iterable APIs\n/////////////////////////////\n\ninterface AudioParamMap extends ReadonlyMap<string, AudioParam> {\n}\n\ninterface AudioTrackList {\n [Symbol.iterator](): IterableIterator<AudioTrack>;\n}\n\ninterface CSSRuleList {\n [Symbol.iterator](): IterableIterator<CSSRule>;\n}\n\ninterface CSSStyleDeclaration {\n [Symbol.iterator](): IterableIterator<string>;\n}\n\ninterface ClientRectList {\n [Symbol.iterator](): IterableIterator<ClientRect>;\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 FileList {\n [Symbol.iterator](): IterableIterator<File>;\n}\n\ninterface FormData {\n [Symbol.iterator](): IterableIterator<[string, FormDataEntryValue]>;\n /**\n * Returns an array of key, value pairs for every entry in the list.\n */\n entries(): IterableIterator<[string, FormDataEntryValue]>;\n /**\n * Returns a list of keys in the list.\n */\n keys(): IterableIterator<string>;\n /**\n * Returns a list of values in the list.\n */\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<Element>;\n}\n\ninterface Headers {\n [Symbol.iterator](): IterableIterator<[string, string]>;\n /**\n * Returns an iterator allowing to go through all key/value pairs contained in this object.\n */\n entries(): IterableIterator<[string, string]>;\n /**\n * Returns an iterator allowing to go through all keys of the key/value pairs contained in this object.\n */\n keys(): IterableIterator<string>;\n /**\n * Returns an iterator allowing to go through all values of the key/value pairs contained in this object.\n */\n values(): IterableIterator<string>;\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 MimeTypeArray {\n [Symbol.iterator](): IterableIterator<Plugin>;\n}\n\ninterface NamedNodeMap {\n [Symbol.iterator](): IterableIterator<Attr>;\n}\n\ninterface NodeList {\n [Symbol.iterator](): IterableIterator<Node>;\n /**\n * Returns an array of key, value pairs for every entry in the list.\n */\n entries(): IterableIterator<[number, Node]>;\n /**\n * Returns an list of keys in the list.\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the list.\n */\n values(): IterableIterator<Node>;\n}\n\ninterface NodeListOf<TNode extends Node> {\n [Symbol.iterator](): IterableIterator<TNode>;\n /**\n * Returns an array of key, value pairs for every entry in the list.\n */\n entries(): IterableIterator<[number, TNode]>;\n /**\n * Returns an list of keys in the list.\n */\n keys(): IterableIterator<number>;\n /**\n * Returns an list of values in the list.\n */\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 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 SourceBufferList {\n [Symbol.iterator](): IterableIterator<SourceBuffer>;\n}\n\ninterface SpeechGrammarList {\n [Symbol.iterator](): IterableIterator<SpeechGrammar>;\n}\n\ninterface SpeechRecognitionResult {\n [Symbol.iterator](): IterableIterator<SpeechRecognitionAlternative>;\n}\n\ninterface SpeechRecognitionResultList {\n [Symbol.iterator](): IterableIterator<SpeechRecognitionResult>;\n}\n\ninterface StyleSheetList {\n [Symbol.iterator](): IterableIterator<StyleSheet>;\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 /**\n * Returns an array of key, value pairs for every entry in the search params.\n */\n entries(): IterableIterator<[string, string]>;\n /**\n * Returns a list of keys in the search params.\n */\n keys(): IterableIterator<string>;\n /**\n * Returns a list of values in the search params.\n */\n values(): IterableIterator<string>;\n}\n\ninterface VideoTrackList {\n [Symbol.iterator](): IterableIterator<VideoTrack>;\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\n/// <reference no-default-lib=\"true\"/>\n\n\n\n/////////////////////////////\n/// WorkerGlobalScope APIs\n/////////////////////////////\n// These are only available in a Web Worker\ndeclare function importScripts(...urls: string[]): 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\n/// <reference no-default-lib=\"true\"/>\n\n\n\n\n/////////////////////////////\n/// Windows Script Host APIS\n/////////////////////////////\n\n\ninterface ActiveXObject {\n new (s: string): any;\n}\ndeclare var ActiveXObject: ActiveXObject;\n\ninterface ITextWriter {\n Write(s: string): void;\n WriteLine(s: string): void;\n Close(): void;\n}\n\ninterface TextStreamBase {\n /**\n * The column number of the current character position in an input stream.\n */\n Column: number;\n\n /**\n * The current line number in an input stream.\n */\n Line: number;\n\n /**\n * Closes a text stream.\n * It is not necessary to close standard streams; they close automatically when the process ends. If\n * you close a standard stream, be aware that any other pointers to that standard stream become invalid.\n */\n Close(): void;\n}\n\ninterface TextStreamWriter extends TextStreamBase {\n /**\n * Sends a string to an output stream.\n */\n Write(s: string): void;\n\n /**\n * Sends a specified number of blank lines (newline characters) to an output stream.\n */\n WriteBlankLines(intLines: number): void;\n\n /**\n * Sends a string followed by a newline character to an output stream.\n */\n WriteLine(s: string): void;\n}\n\ninterface TextStreamReader extends TextStreamBase {\n /**\n * Returns a specified number of characters from an input stream, starting at the current pointer position.\n * Does not return until the ENTER key is pressed.\n * Can only be used on a stream in reading mode; causes an error in writing or appending mode.\n */\n Read(characters: number): string;\n\n /**\n * Returns all characters from an input stream.\n * Can only be used on a stream in reading mode; causes an error in writing or appending mode.\n */\n ReadAll(): string;\n\n /**\n * Returns an entire line from an input stream.\n * Although this method extracts the newline character, it does not add it to the returned string.\n * Can only be used on a stream in reading mode; causes an error in writing or appending mode.\n */\n ReadLine(): string;\n\n /**\n * Skips a specified number of characters when reading from an input text stream.\n * Can only be used on a stream in reading mode; causes an error in writing or appending mode.\n * @param characters Positive number of characters to skip forward. (Backward skipping is not supported.)\n */\n Skip(characters: number): void;\n\n /**\n * Skips the next line when reading from an input text stream.\n * Can only be used on a stream in reading mode, not writing or appending mode.\n */\n SkipLine(): void;\n\n /**\n * Indicates whether the stream pointer position is at the end of a line.\n */\n AtEndOfLine: boolean;\n\n /**\n * Indicates whether the stream pointer position is at the end of a stream.\n */\n AtEndOfStream: boolean;\n}\n\ndeclare var WScript: {\n /**\n * Outputs text to either a message box (under WScript.exe) or the command console window followed by\n * a newline (under CScript.exe).\n */\n Echo(s: any): void;\n\n /**\n * Exposes the write-only error output stream for the current script.\n * Can be accessed only while using CScript.exe.\n */\n StdErr: TextStreamWriter;\n\n /**\n * Exposes the write-only output stream for the current script.\n * Can be accessed only while using CScript.exe.\n */\n StdOut: TextStreamWriter;\n Arguments: { length: number; Item(n: number): string; };\n\n /**\n * The full path of the currently running script.\n */\n ScriptFullName: string;\n\n /**\n * Forces the script to stop immediately, with an optional exit code.\n */\n Quit(exitCode?: number): number;\n\n /**\n * The Windows Script Host build version number.\n */\n BuildVersion: number;\n\n /**\n * Fully qualified path of the host executable.\n */\n FullName: string;\n\n /**\n * Gets/sets the script mode - interactive(true) or batch(false).\n */\n Interactive: boolean;\n\n /**\n * The name of the host executable (WScript.exe or CScript.exe).\n */\n Name: string;\n\n /**\n * Path of the directory containing the host executable.\n */\n Path: string;\n\n /**\n * The filename of the currently running script.\n */\n ScriptName: string;\n\n /**\n * Exposes the read-only input stream for the current script.\n * Can be accessed only while using CScript.exe.\n */\n StdIn: TextStreamReader;\n\n /**\n * Windows Script Host version\n */\n Version: string;\n\n /**\n * Connects a COM object's event sources to functions named with a given prefix, in the form prefix_event.\n */\n ConnectObject(objEventSource: any, strPrefix: string): void;\n\n /**\n * Creates a COM object.\n * @param strProgiID\n * @param strPrefix Function names in the form prefix_event will be bound to this object's COM events.\n */\n CreateObject(strProgID: string, strPrefix?: string): any;\n\n /**\n * Disconnects a COM object from its event sources.\n */\n DisconnectObject(obj: any): void;\n\n /**\n * Retrieves an existing object with the specified ProgID from memory, or creates a new one from a file.\n * @param strPathname Fully qualified path to the file containing the object persisted to disk.\n * For objects in memory, pass a zero-length string.\n * @param strProgID\n * @param strPrefix Function names in the form prefix_event will be bound to this object's COM events.\n */\n GetObject(strPathname: string, strProgID?: string, strPrefix?: string): any;\n\n /**\n * Suspends script execution for a specified length of time, then continues execution.\n * @param intTime Interval (in milliseconds) to suspend script execution.\n */\n Sleep(intTime: number): void;\n};\n\n/**\n * WSH is an alias for WScript under Windows Script Host\n */\ndeclare var WSH: typeof WScript;\n\n/**\n * Represents an Automation SAFEARRAY\n */\ndeclare class SafeArray<T = any> {\n private constructor();\n private SafeArray_typekey: SafeArray<T>;\n}\n\n/**\n * Allows enumerating over a COM collection, which may not have indexed item access.\n */\ninterface Enumerator<T = any> {\n /**\n * Returns true if the current item is the last one in the collection, or the collection is empty,\n * or the current item is undefined.\n */\n atEnd(): boolean;\n\n /**\n * Returns the current item in the collection\n */\n item(): T;\n\n /**\n * Resets the current item in the collection to the first item. If there are no items in the collection,\n * the current item is set to undefined.\n */\n moveFirst(): void;\n\n /**\n * Moves the current item to the next item in the collection. If the enumerator is at the end of\n * the collection or the collection is empty, the current item is set to undefined.\n */\n moveNext(): void;\n}\n\ninterface EnumeratorConstructor {\n new <T = any>(safearray: SafeArray<T>): Enumerator<T>;\n new <T = any>(collection: { Item(index: any): T }): Enumerator<T>;\n new <T = any>(collection: any): Enumerator<T>;\n}\n\ndeclare var Enumerator: EnumeratorConstructor;\n\n/**\n * Enables reading from a COM safe array, which might have an alternate lower bound, or multiple dimensions.\n */\ninterface VBArray<T = any> {\n /**\n * Returns the number of dimensions (1-based).\n */\n dimensions(): number;\n\n /**\n * Takes an index for each dimension in the array, and returns the item at the corresponding location.\n */\n getItem(dimension1Index: number, ...dimensionNIndexes: number[]): T;\n\n /**\n * Returns the smallest available index for a given dimension.\n * @param dimension 1-based dimension (defaults to 1)\n */\n lbound(dimension?: number): number;\n\n /**\n * Returns the largest available index for a given dimension.\n * @param dimension 1-based dimension (defaults to 1)\n */\n ubound(dimension?: number): number;\n\n /**\n * Returns a Javascript array with all the elements in the VBArray. If there are multiple dimensions,\n * each successive dimension is appended to the end of the array.\n * Example: [[1,2,3],[4,5,6]] becomes [1,2,3,4,5,6]\n */\n toArray(): T[];\n}\n\ninterface VBArrayConstructor {\n new <T = any>(safeArray: SafeArray<T>): VBArray<T>;\n}\n\ndeclare var VBArray: VBArrayConstructor;\n\n/**\n * Automation date (VT_DATE)\n */\ndeclare class VarDate {\n private constructor();\n private VarDate_typekey: VarDate;\n}\n\ninterface DateConstructor {\n new (vd: VarDate): Date;\n}\n\ninterface Date {\n getVarDate: () => VarDate;\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\n/// <reference no-default-lib=\"true\"/>\n\n\ndeclare namespace Reflect {\n function apply(target: Function, thisArgument: any, argumentsList: ArrayLike<any>): any;\n function construct(target: Function, argumentsList: ArrayLike<any>, newTarget?: any): any;\n function defineProperty(target: object, propertyKey: PropertyKey, attributes: PropertyDescriptor): boolean;\n function deleteProperty(target: object, propertyKey: PropertyKey): boolean;\n function get(target: object, propertyKey: PropertyKey, receiver?: any): any;\n function getOwnPropertyDescriptor(target: object, propertyKey: PropertyKey): PropertyDescriptor | undefined;\n function getPrototypeOf(target: object): object;\n function has(target: object, propertyKey: PropertyKey): boolean;\n function isExtensible(target: object): boolean;\n function ownKeys(target: object): PropertyKey[];\n function preventExtensions(target: object): boolean;\n function set(target: object, propertyKey: PropertyKey, value: any, receiver?: any): boolean;\n function setPrototypeOf(target: object, proto: any): 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\n/// <reference no-default-lib=\"true\"/>\n\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: (this: void, 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 * Returns the this object after filling the section identified by start and end with value\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 −0, 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−16.\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: number): 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: number): 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: number): boolean;\n\n /**\n * Returns true if the value passed is a safe integer.\n * @param number A numeric value.\n */\n isSafeInteger(number: number): 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 − 1.\n */\n readonly MAX_SAFE_INTEGER: number;\n\n /**\n * The value of the smallest integer n such that n and n − 1 are both exactly representable as\n * a Number value.\n * The value of Number.MIN_SAFE_INTEGER is −9007199254740991 (−(2^53 − 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 s A string to convert into a number.\n * @param radix A value between 2 and 36 that specifies the base of the number in numString.\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, 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, 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, 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: (this: void, value: T, index: number, obj: ReadonlyArray<T>) => value is S, thisArg?: any): S | undefined;\n find(predicate: (value: T, index: number, obj: ReadonlyArray<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: ReadonlyArray<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, flags?: string): RegExp;\n (pattern: RegExp, 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 – 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 * @param name\n */\n anchor(name: string): string;\n\n /** Returns a <big> HTML element */\n big(): string;\n\n /** Returns a <blink> HTML element */\n blink(): string;\n\n /** Returns a <b> HTML element */\n bold(): string;\n\n /** Returns a <tt> HTML element */\n fixed(): string;\n\n /** Returns a <font> HTML element and sets the color attribute value */\n fontcolor(color: string): string;\n\n /** Returns a <font> HTML element and sets the size attribute value */\n fontsize(size: number): string;\n\n /** Returns a <font> HTML element and sets the size attribute value */\n fontsize(size: string): string;\n\n /** Returns an <i> HTML element */\n italics(): string;\n\n /** Returns an <a> HTML element and sets the href attribute value */\n link(url: string): string;\n\n /** Returns a <small> HTML element */\n small(): string;\n\n /** Returns a <strike> HTML element */\n strike(): string;\n\n /** Returns a <sub> HTML element */\n sub(): string;\n\n /** Returns a <sup> HTML element */\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 intended for use as a tag function of a Tagged Template String. When called\n * as such the first argument will be a well formed template call site object and the rest\n * parameter will contain the substitution values.\n * @param template A well-formed template string call site representation.\n * @param substitutions A set of substitution values.\n */\n raw(template: TemplateStringsArray, ...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\n/// <reference no-default-lib=\"true\"/>\n\n\ninterface Generator extends Iterator<any> { }\n\ninterface GeneratorFunction {\n /**\n * Creates a new Generator object.\n * @param args A list of arguments the function accepts.\n */\n new (...args: any[]): Generator;\n /**\n * Creates a new Generator object.\n * @param args A list of arguments the function accepts.\n */\n (...args: any[]): Generator;\n /**\n * The length of the arguments.\n */\n readonly length: number;\n /**\n * Returns the name of the function.\n */\n readonly name: string;\n /**\n * A reference to the prototype.\n */\n readonly prototype: Generator;\n}\n\ninterface GeneratorFunctionConstructor {\n /**\n * Creates a new Generator function.\n * @param args A list of arguments the function accepts.\n */\n new (...args: string[]): GeneratorFunction;\n /**\n * Creates a new Generator function.\n * @param args A list of arguments the function accepts.\n */\n (...args: string[]): GeneratorFunction;\n /**\n * The length of the arguments.\n */\n readonly length: number;\n /**\n * Returns the name of the function.\n */\n readonly name: string;\n /**\n * A reference to the prototype.\n */\n readonly prototype: GeneratorFunction;\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\n/// <reference no-default-lib=\"true\"/>\n\n\ninterface Map<K, V> {\n clear(): void;\n delete(key: K): boolean;\n forEach(callbackfn: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void;\n get(key: K): V | undefined;\n has(key: K): boolean;\n set(key: K, value: V): this;\n readonly size: number;\n}\n\ninterface MapConstructor {\n new(): Map<any, any>;\n new<K, V>(entries?: ReadonlyArray<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 object, V> {\n delete(key: K): boolean;\n get(key: K): V | undefined;\n has(key: K): boolean;\n set(key: K, value: V): this;\n}\n\ninterface WeakMapConstructor {\n new <K extends object = object, V = any>(entries?: ReadonlyArray<[K, V]> | null): WeakMap<K, V>;\n readonly prototype: WeakMap<object, any>;\n}\ndeclare var WeakMap: WeakMapConstructor;\n\ninterface Set<T> {\n add(value: T): this;\n clear(): void;\n delete(value: T): boolean;\n forEach(callbackfn: (value: T, value2: T, set: Set<T>) => void, thisArg?: any): void;\n has(value: T): boolean;\n readonly size: number;\n}\n\ninterface SetConstructor {\n new <T = any>(values?: ReadonlyArray<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 object> {\n add(value: T): this;\n delete(value: T): boolean;\n has(value: T): boolean;\n}\n\ninterface WeakSetConstructor {\n new <T extends object = object>(values?: ReadonlyArray<T> | null): WeakSet<T>;\n readonly prototype: WeakSet<object>;\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\n/// <reference no-default-lib=\"true\"/>\n\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<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>, T8 | PromiseLike<T8>, T9 | PromiseLike<T9>, T10 | PromiseLike<T10>]): Promise<[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10]>;\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<T1, T2, T3, T4, T5, T6, T7, T8, T9>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>, T8 | PromiseLike<T8>, T9 | PromiseLike<T9>]): Promise<[T1, T2, T3, T4, T5, T6, T7, T8, T9]>;\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<T1, T2, T3, T4, T5, T6, T7, T8>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>, T8 | PromiseLike<T8>]): Promise<[T1, T2, T3, T4, T5, T6, T7, T8]>;\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<T1, T2, T3, T4, T5, T6, T7>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>, T7 | PromiseLike<T7>]): Promise<[T1, T2, T3, T4, T5, T6, T7]>;\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<T1, T2, T3, T4, T5, T6>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>, T5 | PromiseLike<T5>, T6 | PromiseLike<T6>]): Promise<[T1, T2, T3, T4, T5, T6]>;\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<T1, T2, T3, T4, T5>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>, T5 | PromiseLike<T5>]): Promise<[T1, T2, T3, T4, T5]>;\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<T1, T2, T3, T4>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>, T4 | PromiseLike <T4>]): Promise<[T1, T2, T3, T4]>;\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<T1, T2, T3>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>, T3 | PromiseLike<T3>]): Promise<[T1, T2, T3]>;\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<T1, T2>(values: [T1 | PromiseLike<T1>, T2 | PromiseLike<T2>]): Promise<[T1, T2]>;\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>(values: (T | PromiseLike<T>)[]): Promise<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>(values: T[]): Promise<T extends PromiseLike<infer U> ? U : 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 iterable of Promises.\n * @returns A new Promise.\n */\n race<T>(values: Iterable<T>): Promise<T extends PromiseLike<infer U> ? U : 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 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<T>;\n\n /**\n * Creates a new resolved promise .\n * @returns A resolved promise.\n */\n resolve(): Promise<void>;\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\n/// <reference no-default-lib=\"true\"/>\n\n\ninterface ProxyHandler<T extends object> {\n getPrototypeOf? (target: T): object | null;\n setPrototypeOf? (target: T, v: any): boolean;\n isExtensible? (target: T): boolean;\n preventExtensions? (target: T): boolean;\n getOwnPropertyDescriptor? (target: T, p: PropertyKey): PropertyDescriptor | undefined;\n has? (target: T, p: PropertyKey): boolean;\n get? (target: T, p: PropertyKey, receiver: any): any;\n set? (target: T, p: PropertyKey, value: any, receiver: any): boolean;\n deleteProperty? (target: T, p: PropertyKey): boolean;\n defineProperty? (target: T, p: PropertyKey, attributes: PropertyDescriptor): boolean;\n enumerate? (target: T): PropertyKey[];\n ownKeys? (target: T): PropertyKey[];\n apply? (target: T, thisArg: any, argArray?: any): any;\n construct? (target: T, argArray: any, newTarget?: any): object;\n}\n\ninterface ProxyConstructor {\n revocable<T extends object>(target: T, handler: ProxyHandler<T>): { proxy: T; revoke: () => void; };\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\n/// <reference no-default-lib=\"true\"/>\n\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;";
--------------------------------- (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.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
node-addon-api
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Node.js API collaborators
--------------------------------- (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
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
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Lesser General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
== 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-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-path
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2018, Jon Schlinkert.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
nth-check
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright (c) Felix Böhm
--------------------------------- (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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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.pick
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015 Jon Schlinkert, contributors.
Copyright (c) 2014-2016, Jon Schlinkert.
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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
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-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
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> (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
parallel-transform
== License Type
SPDX:MIT
== Copyright
Copyright 2013 Mathias Buus
--------------------------------- (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
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
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.
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
Everyone is permitted to copy and distribute verbatim or modified
copies of this license document, and changing it is allowed as long
as the name is changed.
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. You just DO WHAT THE FUCK YOU WANT TO.
---
The MIT License (MIT)
Copyright © 2013–2016 Domenic Denicola <d@domenic.me>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
== 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
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-std-serializers
== License Type
SPDX:MIT
== Copyright
Copyright Mateo Collina, David Mark Clements, James Sumners
--------------------------------- (separator) ----------------------------------
== Dependency
pino
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2019 Matteo Collina, David Mark Clements and the Pino contributors
--------------------------------- (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
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
posix-character-classes
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2017, Jon Schlinkert
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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 2014, 2015, 2016, 2017, 2018 Simon Lydell
Copyright © James Long and contributors
--------------------------------- (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
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
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-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
querystring
== 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
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
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 2015, Yahoo! Inc.
Copyright 2019 Atlassian Pty Ltd
--------------------------------- (separator) ----------------------------------
== Dependency
react-clientside-effect
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015 Dan Abramov
--------------------------------- (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-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-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.
Copyright 2015, Yahoo Inc.
Copyright 2015, Yahoo! Inc.
Copyright 2019, Yahoo Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-is
== License Type
SPDX:MIT
== Copyright
Copyright (c) Facebook, Inc. and its affiliates.
--------------------------------- (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.
Copyright 2015, Yahoo! Inc.
--------------------------------- (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.
Copyright 2015, Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-router
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2013-present, Facebook, Inc.
Copyright 2015, Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
react-style-singleton
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Anton Korzunov
--------------------------------- (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
readable-stream
== License Type
SPDX:MIT
== Copyright
Copyright Node.js contributors. All rights reserved.
--------------------------------- (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
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
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
refractor
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017 Titus Wormer <tituswormer@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
regenerate-unicode-properties
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (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.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
regexp.prototype.flags
== License Type
SPDX:MIT
== Copyright
Copyright (C) 2014 Jordan Harband
--------------------------------- (separator) ----------------------------------
== Dependency
regexpu-core
== License Type
SPDX:MIT
== Copyright
Copyright Mathias Bynens <https://mathiasbynens.be/>
--------------------------------- (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
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-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
remove-bom-buffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
repeat-element
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-present, Jon Schlinkert.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
repeat-string
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-2015, Jon Schlinkert.
Copyright (c) 2014-2016, Jon Schlinkert.
Copyright © 2016, [Jon Schlinkert](http://github.com/jonschlinkert).
--------------------------------- (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-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
rfdc
== License Type
SPDX:MIT
== Copyright
Copyright 2019 "David Mark Clements <david.mark.clements@gmail.com>"
--------------------------------- (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
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
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
== 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-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
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
schema-utils
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (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
serialize-javascript
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2014, Yahoo! Inc. All rights reserved.
Copyright 2014 Yahoo! Inc.
--------------------------------- (separator) ----------------------------------
== Dependency
set-blocking
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2016, Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
set-cookie-serde
== License Type
SPDX:MIT
== Copyright
Stephen Belanger <admin@stephenbelanger.com> ("githubUsername" : "59naga" )
--------------------------------- (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-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014-present, Jon Schlinkert.
Copyright (c) Jon Schlinkert (https://github.com/jonschlinkert).
Copyright © 2021, [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
sha.js
== License Type
Copyright (c) 2013-2018 sha.js contributors
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Copyright (c) 1998 - 2009, Paul Johnston & Contributors
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 the author 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 THE COPYRIGHT OWNER 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.
== 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
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
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
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
snapdragon-util
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2017, Jon Schlinkert
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
snapdragon
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2012 TJ Holowaychuk <tj@vision-media.ca>
Copyright (c) 2015-2016, Jon Schlinkert.
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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
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.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
sprintf-js
== License Type
SPDX:BSD-3-Clause
== Copyright
Copyright (c) 2007-present, Alexandru Mărășteanu <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
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
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-similarity
== License Type
SPDX:ISC
== Copyright
Copyright (c) 2018 Akash Kurdekar
--------------------------------- (separator) ----------------------------------
== Dependency
string-width
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (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-final-newline
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (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
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-webpack-plugin
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
terser
== License Type
SPDX:BSD-2-Clause
== Copyright
Copyright 2012-2018 (c) Mihai Bazon <mihai.bazon@gmail.com>
--------------------------------- (separator) ----------------------------------
== Dependency
text-diff
== License Type
SPDX:Apache-2.0
== Copyright
Copyright 2006 Google Inc.
--------------------------------- (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
tinymath
== License Type
SPDX:Apache-2.0
== Copyright
Rashid Khan <rashid.khan@elastic.co>, Catherine Liu <catherine.liu@elastic.co>
--------------------------------- (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
to-absolute-glob
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2016, Jon Schlinkert
Copyright © 2016, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
to-arraybuffer
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 John Hiesey
--------------------------------- (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
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
to-regex
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016-2018, Jon Schlinkert.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
to-source-code
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2016 W.Y.
--------------------------------- (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
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
traverse
== License Type
SPDX:MIT
== Copyright
Copyright 2010 James Halliday (mail@substack.net)
--------------------------------- (separator) ----------------------------------
== Dependency
tree-kill
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2018 Peter Krumins
--------------------------------- (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-easing
== License Type
SPDX:Unlicense
== Copyright
streamich ("githubUsername" : "streamich" )
--------------------------------- (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-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
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-2024 Jos de Jong
--------------------------------- (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
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
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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-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
unset-value
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015, 2017, Jon Schlinkert
Copyright (c) 2015, 2017, Jon Schlinkert.
Copyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (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>
--------------------------------- (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
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2015-2017, Jon Schlinkert.
Copyright (c) 2015-present, Jon Schlinkert.
Copyright © 2018, [Jon Schlinkert](https://github.com/jonschlinkert).
--------------------------------- (separator) ----------------------------------
== Dependency
util-deprecate
== License Type
SPDX:MIT
== Copyright
Copyright (c) 2014 Nathan Rajlich <nathan@tootallnate.net>
--------------------------------- (separator) ----------------------------------
== Dependency
util
== License Type
SPDX:MIT
== Copyright
Copyright Joyent, Inc. and other Node contributors
--------------------------------- (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
uuid
== License Type
SPDX:MIT
== Copyright
Copyright (C) Paul Johnston 1999 - 2009
Copyright (c) 2010-2016 Robert Kieffer and other contributors
Copyright 2011, Sebastian Tschan
--------------------------------- (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
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
watchpack-chokidar2
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (separator) ----------------------------------
== Dependency
watchpack
== 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-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
== License Type
SPDX:MIT
== Copyright
Copyright JS Foundation and other contributors
--------------------------------- (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-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
wordwrap
== License Type
SPDX:MIT
== Copyright
{'name': 'James Halliday', 'email': 'mail@substack.net', 'url': 'http://substack.net'}
--------------------------------- (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
wrap-ansi
== License Type
SPDX:MIT
== Copyright
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
--------------------------------- (separator) ----------------------------------
== Dependency
wrappy
== License Type
SPDX:ISC
== Copyright
Copyright (c) Isaac Z. Schlueter and Contributors
--------------------------------- (separator) ----------------------------------
== Dependency
xml2js
== License Type
SPDX:MIT
== Copyright
Copyright 2010, 2011, 2012, 2013. All rights reserved.
--------------------------------- (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
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
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>
----------------------------------- Licenses -----------------------------------
--------------------------------- (separator) ----------------------------------
== SPDX:Apache-2.0
Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
1. Definitions.
"License" shall mean the terms and conditions for use, reproduction, and
distribution as defined by Sections 1 through 9 of this document.
"Licensor" shall mean the copyright owner or entity authorized by the
copyright owner that is granting the License.
"Legal Entity" shall mean the union of the acting entity and all other
entities that control, are controlled by, or are under common control with
that entity. For the purposes of this definition, "control" means (i) the
power, direct or indirect, to cause the direction or management of such
entity, whether by contract or otherwise, or (ii) ownership of fifty percent
(50%) or more of the outstanding shares, or (iii) beneficial ownership of such
entity.
"You" (or "Your") shall mean an individual or Legal Entity exercising
permissions granted by this License.
"Source" form shall mean the preferred form for making modifications,
including but not limited to software source code, documentation source, and
configuration files.
"Object" form shall mean any form resulting from mechanical transformation or
translation of a Source form, including but not limited to compiled object
code, generated documentation, and conversions to other media types.
"Work" shall mean the work of authorship, whether in Source or Object form,
made available under the License, as indicated by a copyright notice that is
included in or attached to the work (an example is provided in the Appendix
below).
"Derivative Works" shall mean any work, whether in Source or Object form, that
is based on (or derived from) the Work and for which the editorial revisions,
annotations, elaborations, or other modifications represent, as a whole, an
original work of authorship. For the purposes of this License, Derivative
Works shall not include works that remain separable from, or merely link (or
bind by name) to the interfaces of, the Work and Derivative Works thereof.
"Contribution" shall mean any work of authorship, including the original
version of the Work and any modifications or additions to that Work or
Derivative Works thereof, that is intentionally submitted to Licensor for
inclusion in the Work by the copyright owner or by an individual or Legal
Entity authorized to submit on behalf of the copyright owner. For the purposes
of this definition, "submitted" means any form of electronic, verbal, or
written communication sent to the Licensor or its representatives, including
but not limited to communication on electronic mailing lists, source code
control systems, and issue tracking systems that are managed by, or on behalf
of, the Licensor for the purpose of discussing and improving the Work, but
excluding communication that is conspicuously marked or otherwise designated
in writing by the copyright owner as "Not a Contribution."
"Contributor" shall mean Licensor and any individual or Legal Entity on behalf
of whom a Contribution has been received by Licensor and subsequently
incorporated within the Work.
2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
(a) You must give any other recipients of the Work or Derivative Works a copy
of this License; and
(b) You must cause any modified files to carry prominent notices stating that
You changed the files; and
(c) You must retain, in the Source form of any Derivative Works that You
distribute, all copyright, patent, trademark, and attribution notices from the
Source form of the Work, excluding those notices that do not pertain to any
part of the Derivative Works; and
(d) If the Work includes a "NOTICE" text file as part of its distribution,
then any Derivative Works that You distribute must include a readable copy of
the attribution notices contained within such NOTICE file, excluding those
notices that do not pertain to any part of the Derivative Works, in at least
one of the following places: within a NOTICE text file distributed as part of
the Derivative Works; within the Source form or documentation, if provided
along with the Derivative Works; or, within a display generated by the
Derivative Works, if and wherever such third-party notices normally appear.
The contents of the NOTICE file are for informational purposes only and do not
modify the License. You may add Your own attribution notices within Derivative
Works that You distribute, alongside or as an addendum to the NOTICE text from
the Work, provided that such additional attribution notices cannot be
construed as modifying the License.
You may add Your own copyright statement to Your modifications and may provide
additional or different license terms and conditions for use, reproduction, or
distribution of Your modifications, or for any such Derivative Works as a
whole, provided Your use, reproduction, and distribution of the Work otherwise
complies with the conditions stated in this License.
5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
END OF TERMS AND CONDITIONS
APPENDIX: How to apply the Apache License to your work.
To apply the Apache License to your work, attach the following boilerplate
notice, with the fields enclosed by brackets "[]" replaced with your own
identifying information. (Don't include the brackets!) The text should be
enclosed in the appropriate comment syntax for the file format. We also
recommend that a file or class name and description of purpose be included on
the same "printed page" as the copyright notice for easier identification
within third-party archives.
Copyright [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
--------------------------------- (separator) ----------------------------------
== SPDX:BSD-0-Clause
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE.
--------------------------------- (separator) ----------------------------------
== SPDX:BSD-2-Clause
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
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 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 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--------------------------------- (separator) ----------------------------------
== SPDX:BSD-3-Clause
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. Neither the name of the copyright holder 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 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
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--------------------------------- (separator) ----------------------------------
== SPDX:CC-BY-4.0
Attribution 4.0 International
=======================================================================
Creative Commons Corporation ("Creative Commons") is not a law firm and
does not provide legal services or legal advice. Distribution of
Creative Commons public licenses does not create a lawyer-client or
other relationship. Creative Commons makes its licenses and related
information available on an "as-is" basis. Creative Commons gives no
warranties regarding its licenses, any material licensed under their
terms and conditions, or any related information. Creative Commons
disclaims all liability for damages resulting from their use to the
fullest extent possible.
Using Creative Commons Public Licenses
Creative Commons public licenses provide a standard set of terms and
conditions that creators and other rights holders may use to share
original works of authorship and other material subject to copyright
and certain other rights specified in the public license below. The
following considerations are for informational purposes only, are not
exhaustive, and do not form part of our licenses.
Considerations for licensors: Our public licenses are
intended for use by those authorized to give the public
permission to use material in ways otherwise restricted by
copyright and certain other rights. Our licenses are
irrevocable. Licensors should read and understand the terms
and conditions of the license they choose before applying it.
Licensors should also secure all rights necessary before
applying our licenses so that the public can reuse the
material as expected. Licensors should clearly mark any
material not subject to the license. This includes other CC-
licensed material, or material used under an exception or
limitation to copyright. More considerations for licensors:
wiki.creativecommons.org/Considerations_for_licensors
Considerations for the public: By using one of our public
licenses, a licensor grants the public permission to use the
licensed material under specified terms and conditions. If
the licensor's permission is not necessary for any reason--for
example, because of any applicable exception or limitation to
copyright--then that use is not regulated by the license. Our
licenses grant only permissions under copyright and certain
other rights that a licensor has authority to grant. Use of
the licensed material may still be restricted for other
reasons, including because others have copyright or other
rights in the material. A licensor may make special requests,
such as asking that all changes be marked or described.
Although not required by our licenses, you are encouraged to
respect those requests where reasonable. More considerations
for the public:
wiki.creativecommons.org/Considerations_for_licensees
=======================================================================
Creative Commons Attribution 4.0 International Public License
By exercising the Licensed Rights (defined below), You accept and agree
to be bound by the terms and conditions of this Creative Commons
Attribution 4.0 International Public License ("Public License"). To the
extent this Public License may be interpreted as a contract, You are
granted the Licensed Rights in consideration of Your acceptance of
these terms and conditions, and the Licensor grants You such rights in
consideration of benefits the Licensor receives from making the
Licensed Material available under these terms and conditions.
Section 1 -- Definitions.
a. Adapted Material means material subject to Copyright and Similar
Rights that is derived from or based upon the Licensed Material
and in which the Licensed Material is translated, altered,
arranged, transformed, or otherwise modified in a manner requiring
permission under the Copyright and Similar Rights held by the
Licensor. For purposes of this Public License, where the Licensed
Material is a musical work, performance, or sound recording,
Adapted Material is always produced where the Licensed Material is
synched in timed relation with a moving image.
b. Adapter's License means the license You apply to Your Copyright
and Similar Rights in Your contributions to Adapted Material in
accordance with the terms and conditions of this Public License.
c. Copyright and Similar Rights means copyright and/or similar rights
closely related to copyright including, without limitation,
performance, broadcast, sound recording, and Sui Generis Database
Rights, without regard to how the rights are labeled or
categorized. For purposes of this Public License, the rights
specified in Section 2(b)(1)-(2) are not Copyright and Similar
Rights.
d. Effective Technological Measures means those measures that, in the
absence of proper authority, may not be circumvented under laws
fulfilling obligations under Article 11 of the WIPO Copyright
Treaty adopted on December 20, 1996, and/or similar international
agreements.
e. Exceptions and Limitations means fair use, fair dealing, and/or
any other exception or limitation to Copyright and Similar Rights
that applies to Your use of the Licensed Material.
f. Licensed Material means the artistic or literary work, database,
or other material to which the Licensor applied this Public
License.
g. Licensed Rights means the rights granted to You subject to the
terms and conditions of this Public License, which are limited to
all Copyright and Similar Rights that apply to Your use of the
Licensed Material and that the Licensor has authority to license.
h. Licensor means the individual(s) or entity(ies) granting rights
under this Public License.
i. Share means to provide material to the public by any means or
process that requires permission under the Licensed Rights, such
as reproduction, public display, public performance, distribution,
dissemination, communication, or importation, and to make material
available to the public including in ways that members of the
public may access the material from a place and at a time
individually chosen by them.
j. Sui Generis Database Rights means rights other than copyright
resulting from Directive 96/9/EC of the European Parliament and of
the Council of 11 March 1996 on the legal protection of databases,
as amended and/or succeeded, as well as other essentially
equivalent rights anywhere in the world.
k. You means the individual or entity exercising the Licensed Rights
under this Public License. Your has a corresponding meaning.
Section 2 -- Scope.
a. License grant.
1. Subject to the terms and conditions of this Public License,
the Licensor hereby grants You a worldwide, royalty-free,
non-sublicensable, non-exclusive, irrevocable license to
exercise the Licensed Rights in the Licensed Material to:
a. reproduce and Share the Licensed Material, in whole or
in part; and
b. produce, reproduce, and Share Adapted Material.
2. Exceptions and Limitations. For the avoidance of doubt, where
Exceptions and Limitations apply to Your use, this Public
License does not apply, and You do not need to comply with
its terms and conditions.
3. Term. The term of this Public License is specified in Section
6(a).
4. Media and formats; technical modifications allowed. The
Licensor authorizes You to exercise the Licensed Rights in
all media and formats whether now known or hereafter created,
and to make technical modifications necessary to do so. The
Licensor waives and/or agrees not to assert any right or
authority to forbid You from making technical modifications
necessary to exercise the Licensed Rights, including
technical modifications necessary to circumvent Effective
Technological Measures. For purposes of this Public License,
simply making modifications authorized by this Section 2(a)
(4) never produces Adapted Material.
5. Downstream recipients.
a. Offer from the Licensor -- Licensed Material. Every
recipient of the Licensed Material automatically
receives an offer from the Licensor to exercise the
Licensed Rights under the terms and conditions of this
Public License.
b. No downstream restrictions. You may not offer or impose
any additional or different terms or conditions on, or
apply any Effective Technological Measures to, the
Licensed Material if doing so restricts exercise of the
Licensed Rights by any recipient of the Licensed
Material.
6. No endorsement. Nothing in this Public License constitutes or
may be construed as permission to assert or imply that You
are, or that Your use of the Licensed Material is, connected
with, or sponsored, endorsed, or granted official status by,
the Licensor or others designated to receive attribution as
provided in Section 3(a)(1)(A)(i).
b. Other rights.
1. Moral rights, such as the right of integrity, are not
licensed under this Public License, nor are publicity,
privacy, and/or other similar personality rights; however, to
the extent possible, the Licensor waives and/or agrees not to
assert any such rights held by the Licensor to the limited
extent necessary to allow You to exercise the Licensed
Rights, but not otherwise.
2. Patent and trademark rights are not licensed under this
Public License.
3. To the extent possible, the Licensor waives any right to
collect royalties from You for the exercise of the Licensed
Rights, whether directly or through a collecting society
under any voluntary or waivable statutory or compulsory
licensing scheme. In all other cases the Licensor expressly
reserves any right to collect such royalties.
Section 3 -- License Conditions.
Your exercise of the Licensed Rights is expressly made subject to the
following conditions.
a. Attribution.
1. If You Share the Licensed Material (including in modified
form), You must:
a. retain the following if it is supplied by the Licensor
with the Licensed Material:
i. identification of the creator(s) of the Licensed
Material and any others designated to receive
attribution, in any reasonable manner requested by
the Licensor (including by pseudonym if
designated);
ii. a copyright notice;
iii. a notice that refers to this Public License;
iv. a notice that refers to the disclaimer of
warranties;
v. a URI or hyperlink to the Licensed Material to the
extent reasonably practicable;
b. indicate if You modified the Licensed Material and
retain an indication of any previous modifications; and
c. indicate the Licensed Material is licensed under this
Public License, and include the text of, or the URI or
hyperlink to, this Public License.
2. You may satisfy the conditions in Section 3(a)(1) in any
reasonable manner based on the medium, means, and context in
which You Share the Licensed Material. For example, it may be
reasonable to satisfy the conditions by providing a URI or
hyperlink to a resource that includes the required
information.
3. If requested by the Licensor, You must remove any of the
information required by Section 3(a)(1)(A) to the extent
reasonably practicable.
4. If You Share Adapted Material You produce, the Adapter's
License You apply must not prevent recipients of the Adapted
Material from complying with this Public License.
Section 4 -- Sui Generis Database Rights.
Where the Licensed Rights include Sui Generis Database Rights that
apply to Your use of the Licensed Material:
a. for the avoidance of doubt, Section 2(a)(1) grants You the right
to extract, reuse, reproduce, and Share all or a substantial
portion of the contents of the database;
b. if You include all or a substantial portion of the database
contents in a database in which You have Sui Generis Database
Rights, then the database in which You have Sui Generis Database
Rights (but not its individual contents) is Adapted Material; and
c. You must comply with the conditions in Section 3(a) if You Share
all or a substantial portion of the contents of the database.
For the avoidance of doubt, this Section 4 supplements and does not
replace Your obligations under this Public License where the Licensed
Rights include other Copyright and Similar Rights.
Section 5 -- Disclaimer of Warranties and Limitation of Liability.
a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
c. The disclaimer of warranties and limitation of liability provided
above shall be interpreted in a manner that, to the extent
possible, most closely approximates an absolute disclaimer and
waiver of all liability.
Section 6 -- Term and Termination.
a. This Public License applies for the term of the Copyright and
Similar Rights licensed here. However, if You fail to comply with
this Public License, then Your rights under this Public License
terminate automatically.
b. Where Your right to use the Licensed Material has terminated under
Section 6(a), it reinstates:
1. automatically as of the date the violation is cured, provided
it is cured within 30 days of Your discovery of the
violation; or
2. upon express reinstatement by the Licensor.
For the avoidance of doubt, this Section 6(b) does not affect any
right the Licensor may have to seek remedies for Your violations
of this Public License.
c. For the avoidance of doubt, the Licensor may also offer the
Licensed Material under separate terms or conditions or stop
distributing the Licensed Material at any time; however, doing so
will not terminate this Public License.
d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
License.
Section 7 -- Other Terms and Conditions.
a. The Licensor shall not be bound by any additional or different
terms or conditions communicated by You unless expressly agreed.
b. Any arrangements, understandings, or agreements regarding the
Licensed Material not stated herein are separate from and
independent of the terms and conditions of this Public License.
Section 8 -- Interpretation.
a. For the avoidance of doubt, this Public License does not, and
shall not be interpreted to, reduce, limit, restrict, or impose
conditions on any use of the Licensed Material that could lawfully
be made without permission under this Public License.
b. To the extent possible, if any provision of this Public License is
deemed unenforceable, it shall be automatically reformed to the
minimum extent necessary to make it enforceable. If the provision
cannot be reformed, it shall be severed from this Public License
without affecting the enforceability of the remaining terms and
conditions.
c. No term or condition of this Public License will be waived and no
failure to comply consented to unless expressly agreed to by the
Licensor.
d. Nothing in this Public License constitutes or may be interpreted
as a limitation upon, or waiver of, any privileges and immunities
that apply to the Licensor or You, including from the legal
processes of any jurisdiction or authority.
=======================================================================
Creative Commons is not a party to its public
licenses. Notwithstanding, Creative Commons may elect to apply one of
its public licenses to material it publishes and in those instances
will be considered the “Licensor.” The text of the Creative Commons
public licenses is dedicated to the public domain under the CC0 Public
Domain Dedication. Except for the limited purpose of indicating that
material is shared under a Creative Commons public license or as
otherwise permitted by the Creative Commons policies published at
creativecommons.org/policies, Creative Commons does not authorize the
use of the trademark "Creative Commons" or any other trademark or logo
of Creative Commons without its prior written consent including,
without limitation, in connection with any unauthorized modifications
to any of its public licenses or any other arrangements,
understandings, or agreements concerning use of licensed material. For
the avoidance of doubt, this paragraph does not form part of the
public licenses.
Creative Commons may be contacted at creativecommons.org.
--------------------------------- (separator) ----------------------------------
== SPDX:CC0-1.0
Creative Commons CC0 1.0 Universal
CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE LEGAL
SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN ATTORNEY-CLIENT
RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS INFORMATION ON AN "AS-IS" BASIS.
CREATIVE COMMONS MAKES NO WARRANTIES REGARDING THE USE OF THIS DOCUMENT OR THE
INFORMATION OR WORKS PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES
RESULTING FROM THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
HEREUNDER.
Statement of Purpose
The laws of most jurisdictions throughout the world automatically confer
exclusive Copyright and Related Rights (defined below) upon the creator and
subsequent owner(s) (each and all, an "owner") of an original work of
authorship and/or a database (each, a "Work").
Certain owners wish to permanently relinquish those rights to a Work for the
purpose of contributing to a commons of creative, cultural and scientific
works ("Commons") that the public can reliably and without fear of later
claims of infringement build upon, modify, incorporate in other works, reuse
and redistribute as freely as possible in any form whatsoever and for any
purposes, including without limitation commercial purposes. These owners may
contribute to the Commons to promote the ideal of a free culture and the
further production of creative, cultural and scientific works, or to gain
reputation or greater distribution for their Work in part through the use and
efforts of others.
For these and/or other purposes and motivations, and without any expectation
of additional consideration or compensation, the person associating CC0 with a
Work (the "Affirmer"), to the extent that he or she is an owner of Copyright
and Related Rights in the Work, voluntarily elects to apply CC0 to the Work
and publicly distribute the Work under its terms, with knowledge of his or her
Copyright and Related Rights in the Work and the meaning and intended legal
effect of CC0 on those rights.
1. Copyright and Related Rights. A Work made available under CC0 may be protected by copyright and related or neighboring rights ("Copyright and Related Rights"). Copyright and Related Rights include, but are not limited to, the following:
i. the right to reproduce, adapt, distribute, perform, display, communicate,
and translate a Work;
ii. moral rights retained by the original author(s) and/or performer(s);
iii. publicity and privacy rights pertaining to a person's image or
likeness depicted in a Work;
iv. rights protecting against unfair competition in regards to a Work, subject
to the limitations in paragraph 4(a), below;
v. rights protecting the extraction, dissemination, use and reuse of data in a
Work;
vi. database rights (such as those arising under Directive 96/9/EC of the
European Parliament and of the Council of 11 March 1996 on the legal
protection of databases, and under any national implementation thereof,
including any amended or successor version of such directive); and
vii. other similar, equivalent or corresponding rights throughout the world
based on applicable law or treaty, and any national implementations thereof.
2. Waiver. To the greatest extent permitted by, but not in contravention of, applicable law, Affirmer hereby overtly, fully, permanently, irrevocably and unconditionally waives, abandons, and surrenders all of Affirmer's Copyright and Related Rights and associated claims and causes of action, whether now known or unknown (including existing as well as future claims and causes of action), in the Work (i) in all territories worldwide, (ii) for the maximum duration provided by applicable law or treaty (including future time extensions), (iii) in any current or future medium and for any number of copies, and (iv) for any purpose whatsoever, including without limitation commercial, advertising or promotional purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each member of the public at large and to the detriment of Affirmer's heirs and successors, fully intending that such Waiver shall not be subject to revocation, rescission, cancellation, termination, or any other legal or equitable action to disrupt the quiet enjoyment of the Work by the public as contemplated by Affirmer's express Statement of Purpose.
3. Public License Fallback. Should any part of the Waiver for any reason be judged legally invalid or ineffective under applicable law, then the Waiver shall be preserved to the maximum extent permitted taking into account Affirmer's express Statement of Purpose. In addition, to the extent the Waiver is so judged Affirmer hereby grants to each affected person a royalty-free, non transferable, non sublicensable, non exclusive, irrevocable and unconditional license to exercise Affirmer's Copyright and Related Rights in the Work (i) in all territories worldwide, (ii) for the maximum duration provided by applicable law or treaty (including future time extensions), (iii) in any current or future medium and for any number of copies, and (iv) for any purpose whatsoever, including without limitation commercial, advertising or promotional purposes (the "License"). The License shall be deemed effective as of the date CC0 was applied by Affirmer to the Work. Should any part of the License for any reason be judged legally invalid or ineffective under applicable law, such partial invalidity or ineffectiveness shall not invalidate the remainder of the License, and in such case Affirmer hereby affirms that he or she will not (i) exercise any of his or her remaining Copyright and Related Rights in the Work or (ii) assert any associated claims and causes of action with respect to the Work, in either case contrary to Affirmer's express Statement of Purpose.
4. Limitations and Disclaimers.
a. No trademark or patent rights held by Affirmer are waived, abandoned,
surrendered, licensed or otherwise affected by this document.
b. Affirmer 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, merchantability, fitness for
a particular purpose, non infringement, or the absence of latent or other
defects, accuracy, or the present or absence of errors, whether or not
discoverable, all to the greatest extent permissible under applicable law.
c. Affirmer disclaims responsibility for clearing rights of other persons that
may apply to the Work or any use thereof, including without limitation any
person's Copyright and Related Rights in the Work. Further, Affirmer
disclaims responsibility for obtaining any necessary consents, permissions or
other rights required for any use of the Work.
d. Affirmer understands and acknowledges that Creative Commons is not a party
to this document and has no duty or obligation with respect to this CC0 or use
of the Work.
--------------------------------- (separator) ----------------------------------
== SPDX:ISC
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH REGARD
TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
OF THIS SOFTWARE.
--------------------------------- (separator) ----------------------------------
== SPDX:MIT
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
--------------------------------- (separator) ----------------------------------
== SPDX:Unlicense
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or distribute
this software, either in source code form or as a compiled binary, for any
purpose, commercial or non-commercial, and by any means.
In jurisdictions that recognize copyright laws, the author or authors of this
software dedicate any and all copyright interest in the software to the public
domain. We make this dedication for the benefit of the public at large and to
the detriment of our heirs and
successors. We intend this dedication to be an overt act of relinquishment in
perpetuity of all present and future rights to this software under copyright
law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
For more information, please refer to <http://unlicense.org/>
--------------------------------- (separator) ----------------------------------
== SPDX:WTFPL
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
Everyone is permitted to copy and distribute verbatim or modified copies of
this license document, and changing it is allowed as long as the name is
changed.
DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. You just DO WHAT THE FUCK YOU WANT TO.