dist/eth-signer.min.js
function me(Me){// Don't use UCS-2
var Ue=[],Fe=Me.length,Ke=0,qe=Be,Ve=Pe,He,Ge,Ye,We,Xe,Je,Ze,Qe,$e,/** Cached calculation results */et;// Handle the basic code points: let `basic` be the number of input code
// points before the last delimiter, or `0` if there is none, then copy
// the first basic code points to the output.
for(Ge=Me.lastIndexOf(Re),0>Ge&&(Ge=0),Ye=0;Ye<Ge;++Ye)128<=Me.charCodeAt(Ye)&&de("not-basic"),Ue.push(Me.charCodeAt(Ye));// Main decoding loop: start just after the last delimiter if any basic code
// points were copied; start at the beginning otherwise.
for(We=0<Ge?Ge+1:0;We<Fe;)/* no final expression */{// `index` is the index of the next character to be consumed.
// Decode a generalized variable-length integer into `delta`,
// which gets added to `i`. The overflow checking is easier
// if we increase `i` as we go, then subtract off its starting
// value at the end to obtain `delta`.
for(Xe=Ke,Je=1,Ze=Ae;;/* no condition */Ze+=Ae){if(We>=Fe&&de("invalid-input"),Qe=ue(Me.charCodeAt(We++)),(Qe>=Ae||Qe>Le((Ie-Ke)/Je))&&de("overflow"),Ke+=Qe*Je,$e=Ze<=Ve?we:Ze>=Ve+Ee?Ee:Ze-Ve,Qe<$e)break;et=Ae-$e,Je>Le(Ie/et)&&de("overflow"),Je*=et}He=Ue.length+1,Ve=he(Ke-Xe,He,0==Xe),Le(Ke/He)>Ie-qe&&de("overflow"),qe+=Le(Ke/He),Ke%=He,Ue.splice(Ke++,0,qe)}return pe(Ue)}
function me(Me){// Don't use UCS-2
var Ue=[],Fe=Me.length,Ke=0,qe=Be,Ve=Pe,He,Ge,Ye,We,Xe,Je,Ze,Qe,$e,/** Cached calculation results */et;// Handle the basic code points: let `basic` be the number of input code
// points before the last delimiter, or `0` if there is none, then copy
// the first basic code points to the output.
for(Ge=Me.lastIndexOf(Re),0>Ge&&(Ge=0),Ye=0;Ye<Ge;++Ye)128<=Me.charCodeAt(Ye)&&de("not-basic"),Ue.push(Me.charCodeAt(Ye));// Main decoding loop: start just after the last delimiter if any basic code
// points were copied; start at the beginning otherwise.
for(We=0<Ge?Ge+1:0;We<Fe;)/* no final expression */{// `index` is the index of the next character to be consumed.
// Decode a generalized variable-length integer into `delta`,
// which gets added to `i`. The overflow checking is easier
// if we increase `i` as we go, then subtract off its starting
// value at the end to obtain `delta`.
for(Xe=Ke,Je=1,Ze=Ae;;/* no condition */Ze+=Ae){if(We>=Fe&&de("invalid-input"),Qe=ue(Me.charCodeAt(We++)),(Qe>=Ae||Qe>Le((Ie-Ke)/Je))&&de("overflow"),Ke+=Qe*Je,$e=Ze<=Ve?we:Ze>=Ve+Ee?Ee:Ze-Ve,Qe<$e)break;et=Ae-$e,Je>Le(Ie/et)&&de("overflow"),Je*=et}He=Ue.length+1,Ve=he(Ke-Xe,He,0==Xe),Le(Ke/He)>Ie-qe&&de("overflow"),qe+=Le(Ke/He),Ke%=He,Ue.splice(Ke++,0,qe)}return pe(Ue)}
function me ( Me ) { // Don't use UCS-2 var Ue = [ ] , Fe = Me . length , Ke = 0 , qe = Be , Ve = Pe , He , Ge , Ye , We , Xe , Je , Ze , Qe , $e , /** Cached calculation results */ et ; // Handle the basic code points: let `basic` be the number of input code // points before the last delimiter, or `0` if there is none, then copy // the first basic code points to the output. for ( Ge = Me . lastIndexOf ( Re ) , 0 > Ge && ( Ge = 0 ) , Ye = 0 ; Ye < Ge ; ++ Ye ) 128 <= Me . charCodeAt ( Ye ) && de ( "not-basic" ) , Ue . push ( Me . charCodeAt ( Ye ) ) ; // Main decoding loop: start just after the last delimiter if any basic code // points were copied; start at the beginning otherwise. for ( We = 0 < Ge ? Ge + 1 : 0 ; We < Fe ; ) /* no final expression */ { // `index` is the index of the next character to be consumed. // Decode a generalized variable-length integer into `delta`, // which gets added to `i`. The overflow checking is easier // if we increase `i` as we go, then subtract off its starting // value at the end to obtain `delta`. for ( Xe = Ke , Je = 1 , Ze = Ae ; ; /* no condition */ Ze += Ae ) { if ( We >= Fe && de ( "invalid-input" ) , Qe = ue ( Me . charCodeAt ( We ++ ) ) , ( Qe >= Ae || Qe > Le ( ( Ie - Ke ) / Je ) ) && de ( "overflow" ) , Ke += Qe * Je , $e = Ze <= Ve ? we : Ze >= Ve + Ee ? Ee : Ze - Ve , Qe < $e ) break ; et = Ae - $e , Je > Le ( Ie / et ) && de ( "overflow" ) , Je *= et } He = Ue . length + 1 , Ve = he ( Ke - Xe , He , 0 == Xe ) , Le ( Ke / He ) > Ie - qe && de ( "overflow" ) , qe += Le ( Ke / He ) , Ke %= He , Ue . splice ( Ke ++ , 0 , qe ) } return pe ( Ue ) }
Converts a Punycode string of ASCII-only symbols to a string of Unicode
symbols.
@memberOf punycode
@param {String} input The Punycode string of ASCII-only symbols.
@returns {String} The resulting string of Unicode symbols.
Converts a Punycode string of ASCII - only symbols to a string of Unicode symbols .