2019-09-12 09:43:26 +10:00
! function ( e ) { var t = { } ; function n ( r ) { if ( t [ r ] ) return t [ r ] . exports ; var i = t [ r ] = { i : r , l : ! 1 , exports : { } } ; return e [ r ] . call ( i . exports , i , i . exports , n ) , i . l = ! 0 , i . exports } n . m = e , n . c = t , n . d = function ( e , t , r ) { n . o ( e , t ) || Object . defineProperty ( e , t , { enumerable : ! 0 , get : r } ) } , n . r = function ( e ) { "undefined" != typeof Symbol && Symbol . toStringTag && Object . defineProperty ( e , Symbol . toStringTag , { value : "Module" } ) , Object . defineProperty ( e , "__esModule" , { value : ! 0 } ) } , n . t = function ( e , t ) { if ( 1 & t && ( e = n ( e ) ) , 8 & t ) return e ; if ( 4 & t && "object" == typeof e && e && e . _ _esModule ) return e ; var r = Object . create ( null ) ; if ( n . r ( r ) , Object . defineProperty ( r , "default" , { enumerable : ! 0 , value : e } ) , 2 & t && "string" != typeof e ) for ( var i in e ) n . d ( r , i , function ( t ) { return e [ t ] } . bind ( null , i ) ) ; return r } , n . n = function ( e ) { var t = e && e . _ _esModule ? function t ( ) { return e . default } : function t ( ) { return e } ; return n . d ( t , "a" , t ) , t } , n . o = function ( e , t ) { return Object . prototype . hasOwnProperty . call ( e , t ) } , n . p = "" , n ( n . s = 309 ) } ( [ function ( e , t , n ) { "use strict" ; ( function ( e ) {
/ * !
* The buffer module from node . js , for the browser .
*
* @ author Feross Aboukhadijeh < feross @ feross . org > < http : //feross.org>
* @ license MIT
* /
var r = n ( 314 ) , i = n ( 172 ) , o = n ( 112 ) ; function l ( ) { try { var e = new Uint8Array ( 1 ) ; return e . _ _proto _ _ = { _ _proto _ _ : Uint8Array . prototype , foo : function ( ) { return 42 } } , 42 === e . foo ( ) && "function" == typeof e . subarray && 0 === e . subarray ( 1 , 1 ) . byteLength } catch ( e ) { return ! 1 } } function a ( ) { return u . TYPED _ARRAY _SUPPORT ? 2147483647 : 1073741823 } function s ( e , t ) { if ( a ( ) < t ) throw new RangeError ( "Invalid typed array length" ) ; return u . TYPED _ARRAY _SUPPORT ? ( e = new Uint8Array ( t ) , e . _ _proto _ _ = u . prototype ) : ( null === e && ( e = new u ( t ) ) , e . length = t ) , e } function u ( e , t , n ) { if ( ! ( u . TYPED _ARRAY _SUPPORT || this instanceof u ) ) return new u ( e , t , n ) ; if ( "number" == typeof e ) { if ( "string" == typeof t ) throw new Error ( "If encoding is specified then the first argument must be a string" ) ; return f ( this , e ) } return c ( this , e , t , n ) } function c ( e , t , n , r ) { if ( "number" == typeof t ) throw new TypeError ( '"value" argument must not be a number' ) ; return "undefined" != typeof ArrayBuffer && t instanceof ArrayBuffer ? g ( e , t , n , r ) : "string" == typeof t ? d ( e , t , n ) : y ( e , t ) } function h ( e ) { if ( "number" != typeof e ) throw new TypeError ( '"size" argument must be a number' ) ; if ( e < 0 ) throw new RangeError ( '"size" argument must not be negative' ) } function p ( e , t , n , r ) { return h ( t ) , t <= 0 ? s ( e , t ) : void 0 !== n ? "string" == typeof r ? s ( e , t ) . fill ( n , r ) : s ( e , t ) . fill ( n ) : s ( e , t ) } function f ( e , t ) { if ( h ( t ) , e = s ( e , t < 0 ? 0 : 0 | v ( t ) ) , ! u . TYPED _ARRAY _SUPPORT ) for ( var n = 0 ; n < t ; ++ n ) e [ n ] = 0 ; return e } function d ( e , t , n ) { if ( "string" == typeof n && "" !== n || ( n = "utf8" ) , ! u . isEncoding ( n ) ) throw new TypeError ( '"encoding" must be a valid string encoding' ) ; var r = 0 | w ( t , n ) ; e = s ( e , r ) ; var i = e . write ( t , n ) ; return i !== r && ( e = e . slice ( 0 , i ) ) , e } function m ( e , t ) { var n = t . length < 0 ? 0 : 0 | v ( t . length ) ; e = s ( e , n ) ; for ( var r = 0 ; r < n ; r += 1 ) e [ r ] = 255 & t [ r ] ; return e } function g ( e , t , n , r ) { if ( t . byteLength , n < 0 || t . byteLength < n ) throw new RangeError ( "'offset' is out of bounds" ) ; if ( t . byteLength < n + ( r || 0 ) ) throw new RangeError ( "'length' is out of bounds" ) ; return t = void 0 === n && void 0 === r ? new Uint8Array ( t ) : void 0 === r ? new Uint8Array ( t , n ) : new Uint8Array ( t , n , r ) , u . TYPED _ARRAY _SUPPORT ? ( e = t , e . _ _proto _ _ = u . prototype ) : e = m ( e , t ) , e } function y ( e , t ) { if ( u . isBuffer ( t ) ) { var n = 0 | v ( t . length ) ; return e = s ( e , n ) , 0 === e . length ? e : ( t . copy ( e , 0 , 0 , n ) , e ) } if ( t ) { if ( "undefined" != typeof ArrayBuffer && t . buffer instanceof ArrayBuffer || "length" in t ) return "number" != typeof t . length || te ( t . length ) ? s ( e , 0 ) : m ( e , t ) ; if ( "Buffer" === t . type && o ( t . data ) ) return m ( e , t . data ) } throw new TypeError ( "First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object." ) } function v ( e ) { if ( e >= a ( ) ) throw new RangeError ( "Attempt to allocate Buffer larger than maximum size: 0x" + a ( ) . toString ( 16 ) + " bytes" ) ; return 0 | e } function b ( e ) { return + e != e && ( e = 0 ) , u . alloc ( + e ) } function w ( e , t ) { if ( u . isBuffer ( e ) ) return e . length ; if ( "undefined" != typeof ArrayBuffer && "function" == typeof ArrayBuffer . isView && ( ArrayBuffer . isView ( e ) || e instanceof ArrayBuffer ) ) return e . byteLength ; "string" != typeof e && ( e = "" + e ) ; var n = e . length ; if ( 0 === n ) return 0 ; for ( var r = ! 1 ; ; ) switch ( t ) { case "ascii" : case "latin1" : case "binary" : return n ; case "utf8" : case "utf-8" : case void 0 : return Z ( e ) . length ; case "ucs2" : case "ucs-2" : case "utf16le" : case "utf-16le" : return 2 * n ; case "hex" : return n >>> 1 ; case "base64" : return X ( e ) . length ; default : if ( r ) return Z ( e ) . length ; t = ( "" + t ) . toLowerCase ( ) , r = ! 0 } } function k ( e , t , n ) { var r = ! 1 ; if ( ( void 0 === t || t < 0 ) && ( t = 0 ) , t > this . length ) return "" ; if ( ( void 0 === n || n > this . length ) && ( n = this . length ) , n <= 0 ) return "" ; if ( n >>>= 0 , t >>>= 0 , n <= t ) return "" ; for ( e || ( e = "utf8" ) ; ; ) switch ( e ) { case "hex" : return D ( this , t , n ) ; case "utf8" : case "utf-8" : return O ( this , t , n ) ; case "ascii" : return N ( this , t , n ) ; case "latin1" : case "binary" : return R ( this , t , n ) ; case "base64" : return B ( this , t , n ) ; case "ucs2" : case "ucs-2" : case "utf16le" : case "utf-16le" : return M ( this , t , n ) ; default : if ( r ) throw new TypeError ( "Unknown encoding: " + e ) ; e = ( e + "" ) . toLowerCase ( ) , r = ! 0 } } function _ ( e , t , n ) { var r = e [ t ] ; e [ t ] = e [ n ] , e [ n ] = r } function x ( e , t , n , r , i ) { if ( 0 === e . length ) return - 1 ; if ( "string" == typeof n ? ( r = n , n = 0 ) : n > 2147483647 ? n = 2147483647 : n < - 2147483648 && ( n = - 2147483648 ) , n = + n , isNaN ( n ) && ( n = i ? 0 : e . length - 1 ) , n < 0 && ( n = e . length + n ) , n >= e . length ) { if ( i ) return - 1 ; n = e . length - 1 } else if ( n < 0 ) { if ( ! i ) return - 1 ; n = 0 } if ( "string" == typeof t && ( t = u . from ( t , r ) ) , u . isBuffer ( t ) ) return 0 === t . length ? - 1 : S ( e , t , n , r
/ * * P R O M I S I F Y C A L L B A C K - S T Y L E F U N C T I O N S T O E S 6 P R O M I S E S
*
* EXAMPLE :
* const fn = promisify ( ( callback ) => callback ( null , "Hello world!" ) ) ;
* fn ( ( err , str ) => console . log ( str ) ) ;
* fn ( ) . then ( ( str ) => console . log ( str ) ) ;
* //Both functions, will log 'Hello world!'
*
* Note : The function you pass , may have any arguments you want , but the latest
* have to be the callback , which you will call with : next ( err , value )
*
* @ param method : Function / Array / Map = The function ( s ) to promisify
* @ param options : Map =
* "context" ( default is function ) : The context which to apply the called function
* "replace" ( default is falsy ) : When passed an array / map , if to replace the original object
*
* @ return : A promise if passed a function , otherwise the object with the promises
*
* @ license : MIT
* @ version : 1.0 . 3
* @ author : Manuel Di Iorio
* * /
var r = function ( e , t ) { return function ( ) { var n = Array . prototype . slice . call ( arguments ) , r = n . length - 1 , i = n && n . length > 0 ? n [ r ] : null , o = "function" == typeof i ? i : null ; return o ? e . apply ( t , n ) : new Promise ( function ( r , i ) { n . push ( function ( e , t ) { if ( e ) return i ( e ) ; r ( t ) } ) , e . apply ( t , n ) } ) } } ; e . exports = function ( e , t ) { t = t || { } ; var n = Object . prototype . toString . call ( e ) ; if ( "[object Object]" === n || "[object Array]" === n ) { var i = t . replace ? e : { } ; for ( var o in e ) e . hasOwnProperty ( o ) && ( i [ o ] = r ( e [ o ] ) ) ; return i } return r ( e , t . context || e ) } } , function ( e , t ) { var n = e . exports = { } , r , i ; function o ( ) { throw new Error ( "setTimeout has not been defined" ) } function l ( ) { throw new Error ( "clearTimeout has not been defined" ) } function a ( e ) { if ( r === setTimeout ) return setTimeout ( e , 0 ) ; if ( ( r === o || ! r ) && setTimeout ) return r = setTimeout , setTimeout ( e , 0 ) ; try { return r ( e , 0 ) } catch ( t ) { try { return r . call ( null , e , 0 ) } catch ( t ) { return r . call ( this , e , 0 ) } } } function s ( e ) { if ( i === clearTimeout ) return clearTimeout ( e ) ; if ( ( i === l || ! i ) && clearTimeout ) return i = clearTimeout , clearTimeout ( e ) ; try { return i ( e ) } catch ( t ) { try { return i . call ( null , e ) } catch ( t ) { return i . call ( this , e ) } } } ! function ( ) { try { r = "function" == typeof setTimeout ? setTimeout : o } catch ( e ) { r = o } try { i = "function" == typeof clearTimeout ? clearTimeout : l } catch ( e ) { i = l } } ( ) ; var u = [ ] , c = ! 1 , h , p = - 1 ; function f ( ) { c && h && ( c = ! 1 , h . length ? u = h . concat ( u ) : p = - 1 , u . length && d ( ) ) } function d ( ) { if ( ! c ) { var e = a ( f ) ; c = ! 0 ; for ( var t = u . length ; t ; ) { for ( h = u , u = [ ] ; ++ p < t ; ) h && h [ p ] . run ( ) ; p = - 1 , t = u . length } h = null , c = ! 1 , s ( e ) } } function m ( e , t ) { this . fun = e , this . array = t } function g ( ) { } n . nextTick = function ( e ) { var t = new Array ( arguments . length - 1 ) ; if ( arguments . length > 1 ) for ( var n = 1 ; n < arguments . length ; n ++ ) t [ n - 1 ] = arguments [ n ] ; u . push ( new m ( e , t ) ) , 1 !== u . length || c || a ( d ) } , m . prototype . run = function ( ) { this . fun . apply ( null , this . array ) } , n . title = "browser" , n . browser = ! 0 , n . env = { } , n . argv = [ ] , n . version = "" , n . versions = { } , n . on = g , n . addListener = g , n . once = g , n . off = g , n . removeListener = g , n . removeAllListeners = g , n . emit = g , n . prependListener = g , n . prependOnceListener = g , n . listeners = function ( e ) { return [ ] } , n . binding = function ( e ) { throw new Error ( "process.binding is not supported" ) } , n . cwd = function ( ) { return "/" } , n . chdir = function ( e ) { throw new Error ( "process.chdir is not supported" ) } , n . umask = function ( ) { return 0 } } , function ( e , t ) { "function" == typeof Object . create ? e . exports = function e ( t , n ) { n && ( t . super _ = n , t . prototype = Object . create ( n . prototype , { constructor : { value : t , enumerable : ! 1 , writable : ! 0 , configurable : ! 0 } } ) ) } : e . exports = function e ( t , n ) { if ( n ) { t . super _ = n ; var r = function ( ) { } ; r . prototype = n . prototype , t . prototype = new r , t . prototype . constructor = t } } } , function ( e , t , n ) { "use strict" ; const r = n ( 243 ) , i = n ( 244 ) , o = n ( 29 ) ; e . exports = ( e => { const t = r ( ) ; if ( "function" == typeof e ) return e ; if ( "object" == typeof e ) return i ( e ) ; if ( "string" == typeof e ) { const n = o ( e ) . nodeAddress ( ) ; return t . host = n . address , t . port = n . port , i ( t ) } throw new Error ( "Argument must be a send function or a config object." ) } ) } , function ( e , t , n ) { t = e . exports = n ( 184 ) , t . Stream = t , t . Readable = t , t . Writable = n ( 188 ) , t . Duplex = n ( 53 ) , t . Transform = n ( 189 ) , t . PassThrough = n ( 356 ) , t . finished = n ( 117 ) , t . pipeline = n ( 357 ) } , function ( e , t , n ) { "use strict" ; ( function ( t ) { const r = n ( 25 ) , i = n ( 91 ) , o = n ( 66 ) , l = n ( 120 ) , a = n ( 382 ) , s = n ( 54 ) ; class u { constructor ( e , n , l , a ) { if ( c . isCID ( e ) ) { const n = e ; return this . version = n . version , this . codec = n . codec , this . multihash = t . from ( n . multihash ) , void ( this . multibaseName = n . multibaseName || ( 0 === n . version ? "base58btc" : "base32" ) ) } if ( "string" == typeof e ) { const t = i . isEncoded ( e ) ; if ( t ) { const n = i . decode ( e ) ; this . version = parseInt ( n . slice ( 0 , 1 ) . toString ( "hex" ) , 16 ) , this . codec = o . getCodec ( n . slice ( 1 ) ) , this . multihash = o . rmPrefix ( n . slice ( 1 ) ) , this . multibaseName = t } else this . version = 0 , this . codec = "dag-pb" , this . multihash = r . fromB58String ( e ) , this . multibaseName = "base58btc" ; return u . validateCID ( this ) , void Object . defineProperty ( this , "string" , { value : e } ) } if ( t . isBuffer ( e ) ) { const t = e . slice ( 0 , 1 ) , n = parseInt ( t . toString ( "hex" ) , 16 ) ; if ( 1 === n ) { const t = e ; this . version = n , this . codec = o . getCodec ( t . slice ( 1 ) ) , this . multihash = o . rmPrefix ( t . slice ( 1 ) ) , this . multibaseName = "base32" } else this . version = 0 , this . codec = "dag-pb" , this . multihash = e , this . multibaseName = "base58btc" ; u . validateCID ( this ) } else this . version = e , this . codec = n , this . multihash = l , this . multibaseNam
/ * !
* The buffer module from node . js , for the browser .
*
* @ author Feross Aboukhadijeh < feross @ feross . org > < http : //feross.org>
* @ license MIT
* /function i(e,t){if(e===t)return 0;for(var n=e.length,r=t.length,i=0,o=Math.min(n,r);i<o;++i)if(e[i]!==t[i]){n=e[i],r=t[i];break}return n<r?-1:r<n?1:0}function o(e){return t.Buffer&&"function"==typeof t.Buffer.isBuffer?t.Buffer.isBuffer(e):!(null==e||!e._isBuffer)}var l=n(7),a=Object.prototype.hasOwnProperty,s=Array.prototype.slice,u="foo"===function e(){}.name;function c(e){return Object.prototype.toString.call(e)}function h(e){return!o(e)&&("function"==typeof t.ArrayBuffer&&("function"==typeof ArrayBuffer.isView?ArrayBuffer.isView(e):!!e&&(e instanceof DataView||!!(e.buffer&&e.buffer instanceof ArrayBuffer))))}var p=e.exports=b,f=/ \ s * function \ s + ( [ ^ \ ( \ s ] * ) \ s * / ; f u n c t i o n d ( e ) { i f ( l . i s F u n c t i o n ( e ) ) { i f ( u ) r e t u r n e . n a m e ; v a r t = e . t o S t r i n g ( ) , n = t . m a t c h ( f ) ; r e t u r n n & & n [ 1 ] } } f u n c t i o n m ( e , t ) { r e t u r n " s t r i n g " = = t y p e o f e ? e . l e n g t h < t ? e : e . s l i c e ( 0 , t ) : e } f u n c t i o n g ( e ) { i f ( u | | ! l . i s F u n c t i o n ( e ) ) r e t u r n l . i n s p e c t ( e ) ; v a r t = d ( e ) , n = t ? " : " + t : " " ; r e t u r n " [ F u n c t i o n " + n + " ] " } f u n c t i o n y ( e ) { r e t u r n m ( g ( e . a c t u a l ) , 1 2 8 ) + " " + e . o p e r a t o r + " " + m ( g ( e . e x p e c t e d ) , 1 2 8 ) } f u n c t i o n v ( e , t , n , r , i ) { t h r o w n e w p . A s s e r t i o n E r r o r ( { m e s s a g e : n , a c t u a l : e , e x p e c t e d : t , o p e r a t o r : r , s t a c k S t a r t F u n c t i o n : i } ) } f u n c t i o n b ( e , t ) { e | | v ( e , ! 0 , t , " = = " , p . o k ) } f u n c t i o n w ( e , t , n , r ) { i f ( e = = = t ) r e t u r n ! 0 ; i f ( o ( e ) & & o ( t ) ) r e t u r n 0 = = = i ( e , t ) ; i f ( l . i s D a t e ( e ) & & l . i s D a t e ( t ) ) r e t u r n e . g e t T i m e ( ) = = = t . g e t T i m e ( ) ; i f ( l . i s R e g E x p ( e ) & & l . i s R e g E x p ( t ) ) r e t u r n e . s o u r c e = = = t . s o u r c e & & e . g l o b a l = = = t . g l o b a l & & e . m u l t i l i n e = = = t . m u l t i l i n e & & e . l a s t I n d e x = = = t . l a s t I n d e x & & e . i g n o r e C a s e = = = t . i g n o r e C a s e ; i f ( n u l l ! = = e & & " o b j e c t " = = t y p e o f e | | n u l l ! = = t & & " o b j e c t " = = t y p e o f t ) { i f ( h ( e ) & & h ( t ) & & c ( e ) = = = c ( t ) & & ! ( e i n s t a n c e o f F l o a t 3 2 A r r a y | | e i n s t a n c e o f F l o a t 6 4 A r r a y ) ) r e t u r n 0 = = = i ( n e w U i n t 8 A r r a y ( e . b u f f e r ) , n e w U i n t 8 A r r a y ( t . b u f f e r ) ) ; i f ( o ( e ) ! = = o ( t ) ) r e t u r n ! 1 ; r = r | | { a c t u a l : [ ] , e x p e c t e d : [ ] } ; v a r a = r . a c t u a l . i n d e x O f ( e ) ; r e t u r n - 1 ! = = a & & a = = = r . e x p e c t e d . i n d e x O f ( t ) | | ( r . a c t u a l . p u s h ( e ) , r . e x p e c t e d . p u s h ( t ) , _ ( e , t , n , r ) ) } r e t u r n n ? e = = = t : e = = t } f u n c t i o n k ( e ) { r e t u r n " [ o b j e c t A r g u m e n t s ] " = = O b j e c t . p r o t o t y p e . t o S t r i n g . c a l l ( e ) } f u n c t i o n _ ( e , t , n , r ) { i f ( n u l l = = = e | | v o i d 0 = = = e | | n u l l = = = t | | v o i d 0 = = = t ) r e t u r n ! 1 ; i f ( l . i s P r i m i t i v e ( e ) | | l . i s P r i m i t i v e ( t ) ) r e t u r n e = = = t ; i f ( n & & O b j e c t . g e t P r o t o t y p e O f ( e ) ! = = O b j e c t . g e t P r o t o t y p e O f ( t ) ) r e t u r n ! 1 ; v a r i = k ( e ) , o = k ( t ) ; i f ( i & & ! o | | ! i & & o ) r e t u r n ! 1 ; i f ( i ) r e t u r n e = s . c a l l ( e ) , t = s . c a l l ( t ) , w ( e , t , n ) ; v a r a = C ( e ) , u = C ( t ) , c , h ; i f ( a . l e n g t h ! = = u . l e n g t h ) r e t u r n ! 1 ; f o r ( a . s o r t ( ) , u . s o r t ( ) , h = a . l e n g t h - 1 ; h > = 0 ; h - - ) i f ( a [ h ] ! = = u [ h ] ) r e t u r n ! 1 ; f o r ( h = a . l e n g t h - 1 ; h > = 0 ; h - - ) i f ( c = a [ h ] , ! w ( e [ c ] , t [ c ] , n , r ) ) r e t u r n ! 1 ; r e t u r n ! 0 } f u n c t i o n x ( e , t , n ) { w ( e , t , ! 0 ) & & v ( e , t , n , " n o t D e e p S t r i c t E q u a l " , x ) } f u n c t i o n S ( e , t ) { i f ( ! e | | ! t ) r e t u r n ! 1 ; i f ( " [ o b j e c t R e g E x p ] " = = O b j e c t . p r o t o t y p e . t o S t r i n g . c a l l ( t ) ) r e t u r n t . t e s t ( e ) ; t r y { i f ( e i n s t a n c e o f t ) r e t u r n ! 0 } c a t c h ( e ) { } r e t u r n ! E r r o r . i s P r o t o t y p e O f ( t ) & & ! 0 = = = t . c a l l ( { } , e ) } f u n c t i o n E ( e ) { v a r t ; t r y { e ( ) } c a t c h ( e ) { t = e } r e t u r n t } f u n c t i o n j ( e , t , n , r ) { v a r i ; i f ( " f u n c t i o n " ! = t y p e o f t ) t h r o w n e w T y p e E r r o r ( ' " b l o c k " a r g u m e n t m u s t b e a f u n c t i o n ' ) ; " s t r i n g " = = t y p e o f n & & ( r = n , n = n u l l ) , i = E ( t ) , r = ( n & & n . n a m e ? " ( " + n . n a m e + " ) . " : " . " ) + ( r ? " " + r : " . " ) , e & & ! i & & v ( i , n , " M i s s i n g e x p e c t e d e x c e p t i o n " + r ) ; v a r o = " s t r i n g " = = t y p e o f r , a = ! e & & l . i s E r r o r ( i ) , s = ! e & & i & & ! n ; i f ( ( a & & o & & S ( i , n ) | | s ) & & v ( i , n , " G o t u n w a n t e d e x c e p t i o n " + r ) , e & & i & & n & & ! S ( i , n ) | | ! e & & i ) t h r o w i } f u n c t i o n A ( e , t ) { e | | v ( e , ! 0 , t , " = = " , A ) } p . A s s e r t i o n E r r o r = f u n c t i o n e ( t ) { t h i s . n a m e = " A s s e r t i o n E r r o r " , t h i s . a c t u a l = t . a c t u a l , t h i s . e x p e c t e d = t . e x p e c t e d , t h i s . o p e r a t o r = t . o p e r a t o r , t . m e s s a g e ? ( t h i s . m e s s a g e = t . m e s s a g e , t h i s . g e n e r a t e d M e s s a g e = ! 1 ) : ( t h i s . m e s s a g e = y ( t h i s ) , t h i s . g e n e r a t e d M e s s a g e = ! 0 ) ; v a r n = t . s t a c k S t a r t F u n c t i o n | | v ; i f ( E r r o r . c a p t u r e S t a c k T r a c e ) E r r o r . c a p t u r e S t a c k T r a c e ( t h i s , n ) ; e l s e { v a r r = n e w E r r o r ; i f ( r . s t a c k ) { v a r i = r . s t a c k , o = d ( n ) , l = i . i n d e x O f ( " \ n " + o ) ; i f ( l > = 0 ) { v a r a = i . i n d e x O f ( " \ n " , l + 1 ) ; i = i . s u b s t r i n g ( a + 1 ) } t h i s . s t a c k = i } } } , l . i n h e r i t s ( p . A s s e r t i o n E r r o r , E r r o r ) , p . f a i l = v , p . o k = b , p . e q u a l = f u n c t i o n e ( t , n , r ) { t ! = n & & v ( t , n , r , " = = " , p . e q u a l ) } , p . n o t E q u a l = f u n c t i o n e ( t , n , r ) { t = = n & & v ( t , n , r , " ! = " , p . n o t E q u a l ) } , p . d e e p E q u a l = f u n c t i o n e ( t , n , r ) { w ( t , n , ! 1 ) | | v ( t , n , r , " d e e p E q u a l " , p . d e e p E q u a l ) } , p . d e e p S t r i c t E q u a l = f u n c t i o n e ( t , n , r ) { w ( t , n , ! 0 ) | | v ( t , n , r , " d e e p S t r i c t E q u a l " , p . d e e p S t r i c t E q u a l ) } , p . n o t D e e p E q u a l = f u n c t i o n e ( t , n , r ) { w ( t , n , ! 1 ) & & v ( t , n , r , " n o t D e e p E q u a l " , p . n o t D e e p E q u a l ) } , p . n o t D e e p S t r i c t E q u a l = x , p . s t r i c t E q u a l = f u n c t i o n e (
/ * *
* [ js - sha3 ] { @ link https : //github.com/emn178/js-sha3}
*
* @ version 0.8 . 0
* @ author Chen , Yi - Cyuan [ emn178 @ gmail . com ]
* @ copyright Chen , Yi - Cyuan 2015 - 2018
* @ license MIT
* /
/ * *
* [ js - sha3 ] { @ link https : //github.com/emn178/js-sha3}
*
* @ version 0.8 . 0
* @ author Chen , Yi - Cyuan [ emn178 @ gmail . com ]
* @ copyright Chen , Yi - Cyuan 2015 - 2018
* @ license MIT
* /
! function ( ) { "use strict" ; var l = "input is invalid type" , a = "finalize already called" , s = "object" == typeof window , u = s ? window : { } ; u . JS _SHA3 _NO _WINDOW && ( s = ! 1 ) ; var c = ! s && "object" == typeof self , h = ! u . JS _SHA3 _NO _NODE _JS && "object" == typeof r && r . versions && r . versions . node ; h ? u = i : c && ( u = self ) ; var p = ! u . JS _SHA3 _NO _COMMON _JS && "object" == typeof e && e . exports , f = n ( 190 ) , d = ! u . JS _SHA3 _NO _ARRAY _BUFFER && "undefined" != typeof ArrayBuffer , m = "0123456789abcdef" . split ( "" ) , g = [ 31 , 7936 , 2031616 , 520093696 ] , y = [ 4 , 1024 , 262144 , 67108864 ] , v = [ 1 , 256 , 65536 , 16777216 ] , b = [ 6 , 1536 , 393216 , 100663296 ] , w = [ 0 , 8 , 16 , 24 ] , k = [ 1 , 0 , 32898 , 0 , 32906 , 2147483648 , 2147516416 , 2147483648 , 32907 , 0 , 2147483649 , 0 , 2147516545 , 2147483648 , 32777 , 2147483648 , 138 , 0 , 136 , 0 , 2147516425 , 0 , 2147483658 , 0 , 2147516555 , 0 , 139 , 2147483648 , 32905 , 2147483648 , 32771 , 2147483648 , 32770 , 2147483648 , 128 , 2147483648 , 32778 , 0 , 2147483658 , 2147483648 , 2147516545 , 2147483648 , 32896 , 2147483648 , 2147483649 , 0 , 2147516424 , 2147483648 ] , _ = [ 224 , 256 , 384 , 512 ] , x = [ 128 , 256 ] , S = [ "hex" , "buffer" , "arrayBuffer" , "array" , "digest" ] , E = { 128 : 168 , 256 : 136 } ; ! u . JS _SHA3 _NO _NODE _JS && Array . isArray || ( Array . isArray = function ( e ) { return "[object Array]" === Object . prototype . toString . call ( e ) } ) , ! d || ! u . JS _SHA3 _NO _ARRAY _BUFFER _IS _VIEW && ArrayBuffer . isView || ( ArrayBuffer . isView = function ( e ) { return "object" == typeof e && e . buffer && e . buffer . constructor === ArrayBuffer } ) ; for ( var j = function ( e , t , n ) { return function ( r ) { return new H ( e , t , e ) . update ( r ) [ n ] ( ) } } , A = function ( e , t , n ) { return function ( r , i ) { return new H ( e , t , i ) . update ( r ) [ n ] ( ) } } , C = function ( e , t , n ) { return function ( t , r , i , o ) { return R [ "cshake" + e ] . update ( t , r , i , o ) [ n ] ( ) } } , T = function ( e , t , n ) { return function ( t , r , i , o ) { return R [ "kmac" + e ] . update ( t , r , i , o ) [ n ] ( ) } } , I = function ( e , t , n , r ) { for ( var i = 0 ; i < S . length ; ++ i ) { var o = S [ i ] ; e [ o ] = t ( n , r , o ) } return e } , B = function ( e , t ) { var n = j ( e , t , "hex" ) ; return n . create = function ( ) { return new H ( e , t , e ) } , n . update = function ( e ) { return n . create ( ) . update ( e ) } , I ( n , j , e , t ) } , O = function ( e , t ) { var n = A ( e , t , "hex" ) ; return n . create = function ( n ) { return new H ( e , t , n ) } , n . update = function ( e , t ) { return n . create ( t ) . update ( e ) } , I ( n , A , e , t ) } , P = function ( e , t ) { var n = E [ e ] , r = C ( e , t , "hex" ) ; return r . create = function ( r , i , o ) { return i || o ? new H ( e , t , r ) . bytepad ( [ i , o ] , n ) : R [ "shake" + e ] . create ( r ) } , r . update = function ( e , t , n , i ) { return r . create ( t , n , i ) . update ( e ) } , I ( r , C , e , t ) } , F = function ( e , t ) { var n = E [ e ] , r = T ( e , t , "hex" ) ; return r . create = function ( r , i , o ) { return new V ( e , t , i ) . bytepad ( [ "KMAC" , o ] , n ) . bytepad ( [ r ] , n ) } , r . update = function ( e , t , n , i ) { return r . create ( e , n , i ) . update ( t ) } , I ( r , T , e , t ) } , N = [ { name : "keccak" , padding : v , bits : _ , createMethod : B } , { name : "sha3" , padding : b , bits : _ , createMethod : B } , { name : "shake" , padding : g , bits : x , createMethod : O } , { name : "cshake" , padding : y , bits : x , createMethod : P } , { name : "kmac" , padding : y , bits : x , createMethod : F } ] , R = { } , D = [ ] , M = 0 ; M < N . length ; ++ M ) for ( var L = N [ M ] , z = L . bits , U = 0 ; U < z . length ; ++ U ) { var q = L . name + "_" + z [ U ] ; if ( D . push ( q ) , R [ q ] = L . createMethod ( z [ U ] , L . padding ) , "sha3" !== L . name ) { var K = L . name + z [ U ] ; D . push ( K ) , R [ K ] = R [ q ] } } function H ( e , t , n ) { this . blocks = [ ] , this . s = [ ] , this . padding = t , this . outputBits = n , this . reset = ! 0 , this . finalized = ! 1 , this . block = 0 , this . start = 0 , this . blockCount = 1600 - ( e << 1 ) >> 5 , this . byteCount = this . blockCount << 2 , this . outputBlocks = n >> 5 , this . extraBytes = ( 31 & n ) >> 3 ; for ( var r = 0 ; r < 50 ; ++ r ) this . s [ r ] = 0 } function V ( e , t , n ) { H . call ( this , e , t , n ) } H . prototype . update = function ( e ) { if ( this . finalized ) throw new Error ( a ) ; var t , n = typeof e ; if ( "string" !== n ) { if ( "object" !== n ) throw new Error ( l ) ; if ( null === e ) throw new Error ( l ) ; if ( d && e . constructor === ArrayBuffer ) e = new Uint8Array ( e ) ; else if ( ! ( Array . isArray ( e ) || d && ArrayBuffer . isView ( e ) ) ) throw new Error ( l ) ; t = ! 0 } for ( var r = this . blocks , i = this . byteCount , o = e . length , s = this . blockCount , u = 0 , c = this . s , h , p ; u < o ; ) { if ( this . reset ) for ( this . reset = ! 1 , r [ 0 ] = this . block , h = 1 ; h < s + 1 ; ++ h ) r [ h ] = 0 ; if ( t ) for ( h = this . start ; u < o && h < i ; ++ u ) r [ h >> 2 ] |= e [ u ] << w [ 3 & h ++ ] ; else for ( h = this . start ; u < o && h < i ; ++ u ) p = e . charCodeAt ( u ) , p < 128 ? r [ h >> 2 ] |= p << w [ 3 & h ++ ] : p < 2048 ? ( r [ h >> 2 ] |= ( 192 | p >> 6 ) << w [ 3 & h ++ ] , r [ h >> 2 ] |= ( 128 | 63 & p ) << w [ 3 & h ++ ] ) : p < 55296 || p >= 57344 ? ( r [ h >> 2 ] |= ( 224 | p >> 12 ) << w [ 3 & h ++ ] , r [ h >> 2 ] |= ( 128 | p >> 6 & 63 ) << w [ 3 & h ++ ] , r [ h >> 2 ] |= ( 128 | 63 & p ) << w [ 3 & h ++ ] ) : ( p = 65536 + ( ( 1023 & p ) << 10 | 1023 & e . charCodeAt ( ++ u ) ) , r [ h >> 2 ] |= ( 240 | p >> 18 ) << w [ 3 & h ++ ] , r [ h >> 2 ] |= ( 128 | p >> 12 & 63 ) << w [ 3 & h ++ ] , r [ h >> 2 ] |= ( 128 |
/ * !
* Copyright ( c ) 2018 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* /var r=n(271);function i(e){return r.get(e)}t.getPublicSuffix=i},function(e,t,n){"use strict";var r=n(85),i={};i.rules=n(713).map(function(e){return{rule:e,suffix:e.replace(/ ^ ( \ * \ . | \ ! ) / , "" ) , punySuffix : - 1 , wildcard : "*" === e . charAt ( 0 ) , exception : "!" === e . charAt ( 0 ) } } ) , i . endsWith = function ( e , t ) { return - 1 !== e . indexOf ( t , e . length - t . length ) } , i . findRule = function ( e ) { var t = r . toASCII ( e ) ; return i . rules . reduce ( function ( e , n ) { return - 1 === n . punySuffix && ( n . punySuffix = r . toASCII ( n . suffix ) ) , i . endsWith ( t , "." + n . punySuffix ) || t === n . punySuffix ? n : e } , null ) } , t . errorCodes = { DOMAIN _TOO _SHORT : "Domain name too short." , DOMAIN _TOO _LONG : "Domain name too long. It should be no more than 255 chars." , LABEL _STARTS _WITH _DASH : "Domain name label can not start with a dash." , LABEL _ENDS _WITH _DASH : "Domain name label can not end with a dash." , LABEL _TOO _LONG : "Domain name label should be at most 63 chars long." , LABEL _TOO _SHORT : "Domain name label should be at least 1 character long." , LABEL _INVALID _CHARS : "Domain name label can only contain alphanumeric characters or dashes." } , i . validate = function ( e ) { var t = r . toASCII ( e ) ; if ( t . length < 1 ) return "DOMAIN_TOO_SHORT" ; if ( t . length > 255 ) return "DOMAIN_TOO_LONG" ; for ( var n = t . split ( "." ) , i , o = 0 ; o < n . length ; ++ o ) { if ( i = n [ o ] , ! i . length ) return "LABEL_TOO_SHORT" ; if ( i . length > 63 ) return "LABEL_TOO_LONG" ; if ( "-" === i . charAt ( 0 ) ) return "LABEL_STARTS_WITH_DASH" ; if ( "-" === i . charAt ( i . length - 1 ) ) return "LABEL_ENDS_WITH_DASH" ; if ( ! /^[a-z0-9\-]+$/ . test ( i ) ) return "LABEL_INVALID_CHARS" } } , t . parse = function ( e ) { if ( "string" != typeof e ) throw new TypeError ( "Domain name must be a string." ) ; var n = e . slice ( 0 ) . toLowerCase ( ) ; "." === n . charAt ( n . length - 1 ) && ( n = n . slice ( 0 , n . length - 1 ) ) ; var o = i . validate ( n ) ; if ( o ) return { input : e , error : { message : t . errorCodes [ o ] , code : o } } ; var l = { input : e , tld : null , sld : null , domain : null , subdomain : null , listed : ! 1 } , a = n . split ( "." ) ; if ( "local" === a [ a . length - 1 ] ) return l ; var s = function ( ) { return /xn--/ . test ( n ) ? ( l . domain && ( l . domain = r . toASCII ( l . domain ) ) , l . subdomain && ( l . subdomain = r . toASCII ( l . subdomain ) ) , l ) : l } , u = i . findRule ( n ) ; if ( ! u ) return a . length < 2 ? l : ( l . tld = a . pop ( ) , l . sld = a . pop ( ) , l . domain = [ l . sld , l . tld ] . join ( "." ) , a . length && ( l . subdomain = a . pop ( ) ) , s ( ) ) ; l . listed = ! 0 ; var c = u . suffix . split ( "." ) , h = a . slice ( 0 , a . length - c . length ) ; return u . exception && h . push ( c . shift ( ) ) , l . tld = c . join ( "." ) , h . length ? ( u . wildcard && ( c . unshift ( h . pop ( ) ) , l . tld = c . join ( "." ) ) , h . length ? ( l . sld = h . pop ( ) , l . domain = [ l . sld , l . tld ] . join ( "." ) , h . length && ( l . subdomain = h . join ( "." ) ) , s ( ) ) : s ( ) ) : s ( ) } , t . get = function ( e ) { return e && t . parse ( e ) . domain || null } , t . isValid = function ( e ) { var n = t . parse ( e ) ; return Boolean ( n . domain && n . listed ) } } , function ( e , t , n ) { "use strict" ;
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* / f u n c t i o n r ( ) { } t . S t o r e = r , r . p r o t o t y p e . s y n c h r o n o u s = ! 1 , r . p r o t o t y p e . f i n d C o o k i e = f u n c t i o n ( e , t , n , r ) { t h r o w n e w E r r o r ( " f i n d C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . f i n d C o o k i e s = f u n c t i o n ( e , t , n ) { t h r o w n e w E r r o r ( " f i n d C o o k i e s i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . p u t C o o k i e = f u n c t i o n ( e , t ) { t h r o w n e w E r r o r ( " p u t C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . u p d a t e C o o k i e = f u n c t i o n ( e , t , n ) { t h r o w n e w E r r o r ( " u p d a t e C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . r e m o v e C o o k i e = f u n c t i o n ( e , t , n , r ) { t h r o w n e w E r r o r ( " r e m o v e C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . r e m o v e C o o k i e s = f u n c t i o n ( e , t , n ) { t h r o w n e w E r r o r ( " r e m o v e C o o k i e s i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . g e t A l l C o o k i e s = f u n c t i o n ( e ) { t h r o w n e w E r r o r ( " g e t A l l C o o k i e s i s n o t i m p l e m e n t e d ( t h e r e f o r e j a r c a n n o t b e s e r i a l i z e d ) " ) } } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ;
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* / v a r r = n ( 2 7 0 ) ; f u n c t i o n i ( e ) { v a r t = r . g e t P u b l i c S u f f i x ( e ) ; i f ( ! t ) r e t u r n n u l l ; i f ( t = = e ) r e t u r n [ e ] ; f o r ( v a r n = e . s l i c e ( 0 , - ( t . l e n g t h + 1 ) ) , i = n . s p l i t ( " . " ) . r e v e r s e ( ) , o = t , l = [ o ] ; i . l e n g t h ; ) o = i . s h i f t ( ) + " . " + o , l . p u s h ( o ) ; r e t u r n l } t . p e r m u t e D o m a i n = i } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ;
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* /function r(e,t){if(t===e)return!0;var n=e.indexOf(t);if(0===n){if("/ "===t.substr(-1))return!0;if(" / "===e.substr(t.length,1))return!0}return!1}t.pathMatch=r},function(e,t,n){(function(e){t.fetch=a(e.fetch)&&a(e.ReadableStream),t.writableStream=a(e.WritableStream),t.abortController=a(e.AbortController),t.blobConstructor=!1;try{new Blob([new ArrayBuffer(1)]),t.blobConstructor=!0}catch(e){}var n;function r(){if(void 0!==n)return n;if(e.XMLHttpRequest){n=new e.XMLHttpRequest;try{n.open(" GET ",e.XDomainRequest?" / ":" https : //example.com")}catch(e){n=null}}else n=null;return n}function i(e){var t=r();if(!t)return!1;try{return t.responseType=e,t.responseType===e}catch(e){}return!1}var o=void 0!==e.ArrayBuffer,l=o&&a(e.ArrayBuffer.prototype.slice);function a(e){return"function"==typeof e}t.arraybuffer=t.fetch||o&&i("arraybuffer"),t.msstream=!t.fetch&&l&&i("ms-stream"),t.mozchunkedarraybuffer=!t.fetch&&o&&i("moz-chunked-arraybuffer"),t.overrideMimeType=t.fetch||!!r()&&a(r().overrideMimeType),t.vbArray=a(e.VBArray),n=null}).call(this,n(11))},function(e,t){"function"==typeof Object.create?e.exports=function e(t,n){n&&(t.super_=n,t.prototype=Object.create(n.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}))}:e.exports=function e(t,n){if(n){t.super_=n;var r=function(){};r.prototype=n.prototype,t.prototype=new r,t.prototype.constructor=t}}},function(e,t,n){(function(e,r,i){var o=n(275),l=n(276),a=n(278),s=t.readyStates={UNSENT:0,OPENED:1,HEADERS_RECEIVED:2,LOADING:3,DONE:4},u=t.IncomingMessage=function(t,n,l,s){var u=this;if(a.Readable.call(u),u._mode=l,u.headers={},u.rawHeaders=[],u.trailers={},u.rawTrailers=[],u.on("end",function(){e.nextTick(function(){u.emit("close")})}),"fetch"===l){if(u._fetchResponse=n,u.url=n.url,u.statusCode=n.status,u.statusMessage=n.statusText,n.headers.forEach(function(e,t){u.headers[t.toLowerCase()]=e,u.rawHeaders.push(t,e)}),o.writableStream){var c=new WritableStream({write:function(e){return new Promise(function(t,n){u._destroyed?n():u.push(new r(e))?t():u._resumeFetch=t})},close:function(){i.clearTimeout(s),u._destroyed||u.push(null)},abort:function(e){u._destroyed||u.emit("error",e)}});try{return void n.body.pipeTo(c).catch(function(e){i.clearTimeout(s),u._destroyed||u.emit("error",e)})}catch(e){}}var h=n.body.getReader();function p(){h.read().then(function(e){if(!u._destroyed){if(e.done)return i.clearTimeout(s),void u.push(null);u.push(new r(e.value)),p()}}).catch(function(e){i.clearTimeout(s),u._destroyed||u.emit("error",e)})}p()}else{u._xhr=t,u._pos=0,u.url=t.responseURL,u.statusCode=t.status,u.statusMessage=t.statusText;var f=t.getAllResponseHeaders().split(/\r?\n/);if(f.forEach(function(e){var t=e.match(/^([^:]+):\s*(.*)/);if(t){var n=t[1].toLowerCase();"set-cookie"===n?(void 0===u.headers[n]&&(u.headers[n]=[]),u.headers[n].push(t[2])):void 0!==u.headers[n]?u.headers[n]+=", "+t[2]:u.headers[n]=t[2],u.rawHeaders.push(t[1],t[2])}}),u._charset="x-user-defined",!o.overrideMimeType){var d=u.rawHeaders["mime-type"];if(d){var m=d.match(/;\s*charset=([^;])(;|$)/);m&&(u._charset=m[1].toLowerCase())}u._charset||(u._charset="utf-8")}}};l(u,a.Readable),u.prototype._read=function(){var e=this,t=this._resumeFetch;t&&(this._resumeFetch=null,t())},u.prototype._onXHRProgress=function(){var e=this,t=e._xhr,n=null;switch(e._mode){case"text:vbarray":if(t.readyState!==s.DONE)break;try{n=new i.VBArray(t.responseBody).toArray()}catch(e){}if(null!==n){e.push(new r(n));break}case"text":try{n=t.responseText}catch(t){e._mode="text:vbarray";break}if(n.length>e._pos){var o=n.substr(e._pos);if("x-user-defined"===e._charset){for(var l=new r(o.length),a=0;a<o.length;a++)l[a]=255&o.charCodeAt(a);e.push(l)}else e.push(o,e._charset);e._pos=n.length}break;case"arraybuffer":if(t.readyState!==s.DONE||!t.response)break;n=t.response,e.push(new r(new Uint8Array(n)));break;case"moz-chunked-arraybuffer":if(n=t.response,t.readyState!==s.LOADING||!n)break;e.push(new r(new Uint8Array(n)));break;case"ms-stream":if(n=t.response,t.readyState!==s.LOADING)break;var u=new i.MSStreamReader;u.onprogress=function(){u.result
/ * !
* Copyright ( c ) 2018 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* / v a r r = n ( 2 7 1 ) ; f u n c t i o n i ( e ) { r e t u r n r . g e t ( e ) } t . g e t P u b l i c S u f f i x = i } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ;
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* / f u n c t i o n r ( ) { } t . S t o r e = r , r . p r o t o t y p e . s y n c h r o n o u s = ! 1 , r . p r o t o t y p e . f i n d C o o k i e = f u n c t i o n ( e , t , n , r ) { t h r o w n e w E r r o r ( " f i n d C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . f i n d C o o k i e s = f u n c t i o n ( e , t , n ) { t h r o w n e w E r r o r ( " f i n d C o o k i e s i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . p u t C o o k i e = f u n c t i o n ( e , t ) { t h r o w n e w E r r o r ( " p u t C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . u p d a t e C o o k i e = f u n c t i o n ( e , t , n ) { t h r o w n e w E r r o r ( " u p d a t e C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . r e m o v e C o o k i e = f u n c t i o n ( e , t , n , r ) { t h r o w n e w E r r o r ( " r e m o v e C o o k i e i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . r e m o v e C o o k i e s = f u n c t i o n ( e , t , n ) { t h r o w n e w E r r o r ( " r e m o v e C o o k i e s i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . r e m o v e A l l C o o k i e s = f u n c t i o n ( e ) { t h r o w n e w E r r o r ( " r e m o v e A l l C o o k i e s i s n o t i m p l e m e n t e d " ) } , r . p r o t o t y p e . g e t A l l C o o k i e s = f u n c t i o n ( e ) { t h r o w n e w E r r o r ( " g e t A l l C o o k i e s i s n o t i m p l e m e n t e d ( t h e r e f o r e j a r c a n n o t b e s e r i a l i z e d ) " ) } } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ;
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* / v a r r = n ( 3 0 5 ) ; f u n c t i o n i ( e ) { v a r t = r . g e t P u b l i c S u f f i x ( e ) ; i f ( ! t ) r e t u r n n u l l ; i f ( t = = e ) r e t u r n [ e ] ; f o r ( v a r n = e . s l i c e ( 0 , - ( t . l e n g t h + 1 ) ) , i = n . s p l i t ( " . " ) . r e v e r s e ( ) , o = t , l = [ o ] ; i . l e n g t h ; ) o = i . s h i f t ( ) + " . " + o , l . p u s h ( o ) ; r e t u r n l } t . p e r m u t e D o m a i n = i } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ;
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* /function r(e,t){if(t===e)return!0;var n=e.indexOf(t);if(0===n){if("/ "===t.substr(-1))return!0;if(" / "===e.substr(t.length,1))return!0}return!1}t.pathMatch=r},function(e,t,n){const r=n(44);n(350),n(358),n(673),n(709),n(710),n(875)," undefined "!=typeof window&&(window.DwebTransports=r),t=e.exports=r},function(e,t,n){" use strict ";e.exports={isString:function(e){return" string "==typeof e},isObject:function(e){return" object "==typeof e&&null!==e},isNull:function(e){return null===e},isNullOrUndefined:function(e){return null==e}}},function(e,t,n){" use strict ";function r(e,t){return Object.prototype.hasOwnProperty.call(e,t)}e.exports=function(e,t,n,o){t=t||" & ",n=n||" = ";var l={};if(" string "!=typeof e||0===e.length)return l;var a=/\+/g;e=e.split(t);var s=1e3;o&&" number "==typeof o.maxKeys&&(s=o.maxKeys);var u=e.length;s>0&&u>s&&(u=s);for(var c=0;c<u;++c){var h=e[c].replace(a," % 20 "),p=h.indexOf(n),f,d,m,g;p>=0?(f=h.substr(0,p),d=h.substr(p+1)):(f=h,d=" "),m=decodeURIComponent(f),g=decodeURIComponent(d),r(l,m)?i(l[m])?l[m].push(g):l[m]=[l[m],g]:l[m]=g}return l};var i=Array.isArray||function(e){return" [ object Array ] "===Object.prototype.toString.call(e)}},function(e,t,n){" use strict ";var r=function(e){switch(typeof e){case" string ":return e;case" boolean ":return e?" true ":" false ";case" number ":return isFinite(e)?e:" ";default:return" "}};e.exports=function(e,t,n,a){return t=t||" & ",n=n||" = ",null===e&&(e=void 0)," object "==typeof e?o(l(e),function(l){var a=encodeURIComponent(r(l))+n;return i(e[l])?o(e[l],function(e){return a+encodeURIComponent(r(e))}).join(t):a+encodeURIComponent(r(e[l]))}).join(t):a?encodeURIComponent(r(a))+n+encodeURIComponent(r(e)):" "};var i=Array.isArray||function(e){return" [ object Array ] "===Object.prototype.toString.call(e)};function o(e,t){if(e.map)return e.map(t);for(var n=[],r=0;r<e.length;r++)n.push(t(e[r],r));return n}var l=Object.keys||function(e){var t=[];for(var n in e)Object.prototype.hasOwnProperty.call(e,n)&&t.push(n);return t}},function(e,t,n){function r(e){function t(e){let t=0;for(let n=0;n<e.length;n++)t=(t<<5)-t+e.charCodeAt(n),t|=0;return r.colors[Math.abs(t)%r.colors.length]}function r(e){let n;function l(...e){if(!l.enabled)return;const t=l,i=Number(new Date),o=i-(n||i);t.diff=o,t.prev=n,t.curr=i,n=i,e[0]=r.coerce(e[0])," string "!=typeof e[0]&&e.unshift(" % O ");let a=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,(n,i)=>{if(" % % "===n)return n;a++;const o=r.formatters[i];if(" function "==typeof o){const r=e[a];n=o.call(t,r),e.splice(a,1),a--}return n}),r.formatArgs.call(t,e);const s=t.log||r.log;s.apply(t,e)}return l.namespace=e,l.enabled=r.enabled(e),l.useColors=r.useColors(),l.color=t(e),l.destroy=i,l.extend=o," function "==typeof r.init&&r.init(l),r.instances.push(l),l}function i(){const e=r.instances.indexOf(this);return-1!==e&&(r.instances.splice(e,1),!0)}function o(e,t){const n=r(this.namespace+(void 0===t?" : ":t)+e);return n.log=this.log,n}function l(e){let t;r.save(e),r.names=[],r.skips=[];const n=(" string "==typeof e?e:" ").split(/[\s,]+/),i=n.length;for(t=0;t<i;t++)n[t]&&(e=n[t].replace(/\*/g," . * ? ")," - "===e[0]?r.skips.push(new RegExp(" ^ "+e.substr(1)+" $ ")):r.names.push(new RegExp(" ^ "+e+" $ ")));for(t=0;t<r.instances.length;t++){const e=r.instances[t];e.enabled=r.enabled(e.namespace)}}function a(){const e=[...r.names.map(u),...r.skips.map(u).map(e=>" - "+e)].join(" , ");return r.enable(" "),e}function s(e){if(" * "===e[e.length-1])return!0;let t,n;for(t=0,n=r.skips.length;t<n;t++)if(r.skips[t].test(e))return!1;for(t=0,n=r.names.length;t<n;t++)if(r.names[t].test(e))return!0;return!1}function u(e){return e.toString().substring(2,e.toString().length-2).replace(/\.\*\?$/," * ")}function c(e){return e instanceof Error?e.stack||e.message:e}return r.debug=r,r.default=r,r.coerce=c,r.disable=a,r.enable=l,r.enabled=s,r.humanize=n(171),Object.keys(e).forEach(t=>{r[t]=e[t]}),r.instances=[],r.names=[],r.skips=[],r.formatters={},r.selectColor=t,r.enable(r.load()),r}e.exports=r},function(e,t,n){" use strict ";t.byteLength=c,t.toByteArray=p,t.fromByteArray=m;for(var r=[],i=[],o=" undefined "!=typeof Uint8Array?Uint8Array:Array,l=" ABCDEFGHIJKLMNOPQRST
/ *
* [ hi - base32 ] { @ link https : //github.com/emn178/hi-base32}
*
* @ version 0.5 . 0
* @ author Chen , Yi - Cyuan [ emn178 @ gmail . com ]
* @ copyright Chen , Yi - Cyuan 2015 - 2018
* @ license MIT
* /
/ *
* [ hi - base32 ] { @ link https : //github.com/emn178/hi-base32}
*
* @ version 0.5 . 0
* @ author Chen , Yi - Cyuan [ emn178 @ gmail . com ]
* @ copyright Chen , Yi - Cyuan 2015 - 2018
* @ license MIT
* /
! function ( ) { "use strict" ; var o = "object" == typeof window ? window : { } , l = ! o . HI _BASE32 _NO _NODE _JS && "object" == typeof t && t . versions && t . versions . node ; l && ( o = r ) ; var a = ! o . HI _BASE32 _NO _COMMON _JS && "object" == typeof e && e . exports , s = n ( 190 ) , u = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567" . split ( "" ) , c = { A : 0 , B : 1 , C : 2 , D : 3 , E : 4 , F : 5 , G : 6 , H : 7 , I : 8 , J : 9 , K : 10 , L : 11 , M : 12 , N : 13 , O : 14 , P : 15 , Q : 16 , R : 17 , S : 18 , T : 19 , U : 20 , V : 21 , W : 22 , X : 23 , Y : 24 , Z : 25 , 2 : 26 , 3 : 27 , 4 : 28 , 5 : 29 , 6 : 30 , 7 : 31 } , h = [ 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 ] , p = function ( e , t ) { t . length > 10 && ( t = "..." + t . substr ( - 10 ) ) ; var n = new Error ( "Decoded data is not valid UTF-8. Maybe try base32.decode.asBytes()? Partial data after reading " + e + " bytes: " + t + " <-" ) ; throw n . position = e , n } , f = function ( e ) { for ( var t = "" , n = e . length , r = 0 , i = 0 , o , l ; r < n ; ) if ( o = e [ r ++ ] , o <= 127 ) t += String . fromCharCode ( o ) ; else { o > 191 && o <= 223 ? ( l = 31 & o , i = 1 ) : o <= 239 ? ( l = 15 & o , i = 2 ) : o <= 247 ? ( l = 7 & o , i = 3 ) : p ( r , t ) ; for ( var a = 0 ; a < i ; ++ a ) o = e [ r ++ ] , ( o < 128 || o > 191 ) && p ( r , t ) , l <<= 6 , l += 63 & o ; l >= 55296 && l <= 57343 && p ( r , t ) , l > 1114111 && p ( r , t ) , l <= 65535 ? t += String . fromCharCode ( l ) : ( l -= 65536 , t += String . fromCharCode ( 55296 + ( l >> 10 ) ) , t += String . fromCharCode ( 56320 + ( 1023 & l ) ) ) } return t } , d = function ( e ) { if ( ! /^[A-Z2-7=]+$/ . test ( e ) ) throw new Error ( "Invalid base32 characters" ) ; e = e . replace ( /=/g , "" ) ; for ( var t , n , r , i , o , l , a , s , u = [ ] , h = 0 , p = e . length , f = 0 , d = p >> 3 << 3 ; f < d ; ) t = c [ e . charAt ( f ++ ) ] , n = c [ e . charAt ( f ++ ) ] , r = c [ e . charAt ( f ++ ) ] , i = c [ e . charAt ( f ++ ) ] , o = c [ e . charAt ( f ++ ) ] , l = c [ e . charAt ( f ++ ) ] , a = c [ e . charAt ( f ++ ) ] , s = c [ e . charAt ( f ++ ) ] , u [ h ++ ] = 255 & ( t << 3 | n >>> 2 ) , u [ h ++ ] = 255 & ( n << 6 | r << 1 | i >>> 4 ) , u [ h ++ ] = 255 & ( i << 4 | o >>> 1 ) , u [ h ++ ] = 255 & ( o << 7 | l << 2 | a >>> 3 ) , u [ h ++ ] = 255 & ( a << 5 | s ) ; var m = p - d ; return 2 === m ? ( t = c [ e . charAt ( f ++ ) ] , n = c [ e . charAt ( f ++ ) ] , u [ h ++ ] = 255 & ( t << 3 | n >>> 2 ) ) : 4 === m ? ( t = c [ e . charAt ( f ++ ) ] , n = c [ e . charAt ( f ++ ) ] , r = c [ e . charAt ( f ++ ) ] , i = c [ e . charAt ( f ++ ) ] , u [ h ++ ] = 255 & ( t << 3 | n >>> 2 ) , u [ h ++ ] = 255 & ( n << 6 | r << 1 | i >>> 4 ) ) : 5 === m ? ( t = c [ e . charAt ( f ++ ) ] , n = c [ e . charAt ( f ++ ) ] , r = c [ e . charAt ( f ++ ) ] , i = c [ e . charAt ( f ++ ) ] , o = c [ e . charAt ( f ++ ) ] , u [ h ++ ] = 255 & ( t << 3 | n >>> 2 ) , u [ h ++ ] = 255 & ( n << 6 | r << 1 | i >>> 4 ) , u [ h ++ ] = 255 & ( i << 4 | o >>> 1 ) ) : 7 === m && ( t = c [ e . charAt ( f ++ ) ] , n = c [ e . charAt ( f ++ ) ] , r = c [ e . charAt ( f ++ ) ] , i = c [ e . charAt ( f ++ ) ] , o = c [ e . charAt ( f ++ ) ] , l = c [ e . charAt ( f ++ ) ] , a = c [ e . charAt ( f ++ ) ] , u [ h ++ ] = 255 & ( t << 3 | n >>> 2 ) , u [ h ++ ] = 255 & ( n << 6 | r << 1 | i >>> 4 ) , u [ h ++ ] = 255 & ( i << 4 | o >>> 1 ) , u [ h ++ ] = 255 & ( o << 7 | l << 2 | a >>> 3 ) ) , u } , m = function ( e ) { for ( var t , n , r , i , o , l = "" , a = e . length , s = 0 , c = 5 * parseInt ( a / 5 ) ; s < c ; ) t = e . charCodeAt ( s ++ ) , n = e . charCodeAt ( s ++ ) , r = e . charCodeAt ( s ++ ) , i = e . charCodeAt ( s ++ ) , o = e . charCodeAt ( s ++ ) , l += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ 31 & ( n << 4 | r >>> 4 ) ] + u [ 31 & ( r << 1 | i >>> 7 ) ] + u [ i >>> 2 & 31 ] + u [ 31 & ( i << 3 | o >>> 5 ) ] + u [ 31 & o ] ; var h = a - c ; return 1 === h ? ( t = e . charCodeAt ( s ) , l += u [ t >>> 3 ] + u [ t << 2 & 31 ] + "======" ) : 2 === h ? ( t = e . charCodeAt ( s ++ ) , n = e . charCodeAt ( s ) , l += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ n << 4 & 31 ] + "====" ) : 3 === h ? ( t = e . charCodeAt ( s ++ ) , n = e . charCodeAt ( s ++ ) , r = e . charCodeAt ( s ) , l += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ 31 & ( n << 4 | r >>> 4 ) ] + u [ r << 1 & 31 ] + "===" ) : 4 === h && ( t = e . charCodeAt ( s ++ ) , n = e . charCodeAt ( s ++ ) , r = e . charCodeAt ( s ++ ) , i = e . charCodeAt ( s ) , l += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ 31 & ( n << 4 | r >>> 4 ) ] + u [ 31 & ( r << 1 | i >>> 7 ) ] + u [ i >>> 2 & 31 ] + u [ i << 3 & 31 ] + "=" ) , l } , g = function ( e ) { var t , n , r , i , o , l , a = ! 1 , s = "" , c = 0 , p , f = 0 , d = 0 , m = e . length ; do { for ( h [ 0 ] = h [ 5 ] , h [ 1 ] = h [ 6 ] , h [ 2 ] = h [ 7 ] , p = f ; c < m && p < 5 ; ++ c ) l = e . charCodeAt ( c ) , l < 128 ? h [ p ++ ] = l : l < 2048 ? ( h [ p ++ ] = 192 | l >> 6 , h [ p ++ ] = 128 | 63 & l ) : l < 55296 || l >= 57344 ? ( h [ p ++ ] = 224 | l >> 12 , h [ p ++ ] = 128 | l >> 6 & 63 , h [ p ++ ] = 128 | 63 & l ) : ( l = 65536 + ( ( 1023 & l ) << 10 | 1023 & e . charCodeAt ( ++ c ) ) , h [ p ++ ] = 240 | l >> 18 , h [ p ++ ] = 128 | l >> 12 & 63 , h [ p ++ ] = 128 | l >> 6 & 63 , h [ p ++ ] = 128 | 63 & l ) ; d += p - f , f = p - 5 , c === m && ++ c , c > m && p < 6 && ( a = ! 0 ) , t = h [ 0 ] , p > 4 ? ( n = h [ 1 ] , r = h [ 2 ] , i = h [ 3 ] , o = h [ 4 ] , s += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ 31 & ( n << 4 | r >>> 4 ) ] + u [ 31 & ( r << 1 | i >>> 7 ) ] + u [ i >>> 2 & 31 ] + u [ 31 & ( i << 3 | o >>> 5 ) ] + u [ 31 & o ] ) : 1 === p ? s += u [ t >>> 3 ] + u [ t << 2 & 31 ] + "======" : 2 === p ? ( n = h [ 1 ] , s += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ n << 4 & 31 ] + "====" ) : 3 === p ? ( n = h [ 1 ] , r = h [ 2 ] , s += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ 31 & ( n << 4 | r >>> 4 ) ] + u [ r << 1 & 31 ] + "===" ) : ( n = h [ 1 ] , r = h [ 2 ] , i = h [ 3 ] , s += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n >>> 6 ) ] + u [ n >>> 1 & 31 ] + u [ 31 & ( n << 4 | r >>> 4 ) ] + u [ 31 & ( r << 1 | i >>> 7 ) ] + u [ i >>> 2 & 31 ] + u [ i << 3 & 31 ] + "=" ) } while ( ! a ) ; return s } , y = function ( e ) { for ( var t , n , r , i , o , l = "" , a = e . length , s = 0 , c = 5 * parseInt ( a / 5 ) ; s < c ; ) t = e [ s ++ ] , n = e [ s ++ ] , r = e [ s ++ ] , i = e [ s ++ ] , o = e [ s ++ ] , l += u [ t >>> 3 ] + u [ 31 & ( t << 2 | n
/ *
object - assign
( c ) Sindre Sorhus
@ license MIT
* / v a r r = O b j e c t . g e t O w n P r o p e r t y S y m b o l s , i = O b j e c t . p r o t o t y p e . h a s O w n P r o p e r t y , o = O b j e c t . p r o t o t y p e . p r o p e r t y I s E n u m e r a b l e ; f u n c t i o n l ( e ) { i f ( n u l l = = = e | | v o i d 0 = = = e ) t h r o w n e w T y p e E r r o r ( " O b j e c t . a s s i g n c a n n o t b e c a l l e d w i t h n u l l o r u n d e f i n e d " ) ; r e t u r n O b j e c t ( e ) } f u n c t i o n a ( ) { t r y { i f ( ! O b j e c t . a s s i g n ) r e t u r n ! 1 ; v a r e = n e w S t r i n g ( " a b c " ) ; i f ( e [ 5 ] = " d e " , " 5 " = = = O b j e c t . g e t O w n P r o p e r t y N a m e s ( e ) [ 0 ] ) r e t u r n ! 1 ; f o r ( v a r t = { } , n = 0 ; n < 1 0 ; n + + ) t [ " _ " + S t r i n g . f r o m C h a r C o d e ( n ) ] = n ; v a r r = O b j e c t . g e t O w n P r o p e r t y N a m e s ( t ) . m a p ( f u n c t i o n ( e ) { r e t u r n t [ e ] } ) ; i f ( " 0 1 2 3 4 5 6 7 8 9 " ! = = r . j o i n ( " " ) ) r e t u r n ! 1 ; v a r i = { } ; r e t u r n " a b c d e f g h i j k l m n o p q r s t " . s p l i t ( " " ) . f o r E a c h ( f u n c t i o n ( e ) { i [ e ] = e } ) , " a b c d e f g h i j k l m n o p q r s t " = = = O b j e c t . k e y s ( O b j e c t . a s s i g n ( { } , i ) ) . j o i n ( " " ) } c a t c h ( e ) { r e t u r n ! 1 } } e . e x p o r t s = a ( ) ? O b j e c t . a s s i g n : f u n c t i o n ( e , t ) { f o r ( v a r n , a = l ( e ) , s , u = 1 ; u < a r g u m e n t s . l e n g t h ; u + + ) { f o r ( v a r c i n n = O b j e c t ( a r g u m e n t s [ u ] ) , n ) i . c a l l ( n , c ) & & ( a [ c ] = n [ c ] ) ; i f ( r ) { s = r ( n ) ; f o r ( v a r h = 0 ; h < s . l e n g t h ; h + + ) o . c a l l ( n , s [ h ] ) & & ( a [ s [ h ] ] = n [ s [ h ] ] ) } } r e t u r n a } } , f u n c t i o n ( e , t ) { e . e x p o r t s = f u n c t i o n e ( t ) { r e t u r n t & & " o b j e c t " = = t y p e o f t & & " f u n c t i o n " = = t y p e o f t . c o p y & & " f u n c t i o n " = = t y p e o f t . f i l l & & " f u n c t i o n " = = t y p e o f t . r e a d U I n t 8 } } , f u n c t i o n ( e , t ) { " f u n c t i o n " = = t y p e o f O b j e c t . c r e a t e ? e . e x p o r t s = f u n c t i o n e ( t , n ) { t . s u p e r _ = n , t . p r o t o t y p e = O b j e c t . c r e a t e ( n . p r o t o t y p e , { c o n s t r u c t o r : { v a l u e : t , e n u m e r a b l e : ! 1 , w r i t a b l e : ! 0 , c o n f i g u r a b l e : ! 0 } } ) } : e . e x p o r t s = f u n c t i o n e ( t , n ) { t . s u p e r _ = n ; v a r r = f u n c t i o n ( ) { } ; r . p r o t o t y p e = n . p r o t o t y p e , t . p r o t o t y p e = n e w r , t . p r o t o t y p e . c o n s t r u c t o r = t } } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ; c o n s t { e n s u r e M u l t i a d d r : r } = n ( 2 3 0 ) , i = n ( 4 6 9 ) ; c l a s s o { c o n s t r u c t o r ( e ) { t h i s . _ m u l t i a d d r s = e | | [ ] , t h i s . _ o b s e r v e d M u l t i a d d r s = [ ] } a d d ( e ) { e = r ( e ) , t h i s . h a s ( e ) | | t h i s . _ m u l t i a d d r s . p u s h ( e ) } a d d S a f e ( e ) { e = r ( e ) ; c o n s t t = t h i s . _ o b s e r v e d M u l t i a d d r s . s o m e ( ( t , n ) = > { i f ( t . e q u a l s ( e ) ) r e t u r n t h i s . a d d ( e ) , t h i s . _ o b s e r v e d M u l t i a d d r s . s p l i c e ( n , 1 ) , ! 0 } ) ; t | | t h i s . _ o b s e r v e d M u l t i a d d r s . p u s h ( e ) } t o A r r a y ( ) { r e t u r n t h i s . _ m u l t i a d d r s . s l i c e ( ) } g e t s i z e ( ) { r e t u r n t h i s . _ m u l t i a d d r s . l e n g t h } f o r E a c h ( e ) { r e t u r n t h i s . _ m u l t i a d d r s . f o r E a c h ( e ) } f i l t e r B y ( e ) { r e t u r n " o b j e c t " ! = t y p e o f e | | " f u n c t i o n " ! = t y p e o f e . m a t c h e s | | " f u n c t i o n " ! = t y p e o f e . p a r t i a l M a t c h | | " f u n c t i o n " ! = t y p e o f e . t o S t r i n g ? [ ] : t h i s . _ m u l t i a d d r s . f i l t e r ( t = > e . m a t c h e s ( t ) ) } h a s ( e ) { r e t u r n e = r ( e ) , t h i s . _ m u l t i a d d r s . s o m e ( t = > t . e q u a l s ( e ) ) } d e l e t e ( e ) { e = r ( e ) , t h i s . _ m u l t i a d d r s . s o m e ( ( t , n ) = > { i f ( t . e q u a l s ( e ) ) r e t u r n t h i s . _ m u l t i a d d r s . s p l i c e ( n , 1 ) , ! 0 } ) } r e p l a c e ( e , t ) { A r r a y . i s A r r a y ( e ) | | ( e = [ e ] ) , A r r a y . i s A r r a y ( t ) | | ( t = [ t ] ) , e . f o r E a c h ( e = > t h i s . d e l e t e ( e ) ) , t . f o r E a c h ( e = > t h i s . a d d ( e ) ) } c l e a r ( ) { t h i s . _ m u l t i a d d r s = [ ] } d i s t i n c t ( ) { r e t u r n i ( t h i s . _ m u l t i a d d r s , e = > [ e . t o O p t i o n s ( ) . p o r t , e . t o O p t i o n s ( ) . t r a n s p o r t ] . j o i n ( ) ) } } e . e x p o r t s = o } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ; f u n c t i o n r ( e , t ) { v a r n = [ ] , r = { } ; i f ( " f u n c t i o n " ! = t y p e o f t ) { v a r i = t ; t = f u n c t i o n e ( t ) { r e t u r n t [ i ] } } r e t u r n e . f o r E a c h ( f u n c t i o n e ( i ) { v a r o = t ( i ) ; r [ o ] | | ( r [ o ] = ! 0 , n . p u s h ( i ) ) } ) , n } e . e x p o r t s = r } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ; f u n c t i o n r ( ) { r e t u r n { a d d : n ( 2 3 1 ) , a d d R e a d a b l e S t r e a m : n ( 4 8 4 ) , a d d P u l l S t r e a m : n ( 4 8 5 ) , a d d F r o m F s : n ( 4 8 7 ) , a d d F r o m U R L : n ( 4 8 8 ) , a d d F r o m S t r e a m : n ( 2 3 1 ) , c a t : n ( 4 9 2 ) , c a t R e a d a b l e S t r e a m : n ( 4 9 3 ) , c a t P u l l S t r e a m : n ( 4 9 5 ) , g e t : n ( 4 9 8 ) , g e t R e a d a b l e S t r e a m : n ( 5 0 4 ) , g e t P u l l S t r e a m : n ( 5 0 5 ) , l s : n ( 5 0 6 ) , l s R e a d a b l e S t r e a m : n ( 5 1 4 ) , l s P u l l S t r e a m : n ( 5 1 5 ) , r e f s : n ( 1 4 6 ) , r e f s R e a d a b l e S t r e a m : n ( 5 3 8 ) , r e f s P u l l S t r e a m : n ( 5 3 9 ) , f i l e s : n ( 5 4 0 ) , b l o c k : n ( 2 5 3 ) , b i t s w a p : n ( 5 5 8 ) , d a g : n ( 5 6 2 ) , o b j e c t : n ( 5 8 7 ) , p i n : n ( 6 0 0 ) , b o o t s t r a p : n ( 6 0 4 ) , d h t : n ( 6 0 8 ) , n a m e : n ( 6 1 5 ) , p i n g : n ( 6 2 2 ) , p i n g R e a d a b l e S t r e a m : n ( 6 2 4 ) , p i n g P u l l S t r e a m : n ( 6 2 5 ) , s w a r m : n ( 6 2 6 ) , p u b s u b : n ( 6 3 2 ) , d n s : n ( 6 3 6 ) , c o m m a n d s : n ( 6 3 7 ) , c o n f i g : n ( 6 3 8 ) , d i a g : n ( 6 4 2 ) , i d : n ( 6 4 6 ) , k e y : n ( 6 4 7 ) , l o g : n ( 6 5 4 ) , m o u n t : n ( 6 5 8 ) , r e p o : n ( 6 5 9 ) , s t o p : n ( 2 6 2 ) , s h u t d o w n : n ( 2 6 2 ) , s t a t s : n ( 6 6 3 ) , u p d a t e : n ( 6 6 9 ) , v e r s i o n : n ( 6 7 0 ) , r e s o l v e : n ( 6 7 1 ) , g e t E n d p o i n t C o n f i g : ( e , t ) = > n ( 6 7 2 ) ( t ) } } f u n c t i o n i ( e , t ) { c o n s t n = r ( ) , i = { } ; r e t u r n O b j e c t . k e y s ( n ) . f o r E a c h ( r = > { i [ r ] = n [ r ] ( e , t ) } ) , i } e . e x p o r t s = i } , f u n c t i o n ( e , t ) { f u n c t i o n n ( e , t ) { i f ( e & & t ) r e t u r n n ( e ) ( t ) ; i f ( " f u n c t i o n " ! = t y p e o f e ) t h r o w n e w T y p e E r r o r ( " n e e d w r a p p e r f u n c t i o n " ) ; r e t u r n O b j e c t . k e y s ( e ) . f o r E a c h ( f u n c t i o n ( t ) { r [ t ] = e [ t ] } ) , r ; f u n c t i o n r ( ) { f o r ( v a r t = n e w A r r a y ( a r g u m e n t s . l e n g t h ) , n = 0 ; n < t . l e n g t h ; n + + ) t [ n ] = a r g u m e n t s [ n ] ; v a r r = e . a p p l y ( t h i s , t ) , i = t [ t . l e n g t h - 1 ] ; r e t u r n " f u n c t i o n " = = t y p e o f r & & r ! = = i & & O b j e c t . k e y s ( i ) . f o r E a c h ( f u n c t i o n ( e ) { r [ e ] = i [ e ] } ) , r } } e . e x p o r t s = n } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ; O b j e c t . d e f i n e P r o p e r t y ( t , " _ _ e s M o d
/ * !
* Determine if an object is a Buffer
*
* @ author Feross Aboukhadijeh < https : //feross.org>
* @ license MIT
* /
e . exports = function e ( t ) { return null != t && null != t . constructor && "function" == typeof t . constructor . isBuffer && t . constructor . isBuffer ( t ) } } , function ( e , t , n ) { "use strict" ; const r = n ( 70 ) , i = n ( 57 ) ; e . exports = ( e => t => ( t = t || { } , t . converter = i , r ( e , "add" ) ( t ) ) ) } , function ( e , t , n ) { "use strict" ; const r = n ( 70 ) , i = n ( 57 ) , o = n ( 36 ) ; e . exports = ( e => t => ( t = t || { } , t . converter = i , o ( r ( e , "add" ) ( { qs : t } ) ) ) ) } , function ( e , t ) { var n = e . exports = function ( e ) { ! function t ( ) { var n = ! 0 , r = ! 1 , i = ! 1 ; do { i = ! 0 , n = ! 1 , e . call ( this , function ( ) { i ? n = ! 0 : t ( ) } ) , i = ! 1 } while ( n ) } ( ) } } , function ( e , t , n ) { "use strict" ; const r = n ( 71 ) , i = n ( 1 ) , o = n ( 139 ) , l = n ( 57 ) ; e . exports = ( e => { const t = o ( e , "add" ) ; return i ( ( e , n , i ) => { if ( "function" == typeof n && void 0 === i && ( i = n , n = { } ) , "function" == typeof n && "function" == typeof i && ( i = n , n = { } ) , ! r ) return i ( new Error ( "fsAdd does not work in the browser" ) ) ; if ( "string" != typeof e ) return i ( new Error ( '"path" must be a string' ) ) ; const o = { qs : n , converter : l } ; t ( e , o , i ) } ) } ) } , function ( e , t , n ) { "use strict" ; const r = n ( 1 ) , { URL : i } = n ( 140 ) , { getRequest : o } = n ( 235 ) , l = n ( 139 ) , a = n ( 57 ) ; e . exports = ( e => { const t = l ( e , "add" ) ; return r ( ( e , n , r ) => { if ( "function" == typeof n && void 0 === r && ( r = n , n = { } ) , "function" == typeof n && "function" == typeof r && ( r = n , n = { } ) , ! s ( e ) ) return r ( new Error ( '"url" param must be an http(s) url' ) ) ; u ( e , n , t , r ) } ) } ) ; const s = e => "string" == typeof e && e . startsWith ( "http" ) , u = ( e , t , n , r ) => { const l = new i ( e ) , c = o ( l , e => { if ( e . statusCode >= 400 ) return r ( new Error ( ` Failed to download with ${ e . statusCode } ` ) ) ; const i = e . headers . location ; if ( e . statusCode >= 300 && e . statusCode < 400 && i ) { if ( ! s ( i ) ) return r ( new Error ( "redirection url must be an http(s) url" ) ) ; u ( i , t , n , r ) } else { const i = { qs : t , converter : a } , o = decodeURIComponent ( l . pathname . split ( "/" ) . pop ( ) ) ; n ( { content : e , path : o } , i , r ) } } ) ; c . once ( "error" , r ) , c . end ( ) } } , function ( e , t , n ) { "use strict" ; const { URLWithLegacySupport : r , format : i } = n ( 234 ) ; e . exports = ( ( e , t = { } , n = { } , o ) => { let l = t . protocol ? t . protocol . replace ( ":" , "" ) : "http" , a ; l = ( n [ l ] || o || l ) + ":" ; try { a = new r ( e ) } catch ( e ) { a = { } } const s = Object . assign ( { } , t , { protocol : l || a . protocol , host : t . host || a . host } ) ; return new r ( e , i ( s ) ) . toString ( ) } ) } , function ( e , t , n ) { ( function ( t ) { var r = n ( 491 ) , i = n ( 237 ) , o = n ( 238 ) , l = self . URL ; const a = ( e , n ) => { "string" == typeof e ? ( e = new l ( e , self . location . protocol + "//" + self . location . host ) , e . path = e . pathname + e . search , e . auth = e . username && e . password ? e . username + ":" + e . password : null ) : e = Object . assign ( { } , e ) ; var i = - 1 === t . location . protocol . search ( /^https?:$/ ) ? "http:" : "" , o = e . protocol || i , a = e . hostname || e . host , s = e . port , u = e . path || "/" ; a && - 1 !== a . indexOf ( ":" ) && ( a = "[" + a + "]" ) , e . url = ( a ? o + "//" + a : "" ) + ( s ? ":" + s : "" ) + u , e . method = ( e . method || "GET" ) . toUpperCase ( ) , e . headers = e . headers || { } ; var c = new r ( e ) ; return n && c . on ( "response" , n ) , c } , s = ( e , t ) => { var n = a ( e , t ) ; return n . end ( ) , n } , u = function ( ) { } ; u . defaultMaxSockets = 4 ; const c = [ "CHECKOUT" , "CONNECT" , "COPY" , "DELETE" , "GET" , "HEAD" , "LOCK" , "M-SEARCH" , "MERGE" , "MKACTIVITY" , "MKCOL" , "MOVE" , "NOTIFY" , "OPTIONS" , "PATCH" , "POST" , "PROPFIND" , "PROPPATCH" , "PURGE" , "PUT" , "REPORT" , "SEARCH" , "SUBSCRIBE" , "TRACE" , "UNLOCK" , "UNSUBSCRIBE" ] ; e . exports = { Agent : u , ClientRequest : r , IncomingMessage : i , METHODS : c , STATUS _CODES : o , get : s , globalAgent : new u , request : a , maxHeaderSize : "8KB" } } ) . call ( this , n ( 11 ) ) } , function ( e , t , n ) { ( function ( t ) { var r = n ( 236 ) , i = n ( 3 ) , o = n ( 237 ) , l = n ( 5 ) , a = self . fetch , s = e . exports = function ( e ) { l . Writable . call ( this ) , this . _opts = e , this . _body = [ ] , this . _headers = { } , e . auth && this . setHeader ( "Authorization" , "Basic " + t . from ( e . auth ) . toString ( "base64" ) ) , Object . keys ( e . headers ) . forEach ( t => { this . setHeader ( t , e . headers [ t ] ) } ) , this . _mode = "fetch" , this . _fetchTimer = null , this . on ( "finish" , ( ) => this . _onFinish ( ) ) } ; i ( s , l . Writable ) , s . prototype . setHeader = function ( e , t ) { var n = e . toLowerCase ( ) ; - 1 === u . indexOf ( n ) && ( this . _headers [ n ] = t ) } , s . prototype . getHeader = function ( e ) { var t = this . _headers [ e . toLowerCase ( ) ] ; return t ? t . value : null } , s . prototype . removeHeader = function ( e ) { delete this . _headers [ e . toLowerCase ( ) ] } , s . prototype . _onFinish = function ( ) { if ( ! this . _destroyed ) { var e = this . _opts , t = this . _headers , n = null ; "GET" !== e . method && "HEAD" !== e . method && ( n = new Blob ( this . _body , { type : ( t [ "content-type" ] || { } ) . value || "" } ) ) ; var i = null ; if ( r . abortController ) { var o = new AbortController ; i = o . signal , this . _fetchAbortController = o , "requestTimeout" in e && 0 !== e . requestTime
//! stable.js 0.1.8, https://github.com/Two-Screen/stable
//! © 2018 Angry Bytes and contributors. MIT licensed.
var r , i ; r = this , i = function ( ) { "use strict" ; var e = function ( e , n ) { return t ( e . slice ( ) , n ) } ; function t ( e , t ) { "function" != typeof t && ( t = function ( e , t ) { return String ( e ) . localeCompare ( t ) } ) ; var r = e . length ; if ( r <= 1 ) return e ; for ( var i = new Array ( r ) , o = 1 ; o < r ; o *= 2 ) { n ( e , t , o , i ) ; var l = e ; e = i , i = l } return e } e . inplace = function ( e , r ) { var i = t ( e , r ) ; return i !== e && n ( i , null , e . length , e ) , e } ; var n = function ( e , t , n , r ) { var i = e . length , o = 0 , l = 2 * n , a , s , u , c , h ; for ( a = 0 ; a < i ; a += l ) for ( s = a + n , u = s + n , s > i && ( s = i ) , u > i && ( u = i ) , c = a , h = s ; ; ) if ( c < s && h < u ) t ( e [ c ] , e [ h ] ) <= 0 ? r [ o ++ ] = e [ c ++ ] : r [ o ++ ] = e [ h ++ ] ; else if ( c < s ) r [ o ++ ] = e [ c ++ ] ; else { if ( ! ( h < u ) ) break ; r [ o ++ ] = e [ h ++ ] } } ; return e } , e . exports = i ( ) } , function ( e , t , n ) { "use strict" ; e . exports = "// An IPFS MerkleDAG Link\nmessage PBLink {\n\n // multihash of the target object\n optional bytes Hash = 1;\n\n // utf string name. should be unique per object\n optional string Name = 2;\n\n // cumulative size of target object\n optional uint64 Tsize = 3;\n}\n\n// An IPFS MerkleDAG Node\nmessage PBNode {\n\n // refs to other objects\n repeated PBLink Links = 2;\n\n // opaque user data\n optional bytes Data = 1;\n}" } , function ( e , t , n ) { "use strict" ; const r = n ( 60 ) ; function i ( e ) { return new r ( e . Name || e . name || "" , e . Tsize || e . Size || e . size || 0 , e . Hash || e . hash || e . multihash || e . cid ) } t = e . exports , t . createDagLinkFromB58EncodedHash = i } , function ( e , t , n ) { "use strict" ; const { Buffer : r } = n ( 0 ) , i = n ( 125 ) , o = n ( 569 ) , l = n ( 571 ) , { fromNumberTo32BitBuf : a } = n ( 572 ) , s = e => async t => { switch ( e ) { case "sha3-224" : return r . from ( i . sha3 _224 . arrayBuffer ( t ) ) ; case "sha3-256" : return r . from ( i . sha3 _256 . arrayBuffer ( t ) ) ; case "sha3-384" : return r . from ( i . sha3 _384 . arrayBuffer ( t ) ) ; case "sha3-512" : return r . from ( i . sha3 _512 . arrayBuffer ( t ) ) ; case "shake-128" : return r . from ( i . shake128 . create ( 128 ) . update ( t ) . arrayBuffer ( ) ) ; case "shake-256" : return r . from ( i . shake256 . create ( 256 ) . update ( t ) . arrayBuffer ( ) ) ; case "keccak-224" : return r . from ( i . keccak224 . arrayBuffer ( t ) ) ; case "keccak-256" : return r . from ( i . keccak256 . arrayBuffer ( t ) ) ; case "keccak-384" : return r . from ( i . keccak384 . arrayBuffer ( t ) ) ; case "keccak-512" : return r . from ( i . keccak512 . arrayBuffer ( t ) ) ; case "murmur3-128" : return r . from ( o . x64 . hash128 ( t ) , "hex" ) ; case "murmur3-32" : return a ( o . x86 . hash32 ( t ) ) ; default : throw new TypeError ( ` ${ e } is not a supported algorithm ` ) } } ; e . exports = { sha1 : l ( "sha1" ) , sha2256 : l ( "sha2-256" ) , sha2512 : l ( "sha2-512" ) , dblSha2256 : l ( "dbl-sha2-256" ) , sha3224 : s ( "sha3-224" ) , sha3256 : s ( "sha3-256" ) , sha3384 : s ( "sha3-384" ) , sha3512 : s ( "sha3-512" ) , shake128 : s ( "shake-128" ) , shake256 : s ( "shake-256" ) , keccak224 : s ( "keccak-224" ) , keccak256 : s ( "keccak-256" ) , keccak384 : s ( "keccak-384" ) , keccak512 : s ( "keccak-512" ) , murmur3128 : s ( "murmur3-128" ) , murmur332 : s ( "murmur3-32" ) , addBlake : n ( 573 ) } } , function ( e , t , n ) { e . exports = n ( 570 ) } , function ( e , t , n ) { ! function ( n , r ) { "use strict" ; var i = { version : "3.0.0" , x86 : { } , x64 : { } , inputValidation : ! 0 } ; function o ( e ) { if ( ! Array . isArray ( e ) && ! ArrayBuffer . isView ( e ) ) return ! 1 ; for ( var t = 0 ; t < e . length ; t ++ ) if ( ! Number . isInteger ( e [ t ] ) || e [ t ] < 0 || e [ t ] > 255 ) return ! 1 ; return ! 0 } function l ( e , t ) { return ( 65535 & e ) * t + ( ( ( e >>> 16 ) * t & 65535 ) << 16 ) } function a ( e , t ) { return e << t | e >>> 32 - t } function s ( e ) { return e ^= e >>> 16 , e = l ( e , 2246822507 ) , e ^= e >>> 13 , e = l ( e , 3266489909 ) , e ^= e >>> 16 , e } function u ( e , t ) { e = [ e [ 0 ] >>> 16 , 65535 & e [ 0 ] , e [ 1 ] >>> 16 , 65535 & e [ 1 ] ] , t = [ t [ 0 ] >>> 16 , 65535 & t [ 0 ] , t [ 1 ] >>> 16 , 65535 & t [ 1 ] ] ; var n = [ 0 , 0 , 0 , 0 ] ; return n [ 3 ] += e [ 3 ] + t [ 3 ] , n [ 2 ] += n [ 3 ] >>> 16 , n [ 3 ] &= 65535 , n [ 2 ] += e [ 2 ] + t [ 2 ] , n [ 1 ] += n [ 2 ] >>> 16 , n [ 2 ] &= 65535 , n [ 1 ] += e [ 1 ] + t [ 1 ] , n [ 0 ] += n [ 1 ] >>> 16 , n [ 1 ] &= 65535 , n [ 0 ] += e [ 0 ] + t [ 0 ] , n [ 0 ] &= 65535 , [ n [ 0 ] << 16 | n [ 1 ] , n [ 2 ] << 16 | n [ 3 ] ] } function c ( e , t ) { e = [ e [ 0 ] >>> 16 , 65535 & e [ 0 ] , e [ 1 ] >>> 16 , 65535 & e [ 1 ] ] , t = [ t [ 0 ] >>> 16 , 65535 & t [ 0 ] , t [ 1 ] >>> 16 , 65535 & t [ 1 ] ] ; var n = [ 0 , 0 , 0 , 0 ] ; return n [ 3 ] += e [ 3 ] * t [ 3 ] , n [ 2 ] += n [ 3 ] >>> 16 , n [ 3 ] &= 65535 , n [ 2 ] += e [ 2 ] * t [ 3 ] , n [ 1 ] += n [ 2 ] >>> 16 , n [ 2 ] &= 65535 , n [ 2 ] += e [ 3 ] * t [ 2 ] , n [ 1 ] += n [ 2 ] >>> 16 , n [ 2 ] &= 65535 , n [ 1 ] += e [ 1 ] * t [ 3 ] , n [ 0 ] += n [ 1 ] >>> 16 , n [ 1 ] &= 65535 , n [ 1 ] += e [ 2 ] * t [ 2 ] , n [ 0 ] += n [ 1 ] >>> 16 , n [ 1 ] &= 65535 , n [ 1 ] += e [ 3 ] * t [ 1 ] , n [ 0 ] += n [ 1 ] >>> 16 , n [ 1 ] &= 65535 , n [ 0 ] += e [ 0 ] * t [ 3 ] + e [ 1 ] * t [ 2 ] + e [ 2 ] * t [ 1 ] + e [ 3 ] * t [ 0 ] , n [ 0 ] &= 65535 , [ n [ 0 ] << 16 | n [ 1 ] , n [ 2 ] << 16 | n [ 3 ] ] } function h ( e , t ) { return t %= 64 , 32 === t ? [ e [ 1 ] , e [ 0 ] ] : t < 32 ? [ e [ 0 ] << t | e [ 1 ] >>> 32 - t , e [ 1 ] << t | e [ 0 ] >>> 32 - t ] : ( t -= 32 , [ e [ 1 ] << t | e [ 0 ] >>> 32 - t , e [ 0 ] << t | e [ 1 ] >>> 32 - t ] ) } function p ( e , t ) { return t %= 64 , 0 === t ? e : t < 32 ? [ e [
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* /var r=n(8),i=n(14).parse,o=n(7),l=n(270),a=n(272).Store,s=n(714).MemoryCookieStore,u=n(274).pathMatch,c=n(715).version,h;try{h=n(85)}catch(e){console.warn("tough-cookie: can't load punycode; won't use punycode for domain normalization")}var p=/ ^ [ \ x21 \ x23 - \ x2B \ x2D - \ x3A \ x3C - \ x5B \ x5D - \ x7E ] + $ / , f = /[\x00-\x1F]/ , d = [ "\n" , "\r" , "\0" ] , m = /[\x20-\x3A\x3C-\x7E]+/ , g = /[\x09\x20-\x2F\x3B-\x40\x5B-\x60\x7B-\x7E]/ , y = { jan : 0 , feb : 1 , mar : 2 , apr : 3 , may : 4 , jun : 5 , jul : 6 , aug : 7 , sep : 8 , oct : 9 , nov : 10 , dec : 11 } , v = [ "Jan" , "Feb" , "Mar" , "Apr" , "May" , "Jun" , "Jul" , "Aug" , "Sep" , "Oct" , "Nov" , "Dec" ] , b = [ "Sun" , "Mon" , "Tue" , "Wed" , "Thu" , "Fri" , "Sat" ] , w = 2147483647e3 , k = 0 ; function _ ( e , t , n , r ) { for ( var i = 0 ; i < e . length ; ) { var o = e . charCodeAt ( i ) ; if ( o <= 47 || o >= 58 ) break ; i ++ } return i < t || i > n ? null : r || i == e . length ? parseInt ( e . substr ( 0 , i ) , 10 ) : null } function x ( e ) { var t = e . split ( ":" ) , n = [ 0 , 0 , 0 ] ; if ( 3 !== t . length ) return null ; for ( var r = 0 ; r < 3 ; r ++ ) { var i = 2 == r , o = _ ( t [ r ] , 1 , 2 , i ) ; if ( null === o ) return null ; n [ r ] = o } return n } function S ( e ) { e = String ( e ) . substr ( 0 , 3 ) . toLowerCase ( ) ; var t = y [ e ] ; return t >= 0 ? t : null } function E ( e ) { if ( e ) { var t = e . split ( g ) ; if ( t ) { for ( var n = null , r = null , i = null , o = null , l = null , a = null , s = 0 ; s < t . length ; s ++ ) { var u = t [ s ] . trim ( ) , c ; if ( u . length ) null === i && ( c = x ( u ) , c ) ? ( n = c [ 0 ] , r = c [ 1 ] , i = c [ 2 ] ) : null !== o || ( c = _ ( u , 1 , 2 , ! 0 ) , null === c ) ? null !== l || ( c = S ( u ) , null === c ) ? null === a && ( c = _ ( u , 2 , 4 , ! 0 ) , null !== c && ( a = c , a >= 70 && a <= 99 ? a += 1900 : a >= 0 && a <= 69 && ( a += 2e3 ) ) ) : l = c : o = c } if ( ! ( null === o || null === l || null === a || null === i || o < 1 || o > 31 || a < 1601 || n > 23 || r > 59 || i > 59 ) ) return new Date ( Date . UTC ( a , l , o , n , r , i ) ) } } } function j ( e ) { var t = e . getUTCDate ( ) ; t = t >= 10 ? t : "0" + t ; var n = e . getUTCHours ( ) ; n = n >= 10 ? n : "0" + n ; var r = e . getUTCMinutes ( ) ; r = r >= 10 ? r : "0" + r ; var i = e . getUTCSeconds ( ) ; return i = i >= 10 ? i : "0" + i , b [ e . getUTCDay ( ) ] + ", " + t + " " + v [ e . getUTCMonth ( ) ] + " " + e . getUTCFullYear ( ) + " " + n + ":" + r + ":" + i + " GMT" } function A ( e ) { return null == e ? null : ( e = e . trim ( ) . replace ( /^\./ , "" ) , h && /[^\u0001-\u007f]/ . test ( e ) && ( e = h . toASCII ( e ) ) , e . toLowerCase ( ) ) } function C ( e , t , n ) { if ( null == e || null == t ) return null ; if ( ! 1 !== n && ( e = A ( e ) , t = A ( t ) ) , e == t ) return ! 0 ; if ( r . isIP ( e ) ) return ! 1 ; var i = e . indexOf ( t ) ; return ! ( i <= 0 ) && ( e . length === t . length + i && "." === e . substr ( i - 1 , 1 ) ) } function T ( e ) { if ( ! e || "/" !== e . substr ( 0 , 1 ) ) return "/" ; if ( "/" === e ) return e ; var t = e . lastIndexOf ( "/" ) ; return 0 === t ? "/" : e . slice ( 0 , t ) } function I ( e ) { for ( var t = 0 ; t < d . length ; t ++ ) { var n = e . indexOf ( d [ t ] ) ; - 1 !== n && ( e = e . substr ( 0 , n ) ) } return e } function B ( e , t ) { e = I ( e ) ; var n = e . indexOf ( "=" ) , r , i ; if ( t ) 0 === n && ( e = e . substr ( 1 ) , n = e . indexOf ( "=" ) ) ; else if ( n <= 0 ) return ; if ( n <= 0 ? ( r = "" , i = e . trim ( ) ) : ( r = e . substr ( 0 , n ) . trim ( ) , i = e . substr ( n + 1 ) . trim ( ) ) , ! f . test ( r ) && ! f . test ( i ) ) { var o = new M ; return o . key = r , o . value = i , o } } function O ( e , t ) { t && "object" == typeof t || ( t = { } ) , e = e . trim ( ) ; var n = e . indexOf ( ";" ) , r = - 1 === n ? e : e . substr ( 0 , n ) , i = B ( r , ! ! t . loose ) ; if ( i ) { if ( - 1 === n ) return i ; var o = e . slice ( n + 1 ) . trim ( ) ; if ( 0 === o . length ) return i ; for ( var l = o . split ( ";" ) ; l . length ; ) { var a = l . shift ( ) . trim ( ) ; if ( 0 !== a . length ) { var s = a . indexOf ( "=" ) , u , c ; switch ( - 1 === s ? ( u = a , c = null ) : ( u = a . substr ( 0 , s ) , c = a . substr ( s + 1 ) ) , u = u . trim ( ) . toLowerCase ( ) , c && ( c = c . trim ( ) ) , u ) { case "expires" : if ( c ) { var h = E ( c ) ; h && ( i . expires = h ) } break ; case "max-age" : if ( c && /^-?[0-9]+$/ . test ( c ) ) { var p = parseInt ( c , 10 ) ; i . setMaxAge ( p ) } break ; case "domain" : if ( c ) { var f = c . trim ( ) . replace ( /^\./ , "" ) ; f && ( i . domain = f . toLowerCase ( ) ) } break ; case "path" : i . path = c && "/" === c [ 0 ] ? c : null ; break ; case "secure" : i . secure = ! 0 ; break ; case "httponly" : i . httpOnly = ! 0 ; break ; default : i . extensions = i . extensions || [ ] , i . extensions . push ( a ) } } } return i } } function P ( e ) { var t ; try { t = JSON . parse ( e ) } catch ( e ) { return e } return t } function F ( e ) { if ( ! e ) return null ; var t ; if ( "string" == typeof e ) { if ( t = P ( e ) , t instanceof Error ) return null } else t = e ; for ( var n = new M , r = 0 ; r < M . serializableProperties . length ; r ++ ) { var i = M . serializableProperties [ r ] ; void 0 !== t [ i ] && t [ i ] !== M . prototype [ i ] && ( "expires" === i || "creation" === i || "lastAccessed" === i ? null === t [ i ] ? n [ i ] = null : n [ i ] = "Infinity" == t [ i ] ? "Infinity" : new Date ( t [ i ] ) : n [ i ] = t [ i ] ) } return n } function N ( e , t ) { var n = 0 , r = e . path ? e . path . length : 0 , i = t . path ? t . path . length : 0 ; if ( n = i - r , 0 !== n ) return n ; var o = e . creation ? e . creation . getTime ( ) : w , l = t . creation ? t . creation . getTime ( ) : w ; return n = o - l , 0 !== n ? n : ( n = e . creationIndex - t . creationIndex , n ) } function R ( e ) { if ( "/" === e ) return [ "/" ] ; e . last
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* /var r=n(272).Store,i=n(273).permuteDomain,o=n(274).pathMatch,l=n(7);function a(){r.call(this),this.idx={}}l.inherits(a,r),t.MemoryCookieStore=a,a.prototype.idx=null,a.prototype.synchronous=!0,a.prototype.inspect=function(){return"{ idx: "+l.inspect(this.idx,!1,2)+" }"},l.inspect.custom&&(a.prototype[l.inspect.custom]=a.prototype.inspect),a.prototype.findCookie=function(e,t,n,r){return this.idx[e]&&this.idx[e][t]?r(null,this.idx[e][t][n]||null):r(null,void 0)},a.prototype.findCookies=function(e,t,n){var r=[],l;if(!e)return n(null,[]);l=t?function e(n){Object.keys(n).forEach(function(e){if(o(t,e)){var i=n[e];for(var l in i)r.push(i[l])}})}:function e(t){for(var n in t){var i=t[n];for(var o in i)r.push(i[o])}};var a=i(e)||[e],s=this.idx;a.forEach(function(e){var t=s[e];t&&l(t)}),n(null,r)},a.prototype.putCookie=function(e,t){this.idx[e.domain]||(this.idx[e.domain]={}),this.idx[e.domain][e.path]||(this.idx[e.domain][e.path]={}),this.idx[e.domain][e.path][e.key]=e,t(null)},a.prototype.updateCookie=function(e,t,n){this.putCookie(t,n)},a.prototype.removeCookie=function(e,t,n,r){this.idx[e]&&this.idx[e][t]&&this.idx[e][t][n]&&delete this.idx[e][t][n],r(null)},a.prototype.removeCookies=function(e,t,n){return this.idx[e]&&(t?delete this.idx[e][t]:delete this.idx[e]),n(null)},a.prototype.getAllCookies=function(e){var t=[],n=this.idx,r=Object.keys(n);r.forEach(function(e){var r=Object.keys(n[e]);r.forEach(function(r){var i=Object.keys(n[e][r]);i.forEach(function(i){null!==i&&t.push(n[e][r][i])})})}),t.sort(function(e,t){return(e.creationIndex||0)-(t.creationIndex||0)}),e(null,t)}},function(e){e.exports=JSON.parse('{"author":{"name":"Jeremy Stashewsky","email":"jstash@gmail.com","website":"https:/ / github . com / stash "}," contributors ":[{" name ":" Alexander Savin "," website ":" https : //github.com/apsavin"},{"name":"Ian Livingstone","website":"https://github.com/ianlivingstone"},{"name":"Ivan Nikulin","website":"https://github.com/inikulin"},{"name":"Lalit Kapoor","website":"https://github.com/lalitkapoor"},{"name":"Sam Thompson","website":"https://github.com/sambthompson"},{"name":"Sebastian Mayr","website":"https://github.com/Sebmaster"}],"license":"BSD-3-Clause","name":"tough-cookie","description":"RFC6265 Cookies and Cookie Jar for node.js","keywords":["HTTP","cookie","cookies","set-cookie","cookiejar","jar","RFC6265","RFC2965"],"version":"2.4.3","homepage":"https://github.com/salesforce/tough-cookie","repository":{"type":"git","url":"git://github.com/salesforce/tough-cookie.git"},"bugs":{"url":"https://github.com/salesforce/tough-cookie/issues"},"main":"./lib/cookie","files":["lib"],"scripts":{"test":"vows test/*_test.js","cover":"nyc --reporter=lcov --reporter=html vows test/*_test.js"},"engines":{"node":">=0.8"},"devDependencies":{"async":"^1.4.2","nyc":"^11.6.0","string.prototype.repeat":"^0.2.0","vows":"^0.8.1"},"dependencies":{"psl":"^1.1.24","punycode":"^1.4.1"}}')},function(e,t,n){"use strict";(function(t){var r=n(76),i=n(157),o=n(14),l=n(7),a=n(35),s=n(724),u=n(734),c=n(735),h=n(737),p=n(754),f=n(164),d=n(757),m=n(758),g=n(154),y=n(292),v=n(759).strict,b=n(155),w=n(269),k=n(760),_=n(761).Querystring,x=n(764).Har,S=n(821).Auth,E=n(824).OAuth,j=n(826),A=n(827).Multipart,C=n(830).Redirect,T=n(831).Tunnel,I=n(833),B=n(10).Buffer,O=b.safeStringify,P=b.isReadStream,F=b.toBase64,N=b.defer,R=b.copy,D=b.version,M=w.jar(),L={};function z(e,t){var n={};for(var r in t){var i=-1===e.indexOf(r);i&&(n[r]=t[r])}return n}function U(e,t){var n={};for(var r in t){var i=!(-1===e.indexOf(r)),o="function"==typeof t[r];i&&o||(n[r]=t[r])}return n}function q(){var e=this;return{uri:this.uri,method:this.method,headers:this.headers}}function K(){var e=this;return{statusCode:this.statusCode,body:this.body,headers:this.headers,request:q.call(this.request)}}function H(e){var t=this;e.har&&(this._har=new x(this),e=this._har.options(e)),a.Stream.call(this);var n=Object.keys(H.prototype),r=z(n,e);g(this,r),e=U(n,e),this.readable=!0,this.writable=!0,e.method&&(this.explicitMethod=!0),this._qs=new _(this),this._auth=new S(this),this._oauth=new E(this),this._mult
/ * !
* Copyright 2010 LearnBoost < dev @ learnboost . 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
*
* 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 .
* /
var r = n ( 8 ) , i = n ( 14 ) . parse , o = [ "acl" , "location" , "logging" , "notification" , "partNumber" , "policy" , "requestPayment" , "torrent" , "uploadId" , "uploads" , "versionId" , "versioning" , "versions" , "website" ] ; function l ( e ) { return "AWS " + e . key + ":" + s ( e ) } function a ( e ) { return r . createHmac ( "sha1" , e . secret ) . update ( e . message ) . digest ( "base64" ) } function s ( e ) { return e . message = c ( e ) , a ( e ) } function u ( e ) { return e . message = h ( e ) , a ( e ) } function c ( e ) { var t = e . amazonHeaders || "" ; t && ( t += "\n" ) ; var n = [ e . verb , e . md5 , e . contentType , e . date ? e . date . toUTCString ( ) : "" , t + e . resource ] ; return n . join ( "\n" ) } function h ( e ) { return "GET\n\n\n" + e . date + "\n" + e . resource } function p ( e ) { for ( var t = [ ] , n = Object . keys ( e ) , r = 0 , i = n . length ; r < i ; ++ r ) { var o = n [ r ] , l = e [ o ] , o = o . toLowerCase ( ) ; 0 === o . indexOf ( "x-amz" ) && t . push ( o + ":" + l ) } return t . sort ( ) . join ( "\n" ) } function f ( e ) { var t = i ( e , ! 0 ) , n = t . pathname , r = [ ] ; return Object . keys ( t . query ) . forEach ( function ( e ) { if ( ~ o . indexOf ( e ) ) { var n = "" == t . query [ e ] ? "" : "=" + encodeURIComponent ( t . query [ e ] ) ; r . push ( e + n ) } } ) , n + ( r . length ? "?" + r . sort ( ) . join ( "&" ) : "" ) } e . exports = l , e . exports . authorization = l , e . exports . hmacSha1 = a , e . exports . sign = s , e . exports . signQuery = u , e . exports . stringToSign = c , e . exports . queryStringToSign = h , e . exports . canonicalizeHeaders = p , e . exports . canonicalizeResource = f } , function ( e , t , n ) { ( function ( e ) { var r = t , i = n ( 14 ) , o = n ( 86 ) , l = n ( 8 ) , a = n ( 736 ) , s = a ( 1e3 ) ; function u ( e , t , n ) { return l . createHmac ( "sha256" , e ) . update ( t , "utf8" ) . digest ( n ) } function c ( e , t ) { return l . createHash ( "sha256" ) . update ( e , "utf8" ) . digest ( t ) } function h ( e ) { return e . replace ( /[!'()*]/g , function ( e ) { return "%" + e . charCodeAt ( 0 ) . toString ( 16 ) . toUpperCase ( ) } ) } function p ( e , t ) { "string" == typeof e && ( e = i . parse ( e ) ) ; var n = e . headers = e . headers || { } , r = this . matchHost ( e . hostname || e . host || n . Host || n . host ) ; this . request = e , this . credentials = t || this . defaultCredentials ( ) , this . service = e . service || r [ 0 ] || "" , this . region = e . region || r [ 1 ] || "us-east-1" , "email" === this . service && ( this . service = "ses" ) , ! e . method && e . body && ( e . method = "POST" ) , n . Host || n . host || ( n . Host = e . hostname || e . host || this . createHost ( ) , e . port && ( n . Host += ":" + e . port ) ) , e . hostname || e . host || ( e . hostname = n . Host || n . host ) , this . isCodeCommitGit = "codecommit" === this . service && "GIT" === e . method } p . prototype . matchHost = function ( e ) { var t = ( e || "" ) . match ( /([^\.]+)\.(?:([^\.]*)\.)?amazonaws\.com(\.cn)?$/ ) , n = ( t || [ ] ) . slice ( 1 , 3 ) ; return "es" === n [ 1 ] && ( n = n . reverse ( ) ) , n } , p . prototype . isSingleRegion = function ( ) { return [ "s3" , "sdb" ] . indexOf ( this . service ) >= 0 && "us-east-1" === this . region || [ "cloudfront" , "ls" , "route53" , "iam" , "importexport" , "sts" ] . indexOf ( this . service ) >= 0 } , p . prototype . createHost = function ( ) { var e = this . isSingleRegion ( ) ? "" : ( "s3" === this . service && "us-east-1" !== this . region ? "-" : "." ) + this . region , t = "ses" === this . service ? "email" : this . service ; return t + e + ".amazonaws.com" } , p . prototype . prepareRequest = function ( ) { this . parsePath ( ) ; var t = this . request , n = t . headers , r ; t . signQuery ? ( this . parsedPath . query = r = this . parsedPath . query || { } , this . credentials . sessionToken && ( r [ "X-Amz-Security-Token" ] = this . credentials . sessionToken ) , "s3" !== this . service || r [ "X-Amz-Expires" ] || ( r [ "X-Amz-Expires" ] = 86400 ) , r [ "X-Amz-Date" ] ? this . datetime = r [ "X-Amz-Date" ] : r [ "X-Amz-Date" ] = this . getDateTime ( ) , r [ "X-Amz-Algorithm" ] = "AWS4-HMAC-SHA256" , r [ "X-Amz-Credential" ] = this . credentials . accessKeyId + "/" + this . credentialString ( ) , r [ "X-Amz-SignedHeaders" ] = this . signedHeaders ( ) ) : ( t . doNotModifyHeaders || this . isCodeCommitGit || ( ! t . body || n [ "Content-Type" ] || n [ "content-type" ] || ( n [ "Content-Type" ] = "application/x-www-form-urlencoded; charset=utf-8" ) , ! t . body || n [ "Content-Length" ] || n [ "content-length" ] || ( n [ "Content-Length" ] = e . byteLength ( t . body ) ) , ! this . credentials . sessionToken || n [ "X-Amz-Security-Token" ] || n [ "x-amz-security-token" ] || ( n [ "X-Amz-Security-Token" ] = this . credentials . sessionToken ) , "s3" !== this . service || n [ "X-Amz-Content-Sha256" ] || n [ "x-amz-content-sha256" ] || ( n [ "X-Amz-Content-Sha256" ] = c ( this . request . body || "" , "hex" ) ) , n [ "X-Amz-Date" ] || n [ "x-amz-date" ] ? this . datetime = n [ "X-Amz-Date" ] || n [ "x-amz-date" ] : n [ "X-Amz-Date" ] = this . getDateTime ( ) ) , delete n . Authorization , delete n . authorization ) } , p . prototype . sign = function ( ) { return this . parsedPath || this . prepareRequest ( ) , this . request . signQuery ? this . parsedPath . query [ "X-Amz-Signature" ] = this . signature ( ) : this . req
/ * !
* mime - types
* Copyright ( c ) 2014 Jonathan Ong
* Copyright ( c ) 2015 Douglas Christopher Wilson
* MIT Licensed
* /var r=n(755),i=n(95).extname,o=/ ^ \ s * ( [ ^ ; \ s ] * ) ( ? : ; | \ s | $ ) / , l = /^text\//i ; function a ( e ) { if ( ! e || "string" != typeof e ) return ! 1 ; var t = o . exec ( e ) , n = t && r [ t [ 1 ] . toLowerCase ( ) ] ; return n && n . charset ? n . charset : ! ( ! t || ! l . test ( t [ 1 ] ) ) && "UTF-8" } function s ( e ) { if ( ! e || "string" != typeof e ) return ! 1 ; var n = - 1 === e . indexOf ( "/" ) ? t . lookup ( e ) : e ; if ( ! n ) return ! 1 ; if ( - 1 === n . indexOf ( "charset" ) ) { var r = t . charset ( n ) ; r && ( n += "; charset=" + r . toLowerCase ( ) ) } return n } function u ( e ) { if ( ! e || "string" != typeof e ) return ! 1 ; var n = o . exec ( e ) , r = n && t . extensions [ n [ 1 ] . toLowerCase ( ) ] ; return ! ( ! r || ! r . length ) && r [ 0 ] } function c ( e ) { if ( ! e || "string" != typeof e ) return ! 1 ; var n = i ( "x." + e ) . toLowerCase ( ) . substr ( 1 ) ; return n && t . types [ n ] || ! 1 } function h ( e , t ) { var n = [ "nginx" , "apache" , void 0 , "iana" ] ; Object . keys ( r ) . forEach ( function i ( o ) { var l = r [ o ] , a = l . extensions ; if ( a && a . length ) { e [ o ] = a ; for ( var s = 0 ; s < a . length ; s ++ ) { var u = a [ s ] ; if ( t [ u ] ) { var c = n . indexOf ( r [ t [ u ] ] . source ) , h = n . indexOf ( l . source ) ; if ( "application/octet-stream" !== t [ u ] && ( c > h || c === h && "application/" === t [ u ] . substr ( 0 , 12 ) ) ) continue } t [ u ] = o } } } ) } t . charset = a , t . charsets = { lookup : a } , t . contentType = s , t . extension = u , t . extensions = Object . create ( null ) , t . lookup = c , t . types = Object . create ( null ) , h ( t . extensions , t . types ) } , function ( e , t , n ) {
/ * !
* mime - db
* Copyright ( c ) 2014 Jonathan Ong
* MIT Licensed
* /
e . exports = n ( 756 ) } , function ( e ) { e . exports = JSON . parse ( ' { "application/1d-interleaved-parityfec" : { "source" : "iana" } , "application/3gpdash-qoe-report+xml" : { "source" : "iana" , "compressible" : true } , "application/3gpp-ims+xml" : { "source" : "iana" , "compressible" : true } , "application/a2l" : { "source" : "iana" } , "application/activemessage" : { "source" : "iana" } , "application/activity+json" : { "source" : "iana" , "compressible" : true } , "application/alto-costmap+json" : { "source" : "iana" , "compressible" : true } , "application/alto-costmapfilter+json" : { "source" : "iana" , "compressible" : true } , "application/alto-directory+json" : { "source" : "iana" , "compressible" : true } , "application/alto-endpointcost+json" : { "source" : "iana" , "compressible" : true } , "application/alto-endpointcostparams+json" : { "source" : "iana" , "compressible" : true } , "application/alto-endpointprop+json" : { "source" : "iana" , "compressible" : true } , "application/alto-endpointpropparams+json" : { "source" : "iana" , "compressible" : true } , "application/alto-error+json" : { "source" : "iana" , "compressible" : true } , "application/alto-networkmap+json" : { "source" : "iana" , "compressible" : true } , "application/alto-networkmapfilter+json" : { "source" : "iana" , "compressible" : true } , "application/aml" : { "source" : "iana" } , "application/andrew-inset" : { "source" : "iana" , "extensions" : [ "ez" ] } , "application/applefile" : { "source" : "iana" } , "application/applixware" : { "source" : "apache" , "extensions" : [ "aw" ] } , "application/atf" : { "source" : "iana" } , "application/atfx" : { "source" : "iana" } , "application/atom+xml" : { "source" : "iana" , "compressible" : true , "extensions" : [ "atom" ] } , "application/atomcat+xml" : { "source" : "iana" , "compressible" : true , "extensions" : [ "atomcat" ] } , "application/atomdeleted+xml" : { "source" : "iana" , "compressible" : true } , "application/atomicmail" : { "source" : "iana" } , "application/atomsvc+xml" : { "source" : "iana" , "compressible" : true , "extensions" : [ "atomsvc" ] } , "application/atsc-dwd+xml" : { "source" : "iana" , "compressible" : true } , "application/atsc-held+xml" : { "source" : "iana" , "compressible" : true } , "application/atsc-rsat+xml" : { "source" : "iana" , "compressible" : true } , "application/atxml" : { "source" : "iana" } , "application/auth-policy+xml" : { "source" : "iana" , "compressible" : true } , "application/bacnet-xdd+zip" : { "source" : "iana" , "compressible" : false } , "application/batch-smtp" : { "source" : "iana" } , "application/bdoc" : { "compressible" : false , "extensions" : [ "bdoc" ] } , "application/beep+xml" : { "source" : "iana" , "compressible" : true } , "application/calendar+json" : { "source" : "iana" , "compressible" : true } , "application/calendar+xml" : { "source" : "iana" , "compressible" : true } , "application/call-completion" : { "source" : "iana" } , "application/cals-1840" : { "source" : "iana" } , "application/cbor" : { "source" : "iana" } , "application/cccex" : { "source" : "iana" } , "application/ccmp+xml" : { "source" : "iana" , "compressible" : true } , "application/ccxml+xml" : { "source" : "iana" , "compressible" : true , "extensions" : [ "ccxml" ] } , "application/cdfx+xml" : { "source" : "iana" , "compressible" : true } , "application/cdmi-capability" : { "source" : "iana" , "extensions" : [ "cdmia" ] } , "application/cdmi-container" : { "source" : "iana" , "extensions" : [ "cdmic" ] } , "application/cdmi-domain" : { "source" : "iana" , "extensions" : [ "cdmid" ] } , "application/cdmi-object" : { "source" : "iana" , "extensions" : [ "cdmio" ] } , "application/cdmi-queue" : { "source" : "iana" , "extensions" : [ "cdmiq" ] } , "application/cdni" : { "source" : "iana" } , "application/cea" : { "source" : "iana" } , "application/cea-2018+xml" : { "source" : "iana" , "compressible" : true } , "application/cellml+xml" : { "source" : "iana" , "compressible" : true } , "application/cfw" : { "source" : "iana" } , "application/clue_info+xml" : { "source" : "iana" , "compressible" : true } , "application/cms" : { "source" : "iana" } , "application/cnrp+xml" : { "source" : "iana" , "compressible" : true } , "application/coap-group+json" : { "source" : "iana" , "compressible" : true } , "application/coap-payload" : { "source" : "iana" } , "application/commonground" : { "source" : "iana" } , "application/conference-info+xml" : { "source" : "iana" , "compressible" : true } , "application/cose" : { "source" : "iana" } , "application/cose-key" : { "source" : "iana" } , "application/cose-key-set" : { "source" : "iana" } , "application/cpl+xml" : { "source" : "iana" , "compressible" : true } , "application/csrattrs" : { "source" : "iana" } , "application/csta+xml" : { "source" : "iana" , "compressible" : tr
/** @license URI.js v4.2.1 (c) 2011 Gary Court. License: http://github.com/garycourt/uri-js */ var r , i ; r = this , i = function ( e ) { "use strict" ; function t ( ) { for ( var e = arguments . length , t = Array ( e ) , n = 0 ; n < e ; n ++ ) t [ n ] = arguments [ n ] ; if ( t . length > 1 ) { t [ 0 ] = t [ 0 ] . slice ( 0 , - 1 ) ; for ( var r = t . length - 1 , i = 1 ; i < r ; ++ i ) t [ i ] = t [ i ] . slice ( 1 , - 1 ) ; return t [ r ] = t [ r ] . slice ( 1 ) , t . join ( "" ) } return t [ 0 ] } function n ( e ) { return "(?:" + e + ")" } function r ( e ) { return void 0 === e ? "undefined" : null === e ? "null" : Object . prototype . toString . call ( e ) . split ( " " ) . pop ( ) . split ( "]" ) . shift ( ) . toLowerCase ( ) } function i ( e ) { return e . toUpperCase ( ) } function o ( e ) { return void 0 !== e && null !== e ? e instanceof Array ? e : "number" != typeof e . length || e . split || e . setInterval || e . call ? [ e ] : Array . prototype . slice . call ( e ) : [ ] } function l ( e , t ) { var n = e ; if ( t ) for ( var r in t ) n [ r ] = t [ r ] ; return n } function a ( e ) { var r = "[A-Za-z]" , i = "[\\x0D]" , o = "[0-9]" , l = "[\\x22]" , a = t ( "[0-9]" , "[A-Fa-f]" ) , s = "[\\x0A]" , u = "[\\x20]" , c = n ( n ( "%[EFef]" + a + "%" + a + a + "%" + a + a ) + "|" + n ( "%[89A-Fa-f]" + a + "%" + a + a ) + "|" + n ( "%" + a + a ) ) , h = "[\\:\\/\\?\\#\\[\\]\\@]" , p = "[\\!\\$\\&\\'\\(\\)\\*\\+\\,\\;\\=]" , f = t ( h , p ) , d = e ? "[\\xA0-\\u200D\\u2010-\\u2029\\u202F-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFEF]" : "[]" , m = e ? "[\\uE000-\\uF8FF]" : "[]" , g = t ( r , "[0-9]" , "[\\-\\.\\_\\~]" , d ) , y = n ( r + t ( r , "[0-9]" , "[\\+\\-\\.]" ) + "*" ) , v = n ( n ( c + "|" + t ( g , p , "[\\:]" ) ) + "*" ) , b = n ( n ( "25[0-5]" ) + "|" + n ( "2[0-4][0-9]" ) + "|" + n ( "1[0-9][0-9]" ) + "|" + n ( "[1-9][0-9]" ) + "|[0-9]" ) , w = n ( n ( "25[0-5]" ) + "|" + n ( "2[0-4][0-9]" ) + "|" + n ( "1[0-9][0-9]" ) + "|" + n ( "0?[1-9][0-9]" ) + "|0?0?[0-9]" ) , k = n ( w + "\\." + w + "\\." + w + "\\." + w ) , _ = n ( a + "{1,4}" ) , x = n ( n ( _ + "\\:" + _ ) + "|" + k ) , S = n ( n ( _ + "\\:" ) + "{6}" + x ) , E = n ( "\\:\\:" + n ( _ + "\\:" ) + "{5}" + x ) , j = n ( n ( _ ) + "?\\:\\:" + n ( _ + "\\:" ) + "{4}" + x ) , A = n ( n ( n ( _ + "\\:" ) + "{0,1}" + _ ) + "?\\:\\:" + n ( _ + "\\:" ) + "{3}" + x ) , C = n ( n ( n ( _ + "\\:" ) + "{0,2}" + _ ) + "?\\:\\:" + n ( _ + "\\:" ) + "{2}" + x ) , T = n ( n ( n ( _ + "\\:" ) + "{0,3}" + _ ) + "?\\:\\:" + _ + "\\:" + x ) , I = n ( n ( n ( _ + "\\:" ) + "{0,4}" + _ ) + "?\\:\\:" + x ) , B = n ( n ( n ( _ + "\\:" ) + "{0,5}" + _ ) + "?\\:\\:" + _ ) , O = n ( n ( n ( _ + "\\:" ) + "{0,6}" + _ ) + "?\\:\\:" ) , P = n ( [ S , E , j , A , C , T , I , B , O ] . join ( "|" ) ) , F = n ( n ( g + "|" + c ) + "+" ) , N = n ( P + "\\%25" + F ) , R = n ( P + n ( "\\%25|\\%(?!" + a + "{2})" ) + F ) , D = n ( "[vV]" + a + "+\\." + t ( g , p , "[\\:]" ) + "+" ) , M = n ( "\\[" + n ( R + "|" + P + "|" + D ) + "\\]" ) , L = n ( n ( c + "|" + t ( g , p ) ) + "*" ) , z = n ( M + "|" + k + "(?!" + L + ")|" + L ) , U = n ( "[0-9]*" ) , q = n ( n ( v + "@" ) + "?" + z + n ( "\\:" + U ) + "?" ) , K = n ( c + "|" + t ( g , p , "[\\:\\@]" ) ) , H = n ( K + "*" ) , V = n ( K + "+" ) , G = n ( n ( c + "|" + t ( g , p , "[\\@]" ) ) + "+" ) , $ = n ( n ( "\\/" + H ) + "*" ) , W = n ( "\\/" + n ( V + $ ) + "?" ) , Y = n ( G + $ ) , Z = n ( V + $ ) , J = "(?!" + K + ")" , Q = n ( $ + "|" + W + "|" + Y + "|" + Z + "|" + J ) , X = n ( n ( K + "|" + t ( "[\\/\\?]" , m ) ) + "*" ) , ee = n ( n ( K + "|[\\/\\?]" ) + "*" ) , te = n ( n ( "\\/\\/" + q + $ ) + "|" + W + "|" + Z + "|" + J ) , ne = n ( y + "\\:" + te + n ( "\\?" + X ) + "?" + n ( "\\#" + ee ) + "?" ) , re = n ( n ( "\\/\\/" + q + $ ) + "|" + W + "|" + Y + "|" + J ) , ie = n ( re + n ( "\\?" + X ) + "?" + n ( "\\#" + ee ) + "?" ) , oe = n ( ne + "|" + ie ) , le = n ( y + "\\:" + te + n ( "\\?" + X ) + "?" ) , ae = "^(" + y + ")\\:" + n ( n ( "\\/\\/(" + n ( "(" + v + ")@" ) + "?(" + z + ")" + n ( "\\:(" + U + ")" ) + "?)" ) + "?(" + $ + "|" + W + "|" + Z + "|" + J + ")" ) + n ( "\\?(" + X + ")" ) + "?" + n ( "\\#(" + ee + ")" ) + "?$" , se = "^(){0}" + n ( n ( "\\/\\/(" + n ( "(" + v + ")@" ) + "?(" + z + ")" + n ( "\\:(" + U + ")" ) + "?)" ) + "?(" + $ + "|" + W + "|" + Y + "|" + J + ")" ) + n ( "\\?(" + X + ")" ) + "?" + n ( "\\#(" + ee + ")" ) + "?$" , ue = "^(" + y + ")\\:" + n ( n ( "\\/\\/(" + n ( "(" + v + ")@" ) + "?(" + z + ")" + n ( "\\:(" + U + ")" ) + "?)" ) + "?(" + $ + "|" + W + "|" + Z + "|" + J + ")" ) + n ( "\\?(" + X + ")" ) + "?$" , ce = "^" + n ( "\\#(" + ee + ")" ) + "?$" , he = "^" + n ( "(" + v + ")@" ) + "?(" + z + ")" + n ( "\\:(" + U + ")" ) + "?$" ; return { NOT _SCHEME : new RegExp ( t ( "[^]" , r , "[0-9]" , "[\\+\\-\\.]" ) , "g" ) , NOT _USERINFO : new RegExp ( t ( "[^\\%\\:]" , g , p ) , "g" ) , NOT _HOST : new RegExp ( t ( "[^\\%\\[\\]\\:]" , g , p ) , "g" ) , NOT _PATH : new RegExp ( t ( "[^\\%\\/\\:\\@]" , g , p ) , "g" ) , NOT _PATH _NOSCHEME : new RegExp ( t ( "[^\\%\\/\\@]" , g , p ) , "g" ) , NOT _QUERY : new RegExp ( t ( "[^\\%]" , g , p , "[\\:\\@\\/\\?]" , m ) , "g" ) , NOT _FRAGMENT : new RegExp ( t ( "[^\\%]" , g , p , "[\\:\\@\\/\\?]" ) , "g" ) , ESCAPE : new RegExp ( t ( "[^]" , g , p ) , "g" ) , UNRESERVED : new RegExp ( g , "g" ) , OTHER _CHARS : new RegExp ( t ( "[^\\%]" , g , f ) , "g" ) , PCT _ENCODED : new RegExp ( c , "g" ) , IPV4ADDRESS : new RegExp ( "^(" + k + ")$" ) , IPV6ADDRESS : new RegExp ( "^\\[?(" + P + ")" + n ( n ( "\\%25|\\%(?!" + a + "{2})" ) + "(" + F + ")" ) + "?\\]?$" ) } } var s = a ( ! 1 ) , u = a ( ! 0 ) , c = function ( ) { function e ( e , t ) { var n = [ ] , r = ! 0 , i = ! 1 , o = void 0 ; try { for ( var l = e [ Symbol . iterator ] ( ) , a ; ! ( r = ( a = l . next ( ) ) . done ) && ( n . push ( a . value ) , ! t || n . length !== t ) ; r = ! 0 ) ; } catch ( e ) { i = ! 0 , o = e } finally { try { ! r && l . return && l . return ( ) } finally { if ( i ) throw o } } ret
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* /var r=n(8),i=n(14).parse,o=n(7),l=n(305),a=n(306).Store,s=n(842).MemoryCookieStore,u=n(308).pathMatch,c=n(843),h;try{h=n(85)}catch(e){console.warn("tough-cookie: can't load punycode; won't use punycode for domain normalization")}var p=/ ^ [ \ x21 \ x23 - \ x2B \ x2D - \ x3A \ x3C - \ x5B \ x5D - \ x7E ] + $ / , f = /[\x00-\x1F]/ , d = [ "\n" , "\r" , "\0" ] , m = /[\x20-\x3A\x3C-\x7E]+/ , g = /[\x09\x20-\x2F\x3B-\x40\x5B-\x60\x7B-\x7E]/ , y = { jan : 0 , feb : 1 , mar : 2 , apr : 3 , may : 4 , jun : 5 , jul : 6 , aug : 7 , sep : 8 , oct : 9 , nov : 10 , dec : 11 } , v = [ "Jan" , "Feb" , "Mar" , "Apr" , "May" , "Jun" , "Jul" , "Aug" , "Sep" , "Oct" , "Nov" , "Dec" ] , b = [ "Sun" , "Mon" , "Tue" , "Wed" , "Thu" , "Fri" , "Sat" ] , w = 2147483647e3 , k = 0 ; function _ ( e , t , n , r ) { for ( var i = 0 ; i < e . length ; ) { var o = e . charCodeAt ( i ) ; if ( o <= 47 || o >= 58 ) break ; i ++ } return i < t || i > n ? null : r || i == e . length ? parseInt ( e . substr ( 0 , i ) , 10 ) : null } function x ( e ) { var t = e . split ( ":" ) , n = [ 0 , 0 , 0 ] ; if ( 3 !== t . length ) return null ; for ( var r = 0 ; r < 3 ; r ++ ) { var i = 2 == r , o = _ ( t [ r ] , 1 , 2 , i ) ; if ( null === o ) return null ; n [ r ] = o } return n } function S ( e ) { e = String ( e ) . substr ( 0 , 3 ) . toLowerCase ( ) ; var t = y [ e ] ; return t >= 0 ? t : null } function E ( e ) { if ( e ) { var t = e . split ( g ) ; if ( t ) { for ( var n = null , r = null , i = null , o = null , l = null , a = null , s = 0 ; s < t . length ; s ++ ) { var u = t [ s ] . trim ( ) , c ; if ( u . length ) null === i && ( c = x ( u ) , c ) ? ( n = c [ 0 ] , r = c [ 1 ] , i = c [ 2 ] ) : null !== o || ( c = _ ( u , 1 , 2 , ! 0 ) , null === c ) ? null !== l || ( c = S ( u ) , null === c ) ? null === a && ( c = _ ( u , 2 , 4 , ! 0 ) , null !== c && ( a = c , a >= 70 && a <= 99 ? a += 1900 : a >= 0 && a <= 69 && ( a += 2e3 ) ) ) : l = c : o = c } if ( ! ( null === o || null === l || null === a || null === i || o < 1 || o > 31 || a < 1601 || n > 23 || r > 59 || i > 59 ) ) return new Date ( Date . UTC ( a , l , o , n , r , i ) ) } } } function j ( e ) { var t = e . getUTCDate ( ) ; t = t >= 10 ? t : "0" + t ; var n = e . getUTCHours ( ) ; n = n >= 10 ? n : "0" + n ; var r = e . getUTCMinutes ( ) ; r = r >= 10 ? r : "0" + r ; var i = e . getUTCSeconds ( ) ; return i = i >= 10 ? i : "0" + i , b [ e . getUTCDay ( ) ] + ", " + t + " " + v [ e . getUTCMonth ( ) ] + " " + e . getUTCFullYear ( ) + " " + n + ":" + r + ":" + i + " GMT" } function A ( e ) { return null == e ? null : ( e = e . trim ( ) . replace ( /^\./ , "" ) , h && /[^\u0001-\u007f]/ . test ( e ) && ( e = h . toASCII ( e ) ) , e . toLowerCase ( ) ) } function C ( e , t , n ) { if ( null == e || null == t ) return null ; if ( ! 1 !== n && ( e = A ( e ) , t = A ( t ) ) , e == t ) return ! 0 ; if ( r . isIP ( e ) ) return ! 1 ; var i = e . indexOf ( t ) ; return ! ( i <= 0 ) && ( e . length === t . length + i && "." === e . substr ( i - 1 , 1 ) ) } function T ( e ) { if ( ! e || "/" !== e . substr ( 0 , 1 ) ) return "/" ; if ( "/" === e ) return e ; var t = e . lastIndexOf ( "/" ) ; return 0 === t ? "/" : e . slice ( 0 , t ) } function I ( e ) { for ( var t = 0 ; t < d . length ; t ++ ) { var n = e . indexOf ( d [ t ] ) ; - 1 !== n && ( e = e . substr ( 0 , n ) ) } return e } function B ( e , t ) { e = I ( e ) ; var n = e . indexOf ( "=" ) , r , i ; if ( t ) 0 === n && ( e = e . substr ( 1 ) , n = e . indexOf ( "=" ) ) ; else if ( n <= 0 ) return ; if ( n <= 0 ? ( r = "" , i = e . trim ( ) ) : ( r = e . substr ( 0 , n ) . trim ( ) , i = e . substr ( n + 1 ) . trim ( ) ) , ! f . test ( r ) && ! f . test ( i ) ) { var o = new M ; return o . key = r , o . value = i , o } } function O ( e , t ) { t && "object" == typeof t || ( t = { } ) , e = e . trim ( ) ; var n = e . indexOf ( ";" ) , r = - 1 === n ? e : e . substr ( 0 , n ) , i = B ( r , ! ! t . loose ) ; if ( i ) { if ( - 1 === n ) return i ; var o = e . slice ( n + 1 ) . trim ( ) ; if ( 0 === o . length ) return i ; for ( var l = o . split ( ";" ) ; l . length ; ) { var a = l . shift ( ) . trim ( ) ; if ( 0 !== a . length ) { var s = a . indexOf ( "=" ) , u , c ; switch ( - 1 === s ? ( u = a , c = null ) : ( u = a . substr ( 0 , s ) , c = a . substr ( s + 1 ) ) , u = u . trim ( ) . toLowerCase ( ) , c && ( c = c . trim ( ) ) , u ) { case "expires" : if ( c ) { var h = E ( c ) ; h && ( i . expires = h ) } break ; case "max-age" : if ( c && /^-?[0-9]+$/ . test ( c ) ) { var p = parseInt ( c , 10 ) ; i . setMaxAge ( p ) } break ; case "domain" : if ( c ) { var f = c . trim ( ) . replace ( /^\./ , "" ) ; f && ( i . domain = f . toLowerCase ( ) ) } break ; case "path" : i . path = c && "/" === c [ 0 ] ? c : null ; break ; case "secure" : i . secure = ! 0 ; break ; case "httponly" : i . httpOnly = ! 0 ; break ; default : i . extensions = i . extensions || [ ] , i . extensions . push ( a ) } } } return i } } function P ( e ) { var t ; try { t = JSON . parse ( e ) } catch ( e ) { return e } return t } function F ( e ) { if ( ! e ) return null ; var t ; if ( "string" == typeof e ) { if ( t = P ( e ) , t instanceof Error ) return null } else t = e ; for ( var n = new M , r = 0 ; r < M . serializableProperties . length ; r ++ ) { var i = M . serializableProperties [ r ] ; void 0 !== t [ i ] && t [ i ] !== M . prototype [ i ] && ( "expires" === i || "creation" === i || "lastAccessed" === i ? null === t [ i ] ? n [ i ] = null : n [ i ] = "Infinity" == t [ i ] ? "Infinity" : new Date ( t [ i ] ) : n [ i ] = t [ i ] ) } return n } function N ( e , t ) { var n = 0 , r = e . path ? e . path . length : 0 , i = t . path ? t . path . length : 0 ; if ( n = i - r , 0 !== n ) return n ; var o = e . creation ? e . creation . getTime ( ) : w , l = t . creation ? t . creation . getTime ( ) : w ; return n = o - l , 0 !== n ? n : ( n = e . creationIndex - t . creationIndex , n ) } function R ( e ) { if ( "/" === e ) return [ "/" ] ; e . lastIndexOf (
/ * !
* Copyright ( c ) 2015 , Salesforce . com , 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 :
*
* 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 Salesforce . com 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 .
* / v a r r = n ( 3 0 6 ) . S t o r e , i = n ( 3 0 7 ) . p e r m u t e D o m a i n , o = n ( 3 0 8 ) . p a t h M a t c h , l = n ( 7 ) ; f u n c t i o n a ( ) { r . c a l l ( t h i s ) , t h i s . i d x = { } } l . i n h e r i t s ( a , r ) , t . M e m o r y C o o k i e S t o r e = a , a . p r o t o t y p e . i d x = n u l l , a . p r o t o t y p e . s y n c h r o n o u s = ! 0 , a . p r o t o t y p e . i n s p e c t = f u n c t i o n ( ) { r e t u r n " { i d x : " + l . i n s p e c t ( t h i s . i d x , ! 1 , 2 ) + " } " } , l . i n s p e c t . c u s t o m & & ( a . p r o t o t y p e [ l . i n s p e c t . c u s t o m ] = a . p r o t o t y p e . i n s p e c t ) , a . p r o t o t y p e . f i n d C o o k i e = f u n c t i o n ( e , t , n , r ) { r e t u r n t h i s . i d x [ e ] & & t h i s . i d x [ e ] [ t ] ? r ( n u l l , t h i s . i d x [ e ] [ t ] [ n ] | | n u l l ) : r ( n u l l , v o i d 0 ) } , a . p r o t o t y p e . f i n d C o o k i e s = f u n c t i o n ( e , t , n ) { v a r r = [ ] , l ; i f ( ! e ) r e t u r n n ( n u l l , [ ] ) ; l = t ? f u n c t i o n e ( n ) { O b j e c t . k e y s ( n ) . f o r E a c h ( f u n c t i o n ( e ) { i f ( o ( t , e ) ) { v a r i = n [ e ] ; f o r ( v a r l i n i ) r . p u s h ( i [ l ] ) } } ) } : f u n c t i o n e ( t ) { f o r ( v a r n i n t ) { v a r i = t [ n ] ; f o r ( v a r o i n i ) r . p u s h ( i [ o ] ) } } ; v a r a = i ( e ) | | [ e ] , s = t h i s . i d x ; a . f o r E a c h ( f u n c t i o n ( e ) { v a r t = s [ e ] ; t & & l ( t ) } ) , n ( n u l l , r ) } , a . p r o t o t y p e . p u t C o o k i e = f u n c t i o n ( e , t ) { t h i s . i d x [ e . d o m a i n ] | | ( t h i s . i d x [ e . d o m a i n ] = { } ) , t h i s . i d x [ e . d o m a i n ] [ e . p a t h ] | | ( t h i s . i d x [ e . d o m a i n ] [ e . p a t h ] = { } ) , t h i s . i d x [ e . d o m a i n ] [ e . p a t h ] [ e . k e y ] = e , t ( n u l l ) } , a . p r o t o t y p e . u p d a t e C o o k i e = f u n c t i o n ( e , t , n ) { t h i s . p u t C o o k i e ( t , n ) } , a . p r o t o t y p e . r e m o v e C o o k i e = f u n c t i o n ( e , t , n , r ) { t h i s . i d x [ e ] & & t h i s . i d x [ e ] [ t ] & & t h i s . i d x [ e ] [ t ] [ n ] & & d e l e t e t h i s . i d x [ e ] [ t ] [ n ] , r ( n u l l ) } , a . p r o t o t y p e . r e m o v e C o o k i e s = f u n c t i o n ( e , t , n ) { r e t u r n t h i s . i d x [ e ] & & ( t ? d e l e t e t h i s . i d x [ e ] [ t ] : d e l e t e t h i s . i d x [ e ] ) , n ( n u l l ) } , a . p r o t o t y p e . r e m o v e A l l C o o k i e s = f u n c t i o n ( e ) { r e t u r n t h i s . i d x = { } , e ( n u l l ) } , a . p r o t o t y p e . g e t A l l C o o k i e s = f u n c t i o n ( e ) { v a r t = [ ] , n = t h i s . i d x , r = O b j e c t . k e y s ( n ) ; r . f o r E a c h ( f u n c t i o n ( e ) { v a r r = O b j e c t . k e y s ( n [ e ] ) ; r . f o r E a c h ( f u n c t i o n ( r ) { v a r i = O b j e c t . k e y s ( n [ e ] [ r ] ) ; i . f o r E a c h ( f u n c t i o n ( i ) { n u l l ! = = i & & t . p u s h ( n [ e ] [ r ] [ i ] ) } ) } ) } ) , t . s o r t ( f u n c t i o n ( e , t ) { r e t u r n ( e . c r e a t i o n I n d e x | | 0 ) - ( t . c r e a t i o n I n d e x | | 0 ) } ) , e ( n u l l , t ) } } , f u n c t i o n ( e , t ) { e . e x p o r t s = " 2 . 5 . 0 " } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ; e . e x p o r t s = n ( 8 4 5 ) } , f u n c t i o n ( e , t , n ) { " u s e s t r i c t " ; e . e x p o r t s = n ( 3 0 4 ) } , f u n c t i o n ( e , t , n ) { c o n s t r = n ( 8 4 7 ) ; e . e x p o r t s = n e w r } , f u n c t i o n ( e , t , n ) { c o n s t r = n ( 8 ) , i = n ( 8 4 8 ) , { Q u o t a E x c e e d e d E r r o r : o , T y p e M i s m a t c h E r r o r : l } = n ( 1 1 0 ) , a = [ I n t 8 A r r a y , U i n t 8 A r r a y , I n t 1 6 A r r a y , U i n t 1 6 A r r a y , I n t 3 2 A r r a y , U i n t 3 2 A r r a y ] , s = { I n t 8 A r r a y : " g e t I n t 8 " , U i n t 8 A r r a y : " g e t U i n t 8 " , I n t 1 6 A r r a y : " g e t I n t 1 6 " , U i n t 1 6 A r r a y : " g e t U i n t 1 6 " , I n t 3 2 A r r a y : " g e t I n t 3 2 " , U i n t 3 2 A r r a y : " g e t U i n t 3 2 " } ; c l a s s u { g e t R a n d o m V a l u e s ( e ) { i f ( ! a . s o m e ( t = > e i n s t a n c e o f t ) ) t h r o w n e w l ; l e t t = e . b y t e L e n g t h ; i f ( t > 6 5 5 3 6 ) t h r o w n e w o ; l e t n = e . c o n s t r u c t o r , i = s [ n . n a m e ] , u = t * e . l e n g t h , c = r . r a n d o m B y t e s ( u ) , h = n e w U i n t 8 A r r a y ( c ) , p = n e w D a t a V i e w ( h . b u f f e r ) ; f o r ( l e t n = 0 ; n < u ; n + = t ) { l e t r = p [ i ] ( n ) , o = n / t ; e [ o ] = r } r e t u r n e } g e t s u b t l e ( ) { r e t u r n n e w i } } e . e x p o r t s = u } , f u n c t i o n ( e , t , n ) { c o n s t r = n ( 8 4 9 ) , i = n ( 8 5 0 ) , o = n ( 8 5 1 ) , l = n ( 8 5 2 ) , a = n ( 8 5 3 ) , { I n v a l i d A c c e s s E r r o r : s , N o t S u p p o r t e d E r r o r : u } = n ( 1 1 0 ) , { T e x t E n c o d e r : c , T e x t D e c o d e r : h } = n ( 8 6 6 ) ; c l a s s p { e n c r y p t ( e , t , n ) { n = n . s l i c e ( ) ; l e t r = a . n o r m a l i z e ( " e n c r y p t " , e ) ; r e t u r n r i n s t a n c e o f E r r o r ? P r o m i s e . r e j e c t ( r ) : n e w P r o m i s e ( ( i , o ) = > { i f ( r . n a m e ! = = t . a l g o r i t h m . n a m e ) t h r o w n e w s ( " A l g o r i t h m d o e s n o t m a t c h k e y " ) ; i f ( ! t . u s a g e s . i n c l u d e s ( " e n c r y p t " ) ) t h r o w n e w s ( ' K e y u s a g e s m u s t i n c l u d e " e n c r y p t " ' ) ; l e t l = r . e n c r y p t ( e , t , n ) ; i ( l ) } ) } d e c r y p t ( e , t , n ) { l e t r = a . n o r m a l i z e ( " d e c r y p t " , e ) ; r e t u r n r i n s t a n c e o f E r r o r ? P r o m i s e . r e j e c t ( r ) : ( n = n . s l i c e ( ) , n e w P r o m i s e ( ( i , o ) = > { i f ( r . n a m e ! = = t . a l g o r i t h m . n a m e ) t h r o w n e w s ( " A l g o r i t h m d o e s n o t m a t c h k e y " ) ; i f ( ! t . u s a g e s . i n c l u d e s ( " d e c r y p t " ) ) t h r o w n e w s ( ' K e y u s a g e s m u s t i n c l u d e " d e c r y p t " ' ) ; l e t l = r . d e c r y p t ( e , t , n ) ; i ( l ) } ) ) } s i g n ( e , t , n ) { n = n . s l i c e ( ) ; l e t r = a . n o r m a l i z e ( " s i g n " , e ) ; r e t u r n r i n s t a n c e o f E r r o r ? P r o m i s e . r e j e c t ( r ) : n e w P r o m i s e ( ( e , i ) = > { i f ( r . n a m e ! = = t . a l g o r i t h m . n a m e ) t h r o w n e w s ( " A l g o r i t h m d o e s n o t m a t c h k e y " ) ; i f ( ! t . u s a g e s . i n c l u d e s ( " s i g n " ) ) t h r o w n e w s ( ' K e y u s a g e s m u s t i n c l u d e " s i g n " ' ) ; l e t o = r . s i g n ( t , n ) ; e ( o ) } ) } v e r i f y ( e , t , n , r ) { n = n . s l i c e ( ) ; l e t i = a . n o r m a l i z e ( " v e r i f y " , e ) ; r e t u r n i i n s t a n c e o f E r r o r ? P r o m i s e . r e j e c t ( i ) : ( r = r . s l i c e ( ) , n e w P r o m i s e ( ( e , o ) = > { i f ( i . n a m e ! = = t . a l g o r i t h m . n a m e ) t h r o w n e w s ( " A l g o r i t h m d o e s n o t m a t c h k e y " ) ; i f ( ! t . u s a g e s . i n c l u d e s ( " v e r i f y " ) ) t h r o w n e w s ( ' K e y u s a g e s m u s t i n c l u d e " v e r i f y " ' ) ; l e t l = i . v e r i f y ( t , n , r ) ; e ( l ) } ) ) } d i g e s t ( e , t ) { t = t . s l i c e ( ) ; l e t n = a . n o r m a l i z e ( " d i g e s t " , e ) ; r e t u r n n i n s t a n c e o f E r r o r ? P r o m i s e . r e j e c t ( n ) : n e w P r o m i s e ( ( r , i ) = > { t r y { l e t o = n . d i g e s t ( e , t ) ; r e t u r n r ( o ) } c a t c h ( e ) { r e t u r n i ( e ) } } ) } g e n e r a t e K e y ( e , t , n ) { l e t o = a . n o r m a l i z e ( " g e n e r a t e K e y " , e ) ; r e t u r n o i n s t a n c e o f
