From f8ffe2e948f175e595d7ef5422ef1d02f93b5e99 Mon Sep 17 00:00:00 2001 From: Dexaran Date: Sat, 22 Jul 2023 03:55:53 +0400 Subject: [PATCH] Add files via upload --- ipfs/LICENSE | 2 +- ipfs/README.md | 81 +- ipfs/config.js | 23 + ipfs/css/node-menu.css | 213 + ipfs/css/style.css | 317 + ipfs/css/upload-utilities.css | 138 + ipfs/img/connect.png | Bin 0 -> 1114 bytes ipfs/img/connected.png | Bin 0 -> 914 bytes ipfs/img/disconnected.png | Bin 0 -> 1130 bytes ipfs/img/favicon.ico | Bin 0 -> 14764 bytes ipfs/img/ipfs.png | Bin 0 -> 20770 bytes ipfs/img/link.png | Bin 0 -> 22912 bytes ipfs/img/preview.png | Bin 0 -> 365083 bytes ipfs/img/reset.png | Bin 0 -> 8506 bytes ipfs/img/upload.png | Bin 0 -> 11409 bytes ipfs/index.html | 253 + ipfs/js/buffer.js | 2 + ipfs/js/connect-and-upload.js | 256 + ipfs/js/ipfs-http-client.js | 77569 ++++++++++++++++++++++++++++++++ ipfs/js/jquery.min.js | 5 + ipfs/js/node-config.js | 43 + ipfs/js/node-menu.js | 43 + ipfs/package-lock.json | 1343 + 23 files changed, 80230 insertions(+), 58 deletions(-) create mode 100644 ipfs/config.js create mode 100644 ipfs/css/node-menu.css create mode 100644 ipfs/css/style.css create mode 100644 ipfs/css/upload-utilities.css create mode 100644 ipfs/img/connect.png create mode 100644 ipfs/img/connected.png create mode 100644 ipfs/img/disconnected.png create mode 100644 ipfs/img/favicon.ico create mode 100644 ipfs/img/ipfs.png create mode 100644 ipfs/img/link.png create mode 100644 ipfs/img/preview.png create mode 100644 ipfs/img/reset.png create mode 100644 ipfs/img/upload.png create mode 100644 ipfs/index.html create mode 100644 ipfs/js/buffer.js create mode 100644 ipfs/js/connect-and-upload.js create mode 100644 ipfs/js/ipfs-http-client.js create mode 100644 ipfs/js/jquery.min.js create mode 100644 ipfs/js/node-config.js create mode 100644 ipfs/js/node-menu.js create mode 100644 ipfs/package-lock.json diff --git a/ipfs/LICENSE b/ipfs/LICENSE index ed57935c..e2a06c2c 100644 --- a/ipfs/LICENSE +++ b/ipfs/LICENSE @@ -1,6 +1,6 @@ MIT License -Copyright (c) 2022 Dexaran +Copyright (c) 2019 Anarkrypto Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal diff --git a/ipfs/README.md b/ipfs/README.md index f1920574..80b68a26 100644 --- a/ipfs/README.md +++ b/ipfs/README.md @@ -5,82 +5,49 @@ -

Introdução

+### Introduction -Suba seus arquivos para a IPFS diretamente pelo Browser. -Você pode escolher entre usar um node IPFS rodando localmente ou remotamente, portanto instalar um node IPFS é opcional. +Upload your files to IPFS directly from the Browser using local or remote IPFS nodes. -Uma interface web simples e intituiva para a API [js-ipfs-http-client](https://github.com/ipfs/js-ipfs-http-client) +A simple and intuitive web interface for the API [js-ipfs-http-client](https://github.com/ipfs/js-ipfs-http-client) -As linguagens utilizadas aqui (javascript, html e css) se aplicam a qualquer servidor web, podem rodar tanto com node js, conforme segue o tutorial abaixo, como em outros. -Para rodar no apache e nginx, por exemplo, basta copiar os arquivos de dentro do diretório -[/public](https://github.com/anarkrypto/upload-files-to-ipfs-from-browser-panel/tree/master/public") para o diretório do seu servidor (por exemplo /var/www/html/). +[

Demo Online

](https://anarkrypto.github.io/upload-files-to-ipfs-from-browser-panel/public) - [

Demo Online

](https://anarkrypto.github.io/upload-files-to-ipfs-from-browser-panel/public) - - - -Você pode acessar o mesmo neste link. É o mesmo código, hospedado pelo Github Pages - - -Caso decida usar um node IPFS rodando localmente, lembre-se de [Setar o Cors](#Cors) corretamente. - -Caso contrário terá erros de permissão nas requisiçôes. - -## Instalando e rodando (node js): - -Primeiramente resolva as dependências (git, npm e node js) - -Debian / Ubuntu: -```bash - sudo apt update && sudo apt upgrade - - sudo apt install curl python-software-properties - - curl -sL https://deb.nodesource.com/setup_12.x | sudo -E bash - - - sudo apt install nodejs - - sudo apt install git -``` - -Para verificar as versões instaladas: -```bash -node -v -npm -v -git --version -``` - -Instalando +## Running locally (node js): ```bash +// Clone this project git clone https://github.com/anarkrypto/upload-files-to-ipfs-from-browser-panel.git +// Go to the project directory cd upload-files-to-ipfs-from-browser-panel +// Instal node dependencies npm install -``` - - Para iniciar o servidor localmente então, (porta 3000 por padrão), digite no mesmo diretório: - -```bash -node app.js +// Run the server: +app.js ``` -Se deu tudo certo, ele vai retornar algo como +If everything went well, it will return something like: ``` Server listening on https://localhost:3000 ``` -Então abra este endereço https://localhost:3000 no seu navegador e pronto! Já pode começar a enviar seus arquivos, a interface é intuitiva. +So open the address https://localhost:3000 in your browser and that's it! +You can now start uploading your files. -### Para rodar a API em um node IPFS localmente +### Sending to a local IPFS node -Caso ainda não tenha instalado, siga os passos de instalação e configuração do node IPFS: [IPFS - Getting Started](https://ipfs.io/ipfs/Qme5m1hmmMbjdzcDeUC2LtHZxAABYtdmq5mBpvtBsC8VL5/docs/getting-started/) +If you haven't installed it yet, follow the steps to install and configure the IPFS node: [IPFS - Getting Started](https://ipfs.io/ipfs/Qme5m1hmmMbjdzcDeUC2LtHZxAABYtdmq5mBpvtBsC8VL5/docs/getting-started/) #### Cors -Após isso, configure o CORS, com os seguintes comandos no seu terminal: + +To use an IPFS node running locally you need to set IPFS CORS policies correctly. + +Otherwise, you will have permission errors in the requests. + +Paste the following commands in your terminal: ```bash ipfs config --json API.HTTPHeaders.Access-Control-Allow-Origin '["*"]' @@ -90,11 +57,11 @@ ipfs config --json API.HTTPHeaders.Access-Control-Expose-Headers '["Location"]' ipfs config --json API.HTTPHeaders.Access-Control-Allow-Credentials '["true"]' ``` -Inicie o node novamente +Start / Restart IPFS node: ```bash ipfs daemon ``` -Pronto! Seu node estará online localmente e pronto pra servir as requisições API. +Ready! Your node will be online locally and ready to serve API requests. -Por padrão, o node IPFS roda a API em localhost:5001 (ou 127.0.0.1:5001). E o gateway na porta 8080. +By default, the IPFS node runs the API at localhost:5001 (or 127.0.0.1:5001). And the gateway on port 8080. diff --git a/ipfs/config.js b/ipfs/config.js new file mode 100644 index 00000000..b84f88e3 --- /dev/null +++ b/ipfs/config.js @@ -0,0 +1,23 @@ +// Change this file as you need it + +const config = { + port: 5001, + gateway: 8080 +} + +const node = { + // default remote Node + default: 'remote', + remote: { + address: 'ipfs.sea.tube', + ...config, + protocol: 'https' + }, + + // default local node + local: { + address: '127.0.0.1', + ...config, + protocol: 'http' + } +} diff --git a/ipfs/css/node-menu.css b/ipfs/css/node-menu.css new file mode 100644 index 00000000..2f4f69c6 --- /dev/null +++ b/ipfs/css/node-menu.css @@ -0,0 +1,213 @@ +.form { + background: rgba(35, 61, 77, 0.81); + padding: 15px; + width: 100%; + border-radius: 4px; + box-shadow: 0 4px 10px 4px rgba(19, 35, 47, 0.3); +} + +.tab-group { + list-style: none; + padding: 0; + margin: 0 0 20px 0; +} + +.tab-group:after { + content: ""; + display: table; + clear: both; +} + +.tab-group li a { + display: block; + text-decoration: none; + padding: 10px; + background: rgba(160, 179, 176, 0.25); + color: #a0b3b0; + font-size: 16px; + float: left; + width: 50%; + text-align: center; + cursor: pointer; + -webkit-transition: .5s ease; + transition: .5s ease; +} + +#localProtocol li, +#remoteProtocol li { + margin-left: 25%; +} + +#localProtocol li a, +#remoteProtocol li a { + width: 28%; + padding: 4px; + font-size: 14px; +} + +.tab-group li a:hover { + background: #207ab6; + color: #ffffff; + cursor: pointer; +} + +.tab-group .active a { + background: #3498db; + color: #ffffff; +} + +.tab-content > div:last-child { + display: none; +} + +.form h1 { + text-align: center; + color: #ffffff; + font-weight: 300; + margin-bottom: 10px; + padding: 0px 0px; + font-size: 1em; +} + +.form label { + position: absolute; + left: 10px; + color: rgba(255, 255, 255, 0.5); + transition: all 0.25s ease; + pointer-events: none; + font-size: 13px; +} + +label .req { + margin: 2px; + color: #3498db; +} + +label.active { + -webkit-transform: translateY(30px); + transform: translateY(30px); + left: 2px; + font-size: 14px; +} + +label.active .req { + opacity: 0; +} + +label.highlight { + color: #ffffff; +} + +input, +textarea { + font-size: 15px; + width: 100%; + height: 100%; + padding: 5px 10px; + background: none; + background-image: none; + border: 1px solid #a0b3b0; + color: #ffffff; + border-radius: 0; + -webkit-transition: border-color .25s ease, box-shadow .25s ease; + transition: border-color .25s ease, box-shadow .25s ease; +} + +input:focus, +textarea:focus { + outline: 0; + border-color: #207ab6; +} + +input:disabled { + opacity: .4; +} + +textarea { + border: 2px solid #a0b3b0; + resize: vertical; +} + +.field-wrap { + position: relative; + margin-bottom: 20px; +} + +.top-row:after { + content: ""; + display: table; + clear: both; +} +.top-row > div { + margin-right: 4%; +} + +#address { + float: left; + width: 70%; +} + +#apiPort { + float: right; + width: 26%; +} + +#gatewayPort { + float: right; + width: 26%; +} + +.top-row > div:last-child { + margin: 0; +} + +.button { + border: 0; + outline: none; + border-radius: 0; + padding: 6px 0; + font-size: 1rem; + font-weight: 500; + text-transform: uppercase; + letter-spacing: .1em; + background: #3498db; + color: #ffffff; + -webkit-transition: all 0.5s ease; + transition: all 0.5s ease; + -webkit-appearance: none; +} +.button:hover, +.button:focus { + background: #207ab6; + cursor: pointer; +} + +.button-block { + display: flex; + width: 100%; + flex-direction: column; + justify-content: center; + align-items: center; +} + +.button-block > div:first-child { + display: flex; + justify-content: center; + align-items: center; +} + +.button-block img { + width: 20px; +} + +.min-line { + display: inline-block; + width: 12px; + height: 10px; + border-radius: 5px; + background-color: #0c89ba; +} + +.min-loading-hidden { + display: none; +} diff --git a/ipfs/css/style.css b/ipfs/css/style.css new file mode 100644 index 00000000..90d14ad6 --- /dev/null +++ b/ipfs/css/style.css @@ -0,0 +1,317 @@ +html, body { + margin: 0px; + padding: 0px; + width: 100%; + font: 14px "Lucida Grande", Helvetica, Arial, sans-serif; + background-color: #e9ebee; +} + +#content { + margin: 15px auto; + width: 100%; + max-width: 1000px; + display: flex; + flex-direction: column; + background-color: white; + align-items: center; + padding-bottom: 50px; +} + +#wrapper { + background-color: white; + padding: 50px 0px 50px 0px; + display: flex; + flex-direction: row-reverse; + flex-wrap: wrap; + justify-content: space-around; + width: 100%; +} + +#left { + width: 400px; +} + +#right { + width: 400px; +} + +nav { + text-transform: uppercase; + color: #92b0b3; + width: 100%; + max-width: 1400px; + display: flex; + justify-content: space-around; + align-items: center; + flex-wrap: wrap; +} + +nav ul { + list-style: none; + padding: 0; + margin: 0; + display: flex; + flex-wrap: wrap; +} + +nav img { + width: 40px; +} + +nav > ul > li { + display: inline-block; + padding: 25px 1.2em; + white-space: nowrap; + position: relative; +} + +nav a { + color: #92b0b3; + text-decoration: none; +} + +nav a:hover { + color: white; +} + +nav a:hover > * { + fill: white; +} + +nav .svg { + fill: #92b0b3; + height: 1.2em; + width: 1.2em; + display: block; + float: right; +} + +nav ul ul { + display: none; + position: absolute; + top: 100%; /*sets the top edge of the element above/below top edge of nearest ancestor*/ +} + +nav ul li:hover > ul { + display: block; +} + +nav ul ul li { + float: none; + background: rgba(35, 61, 77, 0.81); + padding: 10px; + text-align: center; +} + +nav ul ul li a { + color: #92b0b3; +} + +nav ul ul li a:hover { + color: white; +} + +*, +*:before, +*:after { + box-sizing: border-box; +} + +@media screen and (max-width: 860px) { + nav h1 { + margin-top: 25px; + } + pre#response { + margin: 30px 0; + } +} + +@media screen and (max-width: 477px) { + nav h1 { + font-size: 14px; + } + nav ul { + font-size: 12px; + } +} + +@media screen and (max-width: 410px) { + nav h1 { + margin: 15px 0; + } + + nav > ul > li { + padding: 0 .5em 15px; + } +} + +@media screen and (max-width: 390px) { + #wrapper { + padding: 50px 0; + } +} + +@media screen and (max-width: 370px) { + nav h1 { + font-size: 13px; + } + + nav img { + width: 30px; + } +} + +@media screen and (max-width: 355px) { + nav h1 { + font-size: 12px; + } + + nav img { + width: 28px; + } +} + +@media screen and (max-width: 350px) { + nav h1 { + font-size: 11px; + } + + nav img { + width: 25px; + } + + nav > ul > li { + font-size: 11px; + } +} + +h1 { + color: #92b0b3; + font-weight: 500; + font-size: 1.2em; + display: flex; + align-items: center; + margin: 0; +} + +.buttonContent > div:first-child { + display: flex; + justify-content: center; + align-items: center; +} + +.buttonContent > div:first-child img { + margin-left: 5px; +} + +.min-loading { + display: flex; + justify-content: center; + align-items: center; + position: relative; + width: 64px; +} + +.min-loading.blue { + width: 68px; +} + +.min-loading div { + position: absolute; + width: 11px; + height: 11px; + border-radius: 50%; + background: #fff; + animation-timing-function: cubic-bezier(0, 1, 1, 0); +} + +.min-loading.blue div { + background-color: #3498db; + width: 15px; + height: 15px; +} + +.min-loading div:nth-child(1) { + left: 6px; + animation: min-loading1 0.6s infinite; +} +.min-loading div:nth-child(2) { + left: 6px; + animation: min-loading2 0.6s infinite; +} +.min-loading div:nth-child(3) { + left: 26px; + animation: min-loading2 0.6s infinite; +} +.min-loading div:nth-child(4) { + left: 45px; + animation: min-loading3 0.6s infinite; +} +@keyframes min-loading1 { + 0% { + transform: scale(0); + } + 100% { + transform: scale(1); + } +} +@keyframes min-loading3 { + 0% { + transform: scale(1); + } + 100% { + transform: scale(0); + } +} +@keyframes min-loading2 { + 0% { + transform: translate(0, 0); + } + 100% { + transform: translate(19px, 0); + } +} + +.loading-hidden { + display: none; +} + +@keyframes spin { + 0% { + transform: rotate(0deg); + } + 100% { + transform: rotate(360deg); + } +} + +#divResponse { + width: 100%; +} + +#divResponse pre { + display: flex; + flex-direction: column; + color: #333; + min-height: 80px; + background-color: #f5f5f5; + border: 1px solid #ccc; + padding: 7px; + font-size: 12px; + overflow: auto; + margin: 30px 0; + white-space: pre-wrap; + word-break: break-word; +} + +.b-nav { + margin: 0px auto; + width: 100%; + display: flex; + align-items: center; + background: rgba(35, 61, 77, 0.81); + display: flex; + justify-content: space-around; + align-items: center; + flex-wrap: wrap; +} diff --git a/ipfs/css/upload-utilities.css b/ipfs/css/upload-utilities.css new file mode 100644 index 00000000..983fb55c --- /dev/null +++ b/ipfs/css/upload-utilities.css @@ -0,0 +1,138 @@ +#fileDropBox { + line-height: 5em; + text-align: center; + border-radius: 7px; + color: #0f3c4b; + background-color: #e5edf1; + outline: 1px dashed gray; + outline-offset: -6px; + box-shadow: 0 4px 10px 4px rgba(19, 35, 47, 0.3); + padding: 25px 0 0; + width: 100%; +} + +.box_icon { + width: 100%; + height: 60px; + vertical-align: middle; + text-align: center; + fill: #92b0b3; +} + +.box_file { + position: absolute; +} + +#fileDropBox label { + cursor: pointer; + box-sizing: border-box; + -webkit-font-smoothing: antialiased; + -moz-osx-font-smoothing: grayscale; +} + +#fileDropBox label:hover, +#fileDropBox label:focus { + background: #207ab6; + cursor: pointer; +} + +input[type='file'] { + display: none; +} + +#fileDropBox label { + background-color: #3498db; + color: #fff; + margin: 10px; + padding: 6px 20px; + font-size: 1rem; + text-transform: uppercase; + letter-spacing: .1em; + border-radius: .2em; +} + +.box_button { + border: 0; + outline: none; + padding: 10px; + font-size: 1rem; + width: 9rem; + text-transform: uppercase; + letter-spacing: .1em; + background-color: #3498db; + color: #ffffff; + transition: all 0.5s ease; + -webkit-appearance: none; + box-shadow: 0 2px 5px 2px rgba(19, 35, 47, 0.3); + font-weight: bold; +} + +.box_button img { + margin-bottom: -2px; + margin-left: 2px; + width: 18px; +} + +#upload_conf { + display: flex; +} + +.box_button:hover, +.box_button:focus { + background: #207ab6; + cursor: pointer; +} + +#list { + max-height: 400px; + min-height: 100px; + border: 1px solid #ccc; + margin-top: 30px; + overflow: auto; + width: 100%; +} + +#list ul { + margin: 0; + padding: 10px; + list-style-type: none; + color: #687b9d; +} + +#list li { + margin-top: 3px; + background-color: #f2f3f5; + border: 1px solid #dbdbdb; + padding: 5px 0px 6px 8px; + word-wrap: break-word; + font-size: 14px; +} + +#list .uploaded { + text-decoration: none; + color: #3498db; +} + +#list .uploaded:hover { + color: #207ab6; + cursor: pointer; +} + +.removeItem { + color: red; + font-size: 20px; + text-decoration: none; +} + +.removeItem:hover { + font-weight: bold; + cursor: pointer; +} + +spam#fileProperties { + color: #687b9d; +} + +spam#info { + color: #92b0b3; +} diff --git a/ipfs/img/connect.png b/ipfs/img/connect.png new file mode 100644 index 0000000000000000000000000000000000000000..110b4b3317d5cdacf40f0c1ca7c7f012a32c4325 GIT binary patch literal 1114 zcmV-g1f~0lP)4D>bjl$}9i?1LsLZ zK~#9!?cLpO+b|4Km;VON@7J3EeT_!d)*%s1R&jRbSe>$+E4M9 z?-P&+kVu@W)De>6hl&IyAc3iJ_tt%k1STpHn1BQ(Ac2Vh2~0o&6Oh2v;1U3kz(hp? zQ=I(-(&Ca&MIs;q5{Q5VA|QbXNCZSc0@2y2KafB~MGAsQg)89gA$cy5mlcx&DGs9S zn1B=rQASKGYZDYv>&i4hwB!tqj*0b=5+I6>X~}jC5G`%^Hr*T-B-caGV*Aq)k_BmW zt&E6@w71c4Eoabw5&v&(eiBH3A|L5jC?4 zRYHSe;&*Myx|)dHT&pzzMxg^~Aj%D?(uKlwgWQT;8<-j|w)F^p&}O!)+CAW9D^m39 zIILDn*9N98kPJ+uQ$+$(U`Pfg(zPO0!u0VS+Ypf-BJvtyqi%fHR^?z+Dh4ki@-q{p zO5H;>Oz(7UbaNj2@&Y60zx-yn~0}`0LwqJn+rnJCEqcgT! zWuhX1Dc^Qqfuvv}RHS~GwmtzINcAxR2~5-5Y*OH%Heh0mL<(S1+4v+XAl1bbdNERd z&qX&!MFJC$z*GTHW4RY&wMP^<6rNeT1;qHqT|W%~{gk=>9$M5ZBuh)j=>xM!J6SESkJlPQR(NL~-Q z)6JC)KuMFPsYtT-NBaN?*09Jf9WR|Nf!t~GO|vFd=lA?c#Cnf!UY znQqp`0gnkP6(k;V7YmU};)=v=6tTuy+kQEFS-SI6wn@`)&o%)P0TKZcAwVKPB0wTQ gA_PbTNF-N&0e(ByKAt|gW!U_%O?XxI14-? ziy0WWg+Z8+Vb&Z8pdfpRr>`sfV|GqHDXx=Vc{dptnB_fP978H@y}f(a@2~+6+l9(o zzxQw2$;#p*y;j=#`Rb~r zO0E@=F4!ClUK>G*w%tCf`Yb%TW9|mV^4g^*>yStpewtR9>ykGa5Dt{L#6p*ip3 zI|i8&EtwJ{xflm_AhmC)6Nsw6%n*Awf{}eLSGnt_2hSV$b_8#9WRI~ld(ohM+)Of- zVY`~yRK6WWITski`*MYLF|1=Zo0=C~u=7Usi+fYG&3iq8d&wywO)x<07|Vsvi5J_Vc?#PuCtO zJ9(@4cIn*e?i(+1nE8NdqB-}Tl%8YoL#u@D*}q>hg?GGN)yaS3*VZeGH`M-*p2y=W z)pS}|-Igy-+Uc51jF?~Do*%yoc$vdHc~_k^=jH4SX>9gAb>N^{>Vt&IMg2DGby?uG|0s1NTWp zK~#9!?cLj!n=lN8VdUlae`WQmtEV;10J5zu{rj@h1h7A3n-F5|ei8CEgC-zAB0wTQ zBIKV;nxJjIT4fm(iM&Ph>2E+Hx1czXNGK2>X?M0OA!4$vJG@vXL_pFVR{RF4EuVn_ zNqAoJ*ZbQkL_pF8^a<3P?HiDKB8uGhqYIKisskt@_Vk4;|3UN`5s*L>f(S?;3PA*< zUl1HbEdQe_iQjBo5K)mn-bUdd0#Z~Z@uG;9ggMf);g1CZkRCTWl?X`fm-x$%2}lG; zBu`c92+8n6MFJC$z*Kp7>pn*U6BP+eKmrqxz(jxqCLn?i7q9TDQ&v622 zamlA55fA|hL_h)&kU#_^0wN%R=#-5WN#S3W7m!A5fs)v2uGaHDyW#spD9NZEe4_tR%% zAQG5t-)V3w*0^mDWn2DNx>KApZo2aY*)mzYhrCciiO|}5y@a0B8W0!I<>^N z&X8Q>J$J=6zuqfAa?$r*wOu=avBmvJohp+Zc)wQnBX!u8EyQUV5M9@GnY&l05|$Jb z-)j>aYBCOUt)2le3U#D|NE=e63x#r%+=@dRm>NH9YbNisH~UrX9`LdiDf@LCo>t4y z2Bt2M989EBMFLY|NDd|vy=qg$WCe~P-71pjY}eR#SA*nWB2*-8OrH68_;n=q6G#km zd5#50`7udA2NDYjAT_`wgL^bQV>=vYxu=oP5lukffn;D}|EWk?m|SiDfyCS}B$Foi zHl_?;!n6mk*|P6cq+FFrw)z37M@Ku5`gDr)ThQS z!z+>(MfCgMt3RDBtPdxMzWska2vEt}QU-`_y{_V9JfuG-h~zrWGWN>=5sB#A0V2)i zcDDVS#Su}3k_>Hcf1k`iBy}=A-p{!Z(O1joZdJ%Tpd1@Ja&?8Ox;&SFKMzy`3p~55 zVy7r(Zbo$HH7jVC;$Ke07*qoM6N<$f(CKnQ2+n{ literal 0 HcmV?d00001 diff --git a/ipfs/img/favicon.ico b/ipfs/img/favicon.ico new file mode 100644 index 0000000000000000000000000000000000000000..34dcba10f91c2b9cc284c1274b5f694774c32ac9 GIT binary patch literal 14764 zcmXwg1z1$y^Zs2LNf8jF1q7r)%B4}d1nF*&li;-G&9_e=z{^L_d}3+Zyu z!PEL^MXR4*)(Ou&gm?_>v+fGOA@&Jj8E9cCM0~baL zqZPAztf!E%mD+3Uwjoku!|*Ss@-QnG1>5Pw-}l32q|nBMZ*yFVo;j`R=lw{)x|!e8 zAG2c(Ph?mRS4zCBEc>St&NOSyM{y->iK#@t`TYYUfhH#&{yf#6;gyV@Gbd>OH~J6D z70uu89FoEq!Ur^}`Ywl$4Phh;D&v=k+Z(;{%j}kcX0tEoz07dJVP1}F&+`1ROquyp z{~c%R!z*R{FO&c7;^WRp_7A@l)GaCKcpfuWFvvw}1{-X*tN$&*V)f3?zQ64-J0bH_ z(?y)=;u>Izx$0=OQ`q8vr5rdQP(2}NY>eKTC{R!&R5~(S!{%gl;bm=H&6c39bK=2` z@$oxzb72ejp`Qm9xyCo>JFaRU-!KNe1b$n{2)79}L!0%3(}-%-x`~+YBxI zNwBu#9A}06_v=F`NVFQy+`dC&wMIwxU)F^OWQet(|P4o{{oK^O}}XelYT{`^59@k)g@HDG%Z z$rEcv1#haGsYsQo34uRqK}HbU5vCX+kJ{2tr+-IO5TzBo{hVoUu+Ae~Rdw0l6|%id z_|`G|{^3B=+qBA|cUs%U`M`R1E7+x72*170NQ^(gGYK4(%G`wbZ49f>EMZJ~Y`D7{ zpP$e4sEV(MEB>w5w`e;Wf_=|r_MFFbGe--(*&C`G)WtmMAZm{#z6F1sv2~4;VOQs2 zKef29fkBdXeFY_Zc`y4(+vIW8`8L-hy{00Y*X8t)1Ln#8`tlm-p8q$xAOf=yfPtgHlu6=MNPuYWU9HNQvxoy@tk_)ft=f{aaS~IL%4$ z)bneO!7uW(1~)u1p|)aE!W2OaevGZqCcNu`rT|p=OB^;@JU2S-S!F$z zDVTQwolveEj9+hl_$t!6WztQM0alEsWG^v6(rjPBdq^S}lqdvwF&_x_i9g=>`@&Yd zX?)|bL!fY&=Qy}GwT-7z*SuCU&}fc|BIa5T>SBH4viRz%m-E_JnATf(GjOCSq_evm11*$i5~nEq zhEfLMjB%ni@wNgUlQV5%S~^$h(>`(14uGv;!Lg15gf)?g>z9)23+MQnNkzrKhhRjQ zOQZ+{`M!1I_vXLUnGVj0S`Zq-Ph^EHOue8DWLJb`Ux^h0*WS24_|OE^Dn@i-hvjN6 zcfN|CySA0I$-v{KzTl;DtL=DY+e_{TIUVQ0=G@DRn6W^!Kb*IuF?)}oYkcwmo|TuW zQgLQ0WUl>j-S{30UTAPdJ`!qqc@{gkpM6zuzR;nTQ#;_NSn&F~GXSGZ|16Q%xD`w4 zD$dWCImg@el^w&=pl9W!D{|(`P-$}ed3NPt#l5m}ZnH;syjcHyEx$hVT#lawK2^415N7{UiiVuzI$Hc;D@<9W@<1j{&2oax3A8<7C1m*LmftT*u#s@#uWmV{X$k~ z*)>iH`B5r0)>3jMZs>UCQ5EKdMfvRJCdT@iE!nL!sqGJA!!s1ZqoKa3S_4T@COtwD>DjWBTvyY5l_ZNG0Z;f-8`X9&+&?!KeDf5U%YMhZ(zrbjh13#vrH+{N zsqoS1c;s6(Uy;pQj}Iksv!t9_k4qUk9{$TVw+qWP848&Xlu;LkHu_Qa6(TpNF;+Bg zn7RSmD*_-tZHzK>nRm*t_ue8}aY?nKf;(!J|C}E!t$hyD6x+Wvk*e{4VZ^A;-o=j~ zGx&;XnTTDZxhO+^X}>DNnhvE+WVl~=NY}h8^11ogY7$(=dxP%sSlBbk?NyB5wlFeU zbiBk{dnR^)qqywP^#lYF7-3Zrsy{!AX4!)`gik2CSL$Mj$k5if7dOM#>K3u+@2rjm zEAY(>i|lIJr)2cDJwc4)S&3!k8xU1zpGL9_;L5F!v+T9#lkJ426TX05fJ8bkx9b*f zje;{O8Fccm{Gu2G9k{k3Jv7^VqjBIg`6S9a&D>Ak{LUIKStgKLndLcrL|j&G?I^Bn^IFRcCczPHgiZKhY9uc1CecvbP=bCk2WZYWLRgiOGlpzBTYdRZp|}<-UQYF)k#+g*E^0AYl-Z~})9{-KB$}sZ zxcqGo?{w{JGNYa!+_?0UGbnHy$<4?hs1;TKdn3VR86OfI#5NA)Vz|VIZMhZ}a&i6Hs3MO`RPs0d^arhQI8Dg#SZDNd zGlp~4A5lIu?;kr0363Dt{*0}B6I)-ii9-dSGLDPEfyP5Nma6YMjc(3e28VAcp1Y;k zL`8>t?Q#mf&DG&sG*6mF)bBy~{eP)G8?x4}v#dp*tCS>hK$*x^Ka9o%x2FHioE~JKy2D&0=p&m~yS*RSD7IS)f;m@iYN1c;U zgO(a-RTF&qvS4&RZDXLUyE^kQ#?1-3thK$%y`| zRQr>q{lYE96lB~b3syx&fHL_qiN2%yiG-x2N>y9dl;eKo@XtE!Wn<-(ww!#%-)o1N z-=&R_zaRRNM$gXnvcAGhI=3f&n9`WM;&`D!o0?dIL2N45;GQYu z6hFdO`d4tJsMee@k)!;^c5$vALjU$?pgL2DM@PZAew?rlbxAH+0>PAI5R~e-ufFSy zITsiq3YURqSSgrl$duTvP}tV1$w``6@7MPB*z%*)jYlk9>;9MIx>4a(2rJW-6VwEp zB_a6;%3EMJmgYMkVx{OWOVH_OYwgaLwX`DS|9s*wJ!eh4*-d$uD_{|Yexae+JOA^q zoSM(Ni{@^jj79Tikw%JJAPSOFF#W--W}}ggu7uLu>CYIG{tw1rzS_l1j)pkD4wtfI z9m`si@(b(e#aARg^wvenst2AQr-#a49e%!RdXEz=SR#%z=O5w3$NlvjN4St`p-s8G zOxi=Vh|GhIi?$$&p`Px+^@a770B7T4lclyw-ZYnx9-kafEM)(9=gCIAGoMVXfvoZ? z*L;yxcGViF-JO}?Vp9q1NVU3uU&p@$hM$8@*_$5p-VxvS>*u>)v*2-?)>mbWQNMiz z^^?=4X@pV4WSy8M2-%s=u-GvzUc8+2lagx)JjQX=E2+jBriU(A66_!MOGP_Iu|RBQ zZ<4xP7~~pv=ofDI-|kWPVk$KnVHot7YH)0)gj*`1ieqKW?D@$H^JG(>ylxcAS>~qk zD#uyXR!(c9gI!Am?A8QKDjd%6c_vFFIB~{tSmZEiB-@COBku&3P>d7o$nvLe(>3)a z%t3Xv<+-C=PJ4weBFb%cOt*g(?T#)CSTytJf)CUOi{VZH6#|xgqlDG6ImgL%6s>}f zqJGst`qW;9H*MDmQa65dXxZJwi71aNU;)pckF*`@5OR}$(JLpi=uTet91TAPp@kX0ei*cIK`EZyt38`Q4~9Crb=%KZ z&yDnp)*H53HT@;t!FCL_*Uy(1Y0SOi7jkJG$O>g%BufaMUiGROJd&j`s)wWd1B7McG>8>^qu{)>rME(}$$W zIcERl%ARtQR8)*+Z~US!n)z-~BWI&?_-2G-3Ll08^nd3t!eA7N{!Q9&%DEPR;qv1z ztQ>dH-M|sdJ)gD|6eTiq@5E~O!7)phdFtUIY)tBF^9s2|=jahKkPb~F23))8fP_r^ zk{_3QCB5yn{5wG}$l{xwUw%Ygy35W9c%T@$I*@HXSs8o!QhIrx{x7)iEGInU=>uS= zU9oHz%P( zMj|s^UdMYOx%bUcyR1Vb;{rZ95tsnKUN)j|F&KFAJ9{!gb)uvn?k6&Yjc%8G~ zi{h1lAos@0@QkB@vO3SQ5HcowJvT_@A#a2MaIB`7D1`%+3BV#R`H9>ui}45&U4oyC z*&qmi=(xuUxPQ8$$@^ z=|E80nd*G;+jRxpNawZ_G-8l_T6>()YDO{L={NtP|w6s#o4fb|Xo zm7zo3F?`Hj7QDX>KKFU51duAdgX%8ODRDBoBlr=40I^kiM>P)OS9#^CQe(QRwPR`a z9}-t7I;23u2nC;yVa`&4L6O^<-l4TvuYOxKni=M89_yU(XBn!NeJqkl48>7crm4%# zT$m{$vJZWd8M2+c$oa?FgAJ&c9tXJYb>)c;!LBzT;TQu=R({} z2DD+@2W`-*v(`MBTW5%EKWk8Bw7OhPWICt?7x93(|vFO{NSRq{hu9pT@2UGM-l&H4c1s`G5V5V{_T)Di`P_CaYn%*UW`rAKQ3Ht5Wn%<*h0Z0gN zW%Y4)&ZYaCjI-bd9X%MvyElDbqoT5WjR}D8 z*huZExPIMC7gDnmUD4jVag5~u5pB#H$aQf3cXv#OrsCH(`>{&&V7 zNWtPLzC~`|)iQ8(e~pp~{U>By|EoQE->^U7d7N@Ha5O-2q`datUXpA1I%(|edpagq zZ_qHAD48vYniD{p-J+_Su`I{&=(p(mt@iB^WtD|rmiyfuYVL~qSPY_GT1C)ruc1|l zcVC|_bql{bI15B6+ppj>1GzF#!}ZOEMqx?dOh$bvPZ{w?n_7+kca+*%egt)dEZitf z4>!N^xmvXkw=p%Qa+nz$`^Awo1*H#@p6UuB7zyH_r zj@^Apq~FVrW$hRru=jeVdAqZkRja2K zepVaRDYh=bQ~g7(Yr|^#wQEyC6RrX>e9}^lyi{kaYNk|T)pXMdrfgAqw+n@4Vs>04 z%uD+>I?nw_7?Yzo=5P8>a2&Wp{h9l^V}FpnU33&f_#BTEi;h|m?z8Nw%dc$j4+8QI z_Q+^aqAc3+oIwj-7Zp2jG9lI`N1-tLN4}8oW!&2&R z==~f&;10h?!G4;s7s1r<@&{4A1hT;yt!@etaa!GezZ5tCM^s<7!rez>w;#VfIo-E$ zDD?qJVSsH{=Z2f8{;Jfj!Wck90#paTW4Se{;~#o*?rjeNF)M)nWNehj+EC;+G2jjY zRKOJL)Wjx+AuaMuxQGCvZ?uij4!)2@EB+6)v^4igxv9K%~2z?=Wn|Po1%#naGpbwzo2v(Le_)%vNgx|ZbT?gK&G4>j9(eo%rK2UIl&R8`6$qdvsl5=j$ zBi}*J?w`NIp7PkQRF7blQig|`5Z5CSIz(Z(GHq@7rtbYISeBVS+Q4ct5m;6B-Qx5p zT_`1$s?)5CKVD5793d6l&(|Qjr`h1b0fU3KP0h$>KMpe= z)s1J6{R<+%5Ep1p&Jgc=t*21~_&>GVzwZJ4Am97Ja~LYZTJEkCf^E@vnprGJV$P%A z(D@BgcE)8JY=YXt^FaM?*yNWuRQMt) z@2e9gXq2`Q5c(N7W|avxreIbpUpS$w9qiU3Yh?24s0?>Gzef3MYU|@8G8kuru4u2- zw%vtQa2KKDlk$yx4XksIO}ivZm9U-$eP4G@3E6M?O8WIe=Xh4Oj03bsJvrK|r4z)h z(?akn>JpQ-ph z6-bd~@7)&;`8-s11yd6}GXJ)T4KTZ5y+ZSx(Os0k!YsV4*sNK2H!GFt-&k1LnRWHl zB(M_=Yz%<9GRWSnI4~kgs!hJpE2i+S&0bslMCG`yaqayNg_d7iiml!}rb>Cl zfFS|U+?bWwQli#3OUE(PeQ<}9AhJ?4)QDW6%xZm-Ihf6G1eDHu)I$Px3oU6q8$IAk z!RE)@h*s2@xfh!u0^l+6Xjzcbwe@O{yV6!D2NO6;i!N>D^H3bm2836ea|(Aa)xFeC zU+^mn?CvN=wB5C9v9ba1wEU@6t|-;xaP;a1)w{*<7YAS^T##mD3>v}59a<9^hQOrfNIl5`~edXae;C{n58m( zc~pNCuOSI1wrM-0fqX%f{=kYYA!Qk_t-xIGc13H^KH4XK-?*T0FBG@H9x@W z&z$#&O0akH2vZ*e11P>|h`u;z(iek`ytXip95Ibhp`_|yQT;FFM6DQav4BoTDA$4K zaE9nlnSi4#-xn>V=Zjm7&)UdE1nwUYBVYdw@D~JEye;(t{PsN+#F3|N8Y?jscyt1% zN|m;j8J}P61TsKmVrKguCr7^kD98;fUz#v%OI!t!I|s zW`$k5_7}_KvHXzgEb3Vqxq#halI90Wd5}_wgbOL)b`|?pz=3gd{z^iP9)Gb)^qL&28y2`GH}D>`i`Gub6X<&i7L%evjFS0&6fv36u53fK^>OisaDw<5|tQc z0~YMO5c%JF^k1Wfj+B9zF<-Mz&egeF$aW6jqr%yO$c%2_t4mm88*|IA|E%pLQ1zfD z(1nl_O}bps)}2ca0ywMa;xeMYw-9~XH2S;ui`PZ@-oB6a92HOcx@quI>95DPgx!;^QUH;%VJ*XC$nYv)az+w-PGc-rSz4F% zC`b`|;dZo6x4;rgas{U5rn|N-9c`y;YhC3>6z)Rs^&}BF3E(S2$#F^?s`S7b2LApj z^3Q{3$$do|Q5e!h7XJGWL%nd@T_XU-xh}7y6+*{UGIJ-P?aOXbWgor7TAcogjEg$J z)1{NCOav7>eBPYVIO3RMKtIZsJM)zm%Tm-e|8qR{RHdQ{1NlM_e`Gc4?$-wc-?lZ_ z5%I`?;ggHo+T7z2lC{x4{i!I8 z!f0%yPP}}x7o%j~+iRZy(C$DKxiH+~L7YIy~P3X=@8S$i5%@9$;3yMP20F}nqAb6_+R(P|`qoYiYkPLY@p6~69#uJbi*7BCb94w*x+<*z3f-UAQ zx^!ICg|=A@g0M|Jvp0~)jx?$2*o>Z&uO%9KA-RVuTn;M&;F#>{Ucfz8L3JaBkw7D7 zPNMQT76uNGs{bWSKnHAvK)}Mi0WlXL2i_M2U$_UtUv(79V2B1f=JQx^ZPu=fFmh35 zX*h)c?`mc*3Wl71yP`wV|NURXGxf8>v*3{w9`fKpj~|OMNVx}n0c>MCyri{LB81Wvdv8Mp)8whzUk5dWLL$S=u2 zl2|QAH45oDvka{~S*sWtTzJ}*;C=lpt*{$q$Ri_Rc**6JuvyV7p1(gk?YSwR)8C-) z=Sv=cLvW^?vKYeJ-uDv>Q01!c1W z*&dyd;SM|{Bx8MlsyKxefV!7|ZoH}jCr=iML!WP&4mbwp;Q`Y~SwO0PyYKP%WG5bb0A#_y4qf{tEaMr^wwx z7a#b)C5(aq2=-X1E@{}a+Tn^v2XOKSeCGj$e^}3fvIEHGeH5PGs)9v#1Gsg15XQDr z+=k)*uHbfGL+3f)9<8W+|4rT80WA4F>J1^sYUfYC{NJ)DyPvlW!`Z_je0_(1B4+K3 z0;89VV@vq3WjkGslXYyMj#%qi%Wnl2885~cldrVjZ7-x=9fs(v#vbALAVr}*=fC4! zF+=iUb@zp{D8Pplq;NjfthJU?G(=&AXVmY5`)&KDVpQMS2Q!k_&dYk+xGL#&?K7bY_CyUa(ljT+9umJG)vXA1qKN zX9e<|`Ek@I5)^i|2HWc4(GLxciRKi0-LP(wxR>9h2~T^VoyaYc0dnSlzpbh} zhl;>sP1}svAg{52x@uV79#2q@keE-`uqAFE;pk%Qd-q4HnKV^<4k=?5u*$(Z}I@WI_8 z&E^9p88uHwmthB#t; z=+8I918VlYQeS`AHB@5;^=V@J8M24%2HYVn%|5g)9yLK3Sc6106)k3YMZnnVUW z>UqTt3j3Bvx{NyGX~PLEzOJW_@B}cy8iO6Um4EY*#tHo+@{)gefw9W0HjLPk0#|Nh z(7MV^Jb7N|d}NpiF|hXbkb(nKBUqL(_(_nv z;VxRrB_CTPIa_(0d56f+TDUHb*|L0uyE%}Y&ARJjk%RUH8(-KjlvCtOoRpkS>U`qZ zb`joW3c`UNOeFYeukc#QlnN4K&|kCGkmWoSyrvg)C>$bL`CLLm>3-4Ft1?H1qBN&# z`BYWswdDaFqM%PjewU}K&a&fZ&`Y>V?;h}g2p`8_TkN^!2`T>fbpFOir{ON2S_xhW z+t7-Km$KgA{>YE4l(vu7wx+oLMe9DU=)JC{U0G(0WR&lV%#DFrNM-+GDxk%|Mezie zP#VS8yzY$ZXUv!WQr4NL-SA4=s{$5bx@?m1my-k~&(*bYU-hDmdz6KhlX^jX=;<5p zY!j7?w}Bs0aB

Wa+Jo|DxA-J>2TTd1=6>#0(sGQ93Sz!WD89?=}f4!5BwZ7RqKE zPX(QbmuMt9Gqc#HtwaSj!V)Om;HDbO{lf_9`T2a=rE`X>>%Gmx z^A`{OM(VNfYK9h*=$Hoc+t0ad81E5<+ikAC%t;KAr`CR3c#xo3IOU9S>gPAk8a;bn zE(#5vg)+~)Hnq(DC50RnrJcO(V_K3OOYyO~xUi5bi9KuMcHo)SIX( zANX#juRg5ECIo@T9 zZ(7Z|aU9T79c}JC@mBs4r>L*x>kX z!8K6~aeox6r`idBmgcgQM$qu2s@@=*F)_zTnsqFV|GZM~n_`V?@o-L;2Ok-&J?s2W zD42}g4Hob0W$t8tk0di}Bh&QTf8$X|2LnsofnEZ=9?NzDae*1iiN|6=aa zTBVJ{s9R+jW4vd~Y;+(1r}z>JWt$R4u`@7ej+kE@WFms1CV1DOeM^D)M& zk?LFgA5&rV97}d7CLvD6pwXn9wwBUjw1KtBetJq;OGbT=RXF#HIG>7HW4 z>_;%}QY%+ux1p#(B@SeI6J|$~7o##g+xC&$(?b zcczC3X$S!)!2h5=1{-Z8YQsnk*pF3|)(Dgp<<=0p8~VbVv%KY5pk(ISiJi>YXz+W{ zS%)*~Tf(34)<2s^@o9m1$7lt1|D7EBxq3B?Ml23gqA&7gW38l!pJ^jILI0zT5HnEr z>zXN$tBGN(=(_FaS;W5~bmw?a9%F6V$wc`zt4SrljF(VoM2ZM#{;=6GZx|Vg(6G1Q zb)A+kE7Cw|g#YWU33g528zM4O5hZ)mCLNp2^QtwCg~#CxorU6pWG#8{rD+Ahp({G0 zDR3NgWGGkNpbB-Q5{sej$Ip=cpD^lYxd(Onsy{}Cxj(F-K8|E)xD6Mp-mBNYiA{Ch z*Uk+g=(8$0{e%LPrD}uAa)LhS=v}j@z!GZ^iBAWT6PWvnEH&%0h-8avEj4=ChbP4{ z6BtN(2VpSIVFahA4#`#~;u}=M2`0&}06p};^L-yz&8+lwg?Aa92{H%b992(p4N|J% zNO-+)Zp(!_@5AhIeQTEe*5C4&g${`XNI8*eM4UYS64$RDI(RlQ@$35fwdH5aLfxnz z#{c6~5wXV6^y6A8Va9tMHqi7Hb6s`{rAZ5~q)yx?SEM^Fv=BZZ)=~GDzSZI|?FxT| z1PotLg7qq5a|4c~t}7Cd`;m+h;j9+FVPR+WfVIFly(M#*(Gt23Pp%8=8zRt#d+nhL zw;`^YZl!s428m_&RdsjYZylfOeJGbf!lO9<5xr7`%hL*f)Q4aS6H>mSp;Hp4WGrL< zE?v^(6Z$%=&SevlF!ns6FVw#yeL5UT6|028^ssD zgRBHJ!A)Cmo)ADrCzI-HRTWGFU}dy(qW{Q9D@dk=ZXMjV)Lp@W$e38-$@aCQwuRN1FiL=W1Vou&Vzb%TL9Oe`H3%8|4|Z?Xw#*_v?sY`hg|Vg)A{o@ z`Iya?zJK!||1@81c9QuB!|EmiQf$4B-=}=g(IjaSS7&rsstRUlI7{{C#yEXr$Nvc- zzg!@GFMT?lr7@PQ(~(oOq{RCIryCbYaTavNmrW)sLobiire6O&6I^eEZu$a)cAICm zo>R{WzA~a_j_EX*^@_ zeEpw&;Ytp1b!k?2a|C59I=H;+4BPPf&Ij@{TCJ$$qvL64hB7iaalWM*Q)k?`2+U)J zM&%I!JCV^JbOsQQyQHsK9+Ag7J<34S2$uf!oo}l1IW7*WSBJ|R5*XZXir~b(HTv1d zS7U+AwVj1zkfi;8Kd=4F;k_jM6b{(ja<5xZ;7@<7jw@4f5U6p zn6kzETWC9a(x&7vRLL|)4OjmC51YOr9OZ%1D!vzaXn?uAy-f=B*1XA~U*7fkvCe?j zF;UCAN10_KEOorpx2Op4Hj4e5$ji=G)Bhg*dQb)bW&Hih)L5VNCp@+*?W5%{yR=6? zUJ&rDj%quw=}TJ06nqSsWBe9mI8F4Jw8aeFIQ+%w=$wt1)Xv6{+~hwTrr8HM=1K!w zwxy^)s!2@nL{^%QMUO{kK&5x9)8_WycaQGn`yh4bkJAPd$L1aIm0jM9_rBnTx8mslMRmBI`7GheXS-4GOlzaY=BJv#p&$4;+!!Y2NQQJB%y5J729m>!dz@ z!B5?j%SJWIg6~ zI!(b%YM9g&E@1R4NOfF1(GKAd1p(ACMEgM$1n?tfB9CoUziDIKme;3p17)V%gDQFD zk{J#|=hHTKb&S)0!JK8ND0T-*yk@@fP~T%O%s1_?KnXqoKz<~B;Y+4xPZvbY?1Agp z0TK=GZh-e0AS~N?Fc)6K(FKc|p>iJd+n5^8EJp=f-CPqDfe-jCP-zX0C!4+{g1@TX z;^r9hS?9kS*^bE&d{3bQ5+}qL$>3hhd<#5hi(v`jZ{UKT&>3S zB65;ATY$PKY598oR1DvGn|M|26SX96wk4%K&P=z>+oEX~p#md;+MgBaueO5u;^GxX zi5<+)^$p_^ILhZTIoecNWg0H6G*8c&Q{l}+JeW_yMWsHJPTlWgZ{toIw2>mD*qn)f zzpJqB94#v4PeFwDq)aSskg}`ket%a;E;$4ztP_|Tz7QV$42h5HtCYDEOg8Jqxv%#yTpzW0 z^y@QFJ|6Eg@&Qx)|3;k@jID0Qp>AWpMF&mm5@qfQEhrS;s@4R~yxN$~P{U?C%v!~O z_0&#q4x06FuFtWf>Po#URCGqFw5g(t){zO{DCXz+%U){|42E2?e4IlmQ(bfkC_P#u zKK>8$|F0uxE78dC#cMPsa7qHVTb`GB)bhdX7uStwGAOsQdi7+r0TBUg@o;_F6@?!o z6MZb$th@F!oSppw85e)Q+Rgr(m#x~&{pFF&&pR|Fv&3fNAj54E6*oIpc$W)z79zaO zW1Yaza1S-N#yFnDDM-uXvrJ~=g9$vSPq8dTbbZIm*84MKg8E;t+2WhAj?LdGDR1kk zQx?r#o=njh^ykw!DWIlS8u=zFOFYt+A>Rm7=G=LwA<>rW&z)mo9%nDu*gvNc9?94n zSJr|h65|f6wOWqG7L|EEgxFclUZ^YRV$9HV#QryfDZHBvKUQ_z^el?Lu#rR5<^aRx zNqwl?r&g=cs9+EBzqYwm$Zzh$&U915aMRkADJ*VV-PSgN$~LxfcsGc`{Gp4T@l}Gk zs6aSQR%}*}%dw7koMNREcPLQ2xVyU({H6bU?__f} zXEXE7p4pjC@7);H_p<0HBq#s?09{^AN*w?I!hQk)U_{u-z_rX0c0x2$l$8R!{`=&& zm!`t5AUn(Hx&Z*Fxc|ODK=v0R*hM6Fd1Yy&EhJ=k3R(+)oCpAb5+E-nuIasa9N?2_ z@FDBPZ>(9rs{O-RF1kc8CCcF2x8ch0@O>U+R{d(SKm?1Z@BsOFHFF&@>D>DSZpSkF zIufh}aUysL2}--O5AD;wjc#LSN&2}w$?j_klPfd1R}f6hWX-h-h)2hr|Cv`ugqUe* zaNyik+GjGepx0F43x1oy45NF*vx5!-fR5r(g!yYgQ1((%(=6sok9S|%Y9l6&?TjTP zS}!yU{fL1b`y-{|$-oQCvTSwwY*1T+9H|n!B%fb0BOV=KLMM$f%YU^-(a`*LDJp|> zz(A?8FfrdTKz)8~*|_3^CVV~zI(Fv{a=*CLL1i!PsjkqPPGewJ`fwn5n64NYs1SB$ z3`SO9I{b8w`)94i&C)nrW4AhS`I6Q&nI~v=!=S2!8W3R<+K2hIXnCW^yBmACsj)^z zzwyD3R>&WtZlS1N1gHQE?l>EO4+s2kk2U9FPUYplciVlP5cy#v;JcDX%$+q7@XA4l ziU(xWWF8SRDv4=aqd&;$907Kx%FDun?Q}53^~@JZIxFCd=MisFtWzSk=W+8j$Oi{ zfLZ(q_K~AXp;!Lt@*0}os7dM$C5{8))h}PHMY5oDhq~N|ptlUs1*dNos z2?~&?)C>F>zj`t0BFyhCLOOI3@re}}eHqhP*ts-1o~YATqu5cva5Tp5|5%9GK<-IG zEVwD4XY248I{Wh9gdJP=y&R!$-rlI0`SlpO#us%Ov=g4_b&e2?1V*MQB!6+LX*JGb z$xr+1P3Gxv2?_EXkcRd=@z)=bQ%Oyg|DC2qd9BZg#bgAj&SOtF>5a8*eChklfU^9v zVa%X&!ytP!FmKyUZPS$sxto^gB|RFz!TWYA2B)UH`FF19qYRm-A6CYy;!QUE#h7l< ze>2{I-=Flgu+J^p?bg(Pb$C+eu?N+7hC3|d=zf_+*VVIrY^@p^T(30r@dtXK+u`NA zM~d^;S^u=A-BA^;@|;PLEtCINRXF70%sXq)U34p8#o%S%nC|g_IgcX}(NT)tkCN%L z`MbCzt-p5+F=-Mw5*D-)6UqMFRaK%HK_Ayj2Z=>#D$75oXwuxhe=Pfi09yzB65AyM z#0*MJRupU(-+x_wvs-I7uylKkHcL@s>i4{pzfao15OzjJC<@*t3;&_~+R3XcRuoQ| zMoqFqn*}}FTsCAI$k?ssbPNpT_+xYMh2}GhDt!Jq(CamFfboLXg@9so;dw>A?je^u z-r!dF)A&rhUlqR@bQ#G44+|7JaY7T0ElCLCF%xT~cK+!jHwG+8xLa19i{$!B4d@qt>w6go=K?0h{7tB#rPV-rfDf7>+%B(DdBp% zhZ#waeCm#|Ri#*|%`Rrjs@iL>bHf6W02jaSIIP~cz7^7fuXXEb+p_41dSGHo5BHj} zqIqz(rC}*`Oxy7LpG(u@d)RpovFA8(u~?#)6I>HthE&WDH%OcYad; z1HjDaP=t@FSIYl|5Lkh{JSqNV^imH8hp4i*z~U$60$G_p{Es(aDiAee7)~(9n`k1e z3xTI>y>lH}Z;HLJPlnlOBe(g*kHM$pSWC#!Cid`BT|D$O*cnB(fm+A=O*qDxYo7(q z_%&zelAojp%Amp2!C7(p9ziAQ&S`9ddi!@)-~6A4rs78?5Gqxz!%q?otN0c6a3z9E z@Rl3+qP^YYWF7*;5CEI<9Nil+qfu39I3z&uN33wiOUiz~-9a~-4shXj)O|%s1>(05 zu_D@9G}z_{Y%I7H%7QUy;E)W5uNO2fwjO4vVn zwTV4#uoO${Z`TNm>xl+>u%ne`{4IDwW+XrkUpMuD#K=%C>22`xNMw?jJkHz<>yeag zNseEKxqBc12hT5nk=B~Ai_qsXc|-FcyFC8Qj8zq>>2G?<>gFm!s=tx&fJ)q6uZshj z>BB?EyrtkL+Yez2GwnLV7AhI{p$G$OdfHzxTOQLfrc2iw8@n6hRjcncC9=`7Pb7|x zL5P#d4TLfT_6p4O7nvsvpBjZ6suVAZ5wf;F`IY6#Rn&cy228=l=;wWNESLL&3i)l9 z*NFZY(HZbYQZl2?znWJwi>)BXBd~(Jt?-SJFk({(d?p4Fve@B0XukhFrAX~N2#4qU zo{}dZxr%#X!>z(m*Yhd4;Gpa15xJ!d?OQjiK#6}!eg^4Eb{xlia{B&}8PwUTsplnf zC(p|5-abf(N&Q>B?D0wY?konr?+c&zg`ixn=5x7dI=`4OvWO_Sr5cqhW9dsO7Il!A z3{7}{;rJu^uf3%;2$UVV{JC%0&p0+R&3Q~f>fbmY%%0{%hrWf!c3&l?@pkHPt{t7W zku*OM%9l&g?rpU`(nL}qSKqYtTRMj+>-VnVU~^IF zH0Nvg_`CPDZtt*#l$=4Dsm$%=uL1!hC{wU6U1Z3AJi_hZg6!4l19kT4y9~>pdxH{G z^bScG=s_cPB0VBqTw;eL>%V@5l41uxa=UeBBJQT=dwED=SOS(J%pbfjfJUcUBXTTS zSbw&ae`^jWKo3K|`0T(bO`+qlsY}7OHx73DO--5~`4=|=E};Oi=yDD0gz8;h-VE<3@&~(SQS4piVWue$ zyz!@|e>N>sthaNEF4UcZx5ck-;>0*(R>eq=NaUcnUdI5h;?3NndxvN#x_|c3(@6qm z?Gt4^$`%}BBOUJFeb@RTf~B?P*XG5kGkQlmROt$NJQa)F(OT`_T>#&G=P{Sqm~#DlMxuP<{9rW{8CmDxR) z?p0n&qOLZ^)7Fzm>la`C69*^y2*pJ0Ix+07+uo)PPFpDGJ}wda!q0DWRfu^!zxnCD zUZ=8(Hh?fKl!v#+$u5KBst(Y1h0a!N=K?tk{Y|yXwBn}Vn@aP z&p?KVgkgfj=QqrtdA{XaZIXkrq}PgkvidfA7(MVJSPD ztMevf5t1s$OzAw7Dqp$j>3HZmSI-`&P*k7;8;L(S3L~zP6rG*M3kLaZ z!TFX@RJM|G8H01Rl!z_3a6+O7C@v4}2p-oU=bxc;cQ^$hEr0Yj@^0jRcfOCwRBbhZ-_t4 zL{HUoc@1|PbKa;73P@4!na-SG$(f@I+#Jga;O*e(^=;RgS4saeH0cF1lY8~OHB~F`POlh9Y3|`9B~6Y5siLBoVR{Wa z)%)-KnjDu)$8&pa-&7;H0k5+5A;*I$(sE!lb2ND)8b5*Chq}DH|eU zI!r_V>AL`L(;uOGR52_ruJiIBlByHG^x=kJO>jTw8yarZpog6$C}?EB9BL#z;~=$z zH4GhM;|Ht@|M$7Mngqx0@L0{erv3J^yETGpv_TJg>eqL7 z2pVbwN`SA`F)DxJQj2KH>v0yRi<|S*jm7B1+oQ%*by;Q)QVof(7s%ycla`i8?bnzK z1M!x*0HfNx4z9SHYxbGg-!;kVF$zq*t&eJ`FvZ|lfjl`$rMQapaLA;@i7bbV^HF#8sFd)VbyNmIw+{D)Y+>g%YeL*T|Luy2!MXkr4ySqxbP6_4*IfQXBABQ63@9+u zxUAE9E5xGT66{^va>=uDuHl)T9m=($Q}pm~&SX!Vj;IA5O8h&A)ZJT(uNbCQE{o{H z<(ezxb=tY5h7G$1 zk*%{^5JsSR1+eWGv9J~#Rd~yIo+CMsDnBh0KeD^UPkfRX9HVOUTS_685>kuvXZv?? zQqZQCYY_Fqr!~$hD!SaCR%5?5;wgjoSyiz7I1~#bz74KjTiC4L9|LJc+R{EN$QGCn z*R@i-4IsP_nD|@Z{(=^dX|g3lnTMI7g(fEfmhPh##_>@qu_X{HCBHO#`tnNmTPID= zLtahz$Qd^I747ZcDa<^}8C^!1K%L${ITxERQ1D`3BhA#l7oG62z}5Z2hk1w8W{h4z zh(jPf*Mj0lv6j{_N2$-hSnsgoUSxl?Z*e^h_XM&uN9m<7{$PisGlMcgMB2+LS;Jwr z?RlM!GQPelbP+vfo9Wr>(2de#4n&^xB}dsRo0$OZ0#{u?m<02p_|oNz`@YS9lmbYj za5DP(kB+@fdGY;w{}ajg=6@)N`7_5O-YJ6-Ps`HG38;aJ?uMoHVD8 zbOe}lT^iP~W4Z+=HDr>V;+U?(;%Zl2ey?|t5D*#f7AS9{{AoVpYZpGy9_ibhu#{;l zqmjqA=+(U0`J)>D(VvRiwd&={E&j*XD|c&qrH31hzYtcuJ_M_n#xW!yvSvih&L9*a zN$g<)^7~A}WvLBY@SEd0aqnEcmXz>*Pf_PPfF!$ zPum-MkRTD}<&x{H|4mw%KflsmY@!&Z&R6oW8dOL~yEp^|UwtN!gy;CB}DM|4{-= zSMuJQ_VOD=Qr=l^z&tK=v8vDBvDjKce(%d+9H!0CgO`+B9WOvB- zn3Jb4mUnnG7P(u+XRZ`H1QGUj5la(A?j1c114vu}l!hx<5oYV?;Y>mphp6H8Bd^#V zH-t-8{`OUYzu}}9J`sFZBG5#KiS|uiXh4T8@Gs8;!}7CBuOe0Ec}U~$yKrgZ_+EY) z`DCBUJ+LvALkv)s#Nn|6-1Jly&1%O46|Ch`;wLr-A~c&yG_PKih)o4{T@s@F9i zuG`*HjNPy>ZM6Xrl$@h0$&3SEw?(f-CLxqm22`06;)A2N>_U+iSZf^QTNm?YfvYL( zo7Z{CQk9WIk%B3m=Zwu$SYp>hk69%)T&++Y?B{M{!Q^3M$v1c3zgcU@VLw19uucTP2IDJ{U)k>Cq?fz~O} zIR;=BJt_Aa`d&>+N26@9hNpD}L7+Zq8_DO6@2Uv299*N;-b8xZ+Vc(OXIYj~JkPA1 z^c{VWvob$Ge&7X#4#ZaeZZl?_B2yK_;iUK8+Bf*{cj(~Dd7j17gXkIiRYdWmTOxV! zRd2>YLnFdLYlV__0f|KjCJ~%X{?G5<>b6p#fWM=%^1=-QK`+?sbe(s3eR2I|ax)#lBY8XJmBv$qBmt4$xGPKOR=uhUts?xU&KY&}OzqxX0d_ z*|(ZKO|7@NiV;4 zgCKJ9o`ynBVeo-uaM#oOj}!;PnA+Vv$`lqog0L8~Wp_(Un9V?P4%{NuCfo?enmhWI z!QtHC}j=fL(QZ(fS(q^Z>013(OM-{1uDyl`YfO936-6 zr!Urxd5;`=>Wm{x%CPl8Oh^H9sZ8wngC7eVtN8qe(}C9gaGujmat7|lYcz2|D!-3v zaQ0T2p=r2c+qZ=B2iI^#E_-h1daqqLx-7XeWaHGKNg~Q#sPJM7epug7R>5K_E{d1eXq4x1jat(QO7J`E&ca^G;R0EEfA};4k&=Nl9{-#V zND7KNYrtVI8e2mFLftHT^HvJLVy3&;!Q$AYL*mss*zSzgXk>sC!NQ4n@=E`s>&Y{= zhk&c^pRP|O8?xZ{8(vJVo8sgxDX5Qb=efmgaYT!k9q1DGGUOv1u8`EP`0y+l!Bp!K z5{^sF!vL&JZ^(`#YPtMVz2kU0PWvMkvB;?z*8#j3;W75aWC|gcp1w-aFi>IP))(J) zGqEQgp_qeFtacQM4_K_!LRR1K^_*smrqIDf9T_0JUm+QbAUAd(kTUArje|Au30(qQ zL=B1{2FZhq{^XZNQSsR?6WqPRx$3&Um;Z52uD?uRy>vF0hHmV*R~3#2D8>q~A;MWd zsan4vDq5$kZh6(tEa`XRs+B-qd?3$n#O%PzX~A&FsETiBKMB@Kh?DX4D?rB#{l$ay zIS^Zt4#cD++UxbMJ|Xw)jTBcP*F@2`x5#2#Z=Bx^E~0Zx!6jE!ogb1?vMBRjYnJ); zGJFl6$-vNy*||(k11Vvm8Ea{)=V;}AXXL{U86gzc>O|$vinMkLORYpUDr|XX)Wl^( zpn~^>U^;BcoWFEaPV>8N4j(Sp=zU@vpJZmX0*QL2px4?42frt1MFi`&dacTL zr9Bl?kV$+9Dl#}|`0uD%9Uu{@!SapVE9LeVt#k9RiZ`m6?zuIX=o0#^E^ba@qu`xW zyB&Q%CyKfK4HkfwMI-76*ZXVZ4RfNJl-T9FWPVqZa=~cbH|IFWGjwvMn`oWO&$7e2 zph_;rrr*KP{GGzVJURI zTYEw4B9;Vv{3T0`*MW8ZhA^_4%9iBZA7k!r;1+R6it-Jnx7VBN4z%rMPw$JC^|R?; z1wDL+{tbMYK+52WQ%E6vnz|g-#=ZZey;(n2SJ^@U)k9IYhoN^`_XLRAS%d;|H;{lC zY$FE2Y}j;2j`W3|IAFyzWfK%(Ip%O7wyVOQ9D^PvO-lg|u6Mj3Io*N{H;S~hDAdV6 zttzeZ*Mo>Z6Z;I;_#CelX!#+U_$rBJApm@8ZxqS=48Obcd~ECy4j1#yhXU~SFU-z1g2M7)Jerxn}R zn4}&Sc^SgxPsZZQjG+#Rm4z=XVJ^-fq_87KQgFqo6xMU)idL+&rz=T#*3;xvMsP5G ziV>hTG<0r#1UY3)9w-B(6!HrYxn|Hht1%=>DHAare|PPTMyX|h4$ydJo9aw7{kx`b zC?Q?%4A>3)#qb=G8`nZUA4l!)2j?hNK)c55p|leRzVxWGOUUmy3_4~}t)Mig9m!=Q zD|d#q-e|u1+$bIi=cDT!-x|bbIr2S5B0gk*^ji^ywKG+5G6g`4{P*Tn%Fer|C`s}Y zDO41N@nbfXaPsv0qox@&3z}O^qKQXc#b_nfG-mtf{*c?1!!kR`l+n;?e^krnlP1E1 zGTYwVk#pHaPrF=0u^^Ifq1P)ZkN)!DWfTtx3mh+c6_KNz3@1r^4Fd*dH7<}tMM5q{ zA^_bi3qE-iXufF%!aW3H$wAW*jN$gR^!$zlY>iH=VCYCVygy9#KK|GCJ6wQ1rb`lZ9)=%_dyU+R`0NH;ncOa)rTZwOxi-W*m6Ueg=THX+!iS#ry!PpiDa3*p+UhR zbKtLAFjkrtii)v@=|Yl}Z55*_;_W8%6iK^|0_~vaxLJt@gCZlaf?3yR7`jsZx|A%$ z_#DGW2>X*_aZtvu*6-Ukp~2>Y<^|xE2gA%TxOIoBb33~a{NJ(w3c#=)B65uC8!pME z%Bz79X`i6rBtOavqKUu2(rSb6>KKCB8f(Lc$KY*eFq4|CJwSO@?CcDEw=#i{f- za0^at3Y?*(6jt}K2uU0%vVfmgqM;GCdfXv5G=kSKwco-v_<~k+7BPDtjX~9?^V`?x)RiY zmj>MT?W&YB*fZpiohgK~05L4VMtMNu+Ca@K{484h*0^QEP( zROHWE2Fj7fY*RCCKKr@3SkG{0B4iRo5SpUPNB`5X{z5UBoBDuw?wUC4Zfjkm+{m6I zK-Q6VoC_)zd{ z172IB&lNQaP67zH&sqB4_P!CYZ=^q7P$xa)rbnYRt#vWZ@OWo5GVjgiu(jZhJYMR6 z=A(|?<(7BYB}+=Z)!}%-{M=;vdjf+lv{aNA^^yOWPaGpEcnftNBKv1&e|%|wSZJT@ zt%>v<)+)*1`pl}SI|E6m%|L@_xippOTsz5m&jT94%C)P-K`RMdit94hisndHdEWdR zVwi|MD>g7p`~3iC7SAysO%#}@ z5vBVkR0$ClZ432jV;Ub^y}#9j8{fDHiup4pFuNaym}D6(;8wtzF)Bpp2bG3=wt zo7#3ip@-b<8b29k-scF8yw7a%JVUG$vcVYB)xngR&W>+2MK-CWjF{Uo8{uyc;uv&wk?s{2y=-OGfu~EaA)KM|3T88%J&MsTXNO+FmMlArS+NOG8}BTM-n>cl_OizeZG@f98)C7;dq-vO~S z%S#j_Yf;3-SSfbNIm-!hA362j8r$*Cm4X@0kDJ4Zjr^~$n(D|72jZld6`|B$jL*&p z_QqLk7I;y|t;`))7eklAt3;M1>#C&1Vf*OawTmj zC1pM@FIE+6(*qPU0^-n&)wKBwXz;oVfWp&nUkib}s>e3RW^`GU4h0;1a zHvKeGN>IeeF#fzd?)Me&JI3G&BDd~CK@^RLq^$07t-ks)BtHH92)$fUF)Q2Gy#7kz zSkv2xp%2a)7WeyzU+JaQO*A5z&9d*+ScvXJ8ZVxWW?2Am8x^8t)(*wQjB*?kmxqB= zK3$XwCFp(ZX*W698xQ+Aa4O(>=1G=WCvo%?(bt_18b;MU-t2l7vxtGM? zT0yiW?kjchfdae)sJKB3ib^Qa@GFdn#hOffU+W0|)UO>iYW0cZWtCUw?_;i8-&c<7 zu5}+{#N!iujx}ARei1ph<5VdeoHlw|T~&BPj{%xY+RMwFe}3LWcXRfrHq_t&$uho3XLiFF0@qeK|K9e=S$?p0bwfto8+|B?&FuA$zhBY-g z=~opYlxckwq)P^)8Hc~SX{M-j&_H?ViE!Q6 zLKe_iMbdv?V-5on=;ILC=sQZSA9s-U8KH{dUT|878?SZ~20h>@IC}4{NdXFn5+hDR z+kPTG=rdyz6Cn=4G1FP(!*lpO7F2non(rudq3$`NEFqp9BI-8dEXFp5rYz7B6^OVV z{@gIlWYz|KUqe9oJrODDn#WGH;mYaBJ$u*s7$X21?%$|Q*gh)UvxRzvIoW~nQFJwy z(>aFAemgLT!PZ6%l<_p}=2mSY9H}d>x(E%{n=A>6v`ZgKRYJVr5od4(R+x_JvqKe zgE^@zT5`~Wir#4V!RuLd%kzrsJ(OJN6}sqXG)=w!5+`Lx6R@p$3oDS%L*NT)mzMHp zW+aae;Cy`>=BuDcK}I1?Zv-jSBq{EG#H*2Y=%WTc54EUuK+7C|s{`5tOctobqA^>x zP2)yo?CxBR;j)N9%y?qpa_?-%d9IZ^Z^fO{R%@rIwMlqUTZEIDhRM%+G#)Z##wP{U z-xl)}KuU=$lo(Mp#I;^o=&zD~!9|Cm^Ic_7v7qkm8Y3gZhi0U)^0k(~iG4_96g{{F zHER+n;>~Y-iv`zA@C*i34_b3tV2O0v4@j`i@OGudlo%908#k+6M5b%54)X<{@qtPR z*tDt6UWR~XlSa%wq?fh|hU=@_tQn4uZpVYpMnZhyjC6Dg@Q}MS-JEZXz;@`$`e_Rw zkn3Ib2Ao(pV(~B2+Jg0R<#O6CJgksjDxf!O!a6T62X{Lbtl-`d)me#Qj07oVBXC^2 z(0oc<5>##!wuox@)oWwDy3ERC{!K#yGbpnBD=KWG2t&Gv6r4r?&3ke`t@Y-qJ|zr7kuqd zH@m36Kf_=G&T;uR(01ZneTnf|rfKzaP!F~(T^ zAQ!gi91EyGEl-B;Y8IQVzHGHW4bwxc9X4q4I|i2isQyAP;_`L)=krF6kH3o}PU)CR zg>or4UvR=&eIzyl734`s<~;ExXZvTNYPIsem`3C-d}S3eZ$jS2z%|IqqPSgjz7xCj ztVB)>TMU2weE0mMXSON$#~vtCtEfdz3?)+wzW*z1d-Gu$@H338tl{vb3%o26LR!Wd ze`8`=_xHvv);bLe{s;98rP1%f?fPy*TAVFNNfLqQdIYDypnIiA6=KZ;wU_o%XdzmA z(Ao(=OR`Sbh)@~tmW*3GzhB_g5h~yiO_oMv1d^)AT*6%=JA9p181_xOm11kX^EfB*v%3|D2x^P>j%lTz+0wFh_ z(U`ziJ(@OrJ{Ar|Ij{4fBX5E6tNo%(4Glnn;X1ATko$47V*FU>;K=2f6i(+dXlbr$ z?>7)Bqa(e$E`Zc)(8@M(U!Xv80QpT$d;N_MAv?N&_q&f<#Xux>OZ#pAa@j;FS&=dbGMC*JuC$${tmCbupfV|i#6G%~8pA{2-z=td2^S}EI z!E5f)^_x|J`l%`WsGaTW(Ze;)GlrvrHyROu-n5Vf{)9w1wzm8cTLCFiCpyJ#{)Tyz z9XDFiqFz(6;sQGXv^-tqF$nOK9|9f;#KB`hbYV3jQwfzq&E->R>SWVI-O7*rrlWtZ zoW~jTU6d51u)E%)GP(Hc;|(X-4p3k?$p%D((X7E-rz8EsU2qd9x(_(4YA5v7UN2_= zf?3@gKzgNd`4X@0UqX|Jl(_$2Eb*i2Z-qV$9ng~~RbiS0&jV31th?5!Jtm1?`aGr| zy!i2fPh{#Aq2t0H^GVG%PY&6byKB=WKMi^1i<{N&Na_Kmpo9Kz^r#ufE5Rx}Dhb$u z^;Dsc1i!Wl#)QZG%PH(oI;ewfe@_OG{%}W<{?v$M)ixcKfg~z0A$bV@t(u%i1j`*x zi->Ue(Viu!4HtR(SCGG=GovARuewPXa>x^{ri5gvOe{N&G9EB2%!euYz|G10ypZxYoEm z=J`%j{jKAdcBCm*C99b7z(;jowuP8 zzjiTvI-S_dehQQohXIGe$3ml8SIPTNoG?x2zb~gSU?3$)Q(BHA7`FR9QIQFO z)PvPgIQ`hXS-7_1gY3>}&kvL1w4;`le`FEFZE93;!k!qJY=czeuw>JHVS>)8KFZ3f z5_T8Q?^shLmFx8LC69N)GsZo)^w&61y*8DS@U8F{049chT%vml5sdq{QX7Xslv78as!7<<1C#>AA7syCs zAzGG(ZSRgZcYvhNW7fUPoFNpO&S@m1Cbj_GcErhBPkSYkqVCdS$+0}7)@svI{+BzN z6O`pzGq9+?9e8c2kbv;yLsGcf0`Jz|9`g=&of)V6S^D?QwK>3M% zBvHlIidq`Ltr90jgjcNllahcf{BQDNgEO1t zN?6@aRvz@0va#3;P@E$Sj5z6ygTo*%%cs5wMpVQO4((CusbcO$`b;=W1OvR|S>n7b zYNLqs@tAT7`<{8C&~1`|!i z0$cmuw;Dg4mtGReX1+UFAHp=XX`tM*@wou`nHqe4zA83RG0Yg~wFPV%7}VEdsA;{) zJNn3kn-SDRb$t}nSrEKQdusq|$x*0kXWQhOho_Y*K)ANnj`)L#HZ+Vx>FJ`jA+`l! z?f!PV;hP4m9nD{|zb?J9IkmUjJ~|C5aEmml1Mu)TYhUyF3S}D#8$xX+FgOKEmej_sdQI1q7JY;#pG#e! z#-oQuQNek!A&5&+&V8Puhr8&hgz&KPK<4OUhm{!$EPy>sPha;wci7?Y>1j5(_Q>8Y z{d6@YvLr%ft6vZrjDn&OzE(57(X^9`OOT{W9vmux-?If8UM1?Asj(_K-iG-B93P!~ zF5mlGIO4o=u!o4)ja0l;)}YM`oZK6=3Gcs;+5OjMtG0UZ$ML8*i=P|T<1~qYg(n$< zN8gXy2H(N;lghB~FOc9@-5fZ%nS4u)OlJ^fc$r~22c1stoy$^%>2iZDks$E)JO9NG z8PupE>iL@0zAw zb83hH8Iow5%Mf3mX2+f87OtrGHe3+jr^3_AEYX+Y)UGRHq;V^<#Tq{_=hg~=f!M3nc}GF)hOCX_y$ zR6vD4VR0y6t5{LC_^$6=b;rvvl~4iWo1}5Xj1hUb(LQRSKJ7LruLg&PN-RK?5qmvN z9hU($jT8n$$fC~-Fm4<`3024bL`Ek}7kcFtLi!6JtNitYYBIfK?*zw_*X%b<#$XOa zRlWj-S1>&TuJbmbDG3bZKd;YRu!ovVud&wAGlnX{@nUWXIMx5I`j$Y9=eeDan+9yc zgUx~7rV7%(=Nk#721eu(DM>ze0s1Otoc%F+uI0I(%Bh0YXend)=9kXIyoBXEK9tp_ ziWA}SE`a)k>^5A1T=HzM)3{yMDwNv64S@mso_|nKxFxP|K~ovYq8nOTy zS}`VbCsCb1Re9Jbh<)Z9TmjBpSxmey<#e!gKc2cm?XTPk;ew*zp7$;fq;#bFr{%HF zkYDhsx1i+lFm!W(B&;JbMwkS~-a6s2eDhw7BZz1RVPb;{OT_~GcEtH^E!CtqOnj(@ zI#}&T@P?`C9ELCmAtDQ`AZ|zstHt(c_?Kb={8 z<&zMnq%sh4PJk&v$|AH|0dbF}SD{FN%yQ<*Qv@wos$0ti5J6n^D&4*MBKV4}zXZfF zTdGP&@Q~snfiqP)j>ar3*B6T*PJB~0Pz*3t8niwZX%Hxfr_|~oZoB(9C&!tL$mt;l z#t?h6fr5ftL`@0LfEY$3r+B+(;abo7{w)yiwO*62^X;GYp++~ZoX5y~J$@ERnvm$V zTeF}7g>ZaJ#s()RH|pYW3+qtg6u zkX8?;zO6=R`c9~-Owl&r?L$KGI&3L~h(%<1xhoPMJE&bOFh-}5g>$Xd8Ngb?f=0iL zQ(ae;e}I-(huzB7OqarnH4WX?re*TM8N*;)P7+>#2N<1 z(Gq+PK7lZK4H|~Ky?*%8zZGo=C7r#5y47S$;b!{N~(ZtpU`YfDrc!5t(X0SD_^Rie9zVlr!Dyf2$3XBcuP z{z)8QdqV%Hg?1aDeVY8$S7^CqpDrl>+#uSnlktMg{M5-3ytq|Q!}ZK|G*=H5Ko<8V#r7k|3XvI>0j~GU&7zadGsKi6P75q!hO8NW!P5C zR8@>Ma$!%2z~Q}==JbE;9Lhc-7wKXmNaq?5LaAmiPWz?=GH0Qt3=N~-gu!B*Nl2)8 z%9P8&`G>I5E0B8%b8-beWmr<3@9TylAQVf&)H*!p;iDx_gEus^(75v5vsGV$EK`iM z)I}XG!^ll;TA^m^DRy?P2$%Q51sUL*BE>zm!tJj45*hC| zC+CF(a(^_0)Udm@NrR-KwCW3-j>C_SqPG3rv{q*m@?acSr3BaE5w+eHaXb45(_8&V zi$WOIGM;n0TF_>az+a)S-ec!EUcex&`knkCKWkp;&Xso8MW=*)lsJ?uJdu=wG8FFr zV2s2)`L>0y9G$S&8vevoI}9Z%_6K9@6jhE&oR^+8wRbx3U|=i5XOBe>7skY(R+c$Y zRLQ)K_*!SJcU>Z?@i&KlwcjK3^-|bo^>TYahs}%iN3P1?C*1c0@mS*2$U*N(z1uL< z8EkuDV{pLGOYp;(68dup+jRvV5P$+TeM8OhBKBlC_qR%n0dI{{sbd4Z=a%x~{F%x5;Se>;HkpcE+$wmhF{h zDu%5t;|+tIqn~ew=$Ce_?YL5`C93%^>cWox!BRBh{`m#i%k%P4DQ`jZY+iZIWH1Ix z5e$l@gHn1m%*@WJG3k9xUPbS-aqfj_nA^4~zA2xS&L&!3LGbe}w{1Krd7++fu*r=6 zH|V3H#rEz_oLq;q2n3J%(pO((CYNi6HtctKgn#nTHSuh+seB=zgB!5M4L*Epv$XXB)PLm(I9Q#G@|E{ zob0&CLufyWSdOPBNk4uMoEq8E0#wVZ!RHW=vuun6r=wt@?MDf(CIuyUk-7d+UlbiQpcd~ z`@o>+x-><>hZL2OVs;>~=?ykCri8Z^Mp;-yX@v0pyn>Mj@_*RRUSzYpXzZUdgFgd|>>+>Cu6yHH~0r&$Xdc zRcGrDsPyW)IP$KISEWynZxnMIEDyf;ZP(k{@Hz}1#($^y*5|fv;PR>K&A9HY*sc5F zlA_!XO?C&B;7J&9B26v2g#I5`tOdc@7`sb}9#9hE%U3_fHqikAv-KDrA&W;BYY-=( zfk#{Vt5sGLr!X2uhhOB19ediL^EL~^j*D|MB-)U{aIDGBCwT1pogvSF=aymb>T}+M zcYd7o6>jn{2jv3@uHvc;?4v zOzY|y*;*%Z^`97VJQS}wk>lsD$MpW*bM$QCJUGQTJP|5?0Ne*PHOPiWcx|l^QEU3i zf}NEBEDf}1L+|Pa$@D`we%SO~0-aKr(Y%+8-QfNI_Rcg)s`AX^&-1=_sk*n8?yjz0 zp+UtHqHzYb#i)!%qfrjYQN|dIV;pDHs3SxY#U?BwYiNN40*)Fr$r#5-j6o-Ia6^MZ ziP$PLj!TZH(9mmjRd+47s_yna^P#$dmK5&GpQYmOjV9uaI-+MWe!^ zYSf+A4KClp&6Gh_<2MC9_HL=v(KT1?NzWoH=cj`&q5o?{J_Rrm1+%&ugkKq&k7NV` zfK(1FXMx(*1{9A0?`ZG zGq$f8%RhKs?BBeB)E{rV7!6|;W{gS9wEEJ5qQ;6b90pNW16E1N&}kcvBmnfb^^~3- zV9l*S$z;*vyGX=@svrgQU8L)C%pY9v(wJ#8vFnTHGBLJ}tlOuIT1Q&XVFLj470)x< zw$WPjbyt4kV;{BbyG6|!bHT_~QqC-TtQa{5Dvy9uTLZ4{AN+?iLI6N22X5p*YH0=R ziWhx-7lc6cs|<9l!_@SZSUdIs`|6YO%Hn6aEX!ofyL8lBQF{P5MB0*PIVO^1to+~D`MvWzCm9a_{mZv*J5xG4F}1ufRxGXEK3z$t8X=oK8S>VE*N(-w z8pwxBj&C$D%mC2$t?x_r0NdL-;5A+FDF~YOkrfOzIJ2j00ssij{~fm~DkwjS^L!5g zN0Sz;c!6SiROg=@vftv)b}0MM7`^VT+Cv91BT z?2xYaxPjm*e&V?G*(=7UgUh!t7dd3-ea(CL9srJBQsWC;QGFsi`+N#L{^2-hPxC!I zm%CONSqX$F>MU8`+A&pCf*q{{p-P3B0ssJelmVdc)E?u&Ob6sxN5M_E$TeLg0$_|W zU2|N&|1oKN-94#mChpbNzKWKaXHLV{ygc6nz_FG8zBdr#F~;Hvky&>gDL>nJF7_nX zu%679F_$aa%?N}52m}t!4}4y0$3qwZq;lXk9qi|4GDVN?0stewA4N&vPgD}V!}{*z z*8{gdiXu|RC=wO9+s^j#d=CJhpY(NqWR_)tJ?E9Ly}`7JWlV8$S#yt?hTRp3L_tZ|J>e$qt_u^wtM}O8^zU^#R2XB#zO2!XX3z zLIh+SxYg^j)7f?K|9<#9U-Y(C8TxcXlmvca)l{u^W=u@_7yq7ts$p*KSG{oG1Hd3b z;8*XV)!NEJwh-M5E~U^T|8ug4buJa@%(oz$9ne@Y(|mx{m0(3Gz)_{6e|SR#0Hkt| z%)**3wRM2V<_9*ut7*i7f#0xb#lqALfA>-8vga`+Gp5wkh}?Hh^}>A*0E4fjFMSA!B8>uI`5DlXW^48(Uia%2y zz={YsH8tP_14mXL7%Twv<@xChNUg0vo$;dcd=LV`r!dm>b}R`mbxu3wVe7&&OJBZ) zqvof~_rKyjd=CIaUrOT(T<%VivGOV*Z~SvaYH6Jh@zkx%$@}`P5A=OFy=%u*RS8bC zYT#qV#~A>B;j$BJ2W;;+xTbq}9mw;AzJ}CFemV6CQ}05ikZUT2`1J(6zt)K>GoJR7gX>5l0pQ zP_LV=+|mLfmMHohSD(uc1OiDr6kdTYr)7$;5tRM4G+`@s;dvU9e?(r3cmurSOV~a51@Bcx%giU zA`lZNf>luln6v-t;rF@eVq07B=eUF*;1UO2bEqu*n7?k^;>4BX_mtfE1j|;Iqc!JZ zFVFV?FgoPBzX_=;#_X<`5bLfZ{P};MBgbPaxKmbH_71)s|kc@>w zAtFd-7JPe}!AhnE{sRgDa!DA>6UKp~YK5>~VTHC{JO-?-9Uzk_{^2vmQ1hc*68wW5 ziO!>c{res4_D4}Jk1{Neiu|qhUY_p(VDu@x;WcKPCS>opNMI9j-_E8PEYY#Z;}fxU-wH^iz6F^K_NE2U zUs?bp0GM>-5C8xBcZE~2OjXdK2B&829bk(cZ#v7%^F07~DpvjtJD8NqV|vbouKqSDxZ{m$si%7}rP5=H8Y@0N zIxxPAq2PWjDP2V8oc)+_23o;YuW-ljquk7Mygc6nfTtsl2v%?9ZYoXAk}HJrOmhVG zG%w`Iwo7^KLl&AdIhDYF%Czm+pR=@lX)WJH0hs4*;Hy z4Fvwy@#Hkj8vVBokKx1bYwMAwqZpQ3X zZ)E8fv{jXvl~G~-^J!kV?*YKmF$cl@Z!xK>9gT(4TmS&y18-l6-SMR?o%$kV^ZmOS z9ZjC!>#_ry4@EHa0hLA;=5IOUDF6U{>1OVfSCM(^nO?Z>0l?GeEq&b|nPuj|zUvYJ zPj_lk>+ai>cuxZwM&y8-5i)+%oq$5s|A5O5>3ZCXlr%au6Yhg6DzfsuFET~-dFQx1 z0C*adh~VBAIcwfexefm!LciTJ#@XMz2;x20prfc!G-w6DWIYy%+9#0Pr+q(}LAo znQYmZnRl5Bzi$nzd-gW)p6=O@PWi!f{?;^MVTwT@L`BhKcwu-$j;4Fm!EU&AFJQU+?&Ot_$-p6PL+ESkK_CEjY4|Cs zu3g}Kd%}mxs+W+s%tTq4aIg2;dL95g4Liw?yu(JXY&zl6DC$C7=+>E5@#2LMmQJ}r1)2b1y^8nZ8O zPkNiweQ&)rQ)+8p0s!DtSKU4K%riH9dI{U5Tq&+?=6hsOW_ N002ovPDHLkV1mfXa>D=s literal 0 HcmV?d00001 diff --git a/ipfs/img/link.png b/ipfs/img/link.png new file mode 100644 index 0000000000000000000000000000000000000000..ad2b0a31ff89472b8fff9e34b54955bcabef0614 GIT binary patch literal 22912 zcmZsDc|6o@_x~u8Bt@l&AzS5^vo8**v;D4*?)&*Z_w)Mw#p`t~pL4G3oO7M!eJ1vpy^Y)o+ef&)J@zOLCM}-&0&`*FxJswKCK|`xt)f)fPM>JzcK# z@OF(|!sWZ=dP-{~PoL}bP!eSa33_$j z4zsbG@a!>Pkx=m|LcK2j_-Fs#g(Mk!nZl8F|N`)?@eTUY>XoWNmWR{JTha z!lDK_+D;x_?NONR_a#DFUX3!?w=S+qZIAP5z1xV*S_C`0iJ%#^DcacrtFm8J_8TUS z%Z+j!W224J+wvR-rfR)M+DViu5vQ?JN)3UX>@AG;tan5-khF=P;|{zftr?^n6Faib zH#$6A6I724K3Ht}B9nC7=aTzw=LKPT`MASKpa(9l!DRDOKiuJquREooP0CFZjIN$8 z?UxBE-QYtYKXoZGv7C}Ua?;4{7@|rfwyUKIDcN4+wSJ>LPv1B`sNFL49zl5_@Zl>3 z1Rr)zR$3|#Xldd$n$5i-_KnSN?C)6^JP>0P_uliJkJF`Erz^+X^ePJ!voNndU%A9F zMWOf5LYDNCjp@hnxcDs&sNpM|^S$K}(x@}^w!BQfwNI67a&c32itAunLw#ZY*1Uw7 zI@xRGD-ezZ20e58;HmV@YItTXUra{#8$^NYKn!DL zDopJDs^BAQT?aL$K8U~iU5RuZWC{_lQ_S~0*ln*XTAy;%Z|^j>(V&RnPRgF%i!%hD zj?k4tIR&a|=}Zk)UM%bO;?y~<+G1C`8a>X4?6=CVNU(iw z_i>`Ih%CZhU&HOJa}d|E8f44AuBfa|ZYwi)Ia+&~b9nDoOROx1s5H1N_;g>+>D=X7 zcRd4_xEJY4{C+hz_{#J56VkU;(4F}bbaZt!XYB(E<-8LL+1NYo^p_)TCmm3^+V?yI zTfg`%$v^fo|596tw6ZBAC=CkKr_N3q8F0-}^~vvi>!zxfFJE}kwrgpIv>XXjiI~5p z@2ij4!h)`hL7dI?SEJ*+*`;nMK}}aRB5%6F!T*|H&u8wcRX9Y+szAlCw?UTTHM*8J z6vH;$Q-uT?9a2r&`$n!&O;EGvH-*AG`|iL%p2j^-cFwIm{zh^>I#PZ(g|IDuCciYl zQp!2QT7H(PycbPhxKl8ABfYAF5%htp+(X0D$jUD#9(l#P4)&Qn9mOQ2&SpwR0ePSW@6FhXPC2ZtSwmXnOM}WH9Kc8`V#;LL zVvlE*sus_PvJk&Wjm41m&Vjb$mw1|%*tjjhYkM}y?dRVp5@E2(kIhXqf&56_0}A@B zLb0pTzebk+e(Jp*SiC14f}u1sU#{<28XoYE4tA? z8R8$v53-4Kj!20cWt)77BL47Q=n&V^XU8>lwF)^sVADHOADRLKF6u?|4~fhguTanW z7l{JPHu;0u2v6DOjlj&%+9~x>yRvnCQ%LFtSUuV`FVkCWym6^gN-D9zt$Do>ze+ar5HShu8>H^Ra~7|@{>1lVDIFTFTs8R3O~Nh{$$(2p32%S zaCKm2a%=@FPf75Oq$ClxQ7!z+P?{>>dd>RFR$cbx1HJmUXtTWNF%KDknJ_#P! zSu(&q8$NK-FP#q-|CsU{h3o3-I%^UjOJ>?zOFgwZYmi&B41EfBm>z=UL_^%*?<{0ezkH8uMk_uf!&pKm~ z2f?5*d8tp^%e^)KC#iBkldgwy+I8MS;|;ySmyz94f!Id=>qR?lj1mj|ya8KY(wK^< zTb7XmWb7vBt5b5)`U7$+9}&_M#Ei|- z*vXN}omIIHuVEarkLto?Jyv)jWcL3d|4eQ7dyj#>XT?oOz~1C~rdcNN64E;8=kL>c zB-P*lFb#hNZ2k*h;Ax=sa7u0=eQWx)J{V|#$;!;(HdXqITXG+b+WWkh{BXkjM)qG^ z?!9F7v&HFNB!N+>R)&74l<}8{qJ6~k>FiTh!M--^9?8eqM1g76*yC<)S=it7p8arr z^k@Hkv&!)IzH%1@_UYCR-0_Ihbkwag;!39o@K9>by)I3QxY+!ZZN#t|Qqb(Aktg>nsjTrJodraTb)wmQP^ z!2=?(h36`HbUikH%Znxr*$<3wC)qd!*y4=Tsl6Du*~uF5DidGq}4X`BVFv{ zRVYsxumcaqe#`*}srd)xoiV;{ac(0(VV)Z*viK$*7Wmg+lGL`Q$_+WX6aJ3(YH3E>Hq zgr6DwuiJ_@N|b^;cW{tS_98gvcknI zoZ5~a9$h?zvc9u>9|ooTP8Vf1hE!oojz{sTejdGfZAXTAgZbqv83Qjg9bP@!V!eLl zRM9W>x?L?8KDOeuzSyyT$?=!1S-(dUe^Yt{&GD1~68J^lgn1`K*;=&+wT;JxcM_ zri-eYnqu_md#QP%9`g2^?ncG#FAw2%gL($?jsoq%5k25L8;qYGudHvv%^tpYu+3Kb zkG7hRksy2g)F#2-1;=;9amhmpg!F!L>hj;MGzEhrLp?^u#>Jo4OqudUyD7HE;91&0 z$uF7nyfAB3e_rq_8y|?x{_LU{<^S;LRNA&vo~^T6)Y0o33Upoes*4X<%7n2HeRz{2 zK=F$yUHooWo{S0OzgSpSg2p>WUsCH7-wK+2BkI@=~Jlh0_!zJ>xZt> zZ+04<=RPw~B*?BUU2vyuDnq0GWj6|LOQU>v*<4G&b=(^lnxf5TbXm@=2wV(H3FoLN zncKda;9ozGhBo0Scuv#pU_m3b)aKe%pUv2^zrmR$<2sOLso6e3!Dyr7vFZTG*9cvE^hV+wh^cD@vHno2C ze&W*|bXw#<8GRtVmWhoHy24492?*G-^Q^~kR zd2(CSWo;xF_8Wq!gQrOgcs3V2F7~XaW7a+6EbAxFAarFqECr>f9w^g72+xeDioA*l zU4A}c%ID%eK}3x&T6#=ZbZHX*v6lxsvJP3kLLQw?6jU=J-y{+eaCgwP3WQy_;c(td zr}6pKZzg*qBhtR#b+h!06;ymVa!J?RN`OmycoKOZQm#N42J)G0FY21_hbDaOhJ2=X z7kZJ31p8WN`2FgEtVL6?i-~-gHSY*0sQ6Y8xN@yxFa8jsXnqf@TuL5&h$twG^-A2s zk=H|Q)T3T18@$z2RnVcl0Z=YYW~gmm#}RA2w-&jxVxOh>R{CDAALcvn$sgPeEsnu0 zUCM&%FvUeR%Df|AM_12qoccS1G?E!O&YR#4iyOdemci7g-iwyy5!6m=5;CwE{f%jz zGn&DO+|O4&_Xo}jPxt(8n9%$L0+#LU{x}1~=GS&1GGOXPT#oxlQ?+kd&@;{dC}Fs) z8s)J$4-;g&(`8`=AnQG6tY^~dtT3B7MG5ZSJFd>6kQQXZlDAeq$`<3H>Ah3iyFSib zey6iw4Nky=^7CUDPcsd)J~RcPmK>YI_JU`Ytpk%(T6BSXJ`cP&ATrYQV#?EO zmrRd%4n82fIGJ>2@T!r-D_yag!=ft)ZN0x%>=Aoy*c32d5j?f);p<20BV6N+gX{;H zIW(u2b$(0EndjwPoeMFl zA*yza1EGW{Det=u+^07iW~ocTX<&W1+f^DLZ6676n;&!|rohr2snt7Zk4BgIo1nzt zdDezba219>n>cV=z_w_sfulo-rxf^78~ZymVc3sSdxw-4=KgjK!M(7gc_ej{Lby6$ z6XQ;NSU^{|M8MU>uQ|2F-btA-KMf$@;T0vK8aJ>Nr>El0qt$n-#G?XeDT}(YLW4xGJ-=lJL8u_pKF*p(bKi<0)I6b`4;TlD|NjCnPP0So8t!EAQ^|I zxT1G4yux-A$+za4#{nXvOG$a%Wr z|5JeL%zH1ZcmJ%JgH8{F!;Q9O1?HD-)}nC8`>HZwr`l=%Qh@+-o|5d-L}WZ9)G2+j zJyYKDMS^UFu-C@0LUBN|D~Ihv6anWj4csj`OEKYF9mJN)X<|%@!EJj{aove29awX+ zM4ss-#^abRJw!=$YlypVy5g~pb&GRx#H;CWximq2fdb5THW1G&wa990re?ydWVT}` zyXG5_rc=_;Os+JFqD1iQ=!!OyNFNB6$3}}vWx~v)A4fnRH=|s_}f@TnK=iy;9?+c5Z8bbaIFI(0IH+iTkHeDn#GkYjksiut%MPJwZulIZ&J~qV^ z;}*wA+049qNrgqBz`#@XPVV)l{N7>M$F7IymR)9$LiSF3Q#!7*0Yn+RWbu$@(ivXv z;@B$GnB*(lHabxq8XLS#oqu6qd-a71B$7&h5j%FUwq?vtCe2$xW!te@H|j}G{d zAZ}P(tY(m?AA0oV?B0RDV9@Xj?)Kt~zXPqLIjRsz#6wDqU-yqMP8;~iz!jp&VF$ucRxrWy(n)<74 zKF^NLFERr1>|r92Uv`W=)bU>eok3AGRUofM$<09q%%FpEWSL@h{bup7q&g<_DN*oj zQ9vMbVOLL>PO-h-zbGNH=9n!PuB|K*=-J~8C047z&zg}0!B(dSY+(z~9XxUuyANuC zW7dQiij2@rt#qm|5Wki@cXd_RO!(Ckvc9#{dfWnVj?fUedT6-K;H$2f^G5Q^BOZSx_b6L##1GOJ z^}~>jrf}h{XuXefp|I0MDACnMlg#;uqF;#CEpVl_*&#dFC4x=!cTI|=m@fH+xbz3~ z-WGY!#5|>LUv!~?N={By-u`s-RCjj>N6912jMGH|BF3VPKo4dq#W$(FaQK)B`BvaJxr`3x$Xpeq(YU~{;s$#3yr!*q$ElE#e zKd`#3OgC&?$*v91{e7)HqSCf(V>kKK670RXD1BRjq!MKZC+c{ltku#k;OZbLH@KC@ z=G~5T;cZUt;cI;Ajl5^{sLoAG`A74jpc$b+P!WKr>%fD6K_4g<=B2f5we5CO$bAQ__}R3yA*PLqK%Taue`JDgA%kZsm5*P zts}qiNGOs~M5Y~5N`5L~77fTj;INywBlW%bPIs>+o(t18!|Zna4wfxGX9~4QH(YT{ zLuu1TM!0{fue>P`6rVbz%L%KcL6A>_^_e!Pnycx;uj~2T+Bp^2C;6qgv$Vi_U%8Y)KBfGDNC$9m0OBBoa)K_< z%jhO2?P9S0#1Hn%??PDvaEgz)S8W!2^5r?vy4ti1o|y81)83$zbY^&*DEau=e~JB) z`ndS#_feN$kTwJTKpjR$n+f#E0N?2VhgtM=;v_XLAdIQ6&STMRDx@te7&(u*8% zDx2A_n4F?Gp@`Z|TzU*8I=iS)(+aMW;dL%W6O@SLzfDSVa@saD?s-hJ&0q-2Eo0ke zi9^gfXJb4m@Sn^9aPFis(rWHfWud*BI3~wG&&2!GQ4yLF8yeTTIio~b_5r;*Fo$qi zbOO%uwIK58nsMlDCO$$q8AW?|Q=4V>zva|BmvPqRj>-vx6~l;8fijy<_3;vlLisf^ z=W9kaAR(@;J;JK5jyu((?aTKki5zjGwDq5d|H!*khS822BKPx6j66uhl9QDT(%PS| z8PeXR$bRvz z=%lFs*R*d85-X7?PX53!F3T(`ivtGkVUeZ>1ue-(Gl7h15W2|OzfZ0LPl!I|+&STs z^QCOUj}D+8OcX!MA>j2$W5oJb$*aIMox`0kCEH%G5lto_#{(}p_>a;?V;PH*pVDrV z|COs~@FJeHWr=X3vMDDzT97DyleEk2tc@r!N&%M53G#GOFJFQ27$hCGwn|_e{j(9L z=n`2d4pQZnu!Jor*dv4LMfYVL(G5GxT>sBTuF2x>w{Ri!fk(65PJyEYR=opjm|+K7 zeiEzKSid%~?2XR$f98()6n*kg^=+|f*$PC+jMts#<3CkrY0JXRDg^z2wDZlvOVvq zbD~))MDQy8AAO}$Sc>och2NOVt4O*MF(6FE_g8_0PXDmj;-6!=rG5RB%Fyfhf6`$z zXM~1$#XVIXt=f^>Dm%8}^d7JAUE^}R`tn`W!hrGDS$3_}ATc&s;iXH%FQ5i<<(oSa z#o$S4{~UaEu3*G-&-Iu;msmFtdE#O51k0Fn%^lV5u#39iF{) ziz{y_nmkae$o@z_3~t4)R$RpoWP?hEGGH$H_S~=8=KRTlu+^u&*wWx2IFw2ANWM7Jg(%C(_am37)VRL9Qa#Dpvy)9@4~8=eNg1fAs!Ho=gQwq z|3P|lzFD2gwxl0=nSRwm_-zvjgt!-<1WGyp%{l^B8KI6g?o1FrqIiynu1O%2j6PdX z>oVZXDPnfJEaa|lA&=ewC5;@TY52{Zk|4VaL_IY^_kN+knMr`Lc_-+~PizTvkfQE88=jy+(ZM}CGv#9vzqD+w)=BQ#nFxUk z8jfNgn=V*fiRD|je67;Y`Jdb~s7xtzHU<7hAW)(x|6mYTMhKj9%)gVgRyeEK^AC#Z z8+_50g*kY>%EJm!@!JgIG9S)I4BWVp{xYTU!sjvjwcB(zi`S9k$yEbW_TW(5_VTf`K;dO!u#ONy7k1Io{Xa}8S*o6lwN%m%(-4c1yqGHi9dtW$ufY) z3qqZ#@*X=CZGPet3BlMD((~hyY2eLinu==v<}!@<)$=>&Ad}s_ApADQgMrtjC~R)> z@=Kp3kl%s&sptF?*HWiH6D3Nd!bj$+7N;217uc95^I{9ZyZr&-M8+pKR&?bl4-O;m07PmWwsVn>BW)7aA>#z9kSQM~o8n z%ap*U4swXc?>6DgW0e9&#Zg8wBbMmNGqpzs^9TtP?mP}Su@<6RZx}*6E;>%Iv^?14 zbtYyuQJ^WO4I^@I^Fe*_Bxg+6<}radQPGk}csx2+R;;iOkms4=xwa=HE}r?Xk|Q*K zs%e%$I({)njSE>K1@^Hf2w-K>R-X8jeLtKv!Qy1sAka@x&@{$DV1B&NC zS4xk~xY5u&s4{MrE!B((QV2tXgGxdCyllP|!*UQxa^!oi-k;k{V6q>W_16+2;=BG= zDK!kRc|%*HaG4*nY@P%y;(E8%tm(c12lcCV7B|; zY1`W?`}D(&a$F1&KXQNM-DJWq8J}P%K3`C^R~}6u#4$;`45r-q{{OCC7DlGkIX5PL z;C2{+;)yaZ`phbR!1KH9(y#GVGxS(NX8-t+!8g~<^BAJ2p-F%eSPrr`_Qagb3ZDSA zA)`d9q|cATMQ>dK=^7TV85bK5Yl>g6mv1EsiunJfmLEA*mYh*}03UI#K?e3t_0+&m z^X)~OPmzvuQVN9gb7!%AZJIB}5G!+)TjrrGUsYQJLFer_j+qZ&4MjQ;P1KlydsHi7 zV|jC)Av6BXQVoJ>Of!!&g{RQxV}c&t^*MI;D&qH4HYnhZk9#LpJjKP+_9%Uc7seer z5&ep>lqk^sx=kGAEY=w9t)YG#qTCql!&A`OMtI5tpVcMsC=JnA=|t7#FQ%1y%;Gk! zFRypbQ*R-gbzNxJ=LFhJY)eU4sQCMhPVnEs#3a%A&8H)@n4s$be2yUJ^f8q z%r%}kD3VKaTQ>MueX58aCWsJry_MkEC?AF)STb{(qvvWE#F~NjQM+|-3NAjVNVr+` z#66CBPi4RcKoi>Yw3D(No(6_jcB4 z0LMRS53y=SyT|VHGTAHN34$Lr<4Z=oh3pXH z5rl9K*SOxgO_WMKi=Sv8T~~00vF*vGfM_$Km!>Iiq@spujycpylRqH5Q)*JC!@4G} zE3q7lf93d6F)VUtGfJ*AVdZ%K-v* z_%Z6UjQ;f7M}%)zy+i)Hlzg!5RwDK61b1|1ZxZbGu~qSP3bfb#DK>ZRPp@Jk4KQ;< zs%feNa|?Et+ivcxb-RY0F~4bQa$rRMe`?H@ZMTxZKC`1UIi4tpf^3uYZedXA`3v`q4$WWum^gdu&?2s!nG|-cTnyDLH7+xrT5u>8&$)GFW)$V~`(q z6l4x0If183?|IKR4}S-_l=2knhPE6!kSZsiR>g~()~mJVrPV0YEMNZ$y2+ST7cY>9 z1*fR9xBGvTa%maxWGj)h5hV!VG}OiF^@JQj8n{LN3619b{2V9yWMiUYXa5Ec>GYUK zGM>yhL0_P11aridOeXVc$nNS*VNOQ`>IAo1#&+>&`zU13?y_&&G)LOKFOok<4pHXO zHb`xl1Jn-Qbg}%u)|ic`kTdqmV`iZg zU)9tjmYdHPyBYbcm*%jBZd-@~aE-Kfz59u!HlJnOyDDcs#1F@Mz^z1$h_H~EaXi`W z-KNQfFWYD8T?io1q#osvQ|vN7!iT{DerPhfn7R5Tvu>`*oWkAzos@s}MqbDd_KX+l zzEVx6D2iunI0i4bsbR1=j8@LK2iqtuhx4CCt8dIo`O;-~{b)=uv`6HX=-gf=%xi7YCCz}6u#*5m=@~Fi3rD+*0F+{<81xALlE6!uRA+8 zR@unaQmc)}i*hI0#EoenT}vRbuDLVWzC2Xc-b=zr5}P!y!cOr~#g=_eo;6Hn9o^Zj z&pjv-tpDkm=DQX|3hy)K%@8YnekznR%?<`U+pmp3&={74y!2C3%bD=2l9DoJeE+ zuX*Fh69rx#HJ|#AQR&p;lS>YLSUYCUKVij0CNFwHGY|G_w2Nnfx@ycJ=gP~?86Qz8 zl{RwRg@4CDpE}Eu33-mS;~`n`Y`17L{^>Tmb5Tyh>osB+QB`ryHt5)oGG6LC-caG$ zva5Od0_w9IQ~9qpas9k6`Nu-KfZtwE_L7Stg9)ECCG2QCpbbJk= zG5u9t(BWR!?m+%XVGrVnM4GKgZ0P#e?7*{w+=YLlBcvp!Xl_YOMl!yP@YF&4q|)@u zc(?h}N8tib{FqGAd!oX=;5mCn>Br{4GJGUcOnMl=EB_F$J*E5yP)S(MbQ?YPp=k!J ze>VJ1eG00+Vij#B_x`vbYh4GE74YJO$?e&nm*~f>QmApYau%m|`c~Kt0N|8Tj`f z;s*zB`W{dxWRLZ{_h>#M2oYN)`J{a}{Sx~E1AkK5AlR2JS@+3=xeU@=75Et)9wTdu zD{i0p0Z|QAhJNlaA(=F)2^`_qU`=bIRgE*+J~(q~IA7jA2^0Pbmj)Ehl`+?a7yFH> z+3kw|VgmvQqn`9_QKV5zL8yvWDz)Uy0QoYefV8`Tc6gt~^cn{I*YgzbtK3xt25KD{ zp#TRdL&g$fDE%{Ow1VE~D98$aks>~ULxTc;)a>kL%+X(aWq+-_N{WSWOt(sU%wOB7wHnecFsHgnxa*7 za&bY3nWwHP-VUtO435<>KZA$RqQImb7d57SY3szlm4COi$6q~R0*tt#A z=y@@f8hAiGt9vc#O`Q0VpQ2UO)(rexH;u82^+~D~6zb1)J8GzdfAH6hiW4@XTjO`l zfvW--aDI_Sbp&Nq3zH)M+!Ts`;k8`LmXJMttc7*DOT4fDOctZY6fF{G?$j{M*xC3c zy&=X!z#G#Pe+jTgP6vm^$lYAYWRLZx>mkcRwfM@NrbaiB$KU6za^PH|(`NM05|lit zcK)t|)c&~yu*?6?9>Tvg)|f+5>`s-o5~-!0{Orl?^{}b`RlLWFjA=;mesiugp($x0e7B1X!B<9|uolfxKL~5KL{4&dJo_Aj9T1CQ80Z zedntJIVVLX&ll9(P#vw`o%OGOC7tR^$|Z)qalXy^AD}CUZQt|!x24>jFE(!p84OGW zNg~?roeHZzHtMU9#!_!w`OOD+3ndEU%IG08?f@>R@E*N}_`ey{8l=|yjmPg9EtHxk zbyZT;#l@-8XWVL8+|c*_-ZLL#S6z6&#d<_k1CEWReTF$B+6E9QJKv)X(NvHV{V!jS zBX8yTpyudNu#xqy3(Ghp=T(e?=qitqUzPsIt<56|#R@QFYjo*Z_U5;9?Xy1{Yl05q z0NNsV)Rz@)V&)~8Na(ouEX8{!IP_YVnpkzJ$UIWOQk9v%6?o951Kf8*eC-Kpjzj4; zKnlFMyLZO?3_DEkV(B%?f1*+OylbWrQ+Jw<5tWwUa4Nd;M;r}3+Thf-*~@M6AL|$6p?RqbGYxFL`?uyqarj{Dle_N>$Fed%HCDgKVNm>2 zfc9s?zWbKOcOQ{T^#6hdh$D`?tLJnrh=%4(#p`$mHQh!Jx1-A-wCn9cU&Z#%E-x3> z)emk18VE}0tRT`M5cAjU=|C{y-kk`Czt#r}(A3$VpK7Rv06_H?rS(mIl?(qKKpHi* zlF^2OU!<2Hlho*2N?q5zL2T}GP*lTUApkOx6D;f+rH?PQgkEfT_DmL8-jUyvn73)W zi%_TO!bap=cDLfNBI^@f7lKkTp%l+*Y|u;r@b}+g<~MNM)?!E-4v4})zr@!c_~@kJ zW{+IP8vko0B!07MY|HC{w}EM)<}m1s$bFP-8~xmN;O500739UMi>s!r6mAd>8%c-L z@zJfnq~5o(A1A>leF;IQcZR+MY#!$h;cC`_w9(`1+n%|kNjfYc4*}bpV34yrT$*ohT98;Mbw$M zQZ}MEP&gXOz4IwW)xwMV4AlMVPEt(+w9tK?ohx52m`nvCpA7|;Nfj@16UmW9mZB%g z6$Q{M2XSq7bsf*BKKB>p!inJP2_{9i_ukC9I8)MYo?lOU@8H{}0%eVA_DmxFNpOkW z2Qq5aC3Byi;42h!ENiG+>5j9eGwS}{{d-#Nj<=G%g-dYdE;|1gz>0rNl_@^xh1agH zPNX6@XPDAeHD2n8!0gi zWJ1KntFmN(5IUbF*`O!8{`&uawuFjh3`v=9$PD5komGUpS$VM!!YrElh9!pTw46Db4ZT zNLu(>!Id79LV7NY3IEk-=Ss_JDs)TyvDpB7z4zaamCqFMPFlSeSa8R^EMh?}Lm=C_ z>*6))d7n|xBY{@I{s-=Cpo%H#Fc5`5mZA!`?SGS1rpk*3J}^q$iaLb5k?f$qxci=u zixDD$2~Y2J{#Hj`)1I%ylcxF}$*zy?%>G{6f%k;xLfK+H%l&MN9ua?p%8h9{>05nN00zj$!{9xTUE4m77x!?$|cB z&{JKrxh~XGP<)d%qf1CB$prb*kG2}+c8y~QqKBLE$C<1IAK=tVgHtq4U?Uw*p{-C7j8MJOU$`F)1r~rNO_WV!08#C56fp8n>gCgy} z>aFMMnba%Ivzk>*5*x~%D-k~toHvVSxs@?TTwU4R4-6%7@R=feAYZAm?SJ=$U3nq! zs(Aa^Umu7(ejxT!h!F?#OyIkYe=Xkg3YExa=COfV)z^4kn<45-T+S27c}YW42Vdj# z^e2YZn2Zr!F~B|5Q?zM5n@UgEenJ5#^(q$?Y9nJO!AEnCPJo_R34jOO{zbDBF>UuElN0(f&DYAAFI zyUT$$IN2+;^EZsQU)7Sxzl@m-+42uCS;WKRa$GR!4XeqE^9C}*#FjDTz92E z2>wF2ce;S8T=)jvrGg;U{wrFb5%LeuD1th!fh=Hme-21W%_!e2rM?vIoh>-8GQ9%u zKw~ogg?6CQd_PX!btAUvk=K=r5P-z@Q`SubxGO{f=rLJCjsJmH5%JuD7{X?HFE32V zA3%(uj?Hh$uJL7Shp;A;gty%GYSh{(K5RVj=OeNLVKSt0bWRKQGg3#0 zQw+oHima`zjVUeF24(mPSvY`d8Ed@O5NqF<)mf3E7>mT3FXkvF-Vz$+{e#+;H}X9W zl5-${guz|5pgLY@iVxa+l1{NT0rhv=k&I1cJcY1BW;}!GY4BbkDPd*Y_BR7o0#W#E z3HJUeEz{$IU_j>9CVO z%VP8IKnP@H(19@QWCsGyV`jTIVNR&3XaiEwqQY!KPu-shloL6VP0!IHOc%zNa{J_h zF8Iy{CgaBlvNhiuxD9ah4O~TM?6ZRcQP^zvZnn{s`=Aw=^92Xed@}@d086sF?sp5K zdH*WDN}EHi>oD~)wSjBhd_j3i+CXwK5P!~T6R#<8)etYG7FE-gZuN$<*fN9x08~w3 zH{)H(^+H3T&Ib)quav830*9PY38ZBWdIFSj z^!v<;L#>P>=OdJE@cz?VBa*Kjn?LwbP$~nTKlLV<(;OLfDT{*6)LrB z6~JMKaTgmwM=q^6U;87wM{@rY?hPhJxCX%YU>va;2P0?j#Lo2yIMRIvI&}bKwE8vw z{<+b%hR{1`-n~rN4^S|d>)*$01)x|e2Wmu(yC~ewWbEWI@O_bKYW85|4s!d}KP`6* z&<9|aq=(+35T-PCfaRcvZ2C|yuLC$rF*;KN*Xf^I#bhWG4?S0d15iD54(aWzwg1;B zx_%cL^oV5F7aT4NG65Ws5l;H54{K7u73B@wdsPJqm;`GEK#nf=*b=;#+?Xi#oQZK4 zyEWnVMdO(bGU2jBOtjFq*b)GTk-&$-b;imo5+)CP@dd@#p0nad@EmPeMd#G6--t&^ zWcn#~Dd=UvXyall=gZH3nApo?m=HTg=IS%|p8a(YuqHuf;1=9^YUI0Q_FEagsUJpM z^>F@tPVLBza&E4mD)EE(zQCoX`LNhz_lejw;6qPp&)M}Pz;-)EJK6G6H}#iV_KWxEG`s z%@?Xy6DFSz#oqI7YsQ^2hEC;id-5z^wPz&h!7{%#)2fwr_ zPz^U4C%F_ssuQ1NGLF+7ZA(MePf4SKc=IN{lu2PNEBB1LGJ;&;)3#QkY^K zB*faO3!!R%XsKCzjf$DnI-&&oXcXuvj4B{=>HJBy&eWw8tGVy?=jtT-sunv8HaEMan@OKLBLY1xAz6tT zT40)kh;8wQw8@|>fXY5w_yoxIWdF9XhXOMoy)qu2&zTJfAcr!XKi5SGn_PGVW}59{ zvbA8SeWzoK!q^rRYzgpj|E!K-oFlJ zMUg<)U+y1v&mlnlyJ0IqS7QF>n56o2R^r|%V}S9EK#ACphoT045nv%JTg=04?fDGQ zr^k2J5VlFoD*-7!K)DzoSg|O6vRlX)3*zNhMs~WeBtPr^bze}RJ7-XFP~_{seNn2P<`#o868tpywaC%K>tr)DT;- zpp+kdJiwbb5)dvyKgx?oEowS(H-dlJb)%_KYrZJvTo{XE{l04Rq8Qj#fzBKqV^brp z3lNZpg609JUJF`D?-gxxdPUT@!kTSiGB4gfmk`=Py&SUv_eZs#CsBpAAR$uQRlL=D zP);)9I|tqjQW4S8C~ICx$(>jVWk4#Y;E&q>sie|Q#kS855X$$&eLcH;=}2tMZ$-d)GTh)?(QR}FN!9@c91dn zKuHm%jX7%uOvZ&Y#wOFY>--_)IBzbd3G@iQv|oO7u%VpCWZS{M zb`;0vB~a~e*c$d>TIfrZ7Y&sb^B~mzdz7G&=aSv{fNHEMaqMeP@i<)h@T2`VA{S~2 zl7Hq6{t?eh+X?Yd7-h*YwS+_zWRmys#^sm4O)%$WS4UZ?BB8tt0;|CJBdN`x?Iiy4 zSYY;54sg$d4&HCH(-UH$pEQtpn^221{kZh+?PrWZM_SO(1A@N9j|S9M(8ZNuQq=do zLtD}rIL8_9#-E}gEE+h;=Zi6Vma}MjW!Eg%?PyvB5v z4(uIn5NYQ6P)}G!;gA+E&`-XE>-}a6WC4&7?4?HO5>K2>@Fck3xDkAUvJ87>sPXt; zG8AI(iphNHL&mm|>C=mwMK}io&*Zm!;2ry3olesuAUMwIUD2N`?pXh4yyy^-kKg|@ zFR=Oa88^*OON_>-wk^Znz{TO|&NLZU!oiVDSuM%G-*_DS4u$%s@SS6BpEfM=-n$29 zl@C&52eb2C78-YAgkR{JVtYA8n0+bK<$urEN|@6$iNgFi-By<(nMRtMHKK1Hnf_zb zBifhny5UYnb|&>_IMPM~+v{f)rp2k&2E)TFZJ_$HXGS#l7)^Snuq{+s-c4MW-3+^WM zR~mgQY=ze)+YcjoqpbGZe;$v?hkgDXe9?D47ivx3m^tv{v}mXMDVsH}dKD@TD==&P zC!rh!^qUrEM2Vke_9N7a0;L444+MJe15+pdUm52f4^`gBaf-!i5$kbFv`oS>O}P&7 z(6GrZiriU`U9E9zMKdll6>Ukyk`P0YF7A=bY8cnD>y}!JY%V>nxz2dPFwFBkhc4Pb z=QZd2&hMP_`+d*v_x*l8Z|V~ZPR+*|sR;Xa zzJTxFtd6Ds@b$2mUmRaaC&(L`fcF7R_u3j@x~)D0Vf)#3mGU>?t`L;Zb@YUrXcwr} zm+!J&e=66UfBzXeKSVuVZiM9Ow1#`ua^V*_RHJ0R=j@In+gJ`4hx~Fl$DjVTdD|Fz z>OO>;frytErFxXhUkJ=V!%OE%jgxgNce({Qy-oSE18z=kV<7ZseORC)OpJ0quYEsd z*o+$lkvr1)#0m<@EUD0W>CFdmYs-Qh$SqD917vD?$JzB?d6;-bladO5nz6(>idJ!H zM3)rRN$WpicwVMmm~gW{Q~RzJR9EtRL+=OK2Rh*<$xorgJzZpoz1+j7G(kbJU)KDekUXU2+DIQNH620() z+sQ{OB3pwy3=_TFm&+j6qXpklOPw?n`9l;gF5UzAsML^DMUV_*@fqWjk#cX=vRs^Tbkq7e4!-F#EuvZs;@%X*e2 zu;@!y?@V9HnfMEjA2dS%NvzX+DVMYCClhW2Qm&9tgpzOqhh}@pJGHWlt$AzdabEg8 z>8~yyk#&>L^Qbui1eaJTbb136X3;K`s7{*`Cx^ewykQqrW>ueiYAnCWNSqtL*;EN< zCVtJv;D^+uF1Akn%XX^l(NheCv7tYF_FfmyF{3)B3!g^}U|@CDpf07v-;GnnFWe)q zHrMiUAw61SWL2+?p-gRGB#J_A5={3}->~}`{)nKuX^)BV-Gf0wb7UN0eH8FxNoz%h z59*U)F6t*&7D@J0rLUk+ngs?&&UsCD9IN2)%zU!VwM`;~??jG^^noHhEy4O+Pzpc# z^YoMD{-A6M+LLXK?^!c*SWhIA-E2V`%sm(+Jm+jz>(#0a`YN_+m6r9C_$38*#b4OP z5=v5xJCu}bOUmdFi5pS)X&>)=hKgYXb+}vgb+|f>+)s}1E1L)<8bZdP29a#F%DX*` z933@Xxsu9Z>ob=OO~94_?~&heV?)g|-ijNaWKaY3ojmUx^mH7^u_)wp$LOqQ+G#Ta z_NS4PX%c#_*Hq&&3(KIfALnLO^ZDL{;!O}EdUjs4_dLyoO z9)sQ$t26%Q>$6w|pn=6*pK%`H+3aE`*;0}l$uI;A*v0o}2#XYB7>3D5%}>;qqRcISlajAL<=SX;qoZ>dOkU4?}t39qr24s1LpTW+eO(Zlq;xjbc@d3H54bOvt!q-7MndTxIV;>W3L`1@Zm_J!4_!*@m=$Di=&9G%-9l8w?=Hozkqc^1#_$R zA)u#Oub-d$^~Xl^KOZu$qHvRuY*N=FqZogvec@3?)YZ?`TlJ-GR;9sg)$HgfKBO_| zd32BXXOe_tahiJ}OBQ>5(GEacJal(-co>a;S{|Hsij6y+c<#G|uM9Jhpd?VN>Onmm zvW$Goaz~7(LhBB-;L-vgB1b)nLY4%KXTC`!CUh<2jv z)gfs?FOU5HF{KRTb0>3FEGAF=E~xr*4+o53TU+a{8H~_m#S2>GcAMnrIJ9f zgu&0bLXGYw5Z>gYfB&EAnceVUlT48E-ok&IPu=|XL zW4G!d*C-)6{?d9{Fc&d+wl7qk@${&iH0DxJUnw*AeY5}cXGKv%UQ~zX_3BNC_z2GN zWIC=4BRK{162Fr^^?!IK1YSR6atzmYRtqnC&h2n#geH8rpFh3E%t7&iDl%Jx-oWjF zU7)0S;nvFkYrY|!P;_P$@x9Ry$fxqiZ(D(jPJ)3pmw>1hvtzeOkv(&_t?g$@MGs{O;tVgj9d3{CXyawafs%jM#udiUP3T8!BmeZ+gKF{> zr)`U&BeLe1Yz+r>ngx2BBrs`y5Eo7huC~kAjOwbnOlpqEemPL{Q{$@=BuAMHB1zs@!=LQ3H9ud)jlnTHmWjc!NHfz%8AB0d59WfFVV=>z8^s4rtE9J;E@lpE!PJQZd-9JaW5$*BiN(FE-M_?QH1kELo?SxMy-q>*r^K20&jV$4ZuSQ z9GKz2rXX9gN0IYfK*W5TbXaJu+`FBxL#_WYsVT&Y@oaW z=LL~Ta2l?2y`e^A&fTSV0!nYU#=4|G*~hFH5L-Y{&m3*IfN z?RbMgK<979SN3`i4C^a-T^kQRFG4zQDKz6#mx)zu3gglbWH{WqNlYO9_6N3EjGKi4 zx&DlV98_PBa7@W;b!)@UF*A0G1^oPEsAK_ufK5}03%F#BI}n_cFdS&6>nqgdZ(nqN zXlCc=UxcE_?%;dN)u_KaRtjz6w1;m_I$tQMLonF#WD>(oZJ;9Hm5ET{W21)-MgKCT zJGU?=$42pG%P}hA@>7l&-&*j{3>fL98pM#!BXB@Z<~N9y3wxG)^e#Wc%`Y=A@3lpv z;c>d={unJ|=l-FmC5t-BeSO)1_8>%9?2DL>W69tIvQvToBz#N;yZk| zL&BW9n*;_pbW&ug0qmw<8N7xU@(#+fv0j26Pyu+!Woo#yFN~!^yb& zv%~<^IBryulP(pw!SMugorQFmf$cCjsQZaUvkzslvMXPdD)hkv~dWMv);GaEvYsn>=71JAty!~g&Q literal 0 HcmV?d00001 diff --git a/ipfs/img/preview.png b/ipfs/img/preview.png new file mode 100644 index 0000000000000000000000000000000000000000..972d1a149212fae1f76c7c6fa5d417fdb0639b19 GIT binary patch literal 365083 zcmd43g;yJE7cYzzX(<$FacOaP_X@?OxCGZC!Gb#!r%;>}ZLv~ZLvRgF3KS3S?gZzf z=k&aH-TN1O&wAEMW>#j_o-MzvlSnlc*{6@mAETh4Je8Mwr;dVxO^t$rd4rAla0Xi5 zrup!J;rd2i6Z>KLVp~K!9Fu`$bU_-9Rv-^k7fTdtpreB&hpV}Zr6thS#u0RY-YSWL z@)AY<-D^$HjNLgOCxee)7mx?-?V&GU2czITrtMDeA~t}e=u3Rv%Gw7{SI$=N$d}q> zx^++2?@lFa_7~;#vlK217j-2oFuV{`Syr@kt!`fHVkx)to3$57+{?_`o6Bk`PUoo2 zE0Bv{&P2mOd-?LqOU{jqn|2D6V0z|w!tOi2pH@HRsZkC@JmEgE!zWE}J9?dHJlg+f zskWUpQM~+rPI7TFP)GdVtCvV)Iq3gB6(P>^|L30}Pk@2{65K1VRYgV3X?f9j;4d>$ zcd6)Typ|tJEY3NE{*2(C6`$BCS4NzzL+`A3Q_+mfM-Ik>FktK2QmPS*b# zIkuCaGeAM zmSW$v?ZFiCnTOyjs}q4|7@t}X&$aHl*!(hV&!ymVg#WUQK;+r~G=lQW)0^T(z8jhY z+{z@Qc4tb;)F23iqFNwki5F5gcO?s12{hHzly&1 zcPYsvAA;%cZR45pyU_niMl{(zJdPT6F%-AYcWUB)o61RIIf4{0#UktdKc9_3iMonqH zQ~j7b5_f-C{q6u%Jf^S z(q5^HOYQ>%Ia9KpDmJ&TBw}tZZD@$JtkdvWyR&^sPaMn8@Y1Ra3P$?vO=Yq5rALcL zyi+bxO-l7IZL1$y{!^;Fu-b&~jl}31_`$rDi)4_47%8>T{<$C`(~uOl#7L>>TEQ{| z*N9?rijo0vhS>OgX}#$wKPhd|;P)P+yY>B#f8PJ+j{Uu6U+?!lB+WtYI0IGADAgP> z8-rxH5Q-4%>eV20;r!+IXdQ%@i!M-7;jv-kTOy%)(9bh)&D+1!S#bTIr{zxWKaP`X zfFI0#HE}BqToF!dCq|4gm#wE*Cjl!G(Wj<+lFXjy4h)cny$*qQ(lolK1gy+*Ik(VV zWau;g)yD7tiI(7)A$-4v*j#aEAkBY9vR*l181smz`}L%a5D>=<`@7>3H)P_LPqQXDA8(<6BESY=!J@o@Rap z|3Jya0pq}sW60Cn+sVrh-st64`NS)VuX<|h^s4F^CyArc?$W~Tos5wrmG}G*(O<=N z#Qsm^dW94Ojh7wo_EVbz923R?rnjk*TrEMUxY_ufo|P$VPLx=MUkbSe!>UuT+73<* z=blL1jMEqwb|3f+b3FfhyF``$^R!>sQZ7i0V@}|bWNROedFmWij=h|-W6kPnTb*#Q z#wmMX3XIGWQKsc<&QQR+&Y_z=3iO*I3a*h=H>m^0zp&Jc^FJdK8DXDYy6fP*-;%l% zQ7r12szVP8nkI(LPR1QIQF!)J<_L=^e{{y_bmqpjc_MIPe824hop}LsXqmzx{*QMz z|AR)AlA?V6fNLc1WUW(n^_aoL?<1P3G5&rXc9`?%DBgsKu&|xo^Y`za6o^qI%hT;1 zY*taKp&zR8Z3FS(nqhyH2lg!e_9BewRtV zqNS}Wtd)7c&i7of%+AU@seKF;r1gh-5y`)9p(+|NiUFaqg81W6WGaaNU{STVO`44p z^5@ro>2eW?H9aLENd|sZr)?-YKh#z%wS0!x*3T^|*pINP7$1|bFAR}(v-D!??3!Zc zOLttGw-gikK-tso1Z{J6Vy6&9JB_t8FJJFnXpSzfec`BzA9iVW<2qfb@O;Cnl8}XR z;HQ%ClsLX%fHjRDad0wtX}#GL#+y$S@Z`L?oeMuKw&^J?tqYo^Il_-y5qPp8NQ3?_ zB#CGn#W1n_k-Ezb`_q#~GLt7+`+TIFi8mow!cfG%<4uhV zU(@|1)q2#mBP(3)hFXeD-ekP7d8vcn(6jj|#*K1K&8LXEBK1(;x6juvSJz38Lgwx2 z0iH_uEtpaqL$AI&P`wM0eAM;FeXUZ+{%iTi@7UR7Z5bM=1}l!AXPql&inC4cx`TZ? zWxnm(L}mc=-ot(-;sGwuIWQ>1)v7+Ky?Q(yUMvzw21IWgn~ZDJ%;DyVJQ0p|m?b48 zEqKyX=S&&i@%uR}*Q@FF_Q7Sr9r}XxcM*?6kHUp7&pu2}-LzH-Hjt+u;$?I@`9KH> z0m{m{vT2^rvMFcdK_-GV&psZTipl^aGk?IpYUwi=`j`6Ca-x-HW=IM3cDpaUs#RJg zt(w#|Vrj(pLvyXv3!@2yuyjE0P5@hvUFg|VBmX#5%C~?0OZ*B4q!&mz`TPfAk5Un)Az#28^_KI ztj-?RTot8J#SPdQ;98tgV@_z53Z5qKqLTPbhAj>e6bo$rnqN~9k*s7YZOMRX?Z<+n zlS|{lA4T@qlvFEoL8N0BM{Ef2oww+f=ej|YUr`9rgkMXLebqoUt{;JU)dsm#Q_g{= zg;Z#=aHq$L5^VV7RtGbJ`9R?h1hk<37iaa%Dx@SIdw$el(os36y9QBSpvuzBsNc-*9 z8*J|2?p-zO#)cZQ#~Ugq`ex*+#TTp7ib!<%>&XbzyQbR<9U+9^UtUqq96Y}*XpPLasf)m6hnd=L5dIzt?tFm=X`mwW#spj z)nqwH&^sQ3w@Jh#EFA1*_an}NgwNV4siNY{k_hDyg`!R#pxqK?r(Q}*g(I1gDOz_) zW3bYqz2Hc@yApijWYJ?P3g#L0%!g{$HJ> zTcxk37)9LTD)|;9oRihwxpVuTW;Azo&$&=}RP=JHIPbJGCr#P*?7bjKk zi2b8u88-jvnEB9m-XoOMD!kZ)+6-E+PcJUBnNm?FXDFNjl3_Pt0$blb_c(0pSccf9$oLTqb^xkS0omaf_}ag zZZujmp+iN(B5z_$9j-Z%<;q-wnUFMpv-&E*$i@(z-_+d+%JS*cY5@S&Mik<^0R-1S zS~Ut?Qn(6=P-dftiE?&!-Dro5j}p18`+(=K?7)#ztRc5*_T0lBd2W()e^WbY+Y-JaEG*qu)n_2M^?k?@p?b*G zlhBBXyuXGth|GCbY~5F$vMyXVtx@tn(WI6pcE z6WjN^GN`#MT#>)qFAYWayK_G5GDlXEx(Z4C{8G4Bf9Q?(3&Iiors$Jp{gF@HeZ=-> zT$fk;@S#2$|ID5I1|^1 z;V}uou5C|%CLCC*W#-DK1Y7AE)vMClx&2Bl)t>UKa3&WQB!feJO2%(uNkW#MZY>F> zg(lEhYu(MAUf^KPZpOItd5V6z&q0mxjjHU!fh{ZMX%EDHTk2SN{=GOi{iHebQ{0av zZ_fs03`(%143<(EMBR;u*TIHZU?0 ztY<~YvOG;0dR#ua#`p|-lscC8mtUC83aS{mR)Jj*4iax4U16X0&FWYmrr>O%rU{b% z;$-)!rEEB)^`3Kd3__}}FEtMZxnJX}q#XGO=}n3HGje36dU7;eCn?);be|65CPrE& zOxtTMfR-F=^78XPXKj*UsysSsF?qy}+u4TF1SBe-&6~!$@3t$ve67QGzh~{rUXpU| z7Z>77j56#!-wuJxTp9$d`+#an;QVj{K}d==8GN;GbrK)+%i5)`yC+nw^F3{_`~blt zNa-pmjZ#4cY6ieEKc<5g(gNt#soQ-!R;1|LXxF?q4fXM@tZ2B?_XTAKga)CgDewt; zXD{j6+LeMFPeoh31sZ$;uYUC)XkBwXNQZzRBOQuVW0A&6@z?REx#0+~p^2%;L;R78 zOL7N$R;Yq>$rn!{vylg*4r4-P!+^v|hjdDicyaS~Y7;BF{C*O&neQ zMI~`KnU!rZ4Tz@vCn7k_oHify6YpfgH?!XlDs~Hm3{QMGm*neaGLJSW@3hG~=wP^_ zIQKD)hhlk<`ZbN{)3rgPNj9f>K>8Ld)iE55x(bEz8^@~(v$vC=Yixc@8=Sfk*M{`0 zF9(5sd2+mh-BYMCnG2yWeMqU}#kXHBdY-X0b?xS! zq5;^e9`5H^&!4Qz1s%Qx`_;RZld0CB)!2 zE-ChU_noH%xOF3Q(*xaQ&#;=;2J)>))8lwj2fy^Mv7L81+}n zadEO%dNU%C-af@ zl%*qVopQj6*^idOhG|*jqq}Ck1ntjKqJmKS;L3*$mgfZcf1W(|3cI6si6a3=9}u>2 zSfoX#-gkVy$NhySERwS9yk19$FP>3|bRxI31e4xIeFGa_kpvpjrptdBqEE{p&uzX& zbId%TuW%HqmV+;BtXyj}BB^=`)OzEU*5w$@W0Y};Bqe%xNW5{R)>?O6;)n*jPXzAN zX)_}dITr*yseiUs~h4Nv3Iq6)j$kK9v%l8=O&8zFEUB;6djwkVhXkT$8%F ze0~6zoM$x)TrnxPV2O!)TeO?U_GC&-+U^Iq_0~E-n*P^A>OW}lvwR|)aQ0>ajvBv8E!oDAUClV_(8H4X=h@OPzj+*qa5PEXi zgHX|N&k3$I2p4VO5kd;X5Th`B%+qP>NMXJAz=c&SamdM|SY;qX`>Jj*_)=y5WdjkVs(gudB+MYBL*X=OQyN>=>kK}zQ0z!;aa<7B^s7kC?p zTgJm@c>Eos?!3mP9I~kHR6Z`zbiTskuk9V;R@RexEr|v#hz18^2qay>2l)FQ+3`%7 z>^t|Nf-YQc&zSQsuFg4tTx&nv2Evn>GBX~wHRzmjA;9g6jf7CKT{NP>BW`JKKJ~06 zQwjE{reGT_EpK22TlW9zU}`c1-qM0LrEG#jAR4?4K(Q8YZhF8ZLRV z2Pfr3xdEOMz^3s7d|jyUTVvmT5&=FO)-^MTCsO5eUdWK2&1toOS3~{a;hyTHS>Mc= za5iZ-190vp0>7~MA(QcJ_77G@MSHs6kF~CnmA_?hvwFhgKJaZSDeES~V}CaRwCFO< zxwM}oH@vWtnND}zav#r@e|Z&+?-}4?JsPxi@}?JCoAI-GV5UKL1w@ruEWXWX zsO*04$ox1rcUAU1TOyuGbAQl^$pyt>W5FWa!7F*5Lw^HE_%IN6XQmrH&Gw zbG_md-;43LRe{OmOLMcy@>m7M6F3funfFonjCgzBK@sd#c6KjXarg!Hs9*B`gt0e9 zXhj@#J86x!Q@d1_dv2^ZXTJ98{JcP;OXFIM^}O(%%Q>DDR79zyLA9O^^k|^YSdqZM zoW{$nZ~LH=F-vKWTxl*LvRZQj6mX#_lMs?jUep{=;eVr~GqhvNDbXFC?Kj-J(kvw@ zCe)=0oL>NgOd5`afEg58#yPd*=9?$@7mFkFD@SA5jSG}Us%IDGdovzYCvR_7Cp?Gp z(8u;*JI)79Bu)zS)(?ibM|Msv0?_n#kYQ&Vm^4OM{9qL^fiRdq9$0A#u(n$8(PBIK zf|R_=XdIWv3VYJJpjy$VnsZg3#2fQ8U{I_xI=u0B;-8>i-1X%_G+&GAvlyXj7M zlJ;1CP7e=?JhmDC+(ik9f!X~&}#PKtp( zUY8BL#Ps+_bZwW#I-6W|&B(ap!#KfSqDiKj1@jGQ=$|2%B2@ zyq77?*O`4HGnU>&EIRK>^|Z4Mm*3o|Ue4Jx$k#sTejVa?EX$ekt^1&JNAR-R(QvW+ zb}X(>inJ5=QKkCF3QmXS@Jy9Nnk<<86H^9t(%l5e%F$wE&C1p;23CvTPaN0Ws19pI zwn51RtxKv@y%y@^B8u z3M0#!Cw;3dwddgQ>6TilP_DAQHP?~mEX@F{W)h#-*fXa~J&59G4R@_%t8(5qSRHkS z!NQ>w3wSkp14O>fq=E6y3B(V%DAczs`|f$Wypx|BDxwcg>@&MyvZD-EXye!hc6fnp4&HNZt>A}cS}-l(9UPagoBQ6Z`K|YJsXlc82zz9;+eAoDYiz!8kB{v8 z0CZ#+o1rgsJn~;L@YxOjg9DTv|0ehGB7w?j(f$=b;v0%YhLLX%Z=?eAJj&ctheOH2Xr4Zk z&}c02^EI>gF+d4ma`fNO|13}>fkA8SC4qRoIU$PxMDgjIP-SOq;SZ98k<=z zKRi^WNt}*-?i)>GY_k9jC97x7q zwDSuEr96xON=CHvIJy%NlRVTUbaUE#Y&ah^v1!eT-yU1tG(YirAeF{}Mn`O5^A-ow z9Vd@U46j~H)Cp2sd2ExF?I+Qh?dyONNQ3KM##Oy2JXLf$oQKxajn4<7yfaB+n?y^?_G|m4T_X;^m^09oIfNK5 z@9FrkWIM%e(NR(@hNF_SULW1=@tAP5gD}5aI&W{V!4bWFuzs}2`MPQVqS{ZZ`mB_F z-I#dMiNF}M6ihNB_h*RNYP&|Q#J=W&NY*D4s|0_(PJwj(Hw(b< z&i(V}b+BUckd)9{Q1T<&(k|RYHp>9KtPK)J+zP&7$7KiHkujR@8%j(N$$Jpn<*$Av zo~GaMojolsRt{%7Pum?~6pZha6RC$&&YWK{I_7+@#i&4Yw-Ly7!F`@x+|Ev-(^ez6 zr*E4pk|JMD)Id+7W8s&kc}!J=vLwBB7R|)(0sL0K$jw;0tMgm?u9H^>N)G3I=~JiA zkM^IOeTLe(;wq=Mjls?)Te`cqhpn%$-A|9b>v7;r**s0-#;${1>b_zKBiDe!@Bew*RzmjFiSl z#IdkXPu4@X^Fmx0+vgPlPg55#Q`5l4o(e(21eJFnJlI2;j3wi%!!`qIY zYS;6=y2-!J%}=Z|bh7&W6;#v4*wX%cm4)Bp;EVYwu44<#de4s)X4;Tsu$je{jnz8M zBXsmm(2B%ZXRyb$xZSZA4_?D*M7886=$qH%oPf63v2fD{o_@@Rrdlfbrsp$sM5{8U zn&-#)`52*LD)YW>_ibwrWv$}kZQYdg{nTatijU^gIq(ZK?C5~ECGUtO;`Kvkp}GQPYoi0T zscyaEtLJ9ZQXWkv8PA{yNyjlWWN-B??c7(p+z*4EIhU^Br&IlW8vsH z*oIws-M;w*kW?+x&71nI*VFQ*zWM3>J9oBT)6zWoSplQ;Se+Eu**g(qRgCt@q0lk& z!J%Eq_Ca)?{?|Dpca)q<_DRv5=#mRnimvG(IhK*+{ra+Oi0b(Of>rtO;V{aqvx$_3nM={I)e3V*xmVG6Psp12vmF07>#?gmBzw&p zTQg!li{Q^tF@ASf=WL!43S0vI<=Fvcl=d=z?{fqb{*npGGPrc1q_h-G_IbNu`o=m5 zcrKCOKKc!hs$goa8bOi=fep>#*#J5gKBt)UTc$~GqybS6Epf4u#j)%)*$*~2jDB=h z+0zQNb724$DVX#oLnsM4)&6>M&La+So?j*G@+bvV^aE_G8GtiyU(wE^uv?*|TbRY! z;(%rPbqcU+WmyRY9(VT#w)7ZoWaOlv&fgi)7-i#EuPau?4CyfRXNnB~wT{@*UU8n+ z@OTHDoOu+fN#gn5UcUpl$l1ZD59j2qrKaj2Gku`b;#sBVru zmdO(Q&cU6CxR};sNUk-3to~rN+GN+EyAFtzLMZ%_vyZd0E4FZOr?2kXSZ8B%0A-oy zl)WGlKh2PM>uKt{!#7&#wT#{_%C`Oo)_R@)PA`a%4c5)zgX|p0W1l&9r_JL2Oycd* z$tkvkr;gVpn0ymgFbmuKx$=6S(J?P1f`F;+vcla>;u&EXE03L^$FBv1^WnL`g$?hN zkx;#EiQe3+bOkL8pFtCfc+uSH5jl!Gu%3$9_G@3356(>;Bg0pzXxy_~IM<|exGo}O z#3{#sB4)a!BHeOIrXhrSR*-iBg%VBBMw6#IkmUn`O^%3y>RjTH^7nZ6rjuEDX{cr} z{oXZJP#kzNcNTSgcEBqJlV(^yQy$d_za`ZecDPGbd+lo)nqfJ%DR|U?>wk;ocXMa| zHGrpbFyuG+Fsdt6ER{~g-I&|EqO6fLgP{fDX({Z9#p0hBiz}KI_X0#{cV}+nLg+B< zk8#tdssqD`O4RhG-7-0)=>r>>q}UQ(yq}~-^*$`+xzDN(G7Qkw0vkkUwpB}PV@9X> z6|^sFY~;UNyN=m=C{S3y%IQaHT3a+_8RLAN)>V87=FXKksVb8`0OJ zu@k#Qefd>UnC}B^d@Nhfz59{9RqV?oWlK<<(kvnlv!kAo z%U9Gu0W!R=5wV1G(I0U3seX0q;~~kfi{$z*d5QX%}f-hR0%MLLb)&EwAk^wj>R$32CKWlZIi=3F(TW zB@7Xz(s^ERoj?7}UY@*vE0`i=U*G(`^_`>2$wyrm93T)Y&ePe+X3!q?&iIMjBuJe@ zg_1@5#y`TLmO*iw$4S?2_G?yu`rX%d`DlxA(XOC^Hc88Y0gMog&(nLWVMKI_P2X3c zapx%^k926i5f4K5rpNn0GJ(REhejXP#Ne;?>1!St#4SP2q4j&H<70D=fqP8G>Ovdy^4mm6OfV`f2e222WyTj*t(L;64feDl zQq8Xz-o?E#DC#=r#ZC7cv(KHA=vKnfRoo*a9U@Xq)>=K3-L(B_YiY;kU<Uwhlbf zfU`9TJoEc$!ONEUN+TYd_-FY{JELPn1Wk${{Il;@3+nIJGKD+h9>z*C2}fQ9em<7Q zQ@SZKrW}f_nI@d^uXJiZg+m^K#;j5?he}|kbcfeB3BZ`0()Y#Bj)i!hiMV6-CU9HhIBI2hscbFz|0_`4$Ld)T$ z2RRjA8DwQ;jGrP;$0U5h!9()H+F>J&G`y1Y3LdgaW#@PeZ-V;!v3uTRfy!LgL2t)U z3z@Fa_@OVMUW6hdRU(Uz($;Jm78l6vH>B#DBvj8{i^6^Q;&{ZVGYoA5eUbTN*DXjV z)*h(~(O4~QSR3jcj3kcK&}gN6Zu937jf|#V17U97;Tt&231oGr|&NWWtDCMP)2{{6M8TwJ`Ex=RW3XP#7k2U{&yB6$8Tk9r&5Iu#M z<>BaCJ*uL%^*F!N+0E>49Jz{%laXKNKW}qkZ3YCv-kZ4gk)`h{SdM=Awe30y`9q?QnZ9>-BqrAlYc&t=oKZWaG*Gk_R&j*BiJuEGA%?Ds)484uGHK9H z;yu@z>L!OqHKCJG!(ZPOE#@xKGg9k%v8F7$^CIpJnGpV8k?iYz(~DgA?*u?6Fg87H zpt3#IA}SkXaP>EDq6V^kjd5ypxX6jZkm|$t_K;I#t~$NWQD)<~kB;_5FmNw#5A~0ns@{R!ZiTWaj1O zdifMf=OxN}OA8m#^m4t7F89UkxcrOF4=GafB&%YDXaJn+kF0ESzy@6XCdTsjUoU#3 zL-MTE)FkNSmQe0!1qzac6INhgr zFT9#Q8bxqxN@AWxx5@9;K9g^I&U1(PoB505cveekpV0SQTearRBt< z?6rUoTLPOVb+i7qga0=;>x3t9}T1 z*{cqPWtV!x9EeT=Hzu-Tr`?a_J3@*~u0wDVpl7hg*_jGL z#VK&++55W*G2`QF4{H=B0ih)dU$0aKHFu;EnAgl_iYwW_3-Oea4Zxp3&qf{{FmF$Onl(HnM-cq`&VAs z_&slKJh?Sxe@*9=mG}K*UE1fxr~Gx^P<$0{`5`bWKP1?}0RzToK_$pa@*Fy)EBIxd zXjakrAyj#5HEm~bBn2>L{PsoV86@}JfFv&%QI-@)_T3IL7!$@^9>vm z{+`w1iGi!zdgpa`eS?u6QX{J}67cgDMbTO}&-&nSsaL#j^v-}rD8*3xG>RiMVd(B7 z*Pm983*zsTX4WqPaU1`yZl(A$8QW7`iT?WpgYT;|$Q{4N9ranijVaZ>oj)Z4J|zSm zk1d`p3P_}tosG_sG8WW!&0SX~+kKx@zeR=&k4k9UCD54rUq1v^yNTk)hA znbT%&n2M^7xU<$Boo6%LJ2hDy2dxO#e@#EkknmvcIrOLPxqTOVzgH|n>n~L9#($hz z_I}G=A0N^}_SEUy5Ii+e^9D6nC)q}bvOw1+H zAiIxgT4qIi`O1S6c;9^(!n}fU0shfV-Dl3xc1cemr{iDva6r0>6 z6&A_pZ^rqkC;j$YB4UWkTF;0{@LLEcQFZBQ{QDd6Q;HMV0iNml5g6z-7vx9Y08c|k zQcfk;+xo(d0~aA@T;3P4iwzDErf(|#fV;Ty-#RCg8M$VeyaQE-eIXU!pkdnCd?oef zWuDAgSKHZRY%GZ6to!x1gLdm-eK9MReS5|D$fa`DhjyBO1Ke=Ac0RV*`uAFN%tAIp zvo!@kE0Xja=Kq@lo1NNJWO1X{Qu{8X&t~O}#y>oWu8e!}>3b+?j0*v?MQWNsRP`6R zhw-&9rLkNO-I#|m6kx0IrUFS;UbW||tQi$aK3VAE8v+PmGJ7^Vs(+PnuJCk`TlLP=OGPzoX6XJXevWC*w zYSSF%K-bn}b1|iI(cV2J0lDwTF?1q^wS~+p&-^uYRld}T zVK<_%n??Sf*uZ?_kX$_2I2$3@Imo+c5y^1!t0^9=CRd@BV*T7Ux}@B-75`7A5BltO zqpiO%l8Yft5vKQ}HX|X?`lD@x$I0YHcX8&617kz4m%mOhTV0mYIHa7O0cnEX2Uz0V z8>Y38TpU?h#i+s_T7gaNMnHhLYQVs}5M|}s(n`FinxR|CrFiSjTu{HO>>qq>Auw7L zbNv(Jd6hL$H(}1=e^T^vVPM@Mqxo$cTYHQ(7-sEvixhpXfMq~B&#EQ)% z+EBTF$psRmX-eqhIaPuIiiXDJe&HK1;8*DB^`V9*o?3YOdJZhKXzHulib)&EecLv( z@Rkq&Dk^>7do`%*>*op2k63%Pi?#c_a&4%%ApP9w>~e>W@NwI*ci3xIaNG7CKs8N{ zQ4Z+NK_{(q-Co$2-tuy!>|s~$T%UNxZ^>5248!D7_VfkaQ{ketH;bp|FL%$pnZ>-Z zTDU~rJ066DNFRzmVypFu@%hx1GTJ5FY9gwh~Mq5%T16*>p9%m|ok|9G1+@jSUhS8lHj8kgk zINQh|4p+{Jvrw=A;Ws1HS3jsPGzN;@e@1f&(T|#-6@v! zgf$^GU;`HBwxVc`oM3=bg5r%oIqUEo<+OR7eZoKZMZtBaf%T6KNH#gt=!k2=i3|YV zQ9^^f1jU1ZLr5J#*~$1szxn7HCUXh<)^Xw4d%7SP6Wfcur!|_G3fjE%_=MpsR&rW3 z4AS+`Dvs&#eiPu!-`dEVQ4sBio=#(Y)BsD`w?F{{58Ci#6)nd18KkHkLC4anSr%7; zL1%Pkb*IPcmp0u>^PmE6zfC&FN9`&7S!sU06@t28T<~$r*e`YKHkobHq|eHAD<;!i zcac}@Fu-)EVP*{~^}(x@z$1tnfdQnti{_xg?P)Q6^;#rW8I}3(lrZeVx;qOZ)iSQ~ zFN%zEj#-RBg5PUdD{AV-TBa?d2D++H^d7ti{5+hFLQ#m4P&I;02QxCIxiER?8Q0FW zRZghMCG<#G>&QbSOo7dUwZZ;}Rh8o2BxA(5--=IH6UV0kN4mXJRJh?E{)w>s4f9o* zrB(A-H!p00D{l)YCzE{m`)w}YDs-xPSo_>MR(yS_eL(*pWz9+mu z){f!>dHlTVN2e(1!M}78*8addg?sMe+`4hTmSG9oVHe1b>4sSIqgmPIxk%x4*ynPo zOAfKYPj}yBwto^Qs;-Q32#Mc})l0C_@;U{yWbNWbUrbHL9Q=3YP{FI=>lY}k;(cT8zhixH)cDre+1fiEB=e<>R+6Xd!2g2J ze`hZHc$Q|)bou3n9|?xgrs~EC{dLuWux7LIp-fO}4^`>Idm!5-k3Yol5V9TQNP4T( zjbpKXPqys@e^cc+pO2fVxa0F$!j~;8ZRbQ z#Hm0utD?6;u~ic5W3K*9%C$ zas=QW6r6xgSfT?)1?LT(e}j+OB7C)1ogloal%F^!o>R8l1r zJX~Vt8+!m$s$Ea|OeHh=O_E*MyRD%Tf(Etpp^@1FDOFyN@zkQ6eL$7_;d_0ul~Kqi zbv5FC%RvKO?5fhv$6^Y_IzSqWib8R{Hmj{A379*5lO`LX4|l)CrF0A=2~f)bhrBBbTlK9`{~arcRfOl5PzXWj>Bs3)z56o09mPZ1qL>X zm1ww>r47{A-h*I&zi^;=XCNyAsVU{RHZoA_1&qx)?H-C$nsx^^_%tG0;;`Qf z*XliMS0PGQuBah96?mI5le_9CjA(daQOm2SlvjtIZ)Hbe*!W!k(A%L3ybE&^hIef; zABhsNm8{~PSgur(*-Xdt6KzQtfZ0~nKnTCpV5&_>dBA|)K9An}cmIS1j$aq2?GUtVM%e%# zk$Y1xZ}HBd+0Nu@rt}7==Qhja58(dB6_{*3b3UR@RD|)sH>weoOkvob$ydK8egyXM z71lReYnQ1<5~AO2e{P>8W>{8uHtXxzDB8)?>2PysmL#q9t6ksF!s1jCLQ4)aa?6|R@z2wG$Og%zMU{=W7M zMT#Elz=p8MBUk0`=p>s4nAM^K*V!rc-dltuonqHy+F4Vl62RCVIY%mNl0CnT zt@3_cY*1#tkC_dd7u}y}u_$zeXHj-p8|P~-yJTpek1y{BVmbF(mwlx}mUGv{xIp~6 z!rpZ-IAhtYB6aTTiqr{j>W1XHyH#!o@d~0z&kPWw<|= z+EukiJq0SucRd`;_55VjMNfTz#SDyy<(ZomZQHTNHyPxk`r{gc>7BLG zy-!1W>+B{R!%p%D%fA0+0rcuDe{fX!5b9Q>o_u2g0!u6{ESWr!W8#xs8P+cm^@`mj z(IESzxYjI&#$@|-M(=`Xs=3L9fwMcZd9qoh4rT(1+lcHk!}ZTWD!~F-XvEZT*NvS< zT&`5AwlI}4Bvm_-Eg8T8s=d6ppKd(atRKD}Jb^buh;!7WO&J7(uT|o|pBvWE&&E?4 z98-(AQx<13Z`BZ~GHncsNQ@;?T95Ks4}8|DSJ~@R2;GewfeLS z@!#J$qrd)w@_IM4^fA(JBW~tNXs8T3poNC&v6kapgBuq%@q7ak+Pd&f1Ds8hyH9t0 z<~>w9qjhsVMlayBUSTATD00Q=E1v#7I}y8SY<$pncO8SDF-_U9`LIz(sm%Fc7sat;lCQ%x`P%`AO4$x zQ|(=PS&Pw~UHN8mwHFi94USv3Xvw}txCW9+C(C>l?zWa_P~3`BEM zK8w{lFN$Oiw3h7g+Aw6l0FH1p3fZo%<@SU04tsn~`xPZb)y8wybu~wF*cRvoczC|I ze{??#b-HR%>>i~IDd1Gc&JHvUPYL_c-@z+iTF6#2%Ie{7>s-> zRA8uc@Eb~E1lJBeWb!^8ePZpFQ}BAI_Ja(1*{Uj=q~MSF_W1vgy}yi#>xtq8(Z&LS z03n3nfuKPG!Ce!i@!;;k-CaWn?(Wt|Z=zE{c72=$QY+uBeb-HHCsba4%2umcwG94N`+eV z?z4%Yh29hUw6ZPa#ZNHSi6Vv<@zgmV^@YhlY)-H!Uw+*cQQqBHMB}o>R|IU-)S}pX z9n=KV~hprb-S~|?!(C}kN?`p=%x{&nX{;JKV}J;2s-}gd(ZS%_%hLX=RL)n)rGEb>Xd3R@T9!8_AeFnESVK&Xyi1Tn} z&drq0fJ1bUare|JZ)&ejn}c0j7v}$r5kfq@NO90c=a$ET+jdC(bz+h)w{$jr6H&3% zt#*Hby~<5UMs81|Y)UDob;>ttp%+F|C}j0=7p(C-KC@Er1S4l%Uyi}Jf}GG zisfPA_w|Ubjv8l#9Eh+BSjP^*@SdiAv5uC3{cS2u=5;vKVY8-2?ZJxt^;%CnM^t+!=CuWk-cedtqW`qsgBs!7~B?{>}$%z|IsAL)U z1Tx8Uk}`;Mf};4-@RHUj@^L2{ET?zkCr2p-;4HAg(gZmVXDV8=PA@uQ^2}2Y_QH3) z@poe>(519o@_Zilc!rC}60a}s)Hk^b3x73DGqL{Keek>ry|?m?n9F$s`{=h*fMF`_ zs0tHOQ697TKHXdKg*y`N>kl#!yPDpbn;RaLP}O-L1R9jG zzrZS4@(gL}xH-G+%~}Z3@)kzeq+)&FJ=fevrPXX6;WY7XYyssY#A;-3KJc{4-xY`B zclB3fH&)G6#(t>9C~R7@L>dchHa*ov&OM!Q(@aRhnTLQ7EexHkwyIy+g|mb!s??5EaI&lWoO&jz}wIMpJ3IcljmpV#??ovv_`C@ z6)HN@<7+AF$^%+Dt?u-N`xWb{{izYn)@clNBo?&ZS_&k1I@*2x!A9; zv6H!vYoy4c2pfs$f4T3+4LRbV2H=!@D}q2|-buexAIH;LZ4+wAOlDum#AH3&3d8Pp zsCF(mJ>a9cYb+BXoVFSZk3V_FB$7PwimTYSqKT@{cpiVl$k_iR>*2QlN<>@r4Bc|B(#oHG@*SztifFabe2JMUUkOKe#>lAs z2az}<)K|&{MKb1d)4N4%P$NsIe;&4FtMUOl$!LFI#CGQveJhXuC&y~*v2=9HK53l} zb?-@7Fo}y6@^!F!HliP$1N@Rgv1jeirI{@9?uf0!qdA1T;QCZMi#eF4{``9N>klA?oOP>nd@s)gooLdf63Aa$K+Dc1F9{UB0lA#V> zl^n7$F&DIqGD!m)xkySCJ&R?|uw)jlVvZ)34%TyDw5->sH|eU5nuP7-;2vJk^=9D7 zcrH=LBp)i|zo>k0Dl!NbiC_ETR~ED)gf2x9D<_yGCpRh{rjN$Uv@H9B?S1Oaeb3q0 z!?{6G8N?oC2uM@pMge ztdz;|vQX~@C08_g^Gy-#8XB?KvR>BuJAQ``m(IHDz@ZmSv7j>W z$P6#s;(FcJ?)-J0b_bI!{VTB*IxGNP@ixmEQEspR_ETk0DP<)f$4ni@x|D&&yhk_dDxVcb$XEt_kgQM+ zDrLxX%h24op?$aL&Y=AB$03g=O#oSub!hC7yQeS1#lg~NikF27?zy2s_V2S*>6stw z`iB(Ws^_0?NqFEr@@+?c@Hm=->ar7$n0g1)W^S4FK6iC(=l~%SD9i9zkK%zqnl%=M zKE4N%8>m~{CX~_%GY@oR4v!!k1d7LQM|ixpecn}Y*3L6$uPz{qoi-hjpkm7F=W^4f zOezHTZk#i}Jgqk0qrDsAaVlB(`lqQ+zr60f$YWbj9jm3P5|r_NNXzX`vGx8oBSYaq zS93~Tn%GOj_p2Myba7PiI_Hpt^-gyAltg$euc!KWv+*xgx^7!V+>kASpWaoaI!n1W zZ5rEyh<_+1;QJvze(>p6@3D7WoTK8qu3wtC(B{q-)8Q>n_x&WDu@{5?S~(LYqWvL< zXmgAK)ubd!V5DrDg%8-UV5g-5-GQEE5!P;zPg^Up5@~Kr|07KEk1(C^=aKPzV09c* zvr)+VYE5Uio`XA1oFeY`Z~4l6l@&{kUoP#ErPsbNW#;i@x83sJow*b=FHyJV-tArY z-&iYJQZ#+nc*Ilys&f8=sz4x>SQ8Pshv7i$DPN769dq}k5qs;@Sb?~a33KH2sjior z<8L^gt8Wi#K3}6|TXdATZ_6x(9czklSXfT`JO7?YpF~g4{09GrsAh7i?@_MScG%pZJa!^zJ+!K1oYaDeR%?v!Pa3_mq@!9qb^7 z;P945OL-`cH#Z+62d;C5e_!$W33K=7w>^1fsjcM2`Bxpw!vCB(vuD@%>uJD&K)wQ> zf8|u41S%^VZMhqaXgaQ{4dr{l6U<@?a}Vi^{V50Q3?iCI<*a&T@B4O*>PDDy_y-Lj zR0E~F@-aIgP~^U=>Z`ji@t2hGdJ1Ya`!jd-Jw?JXF_X{CQwv`kYz#+x`dZbTb#WfL z-NHXx_(gO2ll=!NZR=iP6B1T5G7{uT5R{g^3#JYxWK?%pTc-4;tJAhBcfecr@JFUfl3SgzO>)tUUat?g z`U%taJ}+G~3lUi#Q~uk_HNX55w_FfxaJo=Ybv;!Tc-l9gui#%wS5_h9yJ1wH^&RwG z*dLiaNv^V1#cPSH7Y{r(&K-C91s-6c z-BgrxYSW)g?zmkmxVg6b5KoXW0p}L`8q4b?d>pnet`w)|d9F3RwKi=XDHiZoYc@|w z|2augLtyvm%suw?6bmxY4L_H}Y2bXygehrjr41}+z7UJR;iax~3TuK;U3Gj&=Jyme zvd|2tU|im=-JdDM)M^xh8bn#R{1tauU+kaq&>RY^6?Lv>>E^soLm~N|;AlcQoVdY%Rw4kHNxDKvyhA+Z?QzO= zmPQ!OR^Z$*aHaP0#Q*E`jKQPCu%1*I#xv0PT*Is?|YpDJ@-U z5q+2rv{F`zME%=QmyZSiNk|#Zs%)M5dSXf7stDqlBhavEwr5qQ(qpgUHvU(PSLlC3 z{NFo}96LkBzmI<|pUMAP;NSoHME?^0cN-h_PX~YR-xB_xX#L~*@6$|+e~$6@R&e&8 z*ZsZqsr=W2|K5WB*Ngv`s{faB{f&cvyM!G3{};Q{E7fiEzhqg|fP9G9z-ODMwnWBx z9B?2Tq<@{h4fTyC@WAH>^YlWr96U(3@LwO*#UFGOOeB2_POm=Lj*xn%gHhl>-{tP>s;=p92|kL2UsxMEUEf%-EcyUjR^z`Y#BmlKnvT*lZM7x(r}I1KuGyeDwuk z1C=-ymB_FQg%p5I0E_^d18_hRm?Wq{c7&3?_(p6 z|3tzXP@c@>^pJbbE{=?DL1m$9R2I5Cz>ER#Mkh(dE5}PmUuqXQOu%D~qE~~8@&&-w zoBsbi6xZZFQ^;#sFgga6(9rM6>?W>?;M)o>fO#P4**w*{D2pB(T?#J4Th*Z?xxH@7h!DFCX|H+=0Y{;&SYfe{6&E;M8u_`A^(a8ahfafmNX|h=hFc*L1D!K^ zO`M9D>@5mzZbCn=KOVl0w1G*S>yO0jYM?9;h%N772B9zPnfa;|Gtn;?RBFleaZ=zk3j)&YPQk{y= zDmcTK*?iDFENKrH;K=543O=U|YL@~IhFyf(?!YrrLwn?U$Inwjm%u~*e~w@S7yJR( zB7kf+ri2~}R$-OXTW*u+O7tTYrqX?%<0c&Ry6Hz5ph%zoaZT#mG{17+%DtD&_Wc8% z(~iG5ldg=Yd~`npKOT=N2E#u0cx%BUgM0%1$=T*gyQrM?-XZcSPLD)aEC!Lda@RVa zitBEF^GxXUcc179=dR)fROy9}R~%?PwU<%O9U?6<_Kh2srI~+<(0) zHE=cNA>cwmB^>7~MyNa-LJT_bIxr?lv%Y<-#LxUlr{($p5?!>3H&J=&CpWa14I123fA%6P6Fi zQ%3N}HJLEK3Q^_gL52+TZe69O{nhdgyMuRtdKsSl*u1qb!5OQqio>8t@fv7|Hi$zf zRW%=nL!j%fU>0TRKxStgiA?u+!3hEl1pM=;YK|~CbdJrfvgyntuI`>nc8PFj!6>I_+6c%EikbIbdMphuvbRXN;hTr9 z8mwJU8++v?oVT*Cff#}6HgABn{jll1(Z+*1rKmm$u2Q;g$6wsxywfqe+;(F^fJrFw z=9oB3Q%ceSPbjjxw!c-=@p;3mvZXj> zj5PwZeCRsS7!QV(R+!mw`QIlU3US*+Vvur<6)OQ&c}rP7MhH{_+&3@#(gzA-_f$%Z z8;s8%yanrUK^(vuF^xq7csk9-!zBYUK(*!Iarg7o&?8D$J0fy?l~MykUNL6TaB{WX z9`#;Zc{ug%!9j20?%vXVbqyO55GW}4FGd`IDyq#c;OMfui>Pi$FvS3TVi4!LZ4+Fz zL@~8MV#Wzx4>d%TAq2%d=lKCN1A+jxMpOPwUElVIWl{dl48Hoc@Ik zPFePGgE#Ivvj~-i-N)+mxvfSw8_5%J>Pv|@vrYiFny!$rs5nDuD{XaNmBF%~ai$fK zYtLB$7YReqtjuZw&T;Wl> zb#}#Zj>nsog%d(%{2C1aAD|xvfBRV*d~CyabEA|1MHqs)L`Vn6?c8#f5f2btY z7Y;trx3^bNU`(EWhkx?|W-eNO(5_(_UQFtDgxVy!UW*M|poK2}uR)QLV1y?! zPQ0yoez2O4{y-o#`cF339!3rg4<3Opk&PLy^xhuzwFE#Tl?JJhfba8F!v@AF7w|xa zHQhW8P~CGWJK&iOmn~5#WrHDSv_*Ru{46RmOBd@}8^a@WM0Rm?64e;vn)ZtM%Yg0k zp7XYeL?Ar2s*@jJyP%Ah{?@{{s=C8-p^O5sqyH#xj4gMW92nkD{^)gi?+=d zAVFZlX)~I%t4sIhaTP}seBANmhrOO3O22s*oGK1c+B?l5Te~}Z$rArzHlTtk4dop5 zOWqC6fVHWiWVZ6D<9b9;q{tx%H$dLkZ&vtE#0J?=+5}@>{tA-}IMK&Ae;0AZUpp{; zF_pB&1d!0Jk41epK#1iV=g=Ord3P$DL$mt*m z(z}ZL9poNmVo|KIEe-OaoUA{}p=*8$D$gy_c5%t$(EB=Yn=p(A@|guJRjH=hlUeSe zVB15g0I7B%me&*V4><#51?0u~iWF>InpZ?*h=9}u=^hA0@Tx+3&iVfDa+psZFtO>^ zzt8kFtn!5ihsVXmu?6%OC?X+Z0dW8bdyuyuQ%Epu?D}V#P?3@PadjrqG7dP6P#YnWibExL97z-*1zfJw-kd>i8(E zO+|kIg58CJy@6PztEW=hgk=manaz4`JV*VnW9aMk)+Ydf`cvpB0maK#sc`gE%i0*` zSvdM@e)gYWrW&_;LnxQ1cI0yi1Vj*nNFk|Dnymmwdcz)Pcrj6LZh~zr`kv8iS@gH_ zes2UU7 zFC&+f-{3Nc^Zo8or)IR#wI2=eBl@sC@`&&L6nZ3py%#5e7#4bQ{(ejfb(-4G-#BJY z4r!Kc0PY|TRBDq*J}_)mc+M^-R4!UX}3Nz;kmo6Bv4++_Tn)(JXW=P zS?09j z=GC=>`yz#e$iZk&3XcDy5ujo`aytTj(Q3>+y=0AKJ)X4esa9~cp$HH_5xMS2E%Z==hsgk@2L^r2?b z4|O`@fz8pq{sIrEu3C3{a(A_d!>q#sfGGfcRJ}now-5rgtJ6(OBVlN&R8B?hax-@g z5b*bSKgtXgT_(WEvuTJyJ&J7N0Z4XP2sw&?p1KV?P`i>fmr2Lngp}KL1=|G$(>MDZ z6}*8aKK)@#qFs1bEuZY%)O*(*xWADmIjpu3&`sO^;-n(vkCb2Wm)ar)KE%q98X_Q9 zKhCXy(xy-5;zP-#0YgwrQQ2RPygVmS zG)x&AJ0>|UfAIMmWQiA5RDL1k|7z~>%I1(jsE zHk{RCjgKN|#(rOkq@@);_Kbl#M5b%t4!}-mNjW6~(TF~sJ+cOrknm+Vh8_zQ@n1Th zK8MB~t1}q(x6-yY`(>`P5_8LIUE`vR;$sXC30jK^-ILNDW~ZO8&@jD^ ztgC8Cu4BBtwGDKx#=M8DIu1PdPwcd6*Jo57?hn>)#-nqG?;8c;H<2X5J@;C@z`cg@ z(WlF;cd35uy1f-;-dC+}nb;`7*8?QCQNk-Wy%pBC9p2;XonI)nfgFc{MFqv0hcm#o zPra~+2yit2nL8%Ui$Yqi^TCIEOoEVZN^r(4M{8M;N%i_nZOgq74+wX6(YX;G z$KyrTCU3dUo2~C+u5Yd>z$Evb`4b}(igv$mmb^ZC8oN`1Np3H#p{7dqy%i)LoAccB z_M*|Jz7d|9P<3_5@Vmp&hr;ynd`j?z_j>Kb*p#x}@9u|Ntu%f|iRjaNOmD@KJt!{k zIpfkpdPAd(M6}n5KZ&w?cXG6WfamXm?QKaBxF1 zl6*!e5q@{uEie&eAVvv3a9z4nuhlc?tyNeZ(b8Rtd-Oz5V`NgC7j*GyWYF!xeM!ac zcV|V;^;LxTTQFeJoS!ExHf*QhK#oRdfALX-xtm%F_i*HyiBGFmQ5yrU`D zSlPBaGA&pXvRXYm@!;eeX*D93YNjA3YPGf$c7X9mKj)xlo@#v!LPoBq1w_d#! zM@LL|<0`M?DMZMWt|t!os+TKzgPwY>k=&bjZU8T*%wtF8pO-pERwNejE_0W@i?dI51XK+v&^@;It2k-5V z*0hu5#|UjxpJ=_GA|(T@t(8sR>^noLdemafs5fs!yDpQ{&wpugtyReKbL4teM3A61IB;#wLCvkL`FcMyw(8?58?Hdw6?@$zvv7sp)haL=Nm zTp>R#{0fR?l$$ROlg5cAR=60oPnZV(4klo$ouXOBG~F_6?HYtn#|}2#n^RX3m)95X z<_U~TGDI7y^`5zjs(j2$-)*ab05)Wc z!k`xlp^DkTCz=kSUgc)4_egQ3{8p-#C-9RgJISv2Ub6eYC)5ANxS$W>gCYEvgKc9maw^2+pFX~?7 zryAU3$2Axzgk{_6$npwMU_}Gi0~gr5psJWxL~01&Xa8(v2@)cvv0uq@tH2doxNb2Cr%4W@)>(ETz-MKhZP z@3SL*s+Tnj;E(ju@s$JHwi#R}VBJVGRym~9caHI|3x2HiK|RVNXWBb-Zs+qB-vGQV zlT}34mqm>U{d`d}H0G2{F~jiS>)}dLFjt8h3PTwk7m*WNJCs z0x)Qs{_4r=S0X#4c{z&aNO@K~0hX_r`+s40B>T~#5N$oeuOV3@jI=_l$YcYaSuSUz zB#TBQF^LDp!K`CAn~FnP#o8k6unN?G59z$-tbA;FQCUJ~=V3HVyJAMNqg_wfCPkE# zR(h*isHnSGN8DvRkH*gG7UklSlXn#f(V=8p5?w0#cJk!@2s?Wj6Q|kxGr2=V8FD|) zMU{%xOJJVXJ6krcIG7*U(9Ntui>O}6x5eFV=R&&HxSgHk{MV``UthemG*dM9jQjpZ z_82=E4}UBvT`z3-!p}+^CXH@ZR3dek*7KH$D=W%3?~)%5H)}oj^&&^H`~1!%L8ysr zNKVGR$7QVhZrn}J@;#7Y+|zVWsQU)xbtZjP0HTBzIPNY+ zT~PUI#ec!z>z{?kHdm&up0g(W$*$tD6Wh4N96A-^EX8FXQuy*)_zGpq`LW`;Q<2)P zi_hycatb945K+hC*Aw&B4n@|LTS4swQ&u`<;bvvJb==B1kPRg>9#2hV;Fnu6kt)UN zP$>IUA(;ZgI39ktl4G$b`XF?I-$mWJ$yNF2$Mv`U2Ih`@hf|9%C-%UJhAa_d9lny$ z6SY=s`EdyPTvHL5Qo}fb^iA}xQf~=V$zG%CtBm8$U`)UbZN6~HJcpTq*0qHGnmMo) zwWd_2WblJqqxre$wv|#&jg`5=hik&m5KsJW1xINZfpUrbjZGOwv#V%ME~ZVAWGEG@ zNv`trC#55iD;c@krMWDD`A>xf6!GAHF~eySI;~uB&SZ0=$&P1k znQC(!+}Z1;lh@R-tJln@gzM!~2%wixo}T&4XBr)o+RhWl5$VJgc`z zbfu-duS=B|rz5>&Q`v(xOcfM9P8XLQvrEwKsgiLqbMsSV4n^~a@tneGt%8%eOcSW(cN*! zJw^Olf)h)tsz&C*a%-}q%IZrF+x*-qF2}T)v|M!P3k79VW!eell6mKe-FuG4vw-HD zofQILzh5aQuvB9b+<}sG6Rz-*`K?)1W|Q1^kJrEisufWK_!G6v7Vi5B(-lSG{ zT*zN4oD_$)$D8{Ng6@w1!fHqJDl>n1{W=w~h;*fgk44q41r0L09JSEGN|}^eYSycr zq$ce1H!v&d0E~gl%y1H(oR+9Bkmkr8V4LpR9D!18+4NLUtwTA7CwH-aT#Z$+LV!7| zSB-|XGlm)P%ZF}->I$V4c6M6zX~;X`9Jf4secSV4+x0#bZ{ynQohc~ISV0&R8TPO) zJbh5)w)n(SOXiQgY81XL5byb>pr$0?Iq`GYKx*^l> z#SV{?rr5BI$()3hNEkP}lgZkgnl>}u_{JV|@_9T&Y-ndMr+J4&_AX6vg5B({i=C}A z8D?)UTt>9B*{7{JCCv6_vOapUkoa?de0b7BTcZqYAg-RJuWq_?hTv;Se)OkC!p6fMEd^1=RkhFK# zC-Ir=5$C&Tt(^JI{>r0WiLc$np!-nF?S1I(*`R^3BXgB{nK0(hMaT_-rm2IXj(d%Y z054ZwU9O3x;>FSe1eu4{afwG6YP??edb`%`Xg25i_pal0)dh!XV9G>{tn*Har#xAb zRK_i%GYM{w<4cL~?Wj#;ha2~u$%YD%3@&y^D_4D+;gsuv{YDu>!HuY4pQA?vt@UI=xdRGLtMjzz`dO&#Uj6#`_`bdFjSxRWv7ek3r%(fTbV zZ>QQV`^;3m6c{ikvDB7NgwNFHHQ)4_oUSu9PsU&ni$`aSEcaq_yRp;sDs=30{ch=@mz`N?tDlh!0@!ICFc6Oc_H?3bZlbc zh^+T)ULdd&_W6{j%5-5~=Z?m1ZgsazG!|pM(|Nq-D}rujR^GoshhT; z0^#Tv*x)pxGhp#UqLvyjS$;TCt=cnH;Trwz&q-)t1QjJm?v0hzRQhV)i>kNA8I)jj zN4Lx$aqH#>AzE&^bV(R;YG)2<<2w8-nZA)6CrD}K`>hbbCte=#<~-ab`6_M+Mn{A9 z1V&02e-o+*mpW-q<~Dv{Q2`9kU=0MKEhA-q@dP)edpOw?PkIjihX#`S)g^`v$m1dt zZb`s^C(FA5=GyTbq?27KXqCqVCy3#NOq}v$-q1kkMaH;pVc!F`|4xWxbiS$q|+wzLuyV4-@d25z?Nx6=?vuKZArl4^^>CA)mp&3L)}kVW3fl3ba7vPco_)y)!iCimJQfSlJ*t>4{hU zq_#%l?#Pl&hQ;d6to6~+*T1s#&SF*9*HirG5@HoU<)zFe*}{Wt^0Fr3Ux^e#^MmQ| z4NJc#AEmzNf3#JiPU)P`zSq&(kA5TdESg0lUnjISR8-|6W_qwF_K`d_jDjYsA}Ci8 zTai>g3l-g56HbJ@kVQNwC}=G2o?6TSGNJYc+{F>CiS+%A5+Wa0DMk0EOtL#*yN|Oyi{y81&Pv8cfry zlC3KWY51<}YVY@T@7-f_q|sLd-CzwhAF9Nn|;8FznAns)fEu5t5F<$R&{Y00_eA>+MAV2ZEMM|^sJ_$O)MSlQ*D z=ESXPxOMAA~MClm5$@^rNyl#j2%iX?S zGj#(4zinYVidUhCB5&+on*sQ*d!n5017K^enb&~GloH)y0K?{{+zV#s+<%KojD#H;r z#ZND|{OVcUBx$RiZMhegC)aWyTqwN=JQgzHlx#0h9Bfy46Q%W@^yuQ|Gk&j3qS_b= z{>uHX7C3_W*cHehTkl4;_0I4)92WWAGS`6ovws=649T7_=Dn}mnE_!X+>7O5euSvU zj`Bd+e1-*XlYjE-Jb&M2_&oRoFVWq5^yy_s92jpU_GwjOLb{ZlKK({vf&Z*)xVj2i z?Lbu|>jBz;RpDlpo;@ZR6MnNVW2=CNACh33Y&r6`Z=Hr;p49ZbRd}0~$s?$n7*WHs zOdabt8i6%=V~`Xy8%|^tF-2m(#iO|DDb>!6VmUS6geAl%g$Wx-rOBYpJvOxc zo?~gC?x&E+xyAkFhnz*4PXo`Ynj{hgZmoT_n)go7Pwt=J6_HdsBYq{J<3^}PU||yf z1}7@TTgUB56wzg1r9BwBHh-?l?m?5}Z=Jr`X+zSEbIR4iXploEe)7KCdLI=Y0ULAG zfcyi_tL)XQbBx>qo~WNqCt=*Z>qnB>Y_5h; zWKxuP|Iw5l!bQRjSKq-CPiwI+Q|}@|Lz_IdVu1?9w+;5h`hS%D8)J28zt+$vy zLIOxhJRFiYWicCsq?mYJtf_P|EcHLBKid$%ECGWwwZrrJ#gyvUz)!X|PHjZAN`q0d z-5+{6#?WWWpj~*cy{Vcb__S^hDu-3oVuQ!oLk2?_j+gjf?`L8koczjjaQiBYio#-* zeA6|#Pntg*099rh`4O@v848?A9JMVQgv_i*&JgzgZM%=2M6GD36VYQn87zFIrLm_U zv=O$nWU`hBJ2nVRW|5-6uYOaZWaXiYs#-6+oV+n|cDDB6cQJkCZ8(AViWYDrN`Uv8nkqlWt^`W(lq6!H12`v4q#`-rn}WV`}(;nUio`kpZQ zncksFBdbQ^SN4`wSLdrvEhn2ky-rZgfo;<6n?5Eg#M z%s$#Xd%gYhO5orE*M5Pa79ask54tsN@J=r}h2~h>a?z8HW_GN3odxa{&&RAGA0aVx zuIFhzEcGw^L?Aw8F+-$2LYkpW1ENu#9|OOyEox~woP+rIo3ygp+@z$WE=iopq&pdy zkBk4?3($#|nB%s@My(qLcQ}5!Jp!DekT|mizR4?p#NvLhk^ z=s8>zr*%@tbPTffXvg-{Pxos^ zzE7N01Y&#hOWN9VbW)U?&OS3bKYb@KI*fB#KRTaM@!Xh-&7u{^AV$P}e>Hc@3imM? zEK6kkc!t!vy-*Oc-H)#~zRau|W_4){Wn6TR>2t_b#ALUG+%GT0T%2&DXh!ya3A?|w zF$7nB#Ux64k!Xs3=dotl>{7TYWN!ZU8ICC|`Xwa&v!We$?fSdbsoQ5pVsKGdS^DsN ze2Cu%<=K9)P*a{uxU*s`YI6QstzsZGdZo6_q&LL}vW8N}TIk7;(!9Bi(vL3g6am3u z;$B1c-MCE-o{(i%sCS4=4Nwd}8((^jIoRCJYi_q%-rkg$)H@)<8dya0ZNbLv(*8>A zX9EhJt;MxGvpurbZkRC-C)#uCl^Vup_T-(ab;h6IhrXD5<{)0$8<TNU5A7q9nbHdE(-W z;stJsSwxQv*hvuXw@@QBBdNPBA74Q=K?3BP?KvlSi49PeZ{Zs(15=XQr8;w4fW*bWI2QtvV@Bdp3>QUvlC z&$}+9TYY=aVw@g!+1_gSgM!6d=B;n$N!3a9Dbl8gWp%YPLKMa9=6i#-3i6;71M0yS zrJsb7hiXP<5u$?FD-{BjW4~1n>8Kaut7eN7HJuW!x@>(CN3q!*FI z2JbCdDX?BFaEDN?9K&w+US>R_Qolv=ve6)Ts5?hnAa)AH0fHvs ztl=%2JU_LYn_H>taodI%Nh72i_c3bLYisTrFSTr5pnRtIrl}RhqFP5E_&ciRC~dPx zEW@q>8D2WW?l?7o5t5kHJR)SFfc9>WAD)Wkh~-66nyz3(280`T{~pcdCYe($L2yW# z+nkvvyIQ!Iam=z0OD6!~WS}NCy(Z-;? zc=^y9V=!+98*J^&pKD53zA~=v?Ut3Z{qO4hrCePSV_6Os<57BjedCoT%J}$Km}!eq zot+xs%48Fsc|R_;pgJMr-z|qU)CBK1H#;L)z2PK{VPg|hU=TJ_JYsaTK9iW>CKqmg za!0J`^LioH>H67E8EtF$RH?POm02q<8`a&GesAkfXAIf)&nd4li)xUe?k`{*AtB6^hQ^ciZbVb}) zkD?Y+`8GC;sc#l*?-^utzEB25(cgs7d&N!#WMBj@@eODAE6jFV@!txBH5p{|YaK)$tfD9lsg-$BN6i!Od-BS?;ChR` zEFW@mHf!r~N5^3cg{F1j!e2^%8jud#oSJ=Nbn79vzu_IxkQxA_3tBMw?-*zRq_ByI zhHL6GlSTK(fbUo*Ck`tv&IeT9s3pS!>*rmIy9g8ec*s= zm3X+Mu9L-qIwGG?)4NSBrCms2mGv&^J4aY5>!5+Q-Lt1OG!&pyhjG{T!BK2u(<6~p z9+nuy#(=~mcIJ|I4h?0Nt8kaL)9IgUCix3!+dnV9<`ARx9OzH=w-kl1srE8wK=jb$ z+=bjLV(+yJ-M|_yFI71>J`d@ORtKz4{M@efmEnh$tQm&Hr6|CWeG5fo*dtjNwnUFh z=Q5lzW+rC}s`lDVa&~sT{5@VZ;W-zM8AYh(Q_IiUov=Ber{=($(h@rm=+1~d<0&nD zdniqUxnQ=Iergi`4v2C~rHeu`jmfiTdgRt@(lT-5<6?xD=^O!rk};}ARq}?7P2oOe zi~T%e!xekqHtk>tKAC}9ff}mEzbH1kK337w5i|+?+?ltgy_s>1vJ9N7`-MTr5;$up z>q0J+3!U@zQFlR#ys|=_a*q_ zM+&ScETH-ed@S%sL|}M*c1fO~1#Nw3y6m4W1-ly$N;FV)$MrrB;$lxWsd}m)8#xrt zz)xEaof5Ce^93 zY>1;=dpbB=qJ&=eD^qOLsjh~i_`#77|E%~ueh@oa(b<*w{_J#lcc*jSk=TnNgC&2% zI(3JtN7u+d#V9$+G`wvSZDeKvy!O&)qm#PRW<2!m!0CurMF=)7JUKOL61r6~e!wir z@+s0o^7g-6CE8hb!`hP0;K`$^3)km4p9wE-LYnHLj ze~*(G{*Nf|`0%k{Lpl+Xlxte+9E(zb*&rDiGtKGmzwijS84vh-eD@!*{{Aui{(nW} zagw9R@#lyoL;0;)mH!$+&?sL6-upk6o-Z^9a!$^C z6L^ktqdi%u5VJt=Kd@1s{y#D9!Eoun5`zI!=i7^!c>%nL@&AJq@Bgny>e^{mp zNdG&L0qzVN{^fxG&#=H%3OG?7Fzx;7)IZ*Oa!0Dl{;ME``!^%?KlMFcqMj=JO(g$c zo&ST#|4H`$8vXxuKl%S55Bq<>v?0kmPXK%N#NC|Uy7K>Tq`h@ioX^rON+3uG5`udO z!7YK{7J>y2?ry=|9YTUja1R6t?(XjHHpsvLK?VjHV1T(pe&5-9pYMEkt#jAyKi+v4 z!|G|NuC98jo^G4=Ks>_!qdwBH?02Rm8Sh^kzUs2_pv|68WPSH;tiHe`X2$eC)r4!l z;kEg{)x_aMuIYTHb1TO^j3M(igN?|tJB*;g+LL%?m8o1HqOtZIaSeHqqH=1&Xw>yJ zlWkhq(52*muDmbBs0ewpDjV1(i*ubSs=0b|86B-Ul^1`597H37j`RRn{OhCt6?6%+ zTV;e3#q#L8Kd$`dim!44`>OtTBsuy`Z^O$;(>PxI%+E9VG$TgsV7ccuZ-5tHT=;)z zbI#}+ln1;Gj&gyK(5ovM>+vCGrR<;cT+X_8L0xa^rT+P?zt0MyzuHIMlxrI(?c3?_ z3}u4={end?o1|JmJf~0j_V1~(|D|UZsp+VO>S}JL2mjFqNtrji#;NkO_Q2z#d_=QG ze&GHgC+Bwpjs0Hra{>q^R$RGC}e9Q3gT%+mnL^X}5CjHW)tdRtUA;bOD{Nzwy z_buez!Pw}Qb)gLGy|yTujmL{>;?Kew6B_4+x0{Q{qGEe6(7rg>^UQyt|{d`ddhA;vKmDOLX_0I`sU4a(M3K!IBCdJ6*b=K-{}w zQOiC+>kx8LNA2h?(jIRg-m}Z>b}1`{f6!}=g<);*N|?N;~Wy4sgazPIb!XG zS3$P*pH0(s?)W7eku!a<0%C6uM=09DIHt7VJZvGy6nx#LVENL;(+@V3uznl182asD&+~+_;m}mHA~6Q)&9^E8N0YBIf59%!{s`Rl8~gtIo`_- z`%Olz!I0)(V>q2lpANtt)%UpEb$Z@TQ847qg1Ukz$N(TP;75W2uI}RFhyahE~R?&Ie=ZdY;D`UiUr4UsdXukYR*`^$tP?Dc+2h>13$H zm3gjtx@l;RJY@nl8s%U){kl43Mi+4D%~RO?b6bawYVG%cf91^tHSRs{wm7t|gNiMN zux!#AacQ*LrpoI_rzq;5t(7-0YEBKYf&XH+a@-yxeaUuamS1Qvdv%TcM7A_$o7&v# zd(-|GOc#f4iUR4E2&rpUOtmfZ_I$3JtV6RTUXJt(>rYM_hj3IHCDA6- zlrO241*SmSJ3-One%+fq?hiKO`Sl+wvc5q*&Ta?o?hV3w!Ww_< z4((mhxnuH($p1J)R=OXYI-I!gW_R}&`uK*Qq)UI+XFS!Gz|KD`dKoSIR>hs5Q_0Fu z5|x(7$DQ2;dfqBv|Z-x`&8fbr>9ooEdv(Y-V-;Ne-uGsv*`z>EL(sQ#H*yfv$Sg6ju zWZpT*62>yJ=En9^je2&syWIWVRmVmn4}7u4sct2|Et@O5qd3bm6RSIHPT*V=F!DL&>cFQ4H=DA z4otut4b|-?MqNYe`*}5WQP2n~P_Yl!Fw@Eh<@x7r@8lnf_*Vki;ny$mu~1w*e%nG{ z6f(Yj;yUG=HKE2szDaKH+&0`b_SUa8Sso4a34VIqLWYHMr|FM8*$hmiBD;otBF)45p#_6TLs^ikL>V^mcH25PPjMzxd7yZSL3+D{!4FO-;1JvK|2O<}|I z*IPsj6T^Gi<_@a2gN4Spiwri$_d->3m;eF5^$m}^1~!&|>tr*(dwx`V!J#K))y9#P z+2mY*(Cg1J-iq*y@RK+*1{P8h@x}3PL11QIB~u>KMFY`#LiIPh0^0ZUZWKZtks~a> z>5XG}PTiubw|@Ca_hy;qpPA?lK3fk+NP5b%=7(7YKlWgR4M061F=m*HWt)w=KHqRx zl+4yh4r-|;&!k#;6s%Y?$$3FM`q5`fkBWl#euiT zfx0x)*s!^j@144X`0g-%owrmDrh3&r$i~?p0XIEbWQ8B}*bg-=Oa_!LGb*uV1e(f1 zOc5FK?h`A4zuF^oI-gvi>S5K`>yHj3HSdfm445E^aj;qbK?JdJk64Srnh$FuC7oVh zqpijXI`1%((j*Z#rhYe7q_F66sfdB!-Lv~Ezf51Y*S&cms%K?s@$v&_qv$CL1lfNL z438)RD1zdPB8JX1tAT^9jO_&QaPzH^*F5Xh7}61hE{!SQ5_a3_ZE$y8z`*Ywt9(#E zr6&lNz01gWnpUWTHF-tUes8&34Ai$P^Z>Qd+ArVS-HRx`2wB$do81`d_cbF{qG~wr zL$Mi3L*1=>2()~dTMfI$(pZNPF0c>N+gSXTXf9foyxa=8yBg<=iH7WdnON^q>Hzie z`NUbmFF&LrWs6N13ir_7R5t8`nLI3KxcsGInwUl zo%p1aFYd;MvPhLg`>@n>@^>x4(zN!~M&&gmi9N^=Zsd>^+un`gg7PUZwA#Ica1yra z=_x(W{oKDrZj_P3StZqI@ZI9ieDCcb5f_!$XY@b&qiveP&-A&Ee7#s;DE8KqvBp=v zzEtGkD$@bE8?Zn3n}eUCO5;=w9iXDO0Lhyz5Di$DGr9H*KuBP=TGfB)A5b1m!G9;x zdB5HbphL#OJc0XAH7!SsKQ*faTEg4V(nmf04@F{7#aEY{!Dh4TUOVRb-%eyYi9PNa zj^OuH5iIE+H#Bd_vH@+G`CRDN)04P3L&k48mb;XA1gfuNYtNSh$Wu?JJq+KcoE=5N zeq$qtFPF7L*)?|cIzVSU%DSrECmY8FJM#NJ8K?Ea$Q#3=Ra{>zM`w0@4*}wL>lL@v zhOttdsD|3o(>1m=DrKn(A1ukS8DeYT?!$2K!IpZW`k-`Dk85(=~R5oWoe%--y)GSlrdk zY1Y6lc^NB0Ls@tso0`s!WA9(>7v#1?Ee5E|AKZv3kOP}i)vjMCZDfVBp<;llZgR4> zgMLPC=d||#T!7&32$kt8^4DwKK{JVo$a@PVl4X7nGJynjdN6%Wk~^=k?hlGcV2~nk#md*`@zwP?#)H|v<6*-mIAGYXQ64oeN#>npR$^8X-EZ1yG%>HS5TuC z_~b^uRO8~cDd>KrUY%c*za865u^*`00L<6?m629t-ETnZ?ri!?L6c%0p$*p3uY801R&1l8bs*q>kW~@LreL zI7(LjJO%BRrF#TY)`zSnbw}uORnu{+=&X~cW+e>*0|G=tYnyxlKa*T7*+-u*oaN6> z$W30L|KBh7M?<;>!WstK6ywL)7dfy4U49g(tAet-S?e-L! z>(_>N!bfW32|07)+rE2GQEuiSjxRzRRMvm9vtIo~T8C9hgcuXzvu61_%hV`?lo<0Q z$G&%CWg$bzB(DCJCVOr3&G3fnO?GCIn3z9R#sd%eV5Q-9n#cOoKIo$!CqJ*CHigFv zXo1a)(b={hVhMGXuVF4xBfA7Ss5uMG`|b5zy(V=Wd853H~u?2e%b zurH-KIC+&7TG2!QEVH@>87VFCx6b}#UGZT0<;Ip8;CdwYW*)pnZ0*N(+M zu{bL0b5G9PA<2B&?eFjhqwMb19oS>*uaYvnKpm)B>^v&|*RQb4{m0IR&G@s*9!gPn z^4ofVg3KiRp#c=Z?V~to=o-dVd<$ng8x`Gndj+}MFC6B$#XmAfy0~cF*MA?Dfe|9~ zwb*C@Wm&G1_m)8RklROfexK63Dz>qLSG2L{ys%S>PoVDBay4p^A^U*W+RgkstSymj z0qgR|3;r_ifh5F!<@SH{hWm=N-gz`mJFbK>?BlTYbH@8W`mcMz|AlI3jNiS)BMs$e zj<^fOK`iAcQNB9@6a>~qM@UEj0vROjgxn5DDQ1!u4mgVP78JzCr+fGB;o~(=A1rH{ zL6*5@s*pNvf%q&+*&W}$gD3iCvKlR`z$MfV6#D8%qH_{kBWjo(iQ|X$+$hLi z7SdEVwOyKq6A!An=R|kA-k6p_un^7b2aa3R&IqXT={Oi7A;z8&;mma3FM$%>Zax9* z7&^XE@_ZOxWF!@;z1I0umym?5_g2ij6_`7yid$5naNY^N#KQsK4 zY~BtxJ|!#aMxInRz`*_H_EUTGxTNBbJ9dEQ1FHMg^DmtbMQ(RHf;K}eI+G>6t4kZ+ znc@uX1nl*-Z&!^144s3RqWhOMd>LX@1wEdm#k~LhyK_!M+MS-LO-+Mx5dF=1%eQ(f zv`oNYf+(POS5-&*vQgA%RE0q@l=NsrT{OtX$2KPiye4L_o)H4HdCqvdlGO%X>)4XJ zht{lD2cZ*bZ;grhUmR8V4}b7sJkj4ay&T}Cxbq}V@_!}rJ=zaA+Cc1i^J#GR_&GI* z0V?=Clh*3yHJ=6|;rO3(0nn%nlCdmtAxAE)j1I>>mK^=1yyr)YL{&~eyF?Mwd#G8(^reS(u>;{ZXU8W*1}WY%seclZ&%`-PHi zmH%tY(13Z$nl>gvFas@CqH2$ zL}#RW-@CNv7}!qj(_NJSCBCA8wTwcsR*FI(B`u#{xo9w^3L01xAtY<+v((w(y=85q z@-5hhkveyzYYFw^lcFY`5&uQe1EesQ8tY=hJGY~I{hKaMP&d8oRiZNa*NZz}XDq4B zBFMe7b%>F!$_GGT+5=kTIZ^!AoIkiDK9-q#HOz~cV#Kfw3L#)a^vuThn4~&BhpFm; z+*W9;@zm!UALk!9+nkImuEaPfzL$iF{_dfJ&v~k$DV0^VdCzi;`<+(F8hl|sZMWO8 z%U8Y9o_8JGWzI2sD_p5o^~h5*Gw*YKek)x9G(ADPnw~dMbrgK@Hf~=vAZl5Dk+!t3 z;zCL?Ff1rp+~?a^9(2B~_awGGE>2=jmCc2-Y0O)%k0?5o9WKBo?7_fD-@+=se{2>b6i`i;`W?FzRF`K$9C1R zlLY^DxF+}o4mb;4#aTO^vPFA*LeF_SkZZS%`-=>= z#{o5?@ZhUq0wOch?$P)S@Ii_z(&pghi3mUt7gXkJPtB&Z4mJUoa-1Da8XE6Oqof3! za#IwvJqxQg&Y2aglF&)Rd;X#eNab|ORBiw zZ^xzN-yf64BMVK^zdad?*I9sgOHPFhYj*0t5|^5?aM zEjgxc_Cu3>*%pJrrG_8oV@uh`1da?is6IZa2!HBuzbaiYIk1Lb^EHLDb8CTK>tJS_ipBt96LlYC}yoMmPn5Z_Z! zotS)uCh#k3tz!ujz$`0b`$xEv(g(}2BgS;AL zmnQqgXC9&Qf#^*~wF22ppMk^=icC9Z(^+GSmczG z;R`H5i;^$JC3!qeNP~CswsSzV9~5b3X)B(Ug%N+Qd78NKrCAXtEalr$6mOOa`!mIz z2!it@YQv*q?qP{iCoKKypM=F()dGNyf>3JXeJd{3H(%^ zGJoUFBLaB=Y8+)O|DD^w?V5GlG9U`FT!#s}0|a}}vZ50ot~71$Pa%70oE%wix?EO5 zS!TL~zR3P8ng|ta3Uu{BODn{TxrFKIPPCxWJ%8%GYPTr@By)9e-#kE;NBd@s^iV3m zZXhFyKp=Jo{zeTTq9P}1Q1(+}AQ0fZ ze$GNnEJVga8Ulcz&nfza5=JY+V}B=@VIm{@7KtN!;q*yu@)eG6AU}JuCrO;=CTTfq zd$<#OxX}x0;)s^|MxWlNQ7D-PeqGAojCXtFzg+w8uPs{7>~69+XF6A2cT!#)`G%qiR$z#W#8AQnSA#!Za% zc}CQe)b7_Qz^$xvUS?tJ8U0`?!fAf9;|nD9hedDk*1x&XQ2J7`HAL!|&tc@W_GHZ< zq(2603_uo>dGu4D1IN&qhkqFjh6}4^)%%eAOmAMjiGz|Yxva;{Rwr$A`~Bg*j5x5l zVQ^TpHI@<#I=!%F$l%#gemHmTF%X#6V4Z$@cS-Sc*96_jNahpLN|+J`oqt{9caE%W zD_pw`I0e@>QbJZV{DOj9`b#6-I~XBU4(E?^3pCN~upJLl{@+6yW z+eA~MudVo12jfeaWj8o}xgwGhbA^gZe+%(C9(@`a>3@g6MtzrV>7Kkrb~;TmhLxn> zRdeL;&Q89yc@{nvW!9BS&CZ_(CY;0w$4{x~EahQ0(EgWbAtD0gnJxxsfC)v#=5<GW8wEG(}Bq^Z1CuiM-eBbwDnPOCpuvqeyy#in`ao#+tFZ3%aYK)&sFF z3`J%bUq?TC^HTo94&#$m$L^wVvSL{Y8%hW2l3uQ(8v#BZm8v$)(Ok}v$V>tO2%|jz zr!)SLwmXg=666jk*v!MYQP&EtC=z&n+(b0(={dBY?^^>vFdu1ucWOnuVHc|(2b)oB0>W)qD_)!4`9BU z$2}WcBr-a%&AW^BVH7^dD_D=+0DmuYyK@8v(+pz(I~xW8&=KCqb6u1ko;#As}wGK>yEOGkynO&%_lM zJI_1+mf-L;f4F#A7T1@Y1u}Pgzx4ZMegY7OiIY1|OdTpgA=}T>iq_w(4|Jj{R2Ifq%noC259;U{hS@RCnl=yN)m|+)Q1^EwLwa?H%R$RJFB^@GtmBy;Ps)2zzkQ zRUQHO%OgTs36%vURGN-Yw2QsUMgW6Xf8s+7llwht-u3tE(s4K4+tqnK!LsO+#$#_X z4Ug={x<*_mYIsii)4!$7pi9x>X@W4*O<%%vV*v5J=6+{hXg~W^xiL zAJNKNL)Yz3$eLCPzg0fSVbAXw-QUTpV2MWV>E;#$$CBNqr;M*8J+GRQ8jd0Me3u`pl!BV&kBBc#CgD;(hPO{Q4|acl%@QnlQ28 z=~huG%lnR0V9y3c^0k$ zca_hr(_-Selmfp45=cUD6s$E^*qXINU}t7Jue7W!dgkuMd{qOSdY!EWGMn`qWeO<9 zf)*UEDxLQOY))-a1^rduf!=&C-7blaR9(Y;4DVFvN4MD{UTEr$KFk+;%Q7=F7XRMt zBVAPEwF>N6)BRMZCABsnI#7ULqBtL`BlhH#LwC<1^TB3f>)8y{WnYUsTe*b$uU9{o z#(Aab)15e0f^DNkBHYsu-YnE+C430>2^&Y%_=&QZM&I?y&)y;xsXfTl{&!y+Odd!$ zW<({pc*ElxNY_6QSJd@|A#x8Fo8%$L9>826b z3z2SPEq~?>mLeVu?Z%zjx4bEtPk-P4wEdtG0v=2I>?ky>Xwh^|zbd2jRA4=qd-us* z(C3m*@&w}92EdtWhUlWK*}&n6fx&E(y-1~Mx`2HT;SUIz<$C7&);fD2&G|~xt2=Sz zPqfDmZk-+}GlGGiHeI%IIQo{BHV8fQ#fO%S;D|Z_N0F!Q37R(P)`?7yK|lwPTg~w6 z#mzEbW?Ftm`tOQ^`&Ol?@%R>=PowkIG>3-p?%Dt%?>U$^^BVBpj=y2y8oM;g->M=<x&%tOZ)Bjzb;c(n{{AlM9${0* zA7=c`iK;+;%qfyY&B+w#w=5^VF1th~WKgQ^r zEj1!qk`pztSzM9Jg8{m^DN_J%;D&@AE;z#CFj}cSY#6nyM?VcNz}b2gr$;h#pJCBj zRpwo!5=Y4|RJh?RFK#n#-;__D-rakNqonlSAVP1}_i@?1y`@=NcW!N(0*qUY^}#<% zro1%E$4ChFqv`f0ged4w)zm)&1Z!6p*JNE@d>S@0zWaF$?!X?5);N2$4_dM`dRInZ z-{dfLIjv;EW7sKp(cW5G@|&C+1JDQ1hy8BDNIr5Cy2*0eDZt{Q6*1+{=xogn=KI+W zgs4#HcT8dZdCJo8q;=qjYF+$%t#^W{$t|JtaYj2O{wi4D+~o*<0Z6#n&U2_OOyOAJ70e@t_i+t@KAG-KT9fe!4|0QL6;4}RM?35B(d#<}Eq|_eNjDw< zBTwQrexT{k$;d@qd)qr0t%i}M2fj_V@#$GXpq$?!kw!3x04Dl|qZn@i_52oXOq-y_ zTRzKIRx&iGOdrmbN4#rUZwH7$pjzvx%Y?+v*LC-fds<$LQ+*YEdQ<_RL0gy@o|hBt zWxtY-=5K7S@^BQ4u$<;maJkz7#e-a?C zGqQAMK}fYd1RH&=aS3w>s{HffdwNjau5Fu}BXYFZ!V0*?^9?A`zR!s5j*c*3 zfV$27(r<6smT%8ouND})h)5}^8YX!75U8X$uZjo=GJQ!38yZ4n2y$}!V#7SIQmTc{ zy7c*Kz}w*gdWyZnWF?dJTi}@2Ol%36WooSSr*lWZ?^MPXUVMP76!P?{?k<)C%Y?*&O9cI zVh`EYX;aWI?$}`=syzQT4MhkR$(MZ%B6Frd1OalARejoG5~3A6Td-NrhVw1W;= zo`&tYGF5im!j)G%sI%_AijSj~DQZtNb}UPs(eQS7l1HYn?#VTH8>|D(&u>xlH`+4Q z2eGYftR3s?rjeI8HLAQq#Oy4|2NAe>jXSj~4mJ_}JP<#C6V_Pmxs0h{ zse3lx`rCFtM|t`Yx9R9t#H{Jo)R%T!-1QLV9xTQd7}jk;5-4S?{L}bVToZeDu#I46 zMH?Of*Ypjz`|6@K>oS*-^yySE8PJdN%)0edJL7FNC zMieI!IXX<%t{1Q-?)1=Wo7wrzvcuHe!wP$^CGXS7&~CP%vkYbf0w{A(1wggmCs#vH zF)0v!tG^FdvIk4CU1)x@qK4n{x7Nb&{G**G>R5W?V!52Oiaktb0Dzv)GPlVWpGIYY7VGKHDZJOZz%pWphVpQ6D(CS(fY+R7;@D0R{ zz;*GnzP^~(Ean0SBH;TV67nO$n@s2ag(=-=bLM;`HlOCeLu}o|lFZ{FQvgOhf8`$n?+kwRM~Jh zuEPf(s+hC6NgnpgU8{b?4j4cDj+T;7t^Hrl6umbShaiE7 zRqhtjq{v1$ilJ`rabvmZs9k#{dV5nWmD#F8B-24o%AZQ(y;7el;ihkGM})Q`Cw9OC z6$3vn4qHbRBhI%O*xwe4a|+uK(eNu&>rMz^M8}0BMI_{t;d@8?$r}OL4dI~);oYW| z9%_0DrFp7s?^{NjMgLHBxtd{}L^%z(sYipdPhBPiS8hpHL-bSxqETf!C}IoUkWqXP zXxKqPc(B?74a5;l2aZ23iPOpySd2zDSdG97)V1xPR}Q{AX6G|zm?s9(L2$lRxSCW! zV+h2sb1XJ}@w_XYLZh-14B-Yl{AzLKt$YA=#qDCPsdG04BVeR1br;`F?gcgJOMb_( zCx-VrAwiltSIA)N_yqViGXFP(QlUo>*<374mV=pdcxMl> z?=8cx$OQebFdtwMT8FGgzkY2(x`PeKn6J)e9Ih@h4gx}h?IQweV}l>VR4p;%sOmzx zWMq45)Ext=5A;-80pzGGiwU(g4%DJ2=^<^m875b}1_ka|JSR@o5yB4CmQK^iHOb{P z&qWLNa6hYnb5{O_*W6h0mJh*cf24*kW@l%)_HkXIuCwdw3Q8Wh!ourML)KkA(4RdG zeu^Me;5@~+gCDK?_|ENSLE(#IW)?r>C!VEI(9=BIF^YSNt%i&$7Ad#2*z+st#Cz7= zuH9yJetyMA7ku1sVsGc6xoTK#Yu9*j<>+IhE&A@TWxLgFWkH$n2B=y&+| zC(Y=g)Co_WgWv2hg7<*kzb<{6Ig2{#6geif6u=co-Z--~PS)647A%d73fgKjW1 zA));=VsX9NFT=t=e5mZgd)jBNu`a5KgPrq-?s+OP7l$3;-?Z6CFSlt`#*K`;YBSu1ZAk&aU923T`VTsRi&l0A? z-aY>D6XN~X^w(jtKBKoLZ^_=0MU!AlVWGVx!3ud8qEo$u<{T>t^UgNXo0<#|ISk_A z2hT6cm}Wh<93?@^R-jo*I9jrsT38FKT@Y?q-d6258z3S=*0*12eKJM>ILE*xmim0x z3O*a^pb3G4UQjUMn6Mg<*^~^rPio?m$w__0GA81PzGTn5%+eIKd=o!<1Nh~kJmvOP zx)Zu8$5kb599{GP?^QyG!qBrRN-~W^{RYGxAEF*D(csz`(LLThS z+>bOk6x`U;zxlC`NiZyh$70@5&8fG3N$;U}soRDkEss&x^7}W{9n2v-sta_CrIymP z#wWU}IzSdg`|cYF*ZT!cVB1JY&DUk8H&QP^E~@I>1AEpu-SI{Y0~UooUoGE*_!5r$ zQU#pUac|anzQ3TfC|nobsa*(g$hBw@T$`JZy3kIeN=CH#3Ztw;QIDHl&u%tl?tL~` zQZAoT`e|J&xl{CM*4qRq4G`KTY&f?;jmVZC8LLo!@`(ELq~V~m9ouEPC@9{D*A7c; z<&j(J|IM!(sy~}C*vofqqnq^0YARt)oBlXks0GmgRr6JR2e#rWd*1}cGo>BPVf=hz zd5Q51380v{Yc9Wld5+}z{&?Jkij`ZlBN%8jj;$sYaB}(qENk+Xcl7GPCc;dpc&I--^uh z#jef*8j9o_$t??f#ya8IJjA=^z`Gl7K_?A$gH?~mFK!r}yalbS$+lYUGNC+4^jALb zWEQCgp(dM4EJr!rut&daS&|k7;W{l=7cBGFdALRElpB|g(c_n%rx-oQ$<7}_fPE4> zE1^}Mmr@P+-H2N`sbC6*&Au+Ip&s_e;+&uL`wq=r%-l#kzDj!)HBX(KL_XgZ7Ao5mWdGa7$5uMZ^E|T9;=vG*@R&apfP6qQr|6i-WbA36qg+L7B&8H zpC77+sGaOh2Oy45aAZPds+RbUwsq_XEMeWcq@@eO#Hh`x#JAKY?MJLhwf^bFjZKMT z+sWh?q$qw3kLl<;v=Rsse$mlVhXPk8B2Dl^0HnJ+4?2+K`*y>gVRkFE2QhXPhL7FK zKX7!~o?p*QJ>a7s8xPl?9N)T@l=?N(&k?M;8ba$J(%Jn*$04`!n4U+&T47$XWIp9w^glun43=56)t*;wPM z^tuC2+Fz9xr(ydNFHIKFmj9}6Nbeu65UGWg`$X6#9+^!`a zt|W`~F%=bQIARiJYje6hf9{Pw>@3Gq3UIHmHJ=k|95|9SkS zNAXJ*Sp1c3@7#`mk%Ptv|7UX07!#r~83!*UB&5s`s^Z{+E)EX~l%JbL=Q62rC7tMbR%H!+*pUFcEMq%jfzuA16|8T)Yd#jgj*eBm~#=od_);4RO4B@$K$`9;Bcn0es%PosBe z75~ND<9w|=EM>%4!y~&NclQ9f%3=!m z8@4RV&u4SuB#(!tN=k^xejL(mjNf(A6d7@OV4S3)dZ4r$Wi;xI@Fil9eqr&oAz4Q@ zGNxt^amj8+{A!JaWsSGp6V!A3u!bk)_9LSap1WPoMg%KfR?JWQaT^_ehORk1dc>^U zlaAxp0y#=hsx7kK zi4blWt6zinM-$MeKjE9d{`MEXHT(E)4NGgyu`+HdnJ}kSM=8y?=~A=D%W*C{`=;I} zt(gcsccyYzw8xlz@D{O2Xi9N4ya+^#Ia(W!$J?M0_B>=kqZ?VaU+Lo&O_HqZ48n&u zM_S?#Y#m{B$G2vdd)Vc_wWQs+%Zzjo(UtIl%Q%fT!%tR+FfLUt7wrA(53wT-+m=)y z%f5SAw%UoK>u^65%YdrLnNb(qv1$VUKO9Za$(pb$o=xlUeky+MSaF14RNxMz;e0R? z`fqA{mv)dMRVKVM;i@#rHyazI(}q}2kzZdDVOwJ?bPCJ`4223u7 zG$W;bPha9SMD5x(w+FUeJUyZj+XUxV zPYlDr6ef#7oO-mHKq9>OYR+#)?@(N)06YUOCg)6_xI!9(HF4B%bUBAqy%HBk7k|X3 zDRz%nAFa(I6~4!GkVg{Wb2?>I+=xpMki7=3)|aiub!}%jS5pdk7pov=5rBQt8Q|?0 zDZIf7_#N7hYZ2*R#>Y??>+}Hut1PzY>C#*eplU1OWoX>X-I; zK+2sRhPZ?bxm#7G(;X*Xl5vT_{vR(XgHZ!tm~7)?^hWZsVw9!X-Y;k_|FA%-B-cb7 z#a2nGTNe`ClOw1bq~Hxkr3tY*3xk0=sEz#p*fyuGYCi$!IYGGNfkVf;VEcE zZpxWr9u$Iw|5>xU7%#=*%jVoN+K~J!S~l$G*q*OvhQrZ)*%h;nDXR7NmNC;my%OM$ zrZ`ttyyyqs&2o5|eaU+?0*AN}_S6^?ROEC@{`)`VdbT-elJ+RNLEw~LLz&arNCJE; z#sh}dTaLrC22(#7k2PPsiC zrtzq~JDa=BqE<%xgU-0LsCmQ9t@0ZJ`&%x|4euCQd{QhZekwPaH;S(4{7^>ct);(P z8%@=??H;~iYYyz3mQkygVsLAnukvLjoux_a_$u!de)|P*DFf#$A;2#UpWEQo+s|f( z?cwG8xl`Whmi{#%`s(+z>NGp|H}}3CSt0Wo3uhx|8!AH65l@+Hn&Fe@;XH1i@4%fq z)xt?AT!w7Jqh9-!;Jmjkv``0;arpK6>2d=?AxY8XE+MrDe&LmjYk!~9Hb;^-J_R`1 zow4^E}t)SxzaKpZ)_=_v)hBmKZjJ7j^ix#-j~Bq~i>1(C3r zsD3KUi%!d=zrI7lzbWpV{`6c5(gxeh9vm4#8^>moU;_l|XyLp~RL#67?=+nxH9XGu z62A&by+AV4y4g1;1rovm$*&CdtV}4eiC(0T1#U5L&`~0J>Qe|g{wTi*l^9$d#xR-d z&bC=Z2^6kKuzWa^#96=r*c>`LU3fBp&c9!q&hJi^C2Y4#^VfqEA$hafnOOZv_{|+@ zZMrE5rf5pbqe3@DBcmgBAw{>0f>$8b(;Gb%k%si(6lR9xeVW&=wQOm$-}TnrkVYZdxZIw&8EaOM(sBFh-W9xt6)^7cbZnca;lN!fr%L!wE|v4 zU0C)JxZu5{#!*Lu!&gm}$@pOY@0DrmB&p9L_`gR8LQ4B|K_pd19Gt{eYn6?iXM(?$3cnsG7Y=mot@QV=TX)tmQm zFJ4eYwiiVS3+4c;bMB&~v+uAuD9U~g6U)kOW%+`$cb8y_@6a#(I(>Yk92OTf`v)n$ zl6J{&2HYD+`6+m}d)_07rIs)HT0WYMzf}HZD3gjBqEw{gfy{2n9J#$|mZR9{k)Kzv zBp-2zUUS0iZ;%hSpEtqdg&Ne7mG#`yp>nc(%760wW|&_zSy_`9*QNwr)AQwvvMXFh zN2y?wkKvhZsCCVtx>GpCF9ip8JtcB^dR1l9R`rg^=luutik5-+SSzdi3KZua)9S&r zT;Dt!0Yt=YLx_9OYl~NX(?!`gf2U@rnG50oZ| zni#&;<_zaE6!0gmUm${1_IiFtgvE>(&xAl55TB2QR5Sqhn3DE*zk8O~!0z35gZ8Y# z*V(>hD0_v1OI7cm!-Dk|*oMs4Z^u1#Y`oy7qeAC73>EF$Pd2kq54C+-q6UCLg4<6{pf&FCfy&-yEFnEvz ztjKQ&-#nW0On)8l|L$ijaG{|tR8n51TpN@9Bf1GW9T>Yqc`7WE8ED zQ4c#mDe64Mby$scA$o%&|12Sd%@FeqWt}F~cFN=t$jEK4;2xxR0!yi^VTX`aY@sU| z7TX>EhLf2MSR0QX=aJHoZMW!o~QS>WN`r@wr&tmLXiN8~oEoOCS!!S`Dfis(lVM7F% zJtoJcj!7q z6TI;s7e&Y;j`H6ThO|q0cTOS+tPOhwT3V`~h?^$d<}GZUa3IcNO>O13snFpfye|5$J)&?l_$@~)BtdXiN>S?hXu&JC&v{*5 zfKc>PwdBuh7+)<^Qbl_NIap(R#y&k+TK)r^_{=GWVkhmfp4CM^=H_Kz@M~9!I3ykooI45=6*oYY3uR5IFqjz>K^wVP1 zd=>Z9c z7*YYn^AWMVx%C=^xq!o(MAr0Ryc#2C{Dc!4gXw;MYd*qJs<+9sJRT#SCe$|24MOh}2f!Hk z=jX(=KGLH`zO32;^;Hlrs|IKXg5(?g&lQsmlZ8kYQaY2J2HWorBOc0y)!J^~i}HK! zLL(pN=5Z~i`cQj*`47xsaHWODw4sB%kj1dF_z}|}r z#&wC?V9cdb*ksA%BMbtqpkvB<3a@n}+cN1Q zwebp}&1S6ZuS}gbL~@81i)oKm>LZ2CvqB~hD|SK|{H0cN9E{IZ&{0EU9?+}=e7-q2mln z9Fl{tQx(!Yf(xYN;-=plJqknOnu{76J%*@Hp|@wS`-@wjgX2r!`OO*3@8SXxIJ-TA zUQ7Z1Ut(#Fg$@dj5R2Ia-~YqhTLx6sZEc_^A}S?P3Ia+>hjc24uxaV;?(Pr}QMx-M zH=WWgCEdB{?#@l!iSK#OdB5-6`f-2U^#k_WYwfw#9CPF|#+>v2n`9XIfyL}k+|PHY zS@C5Q{mbLSU_7 z^uryuNZ98TOgV6DrYhB5sg|6%P5%BB)4Ns6ts-LTh-JPBTH({>Wg?IvN?W zA~uEX&D-Y1i(R9tCMQ?h5&7UvS%;kGDsk0X0Q}Miz>hC7X}S^tyvTMp4-xnvTi);n z<`^dxwa5z8BneKBofApXts;+UvxT^0r~04c3NmWkQ@fIC_DSj6FDW%C3v)#auc4rZ zO>y~XNKPFhd&1GbW%T0;6uffm+b`zQ4m;KYdFc68f_wd6E0=xzH`w);5(5sz-C9@w z1I+DlX#n8I-PnP{AmGP;PF6#6XWWkRY7M!b{L5Cy2>}q|zf9o2E@H<0e+aT4ej1w< zZ@UnsHksOZSVNFY#jE~ND8g_)bT?}OW+3iKi&pmPE~WGL@gm~x#s5G!S)dx3*?Ed) z^48#m#a!qP?pw@-BN3a7uq2~|uz|uPKOnohL>D`dT=&oVFG3pk(S|f`s8Z&XC1%IK ziV|g=2x?9%Ytu&wqNRH-iO>qNexs4mqT58*O zgIX`Z8?KtNcAQrd^LHLW&-V9qKk=Mg2W4pH9C~3?MPEm>?Pa38>S@nd5fxY59(UR4 z47R1%Q~gkA`cI7ZPtGWerkH|$sd;Z!__{JhYtOItye&0~r-6dH_~>}=A}@v5PqpD! z#R~LdHpH>C@!=T%6>Z4u(D>)tK=s=*@|%5y7n$}uc8Cjuoy#*eG@7%eVRh@>^rs8p zx0*yy*A30XBksDo{b|XYeM$0BbuZiK*_t@yTOFj%XqpGxG)o)89&M&*y(|cIjS;Rl zE*Q9CpqR{q9dhZ>+EU99ezVcIFlc|ESbgardRE^mdpW!8B=oj`ulQpR>0TDAS-mMD z&63}PAhW5-X(-D;<2N zDuTZCoujaXd+9R{eUjlr&-TvdnYw!vDhUhFkUV zZ3ywfdJ46%*vzlni(B>xzTMM1*(>Tz80-6!ys{0SO}!htCFtFl0a)@6PhY3S9Fzwc zZ+jMovupByY>BsTy?@SCWz~RRxul+aGf6bN?N7--6PYpJa15Z*}#X>9p~f z47xR+)2NJDbt594N=Da1M!8HD1;z)q3g+mdX6cb2NDT{#=H->t)GJnR7@*%S5<5A~ z35lq+Lix+Qju{zF41-Iyf|A^pW}Y=%`|K6B4LVjq12uUL1(W$OHZHm+jt}&H`Ap?7 zFf5j{I~?pR8J_Ph&1uUnP7qa>Uoc|aUT=*U7HAEx38ZeIUScHb-S$x$J-T=;Wlp5T z>or0M{~=Ku##N}WqPi&VxvN+fJ*AV)0^Lu<}>hf90`W_$((JL0nVAhu%UtS5!Mhv9y?V@2T*+B`vYf_U;jB z3LZ9zyJ2*AT+(uz)@2l3;!3%@KVG=5WwX@V32s~}I&J8b@~jQV(bV+Dc{tlOL;Q07 zykKrV2RTMvl=1xdUc>c{X31^u+|ktr4o@trNk;zdkfM_2G0m*g8iHQ_Li6P~s#>j1 z;28|Qio#Q~N0MPVzcx1~nr!~ciO+p0q-qUs?;rqrY7Lu14riN=65VT%fYMKS-n&;MP$@vz1LuH+KAtk zwP(4s#Xdo=?lipvf`%SGhMg(?KN+qbh>PD{5?MUaItvk`apJI6IYpT7sndReRdE?@v_yICo#z(8*G$?y9g=<-Whd zugL#)pC0Vw*#)UDUzl>J0x5zCXnvt-`IR`Rn)Eat5U?616GA0B`U>N3Y^XV^ALtS*H8x z71Hb(E7d3P_MDok@R6Rx7sHisbFa;DkG_`v?IkOrqaV);6kR+>MO0#i4hMqR2o@-s zw#cpIG4^51T2>jjbL_vbSAn(&E)CI-Ch9g!`78v8hbtmRL_bKl4)%l`MWv#A}AHEALi5oR{U zys;$|?JH`$6p0k_$da>sE#5lBU4#qt$Q5?4Y%*!hHOuCEZn+9x7=RPj(yWR zJhWAI?ZzLQ3&$0~e@+@O$#aNKI=^=tVxW>xhp;{8!O&e1GOOWk`wDY$=xy0krekDh zi91&M?eyWR9~QP=+T@IX|60O^Rl8Z8wQ7&SuNE_>It>+=91~b8_wL}U`GbLgA_SHr zu@43x&f=IQFPh@xKTZvlKM;S)bNpZ~^91Yb4#AW|KiLD0I5_gD#F5fv4$g95I3mK+ z1Z!i%L;qUm%`7zR#uJLmIl2XePq1)Ull!=P@$QRK=AFn_;Wbii&mmN)_H=T$8ljx(HSRw;(QBzybQt@+OaMFIX;*Nk6qJP{%#nGNw z_r1XnGc7& zEUv`Fdm-W`qFEEiP=p_k$vpf=dk~?>$Ub~XcICmp#(=86Mb%`)Sj=LHSzvB18}Gz8 z6TM1@FT%6Fx!JC~6~FKeL>Kg;fhirOR|NNr9BLK|apvGR30_3d>64V5{9cZ3Krb6G=e zR(O}B2*!)LYwxmni&wmy#wLcagrVP(NPJcAHeO(~23sS{BBP2H7e7rX_eLf*OFM4R zwB7E3P`iu$Ch7=BQ8XasrXvcLmvvcvnctPD|A!!<5DVx|JnNc)Pf-fR{*3=E8j zo7rKb49T!O1*!Gouw3d(GrQR9STO+!fDfkT4$TLK}XdG>J%sIT?QvE@iQd|mKGXZ|y8w=I)Z&pBwW4LDT zqfX9vgs0q`)Vu8xYo<*g4)n~LpB)?&cy=7E2^$p_dHamw3Qc5?6F$f&QhT5Lm|Da0 zySlyL8C#hrj9uwAh;o8cMs0Wi2x2*?3d$15Ji6bkKyy(&IX)8HtktB&72JTPfCvx%u zVrQ0`N?Ro`{m@5SV6V|bA;6bWb^XiUT}jC*y*v*vh{pV#Z}~mE`BBaGhom#Bg-gU{aGFvp-YN z{fO8mi$eCu-JqECpHy-;^U ziGgSG4-+$I8qy$^-K=qE=jX2K=nlvBm#fe&8yL)sh&JIqLwzS~h&NhppUC4LUAWtv z6HO8Ey^S+214^b_uC%_fky=v`>?oCte}e!1J%tS({VP_^Fhstkbp}TA%5{SE+oHxee3EqXuiVs=jY*Fhh3QgD zsZ9;9;9HK@Y+T_XbjpEc?Y?F0LJPeYAHKkxmUbMG4ZeQ${aX6Q^&aHZDIXWbqcO$6 zk;bq;X>FTxt(YwWYq7H{R!Urt%)s_3ktN1%1sioAw;v(#3!=WXe5BTnwx?$003I0} z92An5pd(JEB0hVI3pS8=5RQr}rywu8RP(K4iyXW!=vurLPHOa+!X`dGBozmeYx!gOSQ+rDPq2EU z0XbokdY$tXuL6DTV^=j=eVn!Zv(rV9V#H7mhG40}YmU3?9>?dAGck840nuIbuitTM zez&w~M89pAuBH0RpPl$-q*V5p#Er&CDH@Gm>r%zY1BDjxiLSkTJzY1?w&BBNZmv>u z4iQ1ys%!`K4DP{Eq$|v=1q-zau#2`}yz|q>v)d)#xMO|Q^D*}=3eSBHvMjv{x3j&+ zo(rBw#|?;Ac9&jW>SGh)Y%^t1$m|B_v=>hs7HP~}f456{UQ)Pv9?{m)n^J>_ImL6H z;bJO2o9fYs!0cLM3&VEfDzuTm=SV7P`Qk>s`ADhyhQ{q0#Z-jYHq*D$Lh6IwBFF*f z*wmeqnWFHw1LH7x3D>@gDWKxT&ujZtBk%iVQXt3FXj#0?*~Qfr@-2k)tves&@xeCt zIfeR6%)==Z%f6Pd*mtI`+|X{CgNrM&)(&f!f5_kx0bdm%w%+1tRQLDbz#k>mac5$A zObC!u=Vb%BSFibk73Vm(jL^38AYu@T-`K5_T~B}|!;$y87XwW8UJ7+OfYT;8mx8zf z%a!|fGvcGk$;l6oEK;y=#3oqOdBxWRv;?!`O901bc-vwnI^mEp!6)0&jL3+anj{gX zFzelB)~+loCMb)d5D<3}OcuSuKtWC7jkOnpTGO$@zB0ITU{zT2wQtt~Fl_J_Cvd$T z7oRIs4-?ZscV=@1RGH_Rf(6tnw3*|IJK9R$n7%%(QqthP8vE8S1g7d6u;6#b?ltY5 z$!^qr?%!K;vqwW2mWkUFNy}fH{sP;Tl6f1Kb;A%(s@|=|xPPF}9+s#DEw4|CfcDRy zoIb_DlvELA?mTruf64n%-JKKxcr~Ce+Dr+`(=n|B1JmM$j_gDsF%`k+zsyqYTw$z(!7e*9AWo3l+8aQ5 zNrh3`xz9KyT1 z+{?clGzgeip9j8$=VUj5PB6LE@T-5^-FK|UWOGL2Q7{QTlmEWWw1Is3c@^QhO~p%QMcmYz?T}+M3$x`5F-$0iMps2OOpki+Fict87cb zYy<45Nc70rha9rXZSZm$Kf=8;)70!?5^ z@_=a&AA}xkzN)Bn6j!NB2eS4^Eic_x3wE{qAslO)rFLeU+YWn9AL77@x2624_>2Ap zd+A!aAmScPN`DA&bm_VLZ(UYS-ghDahnTDv_B7x_g8N^9v zm^dN#BW98T)0!RZB16|tos=T0KkqZba6(w|gL-QiG)Oz zD(qoJOiIyxEp3&}V%v6tO3pWrfJz546)BHSWM{Iq{-bpBSF!2woQjAQV;gZYkzEmp zC_V^(9GDtwkF%Bc={s_&N9^aKTN$z~RzbWjNEK6ea&?(-ooBo)IUDtQPnOsAlEdNm zv!|fVx)Tc~ZpX&_3`DT~$Z_Ladd-HcoHhyBfQ0OC`yfBRq{o6^&E)zzY+(UW?7l?i z@|W`lM>;vKJmiYAMpdz{E@Tk91MfPuKHbMEAt*Nco7YbLu?}+_hijoI4jK>%z0cJD z3YNh@*wo)SYBH4_g1|v1RxOPMV|X~VQ2CLUjhP2EqVt2RFftgtmQzPNhoR9K3BW0_ zbdh5f4kVWbmKuDBjhcpv?7)_N`Ks2{9{32Q#f1p6q}zpwwi@TYsSuCvY^iQOe*S=sv>_V3zHo}r~I6Vi@%S) zbHJkt6|1qThX(b*hL2GIwhwWN4LYxSKE=&#J<5(cqo$y{CnO!p!A1A!Iib7j7%~tVgkXBxju)l5s$CEFAYW< z9WbQ0*2hP8UQd{iPw1pZoqENc%p`{yzISk~^Le=Mo391?K#rdG2S8!x2rViRj zw5Tmv#Om|<8bJ}O{ia*bH6M%;C0a7d)-yD=lc9;}Ur6IZ)VaCHQNxA#xfH()NDZ~Q z*y(D#5^!hUsk$Pw+T-QeDPRytgA|Dp2R{;{H1L+_?5rNQe9bZdRLX&T2ihe^d(`ID zeo|6=B8O4J+#WQqHo^Z$l8;9=*j0pN>cfkmcI|O*jT&AJ`l?M1b&uewfEa3;*uan8 z-uDF`2-2(_Zxw|P&k;ZWx%b5Vt`4O7=I?~Q@oEg1ZQ%k?27~VH~Nlc zTT0R}&X?mu%Je>=zIvhd|e)p4ZWEWi9$PpyjE^F^ZDgP3#ST*iTMHFsI8a>X~*J7=13 zZ6K&1>VKR@^2?fR3KEziEG|dJ^y$;G0sVaICAm+s@j=dTqG(J*pdz-Hl!)JMOz+ki=oU9=7lTAcrr2gJ zt>&vHW)vt*-@=Q`&39lmFrZEVSIF9@ItW;w#k8>{2;Zzlg&Fv1Kpf||Ce3#Umpsrx zq!vF@02+Ci*CqhixsIUp&LZx#!QV$=07J~^A5)%u<;B893U;kQ*9y6v{d7x5I$JCkR zv0aEpn=p{02Y<3IfCMBq>NHd|h8{K~M}!dIv|%KCpWC)***n9+#rJR1A*$#Bkb4O=@ca4KCDw(oyj_^z#K5SKY-xBVZlEha!{Goa3eT=Eg;hFl-r@09&4(01k$anwc zw_BE!{Op&xXT$s=cID&*x%4B82QDQYNY8L6o&nv=4u~aAFMR|lX4fyj+Wslz4vOjPuHNPxce zsX)HLTRb&9Fq&ZV#1ck2-@;vsyWrHSuB;+>tb&c?SBsKtRp8-~Bv5f6s+d^PF*dWH zprAGxVD%Rjy$cN$;BK_5uM+Xp&Rt!<2L+SSxbuNvd8!6ZGb?N)!U!T&@Y5)FM5^?I zi)*k_*DDa(psYdnH6R;b7U?-<`wkNhmEvQ>l#Ct$sWN;0T8~a7{Zxk+c$`}2H4~&8 zJ3A{%gAj!|nRg%(j!Z6C*3l(>|NcE$TR$l;Yg}KU1&C3-8dh*rR3Q-Y`LPu->#>oc z(Vga(*dNl|iNNz!U{l$7maQO!uuqMi?m@~|l^3~irrg;{dLHypCyk_2JSC)mEq$@h zR=mXjo7>0<1MIB~>yK3GKE;Tb2q6<0l0CQmh2qV3Ws{Rfl0!1#ceESru*kYf#40KR zJ4L*)P>OwTY01zLAQham`IJ#wyMqX?8-(2FZXR9KeQ3EAce|_*OZ+pk1z(IKow)1Q z)T`R~XM8#Lirb4Z-CJKCWe>JF0t+=WuSP_LJ$&%6E6;Sx>CERAs7B!q`&q+ePZNe8 zPgJ$%?me4+_lZOZf=$;|@`jsE8LKm?q((|CA~3Q?n(}SMOU{U6j)T?$yJ^Wvn9i^B zD(*zdWosRMxX24t8?(-6A*yG(pCXOC2|he~b(&c$r=4>>#^#Cr=sp>O_p9$ZVRQYQ zJZZb`dj)d^B){>h`mgJuYjh!@qM651e!)f^6?D08PO{TRNU3bouTs$6GkOVBmZ_p? zqfyk6NCsnP-S*tgVRfI-SVv8A^O9!R`Iu5cT7;F&w#A*v6n|5XS-*y%HL$x#$i1*q zb1R-;bXpp^1m#wcbCkOMk?2rs0UJnzvE@fZZalNDs8w|LY01qijAy^GsncC@SsU=1 znyPtUur)5)W%pSmQ)ZKxXmBtBij!2MWi@clsGg>oGel_^QX07cX&}ZhUPs41gkuyzUi~$ILWwP z1Lb@LWpN7Sd|YKZg*ZA~BlrKVi;ReRvcp3B^J6ixMG=d6}|i_j|+YjX^6;@Q3IVe1$xr-7B}u zVHq;q-mZvrMU~1)GX<}1a>$dfEus`L9-7fD8^tvJ8*JOQ z>3$^{Tu+mN#*0%_A0Fye!my>tup4@+?;%t^449;iq0t2Qh8fvu4D5(<5<1-dB#r4N zsM?F?64uyxhJo;T>uWGF*tQ-4L2EM5Nv(b4&<7#R$V`L%%ZdnDczhzdnz8ZtNYq%8 zXeJ9zRRycCZhNUEoJ=-H-;suc82{6`NiHJ7v{`sgWENtxsZF6#PiP@Y6==?;|IqdN z9y>w}Avl>=Xr9Kqdk6wTwf8)r@xKoxCU4~5RF`Kvy$+ATmrc1^yC{DyepY+G|L?oN zhy3Twi2pb*)_H&tDtpRvsa7F&_q76&t>#~sm!Ek5)uF#mwb~vLy@GDfRkFj#@4m_N zu4ee_iVf0#wfNVCKYyG2mCMu-tjPcOBR-FwRCf^lc6j`mY{RdpA!+9sU_Tu@o`3ul zf#zce;&SBm<>}$_U9T-3_qc;Tm-;|^!|3d05D=D`xrqL8|7RRhr+=IxCl@$8PAaZH1e+S)ql12kJkSpxNEXI{r?Mk01EHH67IT)@LB#p zL-;Fx=lGw#mB}*YxfPu+i#V- zcU;4#q3G+rdv&>_vbG^z!(VR~Dvv#Hrd*Yb{uy{ppG|6o~KDE8{$s(MSvDs zoPS2%`LxsMXDo5gSo9+Kh4b(pSrvdG=R^0ZS{eXHK(aE>P}iGX-8=63X3!_|!L z6aAe<&^oR`pTocTdzyCJbZ@9nB>|g1FXnbvVEtXVfRFI8XX9ZQ1zB~4*?3=C9AUJm z`)O*eoN*X@4xW6o#7{K*PFjXJ%?r!Ybnm8eG%AwXk>^Lhg8o7pXrA5&utwL7yK9;H z-3Sy@$6kW}%h}-qQ6fVlA{0DUn7U3MNFk6_wVE}*4r)GiSaSxAfX|r zN=YeNt3Wp{_dZI9%J2x;rTrTMAlxQT|1pM4Tzo^dKGsx?@+t1?i=ppQ9r&F5HtA&6 zCxl%*vq%MmgmSjSQ5!W8JAM1P8Tsf0!|U@!?W4C`?!;fQ2XNMBnv%82wbK9DLA?-- z8_S~HT}PtfKFv$-o6>Ui4p+A)%KmbV77-QWt2B1IpEb@eN#pt+m3GR8QbPQNfB7@m zOgS z**fBD&Xz}al;EUu5J5pM7~X9VwNoR92FPwhTmCt*)N^k3e{fcHt~9sjk>iPBW4$VY z?vBevTjNmU^_1rTUh-|l&C*;W)YchxvK(`RaXnd76k)ph&BEsavV&X^yVTf^XwsE!NsupwW*;L19U$EvbgXZ)`UK{aXhWxA}Vx zZ8#`?wtqW0#KMt6{OKma;1@Fa5#wHOcYkx0;rTE!3Di>>yWXvbKwom* z8STH0DvD?EkG_&alKo|>aq)F>t{f_jD5W`CvUClIbyP`z)T6!Q za-D*#_ePVO|18!ax`(q#COav`^8+^uS^C;H4Sp=mAQT|LRU{~E=653Y=TM}#JMVzs zsP|6U3MUcW9xDD^NGIhQ*Lx=G^-4JhtjwYI(&(O25S? z!6DhEJf-K>%|!L^@wt&aPt9CbG@|NWYa~D9QP%hK;N7Mt9{t;XS*f?;9HOrWo;|@p zxg4>da#W`VWUC_TnWRUkdiMWI!;Z=GPI3~=lbxi$)6_~hf2=e36iV}-Zh_M~v;2P| z<>1P1od57IIBoL(j}Zf>2s8%04)>a(CjR#$N|$Uyctih;fDJm~za`*L3xfv;ocgy7 z^*k5Aa(!0454@QwJ^}7iz1jz~vP;!5K;K7eySb6T$kpERyPfR(Q9Pk#>;KQD{%1UB zv8mwy+U*%L!$VN}{=dBy3tC?!3;F1%+@>gogwb3jo_4 z-W@Qq4dH)WHe6{Lxol)U>yT}>1PUnBz9LU?2`j?CW65S>=MWn&Co|`L@*>I3O)Gl+ zbwG=vJ84~Rot&fD)Q{JD6LbVT9D6Ogl-Q`k2DfuM6~Cj_GKMyew{JvP zvOrJ4H|4r8T-MQ1la315NkrwGEOnI1ah*Y#bLVv?d0TgGzaBGWs4l*cy=*eyj;r3J zh;uhZ#R}pZoXodVcZAM5Ho9JcM(1+oLmH60WV3hHM(?2+bLo5+p!~;QY!Vt{8|#dU zfxctR#t2DLIW}<|SVt7Pce(;mzLIPbyi{;q z<0O9ufecmj63EMc%4#vETuz9cLj#j`Dsu*QWDKPmxoXz<+ZuE9gW@+$?eeb!zkX~d zgW%{BnXAF_hr)F@x7jj>xD?Lvqq|D}W(*!C#oELS20x#*EF#t6k<|+kq z6b;;V5Ev>eru7M9LUbMSY{e zMK|Tb9v_|QYjXw&L3l>ljC+i`4qu%3=2CDW(wVvW%#R>CQ|#{_M@QLz#A;_3Hx+!1 zH<90_9p&Eh%mzaKtTV$6E5e5BWvOU$na%4Vvsor!NLuAb5 zeH~`pp&-(SKlB3u@roVCh@4`2?Ov6HBvcUEXD1roPDwE$ty&PB1xNBhwjYh6rl*zO zn;($(Lnos$XnngE(8g?e`L$ePs=_&9@t}&!6^`xyAu=Tfx(Zj>skxLSygcuz>+b?W zk>-8Bz&Lvt&MFZf8!y9%{b_`8IVDl%(|fO>4RNdY;WEYzzkmgJ^tV=-f8uPyFp<5aT$1zz(j?uho*qdai7S=`*f z&tXP6)9;Aktq1iFMRc^SwubX7LR>$GIn{JSw$*Oin-eUm7Y1d_XZ_vB$Gl9093w@R zN$QLBRrizwsDD;Wl3y(09}s{?ve(KDtEE5l9ogxBfRUIiT2Nq1f7>?n=|l=SD!WkD zb^!<5_#FEMN>`}hN|1f-PX=Bd%(xM)@gH!?B{7WFaB+$Vo;IQIpYsyOD?k^jG-g5W zgsI`I;a3>S<0R|bj0#I*`7Jmrz*MO412(K+kn2rKl$Bzb{i5Ako&LiLGbLzvn!pJ< z`o;i5NWX&?hy7_HpY^x`7)|4rDT8vy#Nqw*stoZ;Z&}0s-sJSO9@5T?_j}p7G+la3 z35J3Q4ha&;ivkyvP{Wk*bmm%+#aKOul(N zQ)296l1Hsy3DbLibc@P1V&MH!y&jPUlm${#(T0*C2`)^U1CZqIzGt0ZJWgjXpF9vO zyX309JRU$i+c*u{8fE9mm*yaWl#Mr5lt}XPI~lQQy@K3yQn8MYQzeV6TfsU_W!Qm> zP4joe(_{jnwA=svxem`4fd>u8#UMz%{dZNvwYA)l%bQj-d;G`shkc*Xdr*jCf1aGG z@NS2}`%t$oTRJZ&(R>-6+-tSp_tCCrwXC))d!mMJZbCoiBah^=_`X(+e`}}`xqr@^ zJ;&a)-lJ&rwJT$GOi1unP;xOm%@{)AEUG?LUo9YI@q2jpa&rYGdH5!ERMnC%;a55$ zoP*;QV!9G#Vy>IIePDdzaDknCra*@Cog!*;M`48Rma!J9U`n$sDiN~TBW-lk7n!QH zx|56&Lbqe;13FJ$sd?= zDsL`Adknhk2E547T!hQr#q#`77*akk#fhs7OH)!6RLBBI@-kEsY`C>lc8B-b3KmRp z_fb7Zr+NA$CqLr@Fl80Gg7VIB&%S@Dfy3ohhtqP}vDz(Vmy_oM#u zXTBCOyAySv!bjdRveed>6sj1MDXa4$9tj|aW25?w@~_L=3MS#3E3g?DN`!;g{BJhJbr^_a8gRSe|D-%oI0UCqlJ3EK%r zphdiMwv;mg17$V@R8(L`8+c&(Zx#gSAk{uR@0U>j*+zW^@7Z%}FeY3VQ9CVnPk&E% ztbvc}be*B;2dbxw$~lhr$DY+QuSY0`)6(<)9D7}hTJKRTb$K~_)VFqqbkbF;?Mz1( zr^}ABnVCw3#30+*`wHiAm*c_p`mg(}P;zoK33wK^(ik4W^BHsm_oYkb?}TH z*;}R-X|HZpn7Njdo!V9cfxL=Z2Gi{qvYgU7Io+GbK^GKcnev}DtDo|`>A&J-Vd3I( zo&BD(F*(Og=rFnCa0iQuQ;>&uif!_b!-`hnTtM*xLy%om7~ZKTqj)=CH_*CbHdFWh z;M}(n)?*NHc$7#@MGY>7JDRCM`|bO8&#>{ty1qQZT}(&>yq4r2@PvMn-32F!4tSD4 zL%$35ryPdgPC-vT3co{fyT#B7{t-45XDw*hj&?08C4x~zGf-qnA30igW$z12xmB6i z`hMK!uc|z`^u3CCZIqTW;gi%MvNB!LYv($1Zkcxb(kTri(b8)lya{HMqefbPXQbia z*wm=o#I@`1^B(!Pq6z}{mLdY;kYMhx;dLY)ZbD6i%QME$$xkK+yiYoU@to3pIotsK zW?lM@jh_6HFkpo|uT3%Nc*hn(wOdyR35VgUALS#RSyoe|Jv5S^sL=zL_xHCBR!%}` z!0wXC8~mwH}-H5chM3v;XKL)7Prk8DL%39r&1?v zS*U{J+&qrDBS7EDVLcmM*Mqh0?BekPw)L?MFA8<{2? zz}&%l(a-j=@r;f1>}GF(f>-o7EOUm9v9fLkkD(n^fNdAohiiAE+H^oyetiAd0X&f? zaRa!@Re)x-rSeIv!PwNd59wUvu*T&HCmwnTFjO>AqB&_j>A>FPm}I3l|L%#nPG9mU zXJP%VQ}WxOJUjcxJCMXEV?U(B4Irws^m{UG5fpqmGQ*!OO_t`wlPX7DkOZ^Tw2J!% zQU*0g6$*EL0dV>9uXvzcVq(jLN9qTqI7N-_(z0GnE69BubB{>efh!8!fV&`;_H1k;K&H}81PGu@=~wL@8k*q-pL^fq}Le6d2Hn*8KMJlFly!$c*? z{Muz!A$<>%zwde_yR&4_OoP zP3O&VL_yU}QOeWDG9^}=bLsoWgBRU)loYcJb(jcwnDQHW@WVZ$iZp^;u1Z3#w-H?O~@87?0?sM)~UgNZfeYF>b4wuH#9SI<=-I|uG7<52o zs7}z(@^T6l62=Nf8Ki#pbEiP7L@>7NRFmqjkGN=1LxN4W42;bM>l4xaK6WsCp+qGu z?A-WqCv?TIm6XI}O;@vpDLR9)-G(JL5PyP9n=&n~`nH->WBjH`xwCr!@MgJSGkMGR z311hM&o*m=kRv?{u2Sv@&_uI&5I-oX(oq#Oq%Pq*2Vlt0~(3hb35<3 zA0MZ&cUvEz>+YiKg+Zpjd@K+f=X0|aDBgxDHd`s(rC`TAKFY7?tISQm zsqM}6O2y0^G6t}UvAb-6dIpm6lB6Ww)FI z-aZJ}z;NK83NNR`M$+(W(n+8_`62);kBpeCj|%>lVLz*@#_bo-l6<5K8Dz#CaeP-$ z`Ip?QA8*%OerlVS-D%}1?po~cA66VzOl7X(09=82l||DhRn|-(K?3v-se z1X^xE?m*3Ido?KwC!w67V@jXHS!tU#qE&de8tLj;g8E4fz0Lrm4vAXM9UdbDo@}~m?N@8nleb&6P-vUFJgv;hC zl56#WVDysG<%=2j4s#W5tYT2~KzfH_D*bV-Bp-J;>mgP}XX&t?>)a&`s_w<=Rc7eZ z4n2M^nsdFJF;!7j-n}ZV>qR!Fqw6)z0vM!cEe1Gm!`d;!3m~a3$AT}*Q{qHfebnq5 zVaT=8*RKeY@Qm2W=Dxb!cTR*tb^rtgxcV;n-GhtNqD>wV*N6&O zt{z@isb4v%*UI4Tp1^8*nOX*Q96VxJ_2cKYYU@ah0Wl0*trEaQzoSwpYkRX|wclWC zI9-G}@^h3fUjV3Xlz&@3c{oR@M`>RLXoUj;t+I@t11AUM~Y>N6ZN(%H5kCAhr6LKu`dA zZfhu}PT$2wHf)!QVPN;r+nF>lJ2jmU%Vi~ok1(0S9$`8cNXFN?bkQuC!{8uOEhjP< z`8|+c{s5e-&+>-yf>XIR zubwkMY^OXKZA`A)F76{$hxdfh6p*Bjd$@@fsaq&9XX7<^iZZBeY#3&aOfu!JaepKa zkVk7{bAD+6p+fRuI+1|dZ9LhlZhpQy(7Zy+pAtWiqbaWDF@5}*58l>CwOEFjNBR_X!>0mkk{-N<-s3wqDU5E*9s4R^USO9ys2`?I^~rT(kTqDEDeFhVrA z6cQrb2T}I0H2>G4n@7DBN&dt$!NBh#S-z&s8F+K31v1*;HUAu1RR7A;bw_A6nTUy& z>eYTD2&vB!(45?jR)v&%j^y!k;eWE~^VqW!-?@%(NzYT!oZI=-9dF{E%AZk`EJ5ob z6975YbD1XtC0`{#&w){3Sa>!?ds)IZ0 zaCiJw4^j0kwHd=R4bSr!g^-8)P0H)eT^U>1JR+xM>+7-Wa+{vuq!EI-8w_~u?#F8> z&-08Y9{Up4mno-jCibgtPE}K6ZBOYJxym+EVZ0{AqRm7_$&GL97-Jgy^DN7iPvoq{ z{TPTMMQP|09A?xDpyRb8p_b7yRA?a*Tje2NPr3$#OdlzkP1(Ep5?Na3WDZc&D$DQ` zHiZ4q;AhKK{7R3;T1Df3GNKT&o6{v*E*LKJKy3; zqFNp{$oGt^VN7?cK4?rZ(wd_gqjI^ut#9(g{MhQEIPb?1>9v7Kjq8xR>jO_FjQ^kxk~z(Sn(V%$;6cR59Mv*+?^9Y1Ca zXKJ~E`iSpRfXm57ZEi1E{nqNP&g9R*38WuE3te!AAKnj7!jtM;%N<2b@ep@Zti^u5 zGr)g4><3S%H;4be+&fO{NHAzYW}5racMLH^cT+67wG;P6+xnT+NA9Xnw8Yg-Gg4?$ zMkZ*P6d&%{*=%fIak7<%vde5dTrc5L%$C~X?&1ElGP@>Ax|TZNq{qkLLUUu>>vxY* zgkZ>xNqU2lVFc!*Ev?H8m-O(CrLk)Xa+j>G%&(QTCj$Mx`(CxFDxM{<^oL?H?$=l@ zlZJ0B%1mVi!yL>DhR2@ddEBC8u=6iObK?&q^Lm{4%9e8Ps3>lYwK&$6 zmlsRj!fL(5fB(`O-j!nAI8)h{Va)e|Qj8M3&B?8Mcg7yIMZ-!jfBjRKAxHzd?=?vx zm8w1pF{Sui@?pP8T{gAIvqr5TI0NniJsygE%}F>lrIhXG$Yzvh_^$ENLTlCbr^y** z!vDeBTZYB8G;O1U4nFJz_awMOg1aQR1$PJ*f=h7MBoH(>48h%lyF+jY5Zv9};jAHh z@8@~n@4L>A^W*e&CBUp%-D`DKSKTGubryq{6q@%P3z`ze!d#1RLsjp~S`K$hyfn0$DYp$SJlx%*!UBP&yS}IrWV9%3am{fqZ2qRe5%kT%hn!%uj zUtG=J(t?wwcdcCais6&Gzt6NGjd=@qjR)JQ4@>oKR+G(RE8|hd(e2Oac=D9zZu(Y<+%e3i0Z7h z)!OrH<#*uZ-P*VFTdioalDuK)+1Ryz_)1i79+<0cO}_K=SYgQgVYbC*tcXQuIyX2; z`p1o=a7iHLP~8X5vQB2X>$6)StQ}ipd4Xz1I0L^*+cHXY)GBq%W)40LK`N?`zM3*{ z)y~JreC!^IL!lR1;332sg$4!uR0VPwP!PkAFUe_RWaO=`pS>M3P{L)7p0b+vLv!s3fok7PfTP>9jvEO9-YH~yT*m$#9?sV(PT&?l|hjP}q z*AM*#Zo=rsVrlQ&yyvP3nN4GNZufD9gllWp)Baf>%5-Kd{s?H`O|}0kM~|y4V$czb zo;qp5rmpl`879kWlK4scKmECzHv(@#mNzCnn@ zfq1dEboxzn6pw;}SGJyljbj1T&?~6Kya_8pO*feTfck8;IOP}OQ-j%WaGKo2lgZo6VM&RlLn^Yp!j*8@4 zrLv~mf^oMWbP8lMR~1<%9dR>F&(hk1-Oh@b#l|f@oSwM@=N%QDXEZv%qju)kmG{Bf zh8X^v3EBD<9ppp!3@Lj#N{607r^Z3VT&jt(Hy--!*#IihZ`GO}Hm(;hpl=nUW~?K- z8PAw(jl5movM-}sLrvn0e_Ps5QPR=r8~Ywf_uF1XxM`6KMiO7@` z6_F~}HiI52Y_+glkH0S&-`GJr>$nSaTfYBxdtW+@?C*BaAAlv_k7HV4QuiYMf-Mx<-Ueg13mwXTt4dz2yN}s0|6E0$pU$4{eJ9LV+zxPkss zCD3Wy^|X^WyeVEX--bUk<8I7t<@6hGhD@?qv7-)nek-nfKGV#)U~E!M;Cl4vJ$1yQ z<*2$={@IzWsJ@#}{1prmKeiqvnDtU&T2H_@0zc2(tFb8MeZ%yNb3Q(_Hz`U>N4|1Z z#>#i+*3TjJOLM<~M-tBoVUZ+dCcgf`@Q!NW^xW>m#D_S}xSGnDm5Kdu0vadQd~~dbBpyIniR!_fVA(s z$2i8Zd;iJP>@oSTY*y=c%rUiAQ5atph_yD)KN|2R*V<`sM!Cln)ThY?Int{X$HM23 zS=w#JWRzufDk0zI(fe?!;IVD*iStlQQJ>z6VoHlmASllvhAH9icSCd*e|M z(%|b@URw?JRKw?aEe)(3yRtD{KctToWE~=#apg?h^ zPmI@NN*jdjGtHXrR3}^w(*J~?@k;7=xJZ<$=t-^N5sI7&?Vmw<;ERLinPT_r|yRK-!g8$NnB_D3iW*RQXVD&VlwKHB;3B}Khs+0qrONqIS= zWwrtd%2MjXyNhl|*YA!Q6riJl3&BX5k6?5?6jL7Y^k+StY7Ey_8GH^WzH~56EbnJ2 z%%ttJ%026;?yfTlo9kbMar|-|*VCSX_F(GMuc=r&hxTz+08h7YtXvy-SIM-ne>JOr zlV^3gsyl5E2`Cs18+{MukIVROSNPFUSyJ`R6Q)^B#8Mka ze>H9^NXb_>T`D$0b1U_xUp!|~NPTehZyJ6d-8Oc;ABh_PMA1pdTA`&FnvO%%;Y7?@ z6K!LwBX_T({6t7e24|VLkh4E>GxjQHN)WSLZ_F?MS|Qd2l+HQydqdQ2Wz6+Xj@DUq zeaKpECMX2Wl3GeCFn#Ol%#vBTU~hScd03rnA@@K)E6-i6VZXi75JP^;|2w5Z8Pu|t z+s6ED--PMiBA3=_rCb87TwfLNN8Z=#^;o2I4!jC9%c!?fSIlF)X&*ZrYFECX-xUd9lo#DezO{Y`gr?cUL zznZ=8hsN(VbADv$pt&h*osl=?Rp(euAJ*oa8tYb}H^Oy@O+Tzh%%txxavDgAsT0}AUYK{scpK7kYjO1T>F}| zM#u8Ys3`C_bD8&YBp$1KXcB)ogk0WY2auhY(H1I-+mr51HLH&Acih6sn7R50h{yCj zlQpT^4&`_JeI&xURCk8Rdnaca4bR?;Mh)c0PCpUQv5C#Tb!!xQYPosyyFfjW=nOXG z{U^DS6x93|^td={J56Vu(@KyUtq?yt0vgHjT(-bQrb+9-`j@^7^%<0l+FQqdmFGugXU5!BRI|k~dm3Cp zezIMo=WIb3)&c;riFC|K1=-T$+&y@0+nE*qb|ipWVqghK@$FglsrO=@Ijc9^L9 z5662DvkPwN$*m&+g>7dtEoTds3f9TfZ+b3F`R&y)TSp&}J}`Z>P~Qrid&8X$8N56j z9g(Wkx01PYkz{F_&uM9lack(!F#EuKN`-Qb;I`FMs<-=jh_A!lNw_(+a2UTT?)_xS z_%w$*v)Grje%{RQU4Wr1MLhWfyo~<+pG6BOZOy z^T<$dB2~SxQ#&16xi}s4Y?RC`Z6&D3kHi)@?7~hP7`q^;^$i@_3G1nL94B!@9;!{dpr#=`` z%uq4@gl;H`MXFjmNVgiudXCZQ#)0px)HraaR?DRCg;hM$`W}?`nH}?6ts+AMuBqRl zQODVN1#7-xe0HF+p7-!tv;PCFlW~{CyX|C2oz$HsY=}(YC(Rj!S zwM8zlgzoPPE#uE&G21_x@IH(;#uYMZ_h<0Ms5#@A`sPk1^%$U#|LhHEEg}X9%jel^ zpRs78SLhPKI>3$A|>FaExr3y7ii(EYt5rKa`A zH{P1hXrLOp|2S|A^8T?DV7L6e_2>U5f&v5nzwRyi`z2sM{!SSF-t`XZbRZ6NM9sAGTNvq9quflJWxTJ~W^k(%BeXs~4B5SFkjl%5w`Dx{k zeKaDL$#{wXDI}O6+WJqm1=x|cu$I7z1X&F| zUW{vIo%>V3#a`?E{=e1M%+Qd4)9wF9Gj79yot^dHEfQ7vPwEM+5h>ZJ+(hUCKCqPH;;E1_y6}`k%Z3-G1Zy#mWGP; zd+Gwm$2_@#eWgIbmCsv(u&RuIw@7x28ZTGU3mu+tq)Msj8+Ly0AI^0U8Q9oe!nnZu z+Arh?3jDA4-FRZL_=SqY|aouJN@CpbiKyHO_LpXxqGAmyJ+HarbC)^Oeu-A}ZD zOBG-tH#!-K^e&T8AKbW;i5|9(YQB^6{_MG0ov{6WgMrU|lkkG(Rbi9yvx5X1sgI6_ zErZt6(oAYxAveq=M!tb6&iD|4NvRXb-~&~Mi>^0nQOkMy)raC2Ju@T~6zyU7VP$6+ z^`_0HUbv|)H}LCfab-6eV0QU!PgVL)^8s3_2El4Yz($-yi3{QB%kCtS;m1 z9j)ciX|%^8-`_PosgQ8pR5a~qFUl)f&&H+VRAY=bJ@8d)s;`J4&0>C|V4P&y_RBkkO`jFwd;Fzu5Z@_ zxVSov>0w!T-xIfs1@8~kg9KbkO$zmty2ml>ZJp7-U2Ef8IuySB(PaAF6T>`yEVr(| z{DU4<98=+v6?%dBo=gQWb2AX9mpOHz4;$5SZ=t2T{Il(GP{I6RU)ae^gm3<{YCLa4==s$q2uU)Utu%Nu7-A&f1II&%txP^NBA$)2R<&J7h z&I?t^SwkeN6(ty9O;_JjC7>TnZ1(F))A*N0RP=51_m*aP(#S7Uy2s|JmQ%`8-B5blATk@12j=KVZ+K__%q^g5!U2Pz~{8F9C%5mUr z>Q4Kx$j}I$;LW9!9s#XRcCAH3V=(Vjc~0z&wQj%eS1C@N`cIH*(#5n9=0Y&xJoj+# zQ>yTh;UAXF-gbLB%msPN0$eO<8#y+|hXhqu#}-zW0!)(@m^;NfZFd_naDq2Z{Y7X!JprW%aNQfm#F3kp8eJOm+;+*W7o5>QFmmez)MWz#cj%yeXPK@M$q zaJ-UxCnme+9dQfH#_b-)D|au~P*l0Q7#E8&_AGh0EAk1xz4MX5S8?cECW5+Fgop?& zHWeh*yt9+*UBe$jBMv0ll0F*P(E7c=sc6pwlZFXXU8)}u-)&NcHz;+?*{H4+m8+vOEoH(mc`tAc<&OLOW@Nk$WT zU5)T0F7OX}&k$Kv6n?qTf0>k(^J742f;9=EuOt8D{fu{L^RyZXFYPaOF%&Z@7 zeMP@2NQ%WE=KaJ_5hTlc;*SfH9B-#LvMR zAK`mWkJ>kYaz5?6RyJg2CnKfJ?MNG3rGvz-SDA69eO1xBa$*B*wX@DjQ@{a&<|~@q zqy7FinXS~dD~VTyeEwJuDmrB~LCtmMYy$p*DF}qITxz91(mZ5$CRAMt^;HBqC4lp; zo4*CK>R4>?s}JWi$Vrdmt|oVI-l(i#Y9vDQ9puI zEEpiWTQq^)<2y+;E3&oJR&el8uVSjgHYNQb8Wz4ldJ?k;NMUMU(Avk@rhH$0^8K_7 z@7)K?7}r>;Gb4057}NChXZ+XFBAum3%BWwBmUFo3*girAVaV(}T^cL)I?w7Z`(Ptf zauKAEwB1Lu@%+R<$UOu7M(*ocs8-=TLDW30P>vRND>Y9Er^od4gv1cH+8z&EODm|< zgt3Uc&s?f|9$(8P6Ein|1zKRrM%YOypEU1*8bXgx~10(T*1*o&FntDIFq`{ zIR!&YO)%GPw<^)&l~W)Dj5f3z<*&zYCy7&jgulHqpm=(?JTjjrDElaVo&%2v<9%2& zi*po$*z6dz?|o&|U<}{2}i%FJC6|-4VG19krAg zdwxsAv4pin#MXMj0$(U0JGl!Y8F%x_|Hf#6W1U|iI;zI{0Vm1|NY{<~Q_s9t$I zX2tf^>NT@qRgtsDI9|50JA?j|Zg<>-y8YDk)k;BIWVGqd(~^^BYBgrVpW~EF)$XnfGF5U4CRiiqY`J7sYx(Ge>!O_u42^j_!Gjqp*%31~v9{kQedJRo- zs|q9A)y3AWCm8mub##q+O@4`Xg^8AoIlb`4+`l;n(Kqi>_z!is1TGTcV_qnws3LY z{s(stiZ1CME1ber5Y;>!e~4n0rf4avt`%x%(N`S^$}ZENE!I@&OJw)K0g7vG=-qai zd@N)DOIB?3v}9VIe5(~XPey4c?7gbgQDvLJ#Vo*A4aA=XBmZ{yxOLv=YW4~Z#=42f zH6G)rsBP)*uYZs^zPXyH!U{tgu6ZYT!4fXtC;vUGTQ>R>gTYjt)goRRS+kG$rzU?v zGJe?kC~1Mq(Q=ty)8Q{AUfY9 zmD=4WR9Lg$JsGd~{o}b#`CgF|6e=l$0u%L50a0&%ud}bMEKl#bu2ZW(YQ9uZlHX!V|%H~lBr1e%uZ!M_IM6LDi|VCMgC z22pgz-kB+2AIwpC>mtat(&FbUr+7Hq2+@5vJ>tK=!5z=|@wBwC{@q^(sW!f^6q<*B z&MUQHW=N}*Z)LxpRfR;Xf7VasKC_Zf|1}bADY%Oei_Wau@7ed{MTw$XYxY+;9bLFg z_sb<2fu}aFN9McK^>%3j*UHc2bW-`Fi)X>RF2xBnZa&k<`}+D=Pf-o}g){EVaGjTC zrHl2n`jl_@wl*&`XH*7kisCswf`OBmpFhtD^n)Ei_So#tzwAeO3u5-xR@7SDZ|1b0 zH`;y+4!id0-u@_aH9Fw%dzjU+F)>JMzsVITRa;%^3HSLnThp_Iv6zap`H>lnzIgDBR0wVd_PV zi_3IMhy167`a1324WnJk;5wJxO66+_pb#ZcDW-+i&Nwn*t(C=F#Muit>;6*@j|fb7 zO8px7>CZB8l*N!Q8T-}H)!Szvyb+0ualL(mO0({rV5%lt9CZKHK%;pbf{fKi9vL%N z!zAApvxWH=9!}a^Rz^Hfai&zD>c%WS`3VMxNtvyfTLcZ1uTA~@bnIo9)qN+JdHt!8 zCLZ_YD4bxGgF&cF9Dr0d$OD@j%;C5=sB5pSLTcUi;KM#zRE@ zpauPX|Yx#Mezr>Y)Hy@2&q#?$%p3Qna zL;lt3lkiNWu5S! z)+fKQl~CV?A9?e8ZN4JOdR&bhND$+nghnl$P)Kzs?2}KSGaBooi8djhTAJb#ry4v6 zorlO)0=HF!lDwZV??(Dptj_dry;w^&!8}f9OG*C0w6Bn2)7!t$fOa@qMAO zh(|(`7u35Vnu(>dEW`bH`gvwp)nSVThsS>UQ4EG8^_#23oD4xrl|ZBR25M#oa?hh= zyIW7G1a{4JJCA;cL0qGRo2KJ!LH?n3H!>)j3u<^kT#Fmo=YU`{CeBC-LjnGw zcNr2!j9o;9l^RBD)EG1!-jp`{3*PL62x__pK}Swwiwy)2XqkgW?@ zS39PerA({xK=XCYXUZhVG3Icm>q z`vrN2R!E#==;dAO%UJQYu?sLzrVL+|KSC-x#eh3|pSW7|QA*es$8Xn`$YX!`6dFxF z>`|V&z9krzz!+ny@8DJ!E-Ie^cx3L6tMSTyG$r3zA$Xi67!e?-Gv%%MP2mzCfTxjN z_Z7KHQg?G`Vjx7ck9BYDostH7KY7*K*q6-t|7#OAY@<? zlZ3U2n6tw7g^P;a6cB40)9y6rmLMZ+@C4Hjl@w1+Lt8P`OU4Px%ixVL5VL0Ja4up< z2}m*<_<5GSDxAGc+~>Ov5Q)uqiS_TEh+vQRXUWTKx^V--!0yd z*a#xG95h~d_FHHv+FSOmd#7D(DuMQAPr_xqm07uPH9MfU+{ve?}3lJT7R;I3*2uixUN*H!_{1! zFD%`ntH+SsbPkcNovG^~FLupXo2|XZk0ZHRGkWN?U^zfq4AS;aLTAwfCbYMkd?iMp z8O~s3pxS;UQARpU;4Gxu)%8LKq~pCZpwnx8Dhyx56*mJU4bvAGKyUWK@+l~uX{loe{aOmdtn1A)Y57~j-tq!{=wvs#8PQ;`uCK;v z1(T}#yx|mn2*Amp!dgdCo93l1w(!P=8!G5^=L!gTx3|U3N9$2WCA(Lc3WE0pApD}* zfUjH&TK2n@aTmvZ-S1E$w`G!uwX+fJ~$@nkT{2n^ZX0Ems~ zlhvmVBetsj?y$B^`B@}6Lg{LQ$*kREy>u8Uk7LBc z2n0@}#)a+R_UY$vrqW!MR3ETZ1cmZsnHwN!@(0IVW;{6yz`Ax~nT>!3IDHxlIZJQL$ntryLA*r1OU+pY`2f;#qv^#vgZo;yjPUlZd;!52Uk zW(^w!$iiKB34)@oa{JB0<$RP8u#9g{xX2K{=jSIvJWiX~!ZA-TPEtx95J0#wF&@Ce zq~nPtB3adjcwqV%yYgJjJ{(0EZ8;_e-`^L2zQx2GErolguf`vkU9K;9B7ufv4kLx` zjC;!{P%gXFn-P5~W5d0chor+=e;0UQX1_%$kr}9jv&Ax!yZvfdop%Ux%7s#|@tyxT zRZ=pY0+b93xq8-P7y@o=0!X7*Ags1rY~cxZ2%|u;#TG;kYe7P63O@iNiU@ZN0gAWj zAiDSR(krM1(sL=;bg%-3^CeeQ*6mGyjh=nc4ufu=lHtNgc-|=32u)PDOf0*Sp$?(z zyQ4lqg$$jPPDC9((Xcq;4>{v6EF-Weop^`h4>?jSg+~c2UvNJb3RrMWKM)#38gWkD zya_``VNck+k-wayT`@a+DcIz2nQ(YB64!i{LdP>dUvQ8VwFjsgW2(Zm{+FjY{#$}L zkri*x&cQjx^{LlA;PwNg&xkPP&T?D4=(=M=j;u#)MCyG8gu!V#`>2e80`Tl zI{V&1=Yp`Rl7#-Ui#UID5Ih=LPbMucB`p>%ff1U#*Lp02+nihZ-Yc?N*zEKqY+QaW z-Ba<9Pw~{{2Zx74xNII3C`{$>;KFWZXfn^gv}Q2EP|69?ai5yi)$AIcACa=LS=iz; zfPF3UrKGbngp^bl$>DvEI-UcwP;=0(PJ?Z1@gKGS__zr;033LkStnxWP4g6b$mjw= zpmGx?<#qg~LhnfwuJ>petrL@wtPU?3b>s|ni92jR8Si8jV<7vM|LI>xfjvFY4_#dS z%9r#fCDi9ctP}4-I|=;B5qD=Es69RJ#yl?{r{|@pjSaaC3HK+5Db^CqjbTN%Fw!J{ zz8LO*qEnG{fKOPq$JY4`E;4%mFkeABUzuzxs?s|enUio|^3sPE?N`;wEf@Y{H*k+; zn<>fypd6b$)!kZG7mX3N~*TSNzq_XQg~dh2X+qqpXe5hIC`+46Axd2vr=a} z9PNxA1;w%3+w}AdKj|14 zUPKNH=|7SHaLy2pZoRs@^FKX5ADJ4LTZG3z-q9??-01J151z`k*KlG^flzgbA&-#E z)!2GcB$sFh!p?JlY^&cke-;8J=w1*;)# ztJWimEwUp0QB}2)9CFPSa08rPd#(fPW3@jL9mzPA&;A6!9@B@e1k62ZoG2T^RW8=L zhtqhfxD17EJ_tr~BX%%;dTgPoeqi>zwx8hQ#g8uc?C#~iur)$ZNhXN=XdM^RhkY^O zlPd`}((}P^h=!LG{gecu4ok;Mzn>9{(h4f&Q~1F;=@+MBIjpBGLaznE)m9lBZc-3) z_5`6>?y`|U;@HGtHLs+r)f9*SjU7^l0E2EFJHO>gekmN$Joe>QSKAj|Ap)7ZFr*Es zYcZVy-nU)L2lS~8wQGq48ws0&oRt=fXj42NHe51lTdjlTJyFTq2+YH2kD8W_eA3k} zqj9Xlfhxlu8ydz8Y>U?KwXizVk4^SDVDhv{t8#&Y(P^iwpQ)dL{K;d!e4JQH?$ik0 z;P-$pJXk5D`jk&<+zvJjM)H3_F5IIkK#}hu+@xIu>!L?C)`Cdw*N10h+^j(!G5)zJ zewBFWN|pYWn-uw<3@k-(16(To)2#4S9@DwVVYX&ns&Y$QXFEcPNkfR}CzC7ULpdMTqDE*d+`uO3_NuR*A>u57>o{Icm~1`#MQxh zRVobFb15vUD38x?n!Z$kQPZ}KIHiWF^uC2i8JqWzpG6<;S-w4XiIagWqb0T~chA94 znwH_?Vur0KO_=<6DrA^wRgKLZTp8QqYX|TI%5CX@A1VX6OW9K>oFEw)HAax&fT&uit;7~3pP!#W;{ykLXkr`qxNiG?-?J|+mRrS=_#=qT`6b2+9Dym zM`6Wc;12K8RdxhlxRn+pxUL`?8T5S8j&ni?aqjeE?5W?lQx)r-4UURHX~%RNVQJSp zfuw@>i>`*bEymhx5k*cBHjNQh^$|0iSz-{hXOCP4V-s;8P8!Wj%=t-O0L32_*(e%_@7;sR@Yc_1dt+E`O>6`f@ zFQF=g*m>P!FIaQ^}e+Ey@`2D5lw!arMu+x)yyr zDiPA9kw%iIA`0vyFiC&YeljTRe94K=`>9$3ID5QGw?|Fz)1LD9e`c8-m}TYX+5p$^ zjS%8-f6`(`6mB?%L*y(pHt?h1r6a;dG?1-HHf#6sMb}||AK^}UuSFvV6VI!%5s(8@ z3(^jMP?xDcT-i@Br)80WRn?u}XFdEX^-`tHmT3=QZ5>jO{i_20O2Bwjj;d$hYt}?v zz;OtSocXpOPW@-Cgn&RK@aKS|?y;HF62nHqO14{as!+u$hfqz^<#zs&P?TBBmm6KO zx0Ss}h?Y3QC^JmrF&ODzz*Be_SBt*As&7!ZUV4Nesq+1+b9&POo%7k{#-G(2TTQU# zjS1x462eBgVPNhq9Nge^>9wyz4Mhu2>BQPJLx7O@4z8L|50p!F^HIo|rh8~qAAY=N zo40?amPaum{fwNORp}D z^0(EL!S>nUk;N`1uc5#o2ta=g7hwBhkVgj~Hpb1Pyf@CKQ+1`dnT@atTm;yHvrq@S zQJ;kOllp5~QeJ}TcOw5yFJK(ybd|n9){ofpfosX_+!ELtErwP;Yj)@Q=V+a2{%JR{ zc@b7tk?w-C?2i&)%z)8BX+Zt8xbbtC9KbDc!uHlB5$qArU>$_<#Bae?f^Z6y(h0b$ zDzqbPc=08_-Sc+ev3u7?-7T-lZyAxqr;N?n6AUh2LeOS4Euxa9gT)cm`Fr;M&5<#F z0x)27am`wr;-FfcR2g8WF?dsK&uT2h{tO`d z+k@~9T&9;cgO*{bmMMkpj|I{RCtO4D*Pz}08H>bA!&1=ETvI(B>5;rc)GMc^~$LnDe;k~`cK<(c2r$)B8}$gy|#vpnLT{Ytk>E5({=zUAApuGWj+BMW;D zVgD7$4J1bWAYk?YVW3j1l4sC^Ih%Dnu9BY+`Y*F*C*H$I-s4Cl!^kPrjY)2GB-O0L z^KeU2tFma2xxxM#0O~%=3*LqV9Ubtf7A$(5A?|vDDH8NBR^Ol)I;lClU27TUF~8*Z zmTx?~@ekR+0A~FS09cbbJ4O5>q1}_cYFxA^jJb7>FPSXTWe+V@so@lgg%EcXkmHo( zw6vP92JzDwgwk=lCh?UKyEogZk?u?u8&2*ED7zQJMzWW$-!7LiPgYg8m*=fIz*f2z zhOsrFFW|JA##I;c8BOyai4C78ErIz5nE`s3_LdnC-JlLBQun{jsgt3{(5yK`IJVFFY8s4ZYK;{G* z$8JCW(GqIv%3`{@m<234y+2Jh42xQ|AUm4;fCC6Db)`V)fkDj1g*9Hqj?Q z1TzU)H7wqxX$Sr#E>5X{3o+K}q@nCo#Vj{!m(zOV_9!}5WjUaSt?&E#etlLq?Q6n% zz@wftP5XtaX~D!TVbB&`WneeB;dc^ifA1=T0*~KBju=p#8fhT}M$-=gI7Kq|JCpV+ z2vXZs_A`7O){zrSgO=F%47>;7C3dk3Isp890~WDSD4ysiv!(BUnhK*R$*DZB@!ZW5X8qXUw4UQGAeaP zR71BFO8^VF1(5eIJ2a?S>Q-PSU&IH+d6k?^dxNk;*=kxa1$v2_FjBQc?66jJnu-KX0js<)t@rWGKgni|#z1shKQA0wNHxugR)rT= za9Va7_~&l>wj&uHQsjRW#^&Z95@*71ct5lB@M5|ceiF9KqO3lH0#wV(;oy==YH+Jg zzlegB4uKI0oUn<*+lrPr(X| z;LbIo#sb&~1qdh(nlO+HV`1Z&A#=YpuZB znYz6>`T$-nAT^$0#IaHTLs%F!fflN)u}6U-Gf3qBl3BfcqL!l0A46v`n8qWe{q<+~ z1sZ&2P@93D1L71Kng{`7>BI|dNiJeRS}$hUt8GBr4n>^anWMEMDy=aQH=Y9z)}_I3 z^S;u5*L{k|ic=@as=~*v%oA|LU}P=&_G{2U$m93L9`O*5QNLz`M;&CT5D$Rqo=^rM zV)F3RLk`1mT{Du26Z;u^EFDHJYyt|~c#0OnXb6RI0a49T+uwnN-e9cb6D9i?ELmn- zgHQBiK$?JM;k567s?cHjTKk%PQTvyCz;E>>Ccg#%rBD8ibsL8+!v$Pw6!#asR8r8z zS7kyWM_6GUTzcIK2h40M5vy-2Hg-I#kwM0=?~8_7#-`@Cz6gPj;rv1CEapQ9Dl+yP zm3C>QE9}BbJR>=k0g6JWMNJlx3OpI7dm=$C3wta4F9;|vNW+2I1(xj!2a^W(-`S+> zMjYgPymP^}gFk~Xb+82?>GUXrgrRmC7N~v{{E@_nN(F%+2#XfEU(2E__PqIe+Zriz z;TOPGMQg+A`W_Dx_C2*sUQ-L=C+(I5oW$HcjbWnTiNsuBlg+S5Q=@3j*)FHmFVj{H zmz0?Mk7S@?VR?pyrd{y3~fb(L-wy^E_7VP7!<)qjL%g? z2uKP}W5WIQ2wqob-+Gh@2|a{152~~DsIpUFkjGno^!Ec^jYyP0g%*R<7$z`7|4n&} zWFsoxhO0TWW_=on2HGgUvnLe+bp=@AhrUE)reH-L;?==6_)299H^@`Sp;U>0b{<($ z`u$JhWG#Ji_Rc`Wc0O z8U+T1aRIS0AauV!@f#2r3c@O^H2BnoUO-Cw9_ZUB?LU)eTtIG|YNpL>tneEz2x9r8 zu#-m&8_@-ducq(`9%YaxxpHyY3QtF=r{(VuSXkeHz)H!=I7&L2PBw)tc2lY+S(PS% zfTLoK!sGKV0WkgV=f^r~5xG4(Tte`7Kn`txvPe?94F*BY?80&z{n`^WV*D?ga2^e$ z$Ql;{iU}-6?JJ7g&u?TKmVHqfo{PizM~Z^chyXU!_)nkmN2MZ1Ms}BgpVkhbtwD?U zIA$mv8VR>VRk*cC2vW2+qAjft>5k2_? z#$sK{e5H=`jEq+}4L}<_AG3>Cie5ftf04rP0rJU4LeII96dzFrU4OyD)yZ-mhlUv-w3?4+ z?2UmFh>13dnh-Vf2+w`nScRKLMH_F6Z@ zz~?>mOqK9De(5Cm@C3wV-4Iqke>GEUl3&1ZHMR248KyhL@W_2_zuUl55h8XVxOae+ z9Nk>o;`^*>uFW(5`j1#MufZ0!o?Z1vrk4JJ7l0asO45Cabn}#-L4>K%l#k*sW}*$mH)hTIS7qeUr|IX@66xJ>r|iS z@`}RXXU&Z>URj>?X~wR=RC|S$mkV1%UDVf*C`uW|Nw4&zl)aJHCyDgdn%qBw310Ul z72VpfWP&7_6WTAhekG5de?P1M;vH1APOenrS$O*g8@*z5ZVm`!1+n9$>A!+gDV2{B zhQ!+gvEJsrf;{wvyB@iHt*H4Y7l6y1waa#;tJ>kFhzp0YVtrYa|GXobL}-N9s+$GI z!ecnWkmVqBiq$q$PQCH(v?{E!O)WU8Lc?1y4|`K% z07Bn`@64;Lga+|1a-=$g7dA~#=A{MQ+WD>Xh z@CH$*gGH;wPbM#B7Pc2Hh9K+SL)oGA8}e3%!lJ-SdzGJ=HC!eMfC_aT*s2$tUYL9q zZ#|xyo8#Wd%`Z%Z`okDMA#K?qdv|9EKK1Cneu@(fsjs^!|BnUJQ)|H(caIJaU+lt2 z?#QI)#0WDBx}<@mSc}RA4|Z~1*4V3$WF`oNSP3P z)6|az&PY=;nlOK#3`ZU{hq^6sgWc8-uNVqW0DFI+`yhWgW9kfTnlW?g+#X*@XemB5 zcL}-{{g7Zr8TW2->6Npt3Q5%Alq)5NM~zsv>}|)#TbYh3Qa;yhbw1m{vi(t+%a$9j zRPpq~2U$larz3yz2gD5${370mAEXt4itS0rR5|lsLO{vV<`6%?v3yZq4AZ=lTed#v zd``Ii9KltIq;$rQ+D8@u^!852H@}ay9BCS*Y`ZbhYpZ+xgj&{9s}F6HUW`w*zX;yB zIvst#9J9YNGX#L;&+OKkGc7571sXb7i|=jr40q5;Ed}=x!rE`9FVEYg1)FF&T~B0t zKL7t1;6?Ap*yQ;P)U+g)nF(aNEOh$UWl_`*d-?MQ% zcCq;pMz=Ef6}`sH>-J|^nxPZ0XF)^0-J9d&3{QhUC)sU*#yL=Mb7LvBx{PVhhkbvR zJ5@XX=5k_a`uF&O12?bP@8bz6!H=^Mg#|0#%}x8?gsiuRrS41OkR{=IYtL@aR5{8H z#agOJyIn5DHJU!|WuezP_YO-L69%a$uxLXMj4d3#oMTWj{M7LFLb%X-`??)b6s3SD zdRGwoe0-vNut{_FNkRXDdtvIFpg~k&VvMP?#g^im{DNSn=B@SKSe#&R`gc)P!X5m{ za&s$PL+zmGJr7fNmOWv6Jp}JYWHPV(7$z&Y@xJwAg~_mA1nqX0l`9@cXQk3_K8lfg zd&!ZW1mDbhu`FBTsv!e70bs)an zDWK;r&50>#o*24^14FyN1Xj+vn+O#A3_0idJv5<9YRSVdDT6FYso}0iO0K2edr#Uu zHA;A2UvISHv7bx2lo9pt{4YcRI!yy76uXvxHD>QkIjH&S>kD_k?;A`&LXufr6)WU& zkpghQ13DN&npViz+UR`?7t5%}eJl?%){G@V&je#hSw2QNGx{Pua>2Xy0rGA>z){Ip9GmIm&Ht#y>tJ`PL6!lNrJxP@rNoRKQ>Cc%u=Od>bYxtR&)~%ZS&@AQ#c{Ytv~=K-b%r}klCtu|oEo}!h-BqRQSnxp^Ku{h^A$zQ%>>c%MVYhR`~n*Rw}U^V^&Z0MHSc<- z0A(p3nbEqHnQ-VGzBeZRre4xhruGseY*4)`HB<&RfyNbhfPdUaDnA`TigJ6!@NjKp z`dW{P3eCX~o3TWjb5P{^yvmocJGe!1`9kwTt+_p-ycJjHv$dMiSe9<`Cv_E3I2+!! z2ffrKv3tqGmCAOneGRrtqNDBkK8+`^qhpEW-Jxe=Lb(X`1bX{;=S+gKMG^5B7NL@I zMO#zYBVXiFko%stI<{w-12IojP?phIi{!SWW0IOc??!Wz-4DOsow2P8RVBrY$gXHhCE)?tsE$X@v5h1 z_}exz(-mPsDDfscJM_I{E7CTPm=}%iX73i7Z~LkV4+&r<;CLSt(D6B@{IiyNA}e#! z%AIk_ba>JtPy@TI9nV|qyH;F_O4CX~Cbrg!4RMJcNAeT^UdA0 zY$hHpZ{1sTzHhas=QQOPkHmakr5u)AGJcO;t@ zI|CS%#NZGVLrP7ytmnoyJO6gnT(_p%bwzpQ0O8nXj?s<8CMMZFz_au=L)J)ES@`ud zbTyUZZ_3qOO(I{iLn^`LYpLspLfm?1TgbPU0r~@hL)h^#$DDoL88H0!nv=icUn*Ge zBo8W!r~x}IjHUiJP~D;nB`8|h%8Q~cgB!Mls; zQ0w(?)tP#EiOaFkMkky&yx{6Nwk7JPpiMLaa3)_Dc2vTgPvPpAS9?grMl-p<1*?k4 z55M5j)pJ*(wC1k;w?SaVT=7`x`x=z@^}&o#wqr^O2v(M&Hk+FjayO2)6nnv5#(2oj zE65)I+S-VaUSSxm;nx1v}0>@Gi@hn|4TLC`JQ zT427r4i+X#vn*vSpDX85m2v>^7#r&Aq0FIN(REo3hE4f7Eh2RG4Rf)D_FAfXt0Z;f zv&qf<2)yaT`+NH}l&D%{8YK3~il3p%?L@C2YzSgewWq!9_XsJ{fwvdicF$r@uK+0Z zi#B{28B2?H8&^uoD(BtA*7`O!(fPL*KeO1(`<*U(MWF+?c{%a$2LTIxHl~JZ+h`5N z7v=)Y+IPQ|5F_KdkfY#!vT)&OMQ`wq{0#bewO=5qjY-^8k!@HU0NrX;Tf$!r@)T9I z6L9RbTiOOmAMymLw4XR!m(Wlo{_`J@@vp>zNc;QW8h7AM$ZR6Lp7+M)ZXc||nOYtfijj)&e@^_-=l@wp z&`S^WjBS#)KWGu^?F$W8mg{?Jhp?+ke8e5b> zJCttBslq-S+YOXgFL8N02dtXS_c{UxeVpo58kW?GQcM?;9YXqi*A^4d7# z?&L8+`BQ#G7K7P(V(Pdme!`DaXKufu_2cCWW*Fzz4fgGk49(NbllzAQQqB46McIKo58c+tUfqv~x(NCnN6@*H1=%z0-avI}=|y_aeU9 zDHF7v$yieHJYuEO+K{eXNqvKgs?2IA_2Om42weV07e5ChniVJBU#3Qb;JyT%BCr`ObfRPt=d1`!?IZZTS>iQ&(4) zF>}<=Wm}bJ4mvF9_P>uz?H&gapN1qae+lM!{w64Y%O}rbf_riW97!S*WBN%(RG1kX^HxSH;_ymy=N*dh-~9P>my%Eur|!G zWaUa!>-_XkT_h8M;yp|=^2AFj9j=t;=rEInn3u8D2Mz9z7ROXKW`+QdGb{jTR;hPu z%X_HeLhT0B57i`%o*h556(0=Q|A2!YkZP1xe9xq2;;V}mEB0d%tU?x;FNyY6H4y<` zH=UoI+NQhf>fPp?Oh4$-

6@5YR|F=SHHRN?wm0CRDB~6;ZlKs7x8@zC7e+{`%&@ zlxq%Dym3Rp=B1;yrFSw^zTKB@&wEi!_;5dy1r-sgtPTh6n-BI|5r8_ zp((xXoQj|k`Sa17h+gY`kFpk+eZ52Rqd4fK^{w_VStXkb*Ghv2`~5~|5#p?nWoy^s z1OfA-t?dhHb>)Kq=UV3im)gcGZA;ImE^8y-z_;|@O%mpToZlaxO-`0`a#~J!$J&*Z zsg+_w?J&iI-|Z585=2`67;Yit`^5$^HahaCM`CeL*1EtsHbvINt;u~SJ(I7RuYkqA zZfy8i79w2*9u3ck%;2otOP2i*_$J1iX^!~=JZ$VoA0_bsE2YMtu|$Pd3j&hP3I1JbD86D< zg&3q3>`kzBz$sj=(dlfXnbIe!`KE>Sjc9jFM3q!M8}F0HJ{$&x{(cF$L-RG*DnLX6 z@m-g{Pi9@(gFuRG<|q@(FXDA~?4ZUth46hsu*(sJz{Uv62_wO4#pEo|l`O+ai@T2t z(7!YR6L`&XU#XV=6q?+&=$okV$6E0F?C`sMUGw3s7(QG$Tvck%vhOB!aJsow0c}DQ zDYZ`w$Kus@$*Jp%E=EilR*uDK$KIf!o?S=@J@D=^DX1j?cA|>3HkL5A*B$a>KXb-} zqb;tFdA;jNO&!%G=r@@D(!QO%g$uNprb}(!=y;W(YJI+=iearz=+stW9DPz7Rrfi0 zu~&a$43}o2!tL%>BM7~~?4_6C$HsQ*=ePW}V&>@5Nnd(XS(&*JFjl-$BE;;sW!11t zD=W7p{YT&G>3Lfd;`I!^T8nufIwSCbSy4$=fmmLbu+wL6FhQ=~&*r2EC5T;15eEpkXec)vtV0Ji~SC zAjVJ*FRJ%xaQ=>eG_tjxJ&v%IWONiDf$CjEmv%E#e_h%73Q~67B7d%kMrT4{gti{)dsNb z$-QRZr>i?X86<@vfqSrDi&4zz2Mbe#BB#?3K1^>6&3{W%a)>s_u5p3-R9uHQ%cg6p z7E~KK%y@~)-W`Rpsc_y7S>j@7lZcAGN~1gc*}q;+L%cS*wO7In7rxq#nYTlq*oG4k zEoV`y$m&+at?BV_F>*^!p_gr7&aOKq7a$>mI3ta(yI30vXHP4{WL?PKc2jB5rco2l zHl$FIpSwD&)i)YS`?Qf$R|pxm+=sPb$MkP))PlV(>jhe%3mN>0kwRLsty9wEL6&9ALTV<}$ zI(fSgcv1Qa@cK@FBPSj4opf`4JzMcM-`UiEYDy_RCI1#=hj@QN5DutSSC4CpUdVon z;H&SJO~uJl%6T$v_XZg=Y7*lWOSFM;0$)P-06cOf=hNETl0sufx4B>Rws^+pP#NNIJofP6ee!&PPQv{=$izfGDkn66a-^mL&5 zZC8q7;m(B6zx`X^pL>{K090K~41+7oIn6DI?#gyG*yj7V-5+}jv*81u+5Ypd|n`lO(R(x{9|bz${rw7vB(c(7J8Up^D$Plp?|!!`22y^EuLGk}My0hb{+D@e>gOeN z{GZGW`oggDcQgL)f}9WS&i`H188M0ayGg#SUR{sdPQrY6cR9Xxl*92}bG;)`bp8JR zRbUc#?5DslF0CFek0+p2e!Z?ARFFp@shzbl>F}fh9VzBOw1C~Cv+)CTjK-xp2vc7# zCh6R)7%1Y6vsY5U9`w6En7;mPsjx7=AgvUkcfSWVx;$huhrps%;qfwVv)sGwqTqIP z9_E;Wzn6o^nby%ij8^&)UyN&4y|?^%K78YXFKJFr}j%jB?uXl{hc-dTNjrtqz)kuO2CP)+Y_0VcM{E;)( z!I)B6-v0v#Ah}JckHYlEPjX#L!18rfewfCVtQ@-lpc7;SHLsWQ3^?z9+4Q(%0X~lR zj3fb3BF1g+uv;!w1UfnO>@E)5%Shbc_JIwVmJ>{aBlFE!-Gp9t>p3@3E`R-!VxM?M zxiGRuocVpZF`)gS6;(0QJf}SDE}y=|hf&Sau$0QsJ_Y&SA}?z>tmWn$bFMC`eenp- zi);Nv_7G&P*E2GgL4PiVM5W6H_QuGszrw>_@VG$)8H8oj z#k-H=fOD&TDbRS3MUpZt@hgiJtNre&>%Mhg$EJbqxJ3XWlNs4Q zoUsJ|9p1`jvl#eHgra?+udp7kaG^b@U}i+Qs=~!BjebI$h)sfqnaB$LyitNX5J8j6 zsV?h7N<4pErd@#_FY@VUd~55v^Fg`&cVm|gJ=Lmh&gf&7l6HK}&8IlgtyDoF3Oan6Ed)e?6Lr{SHrZBux^BiaWP2>m)9$5+x{IR9J^-KqVFA>SNpmU0H*$cfb>7?k zU;}6*cRb~r`ok)ch<6}l)Jz*=lubdiCZL>PE*hAQlreER z+p)ZqT78-^OSOsq zL|IjA%kEYBevjwT2d8)&Jrkbi*-G}OJwuXbH|tSLWJfP*s%+Nw>bzAr3SyZNEHFmhiD?crpqsv}ruYghiCDMRv3NA+PJccz?gS*q zR?hlqa1uy+h~uEe4eH!Dnj++n;4w#^wjUAJL9r!vq`>D)NEjHc0*_>S_VcdpkniCv zoaAsIHO$)Tnd}L_c=BUi4s7PSjH{lyw|p<4((6;iTUDy>mbUM@Wr`dDl2dFpCT63_ z_Z)_fE-`x%GWj4H5L@>AT=P*_<-LvGib`Fh<(tFp;mSz@v(~PtZ`C)|a@#ToZU(<* zj{S_xsYYbNIXYKb2EweJ0COr;_E3d%sl7g^18f&F8&$i?<(xWOCD5zN&s$f(7y**C z&t?g4HN}uSqRJaK>us3t9oR78vc2MEcpPN2)QVU$=LXS$G){Y%2b=`0^{yx1H_DGm z1%Y=XOcZpg{XEj_Y}C747-laP7&LwgxV^g{^f+`bzW7gE>F+kE6K(&9?#&os&AuL@ zQ3z~#0r@g$v2I@?L6r4a%Cj)m$~@-Ma>Vy?;8Xi4(U@o}Xk}cvGUOY@4SnX$ux0bx zMO2nDw#Il&vS$V!n~ZI5T*x)yVS2npIBUjQUj1D~g38&Iz+7h^R}*thChtH@B2I7f z^=ZV|`_**&&4_U*OtM9urMKDXY$~X_LK7w|;z364bP)~PzqzpVz_^Y(2;3Cs?o99J z;j$wxyPO1AmKz6KGg~{`S#7^*RNXm}Z3BOa;$n77W<5xk3SNxcST49Pgeb!)YXd^D~Z$fJ9kjIYVtk-{>&O<(bc6aL|2F^Hku zME!m=zXk_p7&&L;wVByMCfv&slju>RTOB#ZEM-d&k9kyw!mttgS8Ag?_C^REdNEVo zP_xNduG3#!A1}#HQ|~^G@Idz|Po^MkOf4AesO_X-s_m zoc8;qQj=$l07JR4gO|-e`D|mH%kR!mK^0so3Qdi%kD4P>kGr&2`W#tLkEQX_k{V(U z+UeYUcetbo(ApA;DOVIamu1u?V!cRGc}XfTzozotDeQ2yJq9M3+G6U0-{sfU#W;gK zpd4ht=4;E3^v7nT0U~0$uBqok%38jm`P)Vc$~I{56h+ILtDukX*M|A2+);a?z3!bBy2Y}hk zl3Q(vJJsCa4_#+KiP{*k^nNm|paz!meSKB=;^%KIQONd(XuPTtSKnxE?zj1k zYts6z8P%4QEYllRJg$Sn2Hb~&3a0&><~=!h@eIW@o?%}21l@)dIgo7QS$KH6j< z?za8ioy6?FIwh|?+fvUz(XEosj-EX*w4!XqSMwYpQD_KV_W4|2Jglr(_N-HGH=3|B zI+?@s(Aytc;LBu$01PT)TKh)o2onwmvz(m!P&E$rxoqddW=-^jeT>+vR7IrS>n2W_i2DoYQkwba68Kv6cE>^sJR_}H#bHas!w)NLA= zIoCToTwtP(V84+Rp{+7P0?MJDQ=RQ!3}wIO%-=+$Rqiy*-=2MQl9784Le&_XwqNIn zYfGCBu7l4M^EIx?#fK=W=`EwtNi1p{tW#gzud?T#U}`ea`3=Z%ONB zm>nk=)dQP+o2&geFB*5-U^9=HpK$0BQuT5v2&zX<{d5@9}%V&S!_CyjuA-^kJ-FkKvm5Xc}yz?CKU+-ubu87b_gvgZIh?6e=6EtJoWq(T@=WMkbA-?9?B)5~t zm!_uP%W1H*esRWoK|#B%xF1Fo$B<=aCFrR2Oyp6#+hE^b{91JFq1 zABp$ZSBEHmB74)h(@l$@O`s4bji#^O3Nno@!?aS3QpF{ba?qbY6r;KXmNv{{R&!8b z1iq-zHrpA-=c~CoTsL>OFTf)9Z!$eVl#)O0;R^9TTS0kKQ)_oxKWkRqNLB6t2zhC0 z-Xv?kWYz+E(|3Xu>DAsZ=&eKSvOi|Ct|c()*n6mjDDjWj0tyO8JQ`W2nF*wKs?h`T9*B9&x*|;GyVf03&DM=Kd57j;7j%LTb*aq2Jk?Vl{{K)$N6u z*4v})Ur{X%bBpoT>QWlCwwB=0j4dA6cMvNLwBD%nyt2Fu7FBA>6>h$9;+$Ip{LD0_ z(E9C)P^(1`eK$CLwZzXlvgC!hb!WQNZGjqX_QO)Y*1y+eryCStcCU=&4OtT0R$`A) zWNtQ|R|5Ra+%{e@=&)9l+9?WN3mYXy(%a1^6+uvKh@wwu@IXqaOGN(A*97S;+#Q9dW zu5t8f3~xh)QP|;<2VhqLysO(l!HXi;N(dvdkq)iA=RRTQI5lubM{KJI+LyQzb;cv@ zd9{r43!g;(lO4|weqR2L1fc;!R{s!}rc+^zq1o`IAB35nD8upCi}TD(gsSe0(rBT` zeVGx`gG8md7IlE2E*x*NNp`nGoaJR0y}pdJL#gBeN1h*@VUR#{_NdH;;V+pF{lFX) z41yOGmAvz$X0|a$FmBf4TYi!dAmo3+RG}wb!`}j^QZl<7Ohs(cPSep$oGV_7l9!W0 z*V!4b!t)xZ;}ez+S3Q(dzM5#~ln2M0n+g0hYW5QH(=56}F46AxG9AeM$Jwi(*Ik zs4gfpdF|Cvo?Tday0`j;B`m>VREL@s)gTFl8SZH*x-g%nvWL`Dj z^c7r?BT*7rZUw%lnuBbeb$}&)$nPZ}!zv(*w){_W7Zt-82 z55Rtyu#M@aLoh7aYGm;8KLcKDjSYr^o+V;l!~8-}x*;PPVPCwB@u* zJyjFG@Q8M;1CIuuqp`BSW^%>_b!7%ApOJvEH5~&aX#--n0xBNImP4P^21v&XggK4i6w($Mio5~3+KdJ&H$M)0?uy-Q!Y zr=oBxw=b+tt;+5hf=b}sF)DCXvlr70mSkSMGe}NsPpR!Zzzml52JvZP%U;VDT}0o; zE&<5|hd{TLT;Cr^PTEgwUJ%67w=2RoHT}5%S zKX)L#I)Z%=VzO|;b~QSfyEi2&qw=y39UspOE~d3U#K*t9MP=l&;Rd+i9~4@iPS{R< zfNof=qx_<#*nM1WYG94)yA8v$mcFJpCz;KWJ_!>MfU&yIC+mqbrDTlQYm98%c*f0xMB1}sP5~@C2HL?&355c z$^gjir1mB7l)z(S&85}Wiy+}nt)1KMn*uC%)`Gu)khjS?$Y_GQ{^-WSxUyWab zQ$qMud-I`+$()r|Q!=a%yXX<+Cr6K^Ngq}h)R=y^%2B?$SufJij{H_#B{=Bxy2p5F ze;N7gxLoseO%H@YhAcizr}c?IR;zkyenyQ0fJx4PglID+tQW=bFrJes`%weYJt?4|cD27` za-?q7W(7rHsU8O6AShJ6OZX$B4ng!VGfg46o<&KcB01u1@$eh;UsHIgx1JqBiUNY+ z;x0@e%m3slb;*5~59s-(ud-lsjn|vHj}OaeK{dkFDK$zgZ%EyzFKgD->?lMH6_^LN z9byDDzQ4g`eud^AA_@@RV0y^8?c7!SLXP)+7Cl+3q1psX!Z4{}z;j6KBzG3b0la|$ z@6)EA;SzVQJH=R@uOIDo%UKy{-!?>Tk1}$q$R}DPwg8l4uh)%LO6_0}+8{54lhfa@ zZRqf^jHEUVhoZg`1>{Hx`R}#j;w^b@`zS8Cz6Wc(n>9yZ8OmV)AjtT}z;p8cL?`!x zxqus>hBR|AS0uu<=}##Pn>N5ZMC)q*(M&vi7q|d|UZWhn5^-3MkKJt}Xa%ttK9D@}@>y1Qc z;m~y1qo{C~dc9>%I49~Ql(!tUqJ)J%Zw211e%t*D?`5}swymDcAxVS`t#y?e6So#i z;+(i;Nm!@_H?i;M|b+Y9j-kXWXs8Ez2kGq~Jndks& zVd8F2;fW2Uc{f26oYV9D=8mqw95)BrbLUAc7;xXBFyxiDOSmaYFrul2v;FFjoC2TD zcg!3}SGns`a?%}O=O?X;0Wc(7uNm8VQQCIgGSMU$pOr|UlLi|YU7g85m|SClUfIKk zQk|5TAO5sueg5bnR$@^?+cCWmxHBw)W^!cgCBKesnR|lw{7@ZuMvpxnGY^51J4MU6 z3jM-={A-|!XZOSNtsyDGu51OU)hsy>5Hdf&PGjagH`{HHX_-o?rm!>5M}n8VcVs`M zbGiO{(YViqHT*5Cbm81&Y|BZ1&uc{_bl(v8IwtzeRj+nVP#YqORWAwn<)z~|)=PI0 zdi8-(i9l5M*x5;oLN)K*ugN6I3NCup2-hQ zM{E|XA>I=)&2w{e2|LSb0WIk>XqZfyQdSSvFlJ;%)}~=!dp>1zYiDUcO}`NH72pl% z0o-kG!KL@9Er%?uwOv!>^q1?tX1Ptp6%ryHd(~1grM9a0be~pL93Q^(K*RWOC5Pru z$V*16Bp>Y(9J=k4_GGbg?IJRDrooznw`}i@P9y-XqE&Fo64mOkaHR2S-DIYpGU?Lj z<`oV4GOgf`_18X6ti`&X)tbd`eaKSFGXcqvGVX_#i8UEwN{>OgN-~9!8+S3b-B5#!$ zcvlb6Ozz`|Jf9$g3nLBMPc@KKH8zlv8df?f<>{nJ$~T_JWUQ=l@v0x6ik{Be?xf6>n}y2qmwgs8Fw?K@d@fo8s+2f z5g^yGA?i!@M&!*Fg!sfM8w6#^yLvIH%7fKjO5!8a=31tE*&~xtph?;Cf(*q1)vEhy zHr__#NdLo({lqgyHyBgVmwXLm!WF8LmY;{dH-S6&K0Heh3O z*TmQh?ZmeE;SBdSCEkjzgAYWvj;C1!cxyo5bxnX)6{poVl}@{u@3ioO#BF1hIl#;u zLXo&Jkah_hhpLI^jXN7^xM5H3T5S2ta`ggVkX*RgteMC!f$RO4%F+8%o73sZsil{Y zZEfCq3hVs|UKlm?Oti}&j1A#;F`xZ3p(hF_>;Nci%K3O>3`x`VfJ58Gk4eEY#p2%d z_4EO=8L$?%zo${_w}I?$K}Uv~h5V=-S;z4rN7!SYp3XQF-Fv-_te`QS0|(7q3p)2+ z(}m%ty$%+8S6x;hkN}6!X~r@VM-gQ^npJ7v?tCPW830U{~BLe&Lgr2zL#^)MU{^=pi?DX>P#U# znufqI4JyX0hOtyDer6T4hGC?maCTdHocE8|oShMeCiJu@Q44F$%jlER#xZJS)!8HY zrY>Q03ruXPfUY#H;zM-h^UXjW30{o>dg`r#Yz3H)Pgcu(ilDWy$MhR@J|nM|j0c`W zy;!aA{3aTguIN?|4qY%`DGtRHhgj!?L2rW~7EPVfhj-hFu*2ftK{$Al?>BPuD4Gz% zMnE9^SaE>$WIL$IG$SA6!sFY

&D7XJ2GQoTOW2vM%~7q0KOU|B7}|)wN~I9JZS;4amLPR@IZ$RxY&lzy@FkgmlTeV?zus&6*!M{LQZ}vkaL~yB z(U;>cpSF{+*oI?7o2lPPF`a*i{p9wPoJ+Np1B32mVly*#a&Fa{gPPCWOhwQQ1hw3%__km- z;+p=A z;>}?Jzzu%X7x(fGgYMxX%vi^ydoqASeaBlQ!q$hDev!uehOUKAq6wx4&f%&L2ETDW z#AI-9xZ_LqoRR3w26#n?9Q#&1hiN%^r45@*)E%uiXSQ-g;NnO;i-8G?hZ%ZGcW|T# zg+I4T$zpa5T9C)5h+r( zXK=(Wz(jyr60BdtvP;I1^=zB*zIHB5h#b%*Ct4pKsN)KyK)JKR^F~cFXF@{%;^O`e zG&HJ_{v{}dK*^I6QHr-?KCbkJd__o}xInfZqepTtziYmH%fZ>rQbt|L(m}8xh{d{Q z{B5m*N(@I1pzDSiXYDlJeX3QT&I;p(UN@JXkq^i3P6+Y#;AFXLS)fuCZd`Em@G8sDKW=`dg6qfeA%oP93q!4-nsF8vko{zw-Iw<&caBpxQHr9s4 z&i2z#F0fmY*58bGmiOujHoSPG#T~<@B#)WnOyirUtify46E^zA^g54&t)6R0e8f2_ zR|w8ZoAk*g2J2LB=gCuY`=kEjjZ0+(PWPpg!?;5!`U()~mo$A5wTeN=J*P6y(R^4C z)GguQC9Jaq5q$@ES;!{wWm{=({D>1{Dn927*VSrYZCLvG3wDkz^I^eYaygiiV#>_Q zW8v^fjxoDz4$o(SypEwV1ckKY4v zFA#P9U^_OoqP}JonPEy19C2P6;9ME+_ZJut91Q$rS_tnd$R#@a3vGPdtYcq9`s2=~ z{J!bh@Ca0)V~}I)2REeW9Z5sia-iGmLs8PAa*$V_mvF}xuvt2qoeR};sg7NwiB?7rxKFWh)>9Mg+*SDt7juwt>3uIx*X-4g+|j$iOg0&_Uhnh{M{6*Z z&JSmLu52wAzQ|04BrE;nylz zZBgicV0HRAMA5k{tmXwanKK@A$&(M5wajXz)hXKFQi6Ce z{G&0W2yGYLZ+JL%)@3dhfn7PE_TyL8+MjU zqsucJ1dVQq?Ou&MOe(z?0A&wnoT0(1!(uxa5)D3BwYtQK#ZQ17wxm{fBvYQL(L&Xz zU(JQdRhTN_ZS>2Qr|V&wRFC3hTV@?!IV_j-YBq@`xF0y3F)`e;u&k~DfTNCv}l-Qoy*Le`{` zI?6Au3{q^RYdKF%${6zqd@SZTO)xPaco0FBp;P6Yc#(*Ly`|hd*FL{m8;F%(j$y@6 zxNRqj zaI&e9hS0&=!za{>EbXkzbi>ML`{oJ)p0WAjqx4-X#NvpS2^nB5IWz@W2$K+cx z7t1v+w8=6&H_|c^+1h;GIq^IE=wgu^c0Yc=%5~=gXzjl?wT8m+TqMhXv&H6f*Gh9f zJsgQ6u-M(6!e2_q<5Srh<>RfL7WuXRaXpBMrrpZ?lnAv0xeGL9q;?IMOiIo#FY)%OM{4bDD;?!tRJvokcb}ZrACY8_ zyEkn5_V$*UWE$QMa7SueY|O2NOi)V&h7G3D5&TSTLFxP0Yie70P{=pud4&d|ueI+2 zLx;(*SGz96gSh;A4-(X7bPPX~sugO|n1AgkcUoJ(>{?nEu-$~vcMic4Lz`|cnyV*~ z$H6*tSPS{$^m%l6MG-2iQ4Zs1=CcG)6~j)DM?Q+Rrw#mApkdWDB@n2CHvOKzEkoNp zKeArb8a<+vB}~e)(+)7eSD`pJ8Wn@Q&`ZZZ~#3WW6|DdEgWnL94hI+QK53}z8{pbFw9 zJbd)?m@*t`Gx~(nMGW7}rw(Ka7ku@shf2Cn|CdYn?r3AuA^o&l9vNXQk^cabb_EOc z({L5~-GOA0e*tvIwL?h^a9>+0?LtV^34W^q>Ept*c@|sT=Y~>Pw3WP=onuV&QY(41 ztDQ8&WwONiMedq@T0`_pDD_oiEG2y>cK7oc&=N7rLU7lipaco0I}39!P21AZCcj8{ zV++~YRz6ifempO*3XXuO%5sJ8jnNIC>cUM&WL8k=^{@H`CX6Km{1&beFRfpt1XW?doeDc4~o zt0x!%jQ_UU$B*c59HFwk7Wwpjk?GyCx-21=*j`e-q8+h@`bz0kb}7)aIV)-9%x;(1 zYq&C8+QR<~)gPAT_$bPL)vskr(D=37vn=r#u~p8~shkmSm62} zljnCG;?=W%oO=zx{wLYz-yBQZB1C_QcSl zm8SoRFZA~%^#1>WgZ)2ihd%fF7XFvi=HLB?CH;SDN&bAYN-r@F?Qh`NV@zVPr^)uM zt744uO~M=VrzHwi25s?w>pt&L1pN!ZjX~^V{1Lfw4xUM?;0{V>b1muDs+;=!C&)Ck zYB*WKe>HeuBFvkb;KP_^0rqOr8C$^Dk+@k|spo^eDd%bpD^x_Ft1h zjQY=w|1fUo~|6dt9;j3vKVLn#x zowU?Vk^K1{P_INwvEknz(7*HxN&c_5e>-E?3GLuA6h%)evP2r{61xUqhsqZp}Z+LpVWY%NaW{`l`pSMUEVflZ%E z6xDgGx?H%*S1~yL04c(_e+P$m_kT$1^A4NJowVlwJ}JV$zi*YKp?K$ifBd}xZ3;Jh z`h`pl4GkZ>6crSbj~rYNeGIqLh1Czu&qs0t;&QrO z)_)Sx{BOvlpoy(MLc*Aar@yAZicYNy|9F3IVib4l!2K!^!DWqD_s0-8V&1~|1jPSE zUY}n(gX3lozg-XNd7_)e+ugQuI~VJL{-03_`lRj#o&H9-2SWa*hb~5#nOYjxt&m}| zNYk#%V+6+9-PM`W4-AjHA5_6SjAkfXR75U!&{#V4*^gZd{*0RtDx0jHw{#`?^ zrUAP*TL&$k`ETW{p)rg}y>7DF`_RA&pg$Qtq5TN^-2?Q(fdGV#n=wB)zlSB~C&Wh% zkK_^KO!sRlc5CXaDj825dMYZa#mm2r>9w+}#%A;ijv!X}>v_}P4J9C(o$Q?bWBAr*LuLA9Xc2;v zNV3fdr6Oo;UsEIP6+R2v`z1Xu<02|h(vEEFCgsYu;Bwq_GFaKMBju{O-sQ|6N@m^v zdNTI_9-P}`Z*+dces&$&MZ9}_xUWY%g;Oc;YhOqlY;+SqgGRT zqzK_!ZSO@NU0FBOjrVz5k+1GrGdw_y4Z7{L6~GqrHo^r~_eqRfh7#s8)V_)6b%6lk zpmPK~uFf((*hatD)^u!ns?NFq>AFT%O}x|4C_g`sdJ0jah5F1OIjIP6L;j%xo3NO& z?}gGji?;rRpoWew5p)GcBdXkNy8{nqPi$>nF5$yM!ecm}G`k7PPqwt4k)AeWd5U3h zNLX?5E>sA-!`JpQ5Z7C;HPswdQox@&=1CfefK@o{O(f93{pYSbcwW2 zY>m5mHa2gv7+}bQg+J!fX^KkNl5}_LkG4G0L$@vg*R|A4l1H%pRXYh@L>2q&Nc+ux z(m;QM%vHc&V)5tBds;K)%bUC|)Z*k+vfI%!Gf2?(EKRiHH8{e7{O*eVNmgK`*$w*u zlU4~SH0UQ*)gS!XxkfUFD zE=hZ?;fjEiq5a}zHhZo|*00(9z0JKII*VPb9jX_tK!(h3BSc=KqQqueZJ>KSU#KZ6 z?j1ILX2i(`dQgc3zyq()vq+bWn@tM-S>*iQeNQLx|6?P(m%k;8TpQU8ZfHH~{NzFR?qduk1MnHdT3a)2v-fW3C}p!$TZk2J z<6gieL61^c)Q!7Pg$6p}C@6S_CPruXy1>A#YiR`q1svRzW!x`+noWeXmbUl`W=5L1 zREqGQ)KkI1v}{mQ2wY(`L%R4JoQgRT-;$pe!Tp%Pm+h(^_q7hjS*v>b&PPLa(OUO& zK=PNpeWUQlX6+l5>IOBjnHs z{jhV-JjC6G%$0z9EDJL;Eoht)9E7?W)+&{ze)WXj^Q{z&aapSDKc0&*LB6(r)eO(c z^{D+1r)V=!HuBFh=@%NSnt}~pbSJ$*q)7bw3IcyK6Qa%@(YuSger=Ai$S_39S@1}j zF>T!UIz$#F1_zE*kdt3W+-I8if@RM*o$6CvMo^RemDWj<&%DJpOBOJ;s5BuwJpA;> z`j@8>jwkryDpkA2!T>1wV_QGt)TE|?l5ptzaBO_(C-r}Z??q+Y!-z>+FN2VN$KZaH zXGHs59A85sH~qg{Lf!87?#yIc8cf_vxnrWjO1~J$i0U|fR8#&yCNUy3xa;NY(!yi5 zXmfYi3V(S$-A}@>WtIX~!@mHSLK4*{Pa1~eG_QbI%*5Tf(_x@wHLXQJF z@m+AKTsqpUO;LINKUBSSSX;~YJxq%g*Wyx&ySo>6EAH;@UfjL7I}|AH?(Xgsm*8&6 zn||)S-}m|blPAeZ&e)zaYt~+S_Ui*$>;k}WPd@oSD8mQ%YlC^1SsWOs3U7{sPF>HU z6z+8Z3o;)1GvXNL@`%1pR)T)Pb45c^aSK4>cUD~LAB$|W(1u*%3W(B_RWqnW;ZrNq zI$p0Y5KoFyv(XGNw#z(ETaW&tWauQ;#ZmtEj9uTvy8Rrf&Cz-^P8Rb@$m?)wV>{;_uoR!8wXW1JeWzrVr$BGeS>jk_PCZ z`i2f!QVcp~SGU86-6U_Hq}aN0us05K>0Nl`2_a_;dTdfj?fFn6lS_4+0P=sfY2+6>tcqF!V)8h{dgTzKrjYtK=hb^M*0Z*B^lle194 zm&jVJ^uyH!sAKvyWN<}+m+R>diQB~sq+WIEN`-L?sEZyaCciL69p}X!PT+sNjk+6U z#UT#)Ba|Wl_HXb1{c-?1hpzF*$2J# zt(2P+Z#^XW>iC-84VeXYJ1WHFVe3?2WuT4UhU&)tTbjE79Dq;d{hS0|DkF3F!RwRi zj?MH=L~^S*Q2m?34ke-H_+-cOHM2ygkUM8L@575Q!7xk7NrpwP3 zlNSp)JJxX50K(XU3Uu{|a(w`}57z#@JFg&Us@D>tZMW4E2fX0L5fOodzfni2H=D$J z-2SiE|1~l2M^>V6TCJ70il^C0_5Az0Ilrkeaa2R`keZ#^N0e;$&v8D36PnH9nK1b! zs}m@d-8BZr1kKSr-y|O798DBBgL3^MS(XQa@a23|7A*uHse7F<5AlaC7Eq8f$D8h* zS2=DVC5X*m_pk!Z^JTvlQMpVJICc48aO-zjZum|$PXzvJ83?lG111nYM0_*`9UHjl z|5bG0fGhxZ7eP3ka3XMZPZU3zB}#GL220N%Lw7UiHU8sT4?3oeMzwFrLM+rOY8JDB=jfFvGm zcHm?#`+svRH2{j}6Z1TeZiiy2(_MqRfr`d)h~Hx1PUTpxJk*lMvCY8-C52js*{thO zf95cxL>X9(-6L@=8GgUEyp$L*`W;%x)?q($^FJUm^Nj;E6nd zI4^K=*g0g^07U8~+30e3fX;O{Jmn*DX}tYbkK)CC16q>;&JenIv4A~TXSXJ}Q2!P| zj@q40sXtwEqCqZ4FVELSr96~9DEEJNS7(9aLp2Jec1GI3;{)s#-$A zJE5k5%NzD2VDMn`8y@dcmh{-nS!U^@8qWqMySsDW-k!}i9j2H>GTd!#nT!5kNvTQy>#V+`8-t;ZYe7!DRkw4OBckj;JhrPa#A9f93764$iNMmQIVhL_2fudoiJ#-M-Z-$_JcG(rSp0mZiyuc%Dc|Z{V{7A3?2OBk;TUC%_Jsj%&gO}A#btv zSO|3WySaS6`|TTUexcCnf$O4HYrafOU2Zv8Zuujk(f<($fZj8C>nPA#Z-=ds8cT6|^T+?*1&_zP!l ze=MAl7cMViqjZ7B2iM97`+w>d5>i=h!QG<%o8sYZkE7{*GK%2(LzlGPb1(P(e)PtkX%`Z@5zZ zsv{WN8$(T?kzq)O8+N~!DqEk+;<2by;eTxtJNEA*(Z`oadfO{?^Bx{ozZ+MZ%Y}fu z=a!tIa@jwGSjW6;gS%sZZ4C6r(0+cqdgG2SY0W(*Q_Z;(D|1xap41W@WHD5_T(+94 zpx2%rqitsZgoBELGRmD_3B+{jhaM>%b3Sh zkR>VZqn+7&pv=!y2jeB@WVr%gUrkDN74d83faaPu}EhSOR&FuRssfDLd@XYcc4W3|6 z8?za)@vl>1bdhaQRm)lw0y|L*M$r157+&awj9TbxVcsLQFyr)bx9bv1*P3YU)h1$Q(He0{*jB@5L7i2639`u2=NmpXWb z`77%aFJJErtr)(>iB-LZ zr*2sdAd&fU`+4jL=O*pGDUVHKd!RN!X*)rMj`N$xmL~5OGE|Ny*7#y+VGGLq-mimW zLCG(Nf@ zU5Ler)_7AQueGjg0fm+^2gR6uwQbY(bay9tRfxkG^=wHD454lHpI5Fles6ndP`Da4*NCTeq@Jbqq?zYI;quq1tjb^%a5U?)I45M zKLE?K((FqNkz7)mQnBhP`k<9$RvsGJ66Ju%^;=U(fGyu2H*?>%5Vt4Z$00X;wOIYv zbft@BBuvJ5E?P*4GT}C2y&evT@;d+!)xqh{>vy*xK(9R8kCQ2Zb>=47Y)nYo6a z`xYjV(eQyGxV|!89VI89lW$5tOap1hu9)i*qV;~ULk+bz&OV9|4I*!D<~Vp&JqdHK zT4clj{YR>xg&6w;DXTYRgse&HiLqDts>kaLOzub=OmYUNeQT|dDYCA=C zb#)A-Q!I+P3VrJ(L4I9P{3crFYMYD6B?z%7M%;Ak!$a;86TQw9;i?o_7FCvAiNH)+E5*s}!aA>WTJkj1b)PP-uVC4Mfc9t- zR9^VD`AzoLsb!Id6%1hpj*`OmU=g@4B8&!O%CDAvoT4fmti%gae;<@&s-g3%L1dm5 zohrhq-pe&`@mt{34wS~b8e>I?%bMh^%1~806?|B$RrCLKFSg&M!d?@HUK?1sI2(<- zcHyjiuO|>PoN;B)+eDK&nch_U*op3uK}G$`=-3EzEYQ`25#K!YQ&mLbV}%2r%7~VA z0X1W4pE11$CPLKGetf-~ORLu@0yW>ohaS%f5NOIcWdHQ#@q10x6a~4_K!5gAD& zQzcv}eB|mk7aMrmrQaqA2YnZkGMWOWRY0oYJ$eYd2NdT~e*Ts?a_%VC>i}$*Wk+}v zqG4klQMJPYC1DJ$TQqpk8oWqO6?N%m+AX?vP(OsVTJcx zM8TTYb07X~PqQ(y+dT`L{+NV?r|Iou`SH2~lb=n>E_a^>PqEo`vI5XO63a{(P0F|hJGIQ?a#g*hhf|mOynwU6<4emnAty5J( z!sH`ZS{(xHA#!UQ(tcc%u(c#aW)%HBx_fa4{2~f%eTsK+d3$y1PJoG>Ytl~`kvn-1 z3P!84c}XbxUK!X5CGjc9?!73PY-D+rvvo`r5Pr2yNr&0-{UkyoRYCqqg1?3CFJc+9NF zcZ$2w^yqrieeLY$=sz~mIZ5x5bGV?$M8N4D%6K1+m63>|2a|549zY%$u{?V$qvA5 zJ&8aIfSp3md4C;VQMvTDS44!*!1D+TZ;jG_bK|9+_ak2}dzqi-d+*|~Sx->UH9JnK zKL-Bn&4X~}T9Xj`bMnXzPyGB@VT;9t8@@3T8+2``XW!(w+-;u3zsdG5(BDN*?16MV za9UK+s1ERC#*OIDbY4TjuBivmB~&ccyM};JoR0o{)MMa{qNfeZ;%)>0bFHk_R6B%u zWR)CkHd;dOo@ao|aUQn@q;9DwftX*h84e#Z=OqcQ-F@wkq~Hb0iVMmSN>A+_XEW)@ z$Qb`Do$W;stoH5Ol^B4Okh72bR`>c1awO&=+3a+S3-21y$Jl9`{hdEYh?HVoT9q6N z?cgkKx0+{g<}M_Uue9(PMI&RPu)Cq)>`II2n~zcG{eg1orU5f{vD~phepi$ZR2)`jB99nUyqV$mPno zFUEs>kqA?YPAx%|fP{W^GkJ|UCl2wGa5+5P$X+Ehji6J9hcXxMYtG2VwRe@D66Em$ z{`+V!b19mu>mHGzYieFe#&8!ZCu#v-APv=H>^50+OidVe_(}^tQuwfOzNR{a>*5Kv z3A6G=+^t9hC<(r22kt-3F7FFGpm|$=|2khy%G&aCtc{tWLqY^v5!1|$9U-}-{{TSC zf8fs$=#uue%EY9~P^6>VhmiQN{;Vw0a@3X2V^f1PpAQq{C^(qiTVy)4_mr1WqVWA# zh5C6<`}+yWpCJMca+oov$Y~?{b*UR^t8$*jklRX7y9raKl%&o?s5M5dUT`sgiI#*c zO`L8c;H@9Zlr zw={&J#Wy>)N^Bk33c?iu4b>*~h9mCIWA{hjZ$7oq0{ak(bA>jfyK)Ix{~*$L-cy$I zBb1oRXz;Tz(2=FcJr2bBZk(tA@HF-cU_Qdwl$V?2u*YX`wbAxt+8Q#LJ9zQ6e1ODb zcO~>-t}$92S;hR~A^dfm-WA}^QwESU?vJ;6?3;%%-=rq+MNR)XP$u%tNF&=KucIJn z%quzibHK(VOMDGQ6n%QFMxf6^v?j|3U-=9z_D?KHiB`C-#IiCNQeNA_t()?;?q4mj zeQ}Aw%T5x;RAja7(FX-O4niR|>r3As7N*d%d!2Jnzear5#is;2CPX+_75U`$1s+v$ zro6LDb7lTCgW}n3L_MF_GgpDdHZ1C;sJ1XZL>b6kee(*P@)s)8iB6MA`%ro^^v&=1 z_M7|urGN?VXxnbS!1FErt6Sc%39USw;jF`L%{%zk3gVsgZF@6Qs0IR`oMGT2QS7Bx z$eUb{C89>!B;>YUv}uUo?v%$Qy$$F=s{l(5wP43C|MvqIQ8XQ%yI1{5#_oG~cU11> z7UB=Jdp;C_jByW=!2T?sIDRV%UOkWCEKyP|XOd}9w?Yl&rDl#+QzE53K3%2Q_7k-I zCS2a^-B8@~R)t*U+j^>}&)&|O+gLcha^socstQU}*8^9aKW~%;WFC*@FB+0ZQU-@~ zm=J)3Tm3~CkT3adn4j;uDu-rF1}BQgX)e31uuQW*8U*!JW~^&WXVy=J(S77YC$KfO!{nI&(Qv zH%1MtVPpL3B5!_k%S)GhK~9rTp-Xb!rBSHf+>DD^Up)*7(h+=J*g2FhEDRp?2zyV6 z9zMGoYqtg8^L&227RNiK_54gK*hT8-FnKy<-0?PshUbO(6=QECn$76=cE+V6VQmg_ zWu2|dUt!MR$kCm(U4K)d904&wJ*jp^HvF{cmxmx@3;HK(_gMj2#LIZ=V_WVq1pDs> zmr6AZ@&?8~(b{y`zH=(S9dY2T)va_fn|V+smZpcY=IP_GYEbag=w>r)P`HkavV%B8 z_}k-h3wjO6*(W2rmc>LSsjXyCb{u+9y6^-&CO4}9ukU`5YrbifjwTE!vemlVlAfa< ztnhUCJQVPnfDiGOI;=m)xv|b(&1;ski~K|eYJ{TG3k_s+BW*k4bcwQjh04&3^9VL= zb-7-9&8exgnF92P`Vvo z%t8=4iws-2d=E$D?14kEJtxB9?iX_V`rF**r8E)F+KcV^yx7DZD$fEuT$EUFAM&rzQKX zC}8Wjm229|q0k`mQ$LTk#7b6Amx?bIZ|qIqB~8sEZn&K6m%)O($6qchgx^zA6zBK< z*k8(IZdFq6rCSj)pYY*@bLp=}o5P$5Hl8pszUAYEsrR;dFyj|SAG4z%H6s1=ugP7T zKe6d%jTix5+JQ&Z|FRlE76Dx&*J3Eo)1r+2AmsORbjC`NLjSqT?C)F|cj7#pTCM)P z!621;G#li8yx*i;8$XB?bs5%peOtU?6_^iRoPT*jc}+k2PooNyo4I8G%oS%7@HiVy zO)}&g@?p}Y!p}fc_)>bA92Ym}okac)30oFd`ue#T5@9HT69eKgi_Qi^9QpyQ3>j-a zsLU9s)CNwuVL=Fw<5c?IS{LXcBLg#m$FrvCLwD36D8F6&FZ-LsgaLp|lMmvS{E1bZ!y zMIqp%WO*_quhs$JKLkOqpAs}x=X~QBHfAzH%u zA-Q4aq2lvS@g(lmsB?`xX(4CsLRR4{52C+S_(->(uBc)Tmb^NR9ABDh+5QR9PoA5x zC>53=llyR`bZbbC#BTuhs6N(*xqLMpsDC{0i9AonWGAnso(Y}N^BUOx06rY%@lv)A z{W!jzyE7$KkG@zf$gs1=R~{ay0}c(Bd~rg4WF)rHS*_v7@#Vdx{zXO3NF6EH)GPmW zaZ5G{+Xk{wWq4MQ{^dj*AXE3$dtMv#0mjWqepi*ULG8fg8SkuJY%GmM-( z>bx0gRnVBa-2SMp{#RmWaqZg|rVQV)<&9}fk-&pbZszz%+3_CN6#O`urOAOERs_C0 zM(SipPy$@-Zz`pDa(h23N5jE+-~;lYt>Xh48XYmS?eZ#jNYN*(B@rG|z3nCVy-|3s zPA5%DhLQOMNqTvD!hXH{xR$7PZ{MsdCMJxg5h>qhUia%B+4PK2k z4|<)mhr{B`YpK%ngEpYjE^nnPnip$oLHUzPH7P~zu!bE`vkiq?@4dc0EcB(?-VCO) z{iLDw>5g++BS((AzHjP#jKqpNUCOJ<`|_+`OP@YA-5o61-SUbiZbZlHSUcb{^UM69 zhTT-eU@eH=YP#idF-t(AvG4XC%Bd-8WKK_FIj9Ws-HSDf~6Kih>!^dLL$E@OYgMjdphJmn}r$R zIX862wo*Xu6jY2urkOL?eqR%O5ROMnvIJbF_L^KVvhUqYCxU-geXGPo^>o%mG(sYwQ2JFyc&8kb{_CD|*(vMu%q0c5&L`sL( zXBzm8NhL|9Ke?NYGTj{06=mU{GM=ssFfzlY)Ev{PWr%lX?TPoiyEjISLG92onrKsH z1i19sLUcyXirp)OR!A@i`J5CN?+%Kb80ju8lUCvu1m~EuzCd1kqyW> z(Rs&*xTe?k^LkB0m{6!IYyZjr(}IDeA!L217z2BEJJMk|0K}2(v}0a6g(py@bTrYZ zfsxzGfW@g5qjDGuG9EZyj~diX-Ivf3G)(3X7ii z`COE@{Gqe6Oiu_UGz8bjJ1L+u#1-)3O6n~KgXl{$RWAU#d(hV!3=NQHB4nO5RP==z zhU2~X9MM0%dRBB;B>2=@@f=EiUP(pKycOoU=_)eC*|bFzqt~OYKX&Vyhr({ee5}Z; z?Z~B7UTN{gbKLKimG5WaGHJsI zRUrB7q7H;l3I_diXs$`!?VwYSNWme*HasxlY#=I!=;v2p?depaXeN%h!iG1J| zpY(AOF46IqXN(Iy_Nb%SRIa=pN!SiN_4F?OWAn%K$2m2(+V!Y)ErJe-u0>)X_8T*hVBF0Uk}Q^O`(_rc1Uf z6gFeS1VRq6Xp?Y#nt5}b{|TL5JGra`a8gpaG!%IX_r9o8afa!UsCEP9F@Wtd*RjpQ zrZDgiW`Xfr_S;mfJkDIq8J%}Fw*Hz3uog?aL*UgiDYMbyYvd{mjgRmwwBPllEV`c= zKJ9WWulf2>5V_ag98#M_L1DlWmKIOT4=yB9&1UoZ+kTzcHz$1k=l-v1I`x4IMPhWi z?Xk(s*hD5yBsT5>V)-|LyHrg~7ak^5|J_`Nv*yI+ZNO zEp$VoSfAfgAEs{?8P$q;XAy{4e=E&E|(B-rK^`k=CnHIJgZh-6T z7BrM*jd<+ERk&;ey5|hHO>kTNU<3w}s01p8?T!L=1Q6W21$OQa9xIb2Wz)7c6fof88Xlb+HfnAC(*T0>) zI|_Y<p@UeZ{|N@i=5z79M)gma7kA;7X1+kVP!)vVLD8HdL=oufh#*J)Y*K2IhW~ z7I+XWy?Z`}_Lpd=Na=hfyb~|Exj&;I@;pCBh_*w{o^H!jOK8mN4pJ-z_Ct24tw@^! zKfo6_tuU1*-0@T*d=)Rnw<4jy1ej0H9e(`Q^Rppsp}RrZuOL8Lf$!wq*58)0+$qpc z_~XeRQU$iY@3~@y$eHvXMOI5zJx`cRWDGXdK_Pd_o}5-~Oaottuc zk#GtM!f^^&*HCSH(f9K@=cSy9$#xMJpq+;i(OE?$p3dqJx*I;I{1$v=5GH!{@$ePO zjT#fD&Fpey#f9wU5m*}s@0>l6$8M36u-y4a1G?bd3n3-I>}3cB-SkYUa(Z{JuBm*u zR$pgkDBa$yK8*0ui37^b_JrQ0LG?s*Q4GqZ(90fyAnjG%>Af5)gcu1qJ+h21PzUQG|F5&IK7k#~l5eF9UcLd@j@ zqehIEiy+A3j_*jI;zo)X*to!(Vd)TLsX38G7-$U7Zh&XJjVi+A)w5nTiv*Rc>iGCU zcaaYyd;fHVp!~c~mzVp(jv^yCusylB$*MG-B>lYpjM)&oVxv3tkhOBl$jKZ`P8vqJ z{BnG*cH+RMqNO7|o2#I-=t8(|A2$qj3`uXIx6Sp~J}qGnPJZmg|3myB_jXma*ig4I zhuCBo(e3G>d}05nz8(O`(I6hz?nvTP@V{pofa`1DN%?b|q zsM2|6_e$~lFOVelADYG8-3_!Q5i63Aex^1mYn_wuqk8U?af^B9#uoj2iYV30J*~HZ zn!h<~S%1cMBjyn~c@6p5g#zZ$R$3~+i@{fFwf+fMV%g%@owu89xW75>{wE*2!$eqI1bmT4UO);AgNvi z6D$%=1%fz5`L&Stia4W9w`{WR?usqV@f+fwRW_tAK&Q%~RV#T2P`^EV_ok?JkVIjj z&R~N`%*f7x=>}KKcHaXSQM2-v6l|rNzkGARV8mjI4`M{oaAO#@AiXEWdJgy?9IDVk#HR}g_j!~t}Gb_1D5A` zcOnLo>RAcE{n^MTQl=O#L_$-*If5+X?`5Qvvlh%m^!^$3iWXkomWYf2uQMJTbFATDcb5$5ugPDQ9UV#FGNXD#RIEX=;np-cH|WKSL|xJrOS-N znv`uw(psc6oy^kp`TA}cBODk#=t=0j@ad&R=rh1bROfaxq~+&_8mCFWd(PhCnDn52 z%AB4lsY0qw)+jgO8L{WZbP3{qKyfG!;5`Xh@4Ic_O?h@$^` z#&@lQHWi-f@up8q@{&z_+o^xKA91Aov`Bh3lpSIyZK(q>xpysi8R;kdbP~sp(zwO=YC_0EJ2! zi0ma?)UL~rrHT;`DMmLh?hCaWJiTIu|M_J?Hvd+RUdInTr8mNMXGEMpA=Sf#ob*uF zf+>Z|g=)_-y~%BBf$L8;kSFdNVlPnMG3C=?Yv&?@61aqA`JxFXs#F)smUgPWW@L0e z3|=}d?K*cxM847UV(P@GX4lg~vnK_GC`_5KDatrGp$SYF4nrcZ!%Pj0)Le9-(MZfD zh`d6D9gEOZ0~4GdX&POt%6_~D=@5Yo0OK|z>yv_q0j7(Se2M&4N*l9NoP@7wYzsNe zOLCXM?6ba#{QyczQ;7RwcG&kN~vO}rI07GrMCo?3q*-PWqy^^#ur{& zQ{7Q@Tv)EF&PxnEMSoZ;Xz_nWY^;-OjBO$C%%V^+h%{>Ek)K@Ot5!*~?ZFv{e^DTv ziRI1uHR(YpaPV@QxIZgolJ>E5__>Qo997qw6^TYe8FKt2dcU^*wGr}X8)jnNa=q&! zmrT|1r04{6mifDkbo4J6wl&^&YyrVOrg}@`FJCtx+>+f&;hScs?bU}hJAMqZTq`qU zFw;x!A3{g;b9!mlxC9SWCvG?~UyvJs-HnIe-rD>dt9rP(I=O8C{f45h1D#^aq`21jM zhRq@w;MpFLWxoQ$!M#0QJOe$p=33d2*SF-*WTjCco+H|Se$#!XF|pSjP7J!dyvo+4 z|5wS!FRa%`+800(yWHFpd3^2uy~5*KUvEDgZ}M>1PclU;fIhD7{n*{(A-mMmYL)Tn zNP9@YZ_ZNZ(>7WTXsI7?0&y@j?D<$*8I=_KuLd#_tSa3d!!#PeM7%3&VaM@bxfPrF zd~A?IEYdeJ6fQuCR4VSG1f34Y3YkqrVEzNTU(k({V_v|>q??=t5kr21p0ELf-EDYU zQH!>5QXsq`k;%LuJM3vCLL_Je?VRyE8#vU`idEQ6I%3rO3%2wOQSPXRM=5BA?YAdY z>AHSsNfi6Wt`0vVzy3FRrH$)Nn>h*HIC1wl|8N!1!d@>zLCuN6tV3Hmg*{yasg=5f z2)_Im7LKv*uGWHnh_X|z!su5v(Dzzlo^LQ->po?=3~fwCNcfH_Q|u~B`;bA&MbJD# zy-jS%6J@nwMy|YgRQy$jnk{KRJ$Yo+@gZVLB8`7GTWF|Pk@!Y)1;?f^bo`*6;2WJC z7Fb)?iRUYjs9qO))%-&BGp#0{_`jVXO{{DD4sQqsY5MYj?C*KUU(-fH)!2byTdbWQ ztex<*JLPj$j(YsY;Kq%?!uJT-f9-qzjR}!UX+5ifwM|9K_Uy{Pxu1Rl<>PTR!qnUr z9I5ujVoL1o67)QnJ!L(f+n>eaM0r<&jV)30N*#{%*it1Rq{%aYyIuA^N3!Kol8nPI zY}Ps3+2nj91eG^$Oe`(j`l3yctw#d{_XQB*R&AANh_B79HGLuR_I9xp&^8A6*-Go9ZB*^Ji35pFcdizt^=j&m zw-Pu(amf8HuIt(0rXgQz#IYq8!dfRpIcf7YT})eh#rlCEeZ zl7MU|`RaC2hw@Wlq0v3zGw-e61O zss1v-dV=hAEtxK|(csRrCbhfY+P+z6K+dE(yOk+XZ29+KQ$@rteZh%-N>)w0e2Dr8 zz0UM3)Ath(s^Qx3_1@W;55ZyXF0AN2StJmQ`#hw&9r{ad5gs?8UHWrHgmQ%{%?OPZP9OrLynO_N8 zhh`aGp)OtuDTjG?Wnm4fB6#!-YGY@7KLUz?@}==Ob67Orml~AclxQnBMUl?f&TOfV zo;mSm7ow zi3Owm%T)w(PV@jgo)z9Gtz2IUvx$qHI{l?ui;!U4;xg129ZRH!2%-EkwRC1mEw$eh z|96E26=y7_Nm3HNnpwxRBfYAA+@`eiZH@k&xl zQ3OA8mcli%hN{NHiZ*8@9YbJ)#%24m!DOiTd!qBz%Dkm^_WeFCpbgV!7W4hP7}vbKg&_XaO|w4v&3=BIxJrc%(5f$)+JP0S9~n$jk>KD*%JyZ=z2yIQxYsLFf<7 zui-jLgPRyGZ;&e~gNF1K1A1EW2Z?96e4>Rw1M*~k1FaNM=})XVZdZMxa}zO`%j(Jw zJSp1Ph&l7R>hiOe#KFS}hM7R0+4JJ(w~mwmx&1&)K!fTvcFoVA zzpECMF3lr<$Im+bi~W;=9*)7jF?+tTJ@>WHbF21SC8BeW=+Z~5+S~G;DINscX1*zu zf`^*(^jjz*oTb`#5J2ep{tOeyp1X_!v$d)wkyP(E8{!(P59cF?*?Gs;`WtQC+S#+V z2?QH55k6@$80%3R(;7vHA9tInFF1~257m^evhsFS$X9dsQH00k&&qF2D9_95m)XZq zUlYxY{#eivNu60;wciOOA5g{PI_B%xmUlL3z_3XIgYy@vp7cjdh3?J3y1Nf<8@Vie z7UW+uC5WgCfwMY#Z>dL8&(-He(LTjlqIlS{u5-H|6eZ=f*;tSMN(sRzO{W$t=+?=f z2)M7|XUkS2c|n&KB>F6q*c!V##p8B>w^FkZ4a|xvIpslioiv}nhquS#vZ$^o^%3T) zokb%nVI*mK`Seg2!na+Ywg^Uk{PJV5IR(6q%y6Gw*%0MKhzCOfP*$K7p=a&ZvKqIE zz5lcTw5joStObw1xK7WgfAa)+HzfyGyvHELCfT+y$7e7Nn$<9|o(A~ny_mqAaIkt! zik<&~kJQc6uL+)b0>*v`S-@9M^!gP%HuuhVr1{Ov3ChrmSa;Gb5`}a3m_3mQ8}0aN zR_;CH)sxra6yna1OsC-oI%x%Gk#bYTM{i95LHj6D+kEJx-M`FWLDT0_Y`Sr^MD}hF zjz2D0HcfsLQ|^)0o}{*c=%u5wUjtg$FVxJ&&}iW7yEGj>Yhl@>b+N~Edy6^)1^rMs z(WJhag#7cR=2BhnDn_M@Ch_vf1%_+KTjW@qbwLeO`HJ=5rL-VU_Tb`-l)-|>X}vAE zXz{c1md2PfBYRQ`ftblBpSe|O)#M;IxiHgb9*!Y}CX5*&8w>nuAP|y8eGmg5o=Acp znz(Tni6t>7fvc^akt}pE3hAeMRxk2E31uuZjczZCI&2k9vKTR1(~6{n1|2R!jEXl_ zGF1vAo1&K5a7A@lWfuiZ=IW0wh2qY^sr(z(JPnOb8>X3p_G_wkgsGlygyjer=}zY? z2Ruf%1`_%)h+p9ClU1a`E0ad5^I08Gc|M`Vin(_2 z^GXHs)km2T4GW5vWwCz!vogfUFKXM7zM;2V$uG`ro-V|+2g@Py8a{-eo5iPy?o??+ z{Q5nMm37Hk{MH6Wg)iJX!six;iXo8Zx!>lHEQ>-RHmleg0=Mwky?z2)lQ6$OrRwIt zQ}MdTsUu^t*vXS}L#1^`%T>r*TSV2|;cU{x&-1B{`rMzM;<82BUngem(B9PjCom-S zg_kXG!oAXkJ*D0kj+?lmFXRFv@>R~tOsSupps>pWWb z@*&6b-7drG>=?j|)@gw@Yux$qq+s*~Sgql1k1?#!u(K3mtlbiB!P>*~urps+nh-om5ol#yt^?aZ1mo6T0ZY1h`` z^6P+p1UO((t}@AAm4=<;cN>8?DR`Q}`Uqek;L@7weAv>)z3@afn6akTV&Mj%kpAW3 zas{+0rT;09bFZYz7suZiG8Eo^M z&Z@YQH(~phOMI&^gR538i!wgwu(5gepi0b4JyO+?sqN=Vpkp-G>ej#S`p z2>R~vIH@7(7jD!U@o%H>OWP?CCX*L`M}D3_^<+O|Rj(y+v>;7OxT~&|n4~rJKc{}c z&Vna1=*dW&DghLc)PIppVosrdtfH*T3oPJ)9VF(0sb1%cyQ@^)uZ&C+HE)m8V?;Ii z;<@KqL@Xe5!TYN8T3W=ZAqkpu1qU5fs)-UtjPHf>X~}sjVxCYNvqRAoRqB4TQ6YEp zCTw-9DUx{NT`s+&JC&T6GCKprjZ|=nDfLoE!aOV))(zF3l(3sbv-b8k_(jN<#-=F~ zO{;LE{-A#LYC4Mn_;!Qk5s*JoOvWYqB3*6Tm=i|wp|NYDUpbyvlGWuzRH55n$4Twr z9uGwouh-Q8odO-k^inLFeDZC;js{OQ`mUUFcO1|9yx6rl_?Oq2`$H<0y17x!)9$d& z2Qz?PcyturdwZ3{;5qb+g}uv+fS!>s-YEVjI{hf~nzNv(pNyz%>c$cv$;*NIU*FSu;A)P|LfV`7fd*9wwB@ z>LT~2OuOsrtB{71YgENr_@H0xl) zyR!A9LB4A*$cq*iqITZV?dQ2WGzGw~e!|SD!bdX0zOc1}0_!YmTrm~Lw(o77NgMui z%auyNVSd1`pa!|j)kL2NErAZ2DF)E}@exi0n?jb|B{zz$9TFy_p`r25SFTs@Su`US zqjXkB+-7&^i`G@H-JEIE>d^Y}y>7e0gb@U}qID7P)KGBD4&BC&KYWA@opQw2pz~iM zx`~6NBBkQQv~did&G3i)rb_PUUKDkS+NLZ~iwsyYnPV_EcAv(zJ9f0DrtRW7f8bJ- zs7S~P#9^dNlFyvE&HlMY@3UCK>mjQh1NmO9L7mOX#ww(Ic9r1`aG z!UaMt7o~YTM0-Bw*++Mw;ltuVLB+a+QET0_q+S^{+4i6`CUN=FJSkGP30rO~Q6qN0II*DE4odfJ9 zc^V5*9e8@c^XQ|;^&Uaa+cfNdp>E-pTy6jy2smoXRBp=D(7%yWI>K0WOPbsb)54Bm zM@#dd&MsOEkE~&eqq){6qE<7XLJW4kgvt;YM3Js^D`#3l-#nCNRBm}#sVf4~1m_|A z$x4HWSRDT%@aX`(#To-Cw+*Wd;y`E8`oHIVnS?@)7W?{9qlCJUoT#Y6f3=^2`a5;)@D$ z!I>~a#Nbf#E^GD<*RW~LGo>$4mXPI-lhxr!6{;DHcAcA_%{b z+#|!ZsWWKTNdJ_v)7p_{*}tEAX$jAPSF4vX`VX@wa8$7Rwr|Iwe_``4OD(|p7e~&@ zmRqlQ+|fU%5$AuQkJQH2$x-UYa9SUwwdf&S6TTu`PC`4sr2Ec$y7~^J{*F19l5M{5 z*zoMY=AQo%CdkQ>Hkew!K5RG8iXd(DZLZGn%r}ZQd|AxYkK`2~fH*onTIcuBRo_WZ zS-x1Q)BfFy@qeL<4BZwi-LG7=R$Nj0_ki2cmK1yb2d>O$4u-jp2>)tzNEkl+>4KKQv{qbCQaTd zLuH;oj+^J^jhTcj363ltb>QsX>wrAn`7rD9`97O#`^;N+cBeYsYcKhGtccYytLv<( zy2EC2xB1x_I3LN8mdCwO@>kirM>(NCQR+bQt8g#1=JxW2Top(KQZ!M>jS*E_Y33x^iAtex$0*-Etz-64Tv?R z`?$}FHviKx`&29DuVnln%52Pen;!HyV((eE;Q{qPIofqXJ2GnS^5Ui|nmgi%i*n^7HkCF~dT z-ZTimvzUBuMJjqXEe07qTWq2%V+wSalD!B4=a{0S82Dbt*e8J%Y5Up7(~LV~0rm5L zgZ2-P{3M!ID^|QgzUerGxNV{9 zVoKBxb$i%zLiT3`VMfy9>ixyywSv6;x5h4=!f!-Mf4B>b0N?OHx$i#km#BL?5=S1FAf-Iny<7 z=9Z5QDCfS-tpueK9(qSZ=CjKGU<_JAfvU)?^mIvTH4thWWkp;(yC$>OsTf7mV?f#YH8Q zs}vbZb*99j&G84uW)-gWeikKq$->^-%CD#oLdrl?^MA&o|J@&^h2VcV(t zXHWc>a_iRPSReOGuORjXboFo>=Ork)SzgYXlUSzXO-M%UmC`N~_OZhiMS&7$iKx8C z4U`w@%Mc=#5Y>VRcnOang;72X(|$n?GyzjY{TxrNl@1sXE;3t_fG2u+A0@4&6&G9`SXs)dbGKYvHdi`$^|900YF2^J>3*F~VN4)OlK%o$@ ze66{rciDDM79uQ4fl^WAeIj>|O&T`9fp+4YnNx|=obU49aS?a_e!#iQROAN9O1QA1I|MRF8bJZKHIuc0!>aW}1!Y?uy{}8bXsS z;^Z#3#lsdvH#WvJ_i^2QokdRVj8%^NG(J_p>)6 z%MDNCCYa~Z_q;#akt|jkwwFb%cKXKDya9VbchZc|KamXI8<^K+T7v z;#^K?wv2+YlcLqrUOh{3amxF02>Nzowk-h4+Z;Mwns3^B)r9zjcaYzPkRprN({DfR z<3Yi4=bkv`mv!7y(g`|)4G|jaey2URlJ>uo`;RJtO&n;;jiCqPi=nO2;IstdKW*E8 z*K|lMczaHmMGJF^5ariaN0(pjih7GI;>Tk!PH!>PyayJGu#?#9^3{fJw7pz&DY|z@ zsAjYO?coHUd%npu-`*TL!yk;rMBEcsTtpo&7SkyJ~|KXaaBg$ zkjo@U>WX_*dBy^!@b&qvUC?Lbp6CeU$J(PNbk?N_QemPeVW^o*q>9WF!##F$C$Woh z+!;yB2!*0UZN^yaya=tgUUFZo>gwJdXG7IFHh^2oIHbw9XKh5n$dhLVG{(Tt&Lsbp zN&nMTGcQBMz^hHqb)ViZW+XD!%}7%=e+F5gHw$;)vhU~HVLD8UEZW{R(ojAx*S+#A zf~D3T#!=TY{Yk)@*}N7jSvl-RyN^*mLQx#;Q7fmnvo6BP&Hg7dbP3m8LSQo)MUiZ9By`u&ITFcVe!@){QXwd zKGW>C>aUJv&2`3-X-U{5y3IoX&!vX-sl4{L0DT$$)NkHBIm<4D;g?ize363ji?)KK zKmC1rtroYu-&lwJoRToR>H~#ZQn&qSPX1Dsgo?mjQ&aw5IhjB%MjYG9z&>V`Op3CF zPVC9rL=haXIVplWp_@am5h{I5=4gPcz^n7ci z6_Ih=rIANlPaT-nogaTRxwIp{`jz0k7;LRi`0>5|Ri35xTkn$U5!kG(&3;4x_E>(d zjh36swqa0VVPWz+)UKHhZEQi*?$u5?or7&X?(WWKLM&eO1)ocMl&=xEO0_YA2n6{p zT`;8^UsZxJe>CFj*oTcw!iAFZn8gO~f%A;h~O zN<;dqSXGCuC&G^QMYN3%96t~I(#B6I1I+^B^ANB8Yo+vT5Cz3>op>ZGc0!?qKU|R1 zgIs5bC>wqZbBsw(T|mrm)PU6KU9ybhc=gE|3?xe{4%@8PEqsRKqywd#e{bwDuEQQl zlhm>mEd*_`H~B&SO~6aqn2|AdNqB0481-nKMZ}>dnZYPJ8~{?!!=@CNe2r`K?>`mw zp%u$h9po;Ce;u_7c-&Z%NJRjhb(k>EHb|I&7i&fydctaW=X$4{;1KM-W9iL?=%i6^ zVHPohK+0uEDsO83M=Tw=jL_T#=|f~nJ{8?y1+Iy6JH>gyZ|ana%c1NtdOD4xcJgMA z$Q|%gwPA=QM`N#j5tg?v(B!L%8y7-CFyzlLl*@Kz|LzEr$tsavvX5{$PjUJ#YGvcv zuT5Hx+rKQ?h-Z#1PW|6B+{8i&J`Eo1wQ*DDtw9awhnsko2d^Ux^e zG0M?F3%+Na(%PzeCCTbLRYzXYCp|#=20&t2wfnT|=V_E;Df9Q%51_9330c1|$tx>P zSn%FoJS+G?4%0cZcpl9&cOVxGBkeC$)?tb5AhKA^;5Ly1K=4J%cotl!0{T4*aaXAi zN@5lnhHOA5JV;G|A29so`v6W%&%ZSY7_sRiB(Fb(wDVz+D+0`uOO1_HR(RVWefU9P zY9cb7+_uEOm~&!h zX)U#9AA+s2=F*`K5xdt#j)q`Yyz8CLx*9gO#^XXr@021gU-7lL7Vl>zN4%|xOX-*n zZgTGv!_AoXSl}pU&%DM8s&xHq(x&&28tzu7#~C6jLM>swbk2m`W-^7^LC=9FmOb$g zR{SjATuAUQjLs*WFYu^(qOkPernLF`e|9gLu-V&?aWmO^Dzl%KWr~`0(3r&?MoyTT zrH+qO+oIGo2W3|vOdsflR`YPO7@tMP|MlNErR8ej?qD!hm;MC)@hgPHjt1Lwe=HV3!4f@uloMBOMg>Rav_GjDlvVrso;P4t9KOF#l#dA?wX$IDCbvj66^O=DCvj+Jf;H#juA5C+E=y4q5R}ozaqEjhPU-0RN}x3P>-y}9yw(Zn_j=!TsN}}MKaByq zj(dyiDfJkAwK%chx1>Qh8{6#xHqLdB%Dh$4l+`(kFhjkv3lOXvQQ_GdAGIP&DTk1q zN=6S#{p@uNLa;3hE+-RmP>k>~TL?u%@nLBvGC5yF+;^RLX=wztcU;|OuH0iF>C6S_%U-UF^-u0~m#S4061X#^0UrWm?;Y{)G=(T>sK%sV-4X}eq zP|^M-P&jV|#ZrJ$z|5^aoh5Dc`c4NR3+8tEehM<`8RQ};a1=!?!=Aam2;T#_WuS^= zNdAk6{ZlppV^nl+Pqj?d44WaAujn)b<#DycTManG4a=n`>L@kYhW%zU$!e~B@!TXm ztaQ)-`ZC+IT8;By>u9$obe%6T>{6GTBK^Tw{`ed_8I4(KkOmg%GZY*_tW>Pnbr&I= z+YGATtaFH0BrVL*Y*XyB?vJqi>#=LE4XhlKh0WYZ%ZcD(JdF@?tzj;qeviG;wH^Fo z`(ZaNlgXa^qQj?&fQdj{LfPL7MUALNz)xx5awp--A60y+Ayb)vyb={$bO2Mv!^6T< zv+SR%a=Xk*N26GK{J{H#tj}4uJ@v9efISOjQ}_^L4Q~gzsqQFeMxW_2s4Q&oJHxlVz;w zc}CUFJDC6|&T(qKu{qa?^ZE0Z#KS9-4z8`J_aJ&QdCbd+@RGm8x2*AOA1$Ho&B4GZ zcDnRSu`x3XA3J*M<{>J+t(8E_`?oO~K}k0{U{NG@mMj|{d3{e5 z(sakdI9To3`$yn>WK?hOw-t?H|9uL!B} z9s~ZT0i0UYFHjBEWlm5tti}0u2=RO|kW*Iyk;m`U&KMo6ik~%8>^Xi-oj_O)D%@|# zYB@Ke>wHb|3|l1Bfinw{I0FCn`f5y%%U(-T9@pV%KBQCsKav zSKWHs9E`nR)Sul3{}4euTEb#w=1k}e(>lrZkaeCDU5q2pi~w64S*vx&a_%?W`1()E z74J6x_UPO-WUcurYz|W=>xNByI-aar2THyAs`v=A9>2db0biBwkniZIlGUa``&oqo zcJmU?trBj5A&ZSMCyhIu*5qzePI-9J{?S!G=b~m3U8K6QgkWu|%9LUH;5JNLHvzgyoX~v`AsF+sJRJEN&xwl;g z>}_-rg`(gN|IbzIA@&L7UziNe5n0)BvT{$XB< z|8fD^bf<;4yc+(}oLulokA-!tcjY0wZ57#UdSZEsR=`t+cK=jyQs2a$IZ&Uc=c?r| zoK@7z#ceZR7^x01BFH}1aZf5NEBhT~v>*AD+**>B_j@qZJWVD?zW4rMT~1^;nZQCv z)w#h9l4GRki(Ryl=Gpv4JC4CtPQJEQe_eYVSrRO4vg%QBPSRZ?O?j5F;i!U3V?fbx zd|)1~RW%_Km+jCONf)ZpA;3bYSApauB*rFaLHlB*G1@p87DN|RrRJ~MlB({dLicg} z(nk*aEm@?aA&YWx@gCY8A}#nF%dK}|FWNUAbZy~hQlUReOY2Rk&yzv6f^d?t+6CF# zbzh<2ji8{C-(G?vzL2uxU*#Njmu@s`FA;ifFdX345>nLF%++$ygx5C~(D3H|#VW*) zr9SJWJOud_X9oLAV}PeR|5(*It-4XIvdfr^-Le;Yq&=2`&Q41nO>@;)Lj12ReRx{fLGg({K(ag3!$Y3Z> zTGER`^Qhi0WeKGM2L0AN-Wn0XMQ%YoO%^ZFewPPjm0uqB)kX`9!AEThbrT=KH$CNH z^jk^h{I(JK_qw2#*U9`t?UBFf=-#KfTz<)W>r6ftxPGy9dU^rCR9v7XXO1sIsAN6wrb*o`MHsEV-Vx*B=D>4Wp zXa}w2x5Cv&_16>Y_!VozGQDVc?SB6sh-m<~ zcKLdL3XY*VM+CC1ohcZfi4Ey43h|iKa#nIyDIuMDB^N~jKL($PQ@V4LCnur5l)Ap` zrMu$73;GoU-|))Ir{(ye*hrhOe5u-G<7Hu99>0AeD#?;aF<$ox|83MKKwk28Dpz~m zAfR1Sy+=h3P;@g@BG=?VqA9Fc(~U%RyFK>GV&LfEn3!>G1YwvSUml*hj`?$2SC#c^ zq54$eY&9Me@9cQmZ(;8x;S4waURIPUqvN<&P0(_^O@@8Q1&+L8FwRF=xqG*=m$A?V z#ykt`Wa(rFF>JEV?Js$6iNfVi5-bwdJAWd2={Vj1AjIm=S-{j`j`~_7)~SY$KGw0a zS}i%1wZ&N++BejaEOGDQa^oiR=~~st&Qkt*cjD;Gc z3UQRw8tolwa0)g3HnSk7+JY}>i4ttmuB!HP=nMOlXSJZg0NG>qTC|4UumJgGu`d2S z#LM+IgwuAzdZ}+2ZI4{wA7>QJ*7n3{BJ{tVPtnOT)Q&8jpT^bV0(^!OS6nFpx150f z%(a(`zh}a6)aZZpxT1+8vc9FUL0HNj{{C8#(JBlV;7V6sfes_S0` zyC!0XKu4I8{O~+*wiI|H!dw*%d_d+3>2&mOcb@j1*G=T)TgN4Jg{WzBAVj&Le%$}? z`6gkr+^fT@UkzpAMjF|UM4-=D4BxFZcD6kB>RW*qHb~~gHQHtBIpSn@78-K|y>M`x z?N>G7x>u7iGVM^s+X-~dQN42vBlNU)H%No+mjJ6Zkpj^cCq3B z{7K-Tdq91Ko4507jRFrd1AO`Gdp8 zQGIE5BZ;idntp5Z7DFK!0jLJ6kQ`EW+`ojXA=B`^p5hhuVAxPM-yoFmQCg)on;sfg z8)&2H+f}`Os*m!T2g=_TaV?^uy$(%iQ9iL=f zW4JF&mvp!LPfot_E#_m+X%??5I*pZ<^F)u@2F(SuON$#DYP9&D$CqnNDPY9ltZ?h}g+w_st;^=~%LQtve$69v$NpmDUPe)0IrT$xK)VR# z^(lttw|mb|@7nm?}@(Kwyn zMw$p~gp13>ZL7mz@L{Q|+}y|h6`tAo1!h`ie2@0fI}DeJMLAX7|31BK(+VM;LEBBI#(q3QdWhz=pQq0N53NS zC^ZEypJGa--x@!|z;Du;Wwdlx66s<_lC2pJtYYt!;7qh~uPHpX5^k&cWDEwMqd`A7 z#~x4QbQk8!IjOMA4l4XM{W~zT0-0dkjAGHRb-pKI#FlMsdgQ*u=ZJi>JSJNG z;zBE{+~*?GKyksDR$F=N_j7f&@j}!5v|%8Npf%APoDBkM7`c>q09k&k`0APGVl}lc z{?nYs%;QspbN$lD!Vyu!{8{!!X&GroC->2YPaTD1JtEQkadE~kRHJ=1Zv)4fls{iX zi?mvLkUJ{_jbRcNRL=1_@{JpDn3M>ja#=lP&(y3?FVAvBVd0Z>l#~&m$ug+JGgt2w z4L3GL41YxIZ&LY*T^y=c=wpHQ@T?@*woA7=W`mmO1G4N$p@Pf!Bk%GO&5*{Tn<;F7Tb@K2`pe8A1PDgmEL@bb@ag6?zNAgL@?x9Kn* ztOTPf<;i?k!UU>ekTMqyD8Tu9#{!gj6zzD*vDiwg;g$}Jg`;*n{H6yH+K$Gq1d_V_ z`PfhU6p!c7Ti5w+`sNkntjFcPZ2U_L`;83P=esV&Q)E*VUA8YNzBh^3T0E){$ zZ#CI?)TSNkNb9q_D^{z&dSO7r!d@sw|EzRqHuGrp$G19Yx#?SJYxu7fq;YT#43jf^ zT`qyQ$#tE?fId=Wv5{$HG}y|g#0N8VPW{To&e=nBnv>5z+Dp29#iLBCmSM$O3T4TX zsb|0iv|cRjqBo5V4rL$-1jC;psv>V%QK_DvX^T))!*KMKDhAn#i1UQ znS@Tc#7Ci159*go^=_xsI^Ib949G3Kni0CT3tU%_*0=vS02Q|D@d|@B*AO18vGy#j z^E@6YeCsAghpa=oXS19B*_y_5Qrmu9<~|?bOKs!7D%oHh0W)(XTzFOsztNhb-u+>F zr&vzs_R5~#N!2SPeU5z8aFf7>h_@ms(i%Tst>G>!vRs2oIc6f+P&*GL%@5+G z#Ppd^|Hh7Ohn^9PgITLn;{6j&ls12@fGp;5?+Oo}7NW?nYnbGnJqng|vz&9Q(Y*F- zeHwO9Ed7W*)bIJ&l!Sly&r^4bbCyfme3{jkpo$cDzJ9N14DCr*=HSOGu=1H;a;dqM z(?~&#IhQr^(LPsKR)apuEjB+=nPWou3^wx$Dyx2)?h__y-=)hsrs$%Tfk`~6ewyqE zejUZ3Ms`(lPjVAy|0tDbyFfxeuE-WZ(r)^;qBAw|OZr?eZF;^}aD zA~jS)I}+~=S}_c1i$451Q`&2cP?J99LMonP6uRI(8G=db96pZbs%ifMC-oE|nF7~1 zC4yzoIwEUL^$xe`7ryBhMLp%<_qpIDOQ=E|AY0J%2aatKBsr$qJ}gqEs?WM*O$i1z zWD3DKVcRmBg6o8fHnFy_C|5wGC;90GjhYCI!skPz`pUg*dFX%_39GwTs*7?#$Go!v zh+t;#Po&|&UcUSn&mQ(GD`FG~P1FzmKG{6x)F_+hlIKcN8=FFBqm676tK)h8xSrrr zH6sdvq7Cxjo*THuFU}##W8$w8YOV3{V-}|Lom8$s-*}k6Im>12R{-uYRB7l$OFBEV zGoc>mq6-alcNc;2d6q@WMSBjm*vhwmXL?7Xey4SJ&gwG&LW}Z zD<$59P$(>jN)|psgQ6o|laXmK#BIdpbe+E-<@JvQt7)F{L+W-#6%kK=n>UXF(%rl- zNi`)?hPql}>-7YSbO+J*YYi9~0y*NA=wGmj;ytmSM<-Pq)due)3+eP&z}Av)U0QRP z3-gRxe`leyzO(+B=%=22epJ*6<3OkCcD8tko-^!jgDEzSb7vQ`=8{@hb1*n3W|6X| zAR$9k0;4?wPfor9M?eoOFN`Dk=`@_-%{HCkBm5eHtV8~PT89qnZ({oCzLQf><)sXe z$YRonBL&qM2QtkaTj`uyoWkpNpN%C zFy5yEA03PH6T)QGM$DuNZ$nm*RG=rHuYX<-C)Zm^;@y`OR_N>qO1G;wd{l^uRwr3L z?E6c~%(KGr;k*kpP-9vMEydo&d;?39_2#~hNgs>(#`cKyy9DKL@?3&;-xO>V)*g@rc8H4^Qo@)P>n?&G~Gk8mv3pE8aJ@kf;zcbEuv|n*fNfhfl zC=IgxGRP|@CoQq(&w8-g)!BNZ*m^r`UT!e|w3hq)iyY3=cOxz z;o&=}vYL3JtltHW-_>^7(lMd%kgJ?>;R!9nyiM9s6n!fT!ok8*F_vcIY)CV~GBH^V zz=8D6Ax4amN_C@U(sf(7IZFR1;|{MQ8(J-L7m^X*wzTimEzrXI`xmN~kFt}9I%uw{ z8^dOylZ9`iey=A{SM_=(d}U?hIjiNu=7HNz!X%kF9`7x~`4!L*6sZ=Z*4YszdCEQ} zw!O~h9M##lVbXl-B4brPDOljHCiG#u4#P0Fyq~DBwyPWS-d`Fuwe=s9Ikbx+SEy79 z*vTjaHgsiuf|5|I3b*mGpAx|W-?o%5Jn6;3X&#~gtLg^eOXDo=6L3MvDbdG5(2Y!v z$p~@P)mt*f8H?bDha^V;NUcJ^%8WL}-Y(Zj2R@8%JTqRfc#Z5s`xBId?oO{pK@Q?e z?M`bSB+h^@CULee%nWsNua4>v(^a-6E@`Plo~|wUA2% z>tUY=-tN1E18Rq|AZ8xk2(t;z4_Z41q9#6-LQ$7w%oy~I2yFN*W+Kq3+F}M=mOIr% z8YdJdbRfZR|)xmia09Lwl0s#Yb0!Vak# zoe_mjw$oVKl+j|rQ&kQe1eQBl_P&wT3%-$w%0pqTzjfQ!LN0XqW zo8GQ`qZqFC=pf&f0(+XM%vzD65DA62pVr;95?e5~2v8>f!Z(nhzbi%bASfe-XSS7_ z%k|V|gtNVIZV4IMqmLF}?o3A6Z&#}^BL_XLOp+BD7hfEvu@Xe6U2kbh8Y;5ZN?z=I zMDcj5Vnn?2uH5{>E3~j-jV&h<%!;GhN!F2qdf@)h-FWcEg57GFk-hSxq6YvdhZ-AO zD!>>yD*c*MDw>r&-<%0Cztfbc_h~GLu0EqWE1{+=#`q*z?m7K{JT!2_r>=*mFj- zb9E!R5WtJsFu0}Xu7fjO@*d_T2Ng8l{E4rI5PkR0xb@VnFY20!*MBtXO;jFX59paI*98dfUAq))XsaF4H5R0A8Jwv5=xRY`eVt z$*w5aUiUmNPptPy3JoQMYhQbcwHY((D<59is_2!U7gKfhpo#j?lgn>Ipk^ayB%@@8km+p$6NaSBtJeDX0F~VlZQ5p?(CGx-=A)v-0NQd zoX_+c7hAdR6pwSX!-tSdTPY^^m|-So&&1*nWa&=cOg+4>md_>0#4)RpMTID7sZQ}ji;Q=##5AcQ##GW30C(h$s$i1J3Fp0~`)#brTTBEs{odrT zJmUq+W{^!^2q9L2X{0Pcw((JyGM zy&B97G%`+Pk9 zbd>w?Mv}1`xbCyabr6x^%;i?3wY8c*P_v)-P^r`DZd2SzWegG16`y(vDlCxQkC|!5 zwW=_SUR2nG(QoO9@1mhhhN*U;Jt;nT@)z_g(6eTQ+pou zbsdkAYulx8Tz;d@t2CRs(JxxHh{5zdE#GE&S;R&XeRK~Yj9`AV*;j5dk;Ua}`6a7X zdu`B>6OtGt2L9$+(k~BpOnKNzcWg=w^_^}R(hgPFa43LF?(-?P_Pr0^a(if_BFq~Ra`rpRse&uAs#*(bHgiu%*D_85@jAK>A-h5Ub0lh^p*BTAevoM-I zPv()=w`IkD&S5a1E62e^F%%Gc;}fl-YbU!m;M`c1E;zI=qWUSgQaBs`w|rdb)i(8| z*UU+-l?>^qC`ZQRC#WE8Oj%<6koTG4`MbhE)R;5zyz^y$vey@VI_`lc+$i z@pM3N3mStjefT^Bm0`5)Cv65e6Vt*J7q92J);}+Pc+p<}*_u4pZc*E$v1%LI5*rmMVXN)ad~)F^ zQs1w0$$cRb!duO@FUbXx-sh}jh&>~EvLNK&apN%9eh}WvVqv=5NglI37^QcoxeU=P z+C|RXC>cNmfh)o=?T1P`Qz@w+@xnU1Rg?@gTMz}Fj_MuCRi68fQx>Bkj$E| z(!bmlXfJ>^>^Q~>t~{T%o0ZSS72{>hk8*L=$dS)}ngFiyH;1oZeST3VD>mk5?Q(P8 zvmHM$cnYM+)lNk9dp-ob4#}Kc+dG{i;5M8r@Ofol(j~uu8R^aczl?N6Lh<^&d5K5p zE-RPqhAa=y8%0=X+c0$S*CQL!g`T+KDSQ&Pt=X+VGfxN>=BqPjK2h*7Sfn3G&0`oe+$IH-mr|b)w?4=zMV&)2J_)2c!^ zwr1c0rSyJ%7c(k5h0&-k^UG5qP@v=(6=V=7RGa#wQRbvvoayzG6P%m<@&13_Y0@AJ z>5%}p=Ibu{;K_h_=8*&(^L4^6&X1c=yMM-3m|3vpoT2_tPWLYp9h~cplK-!}=>PO= z0=aBeto|Lz1mh+c`K0ncns9VlgZ)D{vvP-3!Zvso#k-J5Q0R-F>1kaAyHEftIQG5` zo-Qnz{BnzD7Bq%O1^4+F$t%-g6jfRhI&nVsg~vzi%4)PxT6P3K|4MI}xEB4nl%Fw* zc;o-KiWX@7-yaSzhRu(7Q%qG7>GYFqsWGumS9hS$s7TfmP@Id-q?HjppI`a}^$09% z`p9rUwL!dcaf(%j=TU4jt;yoex*@|= zhDGQdPtNEwgw|ThrhB2h8B!PjGSIlX!H5;=F8bbbt;stmlg)Bg8nm(YD*17`WDiy( zx!Bp5RFG+$ay&R=yiPXgLc8A$r#yuC?~(#>pn>f7T$F9NK&rLm)0K{%XeXsF@Wkx; z_-?+8o7=^P*HAVZH*R2q@C{LwQt3@dHsJ2sullE6gG0@^1M^i_*A556^ z@?H78rz1EkLsg2>{fY)FP#y5y>+eZH-dB=W)gzb^4cIDf-!k}yV_nnRr&>&HrHf&~ z%2-np`I8z*)z_%v=71`@9+l91mP`IbWExBe(&u z)xdn{xQ{wros;X&AKgh;YK1fR-4^!x6HLs3$``j5o%h>PWXwtDYP~j#{g%+=5oGb2 zu65%ONECMM1K10dgW6LNR)!%EkHt)fIl44)hJs=xcgBC){466=>&vps@NXE1@COUo z-p&nocHE6Ah)DWLV_%=A{rXq}vHP~ap6@VRY^1-k9Pi4GE#DkCeMD8Y39 zgFJ+lkDKm#%In~NM`0W%X$IN5v&1E!T@ijGP5Fy2V_-LZf;=#52$kPK{5u|0@w$W5 zGKMjNcO?1nbv0FtmZ|Mh=K-yH9cfzJ;T{Zc@_U5aEL8vttynJ?@(I@4{MFayN}^R7nSMCBDKd-T`b21)mT9?;g`Z-cb?FrhDJRQ-b5lkrwvQ|4LKWjOU9avNuL(FSA zm39vXEI5Xt2K{Gpg-OZrF2j3)Ik$QC1uJK~hu>Ogjn2-h+6B#^GRC*` z?>Ei}*A@P^t32x}X8*>^N#1{AGfvs?_OnlChugLJ(_%&V^SW5G`ENfz7$H!%pgRbP z$j)ZhO^*k>cY>Ax=t~CUI1N#qc^T626f=e0ZV&kXT_v3Fn80Wp|Xv)$=;1d~iwONl%{R6Z>%i|x}8p9{|`f?aHb3=w+l(8$Ve!+ye z34ensItqKP@6DtLkA*npYUF~u_E?cJ?{e92`$I)#{`Hp}@Q?&+*glW3SUTUc2nqy` zk|kU-NM12B&5)xgECxq|r1mpWB)cchm}}%{T1Li+L~+elED(QK?ErK2oLxVn5EvVn zK&R~9$BY@y&K^x4kpqbM?ADk0O?>tq9P(|1BM+!vzqm`^di*Pd z(_?k2(uKa7R}Dn1v3{g}j##G9;KLASEH^ud#y)`7g)oJy>Iwig7YFr-bZ2Wg6C;u_802W7kc?cBDz3eb=lXP9Ys=f_EXpyw@J}qq# zLopP*FjkIt=7a!2<>?MU$qoP_g9a$@1Q%~BD{tRN*d=1Cse8EI9&cc4%$Ox~%BSj2 zHE0kREdT7W{@VQtwf2BNu*v>>9`a8ZRy|iN`M90Bxd$yaXGcfZ-Tvq{F`r^KL{t5E zLwMWxiJiGDRoyEnxw$tH4Z$z~d{+Hf0!nhF2wI{MjQ#qyGAKxVc5p=;-5Z2ev>MiW z+zm)7jfWH{x^G0B0$rGFvcGJa-_<;9Z2|M7(43N zhW{FyIx0}#)*muQ_B27{YWl0ONwK8q6ik4TzBC>J6Xq6_-wGD}?+pZ>fb`{BXVh#i zTLr_P=_t&i{ge%n{>jqoA{A!`044zRu^+Hf*sWS`(PLLS2o=uXgl>tTXt3&@+@~Rb zi}(B78e6$-$=qgPeX?Iv5xli&(*N%?;(+@q2`Z%i zN}(e>)u3kg2V`Bt$IIi{d_Bb5akk|+q2)AWPk{-6Z+(C{XbXioy8A&n2@163RpCkO zd$Tb0YZQ8zN#H5Q4aS!?={;rZW5*=L`MU%Ik^dIp>g%O9oTkA3)sDi)eYe09Xr=wN zrDTeC3&faeWNJF}CEy$4-^iR2Au%KxdA3j&dD+>tD$DeyCi&HgmH3OMwT-O9H`n&! zclP3q4TE;CNmn<(c~;Rz)0$~|QEg;;u!c3;0uGxy6z0B!63$PdnA|-?U&j>ODPpK! zoN!cOGmp2|Bcv?1nU^j;mkiDV*{4o3PCv81N6lvf@#`n}9FO_72p09PR0Ln6UHsVt z1gF}XwDbDoks0(m{w$paa2;JHjYwzk5Zx< z=tBgHxRxr$q;LV#RW3& z3B|-SdZ*fV?F>HmB)dPDgb$Y%8IrEReAcKt2MCT8rPto|BVqBqqZvGx154R4ua3K) zb%-WHeU$v-D;q+3>nxZ}K32@N$9KiCxHc5#s2MRVzwrIX;68S3R1Vu4yY-mv$L_sR z6ak1I$(1*|l{1JjalDYqXuERE=z;wy1V~p9QFSqSIn2Wu>>lhTYsOser+URN@8j^*CR>(V?h-3XXsXAI zCvUo7pH|E5g*qIW8Xk2h%oxrJ+uJjOK8OYT=QewF+cR5QxI}hP{WinLQ%w$3v)`DK zp4=y!8uuPysdSU3@-l3)UgkLtHH&S_;{W{ftcMY3Rd`;`y`8iEC0TmLJwJ%=MaUP_h87D!Wjx!&Ti6?Rd-UFLo8ffQY=+y}7rZNH4FVZ`;F+ z%3I5FF1GYe=Nv594Bs%|Z}&h?xF15l2e_U7G;6kaKeKdVBdMsWJnc&gj_9^WYSo)L zKHnUK;-mfN{I~@QC3Bh?3o~s~!Yva_I?|xa3IFpEul-uJwf1-c`K0-mAF{43Uu88e zTNJ;wCUfDII~g%jDtc8n{}4q6gh$(K{9UXh-q8suwr_Sm-?Ik2r=LCkRDM_j49`94 z`Z&U^&HBl}cGDKG^PfyaZFKn3!4=VAG5S!_vwZ)bRf^9o#M+N)GW3hgGZKCqnE#A5 z!NTQ>3#V7ai8#>Pn)Q*Z^&vX<@@oS_f`g zN4(-o5Q9LVXU<7a9;Vb?Dh8U*+dGdP>6d(uq>GhWLG0iC+J@qBg8jfhBzP#uQOx}@ z4e0&*$%>7;Aw9H5Dp#d&hkS_p!QlI6IW2Dsr=36N0rKr02UlQs zx3~EQs2$g+j~j9a#EvtnoU=}7vHm^bhxctAf*U`lpDY{QF9KV{8=(m<-tJ@D4~Aab zw{I)y^4{ma%?+Ks6Jm<|`c844pnvuHWOkzPmuW7&z0PBBFLD&ADn&NCwbNf%s(pibfjyeL!ca|7VzT zc6Y^J&KaMOHpW7dogM0SQUN=%lik2ASAv7Y%Y~c2+d5d3OncD_45h|a1dYyHM=F8TZC zUH{xvK`{r^(`zv?4ZGMKe*Y+84ueGT_5Y*lE1=?9mUammAXsoG!QFju0>KIH?(PnQ zySoz{g1fuByL)hVdvoqd?)@KY4SO%x(_Oo}x~i+{>#DrMd^uos3gNo}ceZSD?PGE4 zeRc$KJ@!jYEYg3vvm#WD0*p8l`tT2ksjakJ!q6_t*QlnWx`zbZAicr6^Km3#&{()R zk*5_bGseX^X1OFf62ebCEwmj2`Z!`2XrBFALK!%J1rc znKi5t17e;E@0*mffiWZ7*t*rBGOY!Hf2X2gAR-lp)=piljoOQ1@%%Wq9k`elBZ0?> zNqp(;l1PR?ij&T>F>nDMe{*kN|NQxYPUIt^_R-Ic%{@O}=>Q+qOOVIp5wIT)Jv_nc ze64vuSnrETXIIIJ{8~|xW$O6&M9m{vXkhFR6E@FmEJA{hS5dap@_q+M@)fYFW`3-h z0DRj{=VVM$ZuAJl|5vsCyAFc~xidZ^36pg(ZHQ0lct%S=^A#WElY=7{WcQC$cvSHv zWyKBp`V8Ij7<)|sU7%y3zrNyexKJO~*R83oIy<<33qRZ|f#F$nY{I99*p&u3> z)7V|~wV}>x2-dkAk`J_BIJ0GgM+2|{kCy{gOP>d5Di~fS#Cehbvy=MsD}`6hOu&H2 zXvKx*9bDA>8P+aEUP{xWIX{i$>y5uusdN(3+9_@+n>_oz$ukNn~2ahP-QI8Hnh_v(&B3@ac_-C3s!mOEQen2tu_)ozHF%0&aBQKBh{JX5q?gm!&_U zo*Y#kgjigqJt*0$!fo zD}l>T_q+R(a`0c}(FrF&1zJNI!oExyeVJk#du{qbb4imdt`zY9k+>QI5`%wQL4_yW zb z`9qduh~c3glN9oaRUr>xrtMF2F)0PT5P!KECk!eKR(AUDH-7&2KYt!TX+jhS{8P~B z$VA@@3&ZB^KRg*X>ob{7J(q?_zh`LTDj#gQeF8k6ehAmCa2;r6%iB2bu^*Q(CUR?k z)$AFF#r@)ukMJJeCk#C;S7{^sFH!I%I>`Ezu`DJUGWw&IrJuSzDZ{ zdo1&BF3T*2eBp0l9(D5t&h~>`?DBV@8wm4mdrbjxgMHtJM~n}H&ma#0dj$n`VVUa; zuSV2jl$2<+BfYG~=@}X~a`FcSP1N2fjJh)7Ux2QNu81=nYw(k^E~(HmU_b^*58nth zWoYW8JRL&bZRobyS*NWiNgHHaCA%;tu?SYRXYL}iE8S5ixmEzwF=Pu)dEpV*hUh}a8a8phI|_A-)nI8Hyysi#VQ!1kjXMgYLYW?dmgS;f);&A$ zzJ21uzIaM>j(UXj2{ZQTgzd60_wkpbez~HT3>i{|rgs5iYVi}(c~yk>4QxN`y|zsv zUA@Ri;YA|AcWT!*W>9zn3G{U|>|+y>gtk0JINXt@mmE^{X|>$w0zY%$01n$c4Qr!U<_YA>yHtv#Dujp7>!pV7xi4bZ)h${`g zBy!_ozxfJMTcDn5=3#M4P@14SO`+{(mO6%BFdqh&t_ZQt=*H}GSEBcNn zWg7hhyp5@?Sg?{Ag%ev5DwIP6totxri#69o?y2DZ-Y-GdDyb|^Cl=gZ@%VM9$~2V~ zHsN9btQDu|d5CA1x3b6|VlrbVz#5!|BX?Ijd1&Imw01-%tBry6n%pOwyg;5XrOVyK zy+*w~YRRhyu%{NBheP^Exfy1ruAFThR(GZK5&1M`(K|6=VJj3iHqWi|i`4d^d+i5s zLeCF0^|v0E`Nm5(kq>Khe`M#3SO|=r`!R3Vh;;@zi#2vs0#}fckw~k;S&0!aG~!l* zJhh55g3PR;EMi|`b9lV*jwozmER+4$mJcA*dOkjv0|u9!K6ih^eDVEw2hFn@Yas&8 zcYu?U);)UFcE{$!FDFI0x#P|RCahhiB9BwBXC7U-u(Q1oDNYVrFx^%uQJ1$l5h`F^ zR9-w2TY)g&)P`2ybp`7TcGZtYTYN+6X`56(7iopdD{GwMlE^wC_&(r2 zJKEqU44(0t#2?R!3GQFMveDOkJ}T8W9*g)CkY+o;Ns zxvEeHsaqd5rW}h1eV5RXI`*ja(Y5#&VJn9&4i)aDKhbR_f=43>?NbT|d^w1QM=Q+v z;Hc2h8D-zMS6Zpr2Op>a3v5X)u;7|l#pY1QA^r*MU(3*1>?<~V;m&x{f@8)P!WQxE zEgY#u3_ndbc!zO&cC8kB4+zG{Oq)e7O`A7X06fYqQX8t}cj+2_rkw0Ew=vFh-R!XT0Xm! zO#Ar+bdTY>x->C2zl1G?nm^+3wtEp6`LZn3A&@dVvR4*%fr-))uFLgK=b31i4PgUn z^ZmDlF9<5ODuF63@&I0-CH{bij#JrYi0IW|bs89|lQM4<@MpB7J=T3T>g)y^L}>8f zXMp_P7bF2vLRDvq08uK;^`s?tR`U=itbERc{H#zdsEtY zk07(+jPy%`KRKZ!F6Ydx9xiu1VLoT__rqLVF)p?rEgz27K2#dTWetC~CEI>(E?V^T ze){~E?*^$x1eo;p+c{U zJ4}%_(|NZs`(witIh0vfX2j@vpEZ6oXndn>Y{a^5^Df}axZqI^Y3qBo-W6GTilv^Z z7+tX=D+``!&h^<>5yF0i18cnjYi@?vq|4q5ILts4guJn;ZxEKm$u?Z2-afim-Vk54 z)VO_-4}SifSm@ehf8wEM!KGhcM-0R-rQp zLyI9?j>Ml)ze1_je{lz`VA5*pI&utY)`yS5u#|lLiv`H%%!>?_zsuqtEB8Z~%{=T{ z!42dP1k55emS43pEN7_9oH~?7G@pmyW zt}arsG9qfLc3?zJ*;-uQ2bAL$JbejIObU+mSc(g4?AYH+<{?c30Jq<9#yVEVG7+i! z&R2T-AA9bY``rCOZ^ll&BtIiiD8Q1OnKZHwW2cuX54^Q@Ex!UcsMxMaVrqrEL`2)QDx)>wj3?CDG6n;PMnm&iHPW8u1`} zoDkHd-WGIza<$3MJxEVQ!an3XH6w5uVl=FMwdr*(WI-J+awVrsL*C)W{)|Luu#j_K zwKsf|Np$;+D7VGq}0I6F2IQ`M*4N!_d|qD)=o2-?gWc&w*`I%ibYZ5hA2p9biN`!p_d$sd3v~+ znQ6gPXV%&!JAw>VW+M9IeiNZHuuqm&c%ZNw{=YhfM42f|B3E z)llrB(Wz~7EE?5vS8p+j;5Hnf`n-h;qB6+UB9Om&Ts)z5zOuTS;5z^by%UUm;cH#97onUEG)^2g&o8$~^$oyiKL;n`MAgK^0=m#DbzoZVYBw92T|9)KbJHfM zRE6gK5A?1CGX`AGPVJ+cqNh(x4j+~SuNBVL$C_lZvs90Xc!?t(ySS**aEbv*6GGRb zrzF$g_AU{*UJ*kvxeo8$FYll)^t&=+{mtt`@;E`UT*r%LnY-!^=J2(Iu_tth{Pi@o zA}$y2Ck#Rv&%ET)uJi1c$m><0!cL^h(CA2hr)d`+({DTXqGG^zPjl}Hk5(6hZ*j+S zAl83-pcqS{$=f%q;hhU){rvOR03IO$#wH8?YANay{Ec*Tl#<-^K_t+spE+Wpe9F!L zz)LHL+@Pz@05)yLBH8alDsF1An>{^(v4qQ$-(w!4()4e0{b!jwxkHF&Uk!p$dmRL5 z6RV=#rp!l@h%$Mq$z=2d+efGI&^-4f_6X@K=O!~*I~qDXCOeu_ND(~0E!JDoXsQFwrZHZ9h@f@q zRbl!w7&4^^b-EK!O5mbGJ}G}zaKET^*EQ_tXO`z~Z4Fzt^{d(PcWbp;SW-ac5LOr(3s|T zc-ds##1PQHn&km`6?*5q> zQa(_nKQY~hXre8p7wF8Mz!TBh$QMCNNT2J#km?c@chIgbW*?TeuS3v>DkUCjAKNlH zynfA_x(1CaZzZUD`{6ZnC!QTk<$Au#b*jjkfi|U7TUF>)0I9`^E&56Jt&`@FVZERD z1c!pOySo_$&^v^H3M81HG*xk_Vel|MKINLqEmFjBi#R6E6UJ?Di)tQ{T+2gj+! zHkeh8H>@2-x<^QJlOC|?CF~bVQa#{f`J5*YTUJ!7tS8oE#v}aDgS*ekLqdi-8EGM! z_cgeOdK2SZ00H;_q$EwTpWus?Y(W|HCkECdKeV`GhT;OIc76lor1FtU!*XC@{c;Zj zrvXlHF68dyYV(~jpmtJR?%KtBTnWV_l&)P4by}(t4N{(Xx|eoN%vd@z$97iEa&5*Z z@2I^r$M1h(*Hp%{x?>yKLX$+5nJ^^^C`Wy;MU0K@b}{?4D1Vw=w?c$w{DpGuo0utM zer^(4u#2e^ZggYx>Y;S^5w6NpSLR62LO(|!Wdr`^MGP~R${;-!-~c+K14$?yp@rw} z+OST&3c^dfR=nH5Pr8S+H_e-&A97B|&ErEqVfeQ{UL0Xzg954hqs^}kfx(zE%2?a` z+o^ny-UbIDMyY-}^b|&~MH77!+T;Cw7z_XfHiWU*2xs)`2ORSKGp>5V-#L7$Tq%|wRf`BW*m@vm@VTvhT!t<|bE_ywJ zpVg=z3xRL2+V2a>4^Mn;z3fi4$is97E28t24wat;)BQ>x$$}q>tl`2f#}5kL0Q|{s zIuFCfY!++1i8)OU?R9Y#z+=+(%Zio9qxbdkd&K*grYEgTFBjimD4teMif*u+)l02R z^PhHbi8zyjLPemjOT!Xt^aylZOgL~o#~hvM$~i9P*{4|a%5E8?$j3MPgspVLJ&8Y@$Zj)Wi!bRU^-t* z98hI|AO}YoE^EtLtcZY-gKA{`wV%Ls+Ty^mr_)4w!7rHar1}uUqbRFGZc z9!%ZuuyiCS&i=I^e72mEZ3`-ufH?iM;@P^7s6VFFmFSa)`c>fRc}x7O5={+l@4$yH zqSqY@J4Z66>0I{mgZMPY4kJOWBN@?w&B;v_>aSlLA}Nu^P8}RX-$C{~g-*z?f1@lQ zds7MI#BC^)b!hsqZOK8-bI2P$z$~k@yhp+d9{w;PEYfVR)3PPth+6J`ZkRhFe6Z#B zax>?5a?Tdxs(rYdgacX}9Jr7J9*O;-erpN7=8~LF@bf;Z&)Jm19_f^kKe_-jo#FD| zGx)eH09ZC~GlY6_rFX(7-djk$=@TBrH(5MgZ#BB3OCv4|F3f|kTB#FvldePlYbn0e zJRzlzi0S)8>ugA@Qti60b+WSQ5zKVqEqa6%88~i*9mgyyK&=Sl&4bCkY_f2Be3l07 zPQt3_R4ydtCjgVYrHasp)iNuyrW7QDvilF&0 zFtX}uxysK4x)WCQgmyDWxbsfwrs9U@(Ng!Cjr`9!It_j!6TIVU|XnPhk z$TnBc)^+2B6qGd<_CtYgx z2X%nUS289{DNENt*xRNh`(F4EcvWq*7Vyrzl}N1FljSjcn6~Kp@F+{{djF5Qf_~_< z{Vn4)(Bj4c-I7@n;uzy^6{?zYV_In=O1P`U8$PgJEZc-RqJyiHH0VMuo)qIlci?vDpRF) zL~F+`XBbW?bakLDv>n9A_HW15g0B^xa+E` zp7_Vh!l2J-RW?#kHo9u}ETigYn4-ce!Rt&eu)Cm_p&$PDP$t-tziT!HPH(hz zmm?x6o-s&V=SaY?G&rDyO6Zx+-x#4h9^(` zb*AeyeF+iy`jyF1K--)DXGUsPk~}K(N)BL}{JLq`Zx*_%$rU$hfAzvD^iRM?3KY(1 z;`s(WvSE+l1BY5Hkt7Q;lfYev^yA>35d7MGHp5XqZX)^E$I2uxtO*$R3hFuybMsYx zW=Hl84JRzYnFS7Y@|lrBT<7bYL=4O|E}GUOuAS`+L^(*hNUt+cgYUbMH}XJO@KIM|bQVJ-wl*hlp@Bb7;9 zQAh%W3?-Nq-|)mwbyJT44^=vuN1^4uXLKs4YW1TUL=ADobVSqcM2)T#0}3HbMuNL* zm6O9>XxiGqG4o|53yb^f(ZmG;jVIrs`|h&wvW!}~#Y&l;-Pt5$mU5hg7Re>xhDx;vOCCbYlyqMaaLN(@t=rASB$(^Z; zJt#D2jvF{pB7bdH!IdI3$^l(xz6u*c#y*drCk9Ngu?H3^3 z)Ajq4N|>qd(xj4jy;pGTu|@fNeA*L{iaqlnzOnG};Tb6;M@HnLryWOSpU(p3PiDyC zo;!W*=m8=4D-kQgqs}!bmHpT)NCr?TJTUlceQ2^Tl$0pUS}#04$q7VixPS-7m=+4l zC*v6H0Nq~kn~(Z8-~5JQVSCy|*obaJmw5hLedK=xejuOaVUL2->Z6N^Z6b3Cj> z*Z5L;f|lMM#oiTp3avE3%jG#_rVAF30~)&1)oJeq#`$1cywtq*yh#MzBx zxwhws6!CdG1^Yb$ia?PO*n&R5(<6QLxIs@!=C`dY8jH9W^3iSbj*$|X^~JNl(cRIe zZ~NMzk~NUHcP^W;KEP?z-?RpK%iatGQOMCd$ZOdE>BiDUQGQ-(R$ivn-g zvm`i3PLq=ufeM&S_GIfXN((@c+Bm^GeyB+({891@_|jQt^J0dw@56N%sN1VW{E{O; z=)J^J%OXk<+)xrWj>YWxyjECz4pl?#w+ac0EHd*a!(-}eU-R}5K_=5OipPq!vShIm zjf?F2rs1aFIX~(tWV2t~2osOx8oRWdjrXC$oVl@Q$`_h4bSg%(H<5rBq9$QqWE484 zW6xIIL}gA})o-h*jn*U3jr!YWr3_zl`4ABDpy+r(H|6f6qtK5T>jf=an}H_M)9bTR zC&xiPbN_RH6CD>Ze|6lWEq}Tn2@LXKehqj3-6_P1Od)8)pcIRTK_qFMWPP&YMQ^## zGz!kIbO#vqF03Q&$I{z83?(DrjLVs@HooR;RT&&}(gN=E++-bgqJFS<8*ZFfRa`-I zs=79w%Jb{K=k1N#A;T9oG@KZKb5Y~cBT0cQvcCMFWLHyISv!fP8%}WEnan)g#}-)^ z*u|Cg0@Wa(ml-^0`6WZ~oHp0u8hRdGiudqu6yFLc4su@0r$@|^c*8r~g?n;)U5q0^ zi^d;1(P{@%Bes%9%5#zh8p_t`b8Ek@6Hqk=wk`k;Jnq;z`68O~zLt=23@o&d4c?IEwl`>WqwHO?wPwobWT0V*e`&odVfKVq>LS$MY5{ToH>RRHdF!W+CHR}Lg zb5P^pKFaHqg-~B_F=RX&{_Me4L(L{P3!2sX$=<^J+F3o`(}dqIO%@ z8tgsz7^`3Yk}Zf{IEoex=l3M2#@%>R6YMs#Jw+|VL0T~f&#xL3!i0fwly2d(>CxYw z_y1=(=BV$TC>GcM$Cm)aQmJ43~LDGwVf_ix^BwB z%8nJc)b+8n)^AF7th|PJBE$BH~Pvir1VHS~~9kd)~tlW3|`ZnVtVJrKh7=8NRyf^Qz%c zqp!@Ybq!$aFy<`w3xT2>akW^(Zhtj`UjfE-9n^n*S7D6W(zHPTLwkvE4*8+NMZ!o#dXPPv^sg4C-jCf+*i1RqMF?i6@%JbrNn zJju2+L~I(u_y}SWoF(mJzol!Ji}rNt5xl%|ioAzK-d{(E7Zb0VrRuvx?GqBOmqs{l z-5koL`V#B1Bs7kysI=C3oG!Sk@_!is)mA$rFrk%~57^5mOS6_D}!*(w2HYOX`vR+)31TmM3 zN{f0>8DpBOgMAqdsY}r+Y^p{)p`Brpud68uY8qRh4m405Kvn`UEsvCKJC2D`(;)Z4 zM-eTP^SjiZ)*EMK_^pKecc!32Q+s*aJSdrth}e_(-&HEpDpiBxdsQM@4^>?}&c@Mu zm3om_4)raZ8jb`s(r1)7YRByrdmJnG=|SJf;4t^3JeNXiC9m)!6dc&E^qLYPM(~sA zpG?ZkcWov->Q{}o_IL=maMOy^qJ@l}6rMTWnwqvoO)b`wrCv*D6;2i-s+_R#hpf4o;r zF7Xqa^>Bf!DEu=}N%|mEBauvPUp(DeT~aoG-Zs5c5FIe)in@Ne zvyGfP$-BwcOC$r^XJNA%Eztd^%R8zJsHI&pRfgtOymFqXjT4<$cM-Y}#=RYT+JmkW zjQT9I-5@?T6=!FhaSjM)Pv!(;gwf&vkB9b4>g7KHWYA@>OaKHpSQ%D3>GmqcmWjg! zit!TbNVX}{9C+%_I4P^x-CJeJq^a#U0og0gP@Sn#Z!CMz zi=YMay2eX2?!MSE0AWh4(){&wA8_JnIh&5)=eX55x`9jcxwjEg=Zn|f99ym2!*^_8 zyq*6QvGHQZK+juO!!}JGomzh)OeiIR7s7!-^{wA=@Vg`HK96J2!d46 ziA_Xk8+L@Ti-z&>j^!aRBDBzPEorLOsIhEf3qBj~Pzea@)G~v__=|_9#hPD#_v{q` z-8t!4U7qkz=1DP2YJMwg-{HK_ zbg>mxYGmpGW6653xUn=CM(?iDar%QGQ;x90&dLh>dHUI9*+PE+H$vf*n}06BYH3ij zDUudxH-_t_Hy`ctl2%u1RZ-O5l63`ULiCP_S1D2OHj2yUJ_z<(ayyQ=e6uK+JsgsC zThb(bl$>pS%2myj@kDxU^cb))uqj9@yNOxSL_s&IxSGBxs<2_%#TAsQFk$Xf|Ku3x zoH={EY(2mY;d#xnQ7Ae!qdz$vuk$xRRBC216z@$M3Bk`?r}s9d1tl?Z@oVrDCbVQP zc`t!>#qu2~1dyURYaBynbdN2^5=ONd1!PH7fx6&(@{YiFKQiG^vfpbgD~6|h_G7ic zVx5`LpT12B_;9J2Sa zGy|5GA60(KD~3W}@v6@G?4EA%rhttbH()h=jx>o1-m(_xC>hTbz6C#N&-e)gUQDdM z1SX(Rr$`fCBnhcwDUiC4D}tG;=fNHPWX=GfM z)ua8lBddBP`BJ3}a`qV#ES{wNvD#mk*y=5^U-#d?-2{{3br>q*#J!&{iZ_sa0*^0@OI|AT$9-}leI;rzSw zNGXT7x*nWvuWfrI4+(tUyrbxVSf4HONK~yBu?!wOZy>vq4;H^WhI^=h(2XDq*U1=e z{IdKV!7g`&&4btNshfmk{ii#T$>fqga%hc?^I|zKV#we}{8Iw3ecHj4t;|6M)&-Fn zFc9XSw}+=m>4Ta!FhH5g%*Gk|A_)Frc7t!MnKCKkKWAP*;MCW24qI^VRo`vwv!Su< zP#C-CQ2T1#jIf>x*P;N6nVP|Fo2ku9 zDfAN^;GU~sBFlWzYO@$jXMBZu>sX*U73%bkdGZ_~< zyFlxjkNGtF;oQUk0&~7Q69B)n6H3_qCsLFGxt1X^ZparOkeMzGt(<(rQUo|}XD7Pn>2+0QF7Gsq5? z<$LVLhu|PEYYcZ%l28YaFc`Vv#9K7|dafMnpDvx5NC^fl$3;w4VQ=}k2H&oTcY%5c zuIx=Ww;4Y{$sXz3Pf2-O{0HXO-MUPgw4l-XsEw0WIzN7>IjDMkH6Lt&>QIlAq2Df+ znQ);0$JciTwq@1K{b5EA4r9X?$cXkYlr|XB*yEU>_6Rr ze2$U-9Bm<1!K5)h_DwnKv!ogqx$J+Y$UO8KL@@YbZAt0MyoT@>$@|Z>iPY4p`j6(5 z)O6W=|MeHKY&Y1&Ym3{ttvaVREnuPj5R2wz77tk`oH^ zcO(JVlFol^ob?ag&kxJF+6TA%$d%D=oiiSXHEA~E4jq3R>@WTwP+1TIm-pcd@6Dha z2Dfi5Ayr}PJon7sMG>R!4LUgR?~j3A0S%kS_6*=P!1yug-5OW5OKBK*0WTd0f)@Yf zp_%{Tu;ulJ)Wv)tOw98&L;go5DZ!sH7(^TEH-h^3S>Z1!gZMK4ea`OmzwOu!Fi$wZ z2$M}uouwSo{cr2=&)p!0!hc7mpx>a!3aa}9c)z5x$RCo8QmF_AY0cMt(^Jm=fbo0d zrT4$$vSj4F^m(FrR7N|LAf)v$&ETW{VHND3{~c4NZx|rQn&~{3U;4|V@&i5L((p6y zjiD2aQM2~n_eK3b1kfG)cst9Ns?99Qu3M8JN*D2Q1m%7D^CUB9qx0w1&Qg-CI&?lp zk!1$|4~N903tIjn-M>0hDE>u=|7i&1 zwkiOLt`P|d=P?J&|1@Q#ihr63djG*%c!%0){Q9`etzJQ7Yjtifc_vlU`joTf-E@~s z`j;7AmG^I;)5Brp@0>jn?nzlo<231PM4S0@?y&CST++t~$EW_~hi;HqrtN^yJnP?&MgW(mY8GkliOTPGYje1*q5KQ)hUe=$xxXfQqkuZYU7fwN zAu*EKlDf>>O#IyX^Vmyc@f${oiK-1owjoMgWanCTd1IcPW(xPFXIB}2qO2zdcVNp_i#osnmNWPr;F#!U z1jQ4c#KbTJn2L?2rm#~W!VDNV2y^K1a1>5a^ZXs~ki%%=4^)m~8xayc>f+_|5xPk$ z`kVO)f;0r?Z=wfKo*t~Eg06Bk4{KprN8hD8nxgi=m3m9#CMz`CmS0j_LiIehO3oQJNKH zwJ~rQf~^%{bK|oBGez{|R-GA}C8bfHP<~@Im*up^i01|^`65BB5?Z`}WTyA8LRyz| z&*;9IQT!5fZg%-Mm78~~OviL1-f zsV3`f_|xzm^<1vS3xPF=n-*6)JijxvY=GC{Ylm7->Zx0jVfMkowt#<< zauO;QUsho{sS0;PZdD?=vhs{VCEC4%Ow_a2ZW-K}il$I4IvT`p*dni?ftQ35imEJ; zwBE?OYK{e8Xhd%7f2kb#tze-2aWrL9fkMbWK>Rttf=&-|+EL=eZdn9Cb)^Ij!ZeBXiU)F5`#kH^@(c zue?-B&p#{u`;oK=7Ts6ya<&H~imbkC(f5J1m(9(NUo*K$AY_Y?zI@#fOpV9+cf#6j zNG|`R4gvik>&w#OL84ralq6Kn7>6}QSLq_-Jw~#$@I{+ZSIY@zJSbOIEmr$LV&(p= z**w5#XUXskbYlDj`&;~5Mv$)u?mi7sHp)s>2y02nWtmoxWj|GGF%9^PBGQ$aE>qFs z&6Ay#8ez9x&kg`kF+*Y0m+X|+hO_8T-{D_JkFhoA^AHJ_$R{gwlP@)^<#~jKPv%ac z>Ox88P6pPGZBL>3n`B{GCR9)&-5Dpx1gon4rtN4GVcV+}lROiQj`99wG&a%UmGi&Eyub2_^=;qIx6lF>=u;#3}>jmWBj)qVZZ55l%xcr50G3RpaYrzdK z2l2~XnhW8&A1{zXq)keYj$6@NZEA39a!}TqQ=jKyirgx}SD3?WGpuGlEj4y}#ni*Cl=e4e)2`_nZb1gzTt)a=(J=X4vz8{$I7TOKiPfwn8lRfdwNC z`-7b$W9sYGJ{mg72x>O9i*--Tn2XOIK4r56PV%$7;Cv%J+lraxxVYgeaN?9}xSNql z-LvPj7vs_a#OP4Dv7yOE;o`JRdc!#UDlEC)D~V`3-^Xh)8}`mfJlj-OzJ z;GgF_1j-x#+I6KEKYnL0p6@&lnoq_1QjQgYH5Fo|)$KXaSG8X0o3NnDfP>C2I^)3q zAyqc*1JlqrfyOILpNS-y7fCq9E0j5NI2NsY07gWEX z2lJLUz??Zo9+HeaI=AzLd{n$w+_W~Ozt0N0AE2g8b-9x!b=4qViW}w0^54gr>fe&! ztsHf5N;B#XKDIugSb-3B>hSYQIKC;|8?=>Y$n_14I1Xk>yY!g(Q1oh%my2(eQ>+*S z=`C3QK`%%#){$zOQSKt@8$=eHP?)UehNpsmm+f&6z$L@+p@8T^;57TEo3=UUfW=%t z#*HOQ&&pAn&MS}bb-6$6{O~pQpYcQ@m&r8f4MwT0t8*m5ad>a=df|w&b_u*k?BlNI ze$hqkc$30kfw-l4w#C*T2#epO?uTQ_EYi<8k>$o`Wl;|rgqZKH=k}} zbh&~B&mJ;oBq@xTm-t_7h}Yy5ZlDR%>Ia$uf}vB9_t2PaGAg>_(hZf&{)y`T#vldHi+lfO{&p799*9o=#0wkW(aCT=SKUy^g@&5wvXN=dC=F*w;ga9dKORmx! zh+^DGjAf24w7@O20YK`?z$T z-zw}}EOw(^hSP@{U7`d;wOV2ek26xl*CrIduFjKgYbMv&0HO0f*IV|Ey}=mbm+^P# zb!*Jbn(M!8DVBnx|ze69E zEp9r%nLp(kA-79(gsf|!QHY%p#GB!qKPBclDm=>9SqR|dx;xe=KE#=3MjzGhYS&OJ zK+`?8gD5C%n8xmE>bB>*N3J#um`vKBfJOq_Qe~ z7&}Uy$&q6t-RB+wKMTQT!p&?L;hUH<7#3^i>wiY`DD$;ANM#W$V%s z2WFv!*eBa{FPP+4%zn*Z_v{;7Mg03N2XXZCvX)=Q^JI99Ueya@5#y(z`y=pOp_vv} zOdfW0=Q}RH)JYu}0W(k$yd!~xJa+M-)KsqI&4eHZd^s-Ps?Y?^8RC!hUWQ{a`jXx5 zY?-wF8KoO~l!G;s`ddfUycb$Tm#i5c?xRkm1Uc*V8N5XdL!_>;->|EXEqoi#!4+f6}s^ z{8S7Fl{&AF1Af}Z;rYt-cGm9fP9u+mCk!=;O3O3+7N^?{SYN&E(AcR|SPUkVY-j#| zT)ks>q}>uW8fW4OC$=@QF>xlgZ5tD7VohvKY}>YN+eRnp)9-%w{?2#Kb@kuwXZ3oj zR;|10uDYA-HM}n5eZ0Qk8g@#+8_SNm&uchvN>_9A=i!bK-R3_vYLc#s3NI^`dAf1K;LHYBzivgHs|HI@qr1 z`V}t09#CAjtfhV8TuB5O-e@s_fBFymbuWJi_AQN|T5a?9U6I*-R0~c3&h<`nH-{&4 zZtTxOc9jDx1=tu35Y6(?sQjWi3Diohpx{@~TXa<3I}hry*V*>;@&0UIx`>?X&N zi?+GUuj1WCpX&URQWyWCfeW?2nPKDDqjcT6w91&wghutbwgHy?TKwJw)jJ>lBWbRf#LJ5kUfVD;M}$>7+A77wcAg0 zSNI(#6+rNP`=u>hIRe1 zE^&EeMS96FdasbU%}TPxGar6fh#gn_t@h*xxUw^b0o&0#X~(>Leph#IpjT0F8RYCi zJ^OUDm}2<5Ig&3s9@(v4(9@7;Dm&0yFxr`4Mn#3RdsXyNfN3gIzV_onKy|4Pf?m5E z&bB2MRx9#WhUG82_>FxPWrYS4>UleE@99X5;@x+IFTk4kowv}E?AqkL@DKZ?=Kr`- zjnn0&*aAakuRD-|4GW8j9oC4~`**DYv*>AYNW{PXq)!dXpLC_lHQfnUN`2gN7+`EW z#`Y(`{psn>kJI;EfWdaqkCV>(WEKSGUVUQ$@wuVr)3M0x1~ zMjjui0v7zes96j=-19Zm3f>9Cc4Smw zaxWzgcBW+S#0fk#FL1Oi7rEqE?TV82PR#(Bj0V0$9Q%fjU$VYb6ZqvGHQH`C-Fq`; z#1HcVp6=hrwI#{r;u8{Ndy}RDHtGI%Bhn4Aq}O0ex_P5rf>IjCK###osWZwh94|}u zkk<74#ckaLQ=*lnwQA7kxCwtXR=Hc$=tE9u(n9^QYLr-9etTV3=qW*)m}x)6yB@LN z1L?#^4@jFj%TZHku8e12kB^K_fTsbZc-1|*3J2#1wnFdRfH*}x~(QJ1A|#4FF+c|bz} zJ4cG7v24j1%K|SWgad=8JcdZ#TI~~&F84~a6YA}9ph<3XqFr|5>qs?Eu5$_hc5m5e zag$g|QPI*Keu#HgvaTSfE8!)j;R>m;q3U=9`b7$R0qJict)@OxO@ehpCPrw4k7 zf97rHmbVUrb*-3%|S2ZW*v?mwd4UlRLE8}sBYiVA4aBVpl39jHX|4n*j z7NMTa?)NK<>xS(QP?di8!D?=QVG0}v z8X;a^3p!cB2fL9WV(7eL`kFBR7$2s8eH>;h@KP2xak%bqY>DyhJJU*fllQWokt~{M z`Hk6x;3+Tg3n(J>sl1=h2GWsq!N*MTgXLUMgOwBeGq3Ccy1;EkKm9aYpX zpWO$=coL7b%MN2_eXv&~$Uv5VnZ>8_WRe@Noi&lGF_`4g~;`@84+$h(71FO~bRwvkd@Fm`H3x#>83TQShK_MB|)=&n}D{<5>Zc=1^$RX~N zX5EeBcD$b|k3ne1PoR%?*Qh88XB_1-wh#8&XX4CVNra^CyUA%3f`T}9s*Q#5Gf{@} zPgt_ncRcQm?37-y{57t*g+66qB^sAgd`KtJeokg&aWjkWH{Fp=;4#G3uX7RKN7SA# zMe9y4#nL};cyY1A*Dd!Zx4k8Is5_ox#=cYe2A|9FX!`+wvYh(IwcvkaJr>>x1iei? zfC_>{48GxfWcR@BBaV(+T2dUDgcGSF#N~*h%r~F3YrktPLeGPrTf7*>g<{5Q`f|Jd zD1v)MuY*yeTv=Md|Jv>sW>FZji|3d6-cj&*tw(oo3^fe|&}IP^D0s9iKEEY+U91hMWM*vmiSRxoGvC=BfZ;rkb>^beDk(YzDvOySvjM><9bqSb*_1)u9lS+kzyL|hC-Q4H>fFN@djJu1x{CF zS`9Gforep2^JH#(rLAy7P+=%_oxs0EOA%VzJOyvCIFqLk;q;0bcMtsT3UQ}~S9U^r zw_GR{)BkjWnRn)G^k|6F&dhN#Xdm*j9e!QBR;85T8j7^4!|xZvLKn>Bv)Tci58m!m zt+bS;`v6c3Ug87jKF6j8s^xYzSA;k^Ytq{7z8hYoGDj(4JnRp1J2fOpJ2|~Iu4 zvA)u|KA+jVybU3(KqS z#z*Dsl^ewCe=wXO`F5%Rl7BbQjRaHB4{I3{nT4^%U$6_ku(2^I3W1UM*a#gaD4?lH z`Cd_S?*GlAcg>*5UifsTx7n)drexS)eAkpxyt*M6^SoE?@Vvjdl>ZlD?oxtYZ3lpd_dpP;&S#3Ij_(QC79R}0;8X@6_WtPepxAhrmW%!yi+x!f z+$IVqIaw;phtcQhhq#`kDv!Yc_2=oBO%aMk-$d8P?qu`Jd>$8Qb$`pd2K9A6k^T#q zur^)s_8D7KJMFvsi@y1djwVn!dK-I6%n5nb1*q`;7aU{~n8DlW_6{uBRIos4e3{*) ze?(H2eids>;g6$^4pnXV9cbBsB+-RA&-5NG{_o$JMh79Vxe-{;$D-@ce!Hk|)GTW}t5%*|3}syBdzDSzjvi#A`Y8 z1bB=EXr(vIZk&V^H^s&sIbgcByD7Ew$w!asLV1F4XTV$~FAM{yh&&{I$9T?uqPj~o zR%b@O&Q3pv7bdW!j#2(H?Dy*c>}fmCwEf}O1n1gtUc2_RTH_%Xn{^MLpFIEF+yCMO zQ0DQSNoT(^_(g|jW@Stw>sy2GShoCHHxtwDUvRarGqLwup%SYfiV*&wTU4q5P2_ns z+r2UXx^y9gV{194m_xD#m@DohlP}o%Q|f*JX}DW?@SEwHNM&%09k*piwy1N}iuEy&W#tF#4! z{r4*W-!tx?nB`3(IS6vQdBK<8ITGJ@?9MGfMF-%d*_I8;M(k*h>n)hu+#B3sb=m0U zP}J^LAHL4e)9feJ>rMjHXh$Gw6kdjuiDW}vPGL5i70`ClgTFoGYRUUedZ0O|dRcl(?3 z?S)&S?#-za#r!nB)xMl9-hrj%&meRvIi}n4{Z@}&SL|rrXHw<=O^^?XT*A($i3|7W zfP*G@RLH~<;Yi-NN@y%!sOro)`@o6-UK{ZhInQlmKmDg1fsA zYu;BcicX4EXdDfCQ?A9$gb`W&O{x9zQ)>CVf_=zh4wJ=sGIfrlBjd?gw)-CZipq5w zJ=a8&$sB2?rJvqoD+>!7BQZ*5qKFM8sS3^h;xe=S{1DgW!uad*n~a5hX#A(oJo2!G z75^j$@*6gfmT@MfE(z~)R4u@9J;#~?&$;S$0kC*npITs&#%%uRL>etX`0^7ey6Lr| zZC-Zm>cAy-Hs^PUXGwUnuiCiHbw9w$cH#X+6S+x2Z z^@$Hs_b^ZR$IsUe@FCmXhgxs_#97V`e#W?{AYhLkHqjTM9KdEo$#n4+25)-B<`eOc zoh>6f&0<3uBRLd2LJ<{4;8TCYeVtl^9hT$-fQhvTzMKA z?(pDS?7~_76$J*P6Z3ulEjRql*!BXrAKLK;fN6)zSqBOqtn;5UpUdicy-z>*|G8+K zSNqM!iOwu7iOb1xG$+#=$PAU{B(|yZ{3-pPzGE?!_+^Ri**BQ#<6RMeX%Hz$8n zXrO6zUEPh2m;kK1;18-MTlR6HaaMyJOJ6C<${`UAPh!i6Xg^cM;svY@$GE;5l%inPY`h@&I@T9nBZcS!Jc?gOEQS;{ zCZ6pX`<4hFHdIFmA`>nzbK?5$)HONk&*xsOpPfI9QNe7QyL*TLt-9Y0PJ?Eve~EYiLjV)V_a!#NCt z$)4SBzE}wp_k_p6>$azYHmck$-=!YLwW`;1o|xbAmy|v~K)s=_zVjbxIKP1TyZT-T z)^36KTk0C@RI<4osD*bq_IYmx$G!$PK0&@O#Irt*P8k6GW=_a!JT|N4Em4mjup-~5 zk-qx)qPp9}Jiin7N7<^OZtH7AHpjY{i`_hgB;2hU{$4`<;^LhUVS*&PLQ=$ zjlOmRiPf2W!JhTpmHxSk_ciO}Jfq~bnkh~)Q3D|B$au7tn>YJI%jG(+G$^_Bv0Fk!5tRj;Y1~hBktKk+{v8Dl3LU;Cf#4PRi z4(G&8iM5xLk#J>YF7H!mnPwBGkLCJQ7Jps2&+*8YDOlO}v;2fn=x`2kA2{R-%e}#( z0}L4B@1sV$g;{PKlnF!=Tzyx9-eYl1=8EFbINoLlGCKRxB)nPLdW>xfcrd4YHr zh}~idZ_MA!Ge)}K&oOjPO+d08J*DJ9Q;SFi|K|dhx!sV3Nw29bp;N2S;vkSsBi`WC zsKT!JK{D0@&&J8Bc4@QDMe`<0$1jbNdx$1J>mU`NgH{!I9^$2OD)PF) zs4ISUOsc=TnPBJ>a0DBb7U387W2wNHU@$UTbI%LEX#!*3jG*g2uZ7(Lrq<{i24|s? z+K0>>w|He+8>fzt5RV5thrOcr8!`EaSby=;fE5#(-G_1)rOBG}Vkh2T5bh{_RtqWnd;}~&M;;cT$EQw^?nl|Wa1w$U4qH_J1vcK#~Dp3T_D_vV$c@M4eq!SLuVI5Ac}1#y zv^s~t=UaGox9&7VKW`d$sZm)(&Od0aE06tRCj+P z|EHp0d7xpJ!<)Pg(4FnUSmz?_ydb}BKEdzpX+e-+b~Bk~AJ%eSojac%fGN^R?vEJ% zVGk04%AuS=&y6A+q(}?N?k2~MdM{ZSiJiNoHKynE@j|@Ua@i7O4y-j6XSRFzLY$Cd z_TWqT?eMUU#-0gqzPZ9|eB;~x^|~3sOSc%X0Dt<)@Lxc)=Z!YpJS)LxIN$;3r*Egl zOdfUL9hrOCIwS6iX2;+?c5V`3T!n7FHRwvSRHnz)_MvYxL&~e)2+=cLp=s+x9R5+p zh^*M;3~tJa_*4e+Sg%CfPXE1CK*?6J8Tp;2>A=%-VWJyhT$w~^$0b%7uGLDzzLwe) zOW!XP3U|*o8yp`V8Qmc9q7SXHH@wR&9r+JNf+8$sQTD|+utzIYy-_}FtcXRC)2!@X zbphs9>aI;!v)Eap{OG@1**PInc5Ar)rG)TQt{)amAF->aeQhMdF6yZkeVdBRf3t9r zQDyySulO*z1kPcWIZq4)4Uy=bBU4){(|clwYcnc4eThbz^rcVxH^qAti$GoTMtm20g zqta`Rp(yu(BBU!Gd&0PC?UV#d5X5 zW!8Ku$LMdgU;g%+`paI2xkFmn+gPy5B+@w=A?@=n1TkrZ5q4_f>`%A3R7NU5ZFWa( zX0hS2($#hKb&R{uuBf^+pUQ-)XvaMsYPAe7)H~e_3k<|C<|pxtK*>Qr7-P?x``HYTfUX^i8|Xz_47(#GF6Qhk36o zBnEY!9Pdi=O5o`CQh4YG)K(O^G^{x`^RZUinaghK%J7%Z-%` zHpng_+PKTdfd`$7VB`tQz<@OY!OxPI(W4>u+MM$OjoNit6#@lIz7?o`1r=R{CG@4< z^y@+EFUp->D4)3@&CPTBZBi$$M7<$g>Ak-nrM_>y&x*QVrA5lYCLGrcg`oYHltPY>PWlU(&n8c`^ zv_vCe5e8WzevwFq5&phiH=6HzHjSz%Uf>H#qR}MeOc>0&sJ85iS!+!}yML)~IvgY4 zylk%6E$rV>c+4~2QOm4!;g@E|vo}2Y7PDt{aG_oujUnCke)=`s!^4y_8ofO!Ka@u7 z#{goG5vl0*CR+ENx$IA!KSdFi6m!f;um{l7T?JNcrzHNggBSR+2hjb(za1PXcOv*v zf*$E05C8STviriHH? z250x&;kKInMUYrne7j<=&0RSILW*PyFvg=@$1?(2V0(t%Sw%BUa&G$qu=8dh7ctNJ zZ^8T@Si9$Zg?)R8;xIn%I>1Y+B2d=6RR1uV^vj8-a_xU~wRgq;A6>02GoOe2;o1(c>nqOSpDKNA-h?W3fda8YO7_y2AUC2z8DP3eI!M|EdUT z$@1BQ(;cPG=3E(X3T>hUzg*L5)a&L^AB&A$Y+ffwU4}R<1y4@+^@#xY*IgSH3U(qK zxhM-IVSc&>;dpgHNA|{e7$@FbpU)os@+@L!3oUuMMJvNovSsqO2W`fE2Z-$zt=gz4MKr39b`T#~?#vxPYN?}W_W)CE z^2*njC+~Qi#!t4tbs*ZDXXfNMtx>9C#YWGa>R2->d|Fe-@RO!0RFna+GeeFXbCStk)=HI#Pq03@Q? z1~gWg9>UkQ`CvNKzZ@lot!vTjsFL;Q(Id{|t-#i=R)3X)n$#3qTf;ytAN}lziv|y7 zm`E_3g|fy-u>#+Ey&v~6j%gM$eOcvJuk(!>V;L<8ysS0mOaBIXWJ5nEI&*J_gK{Sv zKmTuztw>$%G((|iM%W-2s3t1{XEvDa=EC-ezWKc)=6S1_I?YtfGDe~P$(Pm*>X(@_ zlzj8t$|@_UO^_D_`juls^M^25lQFurn)<$WC-Qofs_t0XIf&-DIH*`OecbD(>rW;T z07CQzD2?l+mJ%zFB>}Q8chVXFBh(oDu{ zqp&vN-}h6nb6>5X%h5fpzD>+|WJY z^D45FQ=Y<=gd4hOR&4L*d&awjhnO=`c(Xh0WnIUzl20z`hQ;GSW+B&fFi;`!Nbn4&g@3 zfe7<0UEmg9(D)Fg0c2U7s#CLy@r=Jc?hp3JBX-cgi^ zSlZh%$F8&sgRxPUCuTK<+jm>1DEDmrzB>lysHG0J?Z{r1aKYoY$U)23@zLuox_-JNiqk_ECSD;q3`-lHxm*3>js6|Qejy^# z%YD3NGACq(r<@(R#|yB~6bEl+pc#r=OKQzce1&eLua5lcsXfeFzfSabxShIdci}UU z4`uKJMt`~?U>il&n#iN7pz_Fo4Hq0!cD~K`kFmTQzd_Az$Asjh5HuiZG~(-$y#_Ns zQQ@rudP68jW?_Y^+qy>x&M*>iqLH_%_;0U#O)d7gL-dK9Kd#O&Kgz;aR?NBw^YI&( zG6%z~?9e)j9|a`HPbzrIs%#h(t`raMVWO_7T$tL=xe;3Zf9(r#%1bq9Jnm?YF&SCrsIAxp^*%MNR8AVV#qVnE{lN!5T zX?cUovq#kk#x-gltJqB&n*e>Q`@GQQlbD8s>WQAnHO}+t1k`jxPKb;y?Z0@6@0r`& zj)S1lHk0J3H^F5`KL~guP$60oDZru60+jbYA^mWX_`?MsLx(>K74efXlUr3q;vGb8 zzAb`dIj>|Wv9hXY#WI)QG0on<4MoI5s5*CvcBYIk|M74mKsxD?Mf-DGoH(^Z~ zPfL#~_^FNFI;}@HZrr>4o{=7JHLV8~Itki01Il}XyxM3kc?*~Lg~h(YUoo7zRKMjb zHt%T{l%M;Ljt8ll7Sk%YTzRo1#h4aV_#!{0y>rWbA(>+Qr(~3dD)Txno$6GT@n0zQ z)#wGAo-1o}$TTKrL=;4)mmTF!n}<$!K~lBl#!MVx0(Zn+#NwI8%t1^&7xmMZ@0bbl z@QxNCr^Xa zd~ioTMjUo%m=vGWb9$y&bO?IixdJXxK}|CgQu@_>sm8sTWjwjojz*y>djPVF@PQkd z#w@qj4}SZF{J%RL9i3=Ff&1`yQo4WMwy%Y9Jj#TFy66T738G%7?5?>r%&-hR1UUR> zUvcvu$4kGQYaCVWY;pHv$q66~D=gX|AmrGs2qx@7y`MB7~IyQ*N3!|j+~3?O9u~w@N~6(Ef@3%Z@zpj3WJag z*JFs;h;t%|h%L4Kl?*$IB4O;JG#|TS<&v_jxiJ16-s_5{%M^9l=Ct7lvtb5%&h>T; znEY`;+CL#$9Kw~PjPu2D>s(H4?`O$^{jd17r&I9<<1CK4oveL>c`_33>S5}x)(@?+ z7e72v)>NA8OYG0%gN0EhEpRPmW$Fgyekf8N6A$Y2&GBiN4~hwVkW$2=z@9jjsUXeZ zlFwK^G8R01g^FEOE@_@&XB8L%f4TZe`#V&I5KU@O@$j=UdJG+7FagQal@f`4iQqJ~ zhW)S9;-UqG$2t^0u8_9xlAB$`t{HSCHPhy|@n|}_MH6@Rz9L{g;y8t!y5)M<&h)AC zd>vyc^*Ax3o}hfu|EKHfIm+Z2o4u4Aa+3%D{3#r_s>sP0snKiyRO0Ata}4JjmSPRJ zuz?r%^0hZi#%7Fd1ZKu&xOG|UGFWiD=^1L~>6fu*+$6j}dW0B5L{TJFz=^LeNCM&# z4mQ7CpGl+`9xi0oWutv6$91((+{Kzg-ma9wg-KVqueQpuXx_0VR5Uyv+{Vz)Hx-f#CIg9zx$OX}O-fj(~y+3h1v&dd3x{6}wu$Ya0o_|0;s z92M#c5>K9&zHVqsZ}#rRl);}h!P5rv#I#G_B64N3t^o3OUbH!jmaT4pRoQiER|o9e z7`aX0sb@t7-szhLeLlzgiLTjGdk$e^!1m0t$LBm#zQM9`IkJ-Mu&*1XfxRJg-O77$ zn}ci=lGND5=?*SY$@V;%h*cTR^AF(MW_5Yn13@oMi;4E(h7Boodv3#)RC1Y%#@KbY z?=Ph$MzZEeNgEISTg9RZ7xy6Tf@4G&x9KV7HL<4GFv=dK6M`WrcyWC76-5Z4zFlmY z<{#E!3ZkL-0I(tw9BSwU8d+vv3T_6uWAa*(Mj^I}%NG^4Bp} zi4OzR*a@R{n%QJ;D~V|Cl*GZ13UrjXpsOJPrN^xt!Oknv&$Bk%M3ciHw@{-2*B-OO zxjep>N>o~3B_RdYeFlAT#WjHk4Cw&8bLS+{+Pm0Ja!+;w8&Sx_4|cwqhNfe9qK*t5 zdE31QG#bo_*FpNJ?`DqWQfz3X??pLlw%~tvX_JBE3B^jvUjE`AAylQ-O)S7-v7n0g zf0CHW^cfzwvY5hOX21U*b~Om|A8(v|Ne43Sr(e@6ShH@B>>O#>DG}uoXTqy{7^vs`1(ICKmdE<={-#& zOzDc!a9bl|QRTw}Hi=F5gruu(;)r3*VE=D)xd=0&foC)9M;L_btLVRY^fL8X;WKw% z4_X`!g&f?Y+@H>w6az$m%i=*=6hUMbVL$dN=j{&-nH>51Qp@--$sIv~gd;|G4iv6J zS^9&hnnTWVbKcZAuMop*t0~eI956g#2xZ0`74Ag72N0>DZ(NY^6q8S4AVD@%XB&{^ zS}X`Q7tNn+W2GbZ>=J*%)D#BBds=lp#+d5HJXENR77Ga|#_ZLRiayqh|;)!+t-Zo%hoS@b@*rPja{K^)KI+~(mbZG+t!@Xtc! zUKbw4u@^rTvr___StTXi-P7!#iPu~G2N5butJeUjR%6RrznV7I8-bIK^%tYX4mQ4N zZCQXYzg)w%3F*}iXs-Oj7k?Y&W?#Q>wl1@z zSQmerI^LWSX8ttt(t@0_5_{Ul^6O$xq7|&F+zD>~Yt{t#G(TN*!=S7_y`uY5Nm7{; z3!>tmw8|4JMd{30c9z*wEHWDR{GboUbmiga`WW0rWp8tH>fC8h0B*Jie+-MUz*3Rt zS;iWtO1LE$&u!=9!a4lWIKFN%JgV>)N45X^*qlPA{Y>#0Kr@R_6OhyNT^5`gMp1k0 zvWyA(yH0?yi3};2jBXW{<6!-4NTwLDc6nA3 z6iGrTky)Ed({+2gEr{2BQwXkS&7F|gXx2{4%R4|@ep5HruI2ncy92!E zGBWOSrK+>k*OdMnd=**Squ=pH+5F!e?*PX=$_p-kr?;omFKLT3r8PZ*T>Ym*ai05F zHhe1L(vmLrC+fd}nktqAmiR=RKz&f>Uu+`Lz2t*V#Vu@wr2Pr2j6AqD#c_L!Q@##_ zxi6N}yJcUBBar<517eK%a?OtA2+nW`tc6i{g>?sHQw(dXd~QG#Mar5W?{bDG7xkA6 zBbw;h;J)enX&cHBv^jh^0ZwmihKjjvg#-P*v*KrQahZNKfiWdU3`7+Dfhq~XEGa88 zXJl-gFmypFJ6H9}aVlcfWLxJt*}QtN?7gm=VP}(|F`w8FUdq4`CmOLPOiDZ^0)5EL zL=72;oHa2!3)%nqiLF2wA^}e1*V;GyT!(nkp`{#F>XQW9hu3 zWXZ(15R-A}H`)HHtLpQUJ%P_>IeJK5{!b3JI5W3hrmouse;LVhSA98x*EIF>y+@i{ zC`3G#pC25|6wsSrXf2HkxV6sJ{(Wk73#yPG6lWr?KtR3_!Nj`DjqGepw z%&_Aq+Blje(c$Fc0@so;Hs72=RbCsWf*2Z}503fRmQXo@q$IiHFJjfwq9Q|{;~KCA z7(V@b8Jm}0aoSH;y2I*j(J5I$)1cQm#}fv)RFy+ELb`$n`^!`{3ga56gufoycR`pV zmBbX<8cvPgs!CcVwGdDSObq_KdZ@nEM(Uy~# zmx2m4h++nyPRJ&)sf#9}uY1rd+`~Z{aMM%8mJqZ8)NUyc!PubeZ9zx26$4TtS}td=jj=X5HW-{xE_rwO-mdk{X&X37 z>^pbuu9(%GvRR3%bgeD%qyoFqKwvsNMVV>%)8^A@Au-S^XDRtcJS{Se-TlU)kKUJ; z|2p^S7oBV|K9`rO#gQd*x^Q^6BBvF^@A}TPh&RTzOn81PB%z_Nd&YsY@(*yUzEK4B z%lnA3duf3Dn~W;s)*%;l--)Im_E}eJmt&`y5brYQS1Ks0Ih&5|Cy|#5|JGz@Y;>56cKu>jK`ja%l z<(g+nS7yOspKn!4Y`*9IN1q_^pOeD8RB`De1ryv@PUYn-;Kc1bDyl7|+b)+N%;VSs zp>_UxWv>a`AlK3vNNAy00Mqv~Ky>i8@lv?`-+z3W$&!}AS1UI^Xo-XPeNK9;)_sKg z#3!n5!&Cx(Ay$%J!GsDvcQM-AR*hh5>|=Xeq-&1s{o%AiZbjU~lBV@qdlX*ET@gMQ_aEw@I8&zWa@%}o*x_tLuCNPlSf8W% zw&B#Q{9?w)ZujRedU)1Z^opX?PqJKj;?=*VFBfp}6lqXCjF*!XiA^B;h7dKa<8h(l z9(Ed~nKYXJ;o&?eb=6*&ufq3-#?O>>oz6t&`TckCHU4p=YE7CX0b4_o(#kt=Tu{7j z;u5LUI+!i_5y|s{&BZLY6Dbhg|-0coL~*px*umDX)++c&!saFHu(*5BDrt8Sq*qEl$T4LCgL z(32c{4i!W&t*Auw$!|MjjTrd_^S3i(XIubjtc1=hj`*qwQOvZp zIY}EiBE%;#tkj*ALn-g{~J>42+&jNEzdrtuP7=9|^iqF5ilu&u6Wgh+z zcSg2h!Ac^8Gd+D*zreVrF_G`&d+_)H`gR%RXMMA?{>4lVv8NmXnYlW*>r|c>y?~1B z$(Rda7sHD6UUGS7%%;~^Dc?Q}5x*v=>-v{LHN#OfO8NCV9L!l+afw zLnoPn%DS73HeBEPYr%s)$TSTX1ABV%=S|YYuaIo9_=j4+BV(JYFJwNdELhIep3#Aw zwTTmU=Mr9Tf(|}ydD(fp`Z;;JB#Sg7H#B;P1WSbCWGei)tl#6x zjIT(87wH-ji6#zT&B+Nn=mHFqvX(?VIuh)uh((2;)IiLE6rxT&(Plh{oV+b0YRvaD zFZo+W|1p`TdAwo5OZb!PcdQJMEGlUJeYPJ(fO^guib`qnpRWvY?lV$eH=as;;N)oP zS_)4|e+_z!(yGw5Sc1E~Bh;!jue)Bh+v3dYWp~O9){V6-zsM7ltoS~eGEmQ z;Wv{|#2N8??{$RqHBLW!1mk-)CSTY8ZhCC@BSZWx6)Y9$ep5p(ezi6QdkwUeQ9M<2br4oart-$PKV%7DeLJ31d8t6 ziC*`<-(a9UaBJ{N(O7PU4f0JXTWZkf1!7Pwd}236^F0ZqW~Yr)$QX2k1!@9RyXB@f~xJ$|8UVrGnvZ%-IsYI-}$Lgewl zwdRN1`9QN#c8uWZ6Q$n$$a5H0lOo8K|FSayyS^&moe)6d%?)5d+ft!i@&lksb+u=8 zFvJ?_-ixv9i_A*HJ4rwuhDK1A&EAhx`%S$G3Hmnp-JoedyU#%0JY&hb2CikO zZSO34-#a^Tamtc!XUbHp`s+b>S#t-!im`F^I2@~M;_>`-RVG%h-KWWZ z%Wq!xX7=0Fe3FSUZS*24+e zZt>BNrk4=W5yze&#%N5zwqG`R{qKRvk67t zdp-UpJtS04s<=+R-??}_me!QOAeJ#XwS;=XKgIRJjM?s9gTn{-wLw6mx_Xe_PaM{^ zvl}f+at&Yv&J9=^|0m7vS(Hm_6_`S+VM^&cMl-Nndj7T{DO$WK{%|u`eChH8F+^cf zET;Q5OJc^2XJpnGpuFUKM$P-QU<{z*FU^rRlx-lCt(LL9mFQ5O6Z-U$2zxn`0##rN zSJLGTB}A-J3B5N8%r@l)N-&X4Y468N_{#gSxh_&v3WGrGnn01agboa=dz6~?tzb_f zsPn5ZGGEXt?~$#>$5vcxg2pKOr;Py&CxtK@Gh!b9_GkCCq zUayt%1s;3SK4a}Q6Gyg3Eo;w3{|B|u&v#DW$Sj-bt?7zR#R87Y)J}hP*dxfp9N*2z zi&GLpiE1+8(^FhmI^DrAq(Go+0w3I0vEBK_4~oPi)_NkRb$5mZSAU)Y)=P1I389a! znd@hUI2Tf#mohZ8XPY1IX4&v}%-3st8(k~bC*GamT)AMF`FMt*l^VxE6L(p+tsmo*LUVX%m5)LlEK&pfk5IZS#Dnu8XIxHVHQ>`h#q+NJG=o6aRZ@twzypEd>m1k_>Cr2&0LNcPFj9x{yQn~PW>P$IUb+} zBxElS@AytIU-LXZd6>uniOUf3M^uff`Y7_*#1MzUOEjmiD5ul^G)ey^qx+!tC$|SqJZQ61EI40(nRI#JQ8 z_cSzn9g9Gh#nkQ^&Zxw*&b<$#5;qXFCIkxXRY*V+!R7mI^)}SNoypULNiZn9DCLbn z;m0c-Co2*GFNSBN>>T;3{YG0;wlw=)pf9uc#XyjNK^w&M{>8EzaY_zB-~#M&Jbz)o zo8o)B?!J8E%rQ)kCA`Wbi#U8j#@e&9N4_}8*;FH+_xuEO2;RN>t!FTTk1*x79y;H{ zMt0djvAx>-Dc(?s{f1Np?#a2)bGa9d+gZy;j^H!_0&I7$*eY-9g_R;|MrSh8{-mH4 z|G@oLkydI^*Ss=7z3D)i!Hnc?9f;F_(`QR&#M;!;LA zgR(J;WLc`{hO-qtW9a|k>o3FNSe}Pr7+)L$1PvBExH}685}e@f?(Xgchv4qP-QC^Y z-Q69Y&H3e=|9gLV=b9band$DTuCA)CuI}21)vaq;_CM~!U|Tm!f03t*JtUE{*iKac z)tWL~CQYhaUA=%>iu1Je?3GtVA2qX_fX+<{S?u+`s$=fl^3F%#*P88}aNT^-{)o($ ze;CAr?#f5C2VA%40={1JBo#p#;g`3n3de$cnj;Nkxb)lMK|Q+NQ&;HijwkQxBJcO} zZe;fytIflc3*z~#{T<@BW2f7N+e-KSXlGxTc*5oJ_giZB-bx%E8@{|(sT1w zEx$bN6ig3IMCYa2pQ|09)8?KKSgOOn0 zNTWNay{g_e%Y&x0t~4OH9IwKWmVb*b^tjO*NJ?io4cD-%n!Gw*J>{Su>7*a|Ni}Roq zR_!BZ$PZv-3goaYEQi5DgFgdG0mP9D*JoYbMrz*FOt_UnUZdp2 z_aFEQbCxG`>|mxq-Vc-FjmLA=zA#?0H40Z^Yj9(D36+f0Gj{5yA}$uv2)rLedD4rr z8#Z8tkP0fPy>mOUEB#AGI7ZkJ*Fdf~xv;(wN^(xQ(PJrFbm`lNyM~?zXqNX1%Gh{3 zOwpt=k&{?lZu+VFm!##6HLgQB0FkH~>jylRo_?IgRa@WuCS=#_ZxoszbDHB?pNlzG zwhp;X!;$4iWUHn}p+qP2c)QHJ>TLM5;ZQsnhs;8FmiwVwJXQj{+-dRyO_7~k#M+m| z?ysi5e6%Bpb$+SyNj8VCD-yel&&WKi30>opF{{Du{ygwKlz7Q&f#Swa1A~x9Ol8}I zEA6Mzs|#0HR;Xw@S;T@j&V!)Wn$#j_+3#a%J-eF%z41vjTms>zA`ac4aXDZ#+nqz@ zds>XmSU8s7)1{uM<(-#|lxQfV5~1;nUx>6cF}G^yuw&S&7oU_v0Vv;(o}I!|d?{j2 z7p@PG7Nx*|(M2z<(P5~mIhjxLp7MQfN61_n-l~3+pE{Ej)*yuFzO2)0 zdj$nPj2p##Sm<4=7yE5H)Bq->czJc)|Kol7YZZZJNSiK@^P>@*swX#IV3=yMK4FqP zo{wC=^Jy!2YI1K$Gmv1~SrlnZaY%Iq6;-$|W^>aPNz} zzPbLr7PmDt&2Ei}tayj+8OO$jXC1KC#*^C8(VS=dXGq0#UDFlJe65z~hd_TFDD zJg{1gzXv1Wf4I5V&^JtKONVsCo7K3~M+|F8#``{{F+BKlc5`_?pdK6!>vplyk#Zxa z8;$!4`$cy|@U>Uiz>L~qf3!zy@X+N?r*IRO>`+qqCYGAB6e*$y&Am0^CCw7;$r=H) zhfKOYoEh4#Kk=jX;TZNN1a59ZoJf`o zy@FC&V4``ws0NKKg<@ra9um>!wNqy>7MY$;ezsp|^AmeOGp7Q~0{q!X(S}JgfMP;) zE)GPc%HnggzwE&>8BuZU99BbO)&zG*f$WmH$Hsn=f-or${m;KzSG1Y zLkTq8h4esfHW`##WYuEbh<643I!-6th^!RPn$GG-bpavmGOeJ|nR%i3u9|i|P_C5Z z3tc>{7o3t402KaUVA&++c8q&r0yyq8QH7md1W(DO{`D<9gW_3Nk~Uze3+<-`ov&hk z#b>alzD0UlJjnt9550lByE{tz44aJ^ma5`SC`nwB%1hxHUgTs`X&I$EMm7M?WA8;} zfgy)o7`vyO)HHMmksY>)fGUdz(_A3t(GXw$?XNEMdlYzIEo+y%$eJ<5Ac2B737Tw8wD(-}XEweDqEz#;Z#m*-#GBg|^pBtTeCiwVite{u@@ zExLZ*f>3~WF}pEOm}-}P)VBt3{gyeu(Oxbf9W@STuAyOn8z5!g6tITu*sj-I#E6#C zkl1KB?qJF#+r2)N%p@P$l zz~cFa4JmKT$BepX|0AtFp+0gb6MgW1vh$B^wp z#IebJxdpZ1bDHDwEP7f70Y{JuGa3_7HvtbHrdhrHRErUlVY6W(mgy5`)P$v#ZPIT^ zM;=Cx*X=U!)e`XB?fqfgxT&}#5Xd-AJ6wm5UgdZn*04qH9)esiIa2q*Sw`+1J4|^6 zxH7NhmQGNCvs?WCjMBhX3uJV$zprCLI1cBoUPofdqL%47a6e93QiRm!#iCk#<|otR zeG&1z9G1nf_-uBL@#-;jqBsQPg!I-03ZF%M#<7j39j~6O)!kUoHalicQ3-I*iE(4LmZPIwZOVYxGRT7K8ohOZg37`P=9m(h( z4;rIhQBFS`*TWPBOnw8hmA1byM0}q+0}tax%`;3%lfIxfFWPib;%H+=f{^z^DC;MV z)6BwIA>j>kEGQ>E?kWFTte5!YkRz|7#byJr8qb`Xe(BIPfH^Xb8zDME)RL5Tb?)`f zs$aPr3Af`fnR(^Ww^+j}tbnK{dGSSJfC8(=N~N_jd0=T07vMLR5GvvCZy7e!Zyt>^ zY0;OFDuW(=`RLZO1iJG-a4>0hD*^F(O&nXC5i>=vEiYN&ywDDUw-j+VH8VC3HF%OY zv^eSLs!*d}L!?ck?rx1CSG&Np~a zxF0!YiTvKm687~@^m@cF(#Y0 zeK=F8d^8Ud@06u3rlBSQLMLu%eWWHr+3gDV#C|*liUqluKr-r{>d07;!Ez@bE$n-X zhPVZvBceh^nrDW{`C@D%cqn|)r23c}QARaYeOJg){dJGRp0?5B#|(ACBw4)uAnWHZ zNOZO70q70VP0f6HSQjW0TQ#$l?KL4yY&c38@a^8v%4k~y!8m+f>*2M#EOdnUlUaIN z`vl8Bu8!1=N2p2~C&gvGr(<{WRM57_s5%iEld@HDW)OlS56h!62NuR5?DjMz3~|MJ z-GN9Onayf_a%4JHq%3IG0-X*%lLa^@c9XA#cwz5Ew*Y96z!Ye3Jd|6wxQMg#Cz4>k z$BEcI*Ix&4eoHu}EqQ-qF2T}^X4#_P?f%YF zfvw|CI*2&Y{Vq9u!YVmm%}e$}Bgz@mpB2-$;{5s-Z*3^0S0Em}%KFPRJCd8X8Kn;B z?DSrDSX%j9KX8=kZ7E}Yt!Yc08@slDOZxy`6{U^8(d9UVJYu;jWVB6e zD|T}86cC+8V0-!CHs&TA@H~dUi%=ZtuL^y0vvFjgD=nS@O;R4K#bF{|6sS(IE%^Z( zMMA+o#PJ;gYE#q6IvTTh#`Wf1`fqvOO#xT615~h z?eTA##xkEl2pl2bgjcua{+E_|$WadJGg-})lkGAPf3Qlh_ zyAxE*bIPMr5>SvW#RX}SQEm%1nRWC9QI0nGxIQD|g5*yHHwHgMUR?Jr-8gHz!2_&& z$iWWm*GR=l)pd#KWYp|g?b3Q3z|G{31c;~C;}p3BRM(o+ITMZ=aq@MM{25^j22oM; zch*xmrT1~+Q;`KlV?S+@EJH7A$LSecUq}jz8T*y7zAyn%We>+ARgI1M#9;5rIy$?D z^4o<;o99x)@;GhvQT&A``NXakiD4%7^0cn|q2GMPUCzft;F(6xSK%*V6 z*Ed(UUq9xsgCdcqzkcjR2GoW#;edA<d_+N<%gr{#fz;&I2OSKfAvQR&_MHqu~#Y zX?~Fe{6*RUtnKXI+`Y2;7NIeGx#z^Hd-OaDk{OfN{0N$`vNO$i( zt;j;4_MF{Xz;(%2tMZgJKK9jD#!Agz-l688$1s9vq;4!R<2{Im!&_N1jcs-mV8+2$UjwxY zz?em|W=||RJ2#~jbv3658BR{KizcD%Fk>-T$5f80r(K6))zO<|d_TM@M4Dv%%s#VJ zU0%(U%VMPK`F+-*DA$E2OJib_B}g-KbDwf3%>{Nbd&FS+%xzWfJAK%d*Km01M_}~6 zrODpvO+TWE=inOF4RL9=@7!iy1bK^?VX+m+nQk^Sz3i2dTB&!e^ULf^g@6e~b=*e4oSIT6IYLy5O}=( z{s24tlUF@rfK(Hlsv`o*I@19Tw>6zdAMD+;Gp=jpxJ0r)86TpD9(rkSzzJMSTC?R1 z50-0F^5gWg0#>p5&D%MK6EVmSw^5PL(8Hf?CScI~C@gE^(7aVQKsk3Y!2^`$$` zGT_fU>h*$KKGq&h8-23?W70h-4w=KP>9@wo`|XuqF24 z!ZLuQGTJ?vWOj|C5}u^gMJNLCgqqvF$;EY*ds!bA>x7%;=F7$%;yksSnyde-h(!%o zJ}%U80RbnPhq@h^bjL#rlhl?^=+HgF!aAdQr40^V^;e4MijC~c4lS4C2@~}uQ19$s zF$N+K26k5V-B|ygazAHWQku{kD3>P*`uUmtOlaOuFJ~u3%#2|AL&6EiZ z&w$({gkZFWg0SI`M^V(%1hj}RUEk3QLlA0f@ge6Krbh~AVSve0LNH!}D za_GxL`lhC*D+V|ER-9@}6}N@KNC=;D#C*PLxFFo|g*^CMm(L;}9AA;TJOcFYntVm1 zl}OHCD#MN}KW0(YUtd^se#-zBz41*Q_lcK%1Z!5c!BB|v zL6CMLJLwpQcTL67yWUJaq4E{(;t=KPj?r?Xao-oAfX6-w6kkg$?w*U%?HsK6$bbbj zw9CRxP@Pb?v^O3Lh9%Vqqy(mJbuB`UL|>#B&$1F)ft%66)BvVw7}2@Up$upx<+-{= zZ|$b-R|3)ut0)~)Cx8s^YydCW%+S8x6DktRh7u6Dw0SmxN}re}m>Yg6WyTvg4E zIZDQZM4op&)#x!r0>O73Q$qs`xaKuk^@!#0LKNNY##p7pNoU)Dm3jN6Z z1h%qGp&?NZsz(FGC1<}ryK|El2hCW>Fk!EmfrVxRSJ)n`fc$t%835V`uD(&{w(ucx z=sl1|$TrlOZklsQ^N{2xQkuG9%GYJq9I0n#7Sew0IJcUM=K>s?&HMq0rJj1;eaw5t zb$qzEkMp6P&0LDT4VRW$F-cS-JMU@r3xDXld$jXEZTY{71GQO| z&zJlSe2;ek?~nJvnR^GMEU$L90HHoRkr7e|PBDOsOaGxfJ&}V6p@9NO@kl^TA4u)^ zwB_e(`XejnMD9`^9-AQdxOL(ieP%qVFh0?`M*rJ3U83HOI380lA!Y?HJDyxp<45TW z1=(=9TK;cSO}C_y4nPkkgY%CS#hLPh84hbl?t@No?a8yuW|WJ0 zbe72vcRz=p9c*11rH)W#X;p`i9b|q`$0l!NR!u^KSCZmTRM3n1^s-EjBY!dhi*&vL-bKhv)1V#vViUfv+3)c}YZo~XJ>GycRbr(y$&Hs4x4N77V zE}(TkE-OwC<|bn}wBFJRP-|hSToLt~5lzaK&m>O~Tv8DBL(a3_!mD z$h_9rUs;G*u_unBPlLM)UO4xGgRmkauNn`#k`p8q;E5_3F0LpNF4gq+B82v`5Zt(p zPa$$2{hgC=zWovOWe&DMam5b`dEHhU541YJDmD zrk13ws_C^|{fISxO@sl*k~@S4Xk2o}@Qs^j?vhj-3KaDzY=$tl^QO#B- z`MLY+n-OEuHx86_yKlqZ;}kmACL`o7f3>iyLy8XlM?doL^jDL5@cu)w8M%c3BQ$>Y=qiz(ZU8owpXq_B=n91V+^+GYXO?>)+St8XH4BlfsvdCU%!!OrYFq)E&g-~2!3CZe-ZIuEyjKM6-%n4c9LT{MqB<*ztMQM_$(!y~M zXX)vK$`Q_Ly1`ECCVALjUbuad@_cC)D`{nz@XAK}y!3nVQl@n#+v4y_R!;d zs=l~)I8>#t5;ijyvL>Q+F~amkw|4cJ1(~0?7K5qDLj3?oOSO|xvP<2<#7Y(t4}m>c zA8S-}+-KKOqSqeX*QJZwK?&Owr=oD)&B1hh<@Beheun&}c}MMW1Xt869QI-3ZhrHr z!5cq=j%+aZTPeqHZdsv9$eGai7)(ClC>oAmlp4IfMn^8((%*!`kZ(BwbKAF{&NRQ@ zm7=w;Tjf-@MGpyW`r|@S@O628#VBC|5b3D%C~jQX4*dF9zX8P}25@^@*z{l}{P@_PoB0X+b|5jO8Tv3s!D(#moG!?rN@0M5v z^XD`P)vvI9c=D;|XPH~yc^y_!F+TYII9*f{oPl7er5Jc$)#O6|9E?1}Fy9|u-5fgf zlbq|BG<&O?Uc*a-`tfnr{wZ*i5KrPpUv74$Q!q$eelC5lBLjIe<&!Uv&OD>Wx=_m~2alHfKu^$AJvsJX-rJWz@CCgQ@iP76ad* zgNH<=K0wnv)KC0Ta7;3R5B(sv=Z_ttrw&Yv>0ZTlzk@~o4tm^bl)OqhjWNqvfd5fusf z0qpTcK7fW)hlt-h&w24ps(FqmxZc7*Pj0$&gslFx{1S)4?Fa6n7OQS0EGb1puXi<& z5%>zdMRD%ySPGM9ybOeu%z>pz)(JX}y^elC5TaO}?T^-XRD)GWQC4^jBOkt`Zo;#I z!gt(z1x;NEUJovh`|rrVm-=_L74)9OJ&UX%qUunGahTDx|m zEA*{;Z1YlV6sBUYI)r6gT62G0OljE)#EzsD2YUFa{~Bc18u>hh79wCqwqF^vu*T76 zDWPKi)H|(@oT5Z+C&~2W^@__m>aycr;q%K4DM3?SsOs(+xG5k`6YYb>O79h5^^)aL z1o%hx{KL*AAphtP^%Bv-FJF=?SnIYVe&XU9s~VG&6a}mkI>|i#;EX%cp6dTH#F|SxAOlLjY0HTdc>MT4CLGBZ=P1n#(3QUhohg_Qbt~J{y$lM>_b_JguCloz?W{#-4@NhxA%S7Cb6KhWrfV zk(Yv0u_TVtLiATzTzdlsV}rFk5G?k^C{0U^?g@D*luxZlw?mWk6IbNDrn;6{3pg+O zA(9nKcQ1DaYi(xim}kkQ1HCZt&JqTwe`l8zrPfnFB|LwJN=m4rBS~NAY-Bs)KT~x= zXgyDmbFT_%iA_JwyVDv;c2i_(XGzGHVsF*_$t$r)`aDolTlu~=O#eH(;f}+l_H}sw zAXrS4l)Dtj$#0ochCUPel}<6@qDZ>a0i3_fDdJwioVLIw%RuO10P6Qz^*--MXjcPO zydabUJbj<^u+VoIouPpp;!)x^c}L%>n71%QLbz7Wc>0nM3fFnUUBr?gBcn&?ao_ZPYWg!yB}IK& zVD?w|NLK9x0lZJ5T}2YIEj5R#pRsm-7z0j^BxD1zU}%lU}?%h}tfM*+s_{Et2Ee|uS!S5?OG<2v;!tiZ+Ijp(>wOef6t4BLc}(Rle4 z<6K(je!zQ`giiQ64)l49^A|2krwt6uVdZgW6cQon{+HZtIAvwRAi9kvKX@0HfrI z2;WWtbU{)(Ppp*@%=m&lLPGI=szkjUxTs%ydx9AwRcwRQe#)TBtzJP{*XN2k+d6GGN7}%%^@!H>} zI1RF!={qhh*lFf3XH68(p&pduJR!>Jn-^#>NJsu~atRSHW7e?OjDlr4$_Fa1@An;A zZ^+9(9NIr<^xeSc97Y>}W{HfFaS$ zd3YmKd8d4gpwS#y6@=e4*LcThY(i>zS|SmQcu<~@>Woa^%JVp-^v;d$$jb!#O=JFY zJFY^=bb}wDcBXx;1w%#3ajbY7JJYLyLh|a^v_DZ7i4)JhKe^Y&*45$z;>PfZ|dRu@N*`9J2-|0TOb$^Hm@NTMz@uK+bBZoyvAIK^%b1#j=bCNJC1 z(BqQgY(kj6Tk6fvL+8FMmkQw{O*gBW@cc%u)IA{!Hmj3JRXarA*|d7;!w_) z+RMm0CTmh9*5nqmgCdLH!_W$_OU%!ayQZxyh!qz)7BY|vg-6?OEaqptW2a4ubkS?y z9CN3ZD~d-szWh+Ei=V!Mp=o6aAHaBgI%J5L;#hB7^IJl<*lyT2WE+`9V+ql&E>{e) zsRJ}hHbss|;d%6PImKXZv#@?eM;!=zg*s)vyLRAuFs-d#H~ItR=1(}H&Gc}d&q2Df z;Mm_iH$EWBLcq{B28&HP)}5J&{9Nupcz+`b@j+`aI2oPAaF_908&*oYDR8=6s|Op4 zs^2B9d$l;h#HrHKpEosFm_nFozx7~y@BGO&H4>%n)aYOOe#hft;fhAM*5h<8*_jF6 z$QWty-Wb=S#8%CFg~Zl}WVRBX#B+6kb_16#jk%O^roWvt2qhA6?J>G2<)Hz|r208c zuiSNU34WkhhKMw_#6KzZt}yLqw<5oI*A*Fa1L40+0tyrv?T>fF9#(S-~S) zp8cRpO=l%gLn1m=z2j z{R=6D$t21!b^=OU&$y#nXG{8i`ga_rQD2Aq@&OCTZ+FZs7vmvV)Og0DAYGx}(ezCk zx$zwHN?Uyow2sMFS>^YRJT~z?iMbSti8hs)3jqRFONP?19wtAn%G1Z?hf&6;?6#4F zX+fC$f9+RYvr>Qju{miARYYgrn*6g{NCaQ6#YUKAAk?r6_w~uF2&=a7;z3Tvk~9v{vdJO> zfbVcB`eX7Dwj$ubw@$X9kLYF@%Uw?wI7^ZL){8GgX<4CiK9NM6;Sa=POpQZD2?1}A z8AaW|ft8|5MBKfvv`6dEQ9X`yWUx@(Pf6ilF(>7d#B-0p+jzbwE2Ap#?FRv?P+#{i8<78j@pA^RXr6LMk;)!tV}9XRRZhHCgzPDqPiM7>;Q&m z_?mg?zrFyt+WE==g0xWv4sf^8O=21-6!?D?l>-{B z`R@+ohDy^oe8yVIADu?&tys|hLgc7M0CXjebhKc?d)Fh0XDqOshUy{OY zVI8w5$XfJlEN$AkP(0JBk8n6XGdkWpTs{#x!@at~1A{y?lg($R>aZZQ8opmp%tC$a z2yNjoC4>79@=a6neAWMJ2T+^I3jhD+B;i-JO)2xAZTe)k#~wL$tV%sTa|_J3D;p6X zOChBDyut@?*U27%d3*&k;#(NI+YE=5*c@JjJoa;(t$)}P3Fm3I;$C+yNv?G&(1V-v zH8032^PkFwUy7~2SevF|wv)|IvgL^MWh1g@RbkvNRhJrzum3FrMmMnrV;z{C!7G$Q z=uOY4BM(zuNBV0eQ9khYyf(R|WhBCL%z5(5*PNMPN9uLvRlG zssR!e_&~4x&j}XoB{+2-x$~^7a_l!UHu1hI>k-TDJ{C-A)plq`i%10|2q*4GaZ+A_ z-ROhnMi_s4Ptj^o>lsrL1C-KaMT(MB&$2xFwSLwY-)H988k7;j#8XS{S}Piyz@p*Yys*k27B zzCmopL_sm!Bbff~WBF3or%_sKsi?&M}*YiZgongbtRQn=ff2E%;}n z(;Afw2O}LBNZv{x(4YNO0;c`;a+x1BEZC3|`D1xTsz8UB%>=W$nyw2C0n2Y)aympc zneT**i7kERM&eW5r4#yxKU;KU{kI@w@Tk~!>z{5{lQO-K|NQ;o!{b7A-UvBxmnn7A zvMxF~Mfyno{@XuU3+|vXNjd=jcm3aSXIuQ=V*ju3prh^DFK43v?*4bNPwQU9O~jPG zm)}=-<{SL~Y+(W)QT|KtZ(c2hTR!S_XomWd4p{&1GyP9uJgEOGZS>{i{nZZpI|^X5 zav_F^vf&N+tbrJPS^i%9?>G6W@v8s63>Qqw#|kZ?Ptjl3+BFS);R3o&bIzur{Y`7w z8|~jx=)3Q^pS^VgFQuhl0)af9fWn5w`r1$T|8Kfc!*ih8kz0lSlR$K2xIc~x=%(?f z^4=JEH=^XJB+H{tolB7$>0eaHiT($szAX(VjbR6H7XN>le~2FT`9d&YKu^YMQPlho z?raxLElpF8=>EmjfP&P2pYOapgcqLq{C%Vj^MB}$)vNnp2CaU|V$%3eu|NeYPX9l+ zY)7DJn)+bQELt82-At||9D@GhN&gGgCI8=R^1;63^Ec+mm8hZ0{kGv&GIrbRf_EQU zG5)`pZ2S@+{U0IhZ1+EQVv0G<>Gq5o&K3#jlaCqJ85FsZ{R_3gfAqm5TKlqpu9-DA zu=A$%78qn(&;CY~fUU98>z5{cul3SZ^IlZk6o0=UWK{rBOd~wBU#HJ|P(VQ1wNYe2 zkcQir1z$3%IDrpV>z~QFT;a#R{=sH`PcAhk%jAkBnD+3v zQN&~R{rA5}&X4*-n2qp~pq2fPB`Dta3*R%dDsie8M@r3`!IAG2G&Et3`$2>r{X!t<^-Uj!A0}5LD@PBWS1Wx*_?pp% zp&Uy~iy-@T`JA*Wi}3&AU)|>qP1t_KEuQKODr0^*Uw=t=Gy-gH8uEF~uUkuQzEsx% zRn(*zut|y6{zVWWamZfae6khc2lVza(KXvmFQ|-HU8vc`Us{qvC$QYJ%TVd>f_`LSua8NOXR46w z1pr)b!-43CFe**@oq5N(e+r>)D68UrEQqQ2FMlcyM?={e+Bx64PvKg?gZiBPxP;5i z*uVU^4ru;;g#6W+L)>ur@radiK~nQhzUF$QlHkZgJ0wiI_r z%k0GPWjc|6fKFs>1u1vL_`Z-HA)0#`aH>n%tc4$2U)qn^&%+Rd3F^7Jepp(2;#VKL@F$IUT~ zuR8;|adFXfVhg%Uf|NVE!DP+eGQ%WECTX@Z^*zzYrf;-3F6~z>_RKvLc!i)yg|je? z(?=;1H{*UOr;CL#IxaBr>@-69$gQ4E$8@eExYjaI>}-=to)&X17n1%aFGS?##l^k6 zJoXty33({HY25|`&rjmI6fq4O1t+hDnn$n@hCdSutYa^UrBBcG%c*a0`xder4sikZ zhIiq|I9R~dIZJ3rrwn_u6dMp+wQX;F_*B;0QVwuP+|5-~ESD+p1OTbKQ9F#nuv$>czyEvYLr zXIZ2bi@}Z4vn4#i(P4V>y=A;Vy}RJiM4toYCVelYTk|P_iq*B%e0d&z&b}>{lVf+q z_&utB{WS`*)dR&pB^VCofMa?%{-@$yYQ%njv99Qu8&}tP!CM&p&2SO{TibFcvxQIR z_N^-wa7MUwy=NR#?b){*yy%YYQh8R}>&d|Z?-!wi?ApX|PKJbjUhR3v8eRI5Z8G~f z6ku!>0$Y<%;nwKEM4TR_Tyl5L#IOH|V{Pbt>&?ve|>Io7#bg1$ujtWcsJwv6k(!k;N$RB6tKFw%8^FL;4^r$((9t0-p@T^kVC(#$30J|M1vd8Qgaa9>_+ zSFCq2_>|0iavJIEZ# z3mK}13w#`*(QI%dUmrgkroOtndI6kuW;WG_0#67fxGD_!%Mdjic%zrMyS%{w$TiiMBb=JQE>p)7buQ-Cm?1?0 z%(iGQcV`ls4=MU*RY6i62M0TOvEMXPDi}ULjh}W)r57PrWizCoV^Lh>jRbf4!x&Lm z)gc=~V2_^iOlH`l8XE4hhP+%&GrK(1krJfi5G;-F@6O^EP!TeP=~W_zSw-=(t}0h; zKQ1;U@pzbhb|Sk=vzi#Md&QT31gF8+7rectAMgRKm=j1)QQb^W1s+^uE4Q>z|L~UU z2a>99+mFD>g_)6>1!W0xbiQ^JCnfet#>tn{1im1$&%RHAsr@HiYBcL&iCegz0ucfk>fFEngzK-a?M}=tZ6)R}b@Qy-WfYzQY&XwhEDarlbkmpZs{q^Aw`r#$M1~#1EF= zYptY7Q@_8^P)roTgP_e+P0F5(>+RO1f(UjAL_ z?aP+Pd)m3@^|AY|nY8Q~ju-u3)x7b_xDdJ#K2e#+?)#vN2&szBnG6^wO==u-HcVYj zk4Oyu+^7%H2ExQFmRzY7Gt3t#Wg49t7AF+7{0>aGhYsso+b)Db63DhYY{kVOsN|d+ z%9>7aEPn5^H6m0P#!U$nzj#m&o#XL<3|8h>@K!rpy03e6q&(Jm$_7Y+#9g_Vy?+Tj6Y2k?p*~YMww^-VTt-S=|0XJ1#(mA{gg% z)hMN}l~aR9^R$=fySN*Bd7abs7w<(uM_Cs3(P}%ht0=4M7MNWCxAUPOO21oQy2o0E z^TaG3_KDK3#}X)?!#WvMw?yxZ2x8`h2twXbJ&}In-^(IqU?*70(gt06FdJuEdGJ_P ztT;6feGB9aecRE7F(RMX`_x~ zFxxjc=H#^1Col+nO+TkiGaf4at3a!VfV6X^ARU1VJ7}?flx)>(TAI2@#&8OnPtV3d ziPq+Gf}2(Hp7A?d()~>fZcFSk4&Ywi+me~0)Yp99YIg}^lH%&qq3B|RoDf5XO; zio{^x2>Xv~FJG<^$KjA0mw>&ZIyT3(95AMb!4fK$ZTU*rkGM8J+^SiaA5wRqGSmL- zh1*;p>AGm*X<6h^B<~_)V1WfLeuO2D{T+=uEO{rDZgWRlzmX*Tqc{lCBjkfi5}RR| zUGV8{GkAl}Y;8#sojiRuFocMeEQF-r^r1VHe*5}SR8(qfE=37tIse^=jPM^#J@4hT zrXFH%ac5j{>Tj=mU{(s$FWiRjwq#{QjgHLdt1qvYZ18{ENlJ`1+2>Ajym&4Iu69RH z^PZHRX0Lqo&djg?jLF2{NNb8vl(XI64u2Z#&XCwuR9n~KN|jGP$kP)9;~}3C^b&&1 zS(XMM7P_M5)|%}wA$Si;NRVzIzjBdK_=p&35wOa0OQqs`=OVJi1vd6FR_F`#Pv(av zIHQ^%E7)8>3IOqW`A>q|5DUX}D$_M2x71e%2)nU-FD7TXAJoDOj17GQwoWMDHcmP( z?yKqtLtFFMfcl;el1#RgV|x%GhPc8>PRJXqHFzKmoMgn*ktAXM_c( zsWk@q58EtL1a-U_{C2M%3jQ@jNMs?<1k%|$ByLt9j%=}WxfT*Cek9@-ccZ_x1m^Uf zP*8kVGNM-qCs2LyUK|PA!JgaczdjfZSy@{TvD7+vq@yo=4T1iFSrsHtY;1Cp)%M;< z{3=<6l8!)!;?@Mn=swPBF{z0S);^2+0-6fr1`}@yd%B<3)|wE12G$4lgKh!HRih-|H|bb7e<(Y!+zwH*)(I}#_kuxlBUbSX`_TCzOq zKbQ(J9KSfiNGJF*e)Fzt80hgJi+Cr27fJ%=`{_5Zdu(o^LoG&^vW~ILS%i`{`);OC zM-%`+CfH+tZ%fzg)^?P_Tz@+1?hzD;Y-;(+z_D0`{QqkGvRgg_P|C7;ls}K2dslmz z;|Q9-V5ekP``%Ypdf2tNd%szEd>@9ck*h86p>J91d3Ual%OLzju)^Mig!{C;G-n+% z>fOteC^)g&oqosvTiW52$7TR~WqrROhhEB3^d|uimKMr*%e)kbllL#LwA8ew)$`=s z)6!E1;&{X^b4z&)T!(wW!GqJg-PK);j!N=WRYtVGXYNA?YhQg1l!rLrS{)@o*|@je z@Ka1TAwUenTjf)wFCqJBqz33~elzACXTJ~kSs(U6Sz0_ea$}krDy@D(gMJ}ki_h3A zI0yZ>xhRiuUk`+janiZwlxjPyWa|2R)89Tt8B#zp!@?Ax5zR~O6~jcCgmZvJhKy-)9& z3jbOxLG~?>B_%017@My>HwE(CX%Y?5dP5rl1)o)q9oqQt6rn{}@aoaPhE$86+2wjm zS!G_zMLMd;Z`A$rcM@qa+>57bGbFYE7`pgge~b~tR*nkJ>E5U%(ZOyWtwW0`Og9Q+ zh>bf{QLK>^G|@u06+3$cGX+R%?Xlj6V0Uv2G+c11b-KDPP0K>|S8HIM9!a4PNs7;4 zNDJC`c5WF8{r}i{>!>)It$P?kfZ!Tjg1fs879_X@4KBgm-GdJ95*!ko;I4zaI}Gmb z@=cz5pSynVT3@gEqkGoO>gwuKRj2kjXYb9s%fpspcZQ*;zQ1pZtQ!+|c>XefZ0!zn zDBIAq-_Wk4SzH4bXm{K%1|g4^ylp+$p7j~X_~w6v3~bxnEc#r!Lg?XZ(`Q0;eo{}J zU2M`%>U!69rE zRLORgGKN_%?}Dl(tG&JC-?oqn?F{}H$UU|Vj%O}(-gd6*JYE=+-UrPG zWq(lWt=`L-m@hpTR%f|9I4~Xz!>~5D&D>GRP@2QIW_ZKZ{uEx#(=rMi+sI}a zquh2FQn8blsB;Pbdr|(e`|lT7U`;T4t%(N#K+nuLoXPo#)AK3*eYf0*bokD1oviwE;8 zRpB3Gs;iu*a#ukA39&vEPp)W!FEk`1`l0rpZVeHXPXyeN3kVssm{B>Y{foeE|H9op zzWt?8ubZqep9A#?0t!cXIdbRE%UU&%!eF^(z&;gzsE2>&+}P%fC(4>p1=6en@+Htp zYZQw{vLJiOy?2#eINxjb!P~VzjswF-05xW=?!v?;AGY}h1)EH+OP{{k2F0vFg)Yin z{`p{3#2-zE{PiB_Wy(dq0LdOx1GJ`e+a_82TXf5yo16>i@A3jUm;qs^#P2@Q_-$g}ZRh6};z*1I zQLzW&$ECPib_@plXj9%I*bqs|SyL_=3*i!r%Dq(v=nXNf64^g}ze&}sBabs$-f;5D z@PT*wxI&;u~F1t8qC=1{S3bz}0%QOBPcGhP{R8v@(?je%W8b*#qm zvh-2I*5n?K63M?msQ7J*uN|Hq$%-*H&>#GRJTsTdMF6~bE^O+Km+PaA1!U>IwS_*b z5B(dMXj+26>D!jZ?30s+yQB3=)d?_Xa2BJHW|9*A;5u{nx_rBq{qMHv9=@i?{D%Vf zF41n7UcqrmDZMazi)-qIC*r=}P6``ZQrgOek^QUeZM9gVw@Xhm{;`_Hku+?-3$h4k zu&Ux!Qe}DZwcFbu@w{-aHB-ZX!!C~M5R7R+ohDF6gO~RrCV}bnQ-7Lm_WG=lcfvkx zyYn|e*|FMp0YVG`q`#)ls0KWleE2g~o5z%U!BCp2gMUX?KIZ!hPW1z8LU;tg3%cAgAhzNWcF2tpCq3-~s7| z|6a?*EJ~JrJa2LEDr)BV?`_y;|DUKs;upz!lxGmFPi~a)sKN@f@h^e@#V{no;T>Jh zJ-%C8=hwen=0t!`oK=?h3$73!#>S@CByIAs_Dmgxb1!W2>%4w>U0(38CTD5f<+T%p zAsJ3AElAoV5RS)!GR=j!2bK@=s{3Sq3vjMw*`z#@fJwg_AD#~TfM?h~5~mK;f0o$3 zG|Rou4%6IZ<-NT$_TIU2yF6%tgkMfePg8za+a?44%?0?+gUN-Qm!A3$P~qCw9@WWP zm((jc&ySk)E4qY@_5Iu$&sb1O84=Rg8SO4T9fRd4S!oVO0WmQ?9j~sW3C+F){P0gG zXGv1U5(KJ1qkWpIVx*6_VW$#Nq=VX0&Vh!HN z<+ofGbeA(T0;|#vjFV4uZ^hQls%4V^L`bqTyK3#w$-nByy6INw~stj6nTNt;#1|@T|sc z>m4kSL!%iBns)j7?E;!SU=`=7o_2s;-k-((Ur%Qn^)r$7z4dVPF`N_o?43qb4w5*L zyZk?h8HoQ}Ky~^avlwM`MFo5zT zFL%RXWdbkgCqec-Y9nF_+JiE0;JPh;_%zS;Btdai)f>%yEF z#QcMh=VBw?iKiCqANi-dwHA}M!c*gNA=TPsd-T03c?{Wn>)m(QjNd}{Mk<=>oRQ96 zhtK(Yjrc(>|Y4 zPyO9(Lj5-XU&Yqv_ND2OA{5isZ-A|}+T!@~#YhkP)#u5x5Xh^s)A{K4Jl>|}imX_+ zq}-lU9$5k2tivZ=gs`@5|1z$R(`t+#fsBWLX9_v0zgR)}3pz`iAAx?i;3>T$^4KqA z-bMBL9Gh_NucO3v^*f(A^;%F+X0FAS%C3R>{=Mp;Ik(#$lqN>GwpI%Nxs{!=jQQ@z z9xo3HmMpK`?BBQ7i5yoxDNm2WJ**)VYgYD z)F%wrGcn$~q>GiO;*0)qqi=(l$wgYZwQ0l|4XWBcsQ_E~?G9ghV+j{5G%lJfbiRbv z>(`$xq^jiJtf{J>{(sUK z{z7z3D$(jQ8rz5lN)LKeF2YDil?;?N-_zyY2&1u3rr!6jn{@YEG+dY1bdaZpLO;=`DC|BxmLZtaF=-u-ygy-3<9LM zA`ffWzW^Tx>GXPd&Qe2OGTkfyNdjoo`y2_Xx+7Whl$eAN?|)F&Ug)mU*?)3m?%U|~ z9-k(b>cFUi`6=z&PA_jMuZ6*=W@ob%^CypO@@R8$V-Ow!CaL0DqA zi;ra7>G3muHA{RcYx}{4L~ukHH@KK-BS3K{9^VRXq_=3tVSF7s7UQ(oc8@GZSB3}s zzYr=U3t>14lHZUttS+xr2kqcQJ4B4EO|+=;#R5`}3}x@g^7dxOfB+ocd>tR7DYeTO zTN1ZsuH2Mvi&P**x23X>B#_l$F5q=y-Jfl?VmP{U!$_))g13{y7nZGS35X`VRWa^W zat2u*KlNM9kH+!yXqv~Ra5}$PVEgQ1!EnrtTYAkILFSDy_uR(0EFDe1PVwCvp4vI> zK0;HeQcKkGQJZK*lg*mGvTqxmi0)PpPgbAcAUvlB#xDUh@Uah?puui4q=)1f328v^ z>)>g<65VlsR>uAOi&>r-3;1`={`xesAtbSqVL|h&xO__hT2+5>)%lWX;s~kMOBb;A z5k13gPHFbI9}FXhLqs>Y&7w81WVlSI*4iFk&NQv*a(A=Msb1xvgThq|vgpYku3LO6 z70?#fx)D1~b3#Z7`|-tO(MFb*?gs_=M1Q-JH30@7!R3ynfOhsBvCW=vMP=Gh0-WZQ zX0qSypSuDp#{u_snQtz{(N-!0f*P3OoqhGAVHT7D@pbtfyT%AS4+nw{{yal5DvO6* zxKO`^0s^UIX|>{cAFSx@s4=7zRlNFPpwV{T9thxj$o4`p=XP$}6hb2-h(EUaHHPqO zlz6vrjfsx6dXzB@ky}V)PAxkIj_#-v3C;%84x>?X%r){lI__0HF6mA&_f1g?DY&-j zcg5rvTO1!z#BsCNm??XUlfgRlR5l^pROd(Bu#gJhEkt!UnKN{(&wn;^K%kmbx4s`X zjQQhvo(8e35u=l(9Y)#EIkeXy*|VI2u^sq?kb+~r72hi{M=4#swR$XT-#1oxMP7&7 zcd6A&C)+!?HLjoeW8(b2H4-fRabalzhMksf&ha`TA~xDQ&}N}&eD_|1}=1aFcPQf;3Rc5kDEue z>-%uHz!i)VT;gMyQJH(N-IWb>8eTe?WY&jW@GU;>^>9iSIP4uF|9X9yS@045ZNrfU z3tM(rqY~@o$}VF4E65_V|G;$`K@)m!Qk4_#6CDe%);0W#xkW`%#EXsES1(#^6CvQ$ z)%3(hFTBafIRDccW)7$(>dRpakK;M^2=U9#|1&6&3L@Yg`y5I5WU|nRoN5M$FyCk3 z*wHXmusmYmi%Ujijl4e+!HIEt`|A6!rRT~erfmpK^&8j8IF~rxlGdj>@h0gsz?h0D zRgr}G&^4vD$#uU>KZwF~=lHv`s4JN)7-Wa*2E$cM=56L#(lL2Z)=V8bHeI~X+Jv|_ zk#NM@D|^N@wM5)g^ASu#40Vr;R(`@v5c8U}-sYY9Rfj+}Wjz0TcGh`}nd`F$QpfT~ z#N*Ee#j)0n-^+!EDw35^alRYR2bgIKeBzi6pjcEeT5sN-(-g3vbDb(iJ4?Fj^%B(b zMAX+t{aukIrEE*|2jbL3H_(-n^1J#HxV?tx+bk%4&Pa=DpEo$kGs#<0tUjqz$zItt z+5ZB&#*AA LQywOltd|r54$7Ws?J$gf7ZmKgdEZY+yI=cziul=xL^kab8`EGe{15br<~OmpUpYs}>{`q)d$!rVTM#erkQ7R{VDK>r9j z+jECCx}Gy48Mlfa0ByBr;cBzkedd}C;^LYXH9F)p8im3!!a6A^q%=5d>EE~5jo$m> zk^78I%w|zWuO}ySA$VydsFrNEm*Q9Q({*3v(gxoB@ZrSz_h~mbN0|CNjy-rvYg@vz zWJP_f@=Zw;+?S1TVr4u{%3W=!K|vfhh+WQTa8h@rnT!}MMX&XC?4{NiW(}AW4%HbK z;x=aU{BGkmsiM(!rpFgSzJWoeA-w)0k`#vcwf7l$6*#~(aspSe}`|o_rapP zV!KIx7P-w^u+Gcf@x`^C*aa(zE3A%(v1ogVh+U3Yt@Vz(V@c`bm#V}0>CR9<>*%u7 zx7hfeXrAD;aiaA;)eM3$y)Tpo69>+dhtAVjP>kGDQ^%D3!I%u>TVi*qBli<8(_qKR zrBjGMnBiVC|AB;lZJ`^fCEY=?P|4Y5KXa-@@e%|$%{5!7CtEvZ)?WVh2h#c5w3bH- z;4Zn{vP2oCGgYrvSRh?Yrj~dOz*=kNIUJcN;gw-b@#OZz+KMZ|O&nv`XgtdvqC3mI zTcJ5%^ZP2)r{eai8AVW}adhdfX}h?37B&^aEL9#4OuOdv`rcARmgATp*paOV!^**A z_Q$I@q`;kFBe!r?Xy^*EA82yqnO9lfpuCo`+ORGutbZ_eW&!-kK6_o&xIc9QQ8(m( zWK_Q~jlHV62$Ysvb$g86%rmzEUyj(srjGzy3}}8?`mKQKjvZzup0QBv^rgqgEw^bk z4cUY%$NhgGfgc0Cf72y%ku48({X?RnHm^vhaXvbjk9eugHeEo}H};Ba;DSUd=((+J z3OED<>h65wX9r(I(;mw7?EQgw%F@0|RM0qvvseMv0}HaZX33S29Y)$*P;Hnwlp>!DSko<`#G$ zcFEJxZ+F*JT4rs$8kIQFL#*Cu)>BEu!qOv_w-;4Su zIg!r33ZJ>!<@+m!XV;F52yvU0xphfWD@jC)BGnmAP9?&DPj}$th#kjieE)NcugCd9 zb~T$np!u8k@6qwBV1e1~nCI1e-nJpeDx%8%bNNi$t144&KA~mVPb3{n_VLYG@FlvO zgI1Pb;bOELBm}3WjVqI$k1F?e1JaIte+>^U&K-i{^hYRih72~ClsIz&=Vi70s^X(t z*zb2;a_@XkUI`A7Irt!*<~}$Pj2ARCuW$UaN#Hv3(b4?2@3-eBpQFD`xv#WVCxt#O zrNzb)J>}W#yr$nhw$5FXW+T0AywAwSZhUpWnYYUmA>E@K!cooRyFc@$=ocAG$A`Q_ zNXsgkcOmgzhxD?GYs(V#z$~s_|L>q7&G$?tDCxbet$xtm)%%DbP7)WZ-Bk?&E z8bAUh#e4Eu*>r?4*9iOTr7AO3K3BrKH#Y_6v|b8*RT->Ze`c=iT^+Z}_WZG!Ql+`* z9tFd48OdWM)AmYs+Hp(d(%qcFtL1`h226k!oI2IN>IAg*9lu=)zPT#WkBtJaIxFe5 zZi43Ti!-PjTBrJ)9@QS^JivlXeXPwwN zajqFW^o)*Jb&A_a>Fn{tMVxa8*Q=-fuBgP4*s0d(r`8u%!up2Io4V=;7Ac2NnyN=t zB$*5)PhidxxcDNCXnTZ!!1+(jdBQO554IA|yGk`@vAx%hnuh{W>sR*EOg|Eks3j@__nKlIE`!MFUYD-))MRhdmvm zoBj#e;=OfXUaemcj<-B`9Eec8Dg#t4m(VqUkh zsBFWmEjhRS;+Stb_cuiey!po?SqXC*T3fV)ISe}?`4p!r6=s(Fo&3g`g(}qD-;JFP z47JNSwC)DWE?}M$ESG=YuClL{Tp4H8`MdbY(7Z=()q_HstF~2*!y%Uwd3&**8Yw6a zWnSqAyJWgB-0|@_l5-MHn@9POLcGN^+I&}*Lc3&@uP6MV1r|G~I45dWengL|k+c~MoHkVJqrMPp-qnSD-p3}}M|KeH)SVxMJ{ zm)lOcC71bX{!zK3Q^(hPZNBBDQ4?ML-ox-QB^2J$Up$|f)0!xZHR~Bqbp;|9)+D); z+lP_PxVOTGH^;c}v9yg0DXp{-EhyF>ig>56M*T%)z4V(#?sbz*Q**DdTYzW?bN5RN z`X>PcoXI=#f8g^|7Gr+=2@Z@A_FM1O3FWA{PZkCH&+LW5<<~Y_x zqJWB10mcS-QXk{f#Agub!b@ELd$(iopkRNLl@smHFw%8RjtsBEg=P=}8;6#-)PB}9(@~_WoHmlvCSuQip zp?`#S7rv!_&>^zmm>QJ-<3Ikhw&$}|WI{jno=AM8-A4NJ{^P!M6d{H^_uVK?SiyGO zSp{5=DvEAbOvP_$kuZVMu=9}-=4zX+nHgX-WaI)#$#D)YmR!tm5Au6iV}U(eOfc0!14f@C0SE3U1|k`G}%^Lm|rGAXkVXdn)V z2AXQ|*d_!j#q+4EQ~oorNmK}GTZ&f5wfPD{cUqEJc8fBhnKz4fwg2ML+wSOah+%3G zbT?$hGmbEJ8GIM>4AP?q2D;3#pK5W(X;t|w5tJMRFLYl|26;FoJDG1<_;$Qub5Rq1 zK1$Bv;%IXj|2lVeMDS`LLD1l5I9NsX-pE)A={P;SMjHxENa#hGg#ig^dcpe=I|=>} z687sxbXUyUkf!Oy*^TGfT)Z$N@0Q9aUwzZ`i=Ew&1Cmx5)J4C-Dyhl6-}J9s7Dp4; zgBj6e!m==?MVc#_aLUehP#~M=>|Z}Aq~?9zEP#|!yyel+uiCI-p}N1kZq9@KU;V4o z&Xqx={Ai?wQ!p{69wS2IXDdd={Vhd;{z;LJ@-80x$WX*#9+z_zTxo;2o8xN4*d zu+x~^V$~C8%Nm{WynsQpQ!JYmb!5dL6=2j8As+4d56LfstFZ(ki<>AyrI(UNh$Q0E zXH+0wN1m9u#{R28G=4r{PHFM^D=;h@YJ=nadel7!hwt%rFG0jb;jifk`pD2v=Skti zBtUWwdA;agwy!&2r;{1+l}G#Jrt)^Mea;axG6+jct~hvj{y2+_4sv@_3pjDG93wf{ zoshgXj(!l3uBL} zHUn0E(?%*nAX=~5C?A?kysz-JkzZ)>FVpc*b`pIyOjyUK#fG@7GzI%rK8%T*Ce9O> zFn{Z@R^%(paC00%sE_iVEBod&=Q8!j4(TafTnaFUO%T+aRhT%3W(!W$85v?^dihUr zkp}hOIhSq%*MvJ7CyE%DR?y@$kmDQkN%whC238O9irYIQKqp1h@G%JOJ((_}f8ZFg zM+j_^0sd_0=M)AT$D9Txjbp6)&Oq8}V$&%0VZUqPsJRLk1!h>b;suwQ(1w#8V#Uq*I4 z6A+d6LR&khjmI&qwie|-rYlUW#yo>0pMop1vO2s1ixsz3RbWk7NPBJS{n!2H^|u#O z&UV89UcpJ?ZwPx!-F|P+;N#=Bpb?|4EgshAs@I0JM8QX_b~o|E&fU{hzpV@X6XH3` z>H1<1qvcrmWM5#Ptm?QP_lVPvn{|(Ufm2vM zZ?|=tovi-F4}B457h!(P_-ySjl`n|xN!n5mkY8kpM`E=<sOW#R9&0 z-ybz@O(roaKv>8(ws-Z@FvOevsC{PZ99mA7Tk! zjKyB6;~o2)B81lSK6QEjtvG@l10Nw}hmNKZ`wa57_fqfg#`*%eepPPYABU_6`e7cG z5{@P&lN50Y2IP4_yPg0>Lfxhw`qRS`LEI&Li_n|l+on-#MNayBg|l!mO-|BQykB;b zPmWWYLi5Pe76qRb%NyfEkj?E8C8lZWr*rllKzHGbwWNzo$K?68A->(RjL^oV*Rt^iPcXN@}2 zxZc(#5xEhTRwH>_2t%^}xVW*)M?35Cf?az)LJn1T`>xN3U*MJ&s%tUOz9yHqqzOos z5gwhe0<}(GD2~7$5h&$tBE{xW0#=n6&3lsC)oK3r9AB}}S*3Z7_Sc*7Zll_b3B5>R`5;Ip;fdT*2N37 zapL&ra!y`@65F$72GM-S8*GPqw<-#+HQs_~xH|^0I)?VrNU=Gt6F$AB3%GA5SZUUA z=FISRo)z7`n0ss$v#2~y>&NX!v$u2=Q$OC#k;`-S^#>%u*r2`?R)$rdSomIi#Y*medKi3rd>4tuwBZI8R31#` zLEFMRQPVYjzCO#@DCZ`8$ax@HZ>~&TL`A|=KyAO0%3d{Oz0EOkX}zrVaUN^WIrFnc zc}T0?;2&&nSnC$5%lJ0^Z!SOq6R6m?+lmLzU-TsBl|kRH!u8#rZIv4s=kn|cVcgGw zsuYqG&hz@i?|xPx`}Ja)@$pV-paDu#^J*XNtFOQx#fNdgIQVRV*5jFuWRP?U;fPiv z+=aWr_krwd!FE_hZg0}c%Z_wZ*-UN2$A7{)O;L~>mkK#$ZX*hRJ+v%1IYu!XGNC~@ z&^JzQe#2J@bALj$4%M+3R1SO|>}p&5-uk2(4}HE$vy{w_&VpWdX1^d&?nFt2Yua%) zBBP#`QTHv!`<2n*!7`qbRYZBIbEUqe`L5H+XPREX+qiq3D8MwIWy_$rBCS(CDyW6kUbS!Mfx z#AdV=i1~A(X>nbXNl9qlCWfZ=u=u~fe=g+L#-Z^x?C!1~;^df+wo%GJrTQ#gSD-@J zuq=SpgnsuVH8n+jz(R|ib>%I1AGA$FfM*;JufW6Qbd7EALU4d^ z8ZZsvdfQ^avyc|5Jn~R}O3Y(5qkO*%0KJ*xadaNJJ|gSRyHZ>1iidVlDXNBG= z+F!DV4D#rHp88?ZA9HNJuFc?8|2ZDD#%%SA^4E2m1>RHo>uhi)@0u8`m$zIwNm37J z8CqyQhOqZi!l663{reu0Nqn*tH%mhMa8gl(3N_9X)M}6Jir6P7a#0Vb~m?fhHNHa(?vL)h#?d1!$%7EiE0HB0lZnPAdvO*YO;%2DWdwoC?47YHq@RqibXrVrpmH z(>PJ%18nTm38~ufux~m}n6LC^+8rQp`E+KSHcH-}^(x=`;i#@X*Ge8LyvwgJ5<4!t zN<=QwD-TM}=SB4v`))#@iUpgV2Xd8^<$Utl=$CuesUU(h%@ehhP0^L8$A$7e1va%J zZ_X$6nKak-eJIISE)A5fXaOvP(|HtIAzcf6D4GjIMC<;JmbbQ3%XgU9UPSFEMX#fAq3PMIIk} zf}WMx(^bcAj=nFj|NXZsIa)`S!?(j@G+?n#2H(EL#s;XG*xp}KI&M9`0}_$7XDq7LuXCEX!Z)9AI0?R%CLj7?!d^KC zLv|=^d8)O#@!J*EU6}CE6cuh+>IWPsAOQt*e)nAo@9jy-;tTp8!0Or;Fldz1m%Az* z zyfK8)xuao!wLWMtGSGfY-2e7uxh90aJ4EO4{4=Kj#(%hC(7=&BnBd5LZ#o++ z0g4lE6h;vr;_Me+xmFb=SuY%X$wKMoEXh`aMa1zC%_D3|6vWAcL z!um9iMm3uIT3#a5cV--z^lRc$%p(f_sG0obT4@jcOXo#M&)2M1AMrMgj%PF^Kr=`g z?LSd0wQv!}+8^f`wFt&f;1B0hRXE@BqFH$LgrzCclQoNY?`K=w^(2K#gqGX!sH2;K z>5~KCsWv`S4y33w*j-nQdT$Sm_O4D?x50iJFk{+L`;}XE5HV(^NO_nSYVUkZbnjceyho$6guB zd$rC)^xQ+rcaapsP)lPNlYw7peu-kduzZam&&0}ZOq77d*jrBd4Yefme&6R-+IUiS zP_Av0$m~#$E6#7=HCSWqE!fZR%FUbGMR5Mrj#&Ry0|_3DB$uoJJXFf339lWS$3mlH z!H-fU{rv^&Jn74*Uu)0gKCQQw3jgf^dzkBd4vKg71D3uw z?DGK@QHRA@I$aqlPnrjh0!1zM!B(;Hv^U$`jex5YRm`EcIZ@dk{PSK>?Fzd!lLsr_ z(Q!{j)K)Bfyh^%ov`570Au0P?5dzb$+48gew6urzJ0##BOP(M zCSS&W6CsKYLiP79~QI%Bo1M9HI%X=wnzdff$NvSz5eB{UDC^_S9_i*trz~1WH znGkbrlqn~fg12{OdJn;F+PcxU-O+bTzW!H=LAhpnmsp$Qmla)mis@87W1=uOlD*Ct zM6qN$Ha>Z@+)pT^&v7t0p_9O-fHV0+K`VZC+t!$CfUiix9a`%^L*qlb3A4cJ*d!WI ziHAJtI*y4G#e$-+>jp!_Z&jkGz&r5w2{5s(&@d}8lwBpi>Egqzyk|vQO;&!+-HNQ# zi>Tf&#BLWq&|8a*_uHVrl&0BIzk@T#L3cSbvvpIOxiUuIqsi$AUP)dHSwT=6N1@8w+4&4u;h;Mpm;bAwdTFtBUd3(S+ z^G4UI_fH^Iu5U}Z!z;DFDo;qW=VN7$#^>mttOD~^*a+}hkbvs)sl>|VXWRkB#wP4@ z9cN9H{Xcfq?<|QWR8`J;`kVO2j|MDz63_wNm|bv%cbH;uI_^u)g*i1n*QJGQJBc8coTH4vD)_*tSR zjwsUM!}|FO{v}eC?bX&&LptefYZRXVp;HlpQ+>!vcxdBn!-prnHROGE)@VQ&@nMwi z{JIMEo*cQ2^>aMDV>&dxl1@-b@5kH!u}t1a{*`{QW6ZZemdVb~{BE6RY-u*mey(B4 zN^!;e_6l-EeQ8e?r zcM3prED@LTTpJzPzo1BoVN2F6le#@W-3)qus3_jsIRt-Syh-5YAtWHeZ3T`6t}!>Ik8^EM%dV<6YR5d0B3G_-$EQ8+i3stXKK zw6D49$WKUffQupF>zZ6xoK63t3SL}PdQ?s`&mk;j1>fpScBqaD_zA{XtzQg)<45Xv z6immiduLHaD6UOS${&WA0S%?1=3^4Rxx`sFHfGr#em|ZPgBLHEre0h)xrnZtP7U{Y^Le_rV7NU#v7(F2`#;vlTPrP&T<$5XfWtiSO*S zC@_B-$=yK7<`}%9`(6gCUH(Ekjrb|XzT^;%=+H8Gq;9ckBrUruX;o48kP>GE;c9mc z;5hRHz1%hlCb(nTT~>YAn8is~2;;l@D6SD^q2%)(FKy_~_Dx{y_}5Nnv6O?aC+Fq) zeuwGqO2+-VExeRsD5T(mmhFSgyidl~vgzwf76m8Kv;P?0_b6FGLqAxWT;Y&iyNz?6gg@p{s1)Vz-G8(S?hnRy zW^zh&UTx5F&KQYtdzB6By^E|?8q^XQ7sfVOCzd@tVk?-lykmXG0 zP@AXlHhywOsMw+nR~Av44(0Td_`3}M{cIi``@z0>Kl+8XUTd9DfaPi zN4#84$!cs@O7#F{;nQ7YWS%NLY#~!p4eo=}3DNg7#kx0ta%RX$Fz@QQ_O=5f&(SfB6O zZU3Nm-Jbxr)E$dmmvRt5uA}0WF<%fDJx0toE(^AMmz@tb zp=f*?5^$I8HgaCcURobl4q{xjXM11nu2TriC8hVhGK&Kms@I*IFq}z9%*)X60+$$ zLnyPE!RxTa+OT~zqPPe=%ezhu52>^*`ffdL?!&U$*H-z&258KZcl!A0htndOmPUeD zSMw-i+7yQeN0kj5z;i6}Vobw*=ky-&-C>2)!>cDxQH#FeRhEw$UWpdyWH^)6OK3S| z_j(1C5&1BQq~}PoGWOVn%MAM%KY3d0+L18dkf^$hSoFEF%EPz83Ae&@^+eX;7f!N` zexy(5@P>-}?OKONN6?LPf*z?ljt)N{g2_DdA3|DJ*k+z@ z-@~JFI$a%CJJkMSk&SPvndh0vRaB4!Y>*1URXq9Lgw7!GE(`0;U+z#)Ce8#L^Nk?5 z5xbBP8yA_~s%nv8+LQ24LfxXb8y9cDySVd<42~HM@sJ%riA?1e=na$#zcixzSQZ4w zPf2atD}e+jytE6eWvFhNduIvYz%>OX{nt|+%q@b-N?zz-1wY6>VgKlU>p+^ITsQWq zNinFEg*hPs-w7i^YCj=<@@|eN9y_Xsllj}ekABJcEOUG|LnT4KgA!zH;R$a-fqV#} zPF`Q6``j3zXz`|#Do&oEQ3{Z2DuFK(8W*!qPiu;tcD5z-6$fhnOc1&g}o2oy?1r77D!*K{Ai;H+*wV*SvemYrcM(Ip|~~_`@cb;coG= zLHD0M?Dglq8y%W}Q#39Chq>>unbCC|wq*%2@d5To@}olQqQCtjYhEsfUz}+e=mtbK zQi1Iatpk?a=RM1Id$-Ge1EJ}gHW5n%a*faaMXo=g9cwVL$}|REDq!)GhM06pE@u=0gd5K(Yt{lN;K@W4PcF#jN_Mk+)qXUA+(ZcPSsP4RT&TzeRmUDhJ z+dpCacX|`W`=op!avz$|v?!d^Q~4F_*si#n#S`ZcH~iI4D1^6aba1T*J(r`igdz0- zjVJCRnpUga(SBU?P>h{t-4{#Ck89=RLH6S2Ks5!Q`T`u%vx@j1D>k&JJWsB=4(E<& zHx^TAQ)@lw{4KN1s4ZeUZ*5O8cVJe}?Y{Upu4r%Bj^f1rp76K5wNq|1S7)_wVBfsX zplT-XH$u(lMtE6C${)g()+8Yu@(AV~Z-so9OF*qne5o~Oq}?cI>^8}&$!M@V?yoWF z&5^Rkd0LK0y4SW8mkLLcmUW7QGi)-%4+dlrEV9vmayc}dtdUWT@k$%hX% zH#SgzTK9go3VF^tBQDn3q#Dt~OOxRq`My%hJ6%c7*KIri8|;Z-7Cq4b`=&|Q)0{~C zJTLD0+Cx*uU#W|}bkZWLB33D4B8>gZ7wOIMR|GkOg%1*~<;tuRZH+!LG5O}nQN{xI zqHdfjXvis}fwEo9N?dwiJV5kO62SlQY8#n7p1DvvYmfQb0!uz6x{KcmbG=3KnbG~i z+vzFsKQ?NQFkxD4a3CQ#o>V>d(ML{Ypy|rt>zd(lb?HS6$fMN-_QW%FBmh5R^1W6#j1VfAOI1!rxT( z@BA4mNB|>D7;r}=cj!=9G`H+F+IUa^Q$Ty+DMcj-XHJ{4*Y`R;b&uSTo=JzuiRi6A{$RV{K#9TcQS@mTjHK)@r%SbH(+PE3o z1J5zpDyJ!{P(bZcK8F5{%Ka3iZD}`{x9X-v4ZYZhJ%w zX9OF``+w+}1^P#{e~0;hd>N}Ak*=i^Y-Bf%|9#(#5f1;a=|cYLEstNd29bYNLZtR+ zTqgHU(B<*MXP~jd8|hia{P(WGmGJ*ZrL22CG1%b?N&lv8=y^1S`F4B?+e-QWp8Ea~ zk8K6zf0zIFWb;V&|M2?$J01URlKoh(%3sZke?Ph^GdKX7O-f|rkCdE&qtN`$ba>O- zsZ2p?WqyH|z-a8(4%3B1Lkrv1NA_gfvUf-9bK^WH&n~&20_IR9=_Il7m4fbrilx7B z{oH5Kw0hz?Kbm~`4Bbk?^7=Ehpuli!tZM?ai>tmM^#DF9nP6npYCx}LzV%2la3Uo3 zPqglgWxVkg_RNY!!AnftgPQojJ)`pEfX>C3TYx{#Q*kkY6NsMOcDWOc)#KV{t8XZ44upj z;UjkEm7@&=CjW%137kv};S+il^wifG3VkWA zT4@LmS%mrS=>_HIb+^V$b|4j(M=Kq^J+6hhs-V4^%pG`fJ&_Ha5?f;VYGL!idy?NsnGP%z2CdbJV>yTcwfN&;sLE}J8rQb30DNK3iTc7(|PGZILy~B#INhM0ZXjXSdkt( z8X-b~7>Dh}_mir&+ger&57M^46w7FZ?8kXbdcxW4GddlQR_l-TB+xfd>N-QEC3jml zj~^t*Q!FMKth4O|-+GWWu116y>_eCsoyz)1u)r4`O^IIX$Of4mX&N{#)B_TgZuw$e z)5}`yu~5|Xb(KPchx4oNTR?0sh{-J))!yxCua~qlFNF6OV1+>c|9Hf{F@WRZXWTm# zmC67U(?X|@9(#n0Hm+4$*(%;`QBeo-n%yuq(ACv6&0s>gQFO9l1=i4S-=u$K=UO`qH)|w|g8haIQiS@r9dr2EH38 z+^ZN^&C`dp4~vMpC)5$y>m%J!@9m~EhkEW(HWSJPUoYvcap^>gzX}fmgw+>o*WZ0I z%xsS}l|^C$xvX`qG!Ux+8d6u>5qGHHy0;U+!Jt4Ey24Uzc!G9E9Rds6!%S{RIRbs+R(jrKab!D)F&09@qLJ5 zGWq|w`pU34x@KG4Ap{Eq5AGJ+2{K4aJ>Q$}-gE!V z)6e|a-Cet@YOSi;RdZznSBUz4trwE#n!6#V6fe(5Pzg4M&bl7AVJW^He}zYuVN)a@$t@6NecUj{ToW7 z`A|tO28iy4m;}0kfu?T_38RJ<>y8fMq;$S2GLtc0esINZzft6dWqJbdVX}7*A1gi8 z>f9nem_P5ncmy-_G*>BJ%?s9gWQQM3PFQuec@m@Tc;DbHb{rf(Z9vA%oza7ujQ6yE z?#)(*cg=*#A>XGtaZo4kJ#c}2PsBf#Hn}~iJ8awLuSxyKwnFDDCR{E*OF_lOzKDq} zvl`D2B8}>l1G8Yk&9dgrjk@Ry-~RqCq4Z-Aqk3=zRGLEG|9C*ZrfL2X{6 zK$%0Ld29^(DoM6{nzy>}k$4^fRO~kAPsgLRN)3P6geLiCHy7#DBMw_@y;uq@IO3e- zA`MISsf^mU1m!_G`a1ub*3$IuBa5OXjrXFYJUj~XCE;>S>}&|KQ{}8fwVZUcWK1j| zHDUHd`l~O)lzbVt-@E%$Nv~hXgA?z&|^oTnaFf|aA zs!71a-C|wQad-n`-?`WQDQUQ+?lD)jaz=zUU#nVfq&KB7rf}G-LZ{S)%kGSBdnRW5 zpn;_>2i_U@xmvIp;xLrLO_!-BwF}47qUn{>%6PXDB7eo*OhL9uphyw4-dFCn7G0P! zl5I`q+75Nb@OWHyiT3>`76dmN_%L_9ZRo05xxK=POZDV#&->T}mRu{KXI2JzB|K0l z0$z?SWzLXuy4X|DVecTFK2{)~Q$JHn$fMUj4|U4slh1_cd4i3aypqD5Nx3T9QWR%g z;V|Gg4&Mcr-6EI9Lxj>W6C;%^go>K79AdP${>+U)FY{DoEnGp&qjeX*5hu!s^oN2{=^zlQ%4{+D#jFeSf6Xb|Ar$a4eX|Sm+ zul=3@T)NZ)8;ts$o|tk#^Wz%to=ilYTsDQvWe=Q`I_3f?x9r!C5kNGQYxNL~kVkGHykSb#(Dh= zEx_#B{yf_L6$I`LjnDL^ZDL4-^q1YX0W7(bd->`#=MVfLbt@xdwx41?WkOc9j4dB4 zkaonVSVpi&FiHLzKoHcCd6KZLaqi08UnJ$~y|*Y8oYylTg-uX8cUB;z?qF2*J4CEH?3>eUir(r&*R{SaAw6cgKe)f= zEUj8SLBj{^J10GQUZd`u^1Ao8gE$-=D0h6aZ~v38XV~+UoK1{C125eeSvMPf*heCE z#F9yU+IRCCi3hVK$t=Q%4faFIE)Y5AcS4&>vtDl0%hd)Ev2K5%?xz9kEY7iT`xR}g z;u0f?edxW3Gv3jP#pLThnEQ{tlt`+A6TOlfj5#xtwTHw#I7%$N9CHBLUa3;mm*WNfs9ccU_7e1$eq9D<=YkmjnF3;@ zZGZRp#`zcTga4*(C`k*K;_OsK<(`n)wBkJwtqGJzxBbq(DK6-r6CM)Dx+$}H+b*z} zzl7jcYS(cwKs+zRWC&nmnTeB@4Y+G;3kr0jqbn|b$jjAhpAq-JQ&hLvf-`QFk>qS@h=4oQ*xLc;=@s5TsNt-L+OuS=0P8cc5=I$&6S=O}>MECT#!fSZX< z=;o1lAQ{YkrYF1iPPB@(F z5At$*s4FcD3c0U(%ckOL2OPv7vY{Gf$>xPt}+||wY2f!7Qn+rwN0|=z3|A6xQm5<@U|&u z+U--6dHrhqh;MNfg2e0u=iNu^|E#%A{ESc!r@)TL&A@ta@aw{Tg7@OXNP>ipc)--K zo!_d|2L|v~Kbc^WJJ^hhmpUmt_zW!Au) z8b#fPRX8encLMS`O{a=Isct8G^wL87bZn{CNNW5lYHA?qPjFlqUs-Ieq0dW{&mRj7 zzvn*TX|XIhCtWGSC~w)v4;;!0`}aGxD#BHIxY<$89+NAU66m(Z>^`Un@Mb8G+cK<(fr?Lj{N6HPj zhesdu{2fkgm>A|My7O44X^I86`_EZZT&1vAsyrp7A9AFS3e!)QJx8>-m#+TF;i3O; zf_s+vr5X(Fyi4MQ)L<>B_IXR)U!GK!Tj4cV>D+EZ%j{h%N$Dj4`lt*j#!PrMg0&&W z_QC}a*m8`<+Qty5F}D~&^?;faa7WRu*05ff6L!qfqEk~k>eu2mj|tw6>RR^|IXryb<)$g>~F(OuO`o27*~0`2qFlH-@i8uJv}jA6@kt0-^_%jVl~;IceZ zdwo3vcO*ABKD5$k=>{};O4@h}SYA)qTe@T?2Hkn8mRkNetwhmFU-NvFdacIM#f@BS zC)HwV3%%h{`xLVpf|P>`2;)7+nypO8*^IuZMylxTe@l1{Z#c`Kzj$o0 zdLZ<$!(v|J>ZDCt3CC{g7D@HOGh(*GWpPpw;hb^5LOiD8p_+0q;0`#KE@l(5t-;Dttc`pqT!;HGv^jgjMIFqW`j-0BDX%ivO%fvTqAl z?d?m>hD=1?eOC-UR7J4-PLWvwMzkY1N&I>z?iGCke8h0VwgWDmV=h6^%H+`(Ag#BZ1u2-DCo)bA_W30_!d1U!h6MZeAEI}2cLUJ}c-6Xu*ZC?=#= zo>`%mERFcJ(Sg~5^oPlo1oaxkR7`>xuZcx_aSSbXzJCfCGbCi2-tcbSE`x<@)SrnB z7c4SB0VG>DYLylCNforqB+} z-*NY5$3LFHYE;|$JiV-!v(+h*AxM+wFs5pgt{REQq}9|c?<^jE9-+}HS`nrEeI|9J z4vj=?@5j*0y{44U74H5Fg$Fqy7m#s?dq`X{w}59-|K*=}^cQgySLpu+rob1IQly?X zEXWu2;)^6pc-7;&fUET%C>^l)y#fSPociuYY`k=v##8s-vE-D#2+G^u3|eP7ctZ}1 zabAV&YHx1Th4Op4T#uHDjPnRi7IAE$+^_36Cf5FD_4``#^KRdBd3U`pD?HQ6*B*7i zu~xw&>?4e}mOUkd-fPvvrOg1*rn-us*w z0Z#J#iS;tT{z-n`6+R%0FsBOf{g1iz_k%pXdrgKOWx4@Npx$8?|7nR^a%NTKZ!RE& z@2{2DWvE3P;E3#ytc#8Aiecv6rX;zBO&^D9o=Y;OZ?AKI-kG_D$hR-vUPzrA_-?nv zT~if}TFnhx67)W`38e?5n(?m$lMApEQQ<+uB80K|(L`V8&6IX3xwn9g{uNPhNIr_V zM_RAuRfV@LQeVej1C_< zX*-Tm`*fPRCDG@2L#isi7-&EHH_Ao{;_>gl5+cJB`QuBXtW_O&n8H6RKZ3R`^$*S%b2> zGGKBr4$(-xnmT7eSqVQJNPuM(ffJXfX5XbM4Xb_Z}E8oE22BdsB)}%~3Zp`A3o_Il^Uz>JMs}uj&4ZIcug-I@~%1TnfI#r^_)dex4?HIU_w|Z7+|m9g%s6D0SzD@Tn|7 z(=@NxW8@KWRyc(XL%ZE#sfD^S8rx~+Jto5&@WC#nnou>>W&Ni3RRMuD__H5fLx|vb zb0D}w_20NMSmhZ>Sr0UVu{L7yGqFucTx~uE*G+hrw^Zt9fViZuzYp`oV6g>1Y=lU{ z`+wknY_mMSXWON9;j9AAjtZ~n)19fg^T!UFCM_}JHv?=(8MH7g zb58`v@(U_$D7c7l&k9+CM<`kB{*JZSW<5*iJh8^*Jliq|%#eLMKbj)r9y0zWQ5Z;Z z)a!J_9{aR1G9ll3Zcnoy(<2vA{fBg`@|T<_@gZPhLU0H_X;A^(iyDv_1fVO8T1GLR+|eWazP-BJ`;9j%GXa7Nm6R)aSY3a&bF!kRuPE3KJ8gHRWrwz zUd8@aJr3T!yJCLf8$@5RtbpI!GY}xQEf%rYM=P2(M;Y#kYaa19)x*`FY{xKt3oVIs z-UcjwRQNH%?y_GUIlm&FGw56L15yRI;8{kLxNnkU1XV>WOO5*a1b0BNt~HNg&I#wm zgFxvoajHtPM?ToI$QlhEr0$tx+JB5tR$P+GwL&V^Y{*+2t)#-eOpeKo#Lk~qQmVT? z*jPb?t+!qDq?IdxRt^7gJ({(Np68QM7opbH^^oLru{Gv?aO}StRjd23VFo6@NuQdlB-XD^-EG7p2qzr&~6`Afb;)2?MII}yc%@_@S(YM*;bg&`$jW#s-BatiF(z$ zR`SYK5RjSygwtn-SAgyxeGfY9{$BVYkm3~uCypaWS9EPb_U(|DS7P!7RqXlj#v-J2 zOPVt=%rdxXO?;oy7Bzagt`I+Ccfb`H7{)m$s_h8H(fczZwy;56sj=oc@yBC-m1DQT z&Nqj}io7Ub`PRJdZ*Kz0T~(F0)3iW8J}KQCg|i3|wdyTV&DWf&;>f#nq*~(b!XgcH zQF>N{ZN$E!_ycbob9fvucc_<6xm#LZ@DfZ*AH63=s~;4o+;z!^oe9Zyrrh)i)=of6 zs={dhO4Pp?raro{)?N)_?j;cmh1xGKhO@61t|?;FTL;G^OM7@t?WmVHse1fpDrBX) z#x)&p;dq^}Wj%xnQ@P&VngH#R;J5R;vg*u3Yq}Ad*oUPN@}ndB@5UM-b`b294q@S- z7SEQ42D7?V=tr$DOByv;*{FJ!GyCGWiClim?zSOvn4AS3F}r3P{uTiMb(`_9ET*uG z^l?C$paK29KB)I6Z2KFHrSKw+uC&FQ{Tp`E5S+ae9sZ#LfvXTl`byE!1LHYf#1{ zc?;!#BI1Pj?v{&m^y7d_j|J(cyl8Mw$P7@H$#=oSrV0nb2Or#xFY_T?+_>DP=Bi2S zOKWZgzZ)B8aAtFdNMm!MeJ#-w>$0;#jyT4do-WTFKQ`x8m-TlZ*eejixEDsPr@-Ll z4FuRnd;ljzd)#M?r9Sh!tqP|lNz3|58xxe}=jsI3a9FK)6S`x-IpS#iR&uI`z2t;N zd_2DLSr@lyC4I{8^WTJYrgwFW%G{wlx>y5DpJLO7 zt`AZ7I$N-ZbT~Iv1$B~%tHvZ(kj1YrJToK?ZrhVOp;cfYZ%zaH&u~kpdK{mA6)aO{ zU39-@Btu{vz=vc0%8Z?o{j%T)H?!FjnU~g-#KRCrj=kn9Ge?iB^Dw05_YcyYOa<_v zGiqe}dRR55|4ne};;a4G(7OGO{)RD}-=CRd#?6^KZQ=iLkp{ZbU$~@i0?& z>qLYl(85RghV|goYCM&4dK`b)3^JaH32acu6odYJJ?C2f1e zc#5;AsV)dio;Vmx4r@O;nvACd;I4_>GAJ*!6F8bzIs|`O-#-}>IcYQH19B=nbAO=; zNpmrppFu)dIHAlG={4@fz7p~_O?=IB>MRm?&e~QA8)}>+Ax@@H7xzKmHCv8oqeS3g zYf);YFgHGoqi88{Zo3S2{Bp==!`ZTYgUSU?q7662^CocG56cZ$QY4(+Z`sP(kpVP! z)(pKM$Cj`~-}APCZT{FNndKl2_}PdW%jN7cJ@RewMCSZ4nBykJ+O^Tu#`NU!U z%&tqTSx6xdNMw_wU7xjR&#vrXyqew45KwTaeaUAM`|$n+Q;&8LYclj-_jKl1gJG&N zO4rmWmJyRE7me1^;2Mkeaoc+k0wqtZ=J?b1I{mgztcy@=We#k`1R`_8GhP)Kh3Y9l zOa`mKCus}3{Y}kd5tr-Rt*R?@p)ZGpZ*-h)uDn;lJt?+w>+d{A<5(3satgOy7J-39 zZx?W**+0T*txZ8+mhp=N7b7sk|!QgLB#Qzv~I`QQpF3ASmm0M z`nI|&#+Z#_Wz`H&4J*Z;oIGR1)KE^Y+snV>;rb30%S51z@& zh)+*My47hNMpMm=C$y&1_-DQA9=*Yt#w3!@dbsIZAk8$$K(zlUC14Kv-;-{29rNH` z3>!4-{6mSIw~`~(4{_poSy07@QB%6!S?L;|cA#BKI8^zoww4cade3?e9d?|>vJ?yd zA?>7vFg<%+_1NC~djKI(aOcPmFP7jZNLy3rF8FD7zs&?a3~tt^PfvVk&_jZMYn=HzyY zVySwjBZSD+kE**ciaejfKX|UR4g{B~*HHVEZkR?mHPwsus%h4RTDbbP1jc^Vt=dq(r%^5lwdqld%5CPnA;zRZq5Fhi_vjgtR@h50XHR-sD?UIP1t{?~B!} zQeMGs-*>L1 zY=h+4v2Cywk-v=n?w?JqmQkPv?)Nz2Ue^Y?p*;zi4jLRCZX&DfmZSJhMtUD?#a-=< zLlL>>piN;WD!+KbA{Sxbw$JVJg&(BHI>|rY1S@ao2Dq;ANEKNZx+xOBa;Z;*_-aZR zmj&F#veVa~(9ekzSyI}Tr?#&IV_9j8?<{#W`)G+xueQub;!MO61iz>S^2|Fj|E&29 zUvlEyk@Y(P3x($rJ}|5-7R6tniw%I0tnKHG6hQJqff)whOTje3Z1R5%eRBD~IaseK zm=ce%FhQ#vy#>l7nIk+1gs+KrZ?p3RNJPWGw;*#i`r1 zP?{3zzZ$g{Q;|UiW!>PfnQ`MuN&xVA9~)}gPGs!l*O)frpl0u2_o7|p8`mT^+8+;5 z4N-+4B&ELgsUL^8l4k__^Z)=D=wI|T9wuReNhP-c9QwNT1fbk3&*DvQm>5a9i&Ip> zSU^=`vNy_BX@&U3bznN9zYkc+bgzI&HkH8&d17nT@$zD{rJCiV#m z2h+XZ$~+~jYGZMd-1A^ZE=1`ozL`^M40xWTK!Ur<-Ogdt13-UXMaY;ZAv;*jLP1A> zF4_GeZID6MwH7Rh67bG{5=e84!K;}X>wW;mRz0Xdoc#pwRLHEbqOWzLl zcvUiml`RGV9bDSE%at za?;V4KFMB3h&^x}%f2J_eEqIlc5(ixuGFxPkK}l*VBjH8Tilo~<=hM0X?G|i8V=l? z_?l-RP2%3sW*zk7@etfASZ&(|zV8PwNI3mH2-cx+_@{h zlmwt;wLD4MBh6u~Kd-WL2jU_+u)WWS)dNcOuZ9{fy|;AT6FmkrUY1_^8}f73IWsgz>0C95oTcn^WKf zM@7?0q|j^pQ#rB6C;rdbCMFnKeEHvY)EBQ8@^49PRBti3{Q&GV27n`utt_QnIgyyr zamV)Zw?08<_G{l~i?;BPpbYvC7MXj$$y4i^WlQt#)d@H6MNl?O6Uuas(;za#$`KD; z3&C}DaP2UBL@z0r<4+wBPU5F^j?})5P=}za9x~%z(a2WKmu!xYBu%EX!8jz-NPn;r z{3mOPF(mVcg#cp6kSyTS0pZHH04dp4<~FrFw)8tyhpK2D#|`IY-`2;vXKJTkMixqXkIxs*UlIA+n9*xAOG11t$Q z@mfO9tuVIkHzO;6E;K0__tS^7uWR3*Ea$RHYBr%vYcEoQ_w@c&u0>d6iU+}DwVJ9 zSEVQxi!NH0`Fx-!s)J(Xu3Nsu3cZY`px(&gyb$gItW!;yr}M)V9=gz-Fw={Vb&|a` zf_}g%Va=&mc%HGrB1);PxJOG0R$`sTw}hd?`8uc2z=bKJo1N?So6?1kW=If72P0RK zxIKM$u|Y|qaW~c9X?i-k0>THOBD);(j!~9xJgaI+z)+^5s(=4#EBnt7K2+Yoteh^A z;vKP#GI=?$A#<$;4jKlMJWS!$$^!gsu$2P|90_&j6v*ksks2H#Hwth4c?s-*lu!H< zr7ee7gro%Du}(VY(J%^8$eO+8iLd>gAynvE=RRt97^9Ej|3H5xxGo%S{vkk1>y3pf z>>R5;`sjpZVa|IXF|bZ{Bm;T`kcZJOk_=_v6#W)Y4vpR02K`fx#fC1f*^?yBMMN*m=_JgvaIjL9zfM%XzWlg>u6ZLw>VkQvVApQ)3U0X*DO`B!X6M= z$obk#jua*o5GSPC3loQkn2KxC8^b2;<16DwAI~2&aQNzRg>gU+Jj~!e?9aHk@$TFz z&DE2rx-nuZ%;|?(1?*sob36M8nl->A&AazAT8xfRo(ZONDo5cB*k2aprypUJkmG6kT{IsVn(+ zc$wt}l^mWOQw(A!E7jj%t)VoMJufPk@I|Jf4^~U{qq7JtM99#Y@LIH`fyRncij%nWQhVs=C2mS1HQ;^# z#yXkkN@2Ke*1-gh^&gmWx<&?=|0HMkj@hl4B5M*2&XK8Qy69>TEXc*J+ZcmNPF+`XWN8!1PFQsv&Dg9* zEPuJmB&XI}y|!FTbZU$HLFqvJPIDrqjB)N3UUZJzZXmwEi$7d;$0LYjtmRPR;O`?o zRpJ#XT`Q^B-R?|?UkdVpw&)n~6#2O*^b^u0jiMIfCt zRJ;;GAPqtn`R7OXqd4m)iYqBGysDR%PfqKx-xbl-OK(rc2aIBbHw@Avr2y6Q$#)dTKJFQH+4zROwynaw`#nJDr2RWV|}j6+F?t zRt(=%BFo!(O|i%-+RQMUZv<5pZsSq0UeDXST!9V_2b6m9%JdBsd)5s7k6V;PNQ4oF z$CT6&8Db~Ymy0wx-?xCBsgmbR$jgt}5BhEH+$A588jtxnI`{Fm+g{Q;qBq3f9J`F9 zE1)6DN?;-87ERskssy(rx&s#Y>~8=Pe#axN?%en;R{4)Dpyn!`(DHr&R(jaZSvpNI zwD&V@lIIyjeeC;7;JiCS$d<%qqNSUY#?s^N!Nkky8z0oH5{r1ymMy1(W{jLdCMtyq z_lFI(aM^POC4g4i_r0VjD_=uiJ-sIb+pBu{%ab;BV3LrB1yt;B(jaQW6uR)?HHF}b zf*89Y=yN>_pQv)0)MC3Rk}WzQS3NdEr7So!LeBPlZczkLYpcD4VLY@5#oj$K z*8}}=1L;#*UAfxE_uik|tm-LZ($a*CM9E`4%u1LF{^Wg;;gH`^yFRn@q&h&^?Nk|a z+xO)(0C)LvxHuM=BmBdrR_CGfaq843*tCg$n^XI6w0ciAsY{_hgwV3(qKHzJQC6sm zL$UVG+2KS;@IqDhqUKrfB7YBbLgR71WYvDk`KsF&2vCm;vmX-=&wi)rs;?sF zRgJEwiG1PYP|U?;(aY^RSM>JaI1+}n0@i-S)ccX}z1NQr1Ro5k|1sklG;d`@y7ANbYApWh!D6PK8%=w|$KHH+7D zh0a|BJ6|7)ex5oq$L8y1^*?)q$BI6Ar+g~FD1ol`Cuh)>95joE4wX!8NRv3PJdp5Z zGRj74BJi3adF2$SMgt~U2Tfgqj2H=|SWX1KA^3D!}yjf0su9Y-xCMYGV6z{I! zIFkH{o+*jJ%1;)AzJnsk_a8L}>w3Rh$kl;_TmBPE){0_xNKxBC%F<^*+nxP+^zyiN z*HO9~dR&U=-mfnXx(t*}Yll*1pXrF-SS%G8r&|)IpeXFI<@jfM=DJn@GrT9<+W11r z-PaP?pX(e8^2-mJ-tl`|O?63a*WeaycsqiI=LwSJ@ZwE8nxqErxN)0oE;Z9us`nIp zEOp1?eJ3d%rlvAFRTHMas&0Y|7spRFKzRlv@C+GvF05Kyx-8QK4E zIiJU!_j5>Ods0yuOY!ht4N-{H+6H6v{!6I~j(&^%6T(^q`60N;;7j%i^>W9I(u9~L z$+HK3%f%)|zkRS6yJt_IPG}(2Y zVtAw49S;n&P)O6S(LCq+O@NSE85Eeu zN4Fh zZ52xtdO5=Pe&{Lp7i{03mjn`5y!g}t4S=#CE?e$8@h3;}>%pO?#50yGuZEvdT_>%- zQOwKVRve^=btM#l3?UCMcoYpIG7-qrlx~G%A4Ps5r$p}u<=y;%Ck^5p`sHT9FD5FU zxeNG@N9FQmPs4{u;VYP01K4Mk(X1hNmuu8bf=4fYFC7qF5N1=gMi?|l6h+%EXsoC~ zif@4}D@DiUNDNwbdFPjs9fx%i)qYTt4izMwi(^J}(QdIyDWhZY9*OA^)T%>tbVOFAvy((nGK@mG z$Hil^aKr{bXZfnomm&&16rLgf5}Z<6v>68|k;pm8pSUMf&yVtJ<09pl+r)Xsjy?VUFx3qigv<8~%sa5DRbkZMA(X1Qrn zSUMWHAQ*HMCVm_E`a*nuV;WSN)s=bCX);*7XaDy6XPVXqfs~N|^l$-B!e~Cp{maM; zu;b5VE4kzUABz|m-yevaOiuK(3PqaK()R^7-IDYuOYkz3S6m>#SLUnDL8po(O@zjP zG*dZ|7o#mHqZ@5ulTS~yk8Ti!6JqrHl|rqNd0y%iCFbnXKL&vai7cLeaO6 zA{kws7GdzL3jzN%zd>A{D0qCACqsxU24pvbjxkO-n#HudK?|^@tALU86R_W6VUvzS z>sJd3xEiE#lX4G^`{^5>4^0}xrMo;@Y_(|Ee!oVa4F02EObFcBp?TQZ#U<;lDmr?~ z&$nq!uGVr&M}T4dyOJXtX^0-qczPc;@~4~+2wa@-B>#fFonF&ny@id#Vryw4OJYrl z)G{ruBTKivMMv^X8{Ox&)^Q*k%Qx8;pYmhpr20(}Yh= zUqwNPS=vomh736Mnha$&+QP@DdqgL=hPhW)SHB0Y_fv?&|0|vUZVeUqHW}YZ;j%io zak1sSy!22?2?@BD2h&3d(D%krzXACERL%AzTMs>T33iA^6ku1Vj-7G7<0lu4AJ@H+ z&V2-LO)7x_uJ`3%;lebEV=`0=IDP;Vf`CA&4;z)nQeFHxR5>;z3Yw#eTMD^$3zuQ?wQEJZnFDW?1iiX^0Do?Ab$=JJ-;qdDY?LboJu}YZ z_lWIL=rZ04HQfX+$kNiIw@=FU2k{+J*m%PR2Pt#&zQ|V9Jw&j+J)L_xxwx>}o}cPB z(ETeUGDCx#sS5*dL$t2d7j(RY>(SQ_wcKXdz8?DQh^sYL(gUix;wtRwa7TK?pW3o_ zD|M}?wmp4!KQxIOtlX2kzIG;zO8^hTD0bH^FG_dr-d`B;E#P&&k9Y+&We*F0<0Bp6 z6LNxstI_oxy3{;nR(L&}tBeC8i)x=qsyg3r7?abdr_otI6-J+*{QF`4y!l16 zn@FcYgfH@<{z<8M+WZ?pvo>!3)yOC%f5en*I-_qx#JRL7WH= z^Tp=4t`4K#E|ahDF!6i$Xv!7Of63;q7{-TwvC;2hHK{|i1h+n7vpymP)w3e{-tZrM z84^%7QmyaLtoM$fY0ow|?OM2J*C&B#a@D4)xY1LKnLZ`6tLJ+^F{gQ`s~RsKzG%Jr-Wm|J@;#!CDer#r{LDEq6i{$@RtkwBWP*+r465fkm#a_d?5 z{=px6&c{cClhbz@CpjK)hX@!PX?(NpZ9C>3VD@9PIuDPs3(i?#U0wXT^;#-7nLod0 zSND;VgSivd`&*_h20F7nz*OhocVZ+!k{nx%ajNX&V!|74HblkS#3>2pyO}YWE^s`{ zwZTR?c3f%RfO?i8ddv1cR8?t29AOf zyHs4A_vB`8>i~N%WGM(AY1gYsf{gV) zYo`CYSvOThB6C4Djd~_Bz63bYBR;@Z^in{7pV@+bD?&nd zD%~Tzrf}5ZY8s-Rw%DKI?J}B@?6!~V^42Fik>Yop>veCx;*z^)@HCi*x4U?O==H9b zxx&vWsVu=+U0ZYCzp#zt0I`~k1BCKsww$?wq)1=WEGvbK1#bEiqTtcH5Id&3X6;V6xjp6j{K!XKO@4y5FjFcL3pmD z1RLsAGIc%?cI!|=N($ivyvwvePjYp)k|RU&vW8EPjap@u#oa`1YJ-$sVM$z4kDgB+5#f;Bf_0U zQ7s?N#(yj)Q@56Yl-u!NOvd|&naUbeNPtGg)L9#Q9N1vy-9Vp`Ej3=C#AQ^vo7mOS z^ZHOpskbBgf(5&fuvtmoclPhE~nY+!t-mn?6ghc>LblQm!I@Hfq(I}r?eTp+)bZl_Cx&&!0oN6H}RHaQ1Q@IJqkN%B?u?UC&I_y!)tXXgyAY$`@HE95fL;zEl zV+rhuM%zYYTy41S>x=BH2)5ly^?XuXQv*t1^5$!KDCgDv2T09f?-#~JZx%bz*s&~w zxwuWtCujMm<0-dO2F&LmH<4DRTI||;D!Di%_Okq?h(|Iy_AEf z2r<{k)L>;xvFvNx)Lh9dq9fnRqj2kGUb~rLHJ%l6q(f=9Ru`(0^&Uu;mi@jveN?!x z#+y#M+F;5QdNN_wpqZrWi+Xc7`5SB~gPPTe+TVeQAJWI)uBCLIKFX#YOYu7uod1Dzz#>ji+-=7*TLpk+F3Y0d8#pEHK6d}xRYqHkVsbiUJ5syzH2 zgnr>Z)QEfGMBl1PpsjebwpSP^f9j543jX1~2G;L0SyhG(8%JN3*%oHXeq9KYy~0mutu@A6ZcP z850k;jj5b5ZyZjq&w{wiE%;wmij4kvpMYfFITyn!7^kaCBx+L3#Q%J!ZG)C(-F~SL z{jPO#>9u&|Ox3p)xWl>XeY>1_I7O59^J1=d1A>0EJ!71XkEvRg;-jc|kb;KN7@aRL zXzu9C7rsc#Dvfo+OeNn7o!7r{*vU^G9Ypda&*kVh)NzfW1wL$DUOb=b1Txv*8$$Al z>aJ30Xp5mLVkwr2?lK)n1QL~@i;XFiTRoTve&f-(zm(`+l@$@0?nkn$7IFSVz`ujZ zxv9Aba9?u8NCJA{U2g*iv#1MA3-9FJmaT9OgjdBR_1EdR#fHQ0d@0lqXGwWyh6@}U zh&8055p;<&P~r`?w)x|vP<_G0J&2C++VF?n54rohB|Q4Fwc5GtysUh^ss6lgQTk$h z$Ess9*Y@diTXYD7FVh;T0+@wBAYRQqE3*`ruwN~y=?rb#q4TVCd%yc|{=*LtE7qR> z8;7(%=G0r(k{rE@H2Kf3ZPEkoxN`{1nJu^}x)|>ZDVoYbS^<7gUmLV>KirCoQ zscN4Qv(Tg4xZux}U_q&?7;JJBPr7M~7_3vIPE2gQ)9%(uRGemlvf&uG6x1&@2VInokWu+zv(LE^JgsgcapGu&hH3bWgI;=SQkzl|?4a}YNc)U{Z=5|{- z&WvY(=CixyW8XUkcv(KAu@h!ra}tx8&*xoa@M|}8!xTX=F)VWMAOFJO zUtkv9Os#TSa%h?;+a21UZ%5Q+)qAACc#N3%th4~*)EQ(6`7)AmFqKY0SS%!FOy@qM zZ=|~u=<&kEq~hXaokMCo+Rq}xbIGM{t}m_3HAZQtNGw(J?O`L< zV5av7qB;lsDM|~-Lg&|$HePra5WXLn9okG8THK)hlN=MzZ8sVuz>%)V}ViRC>t*G!0+e592U<0TKQL#9k`pA+-kz&?HgA`< zr8MpTI&x{>Ks=`bsWGuxnUHsv)Zj1#4tgvAsrZ8( z;(~vYoO1p+uV-OT)=IZl91{;WDN;JAm_zXJDqNB3`6Wv|`#})BjzD|ygDgZ)lBZWz zM)uI5mvrh<-XGswXW(ISX55Hi!Q|-mP5bZHBGG6vc4TyQuAGjIJq?d1p6Mjy&Diy# z!f4{nWBF!@DhVySkwbNIa`cBK9@Hyd+75eIE3aaSXRT~{sxxLyr&?_=U|qh!@6yIU zp(1|XNJ|n|UVsOkEvIq@@>WOEc<5?LnTdDz=7=>V75$roJ4{jr<01wM`KdDv4;$Au z^9F7+6<*;oQZ6CV=B_4k&EUwDZKLt?{EbovW!M2=G>r!nH%}VGc?XN1Cp^-Z{_eV_ zdtS6cX{yKXB%o`v+Cy%x*>fme!Ct5a9i4+mW@B-flS216>dOUm0&sSWghmu>g5z%P zDE7R(CA&^;vow4D4_{vyRaXzRi@VbT#og@`=b**i-QB&o7m7=f;#SZ=vF~jw^CzTjqoXnu;|V#r7C6Ys{2|9 zYfUn`M9N!ry|OW*%TuNF7gfnozhP+*nz}h7{**=TST57WQmIGr+FSdk)}MqeFrn;7 zV;vYWfn=-UV(C4>^gx2@r8pY5JnyvbDyiY)jU|EZQK?Z_Or2Yp1?BXx-STYTx5!0f zB)yt0rOS&}6PTtEQ2IE@)Oe!ub;ccD8u_{)rz$o(8llh`sA z%`c|S;WBpQ&MVn}k`Pa1TA0z~`j`q7$^Y96K;t8=@D$XrwumbBughIYLM4PxsY!2V z4IP`k%LDVPer^)giNAehWX;aO??wV4P)#T@O0n5ndKof`)^A~dZ0)99lIvE?kqnS<8f`^1eaQDZg zL7%#0EU!rG!ftH$pKwjCupVf`Qv5cp7=Ntpuczc?ddrZJ{R3wu3OCf^%cc$2^iO5dr@J>?mfPP#+8n#~0 zKQk!v`SBJKEs=E}U+g_!?mzStR8>Z|hY+Y(Qj9TY9B+$j;XW#K_wsEVIZfV}DhXjp zzWBccyi9(s{(*@GGLeQ*jJtzh)(EmjLUy}nliGCro`=9zUkD(2WGmkj`nvDNt zKr@VI-RB1Te?CO}pxpqPt^fAs|Ne@M^8W?yK-q8rATLA@Sr&+lJes6=Y*fkeH9yEy zy6mvB{-ZiW5^jnGHvq;!8?2OJGzphpJ;=A1k(4$8lmnT)Z|m@Jh|A)r$+cNWxHxfK z*2%!8cEbKUatT7gc>6tlhOZqUs=gd2#ageb?w>L7r)Cbi=e+aaa1L{gHpd>1-s~!L z^eqRt5hOV)dfj}w9@k(a!<(BW$lXgb<2IWC9Ee59oaxP~48%TN)JE^5t$2Z`DBn2b zv4_$$U_R<%EsoY6+sI#}QcetUKw??_WZ z*brvyeuy$2)7nybfOd0-^x`SP;{$g6=;mOAJXdt-ew@(5GH;{BP|>O|u!e;VX7G;d z=|>p5quz78;<^+lY-7#Gm)2fR?c&c<)uyGVf^*Y9LZm`TO6MKa`NsDbqpe5U-J$8O zmNF32*@tfDrw^wLq{B!g4}5Q<=0tB2=BFnt`%mXEaI8CUh@>3dUh&-RmOo#M6Hu^? zvTCW|w;^cu67f|KuRWR-!c?emnoU~lYUHbzfAS4x?Uw^rqmrqumnpa*-rl#!Z z?t?_yTPZJjegHg36tbz*07s{^ec+p{z(~|W?rWvoQNiZ>&$aJf7(Tqc_<}xIT>oVt^F2X?XSvDVs2PBJW zAtxp5^&N?7YfVxs1LH?@2W?)eH$q8-tc->jOwcmaL6?nv(XBC0Ery3MGCWBm)ps~u z9z2}K%J`O$6lo2G83aFEoS?PVuG6qtVI1?X=K&Rl53HHUKwM7>{u%l6!F}P;)=$kf zIjuYuE#J#D7w&EO&QzD|Z`A8!QTb_1#^%fS=5{j1G5SFPX&02GKiBTBx%#L|j(nm& zZKKW3>?!<4NTfdG`g3XyH^t*ke&IKLF*WJL$cH+TTfD`98s19W%hYP{d^n{wgIALAVH~q4NZh zFv>F&1lik?iZfcqBASUbNz`8C)UdzTqnqw)#)*2iUE5{!qe}?>^rms!ob7dFwYQv- z!643AJvu!)4yu9q>zkUBjl7xxYEx)$B$dwy-D+b}V6cUSF7!m!>wPZZnY^b$bU2bnj-icZIM71UgND4V*Hk4|GvwS^j`3E!H7fcZ zzn3Ytoe0$_FM&p0f0&hG5{pRm`XKv|>xtoXl;};{E4)IC9@UZZ^*b}NMy;@-O4=U! zq;Z*psz8~K1^|^W&9zBWU0&>;8O>%(ZO4ZU2s67|5|Pj5CU)lHS~vsJ7SVCMRB&(3 zc1L|xs&AjYAgK23b>fxzeyLKJTp7dN9JxvidDn{F@?dtQpMoTHR!+Hxe@(d$a2Ib~ ztDME)CnF^fsPbmG-tK9~e3(I-vc?aHWarb6bH}_B6~&y_Yx7%X8<2ey%VLJHZDn>w z^=OV$IyyOl7m|rJie%@TZ(dZy8N{-on7|Om$C9!D(nj@&i?f8%dtvx(EOrrM;L(d0 zOU%i$ooaZ~?Bm&hNC%vKQ{pl3^4-lI;DnE8^Vzg^#-mye8m9qNdVjZ#Q)vZ_9#M18XMczM-d3Ids+5lbJ0Z3OwY3+Vv7z79Z)Ez z5^x~GpcJ;#Dm|osn_op#p$1|Di_`nI!WsO+0#^jZ%(}ALH_8iwp&LzK5tI2v&Lr+q z(0U?9=*v^f{Vs7l>6T^Bx;0gY%2g*ulg3xo`Z3ti1;RTy!?nsYqXcslo1FM%R+kCp zE*c9LR3rj0yY@^RhM(Y&5V90PBy~GhrLrd)mlqmq>c%gAs~g{;2q?qvS#?PO)Jxyn z|0WxUi(fAE)~u?GPc4GrvWYyHk_2`u$uSFQth(*8{V-ro(`#Zc~H?n^*h~v zA1^8?C299Ssh1@>Q>bH<&OA0WEBUZhi}*v~T05tg*@pd=UYtZ1^=7<3n-`eR>*?+~ zZ*aJzJYf!x6mDoR2Z7ap2!_{O=Or#!lh8vkZ?99Dc|TerB5KY9fp4|{G(cxPR8(qX$3AviQJow3U2V|?J7MVAdf6!? zrH{RocB4d}S(@^qT7y0V&p|c6rxJgqzb;#7hV{FF^H%62nxx~BbwYj=z3AhMocirx z$9_K3*VeO^aab{`829O~!bA@dqnU)+V~0OK^7W4!FS6Az)3QtQ(~{qYi_#PLwP!R8 zPk~NLZsza&)+0&izmYFKYw1$!jW*M_$!X%n%tNMj}4(r7rmcjivi zp*!6v^bBkNygbIBFC={G)^X7VD*JtPBirJ#Fu0IW#aefQBha5lt!8Gpb<+L^wM%4% z`)Yx2GTPA7(OzsEeqd&EaxA#kgrT%7WsQ!Qqt|*wafdi$9A{9kX*UAznACb*fcRLF zL_Ef58sB{C2kAgUS_btp7h*VhnhNW_(5RXCB)J4v1z+SRhzAnnmJ4+x_!##{GyBgqO=H??h1pOFQ0kE9#c^Wd&}WT zZ7u6F9ul5gt|S3$1PBHfN`pw#IZn&WDg@bv^93^mD)*f>p;u|w$|L{)g3hi1Ey~Px z5+MuBv;dOOrB7Y__e~&0q)Dq(0cOurFOAVs+U{kvd(j@bLa2i_0a#srcRW7NNL_uD zQ9DEMQTA1j$bD7b6Haq`p^<~N^}6hOF|K6F(s?RZs#L%dv*-e~U2QBI1=w=(fao{3CNA;yew1u%sH8PD5+rt=d(v1wP$%J9dKB>=#zF*b1rfe zQ5}Beyp0U3tjz+L!qS2D;jC~*4G{fH%mmJYg)UJ21%|xvSw^w-sSEQ0>Sz-m(>xGI zLUDga{oiKrWciTLi#eJf3iSm+J62A23iTwf;YNIW2lc4amF)@npPk@< zwH-F!^2boX6ER$y0>(w$6=>K9^pjG1QLD+u$kFH{OopZ0k4x$DI^qZ38;#dF1JH#n zP?VJPq6Z14jmU2nP0Z%S@>m-J23ne2KlChGRAf{7<(0H`ZcQi=ggYhO8ZaL5Ss9rL zvT4+l8;XZfoyHj{r5V z_m*ZsPq6nZ`baXTXhDw+iEqC_sV#w1`S9l4fthHs9*ZZ@c-s{hvgeILjL+LagzoUk zq^Z}&cOfwL^;IQ?7$t4@*DNZ`u~$zwyNW3&Z>lK_+1DG7K&Qeq07REp3EeX)a|RNb zyNwB&bPG>|fa4)!$J0Apjc;b$ao7c?`=1lTi|&tETqu3hOZCBk&4{!Xj+UW=O+lW` z6p!>7&6(IQnmp$Bo;ubDbcQxN?T$%7C^L`U?_+Ulam)&0Fd>7I zUiM7hX-{Vuy3|^RYOp49tx?L>%_%t{eVopDq*RZD$7{aD?~D3is3<)?MAU7wtSTkg zi0nnhVx~IJrEH_V1pW#SY`Z&p<4 zR(7~f)KXKBg92jv04NsjV8CvrsykX75t5;T7!Ma~_|Y%@!AQ4BmI^ln0b*&{yfSJ7 zM{K}gsXrK2=SMzOjawS`0tBYg0Mf}?0@ij5ry=VGkD}bDguWp?BIX)K zuB&}Y{4JKppvY;gg7n%h$hRwLy;BygxX7WD033V#g0|YD8ixn~Jx$*J4Bj_%9A`f* z65E&3X$jbkM(hu40?o)J%a>s4Nyd1N zZ1!@jn?BSTYAj1M%#EoNYHTdPN$c&D0CM~^H0n{R-LP&?zLrSKkK-MqQM*N3l-@!e>vap%LwIs^bt+((P{sg zPhPvf;ABoN8}(zqOu}xk=LG-Fpf<9Xx6tV@_JzDKQd+2N6B~0FEM;a?sf-JL0QMAW zUQXGis_)+?KhAszXiT0f_jzAXKSm!(C7Fv z1L?@6bJnvi_rvOU^*FV{pKnh$=H3f}vwCEEP+_DU(z`VA5L^|4a{agkib;LU-H)=e zw7j&w%=>Igh4x1HV<6?U(ZK24P}vNg-W3SWUF__$#y!&F?AKVxH4~wPIf7(VVUxx_ z6n=Bw*#>jC6f_OU&r01`tbg7iE@403ZCvTT(w6B@voo&Y^um#0SF5QRgEnxW$FFxE zsg<7cY*`-CGqYP?5*$_EIXWl09! zcoY4+^oA^5u-$LK>tY4@3^fA>17^#e-PWFu%*(8r5LChMjh6C8GBD-5CN#wPD%oN) z+Y`HnjMTYX=+7KhqtqfapB`ikCpLiQ>vcmHaf||j`zJtHN~pU{L{7N{F8I6jAGjB% z6_*|r4~LX)b3{wvNQ0FXF-~Y?W1=oTw%`~ZZB znJYpr5C!=Tx9y{(#kccZJ#_@5vn?;tI`MTN<=c?bToLvo`8;>lBNk1Ts^V(*qenI7 zLpwX{J~l8>>%FGCMeyfO9PCvr^5f)@Ll^9C+mjaQqxd`O9I?55lT8JGjVf;5MO41e zB9BN%dfs1_^`J#E2Ziu5i9NmEr~NnoIuOQy3_%A+R|+t5oYbG&W1^NQ&H9c|4!qop z%987znaCzCUIC=)4V+OugB~9-zu#G8S-$S(5aZBQL za8M@9=$}1ah+?ySjYxW-bb@^Y8KjgxfcXJ*Py@P1?1-A7qTop$l1(P^*wWH?-Yk!t zu`NZ#3E4<(NY`d(b)GLbt5;+ro--j|7}ID1pilxGnI7xPm)kLAm3k575ZLq(0vnxk zMCjZAs}WtJR_|IkKhPL5>Clic#eNo``pOqH} zp>G7==Z)5A6w{$aWz+feL2^BH#^>ql__hnKEGoBH(ABe`>8jh{o-}%e6w^{3B00GT z2efw%XZwTnf52t~^RFc%&U@#`Y!#gdiQe&i56feH@hHmD$NjRmUiKX*FA6K)Edfp* z&S)7p=XuLT_dU*c_sCO=Y$lBSO}?igANaew+78(#aFPHveq(ch0>iWOSoKZSDpxSv zUZtV-a1xq~2DvB&1r4duEx4{BRE7Py*ffk`c^GF{7&n(aJlt_MH4!Absg83Ttf2nN zbJ`7Kyj=><`~9eHWiNU0&KZ2HU?eNo=jy~WGqZ5SbsCG(MjO?Ns8x0t+(3R^KvcvB zeYLmI+f*%7)0`(LX?|zI1ejp_zGeHcF~uHbI2+ck5jGUyqV|z#0XQ;mk<}+LI2f|m zX%y&#qYNGBMv}3(*&~+@7p@)(jxCkMM+iA%Oe*V6@_Ab-@4=9l2I*TZ0O18!m&{kl zq#rT#EeeX>{-^$7o8vqn%qMp$NoaEi}rjzZZGAfN7` z3U798$q}DQKP2=AFr}p|BZX<)JAy0+jQ|U(!QA#(ry9IN#CyJ0KWSyQ$Xf!f6L-T6 zPsaOH1)H)a(aJ17$U8E^HNqB=P3$;p5|bsbear>;Hh4)Oc_f0yh*?t4X78DUM*?4}^_m@9X4>(lmF0>=X=)zD!^LnDyyUx1hsu1C34gJo3ltVgUufh8E^H z{uK1N3>qg{1}BquVjCFBtWx%Kyp)jy3PcL+eOC3Ed;Rgy_8@=Ds8ya$dKw4`xN*gE zdr0SIngwX5eFUTaLFuwAX2S-QDyFd^)DUa8QwxP{o?Ua&^)$l+))Qobcbs&&TW-P` zUU}H|3C@&C!B6{{y!zbSoQl=WDau>GM*4HHG%-GOz-=M z*wiH>iabK1Cf> zW1&VU_qyw?J8+8W=FQa>oyT1B) z1+Q`^)Bk1&K)!J?v_lL6DWxKa`O;#?Xk1|!t5kSJ7EtTdOzGC>0CE_W>YBXRc}HjZ zjJJVjq3qJIw2P~_W7TwT*PgQc^M@>NWJ4(^-@oZD@@8dI+6N;g4S5&rE-zQNR0-MC zA*hR#a(k(1Kz5@MzlX)sk%EXFzZ-;2uux>5{jd@lCnuQjiASwF>BcRluwSB& z6(UtnBM|H5w_JF1VZ8aCJi>8!;k;x~SZ->z2q=9~=+Rl4ZNx?$gVniW}H`%tI+L0J`Q@LM;N8ag{eSfw02>(`U5YvQl& zF`BY<>`G1bFmWW2CZWC7v^7c>?$EnSa1jdK5umtdEXVS}OkP+VxrBRpyut35wb5MM z{0R*bnzBBN1LZnjl^1FQN9D*al_k6*{fGC(6dG#%!%p0-&C_Ka8$RWfCAU%pSBlC~ zo=;TihVtg@07tBhg#pF!`}jK z1UG;$x!|ve2?ii~)#5)tVd_4uJeEIwG8`O?>IFl~=&EiEb~l(OVQ;ZE@=-+khN+^7 zN?0$Z z!x%hx_JfFt(0a_ZD&pHY+gDlqQW0zvs;o(X(ZSo1^-G#YEq1e~s`ZTMW z8Z^s5|6zym7nRQ->e8+mI(LT!ILCdZY)(;@DMh12fu{O|373rHNNgV~0Xp6dAu*6H z)zFd|4T~DfvhLKDdC8kNGIHzGw*Jmc{(-;QoNF5|?dbTMxbgdU`_a2KulHdUbFay> zIB9XrpDjY!w|5MhJ1^{2bgkSGQQWiUc z>SplGe_$f|`Gmc$|H80Ns2$<`eRR@{nTsy`zRI`jaWk>yb}X@F{$(hnfrXR9igJ-9 zu8BOhXY`K!GW8{qW9>Bz*@URBUJMCSaVq%?{-@V9Bd*qm;{d*(SE4k*bh3W#K5v=L zBl02Q{6weY5+;|)z;q2vPh7@c!~I0P>Z1JMT|F;ndymjSH%4m;9ts&L)CyN@3x}J} z-t()~W_ovPlZJ||jlo5j+-aK|U6Aby_Bu(uPf7e2dPF{h!6wa1M=bWz8GZaZA5qL) z2hZLmgt{yK+Y7MsA_9>^X}`F8Al!OsM$7REeYSV=9&jN&%#$cJ70VTI#fpv|qcoi* zMh_>igiUBObb4VwSLJ3!OZw;Omln3Sb6U2CC7FuTS+0Zla*PlBj{F_Q{ZWG{?;3@% zi7yo~`0l%_lhKz7T%jH=?nqVp5VXi^WY*Jw7>5haW1V&pt2L`m@qof8*`5U4HMimr z)LSa2L1c|I-{Od~)^TIAR*~Tl91IL2j}v9+1&s%+=oUN2JrS-a>bz*iPH)OiUbMGX zROP|j(=GG4ZQnu@!~+@v-L@V)3LAS#7xb&`eBrVU#lH0988v2k7hYT?dk&A>{aO%Ds5%YPQC4PqnW0yCHk<6UXHsy9T(Op#JBS1d^(!%h@kq7uLzeEijgu>56+ zWPsP?Cvd4;#xqRuDjNH6Y?Un4ifllw}QC=S5%bJHhzBXuXz z8^5~J;St~98M{4jS(2T2lLrdSPy=(sknOnx(P5%`z$5sp>Vw+n`j}m=3~soine8JE z^4i4l0689RNY+_^55HJd>pF(|-7VLj>_9!@b#gXqEXE+LsyV4A_oaP>AN?rm_)*t` zTzK&$g5U{>1|&FBW0uT-Q82uTBMoS1zjLvnYO)zDw5nt>>(uga*4W&nG)%>>r;7vl|_NXIMT1L6mrA zrs>^_{hQy9I@^_%_)kkAr%gkCJ!u#pD0q^ZlN3vyUBz(S6AM_r)E~dd%x;M9!m62M z;|rkweq!RHF;I8N&Gw&;o$il6zn5$!V%bf(OyVh(^Go%*3r1a>Fy4O}9y3}h+>F@e zthtus`8lVzxcCObnzJo=>@7?5cm+8D3)9X`ayP-}Uj+{UOr7GKmPw~h;)aULT>(>&|8lg4$JezVQnA(mUM+b8r_v7my##k&y~1SVZ5 zHCjK}i#a^?IA}|z4Y)GR8CU$}@}Gn%WndFU;BQ6#C9>L*JZOJ-^6zg9$+R-!-!I=o zQNC<_K;T~xxR#CU`x1QQn=a-tV&6~k_kDi~2I^l@#uE@$ggXf)yGa1qm5f31eku$z zywk#eZ#k(i{*?_wBYsab3~>1J+;K^tVuIu<@UOH8(qJIi-+FL$1|AkJ!!NA3tw?hJ zts>Vf&Hqpt>_Px%XJ&2v^p_7ba-sjk>MuRg_s0LVE~XQ)_O$~2Uu|XG|JR$ULpWBj zAcAJVO6MP1Ap`b!fEDnNs{+dNS^Hq(KlBJvAmUq<1>7+g%nFg#NTB22$HtH$%#>EOTf|(Q8+? z1>1CUQ2x;WZQwm@|DDQ7h^_Qh|sC5&3N(-}g*)sI|61oVr z5DX;#S2bCXTKg*&FoT1E5-xD}=WUvwDkwu1^^slW{|SRMNUs0>4lw@W-U~5>kJZM3 zeYs7?v<0sc$0q{;X#ZvI!$oQKEN&o+(>Ti?KV@N<<`1XceCKNB>L@qyCc5)?3nt;OKCAPoR=K#kyHtgWq`oSPH1va)LDKU-by zA(Gx_g3EEQi=2?vyYu^h^NTsy_7_HGps1(pQ1DLUurKK?PS3GHk$88+Fkgf+xXMc z>-*0xIA?r5z0i847Q+)3EqpR5)vSxpt59>`asKu=M{jme{q~IwzwDtoHOcGJ{fO^( zI86N`s}=8OFI#up?ny-X-`tI&0}aBMZB;8Px(Oq?Da@bKo+nGOwo@JFCIhIKc=^hHHkStO|E_ zQzp}Lq01mLDiGLNyG}4n;m}Pma{*G=TOG;>yc7h-Yrm-Lnhj(7ShM3L>c)<)=VwZ3 zY2lr+P#K2fcBYoB@8t~1{grvgsrMJHdY{InDR)0voLiu;p%%kwx}+&hC$UhyEtu@K zlo2fEqs_6b$rPCA>54MS4jw^#?*MGVsx2O-EOd7?9%!Y3)|y@`(UDbpy(uL(hN&XE}_HT)`^2VXNs#NHcTWLM=b z086w5^VZ#IK=QzbABIt0L)b*dtqWF0|4H^CZ9fVoDY?SgBG(;}SVoFPx95%hS-Mx+aSYocTqF&h{?nsP}R+ z#^MXRSJu$BPSec6@bBEuGFqQZdnH|Fp{o|HN1C_ZE4HzfNxhp7bO1??JoeKAGbHve znTy$0BiJ2hFxgc_T};i|8Ksp@1t&qAdvm^(+PLz1#51)GESr+=(NWt|TAO)kHqZ~G zFGVZ$=o7g~N3Hq+vG2dNCsq;nsxFeK37JQyp}AzySt^n{=18~%zxq8!gi}Sn7e8M7R)C7s$v!5DmfUlof6bB^^uM~ec zwG98fz~!PJRu9QBA{VHMolm4MFzmwjdexBF6zjAF|KlZd5&BJ3*57kbaPpx zeflPwx}Z7olcE>aH#)id*@?&4g>bTRP;65uTtflZJbD;x_>-ER@obt1eKQbo|BINw z_riyYJbE27XARYhDMjwg^wT3A*f@wS%&M1<*i!Qv@hkUlP{(=Qbf=YjhxAqiJ6*6F z+s8<)3Z4Jx((fRxIsk9FoB-qVD#Fqey^$GZxaD746Qjm{_KnYw+-!8C5)%~$&()5M zz-zTK_0{dr{qWOu1dhS>(Ag^sOTHX$?i2Ql&G*_`2T?;Jxt8B#2OOwl;-xOt^<_Iu zAnjvaW+Bo41jkz-3p~kJgD0Deo2(_?Lt)Oe&o*M4)EBGH3_q*@>l+D4y zxe>~sgoR6J3vr!;NN9}}vc!N|)9c)VMZ9QzAQef(FWvT&(4cSFq{pY(H28VUvKQ+r zggbcZqxc3F(yMJSIF!KEXk7%>4zAybx(-WeA-*%a;Edd}n!w5vp6-Pqv&%KH#@K@v zRnM!k3c@O(@?#kh<-YxE`)&-^SjWoo?xe4lNp2;odsKvIA$-2Bu z@3?cP69Ll4g<&=78M3EbIoA4pWcJe0 z3}&3yeuTn`Bk)qavPP&fRWJ1H z+J!*6xW?4yNc`ltJs*OP>B8gWbb)`jD)EqaDSl?gu%8#M&RWo_G=EC^Sf^D~+=6F! zU>Rn~g39Mjl-ZjdT+>u;U9&wjKxSt|Q{SQ~u_#8lh+XSijtk?G(>l#YS?nD{Aoc{7 zaThhXk>BhjVZ(GdGGL@DiXI+bQg}B)3ff{3_{rg5N7vb2E^<&~NA|QmCCAFV-{>5F zZ?+3s&YcPAHQ z!f7Sx4To_r_$4th7g=>e6y?dEnZU@-}=cr11b7} z=XNA)Yg_Kny}Lb=fWdFHFSp9!>Bq`+GRA6|tQC<+=FFwu?Bn7bl5nJcK3#^D+0|G7 ziN2@`TsNa>LcXUX{biohWtOuuVK5nW=Rbby0Zv_1kU2Cgri~?nAVxH=6(cYqu zqSnNUpWSU4p6SlnF34QmJXAl^d3E4oaW0nUiQ(Y zS?co@5sl@W9vn#r-bFKM`N0{AWsbG(_to{o>4R>Vu6 zkdWC(^ua$j;D(}sk{g`pS`ZT@Jn5B~0KEvCX-F;+HX&`O3Y?LZLE};eC zbxx8t;L@JUPoDy>#6OqyeKUm#4$ZsV9#0zfgMiN(T4FkJ&?I01!gzO90ZB;Dg=$|D zFu-`6Uhf5_I>7-&x$a0Uc`C}PLWclZN{cZo_!gN&! z7Wg;zL)SB-lm18bS7!{=bZjYln<9deHn+0sezXOw^DK|{XL?CWNg?{O*wS-6|G+gg61%Rd|840wDpqniP&n(E zZ{TB}?x4=i2^KKU>6?JlWzyxE8-dZybl=dI1b+@N>j9!146s|Dz@v%fhgG^^7g-1q zbiHzJ+7og+2aJYJ!_Pp$&0vg87b2s9+26>o+5e0r=iHG3>nNtl*%&mtAHVg6^0f3E z=8h0D+*;R#707afclBNof+s>NCR2w+>ZZmjA3ihKd?1R^)0FP8k9oZOoO{a=_Qx9< zAO^YpxixShVPH#stDYJ_NAmfX^nlVpxH^^jOCq8(6D>UT>t=V8@O00WO#}9$SIzM= zU@VHLFu+xnbe#yVH=}8_MSiZMpLg_qWqVBG>q^W=eKIoMA=Vf1%V?zAHBJlk7$DW7wi=r@Gc+ z;e52_h>3~$9;nHDd)ymi&pogA22U1<3JJ|&}ohW za^Z?VY$*7bjGrjz8=V2YwJs}8dk)v`wz0r`#X^SN z`e=^}BGq%O1QT!=)@0sYUV&IVxoQHl6$6!zI7r7A1k$Wd{##Q(9r0y+$AcF&gh(_1Y1KzCA9zBZesk@r9Y) zKXrU@ylgjJl1}F=i2eNDfYNdvAF6)<^gr4>?f9=r^zJ5Lr6N8 z0>C$I7Deq{ep2_<+l@UG$84>hwD&AG-lURsD-kasy;s_%SymO(kfM8=injxUc9j0U40Yizm^o4M3N=-Q;=*=w*xDNW-cJ&EW*ZdI_Z@9UDv zoB2Rt&Bg9(CH!H$jBo;VTB2yS4a8#bDy)SD>%yu*SU%HEbf z%}VmLYxs%XKm1V_fmbZc%>y*n!mRtzCtjh#%)RftHxLo5>U--{iH$Eb#De+R^P?kA ztCOM3km5WJZ|nLU2kY@iGTmYLB}2&!d|80F3@*pEr?I*E?5M{IsW!D(*C+gVqEJA~ zo9ec0J#W05o66FlXX_ISs35^m{i*N5<X&ALhq2|m8SW8 zE_lVZpuxVr^^CXvemPd3!# z{=$G<(18$Mn@4=|ZJ~BnVD=j+8=UfEM3o&$(nAraal}b?>^GMyo}LAFF}UcPA@CYW zoy474Tq9NQaB{%tM^53v*w|*S*b)WpSzdx{hw1rWEIX3?=o-BjIk7R3^dI-{P`P&a zyx4+mx#bD?P1NdLU!g zgrkYSEi*@pMnnci>7@uATR>`lI6k>UBSe?z8n7i;og~AV9$p~52Da^mX4`1%Z0sL) zo$Qp|hqcs0@(`Hg8CTlOobletgsLnHym$gNyf*Z{WJg&C$%ha;!ZhAz2#Y#NXhN_6 z_i-Y^cK0riVV8d}d)-}7c{TD17#ovwVZV~?kMRW8)v>Rb$?imH*=+&W`7-57__ke{ zT4h1lOwqn{ziEy0yUnaJo5~aF-vUKN88=nm3dPN|blUqE1AReb?6#D+c-*t-FONLC z+-%#qbcb8Ac2y5(= zXGd;Rla)K}kovuc$U4FE1qwd9eroji;}0BH-7hkhNO!6g9nGx;7+C(JFS_G+>t{YA zCW$(ICTe`*gJ81dJ-NcfA$Cq#XP;zLN}qNmX;ad6R^0KDQ6O*M-hN3mrK)tHk(#?{ zd+|Hs#Q%n%s{P8_mUzj_sHNz5b@&^Iiph~xVhFjSgg|k(<q*I9^O$)c}V=lLUjua7!l=2QcdfK>F0eIN{Y+iu!FAP1W>PV6%ItfEEnoRWcoB(^`o^pszFAy2x0{4ZX) zqpUA5i*VXd5#_$_V3eftrd3n?tH~FS?%7--9N9IIK4?PS73JRW_J-(ZHIvQI;Eg>D z1U;r+-2K2Z?~m1E1H{vty;@CaTBk+iHr0@jA%uw%ry{|8GQPAaHzyzQOInqA+_6#F zcfMpGu^qKO?TcZ_LVDP&;+(gC1iB`vvA7mPmNbQYQj-E8b6l1Wb~$8arI%Vc(ma{J z-Hl!y^JZ%_mStt;DBta!^@+f#Y%;-U*f-wL)Ip0XqDd?bbs0&amDFX*nzG;QkgJam z3^*>z9j{h;XiI#`WQ%1R{=5o1W7Dn-j^;R zotB)ER2W&Jr^clLu@oJY`0}E6mF#b}cVzJ`34Y5tsevTVmpG+;pS?NNl;-PA-&Q*? zBe_#lg>@U=5}LrpD*7Q&Yba*YSZch@Z?Man-9nHVa~64fXxG6=QVWuclr_8uV0~%H zJwGo+YkehVMKy{f7Ee!)t|&eQCW#aCtb&IYI4swnh}}vtSuruivsITNSBmI=uQRAs zZ&B18ziM}7K45MaU)0b-^z;0gDE89$tR=@i~f^CLDNHYJAD7tNP*yo$)%* zjmdJyjiROW#SdPe`2_zqW-g+2!IcRI835Sehv)HP^b*r2*oFD{Za)pli`ffAsuxd5qt4RT;D&8GY(u{9SJ=B1sk;4loWdt64O znmn1_UY`si*-`z8Xk-0~%lUEJzG;=y^AN9=Yw+nnDOYc|zn(%MhXH+_oMX(* z@8eo?!h}8P#)Nf!nqs z5uYzv+6(f^37ODN%h%r4)^hB~$DhIO?zUi=Oaew9NzG&|h;*`G$0B$LGrh0B^*>JC zCb^1RK+gBx{(KVQ*j~PZcJ?HhbjCW}Ifwu0reM3?{N{}0cFg2T3E}rLTsQWPf$i-k zDr>c`GX5Aj)mUyD@Nku*ZN!t~MoTcUN!#hCo4%}W1qD7fZwDUsbsMzj5~(iZ;Ze&$ zdsMfHii+YaRK)P!L*rPEYV>cB!1w;G7L?y?i+1*V`qg30`Dpj&UdkGUl_gj6!_utH zuY19Rk%Z9&FFiERi zIDXDNP6u?1F&%0s&f@F( zYLm80g;}oq^mHnaEv0DaVH(;NkRTmCJM&zKaJqNfr}fFTam8Mcz&f=r4QgW6-5n%Nj@jvpV-0+JBD+EZdF)5nbAbZ8+rhiqS>;x~ z#y1vewgM>p0k!{_i-8&Novyqur&00`Df8caH%8KkLt4|YGXVGe6iM%10C-voF)vTY z=%rJUQJ?U90c|#+Q6&pkOYOm}G<)s*)Mw%13<~2Ax ziO#B3_Juk2fZcj%Ql&~PXF&~|JU3!>+8*iqZTp;iBfs&@{Kw2Rt)W81cEI}>wa ztHX(H+cqbe*qYe3ZBK0L^z**ocTS!CPgiwySM|N_zV}}1x_)~vJzi(#^PQamV57)o z%}b-c6D~9|-L*MXZ#53hJp7rAuk{(Mp+5@+95A!8+OO$)w~i31C9y|eJy!dt@y{yA zM(i(No~7YZeh~yi$QHvYKO4dcZ5gXR9k3Ue@d)$enrB+Qk@oCogyUU{%`Vm&!Ws9(|=t(b2JGqKs17VR9IM1SYEdYi<@9&P*Uj|!WA5=O=?SXo;i#QcDE{@xSwdrBq-#K%&yvH8G9M@0O4 zwD_N-4i%M`2w1VbAa1{1g2lT1k3i*w76Ef5=RFzxzfT{RG`_Z|;rtfS+zeZ`-)?kr0(*CMVlmg_5{2k*AgH9kGJ3So{nT&G<2q zL?R>Z-aa@#W8%)S@-Yj$Ax)&#S@=p}wWn-07U0OqWFlh8{)S_aSp!S2=dij6iaxsp z6j#ekzvjOU0C)DOMAX4y1V?=Rpfh2+|9&=Z4$yQ5$zk=|XOSWceq5$94&|zXv-$bec8Y6 z^tgX4*L*Q-924IsBush3C^yAz^@a$0Xai$_zSOwj&0|&r3vw^oN$Q1%Gn*8Elq z>Nrq^Z+91j4-XduS`l?K%&&sbJ?Y`(q^QRDec)kA{{ME-1|rCrwgY{8ZB6$KHAVWq z)%JJRA~34BB-YKdbbZSA}%jwM;x!j#XMsTqCXWGHI<*^A=IQ04CVC&R)yA~_SQ|r>*C8OEzEGr=6hn`Fq zVQieUHOPq^ag|X(fYqbQ%I%IuFaUM4GZ3-+S5R8u)?R<|KCjrbMA_RGA%nlauobt^ zbWloP2*iIBW3%Bs_`GAROWXGYQ_aEk)~yZ5yZ^2q4jZgZ?En}; z2YPAI#?su*d3fLE;ZZZU+-fT$&KJJby~AfMc9I=C?Bb&Fqo+cPebKU#ezK^Z563$` zUVTjW_i{F;-x)(NFz`<$H;*&lS+Hc$BhkC+2L^5iPKO9osURx2Pe0S3-Au^ z=acN8>MvXpfH1G^^}1F3-Dm|Nhv$`}`6($SmhWzpO<)RepveQ`FufZGt@X0PWPA%4ddcQvjB{i?Ieu@uH(5#Grv+t+)^fU38As;bhKd`rGS#mS zfOLMVA+LM0v-4~MV;_$6E(9M4_?NNwYp1AedBS(4wxB{z7k8Cfp4|EBXtINY&|<_c z+^6%UQI`gxq@m6Tm)FXNuQInN*AcR)Xt(~t<(0`bsJ(SsX`UFkWMfJnF&rHL9Ejj!EI!oR>f%Mi z5mRj-alF#_xbQ+2t3zb9W3eYKjCNfrV*PQo&QFlo!XoazbcBd6_11u{48r8z3gm_v zw76I9Bb)bb=fIO4?Qx^U{EKk)EF@wcFN5`2_UN<|pQf@6@`vFtR?4ZJ>Wg6EFP!qj zAst<|z~Ki+NBH}?aRnn_h&f%QPH5HDGbTC)|9Wp*ZZq875CYFyXryI~tj)Nz6xwJ4JaMJc_M%1&(J6jMQ z`aRW=`Q6d|yyH4`FW{dG|Eu%Rebb$qY4_FQWbaIETCXMK6*)VpDI}+aG>$K+9<*4-L7N@ z^8HekA!AcDm%i<@ME&Igck})Nymf`i{EJ=a0$Xqp-@WwNK~XnF&=KCf7IDA($}_LM zBwhNggBxMEl)lX@G2Q5!5|rQhZfAdcO}skh;K4U1Vzj>a{{@gxdC4Z@H5{HBOu)jT zdATRat)mE?olz_OH05uL+|hF%Frw$tsxf>WQP@{xjs9L_o_R z7COjvaY^jDO8_fyov&B)u9egcl2g6@4*S)k5)qgPw|*sIx9(Kq+S3k_`TCpSnq6ncPTvu^%N}4pXoW{IWZh6)YJg# zh--g%S}o1#ig&y4?`I77l01=I1@+<-$UYW?sxY>3;b!T4SB`yTm4`vu@u@F4BJ|%R z-L3|mi0?A*R$Re2rRE?TPpUT)Ll{*p4wG3@+sN#WBiax`k3e(WK$f^GnlcW%mHS{- z2nLhEFJXh2j?&US(NTd(TQ#{JprWcTq3wuzr2ESf;zDG9k->?%`ut(BRpOD48B-K| z<-$fKiQo36mvf)$V4i^LA;Uvi>S$f%BQ5(ud>S)Z%Fj*K|tyVh%f|7AJyI zr_g&eP4S+kHcnh!aD&VI{o(M88W`k}PdkXsCf!BFEU>>=#i2LzdgHGX$(%x@`0uR2 zmpC;as_&SBvbyCVoZQFWp(Me#T=Zm$Qv>s7=h(%b$NFs!PiaxasH5Ef2c|heK->tO zP@*&>yWNv-dOLb^4^_FS94OT2tHeFGi8(F2dF?v|*d&j&lg3wp`xasaE1I@Ze)JE|N?@!t*B&LcO7*M5Vb zmn|CW76?w#l;btHLyn88mhj-#+07UzgvLtP7TRpLZh+Pto%x`ypz$q5U_Zdgqb4Q( zepR6r1u8($c_zlPrRRc-$rlsYC}lN8MRLom-b9}Id0@yY|KO>Kc=+3K&>w_m;44MVp?`Mzd-vcyKYfa5O z&C~ygHu_M~Pbg&Y#Ah>EeFIo{b5s7PzW`;~Dk!CAKu1^7I9_j}qz?1*3b~&>PWn(# zzPYRRp?68rzQXZtTxmoELdO4#fFAxa(n$ZQrWaSc+@E(rdcSYu^@fyJLZVKb`m=dW ziNrGO#4P_G>3xv=rmx_szP8xu$bWFw;Ho24M`l)<;#r7Ld$gEnMN~A++P{&(Kx=a> zUfgirt=`*;l9VI`tX1~WyoF{`LTuCICsW>`Y&n`8A>p?(Hp6gSk5&6XJhdS(m%lDuKuGpMx_Z4I1gCcCvA!IIhYG8g0$U+Tp<{$K9+f#brn$f~`C(L^Z6R+TdgC4bp<9f5M*r+B6*Gts` zsD)b0$$Llzz9C1uW=ehe*X5&8V=U(b`RN%@a@oE3C|~` z^Ln6(GTBM=*Epjj4JXfy=^vsTJn#S#^>aFyU9v|o_m_ywJ+}q|BDMvu_8G00 z3Ar*jyjFHLM|UApQev|s(7GAY`#X6pRbZD3VCEwz<#qsga8^)r4?7;ny7+EF$j^-6pIW$F z2mM7yQ&H8Iks@=95iDYcIz+67%F-u98d}w+?YkrO4glt6f8&eKWpDHkhHb&`KhfyK z7qo6JO%3Qv7huq!A-U6(k6Zdj#^+8y#Yf|ue^ISD3+!28An8qLv?{oRktWZ`b$ReB z!sxQmI;%LY=kSc+*LB5-FamYVMW`}Roa=roa0lndSY8Zfy1{pOQr^bn&}&Fi;?Nln z*nNukVPb+#;nhvkNhjr2DuIT+&d9A{>9VRpVzBorj*>?gCEUX<<6T=$m*Zu$&Y@J` zGx_95YpS0U%C03Dxl*;no#gVmcSsYRuj+Da>hJHAl+)%F-s00=~ z5%~StMZ@hnLGQMMxqCQo+4K{KmHG-CQX>bl1mltnZhlK5$&6w3fQui9tTE`rflqv2 zGqpvuK38E8koHdjYp+ZGLteP9E?<8wg?Fa5KE z=bnn@z63`+Y??=A(FQC_a|hbjpE7+gZA=EOWMYJV5(xu&>_njp>bfgYzYlrVK=7SI zZ(1$=VZk2YS~P8l0Nfn2lKPtBJ~?KGgF^~W4^f%tnCN>V&d^@q9WED82z_m2B3iqxTh;ya3@oa~Gi0Rpo}le8IJUC&fSZy7P3pLM zB7^%;+SbFNYKChU9u$41f9rEfXOg2tA!uJ#7+?I2jo#ms`ROhJ4amwgSFe2+ zSt8m-eQ5r^U$P!gbLubN_(&UR#$TP?Ec@CRpoLh3om_7iwlM9~ZjRE3J4*E+29xaoAvk(!U1gp6mxrW_$foZPS?W?vS_Zh$hRobz=rKE#aD&hD)o z;VcHlEQtIIlp;7nWt94a25N>eYjvq-t1#p43Nofjx+8L?vp|4ET^|GjL7X^p8S8rF z0+f(p3(`Aq`s&R~lNkrbhZZrxyAA!jovgw{rImV0aSQ-%Svp{b1Ku(H-zBCGVQ5gZ zolKjV5^Ih9xpRMI*vT00$1Oi}=}r$78tGslu1y?hhzZ^MfmxI|ev+oLngUuYAfoY1 z#WkVzY9v%F$%Q;McEMLH;>vrp(I+iOxs({iIZ)8rnUhrQ+4_$EY23>|m-minz#c2X zZN9(C7IGMGumNXTW;E2ZtKxrxf_8yZJ%HX zet*t)CgvhT)6iX0gvugG9WI3pgHdlH!|JHn>hU@(MCHRW;c@%BI7Lyb_uiM1C!7mv+Ok$7wSPIVrWA*)S`P5iaq?u1sabGWJClGL2KwWpJ$rnGe7dg?!e-_i zp`{#I&Gn}qu`v>Rt~fQiv!@1}2_aT$4x6WpW?J(g^-C1lGTaQ{o;ZhWURuHKlctM2 zGSqw;K;ikVPKuv0FgRDe2YNStS$AQsOB=+-*@x{fDvh4!=l6nR;&3L$k`T2+(+O@#uJY4swO)kJRsq&jyl)+DISD4 zx1EgB4nFn_%ang5e*=cz5o7W`1?^^d+(teQXMY^=`}gVsr~w8@JFa2rwjR&ORomt# zAC*q6ran?@C|}?2_8MJ1(Zd=fP7InK7h;l{AH?+IcsTEu*N*2qM6plTw8I0YP-{2o zzrJ*==R-vMGfY(k&~XGC((f2KJ3q(0eUcK!b2XI&J?z&vtoWf2!p9c12a$iJwwUkCI+rH;!f;_2D9i$bVe-jLuU+ zdZaUqupbyV@VlyL0aeoB8HRq^WT(M@UBPD+9EF18KE4%(QQ3hU>KHZEq3z#Wu!z=YaoIT$q= zuO{R~Q~=6_q;?vq+6RR@WG7y0E{~ZaED`lAF-XMP;WYN@O(gC~taiqf+u$qx7?v5` z@S-C6z*9LUcfr&s(UxvNWl-#Qcc4l-)OU-& z?N18N=wlRem%S!!8e5*vCzRvk1o~8?ufgdvEq+W5=??yMoK)WwYBRj;H((Fw;H7gr z(vbp6*{eT(_Ow{)JG&_?pFPMd;~=>yLVnQM!V8Ue+)9peK0AV9BDl!2!`7hGBYc|y zAuWHQN{M@A6sqx)C^iY1Iz^62?6J{?iEGR&&Ct_U;L3CIgI^Kh4VnXkI%33!%Mub5 z!rBS$Ei@|3$k%)&5-aQdsDk-|H)B|SL8BYs56^3$7nDcD&SW`OA|47iq%B1^!4UCN z_IPC|9NC3+cD!Z$bI%D13hL(#DfB3Cm|n1ZW!F73+sD$6wF*P!%Evx*!eu3ZMSaF!DqYg<9&38M` z_jDaG-V_Y>U(?r?SgZmjCR-0E=g`E>X8g44C+4%{&`9+~cP42&E|~CNR2b@=i&s|r zgOh5Ok6FEKG!!_Av595g|R2!}h5`r{0ttHO=@y$-TG=(eU)s=)`Jg=lj} z7|P0koV)!Xp!aS7Kjw2pc!eIwZk2Lv9U$okC#Lrws)j2XE?1) z)!}w0eD!9w5@k^@AFkJyJXs}awj^Pzv|)6!i_g7BsOp%Z8;xy~UP4d<`-p*$RfGm~ zNM+nnSyWmp)KM**8<^kurBYr4ah1*JP*K?*Yz8g(Eg&yS^QUzxZ?dH7Y?ih9k+g&0 zp(u<{O&Y5}qobULP57RGd-KjBczTgP7>?~izvGBG|ZK*K~+T}*0SgT@1HhYRLG z19Zf=cYgHwh~22%`q3)(h%D<{Yx4?cq?ZkNeCrVW<)?kC%1Fu*fP?a=o84+n171=D zBC*}!sV8&2P-$|%A%@BQ`RMnWuW9_jy>bi^g8bUS5PSq4A|B|)C1}g_&*n#-Sz~E8 zlg16l7w0+tT%J!*QjLN)zBHyK)t8`Hw#MYnZ0LtXJ&Cq8#5p-uCO*!57g)YtMY&w? zG(-(JCqHv|xPdtG_k!9&7q{ox8!F+3xEyPC3y;X8>CsftAhJEUDS zuJq{15I%LmD2tA+YfAkQI=3{H-<^>GOH4?B+fPty`@aq&)^VgVa3(wLD41ICYG8#N z{p~EI6!P&x;Wu~Ye$V}cn>Sfl)iAj=iXnpp8uqQ(si%G02?(YXBB@T~i1%9uu&mK1$vJhkAgB zb8MdAE5X#p`$qcPfC`%0Ot*SeI-@(4@JW!hn{&GF{aX8`!sYPW1#x(=SDkfk)c1L# zPDnY(IR(vA*Hm6fa3srb!WY)69%*2orP%)(v}O&B3N|=TKMt`;HxkTJ{-YdtVme7^uM-doztf~9c5Ozjr52fnZPWM?GO@47(7LtDJnIva2af-r@yDCxg zY`$Q*l8%JjG3Z@NA10G{b0oGidjAV-p+~%XNm&1}(Zcz8dG+@zw9wZs!;N)9A)Vd7 zWHhCA^I}JREX_B3?JoRtFn`Y}9##pSUx*hZIys~Ca|H1SCC$0r7DC0ThK%yz?kD%9 zpvWdc+6hJeJd;w_hqZG#zd?IE!C`9rnbkXWWGJ_3BZGw4)~=-%T1*@so19Hs6UKj!!DUnv??Xl=EC3aBVJGTl_Y0m=qp2^ zIT@o&cpD!Dk;rtOV~ch>V`*N*iP%%eCD!wq+^VMIu*l88Z2(tH*zYZ$nLL**W0$Iu zXO2JHi=*0^0z>GrZn~;|l;mHJT$UBNSYs}wVs_$ZkBl#ZO3`)+{rbMc-mZ4p>mb29 z6+phaLS45id{kBbZ@ftTC?=<;Kdj>u3WNZ?$W!d}>(><=H`u&lYJc0@tEB9WoY)!? zd4CA#)f@h@qMR-s{#{=fE}D_ORqKM%iB`upGR@k8Eg3f{=%#W9?5sv$3ehAkL^4AJ z3h#yzR?jBDyb4V%KD9hl=J#7Bg(iRwuHIhNr+d_sE{u-;h0*5iOTh*&LtYHa^ZD3$ z<8E^7nScq{#Qarqk|?q`zJ^km^&yNVq)g-mW`YUYllxrKt^OKW#~)7nFbqyv-OH)b z1%s2f&i6QE5#@a0eZ{C*SnRZx_#jfajn*DyKtEnJK}d+wl=PohLG2ET%RiI8&Aq`( zX!l%1?Qu$bZG^uk;M>Segt;E5EQ9%U$!_(i0~2mG`5BJeIXlb+Y1QU*Tc8ui7oZ!Q zTl;zswQKeETk>-arCON;Y5|sX#tXW>c2`Pd;c>};F&^&>oGCUp+00q^tn7u~Wj#gU89Eo`uY^=`7O8jN5e@ zzZYXJUDEp+3lFDIp-!^Z53s!V>cD;Ozsl{Ea2Az_a+Qb^%Vb>E4Xu|J@eORgNt*K| zPUF8!Be+cv0FOjQ1lD@tsaaSgT+y2e0QtTI2}u{&=>*LYlq7{ii`eQsu_i2i9sqJ` z*dE!Exj}05gE4LP_D%oh`)F)vJ;IO623@G|NIw0hJ{B$}YBn&$W&?;|Sadh8b$o{e z1q&(aGM9hmVL}WAhPMFu4dUNTL$LK!egc!NV39HO4@ULI&3q)BH@3%{)Xaey`_PY0|?I<#G0s~l8U49W66r$?L1GNdrGMMq0xfOEDdqLl;Au&I@LrRH)MJrgm(emY$77?!M@;6C8hjfOHXNFfw_O z6}EZ3sx#!E`W*U1dJb2fUNP)#9ecSgmNu}N1z{Z~bGWtV5;i@GZE8>6%g=AYt5TK6 z9Q?{ooX`Bj7E7NS`Ly&6Swg593L7eltJ!T~D)72$_){UfiputNi9rc=Sqw#{?Tk)d z-`~W)Hj0TDVY&Bie)aZf{H1(DRY@0FzK1Mb7wdsG9d@u-zpui8dB(;T@O(v; zwwc0FR^8s?Fh?W4$)G?IT|+hLDulwJm)?^A>HDe}OGQbYejb;0qw)FkX~la~A4e;{ z!)ED%7wRkpvZ|erHKQ9&CViZ7#oNleG4E`Pv#E3%;APm|+(Em(6zFmarh!XYRckvS zP_^GTcwSoY-?)j7l%7nmO+i6%nQ&k`#BOQM=+~5`sdOX@kH#e?yIlnCWjZ0mKUU(p znep}yCnX0LZy*wv#9Av~H-?-PYvT9;vdx@AEK|m3Q0QtJMrYuIh=6JuK3nSGU|<s2()54x|r=$ zQDfV+1%3UuF6xmv3U;;eWz_Ane@|fqiVYwY>rx){$!-6E*KwsCRRzIx26OIb&=gbA zwF4;YKNoPgYF3jR-H6LZwsGA%?Mx67)#f5FZnP3g(&b0k*D7uGF>vM$nva!h)hrI^ z>WbtyKIlo#dNqdP&d1KL1O#zhIe!F^Nh)r+Kb@PgtsLns7LVD8375v5zfs=Ij@dwgn4p%b;lws8a01wQ>qJ*w*?Vq>qEtY4kX-5;7-6J8$ChwXXH?HK4%Jrgy?AqB~8fo zU|WcDYE*_sRhwz)FkpOL!2a10#B}f$mRbFqX7U_tS8g?mLoled(i#^4ohJ1AZFk&i zZWyeHhA86g&)$G~2uh<1BJ;Lj6n3)mG2U1#yQjtAci&ga*pivmxistoREmjK%i6b4;9&%X7xF(=(E_4STEh zL%x+ru-wa^aRpMT39h#;%TT*9O_;en{2-}eA*AB~G93kkSs*${M?*uC!%q_h4R^wn z2StZx8j&~9|3{UWsoAVJh0DY08ZxW$r8d1XGA3_oJX`fWR9rs}@2@78%6n*d4H1dT z)I+A@E_RX{=DrMH{1%Px^c^E*oCU1qx0gwL-1$X z6wjE4(Y^xTj`)I&*vbjCjQ}Z5@9Zs?F%(Zxjz-mmRwnMmQ$WVpR<6Rui!&iK!HB~< z7`1icPqao=rlWRyDmLHU7X1ysJZ8bk$kquO7D|Y-BY{ylV$KCYZ%}t;wfYVlV)OT( zn`|Uyk=cUK$*j45?xBw>$jtg|N{A~;>X^|WaJy`2Qb zRDFbReXrLaQ{{jyw!o!P`XERsqeJ= z1z#8`*P5|OzaSIM3!b(>y?L?LoWJ!bWp)3M%MnFEF-_*~$Y=H2@oYq8cpJ&BQ=eCM zBgD9u=W7m3nE$WF&$Wxb75FnNyyGMDMgfVz6^(&3VWPtJEh(kiC>jL<-W?rjyE5UA z?uKRJ-_`UywM-F`=^WXWJ(;re2_!W{Pv4%%{1y65?*Y=Bjxvqfe|d5|fxaAocZ5@Xp zDBmka#yeFpoK)D!54Yox2(7_-;&>-D$C5h^nbzcluleSJ?-zVdjUIN3$SF2;&DjUeAi(jYi27u2kYfRnU1V9)!J}#NW4* zBoQSS>&mWSB1SvK&9$VQvX z+CwiVuAg$8{okcw%(H0N@oJ#M9UWOfFGzeg(HQ``R*pyEs%+GK?Ox?QBBX{(x;*-} zBb(BxDwa7EwWSv|Merh%W!S5Fem@sJ2l4R^6U6EH&~f$b2^-M`MfU8?h%$5w&k{Zw zsV<}E{f!sno9U8rJJ@4a@UiBKac203#Pv>R=XM*4%g&XINoU}o5@Fz}GNU;R`+K8z z<2nWKR|BwSH_|}pp)pvu@0f>&1L#uX6{mDC$Y^>?0S!~#M;XK^gb)d%k;zI}8Jvy_ z*!>Zc8sv&LH#8D36bkGE?~DG=86g6e45}W+I~V-F^yavLu<0^sR6nWDyfPH7F*vp5 ztXESea|piPlY!7=jiI3D5!XPT;rB}soQ)yRshagz`zQ3KTaolwPf8F=wJ?__4d609 z@YQUmHA|owe5-kHt0SMwkJ?O0xSuLI#_si?inv*i&44v}sq%-cAx-HEcJ}DYWtL;; zI1cQV3i%s1T>V!$+Vdk7#irWVSX9+~Vk3u|^hxoVs&FsUFSNvRk4smZhP2}QA7_l<{d$XSV6R_GqN&Abtg=$aC}uVF&8Zi{#nS8$fsH4Z z91thVCgc1f?O!9MDM%oNK&8$DKP@%8%aYclwWlGlzip=8tLaghvQS}KGCL>s^w>w1 zs5@D~n=!@4-KgC)DP`R!H6;zYe=Z{}Ht#rNndiIQl|vrx^Ea&|nXGS^?{o#i;Z|O} z9=3$ywAPL=Mi$^WU{FiE?{=`7WnAYBG zo@#ms;GlL)=(vIhl%TGVE?gzvU+C)TxY=R zDv%cs**58UBhm*uc9$Ba$=(IBO?uO>`HdkmtUUU9jxK7bHFQjkJkU2}5`z;K9Y(jL z4i}+#%6ydHxlIt9Kg<@}?drc9<1IP6Bcc!Dz&KKLh=KZEB90 zBMUgFqW!$ZGan6KT~MCMBOlX4uXvc<=*tUcTJI>#EKN@6&XK%uWVRzND=I<7E)x5U z?M7E1UMk-3I4{61r|(ZU^sN_X#=L;clp_ojO7i@@ho5|CxZsWZqXy zrb_$U-};{Ip{sbhh<%e^Eh__* zjiZ^6Bi)wf-`L@_zDh=Kx$vj%0eiN4TRWO{CpbT*awHVPeqadkWg!Cum4_zs-Rt)M zRzkrv_+EUM#k8FH{!m<~VN+V@Dz;GOtK3dUJ1< zo}RbMC-#E_8%%Kfpvm1U;^WsY?JIB*fEbV18L0;lZBjFtgp`4Py0o-go`;rY-X6dK z=C|f$<&;P;6bjPK+7&^{+F0~jq-5peq1Jo;EFs>%ZJBtKxq65SW*>HYNm*%m9Noat z>yLnk~`N2*5WHJ za?TQ^e$Uo@L8dI%kGke5fG>zji0b0LRH7>J{ko#}E+jK)CoSPQ`(q(q2HB%JTl-lI zb2~&J&u5flv4RVNb#3rWN}&p>lL~d!5eNqn7ab9qzoiKy~g3y zE1n#j)g)u9+otH|B)dGR87HZu&bKwOR5c&)*?dr5pBy%`70_GtNBdK=`BvwK`(V?$ zRCGBBFdKvtN-9xMH7pi=5&91TO)R8aMUe@2Mz_w#WZ1DX4o40W3)#}1BMDc7ilRV2 zWyUx94%*O;arg=}sUN;)c!T(}t@zk+2Nz!9q~vZTzOH^V((P0yuan!`rP4e#FSSQ& zW}IU5pXF|zJ8)V)M=;Q_AUIxA?qLLBqaN_I0hQK@Vr@&9%1>3DGbW3N8?R=gz+(+N zOYyEOtAlzHxC%Z>Awoz_ZcdV|g*^!2Kn{|X@?$>g@e8?gXyHh$+uK8vX54-LCS-FT zS=IR2*S7B(&g%H=A;s>KPtZ>Tw}yWKGAWzIu4YMhDw9x9Q51@Wogm#q4c^fOTDl=; zRxQ0Od{T5yQ|ytCSX+x1PJH~QG!*mOeEX3gew$`*i38wWl~ZVFLv_&dj0h{t%0S0B zY!8G8R)QLbU;$6iENt8Q#cHjh8TNxX!sAl_{e!`R@N6b-{SXM|JMU8g`dlHtc58So z=gSp+I7V0<(5#$A0+$1gQWI&2Q4(O|h_2zVLnu-?=eO(W0*l~6cNj7MG3R#HFksB}A)qI443H+<->i^2n+3^4L%s8@z)qPM1G&CstwS6`$rv*s= zlA57trR+(C73#csucyV^t2nN9GG>!CVgG1K_P6dZ6>XTn&3jotwi*Rl({=dAI54PFA;9*fRm7J2N*++ z1t%*e;aA0e+TVT}gteUw;q7nW7cXRqN8VIpZtUf|p#` z`2!o{Bb){UkGg^3Wof7PEIhXUc)VQ~fqu`BGao$i#qL`C#!FdM++l%=jJq?Tcl_JW zQoXUR33O;JE5qp}Xt$e-C-RH0$*KNID%xp=-AciTwk_nW37S^M+|$p?48=QQp@M(2 z#%@}IlM}E$L-D0C_mY;`d#Cs#k33lV16`U=+DWBF-aR2LXInPk(&pQ)R2mPVApaCh z*1vsvr=JE^yS1dpDM9>x(LVtvUg=X!=US^?AFYhIy#o~kL5Ga^$!Z+=+dzSCp3x^S z;vZ8cL*w>I%O`}U#&qevdgBw&IFwbQ9PlwarhO+Jo}FuQN;YT{wZcaxJ&ZQ*@%AzD zWii;p&W|RX-O`b`fDEAh+5HDP1B-lqNn->_j@-4{z^99@(1fW!A#plsQ5oJ}IPSRU zg{)9U=3ixffDVY__={qHT?u!WP@L~+cz1pT>fSWvwi-h#ov{43kW*^73_laQ{2V58U@1#z`m=S-Bq|&xZ`yC8aj! z_}FS0Nf?(Wo>x-#%Nogx-rocWUd%d)nAyNgns}(_XV?Rcqycftit4JITuMUgf%&2a z_)Cls`$^c>0StEZf~g zx!*`vK2w2HS78skesa~~*zj2CxnUZkNcCXV_GQ!#C8+H`pH*HjprY`4Zw5v@k9DY( zzCD1aDcTkA9P!?TJF0Po{3keqkjCazsd|gh8U+8qbZf*cO$Z@{6&XyZ5cjJMg5yLX z936u3b>TvoEpXq%jfB*EBSPRbq!!y?eOkM)v&@{a+iLL4&TEZ8#@#k~T5s zy2f~lJN%1`JGJ3e5Z|d^1_>PyLN1t3P9#%qsKh(3F}D$e z@^o(gm-S$?Z6Fic16nI9RYAJB7TXJ{vfG~FENq>=a| zP8E_J70>8_I{LcoFwW^41Bi`QA`^x1mg96o{s&b9Yln|Wn5_2U3icHtDX zEu96z65fOXdS3(A#AbOweWEMrF99{rU%dLXR%Z+!veibmxG{cOgJ=P>MDUOfGdmYk ztuf5;Pq#m?dU@jTy(#Gys%sE#f909*zlx6q_ajycOj9|7`&_&bWPc9Ro3go6eagw9)2T-sh5EU=J`%=*vYy~xMuoW*K z>Ko8R)eur0i+MB6+eYY~8SvyX7Z4QQbEm8B$6tPyvP1Bty%@RNC-#=AW`8AC}apyUE%S!+6+BnMaUn4~RrE!)`t?&-yk!NF*?8)YH_ zYTl^uf_*Q_?59&zlK(FYFn}mcJ5~zu*7u%_HBD+fzcYG3OpZ=hRA$^4q~^rV0dTs0 zD`s8|oA$NwYm92IWg;OxHA!mzF!!GdbUnyBf%L$vlJTTTT&K`37_ z$QgW`H%Oo`-I0h?NyuTJ3aq!_MN7PBrHoom>0+hY$ zJL>}XO9F+XEIH6#2(^UqJxa&`J33LeA=Lp~BhpzUs_F*vx716cbl`2#;@*lSzgjSv z3wi|Lt93+h9+c#kkGy)Lk7m@3SNiG;rr3fI(g%r6XK=) z)pJa@KRiW-u8BYz-=-TnhP}_YC@`(W#0B-etD0lO#jiF?(J_md?rXI)U4cK)IS7%D ziKe*Grtur$GV&Q;-KPEhs}TH&KmtEMVAtKqK4GpHFX$u=EliEkDHk!^Py}6=R|qns zjo0)?@PLkN`4XrJl(uvD^p%V*J{4x-1*LYNePoLq6fL9YRIMuCI36o$R+Q&%34SZ- zH5Ae7%|%W={eMa?Ek-<0>7^0`eLj~*O&qo{x-PAr0xydIy3_OcZyiw{)ev0RwzhWC z3lE0z9e1*69O(_d_LTM=zuQ$M`jbKd$n>-4C0Fpcg%$~DiU46RC>imZ$_!R=yqmqR z%5b}|VUTNaK?N~vj11TOn>km#lF|_+rP_QzU;Is8JzPyU>2H4Fhr$3ax`6yVmhR=H zpV%mnE|7qQe5-uutz4i5&r(5nKAhCCu+L5O|Eyk<5@xxrAF{n9+_)&3vDvLTY$Jl~xn#IDZ}Co-kkf9=9f z?|UC#;0umkSP4c*C^bsD7U0Vwa)~4z$>`EvXe=}3?QIW;$iEs@hVzW@|1J^&wq3dF z$Q~E}AI9D?D9)w{8-?J(B{;z?1b2r72u^T!2oT)eogl&8Ex7yQu8X_7yX)CJvG<(% z>Z`+#Eoyh}dwRNidU~$u>CXIEcR@to?Curk9(yR-;C*mkd>heVeCajMz`*0{rMvt- zCqP8aLHShna7x2bOlR57k>xB98Tr!Hd-txj#pscRjWCx|54XQcWUkUvB}Gb6JFh1}1h$DfeU*jQxMY}PMD( zymwU2y`lJJ{&|_}`}Z>*U0et6ZLo}VMa2c=2J7+O#{dj_ipC>b-yfO&7+fJi>rt$e zJy#{JRernrcE*vBBG?IUz{#@+QFS!3b-+$UlU(APW&34P;`+p;%j)vIx>i}FU^Zpp zn)_?K4;G(I`kSZxTIiiyeQ!J+kaP8rdV~{q(aD5b0s?wHjj`Vk1xpEJQ>lNgr$38*38n~KZnspE?-x%K4t0turJynVf@h&hcCpO5 z>0hr$=;)b(n51RYNy7$!H3sFzTBwQ3yn)4e)Oiv|$fhPE+pfAUeRup=UQ`m zLc6|qwdEI5bL!lE|3K%C=ufrK8ZZ*ho@Jp*I!;i@vl?+<%<=~0KEM$fU^521d%7*E zIJEZ_|8)I$`c#;j9;Rj3*)k(plfuhk7hsmXy9P6db}TprWw6we_SlbP&8VSXaJgvX z_;$-wg3A3+T0_ECGz_Y@RIYe;wBQioWI{w@ngqfh#vJ3RmzM*}C_@pVkP2b&y#MW} z#Rm~O)hwI~N<3#3JKZEo;yMMndtF3hFBBSAlev_rhVd4-orZ2=vgW$7nfmaAL~jp{hg38@umu zrC+XkmDp6-ZGjO*jC4u9yR~v!%aW2&e%vYEK|iAnUu96erAjGEx!gE_ntUbS`~Jt} znIQw4%hIQAp2sm*$G10Qi1~h>QODjhYKk10Dk{wQx=g=PdXF6lYzK5; z)hr;TkZ>SBB_9OoBHfpQt&;ZH1u&_0U9q8qN1HZL9U6xJHJI<6yuVl5tshUwy7#X` zmp3+?$4sv!;q;YMzGEgiy&IIdfg>a^FFBlZ2fOGEtl%uoS>+BE0*@3-SLA)xozI?; zaikZ3jMOhF=W^p0M%trfy%^t^U3N>@_ocnvhWzl_j?f~j7Cvh{S`_J^#T|^7uZ0Kh z@@?*AH;MSC`m4bW!If_nd&PheiLu@=mg9ww8!fyUm|~;dk#Q+qKAdR#V#<7{6Ixa2 zM{!@iF1Uvlc3RgCU>D$Wh5PPF2P^m|N)U73Z?vr9qPGBpKQmwPWJqjxDT6V!l)c*1 zaPml)@P_sNaY1BeH51Hq%(%`^V;G9?`hXN2bmlkNjyF#|Z&#YU(6`O2WmaQR`VBs% z(t)*Ze7cClTSt99^+Kmk9q zjx=MFRqEq7>@iLwH?Gse6UecXkNob=T2wlYpyjF1&N#k78Cv=VjF%Vu$d5V_{U(C_ z_?{ZHc7pyw;g*I?RTnD4!_;W!-HO z4;m(W$xN5~{#^I|D@PM-KaKO(C$Y3=MaDQ}_=>Bi3{W)NuDnr82_%Fw`xm)$vo|0Y zuab$z@CE>u`((t-;203zu;};EJ+XlU0Da%?N}V`YYU##qnLD^autZy}DnRsk~q1 zHCt}+Puj3DKuS*;3RNIJSnQM`O~z{PH3Kdyqeh~# zFH#<)Xr!+}CfhQF_>Q+Hx3kwaG&pv5UQIgKUVv7Qx&L8JhDwF)vcdYMcTOPA7jv3v zB&qQ9HCPAKdqRDi`7LDYl@`K^c8#t8EGDP3XGtM}1nst@Hx6t7!~DnCuo#FBACRD4 zB0pWVT4J|X1qvN2;+R#cd`A^kN9&pLNQIJs$>=8`C6+`3gTpZ}Zd?A^tpSs`2jOX_ zzrvkjU)olE(4%y7#-yPhta@`+bVZV^P1g>nNq86Q#YU4}<7h&CHztBlYL;rpUbbU> z=NwY2&d_Q^s*_F{8PBM4=4DI@b)#-_r$}9k%&z}{f^wB`?2g}=eypqiBSSs4-@Vlh z?QEts*GZYv-yUKbrr*nC${j<4kSQMxkt}%ibiY51P=iCk#b(Ep+QJ$ds$2h~s9OI# zp<2Vm-MiPGvZ6hfO4(S|2DI#B6Dlx5Y9!K$(2 z!-x{ncX6>yH^*LlI*dF&1?T!@X%bOvTP@IA_`bBDyTU|o*J?S;6};xHI;6?GpYQMA zltd#uHQrDdCbkvmBPH(k5~S*0pUDa%T)VR-j&c`7yoN{tmZ7ItD9j2484EibLZ1uwFI@Ka!A(M$hnCi}nw7Ch6!28?f=T6{&e%fC z_(-x@-)k@>Z+;V+l!ut!00j!1Pph~wrXisU5?j(|zfNnCx!-*)iyOwn3BF>C`Ytbp z9xXm*=-kiPsU~zOuyEE|_0^#LJ5Y>1n46t*AY2gD!|p!x2zn6ifd~yrN?TI7p!uY2 zlxWi`gKHAr+)8X;2Ni!<;Qa0fgSExmv0n4m?i$hattt_O6FNj#Jd)h^o0Rc66Q5W7 zN-APSdKuNe9+(uA80}ngF4|nY$&p-_ZgXFiF?+5@Oh=KLe`AuPi9cL@0Yc@y=&vv2 zRPi#iPt4-aB*#t|v$5Lv8^^m1n2#Ar(qoy@%8-V5uc~*;GjZ0}^H77aZW!s8x|pC6 zd$#paa0UCHKXlC=$%Yd|4gi@TW@)`htCWLBU!1+9(|>y@*%K1_NJg4k#4-+RzC zLbPDO${`v3qD-OLv|D*J>&H^l{^lFuN=tj4mqoGochF1ZF4bdTbB6#AW4XqInTz$S zRr@(>4(`1usH{BThjb3fApbj4C&!)dDd3}}PT{FEJ+j>u-)jPp1Nu)61d>{l@|OXK zj?t-K@*ys0lBrCr^vXl>9nlJo04-W)m5Z*T2(H`M8#b z4NXAf*%TeC-@=FDeHgfGxbqQI7`XL`ldpa*EW2CGXhv-08;&j?_osr7_1B?nXGOBxYYEsUM@gU6y&cBBPSdLqC?KGs zK(;ALMiK@^1w^2iMfJ5j$yQntHqXxInmVzXk~=g-m-b-Ngn;Myx8xay~G~LT1x*7k`xLr3PYo%rpo+G%q+-!1OQ|*Zv77n9*%UvbaRxrBiwCu9I<*YM+t!7C#S0@VXy% zzYVYOe2|H+!wVIA~`bULkmTCwQ(QjllWG2{JTST_?n6oYBL?*X*}M6k$--`h60gv(sML$rxVyIB$mQH1l4nM&?x8MU9Vx z^J|(*9a5F)IjZwoo{XMWosdZi=u#py6CBop@V8-~tr@Eca$gwr8^)>f>2;%$Q1mS~ zaMo2k>C?r7>_HeI*q|KH4&s{2DC2o4O;W*?V9ctDD3Wlb1|T>#Uhn9pcg-+HZ*?u{>y z>79Dgo==W2r3o<1`3IUbHBNo8iaIE6TqJ2dMs$s3PoAsIvh(YOPlC5@%E{fDwcgVZ zoKM=xa@xbq7S0FI!bXf>M3hwrx-tYNFPxPJM(J)BHm9ORQUu>6=s$tH4o1hMU$ux1fqUN7UrqweutQF1MV7}R=2r+*X&0OeZc zvlky}+FYhKU9$x)a=NZ1jKEDiUkfA&P#L+5$ePP-s*UF5iXy_YRL64`MV*OK8XBN; z*}$95B=1Xy=B8b}4y(VtH0=b*&cG|kJo#qL>T!y>)FULBJGma#xWGK~=z?P34aG&6OCxxN6b_kDU4&NJ^0fSiG?AsxMJa@EbRKLujV?R2Zk_vEFwh7Z$6UJz`|0G{NKM>VVCZ=}YkvFb;09cIlA1^5$~z+}8VWz70#PW4&_F>F#za(~{>NGYx$( zF@Y7J^U4rmfz8Of;LKnMEu**lt!dwFdxX9vDQ$B`T58{6#-kd$DfHKj=2B{*x$X#k z?bYXgLx8@4k6}zRN0OR}l~d2QE(KSla6Ig)$!7Lw!;ZOLFE}z$6b~hXHYoOQ)IVvi zDj=ZVWJSJbqICh3d7akxA`Vm*Z%z{HE9iC&f)g?4TGrTB;9gRu&%G8hHy@vXL|qb8 zo`#K4XzBY5iF9ENzw|iXhk~~(M~1i#it_GgSy9o9DFJeA|D%p|;W5JliXwLTCn(}S zjR?=P^w(OfinBHDyB&aO{dPcd{lytcp#ttexaZ-Q;vJv+1(s!A*zb(IF$zV_px#dT(yGj-L&s}A?6j<}<+dQwm{ zL7luz!)Aokmg`)g^D}T5@X+hzQOQGv{W`kr)KK6@9Gfd7_)WF3nPMJTW59#D}Z9*7qPD_k=o8y_=QF%6*%u-^4eaGjkB9u zyq}oS#YTIiD=ErDvxgyIyEJ(etT;G>hP0ysu1X-PRR*25``&MBlAw~`p4sEC38cb1 zB8%=NZjS7_iV&GwQ}hSY+`SwwdAccFrJkH&A>eZ@MN9FTEQZ=KXMqZWt1t_rFG4< z5JqX-iB%MK76*$3>0J-^gtN~V=73aJx*a2zyV+Z^qZ9nisQ`AThmXDmSkjy}&kIR& zEzOa2lxf2_6IC3Z^|Cc^sww>4t5Y*CUGOh=Oz0OBw$KECt8EX5mSeP(3loaR!pQA7 z_ruxbkoYt#H{*$Bxa z@?4|c| zW_HC_reY`R2M|XoxNGwp6O~WI5vwr~~y; zk+jA9%;zU|N7)M{GzzC%&(;U}w@;ccu`-hBAL@S`+&?7aXq?UQpN`TzP=hM`Wa+Ra z5;{5?y?AIjPk3KeHDp=Y)Rim3gta;+Dlc-J>fYbfFmb0ILG%xEI*5S)g05Jr*Hr_h$HtP>t% zlWB-jp3$9#@;4XXR_f07J*O`A{oa?RF#1;^AV0szcFpjese4?FduZKD!P66{^_)gM zCAx*s5AMCjwi~@|)n1!&K%VoDw^EI;zUE1ZjhAU(HV2&E(>$&(zAsHaJ~C=bC%c7% z0T?mcmrvTyH$0Yk9_lRAx(sMZzg-TnAF?h)Psk?eIaDEJTbhWU(V7IWK739mwoHgil1>7A$IyqJMnO^>=q+=ISk4e zevRf_5viPfBY!dd+?g(QOY;q$9`UTSnu3AVFFZ;-Vb0gn9=Df=VoixmpcJeaCi}Cd3 zb^jFrlxq6gBhX+iRY%ro>SeR6NL%-zlzsNOh~4G*!jQPMp6cS1FDLco#_h;=rP8n$ z574;rM(e0H3~oN;oaxm)=A6AKQ>-!L-7|v*AH{H2 z7J=Kl=}v3$u>i)R1iXs?@|C*?RF>cKXRk@h#d4Ark_(2a3)UZx2?+MlW4S zq%qjVq2bCEyWcJgdj}+A2?44?227Njn8Y(H`nrx6=mr&t}qT*B69UdyRhhFZ1oT zdF1=Hx`CndS=fBJAJabqJ#Z@B1RoI3JhHo^fiTE0GNFAfd%gOSJH`<)-i@_E$bb}= z^F$DM(~Fmrdn3ORNOyF?QQegK;3m?@xXTAP;Q&l5x5GF=mszh!6fbY*Vi^Z~h{*c{v^B1n(u|@l`y8 zCUVV%bRMTFh0RkRlPU5NQ#e;&^EgdRoV^Vk18=mP;V#ZZ8CgO}e#?X6ENpgF?9CA$Kk+jqE`}HqvCV|2`_X!!m?$P$E+g}03w~3ohN$A9^n@;yG`7k^ft-1M_iTd$^=IF+hpu&O{NGrloc z1>zo&rG30=u9LfV!6fI`ke1yZi{~iiGDCw|NHn;skZh|6UO0)2+v^mcLf#S!6q?Y| zJHs^V?G^=g5F(%s;qm~E--gP*sD)zob~9ALYM_vOFA$vmuh^xKwBqZxebghHQK!Oy z=Lxm1B&~+~HCWNM_>FCGEz2((MP?pzU)JZa&RWlHsKZeU6A2_FyQ zrC9jAy4r_wM@+KBjPvC;#h!ct(T8kH`e+GFez7a>I`SP~{Su5cCumFs^t^#ZI}Jkn z=2=qao05bd!&dXUFJ)e632^rG557E&5;xZQR`EUIe9>aNN@&{SuW{-d;`>$*9pwb< zBXiP4;xxH0N&cD0Tl8zf?MsW_IyKIwu}U`IA`(pH1uQTnoPUsHkjWZZq+nT2aQGWu zLrv#qJFBkSr#PbfQ}bdEx^Tt@FX3;kqG>B_VeF@q*~vegEm-TE-Fck!zeh8=(*CO9 zL&}~v&m=4|@K9i)aaW+A%=ik2Q{xQCSx~BX+mo!}G`C`_TX?_$>U>kP1DmJlzo+tv zd{^J(Ldt9Qhz%q)1sKtt@Ya0KniD*J+<#r@5QlE^x@vdS(<&-VsJ6F#Bl}icsX|9> z=8_s*>26;2HjHU~fpl^Og-rX-^uI|QDIekk^NSo3rk(~e+`@u8^O*W0pP8=sH#%xs ze3^$WnmDtFv6HoSg#2wJ95jTjj$Sn^Kz;E!U(L}lYO9K6yX%Z~YJ8IJ{v$RgDaB?n! ze9u}J1mlfWp*6@tFm%L5sO`(`z7Vm+PtR&34_tNn*sG17pKsAOm+Au)FJ5J{FSZ>s z#VspKahqT)13;-GA$lb$W8>;H+dlPBHcH)mS*rqj0CJcMe5nJ@<1br#Um{fYh#r6V zMOc7z`+v2JKm>CJ8+_+3ixHM)^Fa2B0Ni~$#c8;`cZOIgnd`bQgzO20TD*EPg*C+e zZdZQ8DtG6GQItOY)S;fHdr$|a7F?{+*E0iM*5}xbo0fQVopk@!H60N42H3+0!D(Rk z(pO;kbfbjMse{^RfwR*5jxZf7B@Y(w#hy13MyZ_o6g!vM<&C2>>Nm{vz}RGHFXwg* zajc!lHyq+ZnY``Gyo~sgua10yF2x$$B3m1#&RKAwINg3tf%rVcA!V=8oHNqS18Mrz z)%<{9QE-KXwE27{D1bu0?*XbP{|SS0i^}O&2~-jiO4R7pMKqtl*6T=qOYl30A%c|& zKVQM+MS6z-BrqNdC22nL6?`4)vfw=^E5^WaSc?P|C7{?yI4BhlIT9y%@%`7~v(w1cJW z59670dyk6_;Pkz8OEOd^9M@zFxd~gQ-gaDHVqk^wg$#DL*5HcpNBSHYp z=6RC#mIwUR4t6=c;6yUpP`R9J{jV|~_>}u+f3!xLV9(=&twh5?90MlG3VJ7j{}h+~ zf$EtthK;z2y#y)*Te9m2DGEcIIZ2}tODzwi7*=m>g*gnnvmV==%jhvrsYsoHu<~r% zk<~rtHj=dR2|7A&z5(vX|Fm+mI`1v=X3k8M6U`L)ug?3#1~`rN4b9(*$jzLQfG{T zqk3L$R3S7LkH@Q>h+#pBU(?1w=k=fJCw&PuH)mxPS!-smjkZvS`g_hBXQk{F%u3tO zZmAQQn|mKEKlQnyK%?#qM= zvQ?gTyj#*fmdD79Y&=J^VC0O@+j`NmXQ<|1&H3|PUl8?QEBMA3UW{Zn7n{cn3(`&-&ePlPu#eJ@~1VqW$NJ#cB^k{MwqK$bkVXlj}K+ zbiYhGsu<@#heajy0>Z$x&0OlcXkH`kp9ZY|8aN?9bV5+s{aFM4vhU9TNqPnT`W85e zIm!F4{|^KqMD&sk!&lctjatF~elVZ+fBN8==x=U=%nvy4JrJ|YX(akX2l>A?36ddk zrI~hd5wp<}cQ&`4r~Le$FtM+ReltHMjv}WK?Dumxu7@-4f+xGJCm=8|HrIg&C=7C% zvANmrcC##)2AZ#sinGd1(Wfj*HZU$ zP8mf1HGoKT(+`F4e;1;5b6cwv$S|OYv80c)G*V0Ed#n=jeIHgM@NW5V*Tmm+*!cWY z@=x)_+apnLChIk|)tzIsVj~#+gg0E1+Fze_-}&z!{pQUk2Fo8j)v3C-UzY1DS?=em65QzByh3OThy$bjPM(|68;I+CCW{e}-22 zL;1w;tpe5`)%(LP{rLYI2Y<^Ys4wV$XBj4ESJAs4P6d(Mbp-R#f-U#ia_7wjr4qlH zE6wsx(Pq(rOZ`#@`&IzHSMB(f93kCtP?Dr^b=H>rt-tYGbiAeqveT%`& z%3pqMR_Fhn^9T_O;#r6cl9HrT-M{-0E&M0Yk28@O*Zm-y*9IU;zxZoY`b;eUM^PAw zREJZ$iwbNs+S=HQVisCe{bK*mmdHE3qez^p0pKOjD3L|?f$VF3Bh_yfal-wx5ubL> zeG87;v;z=1;f*IM_P$ow05o>+nw z7?$#%FCr(>{;C0!&0iy%a{ZULzv)4ZME%FofL{HmZKxXN-&4YyNH;^%`C7 z@2V0iC?BFKuO;N>NP6ZM7Cl6=D`hYHx8Yy9`}&+DADPe3fTH%qe|{Cm{rY=9@JAE= zR~7yY4~OxuO8#kP(Dj!IkpAs>y0e-+<7L{waZ3G8_0mp? zG5lV>>Y{Kd0H^m7Fyh>%F~17A2P4{Mbhe> ziQ!+isP+0Mm9~%H867Q|QZMKt^KCT2U7rM3wC1`y;mzKG!M9d^=T4IV)A1XEop?`@2v0zvj4fYI$B8|O5Pn&%aXE2tM&aB%t|i0R{Y_W z5>Rz%Tdgpgjc)bWVsG)QJYwWdcHj;plPz`1UUsWgWOcBTqFgg~xUc_9l`sa@?L)d_ zXqBU)TyiV8>#VO}S(cYM*Ted>If5h~qkpZfGfr`@M_$vkF-xG6qkdcI zySeQTtMa5^(EFpzG-FS|#}5Q=bnvsLXQ>L_CpI4tb^Tb>604r`w&QQG?ZC*R{NYXu zp8h&=McZ6DWgg4a*jRj(46&HH0b_)Y>^tA>+1n6Qf})&{dXBvIW!<9q)z%siAlSn~ zkoZpieuSTEC)*US>UBTxt(cNhpB7yZ+?NGgB@YnFKE|tBTo08`1C8nW-{U{|1JZjQjw(=KnE(iJR zqc>*rTlk5!xhVstC%T>X?PKtShjjXT?o-v#B5T73Dh%e;N<2Ja>eH3A16}cZqx0MA zjVJ{s2G{vn3c{KQGu`ej0n?tIq2oA9*Da(X-I_GBD$#9F3L(J!v>C|=wjEG!pBtXjlGI{T(Iew;{|3k<) z-I`P2SNFB<=1RL$`eCHX&1Tc9xg|u8fHkSMVe9YLlZde3T~%54xdMN2a2YWtrsvoe3xmjyw(22p~? z069!eb*~i&C%4UEZJ|BD6Y_~>w^_*U!d-zyP-j`(1Jl{tJklJ1;vCRBO_#kX=gALBqnpBR zgj%<9fekcs^#&1f_F>bgSRKE^tU&jv^?E)4&v2sEBBy1TtlEhHD5M2Cs5DYx=l9*G zWpytV1akyZSZJzB#}JVZ66zn+nwu3JHeyE04tQA6Pnr9sr)J`eRM;?%3}tU7(>R~* zs5^t0v{2jJHXUd|$Ka#xr}1y8XKOR_UILtt#tt{&9Iq6{## z>95jI8G?>&En@Cx9!ykHQ)K!d(L(YZjtf8-8|dHHRe@Hs;mNvb$Pwv_iF|EjmvaI; zXbn)ehz#_70Uqtt#t%JS0WW{q1fH8oj-pSU!4h7tLNfsS_T`Yv|8Nsgof<9{U$;(r|^4K z4ZmQiC5f=!+Av0G?lgIdbpCqNuEDflw0=g<^U}JJ35i(`5$v#)z`!_Ya7KbBnY~$PI@&4zMSSj za2N-9=5D?Iu)bOY7LVy_*NDhK*GD;-ZNJ>c-wne7(2r26dS~SUM>Dh7t!b(xXY;&U z;$Sdd-grI7B85Oi+I%5pg-~US;g7Uqm2Fd<7XXQp@&NU!8SkZ;_}mA&TG+(+xGA@- z+nE>7o7dwp{Z$m3LqyLdODGFOl=Z$t7tVFlWw_M30N{Yjnt@MOU_7rzz3h#vcG$Yk zcUQ5K024yzc*y(Gs*<>UXsqH7Ax2kWR<~caH*V^?96kkVTk;2Z6gS#hBT)pgJ082f z@x+NWW5G@UF=j-O|)E@qH{lKTO^w$Ts$A9(}_*RA7d-gDkExOrcvtT z2jzJdq7w0%M1=V+{7)AvQhx4#d<+{&9=^xKW=h;!iU%+3>vpAG7j42e3o4_D>^BO> z(yJ7%^f2|=6T?lB7FT<3+D`3is>9`E&cSjX;I{5QS^M|uk>I~ZaoTko1gK}|M8P-# zw|K$u*J0GaMHQBYOInYb*eIdN)GO4zQ;yTIRg^?lpb#LeoXdL8Sg9X(NCx&vCi%<1 z1NrfYZhSQIWDpr>>C;CypK+rJ^winTHjHQrERV|)pLiE%Z)ov=jot#>?(g~lGdzCA9UPZ zC|Bn~$4k92qSqqyfZs=|9bFe_)lWd^El)!P;dlytJy@g)&y8v0i*5*QbEui6h;A1h zo5+(*!T&jD|F!}8OF5;O$7!J-%^wLqsqv(Xs(akiw|9^(eTiDpO%P4X51f^skS@=p3T4*z64Mw;b*#i^4qU<3mG>rd~qZQ@0B@Q z)LH4VJVN*r3-IPYw)E-#^QN(9!Y9TY3pec8-r;U%Dw!tl=aY0r^Mxpz>+}z$S>{tF z4TjsMjziP(lp588C6E(o>|<;Zg^I9 zP+q3jY68CgiC;-}a-+l*Ylq*pY_5$3F(dZ+<@mLn-9|O%W#TqH=5FtyxS1{ zbwu3lg`on0Ut7&h`C6j@FzH68oFlMHJqEx!PiNYek=0Y~abNtW|ZKU^6H&bC16tO0A0fLJp1 zI-B2J1y7)50%wo20fS3d6feeCK@4A`=)%qQ7e@M(7cvlD$v=5XT^jd##3ZT;hLmb{ z4-`EK_!tlIoo6n6u!TW^Mcq$@wZaR&ZkR?o3Y3uNf2eSjDLxs6jP~73XiE-bxn7w1 z_?0Y)`y_GI-pDFoBg?E@Y-L`G*jpItMdx&B9Y zHoJ{>FMGR9Y`J`?_4ix;J9pSi|F;9};hcPY_aW;c z2LhFZTT>L6yZRY-x@hgFTgDFV;*yMPt^O&d&cr|)B-(@C6Eghwcib}) z12nB&_sbu_Qa0VHI{W}A3zd<5-p|`sVl3SeXHHGCv`;1Nxy>b2^si`|)tQ^>s@PvW zV;gyvu^rsTQ5NvbI!d+pkoZ7%)$xyAT*Sd{DLSk`g`%v@@fjCo9-iGl-;~ix1Jcb2 zWK6!`u8uA)7H!w6vGHnpUIsi9GZQ1ewM}=;KmKl?OWnfb&qQJ^p>ptn!Fs=_5}%{WDJ;?+lRj zKX;O;$M^@-?>#Ec211a9!5%@$``bXU0Q6iNTPWEXqUu}Rb7aT4<9r>Z@08a<&g&13 zr^}BdK6^Usit=Z6h{pzmhY|>YMEKWK)g(e+r)?*W5I46}u-kI_{bPpq9s=qS1eF-s zS3VC)-Aq?pIww5h!;|ifR?>^ROR*wiRINn{L$C=EDl(1Gzid&Ed;u4Z4}djL zPY?^-R!-k3*g^ZwnVbc%D4S8g8%i^gYt8nVs>9Q`XwazSVH>9Zc8#-%(W0 zhA~%J`8>7PRORU^`A2H%H(+#zt}Eh*0e?^0GA}W26)cKJWWmY_ zM2)7z-J%+WlOR-;##mNc>BZPL37TG>5}a534YAzZ;#5g`>(xR99*rr`oe{z*`W7U> z_v=NzrphJZ{3m^SNg}snjGucz1q5)j77cxA?ipV&~eIMx`k?pt7my z%e9JMsaF56>YMi(?4qY_$ufJbw4F}%Df=_;s8`0Wo^K=x*Eqq$JGsa5p1+ovs`vMY==Pb`8HENZp(gSUYh;*+}N3(z*(hw-K-94^!7r83vpv^G&K<` zZ?up^PaWe~|JfSuO@k$+vDB+Hun8X*m!B(H-z@w81?CJjv>s@w{Vw(J;l1k@0^JGX z79;wSliW3U$WufX5uVj~YduSfpHVUVlwLBHEa@025RB`=4$BWtxGj=|EklCR>sI8N zhuhc>D;B+1Igw}7{NBawGbi{#l{XPb-?ujo@%g7w)H9ZlumI4|s}`-kz!gPb&og}< z4o|P1W2EHUmZ$0#?%-+!_!R@fFYlU0t<3dYuP5&53~qtk`_^1>M_tL+(N0)QZab(6 zJZcL#cU9nE+#MzG({e_jBzF0^kP+m!OkT4xEkjqy=qgpp=M!80`1z#of6im->i z9+qzS#qCl5@F$r)tLznn`Fu5oGE-bbm*X_rNgt7w2}(My19^AKHdR;!2W_pdX@Ws& zw1jcM$!z1e%yiWm-i_=Il0CTZ;h?3_6d?M`Y5)f4o^d9*_|-wl>M#)s!urJRe<$5G zq5uERw?Gi00m9ub>6V{RfazkrbphS~LW-L)pyBt4{cvm(@P>$t$+_X?Jz_xN+0P6k+qz{F3qk<30Nj-#ZX#Vwi^LE{htZk`wCw#o&$ z(L%oA7-?YTQvSTt5JQ!kx~^==@O^U`?(4V;3lE*$LHk)Uq*~_wbNxgwee}8&Qrd~Y zEnbVMw^O6QPdEN(LU>tS=2)ErBnfyO?0tunKBm1Up*_YG1Pt#hN76?wsWE##W7cLX zm_3u%l-21p(R~+LW}mJw7I~?nOlyjMqpk+4<%ldnN8kouN|1k6Lp5wp7mz4S#Gc+} zRkl@XYO!8ySlr-(J+mkVY`3t;O=V%CP)|sE-my7?gad_~x!)EOr;fEanCtC%P7?I$ z@2*#q8QXKWGVwr1k29AKWzHPnhfd6cJ29UcA*}`2n4{4i)nn%v-eK=$a$YseN?lF% zs#!7gb5RNz@5`nk2BuphmFh;mNsy*83Iaw8?(YIb5SS|65bR9qVbICAG{%wK%Q%Q# zv|8OSZKZnBTYRS!*__$UbYzdu%B&1D*6HKqpOc~2E$cQYylq2NZPgR>Um`oYExzV3 zPKO@hCd8%dSd_n<_y?X$3EJ`ZxNoyF0HXWK--m*yMF(=itvjsH5=>lea*?U2SqGk) z?Yo7CohD9R*+zX6Oxik7F9Qi-0X%yFD6Pp~M;1|OK?r6Go! z6Mg9H^tmMN;K+Q{K>}skKe*4RDtM!c-tZwoE`HI zgFh@pFB_zbak~E>qP{sg@^0xmwryJz+qRR5ZBK05wrx(FNhZle6Wg}U4!(Y#d++=G z(f#YSx>w`$sa;jO_Niic-9m$-MsD_%5;%7>kR1XAXIoDY+6;t6&tjL}kGJJQw~aP# z?PT5|;#&~%r>-feEs?@c93i{z(qJecHXF4UzJz_ciZad>ny_UWGMTQcFi8-(S}enO z^g&vy>izOwx(=P;A~xORH{90dJzIT=D^vgZLSq2Hk&|50@$5-3W}Q;o?#^#M%1=T3 zM^?tXJn@Z+TkFyR=+k>sBN0m@I%|A!U!^*;fTgDXjOzq2l%88lyN>FDeUC2N8q4{= zi>Vwd0#v%4@LFxYsIPugQF3-xSw0z8Sn)0+I*9 zko3K6Q7fqu{7*Ar@8DB76?=wQ&DI44kjMhV#k7O#vG;qMzOPrjAhq;MxA%@=U4&8@ zZw0<_Wz%j%Lp{1}?ptDG-kg5>oMcknNG-A}%9^q_R{e4Pxv4@UQIWY?z?7;~`8iQ! zTIhF2{`_gK`13>%5Uc#$kdb5Yp^4pc{7;aH{r`0QkSZs9>*-_uPaP5=uf>JDy{?AL z_$BL?C#Zy)LTF{DX;Cbez$$*i9=>cOd#cLU0af)e zLq+2WyxBf&dtFN5GdU9r*@Q-Ss^-LOlbvE>*Z!(+cNubHX~wI(%pIcvU?gg{@P zcTUV`9~ck>=BX6-)s5uou5h(2%n3h$B<3p_IQ`)hbS4t=$~fLTZw(keAed8Co@$Cx zd(;z%M=gCQLQF-#62^}=%e@1JlD-)+94??`hQLC_QL-oF06DT$W#_ZzRh$3cyI}v` z94!%xX}AX;hPbhy-eob1$h}pbym>wyYn#dve@jSPLtB#GBN15_fFL<*IhG3RH_wjt z(4}w~4gl1p?e0l)^B60MJF^Jc*ze_l=Cn{m&*oc8!oeqgqwC6|+hLR z#Ct<43)=L%f*kUk3=O)?a@9+9w7n5y&ZM}$bcq<7Oyp4;$b;gPr^>3u!2 zo&mY+mE1Xh?=2yS^?-Fp>9{5oG^=9)&IQ3lOr+dXsvz1pe6JHqa;HA|^z7hQ;AUj8p@3aQuL(bVpt-5e-<3!gwH z1!lr+FTok-u2<`g*gx8e6ifmt|qyAR9Nr@od(C zm6Fh|F7fux4-7^FQI!CCn<%GqckEaYN-k{VkB*qg(Li7 z|EPJBnue|G%bKg>S46Pc=%sfLcR#zCt{bDSYAM$+sEzqLGPTr#F{bD!fWz)`<%)~4 zv$rMrMkJrIUz)+>$H%Et1*BbE=csfvWFD`$k+43eu~hUDgLk16L(}o9pF51OQ1UnL zg>_m64n9ibtIKW9kQjao;r=FlGT~q$mv)d$9lci}pwGDJA$zxPRky1m&3^z|4y=UQ zn~;fvT#y$n>!r;_asG%U+noY!@kZT@v#TJTYQq+v*v>pR5!9m3tzrS3OJCd7zn1RT?MuLt zrvf8+TSfetUm1k6H>2&yKjqMeK=4z4XUmAOYsW90vno3)&;UV+`M2&yLKBX~KLjy5 zwZ88LzvI*ZCK&4os+k#*zCNL6o3I3fWKKUao$?!|ThG}SRRQH8*TKbtaUN0Ovc=E} zU>QgITnX~FR;T>3O%Q={F8ZOP#0dCTv+%+zp zZ`8y^!=PX94Qdv}hG- zUdhQlvp6^C>K;`PAL&->;9GB=tvi#Mnp)@`b_3}`cSVd@>{=H@W(#dkHA;R>admz6 z%9rK!$6yKFbiB_i4ukI93dc}{6?WrV$6^Ov z9Tputrm^`h=_2MM%NeH)neM9BtO zZ8U)Yr8N5ErwUjCE@yO%-4BsD=FeXW5K`I{c>)!&!7KMD{(br7iNPOTV=wNVuvS>P zT;G**F^l~x;0+@}AMp=Ur(*(osodlGhY2A+U`j47^y;kyYT@A#dQ=%^Ui8f=F0aR~S47myUl=7fFVIeCP_5Q1BT-g2>{ zvai$RJL2pA#K5n)n^1*w$>VmhfhBmHU4VKb)qKE%-hM10-F=bl8+zx-mQsR8ytHDw z`egt{NOHVFW1!4w_6Z@3yt{o&ooZ3yl<#I$;06g)^v*IsrcNp5POF0f@L?-gxn4G*S2KllaMt}{7i`|P`2dDWBzpI-5;t|?&*NA9pns- zK-#;m`kgF3%FZ&(GLprpRiCiACfZY6aaf$2-9x# z&p-JKVZzy(^0O@8uC}>KCTYb*OI{}>2RaWil6AEGS z;Fyq<&?kXmWdAK;D-!9$a)AAW}*1k?9HTe;J-Jp(rhxHVsr+C>&>;4X9c88Lh z6H0pbSjC@B5tR-wMWCwL5CYk#M*drhi{B(0t*)$%*Atdh0seYeNBV9H+n*5A8`eTD zdm-ue{158no26>+zxNp?h196?an_)rVNZVlJY7NSOH|4ks3=6I}tf6 zXeh5A2`+XkKEumCD*xQ1x(KlOy-ZnTjd$foO!`4KYhqaTTGnc}vL&x&`CHLoKFHFr zbkESR%;xFkoJmIPTGDDeM%@t^X%%auCG1S#qi-zL4u_6k8TrC&FlACK{zpASDG9ZV zmCPl(vkN^IYXqbQ>sYU7a5_m4vU()Er)@-A(;0Ouy9cg46ymZXHYL1E%FpUJ0VRhb z9v|8zZ2Ac3O5h>Xt0qQv%kMV>!I`cik4-N3SlKReFz;&-=fXI#+o1q>FbCc zYv{Jh*Bl#nsU6(p8XzL-9#I%nL6iYg0AHRWyy)~n$H%7D$t&2~NQ_*SRY{6lTLS47 zVlQEm*Mi+V8uG!Qumpva1zmGPL)=0QrTy@GgC@>i4K|I(tXT~@ECcCn&j~NUKjCkT zJG1;C2ZlLlK0P3`l|v4F$K5SW3CF7CEu`-1Asz=-UdAW@aJV|^yn}RNgTr~Dd@Nv%Sb-@o9-3+{f1=ne(aTE2Gr_wHOa`A6 zWtTEkxhExy<_FsHM0|TuZE6*2Q zad62kI~LEOeka|Wj-SN8Ibb-1v>eD?G?;eDIX_|0QMkRB3;nSY^;~9SlfbR*U|n)L z%jmi9#@@h%;(Ml%KFwLb>)nGlok&}mWuGuIDa=;wG|_@2JuA4@9d@Qq2gwCE-Pk9q z94VLBl-RWOseI3fW0*{+NjkJ)oh&4}E>*LX-qGXRlHnrJPf|Flay{})oR6bc;~K`R zz$78QCZIN*9Aj6dB>=w*T++Gfu*4UsW$?Q)-zRipuzQeE>}eDq`ueLwJ@TAn! z-KNsrlI!;6!xI*@hvXv9-LWoq{}G09Ho4%VQOkvGIxnzqqwRT}vT*S|$%4UrD0$bK z;U~~cUzA#3Os{pv2+oy+4H}cUG%3^GVS&K&o#P#H*MM`&_^g$O?QQz6f6%({WBs>)nenrOmmtjJ=@n#G(mDGXOmBZ<^u z1xHJsEB6lufdvUW)sOyZs*IN9;7TW733id8#Ip8OJOzCKslUWCr#CEg?nSH`PdLAo zs$9L^9m?~Uy(YAg%J{smU$Dz;!S7%m1N*B9S!(QXKgZqglj`CkNyE3oy=2*J}R{v@-etiCyG4cTRynG>N^ac4#9-XDz> zF2}v^lu=7y)I2?Yn6`$znhg|8&r!_~=$lbS|VCs`?1;ZSB}Nage?r-Ey- zmP$ShH25v6T)K^VNe3_V2r9}Q0)KXBQfc(`;@!SDdm8M^##AujBW)l&mha9r6OT2N z)1i&}9ol~vfqa6b@=Dgy1c{L{Pn&4kA*>wnD!Yfn^z2LNo8cnNw7uPg1>q{@4q|;2 zlz6G%-z_}%POiCQDyTLd@zCh}j5WWPa=x3j+BzI=^CWE8(vFo-g}qpt7@YQAX={Q4 z#Ly?lZmX3cE>HWquBSJ@Eva5Cxt_ei7>a?P1!^nM+MdD1{q9^EJt|xDWc|DHqKDb? zHj=9?yC+^a+fzdXNRI3A_94Y;i4Isc<-hxxu@+D@bh~F%jZ~hd!r} zp>xf1&zs(cR**vAP53nMNj^$-87N5XC07AI~0@ z&r4{Y(^4n^qfEY%RLmT-*yl;srDD2j9sZ5y?1XY~I&*lazB*(g8wrVl&Ku2rx#txY zSp!nc=LFT3pJZ3s8X_VW>gmOF=~#;`ZT(93(0JzeXuXkBw529vJFlfZs&vWq7J?Z- z0IO`W>ZFj90atEj05?|GAnYO^7ujWpop8@(GuN|6i+99{M`=5^r&$O8NqlKWf+_l4 zpmqJjDmm|OfVPrEE@o%0uJll~C=O-ghLWcvqOPuR_7D1YEJ|@p3S6Eg7@ni>#O(B_ zTozf35e8CAX|Z_RBw#~lN*LFld)FqF8tv{VU(k|al4bf>am*Jzo z?O5#Iw!1^JpV7fbSckUhiY)@bQQv4%c~P%-%HSbOrdsbm~iF z>q{&KQ;d44>} zTr#%jUVVSsM6_yjYXD?G0-o+K22x60)O@NGq{5m?0fbC^>DM&=CfYp9g6;k_IIb+7 ztio`ZM>Ew%D-Prh4PGZ9yO#SzgXbL~3@|A>+X-XK-{um0u|kC+4uVfBIEfdE1h@`( z?+OG9vb3?7h_Aj7ZjC&7gD$fLHD2tDgfg0$hk;W@fja<1i0$Vc`_)nOXDkZj@?%ER z$IT&@rtDbzS=scyYtzeKZ#@7VEx$Rb8kl#avIXWhyUIw|LlB96=kNWACaU2Ca@{2O zE{WPy0%DRxG8-#OpRAhO8aU@7xPW2~^q58tS)WI{ zfL>5c+~Z{D3)5C>1S-}M+RjcIc66I-2n-}5-q>{Wk@$i^#)#c=QQq}92=vv}CiluX zJHIkqj=I3Zujb%pe`xeE(f-StD&7YHPS10v_Vgh=mpyMY9on+_wx<0_NrEnHx3#)d z#T02@bR=r|{do@0fhG)iw&abNe2|C)kW~p^YARlkL{^3sY;_Z2|ImKOR~|)RbTq{n z1<9ZL9E$T;bidGCBw4=^53oX?} z_P)C>nC~DMbbbTd%UxCU{D^C+$Te(4QH*cOntlZl+7kI6IO>-OS&g30LV=nbqx=rm z#j7F(Cu&Q#`-IX@E)pyioLCNmcez{C1}gbmkNn1c9%cNhDY2fO0EO^Rn^B$xsJb9x z4LN}u+(fO>W_g_5#?ScZEX%8(=s+Tf@iGNkoob}FLx_h#FkkSd%)g5vh=;H#i0$VRuqQ_hB*bBpA}fPrb@0Foh7xx80V1xr+k}lGZ@ln zrb1a@mb@fFM8?b}7>b!mpLudL(Ql)5;Tp8 z=d1P0URPTeUJy`M{)UZR$@0ox7>qWfzD!O;BD%_OZY=t!OXlN_xWsW&P#?yGuU8-! z4ynR1dkKTEg?@U;Uz=M+RE6pw&uC!)afegJMrsgd$+}m#(%r)5*BPVwYC?B}+4-(_Y!Z=GmCG$psf? z)$!>%{!ZhJ8_vMn-6o%>l_?>qEp8gVfzgMSsTqO1ReXz9V`fo{K&WKm60$ml53ad8 zEXRy2%E`qEL<^?vM4h-#1F9povOv*JwsN(>gq{vB zgGBL>e>~mKxU?s_loksl(QIx$5Q$hJVru7@1IUEDz>yFjLj=1B7q5$?(#%S`0*#FV zt?2tT`P{OU?)PsEFMWk2QV{%*!E6c?a9_9EegtsmzR%w(5_6JdF{I7Wx*S*ukjSWt zEyM^GuA@Q74uk(|Utw|bM~#bf$*3nwJ7xp8y>vd)S(ypD3 zv^atX1nfv$AVELja$X=&hrOnwg6jhPfNz>p0Q32TgbvA|tVpx)0#A7WWJ5Wnqh8;R zk+Vre);GH%Zinr9Px>yu`+CsY^%w_j) zkNM1H@Q6PY?zg-}M^oPwSY(#*=+k$r6y98x+aqAygzvzoIpNB-otuZ|19?kgo6YDo zf~Mk`@r=e4Sp{1d%)rRKh(=de2Xo5JQu3fa<5BW{RIwvB~#}E)w{Q(vq%?)!ixFg;~egofLl8H7^CALX_ z#AX5vYT%*rrDGMy^@~4Aq{jLk$%|4t9gdcf!`mE98``-y8**mH2*`nQSf&KwCQATI zGhPf#l>nZpW)eewnVFB1DT zHhveMKbvZ_Kl+UUGwFHI_N>OoN7Es!E3zS0U{^K#rE*vTK-om%t1w^tP{ zGlu&)8yQ`9enSC}(N5q>+$$5)72M@F7FR7c0!|Z{h;;RZdcZ~mS^tJ1Vuy*>N(`+S zR8a=TT~82?92eG8+2lKrFsy35?VHhJnPkG#bgxQ&(1W&p>@#-U6L8nJun0`YyBLrz zH4%6N)B7FzSQH`{h+`Bn*T7wO6c%yluKIcG*{Fxd+4bd-pcxrbUZA66B@Q4u6h5Iy zms2PO^J7s7B4uL6{VL0p$cFqMR~bHLTJLl%CD0fKP3(@ET8qJ0UCbK*2NN2p&+0lT<0&3gR z4x=J6_sS5!r{GM>*rX*pq8Pu_6~rQdL024uM}8f{`aVfbCdc$I;r=N?b^5Q5MUC$Vo=ln+$|{zKi>4fzQ2VXUd#IT zC~n4|c9rg?L-;ZaV@e*wB^gOtcwWj&l0usBaOGe+%?!o@N^@+4d#IDtI**U<6haw; z6}qjOz3-AO|En(bqktc-@W&0ZLM2xkB2BiyQEZvRhqZ~dgejC%;KmC0C)+dm zym-9Aou~OCv!KG^dC?K+yZT*WM|pf!Iz8cg^L37jw9kU-f+)$~k?nSSBlH(OT@by# z)fe8l8va1f+MmE;;1QOhE)tFmbSPSI=np20F-QGiPO> zl`<`=ZFjJm6GGq4_<)zsE* z+K{Q+y27u&guf>qeK@rBsY~4l;Z+-Y+zlk(UvoS4j!jHS4kvg|jH(E^4p~rNjv(-e zx+_}D?T^Uy{T8{*F8pXZt9U9{+T$hL?fHUTV&L|}Kbxl-lw8%frRk>kFOi(j9}JXt za0nnYr_cuLI=v!t$70uzBYTQW(v{6BNoN$~LbN|jh2HS&{_U)b3rRktzu-VFF_s8o z$#n*c0RMaoH9nOhN-A)~(m*9=J;#xq*JmsxRQt^>?TSb^ISCzbfiQ{KuW1U|!f5P_0{O%8Ap(2PYUbC%K$7$jeEJYe33XvWlZm$%N&QS)=5tY*lGV{gA8$VF1 zpTks+8Z17fu?}uS@mJqZIKfu5-cDpq)4sBf?DPli`jZg}&L~{vLwZ7&h~RN)m7D8{ zT)(UwDGR}(<2FKF2}oG{h8G+8Q+-QzVk6fSy@(Vf8D0c;h*-?FW?p)z zqbfw&W!sTT$4l9e-Uvm8_iD=~XJ@>j_z|H_IU(p&v)LP|XKY6O>Zfu9-wkLvoiVL| z-EZp%xd-FyGux;OZrb$G%&D3u1$mHL$FtEv&Hm`AinTcw>S#K!@~1JG3tp8pG$aV>6FZRtU(&>aN6P6M5o`J%kOu3Q zh$SM!nG^my_(Ok>RX9y}T>9u7)=Z05OKWI2&74N~MtLXJLNSxMD;y6A9jRuFac~+n z*$-=;a%WWJT_2WDLkM~uq$N(9P3fDRMbl~{2x)<%c=x-p73dj}SEhXg#f67J|C_`T z{Bn}0eeqU}X!hXfJyKvO$1+&uPeR^b}N`1Bi{u3_+y zo!KuLTMkGg$^Q`fE&7V?NRj&GvE^Az0FSb9O~~o4evP%%dl1nBx75HuxDISTt@^CR zfp`fg@!U}2ys$V}F{=G5Jk7To_=Bjj0N{-NP0cb+fyMb z6}l3Lv+~({hFa*cjD2z%pBCC`II3*c7;y%K_`}JkU~NcR)B3FCJcrl_VS1l7K<_r^EmR*IxBZ^Eq>2#|p+>c+)y_ z==CRR!`CXHGp8=D+8l;EL^ynhY6AL^?)HrV#&+KfM(8P1fm9P&0<;IuAC$E}k*?f# zHAK4VQ;RQ9v$-)@X46zBBEVH0`!sh44#=e1QFMh73}bqWk*~B>k*Ne zPe{)S{Nux!X($gdMh=tOCS6Q8#Ecs71Kz<`7e^bOG{f zx_1u^aXRYN{UoW++fpG!=AH{&=PIRSzjh$046!$uMWIe$W916{=-~WBSXN2Ab2QhU zHS&%-5_(YvT}M=8utu9pB!-{Dw+oDZuCpj1x-`hv0UZjOXQEEcNW4@efO9H^b$tKD zb9U4e=OEggQY}@}n9v#h{og$HO}#cov&DIL)d`sgu$;-!w}4`Du_iv zgYlKX9T9ZFZwFWCUA3KoLbV9if&U)(rxy1I6L#n83MSn9rg4TI}&$$lp*e2i4w3Dx$X17k!_Pu?~LY-^VtP0ZGO0{}fS z@Ex5%!)t3O2JSx8zQ3C`9m=5}FKc_8=OP zv42P)Ub4ktVJ9SJO*!QH?0E6F0J0NQLjCI!rR)7^!`$m^I0!?=&kb;3M=;tWj0b5r z+N9CnFY+=`NHR%ebBzC%*ho--Qwmhsx2KlG{M$YsP!*YIhw?#pmn8N01gvZ|u>b^(ZWm!Aq#s!j`pxeo$C}>X;Lqsyh|kjmEHOx$$?d*qigBW967xs}sebokn{cr?k4G;4koukav@W)DsReRe0M7mYL$k5Uz z=_sA?>7>{^RqotIp~v2<5Hh-a#MTriQhT_vTOzRX@m3)RO^Epr;)xvEZ&&7|c-L*7 zr4~7PLGAQ=P^2!g2B?zZ9bM*0shIu8Ud%QS{qcU0(qU)4lRvr z`5kF7Z;_BJ=!foW?fB4`w`OBvnq-aN9lNX$EXmM$8}`7fM#LTyh)e8MSUQi~efu_p z&S6F+wvU(I`Omfiaj6YB=RNsQwI+}md3G$%(1t2NEs{Ne~CFZa-xEbujwh1 z{y?JPuG(1+ww|d7ix$@I2feQ9+UF@y=8d!cWTWSE!5ssal~zMyO`84Ob>kYu z-px>jV_)o&>suBkPZBC`@VVn_J=so4Mlp7z6~dsTKQfzJBv2ji97m#|a62hA@* zY>7GLb#P#!*T4V0@_mR+J=aDjq=d=F9XFnJ4KUqAH)aV^!qmCZK z>}ZGZ#$^=1CWey0Q2{T3zOE1UROsU5KLGNB}ne3_z z;`A%oaWX>*ne%eJG3=85I!rkaEh8SeZU*MrZAt6}4Bj?4J_qUrSPyn4NjdgSJ1wQlFr#0Y41)Q_R!W&j3* z*@9yI&ibh4T~MY52B~e)pVR~=+PW`YoI*moLEhSpD!e2+Hu28)*`q3W=BsC zJZvr^UpR$Rxn)^wvnAxa$`PaGe0H;OkpKAPx#xi1V0y-er^nJxTup-cmMYPUv3W3k zP^@1Y;uApSh#NY1_%7GPLdGDw%=f~JTz#4!z5=L1`VQF=CwiRa=9f9j51dG!ROMr} zgN8GP&UXz zlatYT&3qYZZu2nDs))Nn%)#LDlAMQujIUco2kB}mKSK}!{C4ZOg%6z2=9KPd{Qmq6 zfc@c=(7j5d*Xp}clb^8DKX^15EMT%K)KD@sWwNbDm^yFIfEJ^&slON z%A3WbS^Ia$^*j4QiAeBB7Y`3Dq1@F=zC@jX@Q%`EBG2cs@+1GS2eEY^n0zLME{R}%h1qG~C!+viW z#|t67XGxdcpJSDC7!(-y!G)Tp!?>*x6NeYH8BDU95t1S-Y+Zvpv?)51p)Uh5?JH>y zR?ZQ^^Kdy1LgVcN9TXc6ZJKD|g#5f%awlIO~nH9^myc=`oxc^~K1FhI? z{wP6*!l06Y(^r#=oAe^35BZbS5W z>R7^qOH?jjRViPk&8+&Ju)Md{8yzv9znevA*@moiXkfrCJ<7v*!DE_1;H=(;2ne;y z7hCvR3yBW9%Yhpq9!+9gA=uY57f5P8#*@Lba#>lH7lyX&wO`nYPcD-kQ z4!?b0BY@PJC)(|=5K#Z}WV>^*ML2&newhAo+*NED@nf>Y0+w<)JlThC`c3@pT=Z%k zc8PH?*uKr&mkIJ1tR*(tRBS9uD{g9$fSOj*4toxur`kBB%-ziax9jr_B027QgGn43 z=o2k4GFnE#UvC(|%7 z2j?P0qD*1Vm053CU|0T!Gp%nbM|Ph$q2>Myz!q?EQN-o!peGCk2~8fW^55tL zND;izgfaZO_x-+CGXhjBS}Yo1g3wk(9tu@SXO95nqPAqlw|McM?C`tvo79?YI1bUB zV^Mrt6B{?xy>@F=v4IL8g9Fv2g|z%@oqv~I?4MxDMLvLpjrY&3k&)Nq>QL(64IZqk zoV0k#)syK=c>{Oe?OZ=dxlhm7im#Rw4=FfdrL5rl?D0{B(=x!I`w4&88*;8G8ML)4 z5odqJe#choxYk8SE`9}0pMj%bzoU>~Ja7JZsXW>BS=EMT)a`j|6490Y1<|WkO4LSf z)y9jP)$0K|xA|@mET!C0&a(8(=16{f!hE{CG)jc)YMJjn9xfT}%cl#(Za>7^+mtBc zHGnkVQ;L$`W-QbPCC({~;nw3x-oZsrWEtD|TBq|Fh5^saR6wiSJU;HBw`DYFMo7nP0tpNDB)yRp}ta^0XmGTHpNhfQT`(!YDq@?DQNG zEQkbm-chH&>zsq(>0TfG-?wA({a1T6E}qhXo0}0>Zp{kcmo*-;j1!=5yGiFGc(Ql- z^vz1BNbHQlxrNF6suhkhAW8O$W7Tdn^AGPcb&tT+;&nx|;y7T$>I6?}wo=j7)Au7I zk1MTHO_bZl%#H-qpvqd=i297~tegWxsSQgLu>XFz!5*&%Y9NNL56v!qmM z_pRpJAdkj?wiD)JmAyKLUp(j8D}q$86}#wC8QRzR*O;4^+x8kGRt%J?a+;RrZ->LStS>b+bDg4!hienG>Qj^DfYSKB5Ag}Y-Hi_7 zhZMUB$r2U$|0@{(W7j}A42BxNDHyag)`bN2uLC0xnI=_bSI|Rv;P%8ObT%Lz@;dIu z`j^zwBY@cj?)rEfD$dAp`hX{vB*Vl(zh!CRP-T)ocuIS+Zw70;KAz_x%zb%ol(u=N zG+BoGy`9vOhNl6NktpvkYW{4Ria}9E*#iTotZ1md5u!allZzW!lxik91K+l@0+Y## zXXlK`zRuCOrYHC6o|HV>pC>f#H_(edQl>p!LVG{WU8v#vtPlHZ)W$x>>0i2$<8Q{r zlLkOOL|$kzWG%2JI(&s)XQr2#^8O5D!Hx8tl@f&O_b@bOS(;hc4WsIxdt&@>&jBhee1l)?Y5Sc)EUwV@vdJ1(} zqfz+4^Cz85@Pt)rLq)}%$7|O6qQj7#_vD*$O9Li&p0FMancyF zc4}GqX~PuvuU;B??YDIQ(LMjS;`85&Qxa(?G+006z$${%kwH$7A1eyaSiT1@?z$Gq zz`6o)lN|tB{py2_kvtlMNnJIQkDL&`(0^knr$7u4q5t9&6zhs*z!9`~PD@2m7jwLQ zDoGi}@5A{;e{Z)40NZUz`S}c1n&>~K#TrACK2Fgq#D$NJ5``y&8Y?iYM1f|W%^KF+ zr`}jvF$`3A%a>ySMc$X+U=f4%dwkRnV+`^z&?ovhLw?FwK5J0^0h;i?5(jJ|8=u6T zSto|e49OR(L?giJjj@`w@13B()3oV=M{d}>QffYPQ5(tbXL+@8us!L3z;UZ4xYaI7 ze;Y|r{Esbo1xis!5%m&esOv8)bFmkJ#}1E9r%UV7DmQ|W|58~0Ty|hmm3@mGhDDX{ad~j5 zpO!gB8=H9KIhD_HjlD|ovuqvv?@9&3N0HPQY>C+W;Nt7k(;SfK5_`gYA67MZX_vLL zTu4$76F8%uf!l>AHSycgzVa*uUEgfDo3O_k@ZoYAnTMv;xraKJn~HeOmNdH7)N_2j z0f0jQ_{KVexj55EsrgDvqPmvPte@I<91)AoK(OdOr)$&?sr#bedSmLkb8Z55sAtOY z_JV$*arQQa50pOZk~iA2;paP&WRm<$zrPmvy`60SftMTe5&oeh`X zO|A?hzN(4!fB4XkD>3YC3VArsIwprF@l{>2_jSp+AxNUopAFyN#zL_XaM!&52sHqV zUo{zaNs3qq@OhCtD%bHLT4K$!!>-6lCGXXhpB;C1sqtYdv}rrPh9c$zvkP9o2Xv+1$Wl8uz-~5fgh=M_MeH> z9=$l7fwXast4tzbYl3g79{ZtiYXQU~^8#r(^X5R5csaB>mXWlip6(04U4*pehGSr` zvo%$E{-gNAI7Rg8Cj${(4+8ECui#-jaYDIzR40}=c}SlagPW+GTwjey-*1v3=?3QH z6OdwGch%!kB1$|C&Wf^fgnX(0fem+w^onEsfPZhzkAAZK7l0eT{}+RWf?6Vf!fks3 zd+evjVOkl(wtD!a!yp;->Jzeu@;dLE25Zcf@jd~3i-lH_&j!D%9LFSix~BD;y@2uW zHZww7EN#>Ex)qDR|BtS(4vYHv!Ua(f>26TEyHfz= z3}wNZY)x=8^6r&mm=<2J&jtIpzAzBh{ux45L5%$+ne4=!_|1B@!Iy@9PW}sjV#*bZ zyef*f>MwZaLydfCLL_&c4M-uo45MB41A~lbX#o1^Fgz6>yB_s=?Zy3VyRz^<>x1OK zYRu8^Py08MiEiV*hM@m%Q2p8SMt)`Y((=KFy85sBm4+njp__=$tG9-s=vEI2|a#I(IaXpa*0jX8x zO*zopo9*jhB7})A*~jnRnjRoV*g+DsRdAd~^Hq|S&m3Yn9jT&cUrRl&UF!wfd>n;! ztf-JBRv4L-Ubn;!TEx3ZczV3VG?VxfKXk1+OeYBmnTj7wkmzAJ@`*J?o(13K z8l?AQyaXjv?@tdrR(XxlmrF}KsaSn7@UYjH>3+vEN?(-(>Q%vk)q@iCJ4oGIvbgCz zBUCbNBZDfaQ1t=`M`4n0rZC3JEI4MSp?MO#fS{9DVieI73|Ls@dOqkRBizX28 zGkfuKV_4hy`Pk`zWIq5gZO5Ap3~KT8=I_h@=p{zGYDA?7a>W9nda$wD%RIYv?h@do z5~nq1HHshZ=Sevm9*jL31W|hCzqEUpW?5?4m1;|K;Bj02(bFtDhv%3Oo@-eJ)yxi0 z@dB5ODA-Z5_#{p+>yTv_ht%26H(_do4XZn@k*He~I-a`L&8lVb5-((Guo99(wrAzo zli#yYvHKjSiWb5o#;?73ie%r^{v>yc3BH)P?ql@yB&#~h_zU3PSRbpHN;?FPn?t(9 zq~Xf0F<$=NWdYe^pr5RG`l_hGFZj!t@j5#c5>G^`0d7KcF5+U||JLt|OfAB>wTACe ztJ~@h_s%20W+JV(u&UmZ2S1V2ug=Z(SI_2)=%72kDpF@vH>0UYdWH6uBs58H03&0} zde|E8R zZ>o2dYWVD?*qT_&o@Xc9_xpJJT`CvTxeD8+^v%?__wS~DtUhg)Kizv9zjs9_!{~++cs!jZ3ok^|Ev98&q5-n?CtmRy>bW%+nf~ z76@A^$~C$$qoo%ps-A?mjDX zI|kW}H#`E_)Ku2=#6`~tl4oLK+%FpmTt8046o{ij>el~M%S!ZDBbq;7vL#ji5V;Y( z!Gs&~g^_rEpOTzU*0}uZ8g^->;qNQFrjDanrS!i zD@x*q?Facp;G(g|!upT-(xvy!&r|S=dsQr=)HSqeN-?n`u}s9uMpfUHRE@ds;ay&m z3s{etu=!L*)U#%;<@F3CvsqXa~@T-4WRbPYLV zUGruv`Xopf$7?FtYmZMHDNn9otQKEV~Sia?9wD4w(3h{eI)_^=&UtcCM z&}H(|!np_SVXgpz%?~W53#Fa|0`m1 zv#O)AB|gPr?NM1mH)b}c5l2P}C{^Z2id1dn#VLtFm}LgLXndE5S3_HP=m9)2YfQd?13%YjoaINdc7A|r#xhF` zL3vuwqL`Y(G5iY97hv-Mqobtq>8WL4b?{6u2BXq5?hMp7G9lPGANC}A#o^bRiN~hS zzvb5AvmWh)X*@F|`RH}W(w3Ahzgo&~%jasNly9#lrkeJuGiV&)OZU|8bLCB7XyTZt^`zaJsuke%O`_}LJp_&a=%#f zv`tM_Dp&DvWGgsF3Af27HmPQky$8O1hHP^#K9TEL5rk4qujiLC!nsy0H8ZJV6CsH5 zMX*;_e=zN}bSiHY)E-|n*3=s5uq@n}e4PyJtF}Xgu*f4WAnduXENf|8m?9u~r6|^& zpTZmc;@$~2&VVqsrbMCKdfaFGMO~P1aSb~vtPGodxsn=sOg#6-1%4lR^E3`yZanE* z3hwi`+$z3RBum2?HK(_Zp7jT!IZF(0dZz#i;fn+>&ap_mNqvWK{ zCX~XXwo!9&RufKGe+?FAN#%^W2g#7|s*MU&m)%?uHvMRX(Kp`KKfZH+=IeF;T$1ZzA^V0=ZHUzilywK>MZm4H*raTxHJc;9g5cE1-dWB?%aAZ5CJ z9{tk>#)GA##fJ>JySks5WcqxCn)R&nz#VdRhcugwGr}&1yXgRt{$^@SEOi26sW;-3048ym~)UL zkH;Icw<^vGzOF$-6<+tW6XzV76H8Y#2Qq0}thjEh$ypg(`t&pTJ;1rPvqd;@+M8sen7a3jSEzdGJot*UT3KLOcg|dOIt2yj>jj3F-n)9l+bnU1Czhc_|Elwv8 z8*5s}Kj$blWY!D2joR2@fGh>Ek z3HiM{A1<^J{tHH!X?6lt`uFE?B%=b%orT~1p7<>H{M>AP(jsj>t|)ln_{|F5aCik8 zJc3qmnR;c2mxj16aYkMXU)}lXkKg%0k%c{*cGe!ZMvWRBzd~Ci zk;#45kwmx`f&U7=dkx-GsPekUPHyaG-dB(hxN=r5Z{I^jxISaBq8upkB>4!ABSCvO zCMU^~LM6GV!~98#1>qn{>&wNh(f$IP#!y3oU_V0mFqcPkaW+FKgl5J<*RB+1w@^fo zne>oi=n6Y`{Pa2g`_beI(QJTvk^-0eRxF-gY9`G5%`VVaCR5qgH)yg)sb)6ngDjYsER1+IQDlf&QJ}&e(^4Gq?4JKo|-8H->m6)#O!)Kcx&*%Z*Mt(ayK_ z>l;(Qc9K|8CcG7l9K9M1yT3(&nUUkFLX#&C&t|k^cGUTU``$;b=Ppw&zJThGp6gee zE8o9`yS^~@Y(yGg&G8)l2AtE<8D=NK%``8|4nlj4odek|mzt)@KQ6vuNHVgHU)$D@ z^_HaJ)!FuUYMgDPNos^C)4N=@$Fwp^>)n!h$e48J(lMXcoYSY1_Vd9^~lQV_OF?F1c5 zTAYGCdM^rRGk*wPEvNmyxnYFpJl=SPb+6O0FO|$FRe|$Ik8JBFB9b~LQ=;?Yw$dj{ zyzNT9y#35p#uxDl1Fk6{a?wgaG_}R#L9Gv#U zOa-S=DZLmso1?D-U{+TV?z)^288g`Yx|84(m-v1Nhka@b6kE54LxVyrc-RQfB19R* z+kTziMvqOwj*IG$`I+0s>o8;LtigzCUhf>ko#UVdlGjv)!nG+%$N!N*YxK7sMUl58 z7hmU>BuDQCJFJ~>SGi}-6yX-iWvxvVDP{6oICSw2NDi*84Vm+q#drbBFmtM{jL{r>P-Z5fqobq!I=B7I!Hm+AHK&R`qzA+oo$Rg5Lk(pM2@ML| zxHEgb3nptl*Men(5MnPiDlzwTDTk+t#s)_a3PHpxJsQls>@5_$Bh^LYg59649*zh2 z7o7MT%yco$bbi5Sut*p(^zl|3LG?l+f(X`MVd3?Jt)Z*6!7I~df-gLo4G7*}kDqSz zSJL-@99;7czmqjIuR6Zhj*WPG78U|x3<*Tw#l$A2-Sz|!@qq5u@|J8fZG1+r~(#2l|;a@z{RS;>h zgcm_DsX;+$LCb!Z7$?@Q((Bb{v+~_alj5PvQLpfRhuq)qGMSKb;`~U3$r#|lX*k6w zc7N^oCaZ1BnzItgmxmwsPcHO3BLYJNxz?ZI;djVn0>qb+@%L+It!EBgZS8v;W-tX& z8&MIx0^g|-HZKbDqZ-#x94VrU4E}z?-|xmUJhO-X{Tm&oHNvFvwALSKcaUdnT&+3p zb~eg)j@v=Jl6yxn)@~Z>Mn}>$a*jRconGkHoL;AZ=N+z|Jk;Jl!T#CX(x5C9evuz6 zFk7FT8ZM<(lo`%fhFshKT#0;7`Q+_7KR%~=nuMTGmNqB*SBrWoIKBh_McXgyAVck& z2=!!7dPk22N6+XN9xVH=TBl1jvr3;(U}1y@yx5_GLQtSyphC{}y; zH^K6qhv2#NuX=tYaR)J`%}T%RLh6X70I>`|fq-7if%8mdG$`IHCm!S9$J*`yRi!der-fhuL?xayZ0BF#6SP8D2{n=#>kO^J; zc9?(Yb0nPa{E`|n4tI!2;Xw{Re;?l6vDfb!_t&%;5SqM3C~HoF2vJg=aEp2a`I*GC z0StL$-`<06u2!k z0H#@hV>kjB02IU(?C)Idf72Hqv?z!vRXO`%61kG*H#)O58tuoDmf|3U!;Ra3* z26kW6DSKQ!hZhgb6!o+jd+wSMqjbW3>7MD%FTCb_?5`LA1M!#lY81Gclm^WEPM)3^ z8A#2*k=jf`LLMHO!2wBCfl9v0d7>i!Kn9M? zE`HuZ6hCg~fw=l}Ep z$cr_qZ9G~CwKshyzqS??M9-v4Hs6Z=8^PnPf5OBw0>bXv`G5wZ3^EQR5q_Qyytu;6 zFOW2-4?OS#GFFIC{uU%k%3!SzL0fX!(?=;p9|2s#%Gt{K1SRU3gCeh?)eb=VRJWG;_Wd$$`c~wPJZscqZY<*?uclGI8BwirzUn*0-QTf@tzY=Y5ct`|< zW$E3kEjjxvXpHe^gs^gjQhzm9y)%EAH3pevCUF_kBFvqYP=Q1eu&A&l1mvMA{HXC& zh!vX5?n3zm?0DGRxQLX96^?)0h1(EY6|vui)hMu}*0wRk<&Hj8rKc{tG_T)5kdOLL z*ThMHL@NzuR_~A6uo2G-VP10HDfD;Px*?(v&PZ@##}8T8b>iWKc0DKSda)A_bng0! z@Qz9lz_VX{JJC4Z8x_W}&`5?{^aoBJn0e*cah?c^8{~BLr-|0PAfmSGq%4jrPVQL2 z>sDWaVDag(@RqlWFj!SYer59!Rkt!SY+aoKzR0~D9xBj>5v4fRROSIzibyI>ATO>z z*~I#@pAnjrZ3+{SOi#M-I~*wn0vfgX&!%%kHZ0>;ZH?umyJ#&*ZPJovrmVEQw&!Yy zY_PFNEB-5i>Ww&?O9Ge(&;M<={uh`3vZ%DLFNwVPb{x1J8U?iZmV=x~$Lar=S34A$ zi1&F%_ML6NqdX%bq^bXSJiNV9tve|O-Jjp}Z}b8VkpKMS??->W^k4DN-$y~-d8{Dz z{l8!R8iNC_aDQ#~!5H1vB6nvQdF;U}@i8@yuU$=C(zfpIuPi9e|LAR4#B-5=+iakR zw7GQkpl{gDQdj$3EBuI2eTlq_4~yt3Grlm|C}AHKL;~<{Xd@NpSCF_Q}Qi@{rS(sYX8$o zjUTA;j5vo5#VCwF82R(HMBP8>SPU-I93MBb0BCz%y{<_}=JxygjMc-%+F(D>?g9mc=PaYgra(@Yg4BUuF-J{@&E{e>P%s za;I+olH8<1Fmn>e;aKWzVZhlz%mm}?pEgh&{Qf5mgxtN*Em%8WT@ zHbP-1|7W_Cf7;XQ`~RKBarU3F{+LvBoS0lmGIz1d9J!rk@-yX;D|YYLK+njL6OB0=w-T)5{yB7XG9I6Ivzt&j(9ON>4_}7_@6ALu|_}gD^kFWV3v5P;y%ls$x z{r8#IOaC(oDGpW*mCUs{CIVE{_9*izG238kdawvmY10;?>H)H>ZEFB^{2}vbXT9Zn zcsKEIWEl?>s*MC860)9m?1J7nZayUdefs$Nqn@DI!?a&^=+FBnR>lgg+5q#UD^#YVK~kRVv}&)^(2!o7A!TpY z%=FuzNicqnFa8?3KLlK`Z{?C?(oFE@YqEc>P4S()w*Aw`H2KvotJN&i`zLI2OCARh zQ$b71%ldeOZvoVuFbB_@yF_y-vE{U#e3BUGfqVE%6T7yB9JoEtN<{<)T3x@bE)(!C z_NJ;x%s%5va}}ePs?1ND5;2g`c7MzbEdC(BSw})PHHw^m_2T74syZ?b;D$mu>CT?# zJ$tm+%R>b8fr}50U*ODct$f~S!WhuIpm_!JBb({gGYXVk+aJ1uFl$cp*%>}+Fq0w9+7VsCa4-d5~ z|MIBgWInqW!@hjN&DXY>(RAFI1FI@9D<#B6?WIq^aaL#vGy{@fkMR=w6a|?hG9y;f zySE11s+Fie#nI773Mo{*uCSh!nBT_-(3SUO5X)>^Y^E{9oF|v(?>9v{@#&62Ald0bb<-dB#T6$hvW8ePq( zdFt*g1Akn9b=0Q}Vp@`$H*|vnxTd&IN>($ss$^Q(rzc;;zlRD)X1n=dx%g=a?>r+p zOnW;--r|R&RnNY*Turomkx?Xr6x*C^y%yt$;J;KqRdv6E%rEVBd|hUtf`CYs1~7`N zJLqcvoNNQpOftt7y*x5rG?ES0T@pK!6}jU+D1K$BrX5pa4+}N2hoe-Vo9cap7rJmq z*5bw;9D!l?bS+C|=eR}IVn&40J`=!EpD?*xo^J?107m{eIlY>>HpC#PclWS$qBtBa z0qE6~%-n05obIW^@f~S|Efe}-Rc^bt;w_KK-e1R}FCZtb?8TjID?#tJYss%7xLm`^ z$6)0>HuLRlJAJ4%6tJ>m=-LP$tMVe-)3pQ!M}NZVzo>Q>W9YeQTjyXe3EssTuiDf- zCi^{w;3&8MuW$CFQnmF=PAq69;AgrjIXWRtN_*qMUBNZl=??FnD&uzSoXvzM ztUEJB-vU~jOiL4`Hi}L7xN&?s(;hf8XrO5_VsPQ&WkF$IJ8J5%gZ9rk+s@p{biW9` z8B}l1CFd~-14bNeihreZ=~5J`*e7X{8+xc%If4cE@=ig9Jtk1dIAU)65(gLH{o&&e z4qix;2m%8~X18BkT0@Hs|G@0}*gqL_?KN%8iY1pcU0@PQWtzTZOPcUtrxAo*hEz2Li6US#^PDQi8~0@$@Gu&qfn zX&smPj1v7Ks;HmjrZ_5>NgJt(IczDy^oy5SkCrxnE^km`0@E!sGkn{_(oX(SD^Yj% z=i?|7GFpNLn#bI$z;l&f-Ge-Xee(A#Z+N)&9HA|L&3i_6dyp&4o7_InH#XPYbF&f; zQL^kLk@`KX)*yVcugsFYGSgp+p+dV> zVcY$LW*O%OaWPP|jS)}H;>!6~hTOoOWNWC_ukr#1EEvx?Hx^OB5A;v zW(Hjw_d=AVogMFoy7&P(xk0PFT+1wfRiNimsnxmW{+7e1kW^)I*Gx@WI;~|GETbx*ReM|-ShyH|X${dl^lPj>qqggR6 zsZ3gG2wn_&OuEKF#-NrzK{(+nw5)9@WEdcH>gLy3s-flg+XCaaFqEU6SAqkNa-v_Y z&Nz)SX z$$dr@g&twBhv@SrQZzU1S%L7~p4)=F-Uw4UYUVT92A=-xa%#kKuN}#|uNjyse=aOA z)I*58^i1vo=r4_QDL%c>ci~i6PUi8{Cq_cU<5W28%t8?ja&|3bhz&V8I^YNU`)ubo zH*6$pHEfi`jd~KxNjWcr%nzis^dX5I*7LB8HG;5W-Uey9V?0z}E1coJvAL^j3+ps{ zM58rBqWzXLI`8~lx`pa|m)-i`=>n@{y5(QZEk*~}=Wf-zqq>%lC`_Svc{dxBfyu(7 zktRv&$aQB5O+Wg|fx@m24_`9XH3RG@MVmD(Jij4X)e*#s_AU)y-WU(eS$EzikC zB531woX?slGo2PEwE;ygxU4MvDv6(ND=>7=)sz>Q;Zh6?E`ztPO$cm+alQ%73A-Hr z;5Fg$H0MT_0wih;9^)zo3fbjyq=zN;dlX?aEB3x6&?51UKFkws&tTg;e%+!@YWmXzq)n~t9PD|#ZjacQ?}aB`Pgb~! zD`5fH1xRdp8k3EqMldjq7Iac!aB9I47!@)1b8%sob`To@3A~xnv;7-P97gz$ag9A`)b&I z!+Gpu!xpzCIDDx#Z|=d7+5&5*Ik>y0*?2U{JWe!TSZ)QQNNVcXKE1Repk(#Cvz(1! zKO7sA&S(9}ts58ad9OL4&bB~8BGPzTsi752g^vf2BkpDuy8Us0>mOFz12l$1w!D8nU;a6Vr%s?NGrCD%h zixbwKzSRZoeU%hvYh5~e-!>(Y{6bgpwCs1TdlX_C*}eHKNdDrtIfp&v|Dq8VR=@Rv zT5onD)T{@^!?tKEdQUDGYvwxx${mZDS`|3t(>3FrOq^ezEVEk_y-mE>33f4>yn?uXAjE7qu!!0`SJmOaA%`5fBK zbtGqv&xKrIRgPHs8t>H7Vb<89Iwa@Sy&OM1J>D1zlv4F8ggr_MAzVk51F?6eFN*@Jx2uMnVLoDzhk#QpN-D{Q1K69lbSJ5%@h3{>Pebi2JgfS zcL>af1c;rR|ME8Pt?*<>A%%bx*p6TM31~^Ht+8`x9)_=eVN91)ZaV+rsC$|q9Gzzh zk(_~t$reF)VA4YN0+DDwRr1`N=^+-Pt}cQSCl-#Vj@xLvPy?%_ zF4`>8a+Se6Du^&>pWvs0CU(YZ7u5E0we7@IOQpW=xPbw0f8q491kPuB976w2-XVWD6S`y~o2XA(iI}a0ix-ee?Sz?he z$h1&>LIS-n05GbttfVgnBt#6|j!4&U=x^WDEYITW72vSWCYta&!+VxpWPA`x%a2DO zyP`>00%A$DH-qa0P~+aXmos&x2<3jlqd-3hTi{m|InE1<(sD9^T)#Un!m~eoB(v+!E7EjU9O{;DgP5Ht>`gR)Vl#^hgLB zWv&KCltU~ta(p9*CHJ(?+n2quwM+USASb&1?tk(jQiJqIU!DtrPu7;2vhZ-T7ag?e zrc=iYD3&L&ghL2$@I-)EkAi?kgdO0^BNF6*dOycKBFLCMu5P9Eu5Z6#QTDtnhTd=Y zb$(n+XXvT*1D22D77TrtSAFGS5q8&3P-!Fa_ahyUh&2Be^YIV)JteoQ2Pn+NCy~0v zOaphn&p}y!&5;GfTq;_A{oj>w^B;CLO0DqhQYR#Ddb!-!dut9dB=hJ*%|CN_FvPMc z_-O8WYlYBx9GuXOP;wa^E{{x4-$pzG@cH(mv?qJ?+jliV<_4BIQ3Zhy#z_@he*7O` z`|kNYx8wpFi}sAV?_wc`)K5WjKJN+NBL_=UXz>j9YrA@kZGu)EGhqrBzxssljlhb8 zV*m%e9}T~4Hf!6H5fMB8iGb@t93lxhm-cmXsWI@uq%h8FJ6~m?o{H5Ih)e}old@Eu z_z=HTp&lOE{(yZEHaxo5;H~Tj8586OO`9ie`l*jxy7l=Wh-^+mWZsJ%`gp%S&2wC{ z5tbO7mduVSgxQf!FDk!0Tx+xAKqIOcZq%N>t2>_7dIr^CJJ&1UrkHfuXfS%RKMkph zay;rmY3THy&JSgsS~JYU+rFNP)@y&#IkJPy# z<(_SkjD`rb+>_o)*){>1T|HuPX-^Z}^{oxso$VN}W_aU`b^{bz|D&^-(uh4(kgXw3?vX!h2Do4&@hi+JdyU z<+)to%Uk%i$#?zF-5%3Wl4lze!$_=1_m4lEEe=l%NfWsZb`M=BYVLw}8;MVKg_d3$m62ovp>?SLIDuu}>oDj9IsDKLywWO$nZ=kq zDm?gT?r86wxz}cN1bV3<7fEu9mVuKU=E!Y|Q|9#${K{uyX_v3WzbDU)XG-8A!!;e{ zd@WN?>LP~1-Hfkuzu;_G?YMouy9thg^Win{^Nj_ulx;C7(==DWp85HOXF8CtWlp*_ zjlr)zvFO>?0~Hqx|#<%;djnIGK4Hy8OV=IXP;oX&1WMJTwTO_LSf#L)t%c+EYRKzcUi zgbw_<*V%TYm~7NdUk(Y2h0~n*zeT!Kh%=kwDETXF?@~RW$)F%W0iX%N4zBA=zqEt2)-p7=mCk$QWH4_kXfF z%1f68Ue8`7JAe|fRU!2?2u#cG zXCrHi=yQiB+6lY9GvwNeiS-5)f&7Y+KXK{NJ2_?|M6F26j~RdZ(E2s1w-paCAw*Ck z^|i5{94u`*Z*)IQtnZ42vLN_~NxGTiN$gu2uP`J%+1ppt%4pN=WQ)Y-`+?0etGXxO zU6sk~E&yBCt}&$=am(WUs!eGNq&c|^$8PthjJH2~GYGkpKX_8-SW9wD-tn@Qr>UvS zE>?brr##R)G#p++c0Jhnyh|W9&=X6#t9yO2jg+MJfp?EFxg9sxLY{80yrd%nV|myG zaj$W5=!+MOXsXD~B3;oCH}!swVUH9oYwHAfYqg%9xkXusxpPOLV6K$a@~A@4?#`8o zIuxd?wna%?kygUkrEYX-tH2%l`7_K+CNOEBr$vggw9qXel|tn-^WM_dK1G;+F@qXgf zyxh;TI6*E}%6ZAA02<-MFw$ixu@g+OWWzqFc#Qt|0+7Eqd;hHyq{h^?ceXmB!v2kY zMNc!KvsWkKX3!)+AxYoVY5C;bmI*xe$OROb3nFI(O)qsj51!&Wr=Pc@g>p<$ho zwxyqUtrWWifEd)Op96HVD2Iwnft$SEMJZ8{0>>A3=H6FWt_KzC@ncQ^FB%%`f|I)# zQSV9REc3jb9~0K9qM{>!|JHU+tMpy##~09FI}dfG9euHuq`>RTgw1`9Qj4+w3L_$2 zo!epfLb0wA@hH_u89RPNb?#9>g4bU;uOC~5Wz^n$ z;!<1Lu`1lT;Dk)qgh&^UODzy!E;>-<-*JxBZQ-RSTYsS?>Bu#@La0q!(eMN{3V3*? zOPc%9yU>8Bv_l&H zov9ohYoFGXwL30FS7)pkBaVH9(K&2VpfQvrGEUnmI=|VjmL4Bpw&j~$d!>sQ&B)%y z^|JE!Qx7^Y!h<3kWEmQb`nfPNwvp{CAuz&ALihnr9tDksX}vy*{S1b)i)rtuVF4j& zFxX#sXl~y@_b$C0{jw-Z!)pZM?+IzpdxdsmgVNf8iBy#zvF2w<1wG#3)n}QEg$vY0 zXq%LC&rG9Rz=_MxZ*W zz6mnxP1Sn8a|Cn!ln-Mi3=fM~@PtG7ezt(-!S zofw-Ei-T!^I!<71{fn2bArYFe<=!YuYpma2jg8c$xeAFbOUp_Bm>1sD4HbkVB$mQP zQh6Kh%sD;_b2F``z`pB5bAiXb((Pr0w}hx7sQ>J0Vj*ED2O21?Q4|(RX3(W$fQyY5 zfxa*;2;p61GC=?x^2ebgj5Y~1f~qM@fb~3u3E#Us0|VqVVJJUEW%&z_;=E$foa4Se zf~!hSLVB`3ILtf4{ir8#^40Ps6gFhB=HBiFM2v9Dn#m-J_GCCc@QSr2+Di=+V+LJ+ zy2h85Q+2I6aNl!IegYD@hgkqCaboa?Rs|0VsoPMvY&s2F*VOckU3*g5brdqpxG%!O z#zM&6=`@NdGdho-JARyc8@$^|6H2I?yr?5KxJ!8t;!^zfnUd#1kzREC%s028sO7E> zar{k84wLBKBWeLzc2`IdWSu#Pu(qS2EjmGFx&Zj;Rzt8q7pylI@oeez`#5C703yk! zs1|lX64K+SAoYBTqO*)9ySs#JG!FrcdjUp@7Bjl$SaZ2SFUPMv`K+>M--_LKi0HAQ__>e;bar9`JHj>8 zSF#^%jNwj*VlGpi9-j_qes5*{Zn~iS<5?idGA}wo+KQvna+bX!m zy!*iW*K?R7@V;LIROIW%K#1RoXWkFr7tI~7tGDw?P{R(jdYUut3O7zW9;o~n!`ob` zpf5HfKt&k8-&e(lTWBcN9ZC%`xv}tVCR(=B+TLfYq(^vayJGQ8;w%d+32frKM0YO^ z(qXDosw#MH=7z!4f){Wvb;tu8zs8uBUg?3%V9=Q6H)mWPSyO!!Dl?#|7LKz!ecuN$9(9oov^;jTto2=+#6_<|o3VsEfu@qSyoW7D5HT zz|FnX=m`Aqy+D6ubpP(P%Ml+HJGIq&((}HKekYU6&=qa5WzWE@JK1Otj#6D-L#dz{ zuj}lkNWUSTBc$(Kh$PH=0zW#Y3WJP}DnDZ{Yrvx9wtEMZRa`3Vc*acjfVIs#-`Clm zusv)NB_WPz97!N$w$Hxrd!R__<~2u7b+@Gj5?B#bK_`wZ63jl@-d4Y~0oiRhON+CV z*wJ?hti_1V*PU(GQ3e(nnd0hebe!>>l)J}nB^Llpk1RGqY{(7^$r!Ac$5_vOY@M-g%8FHp-1@l3oYBTgc(Www8KRdQ>HbvJ$ve)lD&gAW?H z_dB)Jo_K9dq5`6JPY)j4xRARS)s>9}DLYgsOerpV+kT-b(9{wE1lgpi*^)2^k+7S; znpSFWkKR4ZVs{DJx`gl%rmQx_*3~@B@0ssPJ(4p!B9#VA$cM~M?q4hF%sCuVSw35j zPgyK`Bw3F01B$pg?wEYSd;GwG>93C1NYy|0&sZDk$H(w!8VME&9 zhqP<4Hjon7UYfX@c?G@cf0v+$A;NRsBg1XEvlq;FnrszxUQDs{A zCw8;3N4Ls5TbLzffCC1!=snAs^Q%GXbQ8!DrRVzVVXvTuUR>#@|L^i6@Cv#^1#6J#Yx{guL zP}6jnAC&*P9$!~rMyu@U$%Xkiz`Xm z72EnyN4Rw43E5Wxx&WMMADgCR7wR2AWn%g@8sB#)43T?(j>wX)H{e}Rew?l@%8nA8 z8^Qq98Q|+$wlzj8lAy$*t3GaXSc-?r=9XD|*z-XT4o+qhJSN-~47aEXp3?GkdNog1 z+REb=*1rY{2(T>eZGyeOg{-W;#EkRN1%|y7Wua~zL9mct^}{Ej8_(^xq}2EP zs<|DI9Is`scoS!*U;ur-rq`aCb>v>;;mB4$OkAA0M(6;ob#%C{wU_adfcSfRRr;Km z;6kImm`H7VBZ43OK?5eeQJ+;k#WdgTD-@w0Z?|uGeH+SI53X^!#{~&uJie8--l1Lz zO!oH{B6!%UNS+e&jzRv0Nxk`G?fI1z?2NVLEDw#EbM_Y3{=+qn8j9b5qUa)m9eD*t z$tMO53+R}l9~f`YVYEFOSiO52%r>A6as>oZ^NIr-UeTn%1&9bg(@|iztNbR}HxCC* zMWNTg2^^v4)x83@x(En8YU0@f$jtvw+5K+EB_AtmcHvwz#kZM_Z_i9Z-){DJqmbvdfwEd1xiHQ#vi4Y~iDOc_A4m^fbnZaGZQ@O!cdOb%sR+6_W_RdhxNe+iYYj6LhnKmVLGLAeWu9^9VZ^*5RVl(XFQo zESE)*PtWi0JhEu>r5}VN7Mf%t$*X(W(K8}L(#!WaQ~2iM(DaaKHf(PNF`$uJ^rBAF zQq2Ss603+%M!lzcWSc+2Lex*cX=Ue`HnGJP4i}t#!d|5omeN^Tt%y7R^e-&9g`> zguyy=!!+E}R+{dRB%CyZVOVb77-bHXp7E9dmt5c~lEO*9Ep0C%KYr>9pidhw)0tkJ zq;Ka$8uPuCTjj<=y#@bL_hZF<@Zttc?PJ3y(K-1GlsaR1BcTj4OTs&2gfJ%ms&!#v z`s^7IAUlL0u9k=YSO95Uw>)J zPF7rk0@MhF zDp0fiT9G9HVjpvulve>pS!?hdQdGX~!icLqJI{b`TDD!Oazko~lBTAi$uH%X>0v#Z zX}>6EBjh$f6bb`JFCgp;dAaP1umv4C_%EKIGw3L^*?4w_*4z+tfv>2&-?jHegnPFL zChq-Ldb@xgm;K{9trh{NsvoKx*?8C949q+8fL$a_^C9KK$E_FIw+B@gFsv|}j01Yv zc%PnKZ$@vJfMG3>?xTGCflqZ=lA6O^i7hY&aOQ~R zT;trHFr9<7wt-guy+PPZKKAptAhHW_Ugp+_f3|%Oj@S1EQ zjPda5Oo_|31rwS^8`_ekE2w9;$JL2d=lO1K;o;HbJcfaeZb)%rMZv`dV%Hv# zzL4O>_V%(mfB1(Z!c7Eha2Znyorx*KFv>c`Lz^op;+IWEzJUxrWc>Yr_1u;s4UVCY zX+K!mOK$Ty-spq?lJaMsKFZCWL)RFvc*U5XFydcDN*WvO14s@%T>18T9R_$$pWai) z4sCPtX?k(Hx$QM^KX5w4xJ`Dju$>TmQM|^cz-c5O_u$${*LSWV@UxPw54C`m7^bjB zru1mPU_NKv_HULir1Z#KS2x77h?)V`MD!P37G$8X(YwnDA!oG}f&jw%W<~#VJ zl0hR`*T;d=i?i{W5YTkWIc38xcy*#e1xpZa;r1AYZ&5;4-5nJYwz4EP&_d6~?;wE6 zw=$eOna{21)aZ3l4Ob1$Yf3&xBTyMqt^vv&&lmA*mbdFTkvZ_0mriXsM>qN2lG+A= zH|+eKt{qDr&15o|8AP&gvHr45<*0yH7L-$~Q(65$#veZ6aP+M-=V1jJs1)ITaioBd z5cf(Gomdq;r*xikU*HT6W);D&XAW-L_zHC`mikPITkPcp7zINxCY4@=jq?S{j+~?^ z?^_XHW5T(LmA#2-%PE-~MiI6F9_s|rU|E)Xx7rrM`2n9g)-;$?pxvDPGRY4wS z_~^PJH)|)ylK;qc2$p)YrZl)D)A`fw{TFT>v#hHZ(6gsTOC`men;GW$`)xCFGIXDl zpovxn!Vcwf*1W?BOMmHWE}Y6?ly zERFjb?er9{Z`$$H1dl8ukG^DGy@yh0VYIcL#@yAVEYHZ^jz_T|6C7hzlctmH=B~=@ z2Pq~|I2^g28_l8NNPjBzQ6M-205MvZ{9~mUE`|0PF;~C6B5`z zsyM~#5(2Pn(J_$KuET!`u^dMgD;o5hSsF8|GaC=2c*#QX zN?VJwT<#7@4rE2eA*Gq+mK~oMrB>M)H6exOcFYtVW8w3T^7S*>XmmNwO2wD;RnUt# zI!3+y7>K@X7HMpG-j}B-+y|cVdAIi9lAcfu>T^A=4hol{E-wX&E(`+la4Fc!F&5Hz zetj#Ao3~_~6A)kdCpLDQS=Hc>I7f)KCz0G~ONw}V zj@l_HdiF4=wRxm>|FApK*-bR*YKse*xNS7`vvK?Imu}R zM7wP)M?TlsE*Z|QjSf>XhZ=N5veB1jvvAD3o+X*Z6iIN!PN^n*oR9E$c2cjGGD>@8 zHEN#)j%7#1n6zNqVUkgJRF0TOXzQQTbi}=ezM+olo-Lkz0B&LUx9Mh@kXD z+-U6NDf@R#8488lhh7kIt=rpC>b>_=c-IeSyyw_?yUtr&D`dT(wQxGp7e7<_Eyv6Q zIX-MBONOkxDH(DM=(k3M)|002bQXEuwpvO7U!Ho*YM7aQ3nyo<2~=!%IK|iMQ5)nO z0zr&h4+YrZ?+UPK~=Ks}U`4 zdt(K5y!c5qbVl8E_QIwf99a$zjEXY+yfhT#3~Bf|#pZ@M)OAchn~#ZDc;==eRKP@K zmaGVDbUJ;b0cY6i;H(9R^30aLwK``q);#UjK-Wj$n_B$T_8~W7FONHBhK+w5xkTNZ~0CX<1#a9 znS4oJKpBfa(jSp*e~uh$whm;~TFDb9nx^X*=(1S-M=&}53MP-g+%6BZqAAhG79GQp z#u?!3Hd!pE)_dt6vH8k;2%2(}9^CztB46w?zhv*Xy@H$D6_=l%1!I+zR&S8W9^)%a7OrOU+dY#w<=D)|&ku9sxegneX`M*;*$f zYKlVJmPmUXzEc5Wco$`tD9%=#V$l&7=t>GaJ*cAElCzEjKE2h>B>nizWu!~vsQ?$E z9J5x?#WQko!uV46dw>H?h}>5-ieQ|vGXNv>5oR&COf&Wh?Biews;n6*K6cX2-Z(a^ zyWIK*d{Ab6L`QU_y3Z64j)7pGu*%&mpz5MHLtP84@dAFQ~s~NgBEq2}= z#0A4gPMvM(fy14$=d#x2l#M+HFy8OwM(lA{wpbMI!@t^Xo-l?TIDQ^%t>K>{ape>` zi~`$159mas7%s4Xy{WRmmmYUK?NN{hT_#{c>^ekzxq`jW#2vK1j`&FTf^HyZ4YGgC zh-hyjE(3^#70Gi7E7PIw>(WXVi%a%3=N^hB`4y$diRP1?iMu?M?sq+=vEKDSHOaOW zS&fRYhI51iVeQd%aZ;*!47Y~l`X3dF=@hKNP2|GIur zqtJ4p5tfiKAG{5h7LQ|=*)i(Rb-kBeG{VXRlvi!&Q2o3Qsn24xZANvQ@6jaNgpv1!N1Qu{H8ZnCuPJ z`-;q^F70=dSDz-%1c`%Ou+{)Z5C8Pn|3}zF7D)}8bTL0vyFUo5@sKm-6*Q#35Xd(_ zm~Wx?#g^2P9XH+f$CYW}s*m`>voMY4B^$mzCEI*1vnv&z$+u6=<%N3&t?CL&Pe9a1 zaXukEZ*x6pkbfw~&44-5QWJTcbETi;i^G8TL9!2wmiGQ1ilUzyHn|JH#D3}N&BRhBbD4X*4r9mvpgZy7%F@@4zu zD)HgYyh1xCo-~*IXtK6f?w_$4pBgiUVK{&)Z%kX*+E!LBlWk*b`9O3M3~!)0+XheS zo|cVPXyB{uZ3=WkQ2Rl%ls3#TIM89IDc@(PX>!R?75Vt`R!>Qop`YFd7kA%#F5NF7 zj2y`%Rza@iXy8|#ngh0T5j0svj{!aTpGH~Ch>-PAD7YTfj|yF%=f*y%75wzKqo6n5Le|qLW(hd+g((YOqbXe+nvy*cQydVUp?=z( z*_$aaemXC>!-iSK_E(*Gmp=3}Rx83=BT5#=++bM&5~lNE z@0R%4v8&N|7yQNrXjlV?ithNnK>bxuvNgWWJjCf^FOYcO@42Pz97I-Fvn%RUKEGhD z%;VSSt+qaP3^B1_MA-c7dD8Jrk}|PVNwoU%tqc;*0jaC|QI^Poa~uO)__p4#6^Djq z^_gNbxA0a*h`{SGR*}nFv5nDF8FA#QCaFl?HPMHX#NjfYB5n6r9`^LjLBt@bf}OY*eth#tR@m;8a9&5pSJZ2k6KcpQ>bvJ_)mM33BeHwRM?5xrhB+RrG*#>0AJw7C_)wne zc;-3Maj!g>ua6@1l1UCSGCc!BO)r+k&Mcu^4QkT~b@x?9n3!oE4-{dW7lW^S(dahH zqj+j0wQ)B-YFoFwJ2x^;=rRbJ*_JXh#B^rGedn3D)k8B?3pGy#nzmo=*8Cvx*bEWa z;CuR|qFW#hhQucJx-)J9b04!xYhr2&fUepR`C@-QKbT?nyQi;cY<*v`1tzn>x zd|$Uo)>tC$z1UGgk+l2$s=rY%i8j5qZ7w4Hn0;`oME87vc{SI zY0%n8+ec9K zF-mzWo(`_)PWA_7fj7yIvI7d=KF9Un9c^PUg}Ugv(HqtvK~yTVj&C3`V8RZbKEjl> z0Y07G6sZz5@rSMMn{1znVV@J<%0p?a4YjXK&==)dYJ48X9Tfk-es##b@bD>S&*#&y z&YEyB0uiCP?mdm4t`x!(c!z;i_ez1hUHh~Xe(X_2LeD(XL!@mVXI2eHLxq&5Cd0#p z$H77G1fl%`f*JD6oxy!0!uxAn(s)B?ush^1?MceIn zPPK6AJ0P7ZvZ=`b$?2=_l=sF<3o~uD@v?nwx zIDG3Yv%_kg6F&=F(s|$S2ZEu}j%}xoxYAOqQF0$g`p{C7;tkhH-be=lgf6Cq?4}K@ zvG*5-);1-H4%D?tIQH5Cr$o!BrltjtK0~e5le!x?AcVa{N_&D{AvnHFI06_)8RIr` z$k1r$p$ib?0`L9&Rc@I1ywQkT+c*1bY?>naRW|2WZ5=JXH50x!NSLWI@bDe8s++u# zMu2OGU%9-Yaw|9jFiyKK!uB9ydr6BV+;7>5p;lf1@$M!2miFEtbjo-Q8e&_!ntC-v z^js66rSLL=0*U8cOmdqrxN?lx$%-Fi1{vp+Rk4~Vctv=eN96^-X1@XR5B{6@~ZISw)sijDBZ*pLykmC zwM7T!+9IA0T=_+2@>LKWx^baoOIu}dkkuliU*{dY@&KpZmSPJbT~h2BV`Ftdhq%9igXVbEbTgVwc~G03g^R zcUwe-RnDp`Z?~q@@{yhnXC&E*sHx#s@#aM2io9lzj0x!Kw#gZYHr(S8OIJCsex%l) zS>MuQ(czREqo5RLSW?o%0-D54KF>Z3vO6jDuE{Yo=k;aT4$VW>L?_QWDuk0Q928)W zk)_d}btZ4}(@^KV#KElw!T8-s>e9bNdo%Rn15S>G4PuBkQI~F{a7?S=Oh+sBvw4Nx zjdJ*`9p~zKfA^~&I>`cRBBV>#8?8VkeJw4~D3r|oR_PaqZ&@H=MG(}zW~4!16NkSn z!878ltP-CMqL@v5DcBYzb4wujye4P-(b%h?963VME_G``%1EYgL}Kj5QR=DUllmrL z$6M!^@=hESLDpJm0%oH!C}%(cxEJzdM5FQKirpWT8j=w)<;q7ECACl15;%hLc^5eV zzI9fP1=&a{c#7uP9w*LX(WfIfdKLPrv^3(B+;1BXF{gw*!_ z4&xrx>!Cu^N%&Vog#3k7$Qs0ZP0chw#&WVIkJ$MdJuKe^(CeM|sgc7eWTAl6@EhIl z?1RtUiSTseHX#8DY}ogTF>C5Hn?Wfd*KeTbPW9IcrtnA25)?>5B>@h7M(YBwdaLg4 zVGlRec|@71=?i%bYDh@h2CEP6JRO59N}nK)o^f=)y6@aSK)-ZITuTU~i%Fz|tr#PF zM)Z6@lxqX*27_a?S3F@`0&VhkK>m`9F@S5^U5>sWT5U6c!)4du0^kX2w%&LF;q~T0I@0YN z_c;UoJf7 z$@F9>24w*DRhlcYm8%c0(vz#1SVnV>dDimsIR%duP!w~|kx4VToz&NTq<{7*f-f;B zF`&_(fbGcq3@&<9hXDh8ELZXJcQ2uKcB6#<(1RgZMneLpU1}z{WED0zG3}W$V%K|U zDWBN!iWR^61iQba2K*iD@0WvxbLk1db=Ic8ZTA1t13q~>=5GLs-~BJ7H3gl&1FpZ~ zu4u{ZFu##5ejOM*Sn9zs_oq(=cWhsQ`Rn*V!}l<_2}vdr}i~`SS@%S5c)3?y3l|bF*G~RmSON zGdu9iQQFj}&b-F%Ii$jQxtUrW66TPd+S>sFm_T#YR{-Z}V>RcnzHl zry^Z?L8nFXxtn`QB-k0O>wJ`XoHg@RgIztYDdTO}g%A0bi-iSUyxN}H{JnP&0%XfG zCSXQ6dl;@}i6u6F?#{OnpvFD7CUt?D8XRc}0HQC}rlueI8oa<7Ct4hx1zgX-X}r=q zoj9bqfN0efNC#R`HB0`B=Vp8*n7&Sj-moHpnE8royQBOK_4*^ zQrd(~#!JOLcAEuNFjnj|3-x^4@G zT1TTVr_=`y>M|`j))p$R>^)eH|M?k&|08sR1jEG6Is{#sP5_MI79%2o4&#TZm)-F~ z*A^C801LdTRroqFvdpHmcdkj6a1T*O`k*^OBO4olohKW}TpZX>7eJ})M zFIjL#%obW|T)Bct1a%h_N3*Rao!<^`M8YjJ?1&Tlc$CDORD^w~4rp8Y#_}ZrMyZ>(U%}=m;{GPm<-kKE<@PV)WX1}X(t?e zTwnCmIwjYAmgHJTU=_X&rgSEO%>tVAnpwfUJIo~H7=RWbrg0B45)dWk?`*03wv>P~kY<(~>z?1Hpe~?b_&x*`?sreER_etoCWIE)oEd-enzmsbos{Q3(n{Rch|^uJ!ZS=RKxEcdiLPQL(sx*YQBu z2~nkmXX4^@KzMtyG%!KCVk1)l+?YIOYfbD%!esWklo-cNc`k`o%}kt>H@PD_qzYrgTB7GLnE*HX$WbVLx{6iW zK9;BFJ(f|TfPAY;LkIVWgVxkkO?A0+b&)3A-E|-sG*lB1#bCkz5~UnAGx1~g5cEP; z($iu4x_D1V8A1^<1_1oboO(E!0#jYc~(k4i9Z~JiM9DehWNhPS5 zI_c9-ywGT#!2irpFL`4@%KFusM_gH1wna>x61JNS6MUHq69yO@f*FVv|KV{(N_{&y z$pwO8$KI$Jk8;(ZP6P9MZAP+$td5NSs?*x50NO5Wto4D-#;z|p)da}b*4EVEHW zkZ_$VSr?j>Xc|ghfp+2~M4zz&ASmMR&WcgH!L1~r+h}Z13-bAZo^3m6FYhaMA3~_v zD%$>u!)f8|PsfX&;=k$q(FD^JZ<+Hs0E+Z%EBSo%c7`61-nH8PAWC#|K@nau2$@7$0lWo#K1{%E%e@wPVa2Um=Ne8 zT7Z1x{eWx;Vw8`Mn2H2vy}{&<$$$XJ9-)_B_ExnQ6(z*$kcXm(5)9m&91b+n7fWQ@ z^yM~fQj2ZvsNORb+>-MspIZGGQV;K~SBfoRgIJ$uLL!8Q=H8yk?c!@5WIg&KBKG*p zU^@Qn!DY!{`RyPKei>0w6T59e*erZ=yR(pqPDex1NG@1OE~-{#bz)qAN@3#C9>6dl zk!M5o5plpHLq7TdYRb>P?Urr`i2Hg9B{6+;w_e5w>$&XhnbMo{iLOA(s>aZCxsN>^ zjd}7M)7He|(;zrz&+61O>mjI~8_gZ}LM_b)QNrSlhUe*SkO1k8jT8!;y8Aee!$+)- zO3!<^8J?^{hfai~pX{;uCm@KlWxK%k%_uyw-DOUOMHeU8qcIu6f9jq?ab;~>5ZL42 zriuEVDV(Ofbw#Rl1hOVg@)mO&M_ei`I9k@PgGJbyTaD!>KTnum{>{eC{gY?|p?h#j zyQ!cKIfsk#UPS-)VZ*vSAS@O^0umaG(45EmGJ~Vlkt11%&YH_z8`Tg1XKXm&_(gQt z6;-B>*A>=*o7?<@Wg6K)tUnR*XMScmq|V!@Q5!dv*=oCONgll262zn)3T#UY#>yu# z6o$yDYXKgqhjD%435mVv2;SCN^1Ct|oM)x;G~j5SsQ-Sc9qf0wt6w?)-^|BdC;0-V>`tn;lJMBt5#>Yi=&;o*RYiXvaDpXZ zRR)1YXZ7d=FhXFRIF1qz4rU$~aWGt@$ zKcjVi<`Zpa&LpyCDL*2_TDR0o>b%%qd2$G%*E%DLFUb&h?Zf5q!e8rk16VbGx~T9F znL`f0f#*bbWPLKH*d2~mu(}ZQ7$|Lab!+5RSdoL!-z$%ue9@zn`+nLKCfEtlkl5ST zG=IUCr-i@NUr(@nIZ!j=L+iNH8p&W=nBbC9nSGfT6%A%OT^L>AUdHW|NY!uk+ z3OSpVpAdj2*8dTs1XdOZ{>Ve5%@;;KPUse*sD&nz}R+R=2{l(J>O&ju$naD+-`p~XG)-`{x!oo!Be z9AO)bS71ED9D8(bGHvuNaGy+hv|=E_D+eMtSC_HM>+n<&V!s?lsA%O2`?WKGJHGNC zlnzS`qV}sVZ(Q3&`$}GQ<%l_7XdbOHZfV06Wj0839OH1;XM}t|<#JlvwUnV_T zkzWR4V?&3OBE;YtIqvh$$j*H{OBgj?7o{x&@Kj}m!=2)(5siLaGZ=YZk};5=P3`c= zC~MW=kw@cEFU~?4QYHvD7L4%;H8FZyZ3F8Ycq;k$OE^Am zOkgQn*Tv48;)N4O|Cpxjh~`Bji-xsw@n`A#1>h(v?enLfV=1MBJowZeyDE33SDc;` zD^9WP822C{f?$VmFJ$UmTz~nKMf0j&!3q>jaPYxY zGm0d2#xTsM%d}jeI+0c?rUP$l(JOUAOU!e0KThE%)Wa=~W}`Kvw*ayy#Q+$1{LgZV z9PZBo`F!7@5Qfm5^6#qm=aLdFdMWXbqx18&0Nw~?_Rn$u&kJjsKQYPQXEQpk`MY*s zhMiie<-OuYP~hLe#;UqxEGbgo9vF4_1Eswi2mIYAU7$yJ;Su1xiyRX!VY*V6%tv*k z=_LK@wEU2N$H=*hpx9=|*^-KKjvDdt#(M8|mzAsOB=IMwg16HCQ21FqyakHx+?z*N zFW+tj@7Ej*{f!U|j^e-u!u?*w1qWyS|H27PFn`V6f>cY>$*+(_u=|TY6EAAiZxE9S zr%BMM*aY+QBGEh5EZ#TxMCCt@#J@(^l$_DzS)AZj{{@X>60Z*we0s zKj^qWuI`$sK>SL>3=-`BcUC=*KuaMG`PPUp;t~_rbzTwcZZ)g?;#~~l-vQ%F1H(i< zD3)iYB%&&6#2r5Unj%StzkD;IOz%E`Yo&;z%P>kMfg6C~g)Jzaf&X>3Ov?Yhs?C~n_X?4MwMj&lW$+{<9M>tz2(;JOybo+JAbKspt`5)w} z1~^cOA3!zDi?RQfElG!=n={=pgq2+Lth_wi3@EWG_lxnjNq@<IDp+eIXhi_ z<$xNeC!1?}uxWUfaK3)`(vasDsLCzo|1}&bnAM0?#s7ijQUA5@t#-4)8+ zegoS!{ndhGlGJjq{q8QA&!CAS9lfn)kzXT>5&2)aAkfYP#NZ4F3-H*$({YlW-nyhu2K9vSf4VzmAO7 z{QI%&+Sk71+%NXXK25FREq_eQRwQUa)9JUJv4q-}zgA|S+Gz9!M@I;F+VT2R5C4GQ zkJJ2zRhgl1CB^N9X@WjsKVFk1RNAf3{1zqXKatkp<+K5XKC-%*FDql;ytMq*on(J8%J#2Lu#ky=Kc4 zC039op4@#Zm+fMPYoCDX!?k|Q+BNF91)Q;tK~Dq6*)nicu)?D{8hLH8Q>M`FowFO_ zoWUTe3-eGAD<5i&BQj4su?vvJG4eEi-?~DRav`-hMeM8SxihOAoVv+r>JmS$4%nUM z7XIwuf3|YVrSb(fsKDk~>o^an0Um@R4@zgg(|o%PR4QtE<`PQiKXW=rHEV452Zbtn z$tU%I(lIAYP>-FRwyo)8oNCP%y&VXlNqfHCOqIz!Yo*`IEgSyB!5@2k#W8{c?I7Xv z)7rae(na=ki(d}oAE`!*juO^`VORLH)r|d<%jeAh(We6Zm_i;Y?tr*b^_Qm&822Av zEU^P$2Njjl^%;LQ<@g-SW0~nigxj@)Ge7bAickdu7Xg*^~d?1KO&|e#uuDS-Sgc>wac7o z<$xa$Kg}pLcMtgMon|BA-+Dro?WW<4MAl6{4TiPenOL9rqW+^+Bk4#n3Vlj&MKl@T zkSDt1xdiyWOS56Pl1}s|H-8LYJLV*i?AoP~0(UIM)@wd`|MQ zNgaPwn06+OSDS-~YygfwmymA7th|reTZL8MoVCV-(!^fnAB`S%MX^8y;4MgWxi9Mo z$V}5Dj(-7%!HtxQga3*8FH37=W*%U7`x`qtR@>g^@ZPHz|5Cu@QcjF(JR{ zqyR?Av8BK9@Mc(%NX7ARf+a-OM&-43T{PkS?$_|Ww~9b>E&xL-jgfONv=9OtB+A1l z0{5D~}pT%)P$giTO4F*EUMa|<0cW)6;LR^?Ac zZR7>FRi_ukeqn1v-#T^t6rNni@8$B^K?hN(oiw-tLXsy>o~Xdo3$N;N3_9_Yj0In8 zz0H`hqjVJM8YRs_x5s?tX0Bs63^jaMT{j8Cs1Ir$*wg!I#&(^kgjx$?b|34_wWw6P zN7D7ZSZHHGOAOw5l} zhqv5svEFdCF>AZFheY!03U~YyCz7#S?r$iGG$yRbsr}wrhtaETn%9&Y64>YS!S7VN zd+l2xRa5#rE#r4AUcoC;h#=MqwkgLU;+q?WgM=}$yGdJjV+O0Ch&I0H#HVq z-^Cs*g73)SLU4|G8>*t6c_ZsqqoOpvV(X3-s0#;ljn-6Vg&)XWSYxkEefl?)vBhzo z{MRkmf{k5IF*75i#v_CWqlDB49=Q3c!GR=hW@nXj-r*zZ-i5fI(vTu{MiS*d4i~*f z?4CJY5_Z@IH)VMbfLrY(R`~dF4mL&?KH$DYf~x84rDICY1T}4lQLb(n8u^4Ib4nGS z54-5QvF8WCIwQGnJIutTu2b$k5sz3u{1XRO!O)I*r+#vhmCrJb z(dr2ac4zt`gtsO_vI-lD30uP1Rtp{~2yr(icUA_?tpX8TYju!JuS_?3)I%3qdE62m zqDBQV-qxd_u<%~Fr#!u94vMK&sHC1x?6Z%|c^gNwgieevOZ`JupkQIF z@2KrCl-H*~?6dedBVUOZhH#GQaSj`|-Zb?4}hH93%Ob{WkBX zM-j~v@Sh;;xQvOR^-)f%;;@XYKGno@x^=O7yrJlGsbI3si%fx!E3$q z3%3LzCi=jTybbNQ?53tE%p(>LVs&&OB^-F+Yu+xT>(1fdswgbvr^+idVMt9-Czsop zK#Oh`Sp=J6 z6q3tl8A)XUg*Sz5vT>+UO!235n?uy9Hv?%IH1F|d7xl_e;<=$+gtw663rB%;0J}Lr z&6V}_w}n%p7_X834)46%R-+rJ{k^nZ@UO%hFaC*L)6?0i>aojuqgt-cFElQTd6zJK z2?*tkqa;)3_>FvsTwsv=!Rf)wo0Ob9zYQ8h#Hk;2mIr$fj`v&ngqS=!G!Xq1gh}L9 zc^KH2kscP$Kej|t5r}_8O`^(58d;Yv2^~wUWs@xXlykwiYKA#!hd^M^m@MY8DrE9t zHSBm~Qs*MTaNLMMq{gUGiVi8uSL(LEM)iLs3{T?!O2;|InfTXh;oylTvE-sl=V9w` zFB3Lbb8Sogk!xb9KB0xhH?0%_Chzu<%XHer9*aeJx_2FQ_?I!fH?qN63iE z55K&nMjRQ=qen_kisgsG#i;96hQ$L{O8)j@XQMT zdv&4F?4gPjBkm2s4?$$Zu<54(k_AUMPDI&`eK)Squ2zQxmW4?T`0<)}I329XwZ!7X zpRE;*d_oJ}dQ0EdNEB%?xAfp*Ur#!JlF&LJ1-Zs05Y?}9D@V{8^HcqMLGVL|SG#=$ z-XEIbnHg!)*T^Yn^Ejn6=OB?KsyM2(6dMH9g!lb0u!WeU?5PR`!Vg|u`RwpC1|lDw3A@b#L}jgy<@+e}2LJBPur zXPUoZt#Un#Ko)r4Gnn$K=9PHD(arP8=o4gIn*GO+s@EbX&?9WjaHBkqWxtr=6huz= zbCSSg-n1Jhf9Me2Gtg;9Beh@f1*^7Z@|?xnrng@YazXt!e5xy_ldh(B*3~83xi9Xn zdcVAwa9Y@=Y`@ye<-OZ$FllzLz_Sb5b_OQAWqL(2uNUq{>%t*QClkKhJ{-gYhi;sL zu#)t^ue!%K1oYs>EZqKql_TQ#u%w-(sbtOH?)N4t)U!O=WB1a6N1Bz#Js)?k^NCQzh8Hvy$IWNCAgBnp+IKp?WBWMkU6GAB_lM}C&bF6~rs0WMFo#pQ$BgiR+aJ0i|_ zBK#pSc?=ciY`i2MlMEtkd8<=7&(%#_StSRCD7pJv3$dDLG?b)0jcAYo-TZGR4yY-9 z%zUwrP@twM`n*(+!^b0B+qxKjSjgUJ+juWsvT%i7oAwgp(1a|d>2-R2b$|?SXQb7x z_Gs=HG-CjQL!pkt)-5&zPm4jut{wLXnahdPJv3~h^6l{o~65UqXTbo@NF-$R&rEv zbBK4m<{TPpM6x-(UOB=R2|q>VMwuH4a@!%oB(YYm*e|>Tb+tH5nQB zP$WM;mF4kFTkCN^d}c-vzsP5L@_D7qf^P=F(BVkuH0^db5a}}2k8TRzy7flXmgnLbQ=&gnr;RN^4zMCK~ST6$IogR+%fYy*1Qd-ZTEHc^<~5yyOp(C{ILq z7r>=CV*NV8Dv3QS7gaTvaUL@+P4k>Ro+gspI3aq=j8`aA&o}48O(#nN{Vdi47b}bH zvEWdR!9?o!&{4Y{`?+U%9Dd740ym+0fKf&~CK+fmk6%=1NKLf8AX~PT3d>(=x9hmp zQ&V#NN4hfBa)`m`=vfo33(Ap8!`kYR%#^^j;sU1a5BJ)TM}a7VWyFN&^@DhF52$40 zM)J%r8V(lpB_J{Z)KTE$=CLrr* zpWw*7_Z`TQV#&FfAy|9e_*tW_u?8CZlJ$z$h3jR0U8_gugye`4ce>S6Qi0Nka2rsi z?+V8HJ>y5fICLC3RYUb{9KXx%J4elL54?3W-frzfoNXj;P#dOjr>Xdq7HtLUyp&{I zCV8WnHN<(471+__d=wRXmIRP>i7x70Y>3uYv4ym1f>7&SPStBl&-gQzF?`}3(k#!I zpDfuzh}OmvoHi@TJ2QypvLHj8>Z@-b={!u7Y@FSdzmyc%0)_bxv34T3LI|0Ruv}UU z0w-30y-TfalQyYk4#HmdX)NG!c0oY#US7Lhsh3{^Co-G^+&*`6a({5Z;XWtV`AzRdeK6t5=qxMu zwZ!$sHR8Tdck_ZwjzpoguF!<-Oa$>2V}10D`;p5xl+)ggJMph~r)+3_a>oY*na({=vrT)rg1xcoF8i(@XJ zaZD?ox$i17Vq)u*i^RXNh5Wa-`j6qGgTJt4WjsC=RKZuaD9N!c4qcd*Kja~>$9E4A zgRy$Qn`|Be88KDyZo@Y1rXokxe3&XIut7Egv;6CjU|~JAEA;P@fZ;VwDIO zt@~c#?|eA+YQt}7q3|&+-O$cFQBi$N$?%v>6A5^C@42c9-qiN9~~*vN6hs6GzyaaiWM*XYlMuez+0RM)n=lhqY{PP^P8N`1(IGH9E-DGP68 zst*et;wGqW*QXg489})TacHXheQJ5W3o=JXZvOl)6`wuA_yk7KMO$S`%}IpkUMMrR zaSmkShV>4))^}h8=@YehDzi4BCf=Vlv0zWKOain-8R{mj^WiQE?}6Bi${Nb}&wSoq zHvBRtA2P?HeC^^hr-X?O^{y%QLVFR2yh3j3xFgwa`YE#Ajnoj-bykH(Bq$GJUX~Ej zC`|NrEQlOs3j6cR6~v;6`|eXt=4upq354V~6*(87pXwvS-bva!p%Za>Ek&L-A^VrJ zVF)b97U?s#Gsn}Hnp1Jve+m*Nny|86t1F=xK1b%Qp&XSl7HRdI3c5F)OESQ#B{C=B z&RciAc6mttOnIMqdq!(C`=~a@gV2XG^O`V0PLexmgo~T5AupzLQ4t?RZ_%x=neO^# zRYCW)YmsZWLb1{0y+T=STEzEI z4>aKcKWN^MqYez!D}X*1I{8iMaM2R{IsZ^ZaXM*I7_(wHkTw3kD^Ip1V(rTVM-{-B zGPyOK&4wg}%ehI~+4D&^-M7z{Rci6WazE0-*w8#00H}?T4mCzw1#a(>B7KE6vxd4j^LgTx#lK^6VNd3)O=*&Jq6Q1hMl+ zmH8(l%$g!!0)g_LR0=fm4mQEDM%-aat^4*7ncbW;XMxaX7|@G4iLNV2#+O1ob=5-dvHCP6rCllct6QNMhD@63}LC1LVzRqU3-%9T!r0^zAP;|Bt=5jEbY_7KI@M2uXkh2@Vn5-6bR;1a}A?+}&Ydf(H-o?(XjH z5Zv8ehhZ3oxkH}!ob#Ub{rT>%d+%DO7mKd$>Z$IkUAwmL5|Q24B2{AOt*^uB|47iu zp%+Cbkc*A_b$Fb>?HsT6cf;%KVgjv@e)8VU!}6`~v@u?uBO|N8nFBfGaHC}rJ));j z6z0pIY%q8NI~oUjWR;n}n+=CYno&%Qp<)a0$G5ph*o*Aoy~udUi;ESPt`;YDNr*$@ z78unH2BX}Ly_oJ}>%3I<0lJF#1WESx9ar1UMA;kTd5t+#Z@lB_>{f_U+a%BKIgns za(Rlm{YTU@mncH}b?sC>*`Y6I;W&*^AKT4-XgoL1jGnBrZwbkFO{-z2ZzrX8Wc#v5 z%@WI@F||zTR+xHT9(^4hu{DlJoMW+J&({WE&7t(WEaBv%f&HL+N@!y>ezu+Vy>4rV6&rn$Un|V2nvypLp%47 zebsLI>P!}qA}5IZYs%O#Kksr33mLGt6fx`~+!Kh&7Q!xf`q5`h3PalI7({rLNTR@B zel03Wx5IFJu;*D24IZQJ-0gt3R!X2}Pj6OA(7w?&S(?JoB1tEUcVs2o+p4`4;GS~c zaFP|=&ddAK+3;s1D1xy@g-cLCTP)uDX(|DK5QzADk?-VlidgmjP<7#Yw;jRe!Ow=e zez^Ugl(}#Jl>sZqm`yjFx*(|%n1cNgrkM|b;usGoW7rE%% zPRA;LwZX9|87s;?127ljl>RKMGwdd`Dl{>>L?0jZvogg9qK}C%WZU18rw1qITxkhZ z>Yym2mld8CU-xm4Z(S!JR1UQ{Zr+w|YMBSxKH17czA6lyB*+z-4Yb$g+wtc=*;@<( zCuQWOM_eLo1~o_B9%|eNR>E$PW#FYYnBZ$*Bx}I&pO_i71cyh8%L%&&NiXSRHBv z78Pe4oQYt1BKABd3PE0TtOml3K?Zq@j0|6(<;}LRI^X%9K1S+(%nxWgdjfQ7$jP|n z{jx`el$8lsA^q1XhxC;U)U?(u41G^gk9FUzq3yPVrqcDb-cH}ud!Zrk$h{!av~_dc zy^G6^yiVFMIK@R8ufv{iHU_MBLT)*3nJuXtZPy5p-@#PcZjPG_D;QA~P)5_zYK>MFCNfMD&ClxE*|L_IC&1ttp z-@)fd2NlvL3aHuSyXm4gMhM*YPE9=pjxx(0n^9_MjV={yo9@@N-cpWI7?G;T23WX!37Ib4LocKl>u~LU>>oMqaqx_t$GT8*FGrSI;b_U+#>6(8K zRPIcR73eR=$0ppM)>)t+RflUSbX5K1Nw%|gH@H+JCUWn$uw0?&8@Q5(W~bif$@C?R zklunvZnMHgz)Z=dz+oR#VILQc>6|<|zo{@O z6?o3W)nI9!Xdf*VyX$a#+x*a>*y`^*Vs@1qd?FhsqCO&+n@~MAns9N}E5T_Y%|xM2vXx>dAaqkbXme5xg&b6>8 z@XBHo!kskkuWn09s?|AGLakK9@S*Xzu=Mc7UKH8BKlm_RGTrelo+HiC4;?mrEZD{3 zLvgtQxk?d%Bio!|tyfWDoLIc))Y~k_x6Um5EUvE8`%rh4f}OetfTE{7ERdU%)1`7Q z*(JOd7NvDTfx=G(DeBVq2%2HM_#r*bG^XR+jkj%*MLaX>EHd%@suWtENAt|-t7Rg| zEadm1EiiEAghkWuU2ffy+<@0$P%cV71lRW#i8v_^>&*@5U~7$C1rR8_4mf}IpwDVR zc3sNfg}x`U9tM(SeebA4gvrX^t{RL+>4i^GZ_OdZrjJ(9<7;9$qE{KwA&FlWXv&vN zn!02D1rgNRr%ZY~7aM_{Ky<>{PSlB*{#R2|2hbdtAjSR4YiFy=YDUfcy@tZo?*Zn$ ze0D8lutkrSRlSZ)q}qs3>?qB2uTSi#cq<}1jMs_P4T~$js0HCv*$#s7%8HGIB@8Ey zH!=^>*AxO13K#c{E@)EH`#sDw$gz_m%@jyG$UI<%4BZfpQADO&avI^MizrlyRNRa) zBA{2U)&w^9E9iiEue7T@k!|1flaBiN_g+=rzVTJ1S7pDCAk?v9ZzifUuR+OQFAY&- z^iXOkJId059f2nl=OF<|hrQfgN}Tg|1&K_}K0Qq6_$;Iw1ew@;z=zLc>0Z9tBtoWz z$KIz8wjWqdjy|fbOy8UGJoHw-5Kk0(7oHaUgg(tCRQIbs^PWQ62`9xhPg^#;R^M|hMeEC%)|X&aOL6(l2h{OEj0?&JKv96brcf%VcFz8 zr1GjprthUE=v`{l%kF=AVkt|n79nSwbi`XER6}zGNZB303;MEExZK{9M25b)dkuLU zLqUoFug(V<>*+RD84*&CQt7+9$?-2lzb7SRiQ~`Seh@vA>DcXYTN^5g3JFb8P7?y*5`{U}NS{0t$L`MZLztskHe9H|7VXO`#Xr6{AfUV5aPo zi-eCkhfb-MW>>um4WThRA#dFqv9M~H$^7gc@v*ln6tl1Qt(`cgxGZo0a&whpUD8!b z`~_hoa26Uy-@Ox%efG{P;=d8|&&paBPn1iqjGq)Zw^$TE6WmUs<~7en(ZiQjCZSCV z>6lvUF++h#S^~}~%cGiFYoF3<%?A#%FDa86aZL*v24)g!$M>VlMa{XhD%h5~y>#(r zza+8>itlikQHoa@r`t-5f70**zk+Ul*t~#VsWTWC#w&$XJs|bN^XE|R0f$PQGR}93 zjF#IQwUe<#H(-MCT?(GcAhEon3Rm@t-@39W-D>ai?S^x~j3>mox-OX+>-R;tn9*${ zun)-$%-FeZKYE)R_;=Y4D+vejc!kn1P~*4&0udDksnM$ja+l}XYrBK(58T+mBdSHZ z?52&5hL7)%((`7 z?(LCuS1=llILfdC_0PV90g(@LB>7j{7WcQISbWUfg2LRUCmC5?7=^qi8yJJ+sxjde z$Zq8HYOBI09ghs8wS1g#pFua(5*I;k@5fF0^w0zJVdB!4$Qi(tj*p$S_YaZI5SPGPwjplAkx??K!;?o3}MpG@lqzp$bB zA(^%~()|!P1qT2-yVuMp^{-ydJO4~A?z`?!8ABORP`FZ_ZdtyN@{tx(nBcTp7TMWS z#Y&avib85mPfkc-C;iFujKccu{EKTe$i)P!ab^VB65xu?UO1q)6xm?gYp&dBqOLp* zS15z=rdn@C(1dGTEG>R9zSuS|3t@=))b-@AndU$pm-*!fGCmb9D`W2)WLyr^`KXlJ z2UQJbO}z5!4F=7=thQ&JzMAs@UVgDlZ%N1$SIkZ#W%&{9Fwgn@=lX*nbe;->XoA4! zw9d6P(LJ;;T);l(t&%DGawh|M-P0%>3q9;hJ^RmjevvWwxFKzRbWBFLMe6IBZf=J^+@D^MFGIX(GB%ug$WE!cl>RDN zLX@FYzyB+bB)!DBv?C|7Ewh1ET6|Obab{6XIyem&6W9)-lv5QN$zBr>h5M=;^DB!( zLgO|Qy-BfWmYyUUHRILb&j8>U1i`WE6k}g#Y~YFaWHf%ST;dsP|I>o}Yn&$;CBmeu zq&G`H82{VLYZD({bzzf4!oIh@-8)SVoFDVY3H{jg>Kr?k-(L(fUk6JbbEGun3GVj_ zonqfV5ASt;+X?5APN=#CF$%r0xq7bRfpeJ6v!PkyXON9~^&{CT2` zYWe1e-s&+TH!T0|b1T3PP=vC*RYv~@M$!6@V5>B!~n?XlvBElGT`HZ)Xvm5zAi`K*QPD$0v`K*m0| zy{val9p6~zgZ&TKKWb|Sfw_@C9=VfX26iVDB`38PcJW;@^3l3|^gR;l@#t)R+Aup3 zy=IZUR_!~58C&q3vT3S1Homb+teJ5n8Fr1W{`-miK)vW?o;QYibQozdtU-=@@}a${ zfSGB0b$@l^kU&QeH;$m9oUz}Hb1cWL>1(L%vQLZTeR2N&x#iZtD5ZNiu1kT``Pt=S+pDI-%o`gETcc)i zcI4Y0L@vqpJ7P5q+*;D7I%U1h@}eTr{5l>n;dcE_igjh-m`9!qQY~w!k`i13+)mXH zQwC7^foUb{*UShZbsT1E^?Ic5IgCjQV@ioe0QWAx5ZE!?jp=mbXo18K3Qqc!!q?+r zv6{!fG>I8E*p7|vW21!sv;)F5erxkS8KpnoI~lDH>31!Q34A#mFm7-0^+b~6;BGCI zkk<8~3SiGZEZ8@}$ANk6-Fa<~@|_l#^>HX;4e2?@D6z0@-9=ZPVcQEP>(N_&#-AI0 ztVR>JM}J7RV=4Uihik+JnevToW^SpN0$lX=uagsDIe5zWtd4iy5_Ia=F&nABV+uo zV$C?eM);C2NeKRzZE!C|@*!va+inE(&2rLt_-l*o9oOGC)}G5F$FFB^2O3(tWpJjc1kLapDAi&`NSzKPn+`eeFDQAq@l_`z}wQS`5CtF$*(%p#mN){Fj$5n9Y(PaQ4FA3 zv)!77eybN%te3y4;w-9&8ba6nrE8X-&GS*k?oR(Jd`WJNN0= zx+N+H?J9cOy~x?k%-cfm^7yJ81w?k{Xt`nS; z@`1eX9I*^i@GXpo!?~kS@uy*yByA&;+_RupP#x3YwvQU#AH*kAvyf_1Q-2!;Q&`TzJ@C5mXk519_-sHkZ^;3-!@ox;`&-=0Jg2HE~{ z<%Px7{S{QzO;)`oRIgR8CV|`a0V9l}Ch)+y8t1wSNX2Uz=@Ud&@ z;VZy0UtHDx|4UhMomal8#mavk^Qajlj&{oEj|pQ3ITQHhIcBL_Of>K zaCsh9MpPF}e_yNVF++gt!+9e#QP~TF=uw~HJlcc$4eC-wy!K7c6;oR_i)jRJIOtN> z8IsMKEVG!v3fc;icHT*{KfZx*7T2U*gF}i9wY%PP7>B8co7@nX7}^3}iL3{*x)MY@3hrWn~gW!(p`d|@~0 zZ-+i>PRCr=R0*Hk>OH#HWK5u5{=VJ^M`SaeYn<}WC_0S z`lQ@(H|O}uw8iW0fh#p!{yS&!OhYvTtxWt4oL6$%ucus}umE97xP1BWMefPZa>hoW z{g2NMiY3UOTd!|qT;(daJX_*g%i%uQpYq*2Y?vN)=v8$S^0MEBx^e0@o;^6eedwd1 z+{MRNvMnp8s(3mg#Z>c!I#9Hx%3jjptsR>*4(o^1FK8V)szDw_nyaBxm-a%PN6*tt zuqzxucpP~gu`fryU^l(aJu<)_=Xv6)O)huLo@w8<| z2RNX)avX|;^E{$GbCw?tRma}`1*jVxTXr4tq4TkZ?t}g*iY@BK=h!SZY^GSU?h(`L zraugtiim;(y0`Lg0&8P-e#ZV9XDLwFmY|V+*}LDuIsPkgbkN{vSf0&Pgvd~_fT28P z2%lcd29aJd=ZNA%0=Iw>e%Ud!8m9&kNil2jyi5jtzIB$(sbY9H=NcK+y&R``T1<GMb9714MX{%whUj)fvDty{>?;>GX7lRR0Rie|d-gL#xA$ zd5=xpI49_C%kDeQ4{+VFlwYVpubEqI;{I>n4k>irb48^7Khwy!s7m_=Fmr(fgdeBe zh>dQD@*CvcKRp@wv4ym({;S-?Sb=PaJvE>k$j(9=K544NSSA?f&4LG9o6z?)x{0EJ z3#a`%%9CqqgM&*)o(D!KmoNILZ4(ihNBGHjIxD$Te?9#H%s~UP?eFRAeF5KF$MFf( z^DOc@vWMro7kKek1AZOmx@V(1(T)X~;WU(-z9O6R-h2+gmSuaww9U(ppB=IKuH&Fj z=pwVCEH6GPu|r+a=lMQGKTTNwY`-1O8+m0Pi=6kt!Q6^$rk4+l7OdK0v~sB)o8F^h z5J`a_e;^SPL@;AEU~x7|czK+D`YmjpghqIjs$MwNc!d6LX#eu51JRacPBcyx*&1n& zG%~lpm=cdo--w(CH8B5%dS3!rY;17OXpC_L8P{Qb^{@Ap|J(mILn{imi#`@btYUC5 zm7ao4Q{UU_t#VeCYg*;`BAcf<+r+ChEceutd&Y=Uz~0Ej+q6T-vSah5z}RBX(#X<# zA_Yk(^?fdXP#O6v0leZ;$g!QJ_2KhhbI|eP30&e10>SY)3}lr2i;09E*t_28qkK#Y ziK;vyX00mM6E?g&qx(3MpsV19{@`R(kl+_Vk>fDteacyDiSnRdA?zM8E1`m|+_FY1 zhVV;G7mCy|&Mfd5%2juck;GZ7P2ElKcYx{KtUAv&cUA4kR%||%6U&$$W=B0{XyJ7i zFl~-`I^%C~u}@<^qt%g9@A7HDE+ZsPiQ~mDjoWRW5JA^qZxTJ9%F6Lt zv1={yo5Vdn9eOphA7W;n)f`eErzsPiJi!=Vtzyz z-?hBG5Hps5=Tl1^jbE920c43-OFb@}X#7!aT8h|SyxsRu5x=%3iA;_+AFG3f5EYSH zh#57?M0TY7P&8AB>^ii+f&ZqDgC9c%e}FuA>eBqh#5;ipD;D`OI$nx3(J*l_k-333 z2i&fh;P?)Hg6I61-J@ScVAG?e!mB;+JxzNtoG6hH&PL(PN+2s^`18 zZ^Cs(oKu;yOavy7O~iI`b{xJk9rGrs$mZb;*+kzPcS%r>r{o9?v&G`?xN>F)d^yjy z<9TzEDC|^1PvN2yPKDL+{y`46pFFw@7;Jz%M#WL^i5+up5$Tkam6!9CmJ~^jshHXM9kr9)c(p%wZBw}G1n*d}p%lBh)h-n=A+J6yqh6^K zef!6A8ev`8bm$RXpeLXy>*c%fRcoki!%-tA6iR(6=U*9oZ0mW+I48FX!2(s5%eM{r zT1c>Ig!@n6zPq(1oZ5X`;l3cm8$bR&Y$%N686w-S7vM!Qv`u0M2fsQ$7064_uSoio z`|iytHb_dy_4(p6XTM3&pXIT}skx=4IuU0u+Rh`yCV@J8m0UW(Dj{tasZYnhu*%zs zye6za{^314N2`xv;hPlJ#s1y0(jW}X?&l$ocbV*f_qe^RGB{Nz4_9R?oVaX;% z=*tup3La)ztC;7?w$+2}AiuNl2^k$*X``gw{3fLbzTgpiIe`Z)lVxTpK};-jTo_+m zb=J%NMDDEqx~oO`pF_R$#=0qEN>)91=){AGOa_r^;WjE98HOMs(>8hpT6$;DE1V@j;h%`XCr2XrgLOLB7U z%tAk5nP*C{2)RkTql|-!cq7mj!?S$??8??X>?ybe4E^gReUR`AOX9SA3tEb{1_xg3 z;{4S0oec~20Tr@u2VchPI?rDo2@mGjj$V6ZC*s>~jHhQ6RQCQ_2XrVyk+B;9VqSKvQvm;Aa7WUr5^)86(gm`?-Ux*1m zF*;LNi!5`OZ!`m>kK7WXk`GDZWl^A-&1Y6@kjPGFK20_GbX`FFQo5xc;r$;@tuqAthUbG@r!>?!zV?l^CKhkE(f|^2f z5J{%uJa;j_zF~y3Tb>WhVvqaD_)R0%7}pdjn?juG)%^$Da5INju6^SBy>H3-HO}44 z?IL8HiS{WS2a$UHZE6h`ok!hCxi7CmG6+~U&tw*6aYN`s-FhAarz`aODfO>0ZyL#=R}8TB9#>veE~ z{Qg#A?bew(^biR@|L~w;e!!R`{Om}U^CeFE%h$n#^75i@hp(PiH>|yY0pR|$nqYqn zYq$jtzVMLLaRHt0tw`Xn?;lt9?Xe`ysCG2aGeg2G$2rb{rLSg=sV;%5AFj=q!v%e} z@n&T3oPPhY(5xT_Z_z35Lsfp`nmExGWE@7adGa5z$@Vrsu%$%4!7({nutYn@)-48N z;j|R^Zc?7RLVOr~GiYH5Q+%h!S-;Yc3Gnb+nlZ$3nSGdv3g!CX_eyfs9{E3f0ov96 z-R(}7Fx*LC-mW^Wk3&xb>_5e_$hjPGwh8HaD|ecn;`+ON+8?Iq_h*ncldYTq)%wX& zo80K7hsN1DhnTuX@9IkZe0_V^z`~oayIFg@7iY`O6>~#%FXaj)&wVhsX>`W%M1PX< z)QYV7x}Q5OGCTdTFEzLp8uhm^VB*4k@+{bsDA$cm-$XMgg{+xHAT4aoWNB*(z1#R} zH?-?D79K^;fnmaV;hU}xn15_V6h}FdhfD;!RW!*uT-ZOIXM;^!kMpg26XbSX3$+R- z?8cCiqlbczPujU08OXLPU*g2)KZEBF^`ZN`Y5tz|Y0`0%45NpiPFF9#RIOiOlb8TW z@iAuOlL)Avf1h{uV-pYFF+=e}GkH?FO`7^9^7GX|0Pk3>ajIK!>0+NwchIf%`Q{c@y?;Sr4bATzt^g2i_Snz3EQu@wk_4(sl-GV$=qVXm{ zGT*HePqSJ?z*OlfZRF~P6~6Llcyrh1-o^g&*ih`|@f*QA1JR@inUW`ZuiWYr2hM>6 zY6?w@Tu}ghBmU`M{-$9@eCbpn1*EcqggVA=$3L$OdtX!sBeWSyc~~7N-+4B_(4d(I z!Zhi8ZJ|9V%0m?3jfVN8GWQB=o>;f+v$1u)z4=BU=pU#pg+H4dMWVn)DNl~VCF_2Q?-33AdniJJlAFVc8_*D96@A`T!`C`H)$xOF4d1y&@ zUBVc&Oq@yz;D}BD1Ku8uI2gHcjh7tew0#)Jj22#<=j2abYj9=Oe%HU1eP4%fZ_F3I zdW_HsZnJ%GtMuOuNrcZYPnQi*l4oozHNEgG@U9!S;?%a5vWed7X}7}8ZC{r5jPn?M z7+}89fSLkmr27SAvSHfFo#7O-o1@9+-YxcZFhc?ex-N|?-?!m!p!cYy2v5ve^C229 zY6I@^7*CLO_;#)R`Mif8OASstt2=2kO^4FB>K6Ga%Z$`$G1tqs#ZR}=xECCWOayB3 z(9aZuYW1>-t{G)TnE`KQ`iaH8c<4eH3ZR{J5_@b*Y_jT#z1|dbq=Jq<;RwaMHmSpM zuhDc%Ls-Y8KcqCWy(z9JlRGJ#J2WM*sllhIy|lOaRU#(QZ2RGLK2oy7^5mmf=5~$V zclNL)a^{4<>VJjDup|M4;KV9!vZ)NGmC`lT2FdFq67xc6V>aD-RCRET%hdJ%Z=G!huT*-XLQr*wC^1By3chj7K1 z(Gz?};U65i8A{)Ffa{|lk{w)+fDYSHfidH1alC)L)@+!E-`btFmz@o+-mba-ti`I9x4WHv$hk6gVS5GXz~)UGGhym?s>x1$0 zX%2oLj?Ol?Myj{8tWENmgTiV;{Y;>B?g_mj=2%gm? zN<(pUm16gDHJ_P0`TfC10CJ+8aAV=-_ba@IO^+4AcYX;X|7KM|{332Q*Lo}5W8Zz&_$6~RJ4!KL_G5^ z4D+8|S;6c8I(UM}>$gvDCtIz5{;TRgIda64!tMV~SpO@)%;84&)CuK38hiGxj~yCy zoo`=BU`G3$kjD|t3c~w*#$Ol*;lws|XZOxq%|#Khi(hkk={pqI?%NPf^rYtrXcAj* z8d05VQkvIDt63!4xnSIqh~O-5c1U%rLKX#B@1?iKdQWRt5Vu?PMd(xQ%BP;6Ghp!J z6<~@A$dl%Q;N`O3de^|)uBXWOzcvXmp1zO@*=WXTA_gm1Qp{LqLq}(ixsP3V4qR}j z`f`X@D2)x8HLbYkPos``sG+4dm63qr9I@r9$toP0SEaWI!LtWBlE_OdVFL?gO#}@; zU=7{zOWHX6v~@29D%`%C#+N<^0eqDiix~{#yC5&mb8?V!R*6>Zp64Vt2{1pp6RdZa z;jUMWQvCc?$62hbq2XOWb8%GMUi$DMC|Rj6PLW)gTSkqW3@m_zgfyn&gN`_LcnsVz z-gnCxckUk9k9RGx3ytq|jsuuq9NCPe!{aqMGIyoD)VN}0imQ#SCf$9|Zd}B!>aPX` z(gyt2U}un78?HR3i@D1|5l?20_ItHPXcBJiV!EET#pRz9IQ<%M=QcXl*ozM61U{}O zIa``D+~7GIxzA56wl?Xd}v`^Nzw`)2_7ic%`u?G1Ky1R1w# z-&2$se@`lFWOIm!957X{WM$xvweJ3K{|wy>^2 zR;vW>X9U=fy=`{-*aBIKK|waV;Ub!mvjKFC7cL@^#Uu>sSNksPz>BP9XdosLG~H&@ z@3RAewnf!8%Nyf`P93biIL#`rBfF>%B0zenr21R{WMrAwz@0jjo+cJk9kl;h{Tlm) z!`@zT<6ir6+<^@l%F^Ziq>;K3S+d#O_{jBee_kfDnWvcq`NKvqBeWVAKbs^nUhj29 z`wju*pAIqW2v!xzHk>~9U~V_JuzuK8&V1lnZe;j6+f&(-9?YzrFfB7&Ta9(l`C}?e z@cxU1Vp`(37p!hX_;$iiD&O$a${qs5+KGV=n}s8=uIu{l=LiT7fa7wx!WvIQz=o^S zr*cWcobSwFhNl)@yf4xk-mNv<{5~s8{N1Q~zqLH+C`SE~#R!!C;QTO(tr^}*Z%{sL zg$;OD%_1bI&F(Q)!wI<4-GP=f4uOFHhdj9PR;L`A$tBI{ATXUxC@c_-+<0_shF~oc zewAjV4kN(cE7Wafnp)clr$uyawfHGE;`Fmxi;Jl^ZKNu_Z0v5ONws%PWfu3`$kvkf0 zX{1{6J#MdPieqOK4O%NzWvLX!HfMOc{aN#Zgaeu`J?yhdL0^4FqJUFpL!0?r1k9cw%!2+|P7KVJ2 zV>aT*dM=;{*vkV{DMbjhNODKR=4Kjf1-jb2X`O@#EkPKLuVt~vWF3hz1`vQX`hHZF1ZI#u=3>Zqldxk?pe2`@LA<(PEJnJMr$Wb zvl6+r7B@t@>JQ42#9kd{Vaw9glWoCD(A(UGI!r<581z;X&gcj(lZ) z|5k~x;5F2T=!{W3Y@hwA?Ff{VGf zNVuI$ZGW@J)g^XYf&j2Vcn4#PYmz1&XQ8eHRzmH9vn&`whro;)@6Jzja1dFZ}; zEnaM`jpGINeft?myc~Sc0Td5TVZwhqGnAr={>gbW|%R{mZe&?B_*aENY> zN`h-A+AX+ES@v_p*R!EZ4+nU}EX|h9$O`=CoCZDz-xpACpfkI#W!Xss3h$Jnfi7>4 z?3d2!4MA`ajPZV$#$hIjVAQL{=%n zYL3-hnz)L+)MD1yGtcBWlcG#Jbtaaw&`=G!WOG*JNJBNWqZk#(*mUHO2)F#a>jfcc z1P$4v%~2JeO6CfgXdP`r+|D66jt4T0X1fwEfePBG= zJoxQk;_`20weq21ZIgnuVe1j?wFVk6V5@A|b%97@cS2dscmnq*ItioEdd%;Gh)q)J zLUvS%C*>8eM%d;geCUwzcKk*4L+MUSYxe3fS!P`x_d+GT9J7T)u9MRn*vcJct(yZ1 zc`dI0lzOZh`PkfpqdNT#T_Xr=GvnGEQn#vDwlSwsuOy<|N})eMgdM_eVx6 z-5LN(XX0=+6}Q6{z>$dDKv%mKA{KM`ciagk5r>72@Kw-}BBXk4AnWCDg`Q3RGqgEu zSw)FlMTyCTytO;~wu{}s8Ogd@8VSA~j@n9%^dZmswPcz)Zo^%IQ@%c7L1nHZpsV=9 zx<_&Ju+11xn;?(DxN8zB0(!?Zu8-3(WhFpva2Y5>Tp9$I9Eh}G3%ByBzLICEx z>|kjL(Gf%!*gysxJBx0OdoSj4-wocy&pLu|-F*dtq9o|6H8pS3GXPUSxsoIZdmX-EUI zofcXl%RKS9PTO3NN#Lzz-dy?*v`4Nd;UBJNw#d>-$h;y$Vk!d11@EM{9K-J4WeOCfFd)oZt5_kA|^ z)ys2$-8ayqPR8~z+O5)u3m>%qb>c_A9kA=p@a>ZkNqqqu%fwy~_$q z=!FmCzIxC3LF2(((yBQr%lKU@;O1<0*FuhQpdAuFZgdJ#%QrLRE37ddm69{+tx_>d zbXI#fd@;3_7-k=!l1yMUm`7<)Hs}(P~VzIPIncl)qL8#fC@^KUwLvZpO415MBf z_$UD4f{jMnq-xyBLot?glOqUlNxO|6-w8_Nn0`4rBIn8H(4TI5^++*r|HVhmR!AjJ zHUPxlzt*vP#sX z$E)q`=dT}TRYERdD&lnd04rk(9KmnI?9h-kNw<;oZSQuixWM+-&EG*%W(@$1GN`zL zoTrh87?m6h6m2HMt~YjEUpL6c#c6DN)a|wz7+B(MBzbMD3`>w`Ppka(4LZ*B0IJ8W1w%n6%>1Nva+#i=+@76;f8}Syr%loTw z8i_tG&xUvgHyc@&#WCk7u`?t#cQG2R@>jQ= zYadhtE-x;LJyxC}|06F3&2S>b*0t2;GuYLAyKZuFpK{e9P&ii7X6_L~ulfI>WHB+! z$-mjSB%Cy*G@9I-i4j#9^%#%6M9R-omMo+W`t#W8tG`b_-d*SXI|fL-jw&9_k6>6A z`gs0W!OO+9^Ri5;%0N@&W&PugJ;8roF+HsnIj9yFJ%kWITVu`4&Q5#~wLe!W|DiZp z_Qt?dl0=?jHVd!w#`_y5xVRT6eKnHm$uq=bwz7wF|E%jK>9Z#Bh7-Y{!dbb2k;G^Y z=UYE%T9C5};;D}|e<6Y-J8>s?x#F*`OO~8`2ESV7Z>v9g{CxN5Oa!Bj^iyf7R+uR{ znp1jgJH(@z5OM3jI$NA%t`^l~j|O&TdTg;A_YuZ_kLUjsWo6WC2p(^=#Q!q{`FVmQ1t zNX)ULfx>{efh2zTFY5PrVZ!pC(8^%_uVRH)>*Fj!vPE+&9r1xfy-Q3*ZkzIA%-W%) z%lwUM#eb3NpXqbn#>(4GEN*PbwE(-qS8serq;znSg!u7K2k*ZxZ=sl$9$02sO>LA= z1w!kq?Yrw%%N_y7D}H@)^4QYj@v}Pq@6(TE`G4r#|JmaA_EqM`FW^OKQr+7q7fy&h zkuZWGJ{>`ck$40D!nFhXrFJoK%v^EFRV+_yUW5Si=p-0X{cm08+}SOM*;${S@c+Fp zyY^43hzlfMkAJY|vF!hUZxM9#7f9<`H;DBO?2PgFx%pxdkGi(U`0f2Z*O6#r)&{%1b?zl01erlfL6NNyDvx;%zQEfe(X1UzjUeADtI=fFn=-FKs7x^!{X2WZoZk(wQOtI%b z95(M%QM170{o!ee#gVk;o_9_j_2*$2hxHdeCGl&yLV`m#x5tVFoL(@?OwZbfQ|Wxig@zwpEJ{9!-Kdn!}E+0BBvIvlHJ63 zXA^@vqe&`XjwWDd?BZ-(Ipb<#U1ay=dP*jdhAmr4xTku(wVKZUar6WQFH3X)sb`Vo zQ5hr9QYCuB@S4u(&`)%5aqenC#e<{iplbv^@YBT_U$&Pn4L5&# z6m+JRtV=F(ezMiL7`Y>2BX^`=Ob0rMRW#}Gg@?Xj5HP0^{?fX zS$bKyB&oXt|adHO>le`ZQ#zq{qG zD&}rBN3bA9Dgb+6Ap1Cb zG`TL{ZO%LT_Qrs8_=L>Oy&C}x1Kq_N=iJ47IkcIZ@%?}%X)+Gh4SH`UaQc31&}+nml3b7g?P|E?rV7WB0INwX2RJuEq^Dma)VWN^ILb#O+`yq>?Il>*=T@!5vd&owHB#q>2+l%crt1rvJkgJ^jj{1KWrWO4B4}KXQocD!VCCSn)ElS8rjLIn_8OZ4QRQ2@lKEI{u!%?p9>cvp=$#|byU4Ek+ACHzJ4wF|uKh2n*Bo($$ zs}KqL%fWpqG~@l`rGhE}Y@wAnr+%xc!|2yxAjq|d`GCsKXYNypQI9_rD2G^;nHDieEC*-N90Dw{h%U(CNoc1-=a#U<_kq~y zj|l|v34Bv%f>fL@8~Rv=u%}hMK)x%}f3UP64$<~qmvmNx7x$oYqq>n1T8r=P0wq8n zdZ>D2`i-R&O?qfzI+>T3^8q^vMq{;r7|SQ_$FRTN%r?Vj;^f(gQMu1ZP&Pusoo9GC zi<2q#h9~509mq@qS;mVV+31)r*~SE;WXhe}Ka);=dzTK?XT_5OD;~ydN~+4y)Rxy2 z$@Q#zE%ed(Rrs{!IOaunrE^L@@bC3DcRpNcn(VbKOVp6TH({mSTYj~K(4<8iEp=U^ z$*v60LR4;G+G#sh;0Yd8xnOj2XiWMh7!e;S^TYO2F$K;-DPKhq=mj)%49Hc}ia#9^ zI5lwK$lFeiG4n_(?S@6WY9jenJ!|%pvFL|kl?J-RZLJARv{=a$bdfR*BXf`%LT#KB z*V&tVwBW!x1B`gNstR1tQ(>vMbvEH-Fh0#Y-_C&E7Nf(o9tBKI8Ozn3_z$6K0$myJe$9-#Kw??%E-Xg z>>O50DbWWWpBp>eSehjKnbx5hUQCLiMWXSPykzm8EFDz-)KZMe$D&Xap%Y5xBWfKW^azBcDewj<9h_tBw{--A)SQmT zL0t_;+>Z%=Qi0{>15L(mW3Ik5ncq{@k6bKy(lK0*>+ro=MsJVfnkm7WrepYj*orFM z;KaMccDI;{kFEflK0=GlZeh7|Wc}gvqdJRTh5;6_z^}00(SI8T*gEN}$s}Klm~K>9 z^~?8mC0eiIM+l?QRD9xWh0CR|u2a!UV_0}r*n*`H2;-!+*$Kclz?Gh`rNcCZZJOJG z2RW(49h1e=PQMx?5r(IsUg}DfvzspC#p;AwdtmRh7y044r>*u#Rdx_dP^#HPGHdAG zA+WT7yT^#(0p!SfZDo8ua5irP$CxhTH$iy+urnOfObkvtPXUTS9R;1cA5T%5RWZPY092i0#O(M8?$I1XPPExUh^j)?#4A^&J#hSQO zT6Xyd)y8jCIUwQ;o1=+Jrgk0K4Dha^+*9z;PgMzy6_|lWi|7%jDLMq^ZM_;zh(7a! zNFRSBM)rTy=80nQu)4na<9m~5V=KK8a5~W zGi!1WK316SS0Q9a%N17jlC=UWZC7Sqi$i@DJGvdFVim?q zfeQX!dh!QLJ=3Rk73O`zVk7jOn`b`ChI*hLZ`1Jv&rOPD0|C50Y?>7F^jS*lPEa+X zthby~m7b52Zl2iQ=FB6T1sbJ=11g#FGTBD}dMCDVv(8{8oU(h*cmJdDS*VU3dgRPY z$#irok!__bOD!;NQ5@p7xX=d$E_rNodE4yvkKj9^14xHMS#A*QPK$#PVJz31H>$-Q zC&d0!YbHHWb`&WXVI(~;ocPWDc)2SgY-zaj1?}RFW&!KByq0NY!upUHXgqmcNbbZ8 z=~+@`t7ebiRYQY4C#I1*<8YlPtZqJ3O6zdh0eH5vc@F)0*$G93IZZ$>X;s^-CPBs^ z_xLEIJ?PpZy4|wKHXU(9cAOqe3OlpVgHI!boJ^(&3`Lx=%*pgL!}?=Fx0b|G z5S_`G&%MqiC(=fYVFEsOGJpbmR4;+7I^714`u(kh&dKk%$y!Gw1@4eeJgt={TS^3LQh){qlBXEUQu=8 zFs=edjCd`C#@yP-pP}8R@>PLAA!HvkQZg#!_^BRZLnEHd4C$t15^x)$ zWL^z?rJ+chC*@iqJC^(tyVcQ7)%j(&g#d+ThPELN!%c^RE`Au{XGWE+`$Lt31v2L;*U!}PNe>N68+N2| z!B*iyoGrq3)xobWc_>#al)eaEc!jQJwFkF&$`1apne5q3$Q-c(^rU@<2~+(y@g=;bp@8kVi}@`g|K4aqsa(x51231RnQSp}f~ z_hadwwWO%Yh9B{mBLcq7V42F7}6 zl!;27nT8@|M-)X2xV8N9o}+O!OCnF@$W|7aEuG+hO}dbqtF>~HLMA+SqqiC-gbJs> zfgO&ldRJyiS$tHuAj9+Ld^2q0C?P)dCiYt6uWZ52UXgvM=bzzE0ni~aN$#TuPO!&d z1Yu@^hCbVAxxsO=0f^3+{#MdBndoY{?vB2_4;_ki1lPwOpLsdJi#fb!RpRdkl*zC% zJP1)7TDIi%@2})x6msfFdsD^7nQABLa?i+X1KrMkOg~+@nc>=^YWGVezJVD${ZXAw z7uIKM_4_l`n8|8)d-_y!5Vua<`snZFM_PlPURKTVf(DemwUKBHS|gdR>mfvD;AC#S z1~P`JOb^FPMpF#+e2LB=*@=F5mqo@qf}@&ke~CnbA_e$&UuA!P3Y>|OpZ;y9g?PX` zE-B3DcM_(*HVQ2f3g8wxU`<(95EBDNm7seu7=b`%wT6Sq>6RQPqiU(@Q!GNjS%X+Z zn9ZzN?GLj10K!`GODw7>tV>FA_~X8X4O-8|hM4KDQF=pdH3vR*pX3RFFTafU*y;=k z9Ed+QbJQ}bdBWL9*&$c+L!Og$nAZX5h#d)>j92o8cO3}i7*7BxAM=ZgJ>V{D^Q?wj zTM~h4Y7en&?j3{%WV~^PEtoTLPUo~ipX~l=P2=0ftw=9ML$|kvcYqJEsPkq!l3~^9e&NNst zTdGlNsFn7aeNy9&ul!lH6Nn*9$EfRfXaFC(a(^{QF+<@VBUZ?IrTLXE?n94Bgv2r> z{n%R;kq6cO+4rj@=(>K}`*9eQ@l~I0s}en5;KGdI+Y z8-#ErhmKeqSNZv*oDKPY+pGxGN-Ey$Xix9_edFhrwNRkA*^%8tA+|@0$qGKE&NX0-mb!{Zs;4 znN;z-Rge{}7EAL%cuyjxz_amj&@+Az&Z=<{zezf>1X+bAf6~`{E0zzaXd3X zak;@2RBb-pduZrvg5VV*|A>#$8}=f;E^XwFk+0)*qB*h|j_f0yyaM5L8m<2z{15sN zg??p%JsMHaJ_Tm)u}h@xrlgb8CCI8HQ#|&hD>gyK+wT`*qa#a(-l{j{MokGy|DbUn zpX2ZQN{Pd4B5pkwnGjODjcp&s=p@hzaxU}jCFnH#lCOX}VdvOo+(*pb0oME7SN5SO7%2Rp&nlB`t#!QCU&4;0oW~B&t#2_J&hnL;dQuIb~5qi+gFBQ10 zVq}k#4$Fs45T5Ia{%|#K-`6O2SK=_NE2*O?cTlp%+)uYUJ-P(LuioAS`|o2;hJR6_ zG=N9$Pgavrx)fWcR<0&5Q;Fdm#h=5gYD)*Y$V-cn{u;}(w_}&OvFXG11R7e+oQ=McQZ1u#!o~ppF=kO4STtGP2ixz z2M<)dI-H1PtHaEqhY$i<|8YDyf%6S`{3k#g%^Rh)Mo|3VH=-4m{LeI3ffyccwyc@MuOTbGv_Df?SX+AFt4 zP^Ixablm3~!B!s_kUV0m`s&F}?h;$;8NFmHz6$;$HG=-{g3_(7}oSGM1; z#cNAtkVh}AHf}`84v)vRQQVxljQY55M~mgNRHD1VK~QP0*F1E)tqWr_r{4a1*g`0$ zvNeg~LpA_d zjQqtI25VLwCdefA0FhQ)()%sk4 zZzdjl&y35I+EI6yj!0D}Nz$tm<`}ZxRk4rw3meO*_zyBMe&4)I_UU~QbUJIWw>AO? z&X2}St$Qzc8V238aoxOTua7xrTp{-=G=S6cUKyD=s}DPY8+++HO*cujv4yTh?WWIp z_E#0F7bQk3Qgz%^OG%Ne(mu8*XYuCY-lD$!jkylmQaKu4siOelUdTkjZ62lad`-CS zt;f%D|E`?)+>78S%sxL2J7Uc$Ag`Rux+dyr*74Tk4#yypG4%P*V1vg3i64KNJ9EGD z6`bbbO-BgKGgcqw)dw|xD9N=Y;=8ulX{CkTPyBayPWg#?#j%=8%xd36%6dufW9N&+ z=~Faz69RwxXQUgg_>@Hvb*-$0Pvobi=N3PRwSh`T!%*8x`^o^+xP;$C zUh7V>0}o3w4g`yl_f942$2Y&EQgSHb!C}1bY0c|J&$VFrKfO$Uc$+NO;VW=$zCPsWpt*Rt1#Q1 zCvbP^+Ex_GCh_NPX4`Xc;$~nstXf>Yz9{myGLmrg2}6*5ictqUVSKx ze)wK3@gn|b6za$Bm~mC4wk3NrOCle#F8!0B0nZYlb?4@RujERGt-l0HKgizY8Bb3K z*QX3Z?>u^zB#P?T6s<4Py@y>Xy2-@B)uVRWWy3pZW!CjchbNKmrjU-X+HGOAh4ZS` zTeqrrj-_rHo6Dxo&F7iy3D~MVwq{1YnIdM|CI`GgKB=vD<+*u9lgtwBIXu8xYm~DQ zr@5z~;`A4Q5&Y-Bh|_R438dF|Z62qjF`d0X%#YSa@r+Eqwas*{XL$WF%HZR6fjNboDCu%SO@iP(5Zd zH<0GhZRVP?2Cqts(aY7O6`AWZE{7caNI~5{b+ocoaHE^~Q1&*}M+@^GI#6#uJ`W22 zkkq$&i%O5eSPvwnUN4}+j8=xYwovP=z5za`9Q5@Iv)7;2y!0scJ;~&^3uR=+ka4Wp z0ZdC#!y4UxtP^O}lbe^abIa5{To+@$gur8?$eprOW{Z-(rR{|TuLdfxn-zi9#Eg*A z7L2ma&7DHe-ep~>SGsy3CO5j2Ab*#o?u`s%P(^e|x+mMl#YYLM3ry*q!m>~+7ev#{ z4sG9i*4*0djQURDLdkO#uippQy*gVX+PDSq7;zsCD3&_39aibgoZPMOmxNl#R)w37 z_@!WVxKHO2-k4?}v7sb;zm{R?TB8l&BuguL-xsl8ZJ@1~+3!KK?tRu802cAgp)0Gj zSyzM&GBR^%0S2apac8>A?`gh6BhgSwLA z_4{GWr+tfV9(0K4a}M9gTOqqYzX$t=_6hjFUHd$3quZZp6;L@ZGDjsz;*Ep)K3ox? zr{5a0>6v{V3ZMd{sp(u6JNB{6i0~?*E13$l5ER}y`;k@fMf^(z5h&8Tor33rz|#*!yOfy8ayK}^7PO(3WN(Kb@N;L>};tM|r%Yb9^n zG1Z$RMmu?=RsTd0b2LhInMU8~Q!0{jv8_E3K7_HR)#_%SJ&zwT0zQekUY}<5`*Q4j z_gMo5>gNdb^bCqie!;I@E;RNZVP&ZWP^dH8S%7S;)9!i;IT8#*ZO|$|A{BvFeAT8CubnqG6#5B5ca`~VnD|$w|an;`QCX<>7N6(9n=23Ny zf!QB^Ky&xL#jx2Ap^}=i)#Z`zz85&XlK4WBnr8k2Fs|p)k;dqoC`=!u0Ik6kM6G!OmP6$v(3)Ufc zQSq+aM3F;jbYk%x-u6V=vbvvgc4Tgk_c2o)E139tzP5irX1ZtCjcIRV;uTijCq#5t|7(nV`r_mU zS8mu;8tLu!Kvh3DYeDddkkZ8Z%9((cn8lAYE}XCoBp~ILw%2j(#yxL0`a(HMg1Bnw z6~AWm*!q?CofrBH3mWw{g_O<~WzDl}1Le}i34<+zgBM)n#2L4DX4Am*hgYNqM}1X~iNUHZNd{J{ikY`lo!=>I~?6NzHJw zCHLfTQyGFf`ux)S)Sx~Ca)2mmEE8ON_9MJl>CVT!|B8mr@3S!!i|C8&{)Np3`^Uqd zFWNTbC(c7Y8-J|`?0*0LzFU)C(Tlnkq~9rWjapkp{*VhrEf}n7J@3TvSZ!Y+MAbU) zVw?TjYfJSL$z6bVzjjk!?l+s)XY%za{ZZ6{F@{{V>=T$5VHEIuIh-R2@)(%^bhs&C z2{7Q{zwYQdP}XxsYZ-ol=eqNL;Wg=di56lt^`|&JJEvWH{-EzMKyqP_=CxMa3iY91 zpwpMCLT+n!6Od#AjMfG?I#^ij3+bmywxZcQBw66mK`PNF8`7M{W))v+jm_n+=@(vH zOOo+~n~~QZqsZ&GH9@_3>J^_1&O0X2QN?txUZPI;*a+u@fPg5o;#1;5gfndyt(oD2 zhGzL!TSeWY%RrxbPF|n&id6Bkt;dNfiRT3*B~tgQrNR58HBTQOkEG0f@!P|{%!@Y_ zRTA>9_RjpUb;^Oe!DmO8D%d|=@Vxl((BGNBT*ck_6KG?Q|buM zO|cY9vfT5!;{SxJVexMA?=pRAM~`aBk*HH`V1;pm5}N}m$X8lWI6%B}P$xdH=Y?$@ z=yWt2N%ltVfF=7`7e2_vVnpEM8?dRI|1I0=|6R5N*wuL@oY!n-_YTQU)3p2bx@iVf z8Bab77m2-~^(ziYbOJuymXnk{dDr@)SKH$K9*@GQ*sIE=`Z>|QRVhufO`QHESxr_} zM8^f4t`r%TJag_9#JPt&OT!zIu!YHmquMd=TNQg|hJ@7Tsm*y@=2?D#pF&nj7srh& zjqZ8zH_sSfIuRH39W{QLDp;DbIJqy&Bf;gjWmfGAkd3zg*y5k_TUz<2mFQ00rS|VE z<`tsK)^_rP0*Td3K5wmDcCMD3Ii@l!JE#YzF4_w^wS+F)k+384*)4CH#QRJA9y|iu0S?_7yu1zbO-7kpOF#l

A9bxpR3Ma4&V$6zLTPcpZ-j12TN!;7@9||w6U@shZP_R)=}F9+Fb80 z6za;xn2(a0oD5jDv%eBM@9|K?JzhLh``TZ*kFUD!E8i+Zdc><#PD_Wg@6A@iKV*0n-2Xnn{9EHxMvxr-r*ao_!Mfz~Wo(n>g3+a^^FN&z)!JRukY2;fzsjQOYN0r@&0dzj~ zY_#0~`3!5O%kt~_aeXa@CgDDU=pEYE%lB_ilD%(@&*xY^z_zwJX@b>|wP;mosO4e7 zD@Fe(WQ{j`AmL#s?;WPH+SSXH{)cx;(*zlVu@(w8$E^5IwinvYV^U z-X$a2&{u(kEmvF!YXAvqp+)Ay$1PImi1=vegE zENvdR7;_`k;=#KhX`Kig}{#8DYX*ZCeNH^Z-%mqZ%0>IJ#{p)bEWDP^__I&e*EWw7K5B(UM9zb zzM2V@j;(tu7t0OgkEUb^biJd)$|bm--7m?rftn&aFxG78(>-xkAJt1dARf{OF0DzI z0d_-3A6;e5%Apu$W{8Vv`gV}gN3=$DV049^_Ukg&-%i%%3F%vW^4wX)J}sTn+P1OWef)}Afs#bW)RI0dVm@$KAHcNsY~m(< zG>D5a*;dNI`$p+VpLf&g4*GTYUlmGyRrWf?my0X8!fG<*gv6CMg_%8IPU{4CNHxxZ zuLUUr!|27_Ha-$=Om0-%l<)m>+pq}XK{G?C9 z=aO{uSOXLk#z6RKUP2n1k!h#({n0x!n|c?t`aW%s1U<_hY91q9F#nlbbui@(Dv0n> zOWM8a6Fhx8;p;>%(@d+khGsyj%?iPY_Plu3RNw- zCnPXrQBpAfIy)SgVOBvCmS9=(d6g}~ear1@A1fb^bK!LB+wFzkYjh{ack4e%973Q+ z_Hl7HeGZOROkjoq?EG@a>sQQ7&DYkrmd)JUU9ytD3|eI^*IAI=A7QXUJfx8c<|A7` z0YZ3qNH}*V_&z7Esngu|IGgvPs2b8M%~Q$}9Dy(TBt&rI+(bO&(T9uR z_OkwEr|%=6wqx}#Zxzy(yE*SL)e56}Ki_t`Oaiah)#V%9(9I`a-))B~2lp-HSia-* z>K(HR`FxW}(>GNQ+Z9HCQR+qvetJ=WGoW0Dq1~mIsLc=ZmWEd6GMzv|XR$vbr=6D? zPiCB(iYUH7$!}3wt0Fc>Vj*Yl@rAU*`zNQQOVmPb%r%vBQZ3K6BkD+fYST1KIK3}D zHsMq2b}j7|-?N6@8Ag+y`cWwfp(LwgXIo}zH?CfPGZRGNbAJs3x0*D(>|dVm7}2Ux zmwjh0Z+0G**zOzBWSJf)kf3@ye7P${f4gB-7UZS~lo zwNabSTI~O=m zRB51fs6m2$ZDjbR7*qoRGA|-h!BghQTyb&K=^|v}IBj9wnitCeu)V34D8labC*XJ~ z*zoGBA9-A>Ttf~;eyk%Baj2ihTyOzVkZ#la=J|3){6;UsrW+@pfpD6{g(t^6N0e-L zKbrhAhg0$+q5L5hD1B0?!M)U?*UROM!o$R80KI!jk1Y&2n^Q&wgsb%bRE}LfV)xOL z$kpL`S3W5yR3?zTFevn%R@xtVyxik4wGDWDE1V}HTg`lM?8=b@$!}lSu~yJ}F5(ql zmp^J6HEQ}-UWBRt6OH_Q6=^OO0|I z-DEUtmjq{?oA!Y{qeXf0M%hjJ8lSdvO7#g1r}DM3s@?p5n^IY^;8xQ$@BHcSBmXM0>9;J`tO4H|MdSqWXrApk){8mM7hTazWopT z{fpQaN9ezM@gJI2=vzMb{-0=CH(4QI7su(%`tPx%)ED@yt0y*N>gfJ|qk#WbF2fd$ onxg*Kp#H6bRsSzjvT;VGY85OtqBybicUQN{E6tb1&&`AX4@hPgX8-^I literal 0 HcmV?d00001 diff --git a/ipfs/img/reset.png b/ipfs/img/reset.png new file mode 100644 index 0000000000000000000000000000000000000000..e5168372f4647947b6ef3f3d5d97e259100a9ad2 GIT binary patch literal 8506 zcmb7q3slls*S@`7tQ>V3wPw85G-cU^CQ~vsr~8zplZBWXW{sJeVmd0INRzjj8ndR1 zQ53tGqab+6zyeIoFcq0fMN=RoAw>lwM8V5n%50Jd5af;7AN7#AHcswr@asCHJXL~ZnH~nfR-h( z-=By#GBUA%KJ$$73%&%6#y=fAvd>s*y!i9=Yqoz7(~XQ)8Xerb>p14kh)|qUAiz4P zbe`__n``{PS#x4-(}3Sp?Kd0Tz72kO!DONRcNR}KSuR*qW_0AU;}>VMM9aUY<3lak z&VDt2!u(e5JN|4%;nSe+_E8`IzHHaK%N>_32_s{~uP@(a2A*gwMBV)DR>$U~v*U$% zx&jT>DCF6eor{Y!1)4%QNZ`!}Jf9P11cwZ&GFyK1VH!rg`EidhT6rzZ&CV z4};S?Z0&QnQgxZ`5KjU%(Q*H^X`!t;8~#g^=SN{^qyMV$?Z4Mn{^jiWFA|D#jO_~LJPTG&nho8ni*L4kp|{+8S*i;xs` zZ*-wg$?#A9{xUhe%?jToVkcj{8MZj=MB?-3&u=l#N2GiUPfFyhyL@+}x9>%%`mqY~ zZvWU0FzpxWT1TCagIDT@eC@!%I~Sk>rEbNUKWVg9qMU#JLtW4Nv*%HmN~|fEGNfp- zr?NW&XS)n{qEMJ`adVCG0ZS@7ee}bJ>-b~GZZLQzutjv>DspUgaeG1DlZT>Bf+_Wo z3=(ZYTQ7_gm;`IMHje~=Aim58*36mAR-0nvxbxF|o^*+zyR0*EbQ^&ciYo@ZX>chC z3=GUCOb$34&hrx8_VoQxqE3(M>Kw_s-{wq5@=KH$4@sHp;vh|%qR~dzlFhZb?s!VN zI1qe)o&0u}1wecWvL+HgKHM`MaMZFF%rd7-dx|{B;U*N*q4zKM7{--FV++=!U?TlI z3Zyq8gpMN6_%qF2Pi%nFHsvM#W$o;(e3mH-@(fFYi>a9GJ2#TUnq!!xtjs*nkS4$P z-b3`c=RDGZzuq{o?ykEGC?ksX%uP(#QP@5_oHu{mn7?6@J^B~2&3TkosGJ#f_T5>l zFfpw5h2RqX;F)`rJv}Zy30oR6@}d*kNTyuFaJ9SpULW!R#S@DI6lX~=@R*bj%s-bs zv{_g_ed{W;r);h=SSgI7>k!mg2F9>y6SOPfwrBy(E@|(TK&5L`U9sF{o1+80w{G5~ zz4#QXq$oA=Aob6hOOHAuulAq^v0+~G@ARlKBjattRCsFjWIt{Hy_c2t+5q$1#3MeV zg*#KH-n$q!+3^o>Ewpb&@`4c2Q~s3NM%;1fq&>AtJf=RxJJ<>-D?!%jwcNDs33e)x zk4q6+RJ5eFayPg*+9}5dGNP62Bw3`LD_a}TJJ<8vhJpDNQ{r1U+fnST30G7MmUH#w ziwK0$%~1XbwQQSXs`7vrPHUcNMYG9B*J2(D_^UNH$JjmFJ>l1z**!hZzI;9`<%cX} zXV*P<{w9A!rF@w2Cb{son;I7%AD;A^Q?P^CQpHQQd^yGS3FuqL%DwG&0k>jvu(cOq zraxoHd5ogc&9@Y#>njf`8m$mVDmUHAw-JpquT7&5RM=ptahmdXKNs z5fP;+((Di+RgqbT)yU`}*nuo@HAk3?*m=QwAjtmEQD1sT0frS|c80`;(}m>8y?g%* z9dVZrs#v$(8fu1y2GCc!80+$RE0Qi7yZnX^uQL_Awv|Ly=X6JHvt~4-OQH z(FvBTqVNtMQsDlkampU_J@qBoVnJvYReQ2`gEANM17g(E5d9N4@+3RjuGMgCl6U(f zSh``xGVHGSbVY^hW9^8@qN=PcpX6?MIPGc;J9jnK&VLgO=KBY6)D!&`#c612@=ADk zIDfcOoT=2-U|oWk<3SYr(sL-iDka=M`hgx>FH0E}zdkS7arv4s6y>U{>2*%pmudZD z^BXit<8k2t6Ssy(d1jc9l7fl|Grh(k$s=BM>!0_F3FBNDI}>Pp^mxhZLCl)MTe^2Q zo^S#Jm>&p&AY`4rC4a`5pNo-_Pp%JU|1QgJvv{oSCCF;G(qoxR1c6yp?2FbXctfI; z2N&y`XL73(oBhS}JgEThNKEw+U-MK5kBH}$*AZe+g-d;O?Ewq$V#~vh964g2N8TAHoKox6Dcd9CI~Bbu89JI@!cC9z zvjNTiv*?8*Z*}C!An^v51I!1ORk9q0|B^TL!|od0Ip6s7s1ZtUcg{V&#JJ4v^jyT)yJ@DV<~SiBad}K zY+2an@Bq>=X4i+c?q{ntiw0_WwCR66W1Szy?!Fq!i)$o>qhM=(gfrw@3+pcM^DSvT z(HL;@3xc%aOANf!-sav3bcL&2=HbE`lHCd=V@Yaz{i(v~vncz)g}gzL#`S0)N#vm^ zQvtpHC_G!2AYI5?Msqul)3i}uY1W_7yvhI$CrW_qR_V27b~{urOkf4g+N?faYuUw`ymZPnD>K$*w(v<^%^y;Gh5SNQX}fnt zp2y4&%}b3%r&z(WYkONW)(l{mxZY4!xEZC-N5_)ss(0?NUCgD(RU2$EeioDk;f1zrqYMrqI*8uA(^twfkx#EVy&%F-ARx&X|u5 zK()hr`eemzIMR?voyCMd68Zul8)N$*LyP(q4& zrP*p97jZQfaWaz%d!fnfcd^dyfBN&Zaa=btyuEFNAB%G3)Z>0hZz)eXNQQ4zsw8Rf z`0isXV5pr$sXo&-Q#^t&{rblYQ~FXmxY7nHN@yWe^YTZ%01qStWzR@q|ODUrJ4WeS_mD1JimX`ufPWJk|p24@%3sq-WR+HKEOq%Qp; zN!f7$gwJZVUn+9lfYvkZWSsm&gxEc%y!XD!$tW|F7zGukir;#rtqLh)%5 zzp^*gySJ+r4NQJ}@z1U#kNc{eqh*`5YA&3y)R?THGY)-79COEShsdY=^Bqu(xT^?D8)UMFdh7Gu{YCSNbp;L`ud zYCYngtvC9d<^dPHLQ+wKpIN6-3H4y}@br^ZyZmmx_4ufrN_ityt-m$4Fcmu~IawYP4#Z2?b_ zcS=hu(?+LY#TT?F1f_H1mAe!B5#&i}*xNNh*UJw$e(5jS(T%*bLG*k;z0@m|c!Ie+ zhgEOwFA3boxa zTS$R%XL5aobt>ssZak->(x)hOw)PLf>M#96tXI%L{9k_Nl9L-(5vn1;?tKlX~xqVS%Le5qQmjhp(4|G50X7AmR~4CW)JhXRE=$1ATYmVHKvwW4{T zs>me8Vn`o}6X51MPsxsd!656?t2jVA-e^-YFf8F(O_Gwlx{C-NRc;*TPvls;LbwPT^?eu~%W6PQZ(SnbUb%aP@r&u)8f48r=J@Es#;^(Fd}?8?m7-Oe z{oH#n)Z$y(frtQwBEhgw@fhhv>I2U0#H=q^4FZ~t4O%8RCrK1!nFm=@EVGj0HZE$6 zoXFUaBTp$c*o1<)Td0{Kz~pw~_fBO1j?T2lpw}@tBT9?fLaiB3rvRs?N8JaeMp=>p zZkXE4sAUS=M^il{fr`rs0Anj!LoP6@ojBxaep+`s29S9PQr>FBIt5hwDi!1sCR}$v zgz!R^fsvZ%1#)j_fd&Lv`vj&Tq50F7zp)3{>^>0!9CKFJ@A(Nz(R&Zcj<4sCeFl&f zea=oymfecA%bPy*Rwt~ec>0}*ldHid|M3HTb% zq0*2c)9~4CT_5oh24evZ0zD5cdi=Qp90NnUgmY*ll!uciWqwo$yKQsWolGuGdAc5= z=^X9&JOtBU`PD~NC4utGi2zFN?a@1|1^D+PPQb-W1Tjv~@XqSJbIS~+l!{C;J3-9h zfeJ*Oc8HyuQqCa0dR+h+*p%oa_ufKvef@c>9ym3PM(H)#e-dIQDI&lHo;1212sLer zk1wwWiaG^nA>{m!?csoNcQ6e#i{=Pz7YBexUlcjas*9$)C4o6}>YCL8`S9&s zok^a5mIeJRe!ZDgl@g>qipqF|t;p z#7(Cr*kk2qz%!8nwI?zka5(iU?nv>(U%wg>K3%0ZRMU6#Q0ao0&r6)8E-Y-dcSm_Ph7`hu3 zy=5u_3xenatT8ZaJ3EVf>g?=(a0(aQfU{9`W`@J*?6W9LDWAxd72_2qzi=6xdPO)%hDGvLG7%6#7<_EA2HdsxDBv}t#kOm}P(6wUK}5Nst1e=X z7sb8F5>K`>>T(UN1&vBser$983e+an4M#Dl00N?5{OxOBubP`scTpBZ-*?Na%ssaY zS*rd0JYHe)7;v&<{F`L4LF9#f#j@O2kvFD>5{0`nR~dfAO0ru>MIjUW&G=uYGVKXd zHjFm!qub6uNMXr~yi!Y>E1*o+^pxG3DYdKgBpVlP0MEP0K9B|Jv~`AsETr;o5{Y3T z{pSONP$8+?$MbhF=U!;`gX|eS>?{cSW~joi zgW;;@E?G#{hgZ5i5QQ#CqG6(Yp6Dee0(({iaTIHobHsL~3}&wEZ))|$cz4gdf2ml& zlL&R-30onqtSqZE$LDfc@8+b6ENBfi4j?7UGRz9=)A+UZG>eDk4(nuV%$0YFJdQWi ztUwoo-cD3I-)YqKN1nG{G(0?*rqLi}hf|edGc)xdC)2pW!>3Yljjii%WPLL<-LCZT z>H_a@E84UW#S^EI8Ei}xE~YYvmMqS5fi1zFMFIPB^BaTs@o#^!ddPv>)P}cbC~kWY zj`f#sPgz7T%JcHw;+??ZiS?*bH;=4qNPPohiC_qn4-kpY$8u&ysgpKr#>*s9ZfyB0 zkiE62N;41C!1YO|7l82N5lGYuvLOy`kJFpH@%3VB={)iKoqJXWWGMaw89P=C8xeBk zsAtEsXBM+HLUL__q@ihv25#$HVfLUc1dW<}iab0=l?+tlixay*+YK(w;4Z zY3#oeDyk!9a60S!MnzMyEDxPJy!cH@x!HVvqOia*AS3D|o3oR3x5pzZzmYeU=OvG5 znn&sJfM-eU5@pH_AlFzMwKYBJFtCip!|YB}b%G=i<>k4b;tJ}Hm57qhhDwGE558kQ ze~)F^pkI@(m2-doqhU(O!6&zp&>Zb`#B$maj1*+-%W%7|O3TPUD|Q*mh&>l(5HhQs z?B@7@wJ8`}$(|*G>sUMUwQ|JJ-hWSHsGH@JfBJ3xnqX($@-(p8xP9_) z=tWADQ*n9}734%kTRc}$I!>h_m|a}pNl>c*d*{}zTQa+>L#E?hLoDlZ;7<5bph>6tHMlGUH6)ZBP~~Q9_FO3p8SeX+Q@#Fu zR`vFfNQD)EWgpMskh(Aan8B|45Oat5Y0XA^m^G9-es-M#Y+m^VUFwNP9Y=v}+4_8wM`@hZ2QB*Yx(WD5$Kon&8oZF6r)3+j?@i*r zj?BMic->Lw%wWdKncnzI{-#w>fYtx(*E50Yxx+j<4~pupS6X5U8%d)oV%dj%UFeqDqno*aA<(R@4DIdcz;trcK4DT zWIRk>C(#dm20IHCtWa!r&CIPoPQQm*T;^I*MElV-y@fomCuG0Si)f z5X(-vG#;u1_kK3WhrmV2%C=4vI!`e@oAj=Em7=w^9k@7$8#Hp{@Zl7%h+goWTgi4R9X?Gq}S&mGHiMQ&R_yt$?%=(?F}8qFqtTn#kphXh6**v5ciqM)SH5KvJm z70)MtZnYi??O@DjL(OuXq=3Xhd z>TPCje)ODQ?%V}d>wh}BCRKK$Nx|^2<>U#1Z-!{pO&B%M)DffBx*srAcpto#NO-S?}U95SGc?R;Fn=+g1nW!iNOE4$V;C+gK$8ohScXXM(}-Wl=X z^;e%y(`#r*@g=>NS-qo$?61>r-8rAXZIx|owpPETBxs;|sIJcV`mIf+El35#mBh)` z_YE(s31S&-)XS9Bo_&X~APl$AlfKVNal6R-c@>fPCz4!fS>xhEROo_kB_o3`oM^U*yrOjC?1WWmrJ8X?HctCiv~_PZ(mzY%@@}2@E}gwLt@Ia@YH563@JGjEYqIpR zq#vv0RBEr9mE0A7Txk3k_{k%~x0RDe7dY^b5y?s8xAj)n2uzJ0S3uofG zKP(E`Hf$4{FE!J~TLx}+$4zT5P@0qoQC=S=d;O2cP!waFLK zi7)yq4A+HP%8%T2Hx!o*`r^@_M0%UdJ|>HdGl~>`9Ws51$GRf@vvp4Lu+4wVsHwOk zyEo+4nrxQr+NSr9IkMh!3$b|#3$EuK;1YU%i1PZ(U~FY&P&szNIq~T$Hca_Z>D-!4gnPjZF&MvOMnE03@B)RCF zoOfF!s66LO^Nbzn0q=yh4Bj0}0@xZ0B%{nLwUqOYBtI zO>tS@B2^s2e%9aFMx0#3BCKT!PiI=g-Z3(}pg3D_cbVj>ppw+VvkTwy+(Ufy7`vuN z)u4dDIs01X=jydE%vOFEWLLFj#?)2q75e3Z8HrTA8OsHgmQ?M4EZH(Mt_J;BnLOxm zOm?H(;@bPl7vx@7mi5$8-xbC7lqI}1?$MXr}_a^5m?LKhj zT-3U0Bn_=1sb`WUJ6fI}sLO-worRf&$AmryeMy?x$*?%jQoMG(?y(c$MNaCkVE1x% zDz-AN&_f)|I9D*>L0ha6e5XT?{{-rV&F;EQ^b?m_5(y7+2{N3GwJ}T{zdJ2%mq2H= z@lNr3`{2vg=<=94Z3>Ou-#9_gqmn_{5xHu7Aoox-d9vzrd1t(02To@WYLtw@_G~^% zY7`CeAZa{Ycj}WIMMKwpBt5(bB#B08tej1?Fgk2$E7y5A?S!Z05A2H+CDQs#y@fqw zf~!99(tW}L32xvtWZ+U4v#}-6b+3;C?=+L{g?KNs7uVWLSfatRy8(Ec?TYd!5f!PvjnAPcaQu6<@LwBzLcy?wApyfV=A z>b-GA8zZazbss@6AH%%n8_#5W1UnLSJ)`qxKdM|Z0VSD$)~3;Cq_b6%mga_KK~aHC zAA!<1!XS}#{nJ*a=md5Mf_Qi@ak<#RnK_NhBUm}Hk;-d8|(lgM37G0XNc{&*x+x-+I7A9 zh`y+`o7ZLaNE$8_O-TgZCgz(&dZ-vdc(`BGt_d9Leul}Lk7wmIy35YSGpjtrt7}3R zfmn9WK&%Ssd>7pU{)APj^jDgDxFg%)-t+Z8tSlq4?%;d-i3D4tHNPLK!u@q_vqqIJ zUkooH4Qd_wl;f;3p+SH*myI&=LXKPOgIHULw9v`^lQbQf(HQ~zAFt8n$bW$Vl{<-F zR9q_QnYbqQbxVqp?z|LSx#MjZ@Ss9=#xVRYztpr#ylZOQ;pl^BE{Ny z`)gikh8k@CsO@{rA6*cA(e^tYB@+a8yfM8^6!``>5f){%prFU@>>E9cxzX$yqcGlhO$(x# zGR+&*d+841C!DTYyD`^X8E21#sE!F7QY?wVg@Zk>Q;2A*dKAK+g`H8Rzpv_7oO7g{ z;bDFt*QP$aa#A#Y<;!57@dY2*R7OI zD{KTI2*Iyf|8!1Vo4YaVNR{q#9uqR9j3~4K>F0Eve*D|KZ!*o?=ZYFvnozx_Tng0r zh$@Lwkqy>y$0js@I1c={(ov>8qqKa{@mx75svE=YtYNu@F22@cLD*aD6QtoF+xg_% zZHi+vSxpZz#RU;*Sf}yEsMqA>)>I^P@-Ff-txnnZcfmoCfH`hfQ10plpnS`FgU3~{ z;~LtofXvqUTXb&anfOjDv{T#4lHb+c4<^S$b)L&U+9mu$LKUBh_9N$0*;8)3Y&hVJ zJJfBaqDfXj$@J2c$ceLY{5&oT&kyV^Iw*21Cixh!s6MGs%-TePCu21gHIkU!s z3)Cmq(%gFm!d_Q}AHh>r1>agwHBVS5Ao4!v#2xHp0-MSRQX<$O-qFH7hhnt3 z(ZWbq*qz((u7QX5$m=;b*efJloqFaIsAMu?P8N@$cuk^Y#Fw*P zq(Vu5Ws0Lj_ex?ZcH!gA7W$TC(0-J@`XV>Wgd#}`K+P4%WCb#D8KfZSzQFz+t@cF{ zCvl|(v}v$%@E%zFVBY@MIn&|C^E~|OXGP-MP8f`6>jn9}?#922Ya40aAfG`y^cH-8 zYKBD6I2B6a{yqdkVsH?G-gKghj5Xa#Cz4ss@)_K{mTKlFqDHN8!{O8t08Hi7p9IQe zs#aM8PYf;ti6`^!IcY){&rJMBHvWldX+$#kP(k7|?!)yFxABItrd}kxeJas&@7fciasy(hiY+kk50$>c%Yr z9$jQ<1p8%=>YNWeYP>HIoa^~Gq>RZ^{nKdWUntXD7V2iBBHqw6FiNH|oMw`^#bvq8{kY>CY>*%Z_^uZUK(Kz2V{Zu?m#l zp&Nl#*RQ#9Wi*v7@+eAUM*(&X(Ws6bODPB|I}kx{SpILut7-C z&EG6B6PRc1MhO3y0D7$7yRWqU6nDL<-HD*6q~h%r{Ex^)S=|z{`X<1&b1~1~K(O{M zh-Z_sJ*h_dBE50IYx%gC6&yfdjuDD(f)*P z2<*?>#lM3BR$4aZK6G*6)uO41!n%A%QWCtQ?s~elDJL(56j?S#2+dSD4sgZgXFg%u z(ugAVg1e6<0pEa&e)yqivm>@v{7Y*q>RH(!=^Uz#KhVxAtsJb5f_wA(mIGQGT&MG? z5v7O4YzFxB^O<=dz1TJlThTFNva8qUVYW0izPk{o6~2)Z*6&(B_Z#oT36lZgIfBan zN345BiK{)ByhO$IHjzeW^iNvK4Q<8SU|hF)xU1m$7lYgO=jBHJ1uAFiwPf1%xSDtts43t$j$>tdB1ZXappgA@4D)@FD1Pw;Dm9 zLgQ88-OHg7Q8ar=`=yH92HEUyXC8522zD`H+wQT)q9||VLpdqJL@pnmX;hG z;qD=R=K10aWXdT1t4Id#^s7C7w(f_w*wXw^d!+EkHOmUrK@;I`Woj_rEQ8m0Uxwbdp{%*h3yO1p_GRQNW@D*RR7BLv@fV-)#Nphk8h^?m!{w#11Eep@NU{{yByd@_x+f@UTmhx1! zINU^mC`KKv4?vZ5AZs~$8d7sU3mV#~TE(Gw-1XI;gFd+hcu_RuQE(~s2M7U;BTfs6 z_ML^o3wf>$C!ISOv=y)rcsg+dEgNUhl!RXZ#{~840H4q8Dl=_Drfiq(FO_ySo32+D z{W5}0@^Wy^iV*0`DFGr57yXC4 zUOWi8%1cBb^MM{@*75P(Z{mbd4T)fB6EG>|uf}3y2(kmndgY{y4|Zz;P=zz|G`-vT z`L8eBHsHVoSNnevZ@7Txd8#y}V4IhgyESH6kOmq~Llm5{Ea{OAzAQMLsST2q8gu~Jk!a6&a zaRU+IsOs^Rz_)DBtqn94&R)(L6Tv#Pv2P_#w%~>9zbI3^Zs*E*Sz6l3X_(W8lE3_Q z0Q3!(YTdUWR#Vt_UFwKg+@d9sOJC(9#uV4p3dYC?fYHi@7}VF6cSzG?n618GK=Wta zFSRzpU0=RkUs+!Js-Y)%I-c@AqK~>3qRKE?-~0`yK$0zys?PfhoCi+$?N&!xviG-k+#)RLi8)UZ9aKDHC8Q`DQX%_z5$KEa9` z?45u-t2=#BP+LWk$Fx(mrDUza4N%AS3_7-uf%8jIAJG%z5Xrx`)7J;R|F)L3@LV~f zx(f$Z?*V-muiV==AH9FuTg=VKV4j(JWAGMRzvAu4qEdSr+^3A?IMp%1%sbGum1=x< zQ`Q2QtI%Sr*2dSL8X`e%$P&Lw)#l7Ryeui$cq{ABtX(lzfMjCSIl0Q@z`5o&^ak;M z8S>FihgMFCZ0<5BUxQN2YB>)8S|QLbogxBLYK^k&CfN7!7Nq|rOvOd@^$Z!ifN*@n zz_jXzC{DvAEI=saRceTs0$&8jT4uzDz4*Eq?9|C*_id33)&7ipUfpo0>y3&htH8d5 ztAgHdDHKOQE?pn>BAKF^S9+VIC-WFa3sCPm#Gna=9#ct!Ri7cc_dVL{i|RKNBf~ri zP`_3 zwbTxivo$H1+MX@&>C*7F(2(e9e+1?l*8l3G)eJdx}5 zF*IJhhC-wEGYZ7ZPxIIHKE^(t4EPqGbxX*#OcdgX6 z??dwg-+}7l0B&%su9fZ8-_X;us|kiOFic%krCnwMyy)RufV^V*DE!Ajf+(ISA|fJk zxa^^9wwlgXOLVRIS=dGPK!~E3i#1xKF-#6BsGBFpuLv}ydEZWH0aSJZduOsJoSl#{ za9QBf5PdOp1c05oHAe-`wk>S zbI>P<6(6po=*GaiSj?8gezE-lfiPt{Itw6_&S?qX<@6nVE!u4*t#f!r3&W{rXgGx? zhkkXc_lf%9;$MgXhnXf%s`SU{Z*-CP9qRbgJ}|{+%D&R4l!5I3o96y6O>@tpX)fz# zz}lzfZmXu7AAPEhK!B6aMy6~8PU7LWSBxIu^Zey-F)$H`-+aHVSzC%RD9rGL$KzWU(t*XGzN>Y#{oLS2z}i4!PU|(bb{h`^F2S|%P3V1>TVLGbMEgeW2-^30 zQ2p`j1W~S6RmS8!K2GD%&xuENi>0aEEECj|+QxdSKimUvIJ!(U&rbgBZONO37>SQ3 zSbO^)&5vkLU{5IWr-lPFuLZCu$1DgC8w&q2CHRNaeb=oiG@i?2@BY* zMVs!@mfq~TvD&s0?(cNdz)6_B?Rjf?9nbemP1*MLJ8IX)Z_3}aF(T9fE@Fn#>}n!C zo>G=C?<((@q^LgiswGirC#|3^U!Hq>Z&w}^QITmQ`9gAQ2i(eUhHul&n%Q;B_)QQN zfJVe56$tfF*=!unwF8{%f3xY=6eso;%-%ld>#qF8tD0m~b`LwJds0!Dbm11Ay}f-| zx`Fjri>_9rv%Q?KmxiMhP6Yb3_dmXzCJ>6joX=@ZPx znV|ni&)|-%aZ5|&``^bO3c{(4nG6k9sc^ElZ*Mjev7_2CkAzi-inKM=)*k^KW;h&u zOK|vI(cW@a#Svir+^bQ(_QQxluQs9qy+ay#&0P-I?fiOO@OU%xqt{=* z{NTVbY`90Uo$#vf!{V@is$P%V#DAsKcvtTtJ!HL^BqI_2mG>LkllpyP`koP75kT(o8P-S*_5wc)^o`B-e*^?Tv0mB0*07# zSz8-SnE5i&*?9T#W7wyu*bkHAm)RWliBC#WlGBt_rcq>D=}i+e@E_qSozr~6;ZS!A zBYXRD>@UO+x?l3Ojd(f;nT9iz4{wc7*liPph73$By3)ReQ(4-xVvp~4x;yF&iB?r6 z!G^GbJ5)P!a~XS)5S^rB`r#7R8gQ=Qc{O2TVaVQ$XY2`*Q3dx6)J*a|9(MAuF|5=YZTRv8J^vy zbC+^@8sI=3kEIgFsHUpgyY$CwA_phty=5LzasLm@}QU+7^uu?$BN%tS=JeC7R}-F2g1hX0doHA(ZKx zN_1g*4ng#Ys#U-*;MXOhk{;Wo!%Q#Q;oUqe+_w3a1<0cXDUDvrPOxve9^1u!!F2B(kygOozwrXOsKnrb2@ z9k=l?1@abmRkpesyyjn%4ZU!qC@Fl4PW@2B&3Lu`RAiR?T`md<@MExrYm&jX7xMZ> zn&nz2*H5tikH=()T?{8!J(({~0*dK;dn5YAha?(ndH2@R2{Z6Rkir5-I3HQ`tM6E9 zwx;?ETxSe*$J5QZC6$yPMxSXNR4dKAQ+L0*+i70xX5DcLX$jyTi+|#~-X#$;! + + + + + + + + Upload files to IPFS from Browser + + + + + + + + + + + + + + + + +

+ +
+
+
+ +
+
+ + + + + Drop files here
or + + +
+ +
+
    +
    +
    +
    +
    + +
    +
    +
    +
    +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/ipfs/js/buffer.js b/ipfs/js/buffer.js new file mode 100644 index 00000000..9f9e3c52 --- /dev/null +++ b/ipfs/js/buffer.js @@ -0,0 +1,2 @@ +//You can download this script at https://bundle.run/buffer@5.2.1 +!function(t){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=t();else if("function"==typeof define&&define.amd)define([],t);else{("undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this).buffer=t()}}(function(){return function(){return function t(r,e,n){function i(f,u){if(!e[f]){if(!r[f]){var s="function"==typeof require&&require;if(!u&&s)return s(f,!0);if(o)return o(f,!0);var h=new Error("Cannot find module '"+f+"'");throw h.code="MODULE_NOT_FOUND",h}var a=e[f]={exports:{}};r[f][0].call(a.exports,function(t){return i(r[f][1][t]||t)},a,a.exports,t,r,e,n)}return e[f].exports}for(var o="function"==typeof require&&require,f=0;fo)throw new RangeError('The value "'+t+'" is invalid for option "size"');var e=new Uint8Array(t);return e.__proto__=r.prototype,e}function r(t,r,e){if("number"==typeof t){if("string"==typeof r)throw new TypeError('The "string" argument must be of type string. Received type number');return h(t)}return u(t,r,e)}function u(t,e,n){if("string"==typeof t)return function(t,e){"string"==typeof e&&""!==e||(e="utf8");if(!r.isEncoding(e))throw new TypeError("Unknown encoding: "+e);var n=0|c(t,e),i=f(n),o=i.write(t,e);o!==n&&(i=i.slice(0,o));return i}(t,e);if(ArrayBuffer.isView(t))return a(t);if(null==t)throw TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof t);if(z(t,ArrayBuffer)||t&&z(t.buffer,ArrayBuffer))return function(t,e,n){if(e<0||t.byteLength=o)throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+o.toString(16)+" bytes");return 0|t}function c(t,e){if(r.isBuffer(t))return t.length;if(ArrayBuffer.isView(t)||z(t,ArrayBuffer))return t.byteLength;if("string"!=typeof t)throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type '+typeof t);var n=t.length,i=arguments.length>2&&!0===arguments[2];if(!i&&0===n)return 0;for(var o=!1;;)switch(e){case"ascii":case"latin1":case"binary":return n;case"utf8":case"utf-8":return N(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*n;case"hex":return n>>>1;case"base64":return P(t).length;default:if(o)return i?-1:N(t).length;e=(""+e).toLowerCase(),o=!0}}function l(t,r,e){var n=t[r];t[r]=t[e],t[e]=n}function y(t,e,n,i,o){if(0===t.length)return-1;if("string"==typeof n?(i=n,n=0):n>2147483647?n=2147483647:n<-2147483648&&(n=-2147483648),D(n=+n)&&(n=o?0:t.length-1),n<0&&(n=t.length+n),n>=t.length){if(o)return-1;n=t.length-1}else if(n<0){if(!o)return-1;n=0}if("string"==typeof e&&(e=r.from(e,i)),r.isBuffer(e))return 0===e.length?-1:g(t,e,n,i,o);if("number"==typeof e)return e&=255,"function"==typeof Uint8Array.prototype.indexOf?o?Uint8Array.prototype.indexOf.call(t,e,n):Uint8Array.prototype.lastIndexOf.call(t,e,n):g(t,[e],n,i,o);throw new TypeError("val must be string, number or Buffer")}function g(t,r,e,n,i){var o,f=1,u=t.length,s=r.length;if(void 0!==n&&("ucs2"===(n=String(n).toLowerCase())||"ucs-2"===n||"utf16le"===n||"utf-16le"===n)){if(t.length<2||r.length<2)return-1;f=2,u/=2,s/=2,e/=2}function h(t,r){return 1===f?t[r]:t.readUInt16BE(r*f)}if(i){var a=-1;for(o=e;ou&&(e=u-s),o=e;o>=0;o--){for(var p=!0,c=0;ci&&(n=i):n=i;var o=r.length;n>o/2&&(n=o/2);for(var f=0;f>8,i=e%256,o.push(i),o.push(n);return o}(r,t.length-e),t,e,n)}function A(t,r,e){return 0===r&&e===t.length?n.fromByteArray(t):n.fromByteArray(t.slice(r,e))}function B(t,r,e){e=Math.min(t.length,e);for(var n=[],i=r;i239?4:h>223?3:h>191?2:1;if(i+p<=e)switch(p){case 1:h<128&&(a=h);break;case 2:128==(192&(o=t[i+1]))&&(s=(31&h)<<6|63&o)>127&&(a=s);break;case 3:o=t[i+1],f=t[i+2],128==(192&o)&&128==(192&f)&&(s=(15&h)<<12|(63&o)<<6|63&f)>2047&&(s<55296||s>57343)&&(a=s);break;case 4:o=t[i+1],f=t[i+2],u=t[i+3],128==(192&o)&&128==(192&f)&&128==(192&u)&&(s=(15&h)<<18|(63&o)<<12|(63&f)<<6|63&u)>65535&&s<1114112&&(a=s)}null===a?(a=65533,p=1):a>65535&&(a-=65536,n.push(a>>>10&1023|55296),a=56320|1023&a),n.push(a),i+=p}return function(t){var r=t.length;if(r<=U)return String.fromCharCode.apply(String,t);var e="",n=0;for(;nthis.length)return"";if((void 0===e||e>this.length)&&(e=this.length),e<=0)return"";if((e>>>=0)<=(r>>>=0))return"";for(t||(t="utf8");;)switch(t){case"hex":return I(this,r,e);case"utf8":case"utf-8":return B(this,r,e);case"ascii":return _(this,r,e);case"latin1":case"binary":return T(this,r,e);case"base64":return A(this,r,e);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return S(this,r,e);default:if(n)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),n=!0}}.apply(this,arguments)},r.prototype.toLocaleString=r.prototype.toString,r.prototype.equals=function(t){if(!r.isBuffer(t))throw new TypeError("Argument must be a Buffer");return this===t||0===r.compare(this,t)},r.prototype.inspect=function(){var t="",r=e.INSPECT_MAX_BYTES;return t=this.toString("hex",0,r).replace(/(.{2})/g,"$1 ").trim(),this.length>r&&(t+=" ... "),""},r.prototype.compare=function(t,e,n,i,o){if(z(t,Uint8Array)&&(t=r.from(t,t.offset,t.byteLength)),!r.isBuffer(t))throw new TypeError('The "target" argument must be one of type Buffer or Uint8Array. Received type '+typeof t);if(void 0===e&&(e=0),void 0===n&&(n=t?t.length:0),void 0===i&&(i=0),void 0===o&&(o=this.length),e<0||n>t.length||i<0||o>this.length)throw new RangeError("out of range index");if(i>=o&&e>=n)return 0;if(i>=o)return-1;if(e>=n)return 1;if(this===t)return 0;for(var f=(o>>>=0)-(i>>>=0),u=(n>>>=0)-(e>>>=0),s=Math.min(f,u),h=this.slice(i,o),a=t.slice(e,n),p=0;p>>=0,isFinite(e)?(e>>>=0,void 0===n&&(n="utf8")):(n=e,e=void 0)}var i=this.length-r;if((void 0===e||e>i)&&(e=i),t.length>0&&(e<0||r<0)||r>this.length)throw new RangeError("Attempt to write outside buffer bounds");n||(n="utf8");for(var o=!1;;)switch(n){case"hex":return w(this,t,r,e);case"utf8":case"utf-8":return d(this,t,r,e);case"ascii":return v(this,t,r,e);case"latin1":case"binary":return b(this,t,r,e);case"base64":return m(this,t,r,e);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return E(this,t,r,e);default:if(o)throw new TypeError("Unknown encoding: "+n);n=(""+n).toLowerCase(),o=!0}},r.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};var U=4096;function _(t,r,e){var n="";e=Math.min(t.length,e);for(var i=r;in)&&(e=n);for(var i="",o=r;oe)throw new RangeError("Trying to access beyond buffer length")}function L(t,e,n,i,o,f){if(!r.isBuffer(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(e>o||et.length)throw new RangeError("Index out of range")}function R(t,r,e,n,i,o){if(e+n>t.length)throw new RangeError("Index out of range");if(e<0)throw new RangeError("Index out of range")}function x(t,r,e,n,o){return r=+r,e>>>=0,o||R(t,0,e,4),i.write(t,r,e,n,23,4),e+4}function M(t,r,e,n,o){return r=+r,e>>>=0,o||R(t,0,e,8),i.write(t,r,e,n,52,8),e+8}r.prototype.slice=function(t,e){var n=this.length;(t=~~t)<0?(t+=n)<0&&(t=0):t>n&&(t=n),(e=void 0===e?n:~~e)<0?(e+=n)<0&&(e=0):e>n&&(e=n),e>>=0,r>>>=0,e||C(t,r,this.length);for(var n=this[t],i=1,o=0;++o>>=0,r>>>=0,e||C(t,r,this.length);for(var n=this[t+--r],i=1;r>0&&(i*=256);)n+=this[t+--r]*i;return n},r.prototype.readUInt8=function(t,r){return t>>>=0,r||C(t,1,this.length),this[t]},r.prototype.readUInt16LE=function(t,r){return t>>>=0,r||C(t,2,this.length),this[t]|this[t+1]<<8},r.prototype.readUInt16BE=function(t,r){return t>>>=0,r||C(t,2,this.length),this[t]<<8|this[t+1]},r.prototype.readUInt32LE=function(t,r){return t>>>=0,r||C(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},r.prototype.readUInt32BE=function(t,r){return t>>>=0,r||C(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},r.prototype.readIntLE=function(t,r,e){t>>>=0,r>>>=0,e||C(t,r,this.length);for(var n=this[t],i=1,o=0;++o=(i*=128)&&(n-=Math.pow(2,8*r)),n},r.prototype.readIntBE=function(t,r,e){t>>>=0,r>>>=0,e||C(t,r,this.length);for(var n=r,i=1,o=this[t+--n];n>0&&(i*=256);)o+=this[t+--n]*i;return o>=(i*=128)&&(o-=Math.pow(2,8*r)),o},r.prototype.readInt8=function(t,r){return t>>>=0,r||C(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},r.prototype.readInt16LE=function(t,r){t>>>=0,r||C(t,2,this.length);var e=this[t]|this[t+1]<<8;return 32768&e?4294901760|e:e},r.prototype.readInt16BE=function(t,r){t>>>=0,r||C(t,2,this.length);var e=this[t+1]|this[t]<<8;return 32768&e?4294901760|e:e},r.prototype.readInt32LE=function(t,r){return t>>>=0,r||C(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},r.prototype.readInt32BE=function(t,r){return t>>>=0,r||C(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},r.prototype.readFloatLE=function(t,r){return t>>>=0,r||C(t,4,this.length),i.read(this,t,!0,23,4)},r.prototype.readFloatBE=function(t,r){return t>>>=0,r||C(t,4,this.length),i.read(this,t,!1,23,4)},r.prototype.readDoubleLE=function(t,r){return t>>>=0,r||C(t,8,this.length),i.read(this,t,!0,52,8)},r.prototype.readDoubleBE=function(t,r){return t>>>=0,r||C(t,8,this.length),i.read(this,t,!1,52,8)},r.prototype.writeUIntLE=function(t,r,e,n){(t=+t,r>>>=0,e>>>=0,n)||L(this,t,r,e,Math.pow(2,8*e)-1,0);var i=1,o=0;for(this[r]=255&t;++o>>=0,e>>>=0,n)||L(this,t,r,e,Math.pow(2,8*e)-1,0);var i=e-1,o=1;for(this[r+i]=255&t;--i>=0&&(o*=256);)this[r+i]=t/o&255;return r+e},r.prototype.writeUInt8=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,1,255,0),this[r]=255&t,r+1},r.prototype.writeUInt16LE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,2,65535,0),this[r]=255&t,this[r+1]=t>>>8,r+2},r.prototype.writeUInt16BE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,2,65535,0),this[r]=t>>>8,this[r+1]=255&t,r+2},r.prototype.writeUInt32LE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,4,4294967295,0),this[r+3]=t>>>24,this[r+2]=t>>>16,this[r+1]=t>>>8,this[r]=255&t,r+4},r.prototype.writeUInt32BE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,4,4294967295,0),this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t,r+4},r.prototype.writeIntLE=function(t,r,e,n){if(t=+t,r>>>=0,!n){var i=Math.pow(2,8*e-1);L(this,t,r,e,i-1,-i)}var o=0,f=1,u=0;for(this[r]=255&t;++o>0)-u&255;return r+e},r.prototype.writeIntBE=function(t,r,e,n){if(t=+t,r>>>=0,!n){var i=Math.pow(2,8*e-1);L(this,t,r,e,i-1,-i)}var o=e-1,f=1,u=0;for(this[r+o]=255&t;--o>=0&&(f*=256);)t<0&&0===u&&0!==this[r+o+1]&&(u=1),this[r+o]=(t/f>>0)-u&255;return r+e},r.prototype.writeInt8=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,1,127,-128),t<0&&(t=255+t+1),this[r]=255&t,r+1},r.prototype.writeInt16LE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,2,32767,-32768),this[r]=255&t,this[r+1]=t>>>8,r+2},r.prototype.writeInt16BE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,2,32767,-32768),this[r]=t>>>8,this[r+1]=255&t,r+2},r.prototype.writeInt32LE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,4,2147483647,-2147483648),this[r]=255&t,this[r+1]=t>>>8,this[r+2]=t>>>16,this[r+3]=t>>>24,r+4},r.prototype.writeInt32BE=function(t,r,e){return t=+t,r>>>=0,e||L(this,t,r,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),this[r]=t>>>24,this[r+1]=t>>>16,this[r+2]=t>>>8,this[r+3]=255&t,r+4},r.prototype.writeFloatLE=function(t,r,e){return x(this,t,r,!0,e)},r.prototype.writeFloatBE=function(t,r,e){return x(this,t,r,!1,e)},r.prototype.writeDoubleLE=function(t,r,e){return M(this,t,r,!0,e)},r.prototype.writeDoubleBE=function(t,r,e){return M(this,t,r,!1,e)},r.prototype.copy=function(t,e,n,i){if(!r.isBuffer(t))throw new TypeError("argument should be a Buffer");if(n||(n=0),i||0===i||(i=this.length),e>=t.length&&(e=t.length),e||(e=0),i>0&&i=this.length)throw new RangeError("Index out of range");if(i<0)throw new RangeError("sourceEnd out of bounds");i>this.length&&(i=this.length),t.length-e=0;--f)t[f+e]=this[f+n];else Uint8Array.prototype.set.call(t,this.subarray(n,i),e);return o},r.prototype.fill=function(t,e,n,i){if("string"==typeof t){if("string"==typeof e?(i=e,e=0,n=this.length):"string"==typeof n&&(i=n,n=this.length),void 0!==i&&"string"!=typeof i)throw new TypeError("encoding must be a string");if("string"==typeof i&&!r.isEncoding(i))throw new TypeError("Unknown encoding: "+i);if(1===t.length){var o=t.charCodeAt(0);("utf8"===i&&o<128||"latin1"===i)&&(t=o)}}else"number"==typeof t&&(t&=255);if(e<0||this.length>>=0,n=void 0===n?this.length:n>>>0,t||(t=0),"number"==typeof t)for(f=e;f55295&&e<57344){if(!i){if(e>56319){(r-=3)>-1&&o.push(239,191,189);continue}if(f+1===n){(r-=3)>-1&&o.push(239,191,189);continue}i=e;continue}if(e<56320){(r-=3)>-1&&o.push(239,191,189),i=e;continue}e=65536+(i-55296<<10|e-56320)}else i&&(r-=3)>-1&&o.push(239,191,189);if(i=null,e<128){if((r-=1)<0)break;o.push(e)}else if(e<2048){if((r-=2)<0)break;o.push(e>>6|192,63&e|128)}else if(e<65536){if((r-=3)<0)break;o.push(e>>12|224,e>>6&63|128,63&e|128)}else{if(!(e<1114112))throw new Error("Invalid code point");if((r-=4)<0)break;o.push(e>>18|240,e>>12&63|128,e>>6&63|128,63&e|128)}}return o}function P(t){return n.toByteArray(function(t){if((t=(t=t.split("=")[0]).trim().replace(O,"")).length<2)return"";for(;t.length%4!=0;)t+="=";return t}(t))}function j(t,r,e,n){for(var i=0;i=r.length||i>=t.length);++i)r[i+e]=t[i];return i}function z(t,r){return t instanceof r||null!=t&&null!=t.constructor&&null!=t.constructor.name&&t.constructor.name===r.name}function D(t){return t!=t}}).call(this,t("buffer").Buffer)},{"base64-js":2,buffer:5,ieee754:3}],2:[function(t,r,e){"use strict";e.byteLength=function(t){var r=h(t),e=r[0],n=r[1];return 3*(e+n)/4-n},e.toByteArray=function(t){for(var r,e=h(t),n=e[0],f=e[1],u=new o(function(t,r,e){return 3*(r+e)/4-e}(0,n,f)),s=0,a=f>0?n-4:n,p=0;p>16&255,u[s++]=r>>8&255,u[s++]=255&r;2===f&&(r=i[t.charCodeAt(p)]<<2|i[t.charCodeAt(p+1)]>>4,u[s++]=255&r);1===f&&(r=i[t.charCodeAt(p)]<<10|i[t.charCodeAt(p+1)]<<4|i[t.charCodeAt(p+2)]>>2,u[s++]=r>>8&255,u[s++]=255&r);return u},e.fromByteArray=function(t){for(var r,e=t.length,i=e%3,o=[],f=0,u=e-i;fu?u:f+16383));1===i?(r=t[e-1],o.push(n[r>>2]+n[r<<4&63]+"==")):2===i&&(r=(t[e-2]<<8)+t[e-1],o.push(n[r>>10]+n[r>>4&63]+n[r<<2&63]+"="));return o.join("")};for(var n=[],i=[],o="undefined"!=typeof Uint8Array?Uint8Array:Array,f="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",u=0,s=f.length;u0)throw new Error("Invalid string. Length must be a multiple of 4");var e=t.indexOf("=");return-1===e&&(e=r),[e,e===r?0:4-e%4]}function a(t,r,e){for(var i,o,f=[],u=r;u>18&63]+n[o>>12&63]+n[o>>6&63]+n[63&o]);return f.join("")}i["-".charCodeAt(0)]=62,i["_".charCodeAt(0)]=63},{}],3:[function(t,r,e){e.read=function(t,r,e,n,i){var o,f,u=8*i-n-1,s=(1<>1,a=-7,p=e?i-1:0,c=e?-1:1,l=t[r+p];for(p+=c,o=l&(1<<-a)-1,l>>=-a,a+=u;a>0;o=256*o+t[r+p],p+=c,a-=8);for(f=o&(1<<-a)-1,o>>=-a,a+=n;a>0;f=256*f+t[r+p],p+=c,a-=8);if(0===o)o=1-h;else{if(o===s)return f?NaN:1/0*(l?-1:1);f+=Math.pow(2,n),o-=h}return(l?-1:1)*f*Math.pow(2,o-n)},e.write=function(t,r,e,n,i,o){var f,u,s,h=8*o-i-1,a=(1<>1,c=23===i?Math.pow(2,-24)-Math.pow(2,-77):0,l=n?0:o-1,y=n?1:-1,g=r<0||0===r&&1/r<0?1:0;for(r=Math.abs(r),isNaN(r)||r===1/0?(u=isNaN(r)?1:0,f=a):(f=Math.floor(Math.log(r)/Math.LN2),r*(s=Math.pow(2,-f))<1&&(f--,s*=2),(r+=f+p>=1?c/s:c*Math.pow(2,1-p))*s>=2&&(f++,s/=2),f+p>=a?(u=0,f=a):f+p>=1?(u=(r*s-1)*Math.pow(2,i),f+=p):(u=r*Math.pow(2,p-1)*Math.pow(2,i),f=0));i>=8;t[e+l]=255&u,l+=y,u/=256,i-=8);for(f=f<0;t[e+l]=255&f,l+=y,f/=256,h-=8);t[e+l-y]|=128*g}},{}],4:[function(t,r,e){arguments[4][2][0].apply(e,arguments)},{dup:2}],5:[function(t,r,e){arguments[4][1][0].apply(e,arguments)},{"base64-js":4,buffer:5,dup:1,ieee754:6}],6:[function(t,r,e){arguments[4][3][0].apply(e,arguments)},{dup:3}]},{},[1])(1)}); diff --git a/ipfs/js/connect-and-upload.js b/ipfs/js/connect-and-upload.js new file mode 100644 index 00000000..09fdd9e0 --- /dev/null +++ b/ipfs/js/connect-and-upload.js @@ -0,0 +1,256 @@ +function updateNode (selectedNode) { + if (selectedNode == "remote") { + node.default = "remote"; + node.remote.address = document.querySelector("#remote_address").value + node.remote.port = document.querySelector("#remote_apiPort").value + node.remote.gateway = document.querySelector("#remote").querySelector("#remote_gatewayPort").value + node.remote.protocol = document.querySelector("#remoteProtocol").querySelector("li.active").innerText.toLowerCase() + } + + if (selectedNode == "local") { + node.default = "local"; + node.local.address = document.querySelector("#local_address").value + node.local.port = document.querySelector("#local_apiPort").value + node.local.gateway = document.querySelector("#local").querySelector("#local_gatewayPort").value + node.local.protocol = document.querySelector("#localProtocol").querySelector("li.active").innerText.toLowerCase() + } + + nodeConnect(selectedNode); +} + + +function nodeConnect (selectedNode) { + if (selectedNode == "remote") { + document.querySelector('button#buttonRemote').setAttribute('disabled', '') + document.querySelector('button#buttonRemote').querySelector(".buttonContent div").innerText = "Connecting" + document.querySelector('button#buttonRemote').querySelector(".buttonContent div").classList.add("connecting") + document.querySelector('button#buttonLocal').querySelector(".buttonContent div").innerHTML = 'Connect ' + document.querySelector('button#buttonRemote').querySelector(".buttonContent .min-loading").classList.remove('min-loading-hidden') //loading event + } + + if (selectedNode == "local") { + document.querySelector('button#buttonLocal').setAttribute('disabled', '') + document.querySelector('button#buttonLocal').querySelector(".buttonContent div").innerText = "Connecting" + document.querySelector('button#buttonLocal').querySelector(".buttonContent div").classList.add("connecting") + document.querySelector('button#buttonRemote').querySelector(".buttonContent div").innerHTML = 'Connect ' + document.querySelector('button#buttonLocal').querySelector(".buttonContent .min-loading").classList.remove('min-loading-hidden') //loading event + } + + var status = "wait" + + ipfsRequest ("GatewayCheck.log", buffer.Buffer.from('ABC', 'utf-8')).then((data) => { + if (data[0].hash == "QmNz1UBzpdd4HfZ3qir3aPiRdX5a93XwTuDNyXRc6PKhWW" ) { + online(selectedNode); + status = "online" + } else { + offline(selectedNode); + status = "offline" + } + document.querySelector('button#buttonRemote').removeAttribute("disabled"); + document.querySelector('button#buttonLocal').removeAttribute("disabled"); + document.querySelector('button#buttonRemote').querySelector('.buttonContent .min-loading').classList.add('min-loading-hidden') //loading event + document.querySelector('button#buttonLocal').querySelector('.buttonContent .min-loading').classList.add('min-loading-hidden') //loading event + return status + }, function (reason) { + document.querySelector('button#buttonRemote').removeAttribute("disabled"); + document.querySelector('button#buttonLocal').removeAttribute("disabled"); + document.querySelector('button#buttonRemote').querySelector('.buttonContent .min-loading').classList.add('min-loading-hidden') //loading event + document.querySelector('button#buttonLocal').querySelector('.buttonContent .min-loading').classList.add('min-loading-hidden') //loading event + offline(selectedNode) + return "offline" + }) +} + +function online (selectedNode) { + connected = 1 + if (selectedNode == "remote") { + document.querySelector('button#buttonRemote').querySelector(".buttonContent div").classList.remove("connecting") + document.querySelector('button#buttonRemote').querySelector(".buttonContent div").innerHTML = 'Node Online ' + document.querySelector('button#buttonRemote').querySelector('.buttonContent .min-loading').classList.add('min-loading-hidden') + } + if (selectedNode == "local") { + document.querySelector('button#buttonLocal').querySelector(".buttonContent div").classList.remove("connecting") + document.querySelector('button#buttonLocal').querySelector(".buttonContent div").innerHTML = 'Node Online ' + document.querySelector('button#buttonLocal').querySelector('.buttonContent .min-loading').classList.add('min-loading-hidden') + } +} + +function offline (selectedNode) { + connected = 0 + if (selectedNode == "remote") { + document.querySelector('button#buttonRemote').querySelector(".buttonContent div").innerHTML = 'Node Offline! ' + } + if (selectedNode == "local") { + document.querySelector('button#buttonLocal').querySelector(".buttonContent div").innerHTML = 'Node Offline! ' + } +} + +function upload() { + if (!connected) { + alert ("Connect to node First!") + return + } + if (filesOk.length < 1) { + alert("

    At least one selected file is invalid - do not select any folders.

    Please reselect and try again.

    "); + return + } + document.querySelector('.min-loading.blue').classList.remove('loading-hidden') //loading event + document.querySelector('button#buttonUpload').setAttribute('disabled', '') + document.querySelector('button#buttonRemote').setAttribute('disabled', '') + document.querySelector('button#buttonLocal').setAttribute('disabled', '') + + filesOk.forEach(function(file){ + let reader = new FileReader(); + reader.readAsArrayBuffer(file); + reader.onloadend = function() { + ipfsRequest (file.name, buffer.Buffer(reader.result)).then((data) => { + response.push(data[0]) + document.querySelector("#response").innerText = JSON.stringify(response, null, 2) + updateList(fileChecksum(file), data[0].hash) + uploadCount++ + if (uploadCount == filesOk.length) { + document.querySelector('.min-loading.blue').classList.add('loading-hidden'); //stop loading event + document.querySelector('button#buttonRemote').removeAttribute('disabled', '') + document.querySelector('button#buttonLocal').removeAttribute('disabled', '') + document.querySelector('button#buttonUpload').onclick=function(){resetFiles()} + document.querySelector('button#buttonUpload').innerHTML = 'Clean Up' + document.querySelector('button#buttonUpload').removeAttribute("disabled"); + } + }) + } + }) +} + +function ipfsRequest (file_name, data) { + var ipfs = window.IpfsHttpClient(node[node.default].address, node[node.default].port, {protocol: node[node.default].protocol}) //router to the IPFS network without any local node + var file_send = + [ + { + path: file_name, + content: data + } + ] + return new Promise((resolve, reject) => { + ipfs.add(file_send, function (err, json) { + if (err) { + alert(err); + reject (0) + } else { + resolve (json) + } + }) + }) +} + + +function removeItem(checksum) { + var item = files_checksum.indexOf(checksum) + filesOk.splice(item, 1) + files_checksum.splice(item, 1) + + document.getElementById(checksum).remove(); +} + +function handleDragOver(evt) { + evt.stopPropagation(); // Do not allow the dragover event to bubble. + evt.preventDefault(); // Prevent default dragover event behavior. +} // handleDragOver + + +function handleFileSelect(evt) { + evt.stopPropagation(); // Do not allow the drop event to bubble. + evt.preventDefault(); // Prevent default drop event behavior. + + if (evt.dataTransfer != null){ + var files = evt.dataTransfer.files; // Grab the list of files dragged to the drop box. + } else { + var files = evt.target.files; // FileList object from input + } + + + if (!files) { + alert("

    At least one selected file is invalid - do not select any folders.

    Please reselect and try again.

    "); + return; + } + for (var i = 0; i < files.length; i++) { + if (!files[i]) { + alert("Unable to access " + file.name); + continue; // Immediately move to the next file object. + } + if (files[i].size == 0) { + alert("Skipping " + files[i].name.toUpperCase() + " because it is empty."); + continue; + } + if (files_checksum.includes(fileChecksum(files[i]))) { + alert("This files is already listed"); + continue + } else { + files_checksum[filesOk.length] = fileChecksum(files[i]) + document.querySelector("#list").querySelector("ul").innerHTML += '
  • ' + + files[i].name + ' ×' + + '
    (' + (files[i].type || 'n/a' ) +') - ' + + files[i].size + ' bytes, last modified: ' + new Date(files[i].lastModified).toLocaleDateString() +'
    • '; + + filesOk[filesOk.length] = files[i]; //push valid files for filesOk array + } + + } + + //reset filesList input + document.getElementById("files").value = '' + if(!/safari/i.test(navigator.userAgent)){ + document.getElementById("files").type = '' + document.getElementById("files").type = 'file' + } +} + +function updateList (checksum, ipfsHash) { + var i = files_checksum.indexOf(checksum) // equal filesOk[i] + if (node[node.default].gateway == 80 || node[node.default].protocol == "https"){ + var gatewayPort = '' + } else { + var gatewayPort = node[node.default].gateway + } + document.getElementById(checksum).innerHTML = '' + filesOk[i].name + ' ' + + '
    (' + (filesOk[i].type || 'n/a' ) +') - ' + filesOk[i].size + ' bytes, last modified: ' + new Date(filesOk[i].lastModified).toLocaleDateString() +'' +} + +function fileChecksum(file) { + var MD5 = function(d){result = M(V(Y(X(d),8*d.length)));return result.toLowerCase()};function M(d){for(var _,m="0123456789ABCDEF",f="",r=0;r>>4&15)+m.charAt(15&_);return f}function X(d){for(var _=Array(d.length>>2),m=0;m<_.length;m++)_[m]=0;for(m=0;m<8*d.length;m+=8)_[m>>5]|=(255&d.charCodeAt(m/8))<>5]>>>m%32&255);return _}function Y(d,_){d[_>>5]|=128<<_%32,d[14+(_+64>>>9<<4)]=_;for(var m=1732584193,f=-271733879,r=-1732584194,i=271733878,n=0;n>16)+(_>>16)+(m>>16)<<16|65535&m}function bit_rol(d,_){return d<<_|d>>>32-_} + + var checksum = MD5(file.name + file.size + file.lastModified) + return checksum +} + +function resetFiles() { + filesOk = [] + files_checksum = [] + response = [] + uploadCount = 0 + document.querySelector("#list").querySelector("ul").innerHTML = "" + document.querySelector("pre#response").innerHTML = 'Response IPFS API:' + document.querySelector('button#buttonUpload').onclick = function(){upload()} + document.querySelector('button#buttonUpload').innerHTML = 'Upload' +} + + +var filesOk = [] +var response = [] +var message = [] +var files_checksum = [] +var selectedNode = "" +var uploadCount = 0 +var connected = 0 +if (!window.FileReader) { + message = '

    The ' + + 'File APIs ' + + 'are not fully supported by this browser.

    ' + + '

    Upgrade your browser to the latest version.

    '; + document.querySelector('body').innerHTML = message; +} else { + // Set up the file drag and drop listeners: + document.getElementById('fileDropBox').addEventListener('dragover', handleDragOver, false); + document.getElementById('fileDropBox').addEventListener('drop', handleFileSelect, false); + document.getElementById('files').addEventListener('change', handleFileSelect, false); +} +updateNode(node.default) diff --git a/ipfs/js/ipfs-http-client.js b/ipfs/js/ipfs-http-client.js new file mode 100644 index 00000000..c5da8a97 --- /dev/null +++ b/ipfs/js/ipfs-http-client.js @@ -0,0 +1,77569 @@ +//You can download this file at https://unpkg.com/ipfs-http-client/dist/index.js + +(function webpackUniversalModuleDefinition(root, factory) { + if(typeof exports === 'object' && typeof module === 'object') + module.exports = factory(); + else if(typeof define === 'function' && define.amd) + define([], factory); + else if(typeof exports === 'object') + exports["IpfsHttpClient"] = factory(); + else + root["IpfsHttpClient"] = factory(); +})(window, function() { +return /******/ (function(modules) { // webpackBootstrap +/******/ // The module cache +/******/ var installedModules = {}; +/******/ +/******/ // The require function +/******/ function __webpack_require__(moduleId) { +/******/ +/******/ // Check if module is in cache +/******/ if(installedModules[moduleId]) { +/******/ return installedModules[moduleId].exports; +/******/ } +/******/ // Create a new module (and put it into the cache) +/******/ var module = installedModules[moduleId] = { +/******/ i: moduleId, +/******/ l: false, +/******/ exports: {} +/******/ }; +/******/ +/******/ // Execute the module function +/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__); +/******/ +/******/ // Flag the module as loaded +/******/ module.l = true; +/******/ +/******/ // Return the exports of the module +/******/ return module.exports; +/******/ } +/******/ +/******/ +/******/ // expose the modules object (__webpack_modules__) +/******/ __webpack_require__.m = modules; +/******/ +/******/ // expose the module cache +/******/ __webpack_require__.c = installedModules; +/******/ +/******/ // define getter function for harmony exports +/******/ __webpack_require__.d = function(exports, name, getter) { +/******/ if(!__webpack_require__.o(exports, name)) { +/******/ Object.defineProperty(exports, name, { enumerable: true, get: getter }); +/******/ } +/******/ }; +/******/ +/******/ // define __esModule on exports +/******/ __webpack_require__.r = function(exports) { +/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) { +/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' }); +/******/ } +/******/ Object.defineProperty(exports, '__esModule', { value: true }); +/******/ }; +/******/ +/******/ // create a fake namespace object +/******/ // mode & 1: value is a module id, require it +/******/ // mode & 2: merge all properties of value into the ns +/******/ // mode & 4: return value when already ns object +/******/ // mode & 8|1: behave like require +/******/ __webpack_require__.t = function(value, mode) { +/******/ if(mode & 1) value = __webpack_require__(value); +/******/ if(mode & 8) return value; +/******/ if((mode & 4) && typeof value === 'object' && value && value.__esModule) return value; +/******/ var ns = Object.create(null); +/******/ __webpack_require__.r(ns); +/******/ Object.defineProperty(ns, 'default', { enumerable: true, value: value }); +/******/ if(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key)); +/******/ return ns; +/******/ }; +/******/ +/******/ // getDefaultExport function for compatibility with non-harmony modules +/******/ __webpack_require__.n = function(module) { +/******/ var getter = module && module.__esModule ? +/******/ function getDefault() { return module['default']; } : +/******/ function getModuleExports() { return module; }; +/******/ __webpack_require__.d(getter, 'a', getter); +/******/ return getter; +/******/ }; +/******/ +/******/ // Object.prototype.hasOwnProperty.call +/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); }; +/******/ +/******/ // __webpack_public_path__ +/******/ __webpack_require__.p = ""; +/******/ +/******/ +/******/ // Load entry module and return exports +/******/ return __webpack_require__(__webpack_require__.s = 191); +/******/ }) +/************************************************************************/ +/******/ ([ +/* 0 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global) {/*! + * The buffer module from node.js, for the browser. + * + * @author Feross Aboukhadijeh + * @license MIT + */ + +/* eslint-disable no-proto */ + + +var base64 = __webpack_require__(193); + +var ieee754 = __webpack_require__(102); + +var isArray = __webpack_require__(103); + +exports.Buffer = Buffer; +exports.SlowBuffer = SlowBuffer; +exports.INSPECT_MAX_BYTES = 50; +/** + * If `Buffer.TYPED_ARRAY_SUPPORT`: + * === true Use Uint8Array implementation (fastest) + * === false Use Object implementation (most compatible, even IE6) + * + * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, + * Opera 11.6+, iOS 4.2+. + * + * Due to various browser bugs, sometimes the Object implementation will be used even + * when the browser supports typed arrays. + * + * Note: + * + * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances, + * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438. + * + * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function. + * + * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of + * incorrect length in some situations. + + * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they + * get the Object implementation, which is slower but behaves correctly. + */ + +Buffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined ? global.TYPED_ARRAY_SUPPORT : typedArraySupport(); +/* + * Export kMaxLength after typed array support is determined. + */ + +exports.kMaxLength = kMaxLength(); + +function typedArraySupport() { + try { + var arr = new Uint8Array(1); + arr.__proto__ = { + __proto__: Uint8Array.prototype, + foo: function foo() { + return 42; + } + }; + return arr.foo() === 42 && // typed array instances can be augmented + typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray` + arr.subarray(1, 1).byteLength === 0; // ie10 has broken `subarray` + } catch (e) { + return false; + } +} + +function kMaxLength() { + return Buffer.TYPED_ARRAY_SUPPORT ? 0x7fffffff : 0x3fffffff; +} + +function createBuffer(that, length) { + if (kMaxLength() < length) { + throw new RangeError('Invalid typed array length'); + } + + if (Buffer.TYPED_ARRAY_SUPPORT) { + // Return an augmented `Uint8Array` instance, for best performance + that = new Uint8Array(length); + that.__proto__ = Buffer.prototype; + } else { + // Fallback: Return an object instance of the Buffer class + if (that === null) { + that = new Buffer(length); + } + + that.length = length; + } + + return that; +} +/** + * The Buffer constructor returns instances of `Uint8Array` that have their + * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of + * `Uint8Array`, so the returned instances will have all the node `Buffer` methods + * and the `Uint8Array` methods. Square bracket notation works as expected -- it + * returns a single octet. + * + * The `Uint8Array` prototype remains unmodified. + */ + + +function Buffer(arg, encodingOrOffset, length) { + if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) { + return new Buffer(arg, encodingOrOffset, length); + } // Common case. + + + if (typeof arg === 'number') { + if (typeof encodingOrOffset === 'string') { + throw new Error('If encoding is specified then the first argument must be a string'); + } + + return allocUnsafe(this, arg); + } + + return from(this, arg, encodingOrOffset, length); +} + +Buffer.poolSize = 8192; // not used by this implementation +// TODO: Legacy, not needed anymore. Remove in next major version. + +Buffer._augment = function (arr) { + arr.__proto__ = Buffer.prototype; + return arr; +}; + +function from(that, value, encodingOrOffset, length) { + if (typeof value === 'number') { + throw new TypeError('"value" argument must not be a number'); + } + + if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) { + return fromArrayBuffer(that, value, encodingOrOffset, length); + } + + if (typeof value === 'string') { + return fromString(that, value, encodingOrOffset); + } + + return fromObject(that, value); +} +/** + * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError + * if value is a number. + * Buffer.from(str[, encoding]) + * Buffer.from(array) + * Buffer.from(buffer) + * Buffer.from(arrayBuffer[, byteOffset[, length]]) + **/ + + +Buffer.from = function (value, encodingOrOffset, length) { + return from(null, value, encodingOrOffset, length); +}; + +if (Buffer.TYPED_ARRAY_SUPPORT) { + Buffer.prototype.__proto__ = Uint8Array.prototype; + Buffer.__proto__ = Uint8Array; + + if (typeof Symbol !== 'undefined' && Symbol.species && Buffer[Symbol.species] === Buffer) { + // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97 + Object.defineProperty(Buffer, Symbol.species, { + value: null, + configurable: true + }); + } +} + +function assertSize(size) { + if (typeof size !== 'number') { + throw new TypeError('"size" argument must be a number'); + } else if (size < 0) { + throw new RangeError('"size" argument must not be negative'); + } +} + +function alloc(that, size, fill, encoding) { + assertSize(size); + + if (size <= 0) { + return createBuffer(that, size); + } + + if (fill !== undefined) { + // Only pay attention to encoding if it's a string. This + // prevents accidentally sending in a number that would + // be interpretted as a start offset. + return typeof encoding === 'string' ? createBuffer(that, size).fill(fill, encoding) : createBuffer(that, size).fill(fill); + } + + return createBuffer(that, size); +} +/** + * Creates a new filled Buffer instance. + * alloc(size[, fill[, encoding]]) + **/ + + +Buffer.alloc = function (size, fill, encoding) { + return alloc(null, size, fill, encoding); +}; + +function allocUnsafe(that, size) { + assertSize(size); + that = createBuffer(that, size < 0 ? 0 : checked(size) | 0); + + if (!Buffer.TYPED_ARRAY_SUPPORT) { + for (var i = 0; i < size; ++i) { + that[i] = 0; + } + } + + return that; +} +/** + * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance. + * */ + + +Buffer.allocUnsafe = function (size) { + return allocUnsafe(null, size); +}; +/** + * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance. + */ + + +Buffer.allocUnsafeSlow = function (size) { + return allocUnsafe(null, size); +}; + +function fromString(that, string, encoding) { + if (typeof encoding !== 'string' || encoding === '') { + encoding = 'utf8'; + } + + if (!Buffer.isEncoding(encoding)) { + throw new TypeError('"encoding" must be a valid string encoding'); + } + + var length = byteLength(string, encoding) | 0; + that = createBuffer(that, length); + var actual = that.write(string, encoding); + + if (actual !== length) { + // Writing a hex string, for example, that contains invalid characters will + // cause everything after the first invalid character to be ignored. (e.g. + // 'abxxcd' will be treated as 'ab') + that = that.slice(0, actual); + } + + return that; +} + +function fromArrayLike(that, array) { + var length = array.length < 0 ? 0 : checked(array.length) | 0; + that = createBuffer(that, length); + + for (var i = 0; i < length; i += 1) { + that[i] = array[i] & 255; + } + + return that; +} + +function fromArrayBuffer(that, array, byteOffset, length) { + array.byteLength; // this throws if `array` is not a valid ArrayBuffer + + if (byteOffset < 0 || array.byteLength < byteOffset) { + throw new RangeError('\'offset\' is out of bounds'); + } + + if (array.byteLength < byteOffset + (length || 0)) { + throw new RangeError('\'length\' is out of bounds'); + } + + if (byteOffset === undefined && length === undefined) { + array = new Uint8Array(array); + } else if (length === undefined) { + array = new Uint8Array(array, byteOffset); + } else { + array = new Uint8Array(array, byteOffset, length); + } + + if (Buffer.TYPED_ARRAY_SUPPORT) { + // Return an augmented `Uint8Array` instance, for best performance + that = array; + that.__proto__ = Buffer.prototype; + } else { + // Fallback: Return an object instance of the Buffer class + that = fromArrayLike(that, array); + } + + return that; +} + +function fromObject(that, obj) { + if (Buffer.isBuffer(obj)) { + var len = checked(obj.length) | 0; + that = createBuffer(that, len); + + if (that.length === 0) { + return that; + } + + obj.copy(that, 0, 0, len); + return that; + } + + if (obj) { + if (typeof ArrayBuffer !== 'undefined' && obj.buffer instanceof ArrayBuffer || 'length' in obj) { + if (typeof obj.length !== 'number' || isnan(obj.length)) { + return createBuffer(that, 0); + } + + return fromArrayLike(that, obj); + } + + if (obj.type === 'Buffer' && isArray(obj.data)) { + return fromArrayLike(that, obj.data); + } + } + + throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.'); +} + +function checked(length) { + // Note: cannot use `length < kMaxLength()` here because that fails when + // length is NaN (which is otherwise coerced to zero.) + if (length >= kMaxLength()) { + throw new RangeError('Attempt to allocate Buffer larger than maximum ' + 'size: 0x' + kMaxLength().toString(16) + ' bytes'); + } + + return length | 0; +} + +function SlowBuffer(length) { + if (+length != length) { + // eslint-disable-line eqeqeq + length = 0; + } + + return Buffer.alloc(+length); +} + +Buffer.isBuffer = function isBuffer(b) { + return !!(b != null && b._isBuffer); +}; + +Buffer.compare = function compare(a, b) { + if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) { + throw new TypeError('Arguments must be Buffers'); + } + + if (a === b) return 0; + var x = a.length; + var y = b.length; + + for (var i = 0, len = Math.min(x, y); i < len; ++i) { + if (a[i] !== b[i]) { + x = a[i]; + y = b[i]; + break; + } + } + + if (x < y) return -1; + if (y < x) return 1; + return 0; +}; + +Buffer.isEncoding = function isEncoding(encoding) { + switch (String(encoding).toLowerCase()) { + case 'hex': + case 'utf8': + case 'utf-8': + case 'ascii': + case 'latin1': + case 'binary': + case 'base64': + case 'ucs2': + case 'ucs-2': + case 'utf16le': + case 'utf-16le': + return true; + + default: + return false; + } +}; + +Buffer.concat = function concat(list, length) { + if (!isArray(list)) { + throw new TypeError('"list" argument must be an Array of Buffers'); + } + + if (list.length === 0) { + return Buffer.alloc(0); + } + + var i; + + if (length === undefined) { + length = 0; + + for (i = 0; i < list.length; ++i) { + length += list[i].length; + } + } + + var buffer = Buffer.allocUnsafe(length); + var pos = 0; + + for (i = 0; i < list.length; ++i) { + var buf = list[i]; + + if (!Buffer.isBuffer(buf)) { + throw new TypeError('"list" argument must be an Array of Buffers'); + } + + buf.copy(buffer, pos); + pos += buf.length; + } + + return buffer; +}; + +function byteLength(string, encoding) { + if (Buffer.isBuffer(string)) { + return string.length; + } + + if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' && (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) { + return string.byteLength; + } + + if (typeof string !== 'string') { + string = '' + string; + } + + var len = string.length; + if (len === 0) return 0; // Use a for loop to avoid recursion + + var loweredCase = false; + + for (;;) { + switch (encoding) { + case 'ascii': + case 'latin1': + case 'binary': + return len; + + case 'utf8': + case 'utf-8': + case undefined: + return utf8ToBytes(string).length; + + case 'ucs2': + case 'ucs-2': + case 'utf16le': + case 'utf-16le': + return len * 2; + + case 'hex': + return len >>> 1; + + case 'base64': + return base64ToBytes(string).length; + + default: + if (loweredCase) return utf8ToBytes(string).length; // assume utf8 + + encoding = ('' + encoding).toLowerCase(); + loweredCase = true; + } + } +} + +Buffer.byteLength = byteLength; + +function slowToString(encoding, start, end) { + var loweredCase = false; // No need to verify that "this.length <= MAX_UINT32" since it's a read-only + // property of a typed array. + // This behaves neither like String nor Uint8Array in that we set start/end + // to their upper/lower bounds if the value passed is out of range. + // undefined is handled specially as per ECMA-262 6th Edition, + // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization. + + if (start === undefined || start < 0) { + start = 0; + } // Return early if start > this.length. Done here to prevent potential uint32 + // coercion fail below. + + + if (start > this.length) { + return ''; + } + + if (end === undefined || end > this.length) { + end = this.length; + } + + if (end <= 0) { + return ''; + } // Force coersion to uint32. This will also coerce falsey/NaN values to 0. + + + end >>>= 0; + start >>>= 0; + + if (end <= start) { + return ''; + } + + if (!encoding) encoding = 'utf8'; + + while (true) { + switch (encoding) { + case 'hex': + return hexSlice(this, start, end); + + case 'utf8': + case 'utf-8': + return utf8Slice(this, start, end); + + case 'ascii': + return asciiSlice(this, start, end); + + case 'latin1': + case 'binary': + return latin1Slice(this, start, end); + + case 'base64': + return base64Slice(this, start, end); + + case 'ucs2': + case 'ucs-2': + case 'utf16le': + case 'utf-16le': + return utf16leSlice(this, start, end); + + default: + if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding); + encoding = (encoding + '').toLowerCase(); + loweredCase = true; + } + } +} // The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect +// Buffer instances. + + +Buffer.prototype._isBuffer = true; + +function swap(b, n, m) { + var i = b[n]; + b[n] = b[m]; + b[m] = i; +} + +Buffer.prototype.swap16 = function swap16() { + var len = this.length; + + if (len % 2 !== 0) { + throw new RangeError('Buffer size must be a multiple of 16-bits'); + } + + for (var i = 0; i < len; i += 2) { + swap(this, i, i + 1); + } + + return this; +}; + +Buffer.prototype.swap32 = function swap32() { + var len = this.length; + + if (len % 4 !== 0) { + throw new RangeError('Buffer size must be a multiple of 32-bits'); + } + + for (var i = 0; i < len; i += 4) { + swap(this, i, i + 3); + swap(this, i + 1, i + 2); + } + + return this; +}; + +Buffer.prototype.swap64 = function swap64() { + var len = this.length; + + if (len % 8 !== 0) { + throw new RangeError('Buffer size must be a multiple of 64-bits'); + } + + for (var i = 0; i < len; i += 8) { + swap(this, i, i + 7); + swap(this, i + 1, i + 6); + swap(this, i + 2, i + 5); + swap(this, i + 3, i + 4); + } + + return this; +}; + +Buffer.prototype.toString = function toString() { + var length = this.length | 0; + if (length === 0) return ''; + if (arguments.length === 0) return utf8Slice(this, 0, length); + return slowToString.apply(this, arguments); +}; + +Buffer.prototype.equals = function equals(b) { + if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer'); + if (this === b) return true; + return Buffer.compare(this, b) === 0; +}; + +Buffer.prototype.inspect = function inspect() { + var str = ''; + var max = exports.INSPECT_MAX_BYTES; + + if (this.length > 0) { + str = this.toString('hex', 0, max).match(/.{2}/g).join(' '); + if (this.length > max) str += ' ... '; + } + + return ''; +}; + +Buffer.prototype.compare = function compare(target, start, end, thisStart, thisEnd) { + if (!Buffer.isBuffer(target)) { + throw new TypeError('Argument must be a Buffer'); + } + + if (start === undefined) { + start = 0; + } + + if (end === undefined) { + end = target ? target.length : 0; + } + + if (thisStart === undefined) { + thisStart = 0; + } + + if (thisEnd === undefined) { + thisEnd = this.length; + } + + if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) { + throw new RangeError('out of range index'); + } + + if (thisStart >= thisEnd && start >= end) { + return 0; + } + + if (thisStart >= thisEnd) { + return -1; + } + + if (start >= end) { + return 1; + } + + start >>>= 0; + end >>>= 0; + thisStart >>>= 0; + thisEnd >>>= 0; + if (this === target) return 0; + var x = thisEnd - thisStart; + var y = end - start; + var len = Math.min(x, y); + var thisCopy = this.slice(thisStart, thisEnd); + var targetCopy = target.slice(start, end); + + for (var i = 0; i < len; ++i) { + if (thisCopy[i] !== targetCopy[i]) { + x = thisCopy[i]; + y = targetCopy[i]; + break; + } + } + + if (x < y) return -1; + if (y < x) return 1; + return 0; +}; // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`, +// OR the last index of `val` in `buffer` at offset <= `byteOffset`. +// +// Arguments: +// - buffer - a Buffer to search +// - val - a string, Buffer, or number +// - byteOffset - an index into `buffer`; will be clamped to an int32 +// - encoding - an optional encoding, relevant is val is a string +// - dir - true for indexOf, false for lastIndexOf + + +function bidirectionalIndexOf(buffer, val, byteOffset, encoding, dir) { + // Empty buffer means no match + if (buffer.length === 0) return -1; // Normalize byteOffset + + if (typeof byteOffset === 'string') { + encoding = byteOffset; + byteOffset = 0; + } else if (byteOffset > 0x7fffffff) { + byteOffset = 0x7fffffff; + } else if (byteOffset < -0x80000000) { + byteOffset = -0x80000000; + } + + byteOffset = +byteOffset; // Coerce to Number. + + if (isNaN(byteOffset)) { + // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer + byteOffset = dir ? 0 : buffer.length - 1; + } // Normalize byteOffset: negative offsets start from the end of the buffer + + + if (byteOffset < 0) byteOffset = buffer.length + byteOffset; + + if (byteOffset >= buffer.length) { + if (dir) return -1;else byteOffset = buffer.length - 1; + } else if (byteOffset < 0) { + if (dir) byteOffset = 0;else return -1; + } // Normalize val + + + if (typeof val === 'string') { + val = Buffer.from(val, encoding); + } // Finally, search either indexOf (if dir is true) or lastIndexOf + + + if (Buffer.isBuffer(val)) { + // Special case: looking for empty string/buffer always fails + if (val.length === 0) { + return -1; + } + + return arrayIndexOf(buffer, val, byteOffset, encoding, dir); + } else if (typeof val === 'number') { + val = val & 0xFF; // Search for a byte value [0-255] + + if (Buffer.TYPED_ARRAY_SUPPORT && typeof Uint8Array.prototype.indexOf === 'function') { + if (dir) { + return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset); + } else { + return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset); + } + } + + return arrayIndexOf(buffer, [val], byteOffset, encoding, dir); + } + + throw new TypeError('val must be string, number or Buffer'); +} + +function arrayIndexOf(arr, val, byteOffset, encoding, dir) { + var indexSize = 1; + var arrLength = arr.length; + var valLength = val.length; + + if (encoding !== undefined) { + encoding = String(encoding).toLowerCase(); + + if (encoding === 'ucs2' || encoding === 'ucs-2' || encoding === 'utf16le' || encoding === 'utf-16le') { + if (arr.length < 2 || val.length < 2) { + return -1; + } + + indexSize = 2; + arrLength /= 2; + valLength /= 2; + byteOffset /= 2; + } + } + + function read(buf, i) { + if (indexSize === 1) { + return buf[i]; + } else { + return buf.readUInt16BE(i * indexSize); + } + } + + var i; + + if (dir) { + var foundIndex = -1; + + for (i = byteOffset; i < arrLength; i++) { + if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) { + if (foundIndex === -1) foundIndex = i; + if (i - foundIndex + 1 === valLength) return foundIndex * indexSize; + } else { + if (foundIndex !== -1) i -= i - foundIndex; + foundIndex = -1; + } + } + } else { + if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength; + + for (i = byteOffset; i >= 0; i--) { + var found = true; + + for (var j = 0; j < valLength; j++) { + if (read(arr, i + j) !== read(val, j)) { + found = false; + break; + } + } + + if (found) return i; + } + } + + return -1; +} + +Buffer.prototype.includes = function includes(val, byteOffset, encoding) { + return this.indexOf(val, byteOffset, encoding) !== -1; +}; + +Buffer.prototype.indexOf = function indexOf(val, byteOffset, encoding) { + return bidirectionalIndexOf(this, val, byteOffset, encoding, true); +}; + +Buffer.prototype.lastIndexOf = function lastIndexOf(val, byteOffset, encoding) { + return bidirectionalIndexOf(this, val, byteOffset, encoding, false); +}; + +function hexWrite(buf, string, offset, length) { + offset = Number(offset) || 0; + var remaining = buf.length - offset; + + if (!length) { + length = remaining; + } else { + length = Number(length); + + if (length > remaining) { + length = remaining; + } + } // must be an even number of digits + + + var strLen = string.length; + if (strLen % 2 !== 0) throw new TypeError('Invalid hex string'); + + if (length > strLen / 2) { + length = strLen / 2; + } + + for (var i = 0; i < length; ++i) { + var parsed = parseInt(string.substr(i * 2, 2), 16); + if (isNaN(parsed)) return i; + buf[offset + i] = parsed; + } + + return i; +} + +function utf8Write(buf, string, offset, length) { + return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length); +} + +function asciiWrite(buf, string, offset, length) { + return blitBuffer(asciiToBytes(string), buf, offset, length); +} + +function latin1Write(buf, string, offset, length) { + return asciiWrite(buf, string, offset, length); +} + +function base64Write(buf, string, offset, length) { + return blitBuffer(base64ToBytes(string), buf, offset, length); +} + +function ucs2Write(buf, string, offset, length) { + return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length); +} + +Buffer.prototype.write = function write(string, offset, length, encoding) { + // Buffer#write(string) + if (offset === undefined) { + encoding = 'utf8'; + length = this.length; + offset = 0; // Buffer#write(string, encoding) + } else if (length === undefined && typeof offset === 'string') { + encoding = offset; + length = this.length; + offset = 0; // Buffer#write(string, offset[, length][, encoding]) + } else if (isFinite(offset)) { + offset = offset | 0; + + if (isFinite(length)) { + length = length | 0; + if (encoding === undefined) encoding = 'utf8'; + } else { + encoding = length; + length = undefined; + } // legacy write(string, encoding, offset, length) - remove in v0.13 + + } else { + throw new Error('Buffer.write(string, encoding, offset[, length]) is no longer supported'); + } + + var remaining = this.length - offset; + if (length === undefined || length > remaining) length = remaining; + + if (string.length > 0 && (length < 0 || offset < 0) || offset > this.length) { + throw new RangeError('Attempt to write outside buffer bounds'); + } + + if (!encoding) encoding = 'utf8'; + var loweredCase = false; + + for (;;) { + switch (encoding) { + case 'hex': + return hexWrite(this, string, offset, length); + + case 'utf8': + case 'utf-8': + return utf8Write(this, string, offset, length); + + case 'ascii': + return asciiWrite(this, string, offset, length); + + case 'latin1': + case 'binary': + return latin1Write(this, string, offset, length); + + case 'base64': + // Warning: maxLength not taken into account in base64Write + return base64Write(this, string, offset, length); + + case 'ucs2': + case 'ucs-2': + case 'utf16le': + case 'utf-16le': + return ucs2Write(this, string, offset, length); + + default: + if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding); + encoding = ('' + encoding).toLowerCase(); + loweredCase = true; + } + } +}; + +Buffer.prototype.toJSON = function toJSON() { + return { + type: 'Buffer', + data: Array.prototype.slice.call(this._arr || this, 0) + }; +}; + +function base64Slice(buf, start, end) { + if (start === 0 && end === buf.length) { + return base64.fromByteArray(buf); + } else { + return base64.fromByteArray(buf.slice(start, end)); + } +} + +function utf8Slice(buf, start, end) { + end = Math.min(buf.length, end); + var res = []; + var i = start; + + while (i < end) { + var firstByte = buf[i]; + var codePoint = null; + var bytesPerSequence = firstByte > 0xEF ? 4 : firstByte > 0xDF ? 3 : firstByte > 0xBF ? 2 : 1; + + if (i + bytesPerSequence <= end) { + var secondByte, thirdByte, fourthByte, tempCodePoint; + + switch (bytesPerSequence) { + case 1: + if (firstByte < 0x80) { + codePoint = firstByte; + } + + break; + + case 2: + secondByte = buf[i + 1]; + + if ((secondByte & 0xC0) === 0x80) { + tempCodePoint = (firstByte & 0x1F) << 0x6 | secondByte & 0x3F; + + if (tempCodePoint > 0x7F) { + codePoint = tempCodePoint; + } + } + + break; + + case 3: + secondByte = buf[i + 1]; + thirdByte = buf[i + 2]; + + if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) { + tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | thirdByte & 0x3F; + + if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) { + codePoint = tempCodePoint; + } + } + + break; + + case 4: + secondByte = buf[i + 1]; + thirdByte = buf[i + 2]; + fourthByte = buf[i + 3]; + + if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) { + tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | fourthByte & 0x3F; + + if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) { + codePoint = tempCodePoint; + } + } + + } + } + + if (codePoint === null) { + // we did not generate a valid codePoint so insert a + // replacement char (U+FFFD) and advance only 1 byte + codePoint = 0xFFFD; + bytesPerSequence = 1; + } else if (codePoint > 0xFFFF) { + // encode to utf16 (surrogate pair dance) + codePoint -= 0x10000; + res.push(codePoint >>> 10 & 0x3FF | 0xD800); + codePoint = 0xDC00 | codePoint & 0x3FF; + } + + res.push(codePoint); + i += bytesPerSequence; + } + + return decodeCodePointsArray(res); +} // Based on http://stackoverflow.com/a/22747272/680742, the browser with +// the lowest limit is Chrome, with 0x10000 args. +// We go 1 magnitude less, for safety + + +var MAX_ARGUMENTS_LENGTH = 0x1000; + +function decodeCodePointsArray(codePoints) { + var len = codePoints.length; + + if (len <= MAX_ARGUMENTS_LENGTH) { + return String.fromCharCode.apply(String, codePoints); // avoid extra slice() + } // Decode in chunks to avoid "call stack size exceeded". + + + var res = ''; + var i = 0; + + while (i < len) { + res += String.fromCharCode.apply(String, codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)); + } + + return res; +} + +function asciiSlice(buf, start, end) { + var ret = ''; + end = Math.min(buf.length, end); + + for (var i = start; i < end; ++i) { + ret += String.fromCharCode(buf[i] & 0x7F); + } + + return ret; +} + +function latin1Slice(buf, start, end) { + var ret = ''; + end = Math.min(buf.length, end); + + for (var i = start; i < end; ++i) { + ret += String.fromCharCode(buf[i]); + } + + return ret; +} + +function hexSlice(buf, start, end) { + var len = buf.length; + if (!start || start < 0) start = 0; + if (!end || end < 0 || end > len) end = len; + var out = ''; + + for (var i = start; i < end; ++i) { + out += toHex(buf[i]); + } + + return out; +} + +function utf16leSlice(buf, start, end) { + var bytes = buf.slice(start, end); + var res = ''; + + for (var i = 0; i < bytes.length; i += 2) { + res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256); + } + + return res; +} + +Buffer.prototype.slice = function slice(start, end) { + var len = this.length; + start = ~~start; + end = end === undefined ? len : ~~end; + + if (start < 0) { + start += len; + if (start < 0) start = 0; + } else if (start > len) { + start = len; + } + + if (end < 0) { + end += len; + if (end < 0) end = 0; + } else if (end > len) { + end = len; + } + + if (end < start) end = start; + var newBuf; + + if (Buffer.TYPED_ARRAY_SUPPORT) { + newBuf = this.subarray(start, end); + newBuf.__proto__ = Buffer.prototype; + } else { + var sliceLen = end - start; + newBuf = new Buffer(sliceLen, undefined); + + for (var i = 0; i < sliceLen; ++i) { + newBuf[i] = this[i + start]; + } + } + + return newBuf; +}; +/* + * Need to make sure that buffer isn't trying to write out of bounds. + */ + + +function checkOffset(offset, ext, length) { + if (offset % 1 !== 0 || offset < 0) throw new RangeError('offset is not uint'); + if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length'); +} + +Buffer.prototype.readUIntLE = function readUIntLE(offset, byteLength, noAssert) { + offset = offset | 0; + byteLength = byteLength | 0; + if (!noAssert) checkOffset(offset, byteLength, this.length); + var val = this[offset]; + var mul = 1; + var i = 0; + + while (++i < byteLength && (mul *= 0x100)) { + val += this[offset + i] * mul; + } + + return val; +}; + +Buffer.prototype.readUIntBE = function readUIntBE(offset, byteLength, noAssert) { + offset = offset | 0; + byteLength = byteLength | 0; + + if (!noAssert) { + checkOffset(offset, byteLength, this.length); + } + + var val = this[offset + --byteLength]; + var mul = 1; + + while (byteLength > 0 && (mul *= 0x100)) { + val += this[offset + --byteLength] * mul; + } + + return val; +}; + +Buffer.prototype.readUInt8 = function readUInt8(offset, noAssert) { + if (!noAssert) checkOffset(offset, 1, this.length); + return this[offset]; +}; + +Buffer.prototype.readUInt16LE = function readUInt16LE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 2, this.length); + return this[offset] | this[offset + 1] << 8; +}; + +Buffer.prototype.readUInt16BE = function readUInt16BE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 2, this.length); + return this[offset] << 8 | this[offset + 1]; +}; + +Buffer.prototype.readUInt32LE = function readUInt32LE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 4, this.length); + return (this[offset] | this[offset + 1] << 8 | this[offset + 2] << 16) + this[offset + 3] * 0x1000000; +}; + +Buffer.prototype.readUInt32BE = function readUInt32BE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 4, this.length); + return this[offset] * 0x1000000 + (this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3]); +}; + +Buffer.prototype.readIntLE = function readIntLE(offset, byteLength, noAssert) { + offset = offset | 0; + byteLength = byteLength | 0; + if (!noAssert) checkOffset(offset, byteLength, this.length); + var val = this[offset]; + var mul = 1; + var i = 0; + + while (++i < byteLength && (mul *= 0x100)) { + val += this[offset + i] * mul; + } + + mul *= 0x80; + if (val >= mul) val -= Math.pow(2, 8 * byteLength); + return val; +}; + +Buffer.prototype.readIntBE = function readIntBE(offset, byteLength, noAssert) { + offset = offset | 0; + byteLength = byteLength | 0; + if (!noAssert) checkOffset(offset, byteLength, this.length); + var i = byteLength; + var mul = 1; + var val = this[offset + --i]; + + while (i > 0 && (mul *= 0x100)) { + val += this[offset + --i] * mul; + } + + mul *= 0x80; + if (val >= mul) val -= Math.pow(2, 8 * byteLength); + return val; +}; + +Buffer.prototype.readInt8 = function readInt8(offset, noAssert) { + if (!noAssert) checkOffset(offset, 1, this.length); + if (!(this[offset] & 0x80)) return this[offset]; + return (0xff - this[offset] + 1) * -1; +}; + +Buffer.prototype.readInt16LE = function readInt16LE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 2, this.length); + var val = this[offset] | this[offset + 1] << 8; + return val & 0x8000 ? val | 0xFFFF0000 : val; +}; + +Buffer.prototype.readInt16BE = function readInt16BE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 2, this.length); + var val = this[offset + 1] | this[offset] << 8; + return val & 0x8000 ? val | 0xFFFF0000 : val; +}; + +Buffer.prototype.readInt32LE = function readInt32LE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 4, this.length); + return this[offset] | this[offset + 1] << 8 | this[offset + 2] << 16 | this[offset + 3] << 24; +}; + +Buffer.prototype.readInt32BE = function readInt32BE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 4, this.length); + return this[offset] << 24 | this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3]; +}; + +Buffer.prototype.readFloatLE = function readFloatLE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 4, this.length); + return ieee754.read(this, offset, true, 23, 4); +}; + +Buffer.prototype.readFloatBE = function readFloatBE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 4, this.length); + return ieee754.read(this, offset, false, 23, 4); +}; + +Buffer.prototype.readDoubleLE = function readDoubleLE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 8, this.length); + return ieee754.read(this, offset, true, 52, 8); +}; + +Buffer.prototype.readDoubleBE = function readDoubleBE(offset, noAssert) { + if (!noAssert) checkOffset(offset, 8, this.length); + return ieee754.read(this, offset, false, 52, 8); +}; + +function checkInt(buf, value, offset, ext, max, min) { + if (!Buffer.isBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance'); + if (value > max || value < min) throw new RangeError('"value" argument is out of bounds'); + if (offset + ext > buf.length) throw new RangeError('Index out of range'); +} + +Buffer.prototype.writeUIntLE = function writeUIntLE(value, offset, byteLength, noAssert) { + value = +value; + offset = offset | 0; + byteLength = byteLength | 0; + + if (!noAssert) { + var maxBytes = Math.pow(2, 8 * byteLength) - 1; + checkInt(this, value, offset, byteLength, maxBytes, 0); + } + + var mul = 1; + var i = 0; + this[offset] = value & 0xFF; + + while (++i < byteLength && (mul *= 0x100)) { + this[offset + i] = value / mul & 0xFF; + } + + return offset + byteLength; +}; + +Buffer.prototype.writeUIntBE = function writeUIntBE(value, offset, byteLength, noAssert) { + value = +value; + offset = offset | 0; + byteLength = byteLength | 0; + + if (!noAssert) { + var maxBytes = Math.pow(2, 8 * byteLength) - 1; + checkInt(this, value, offset, byteLength, maxBytes, 0); + } + + var i = byteLength - 1; + var mul = 1; + this[offset + i] = value & 0xFF; + + while (--i >= 0 && (mul *= 0x100)) { + this[offset + i] = value / mul & 0xFF; + } + + return offset + byteLength; +}; + +Buffer.prototype.writeUInt8 = function writeUInt8(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0); + if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value); + this[offset] = value & 0xff; + return offset + 1; +}; + +function objectWriteUInt16(buf, value, offset, littleEndian) { + if (value < 0) value = 0xffff + value + 1; + + for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; ++i) { + buf[offset + i] = (value & 0xff << 8 * (littleEndian ? i : 1 - i)) >>> (littleEndian ? i : 1 - i) * 8; + } +} + +Buffer.prototype.writeUInt16LE = function writeUInt16LE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value & 0xff; + this[offset + 1] = value >>> 8; + } else { + objectWriteUInt16(this, value, offset, true); + } + + return offset + 2; +}; + +Buffer.prototype.writeUInt16BE = function writeUInt16BE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value >>> 8; + this[offset + 1] = value & 0xff; + } else { + objectWriteUInt16(this, value, offset, false); + } + + return offset + 2; +}; + +function objectWriteUInt32(buf, value, offset, littleEndian) { + if (value < 0) value = 0xffffffff + value + 1; + + for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; ++i) { + buf[offset + i] = value >>> (littleEndian ? i : 3 - i) * 8 & 0xff; + } +} + +Buffer.prototype.writeUInt32LE = function writeUInt32LE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset + 3] = value >>> 24; + this[offset + 2] = value >>> 16; + this[offset + 1] = value >>> 8; + this[offset] = value & 0xff; + } else { + objectWriteUInt32(this, value, offset, true); + } + + return offset + 4; +}; + +Buffer.prototype.writeUInt32BE = function writeUInt32BE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value >>> 24; + this[offset + 1] = value >>> 16; + this[offset + 2] = value >>> 8; + this[offset + 3] = value & 0xff; + } else { + objectWriteUInt32(this, value, offset, false); + } + + return offset + 4; +}; + +Buffer.prototype.writeIntLE = function writeIntLE(value, offset, byteLength, noAssert) { + value = +value; + offset = offset | 0; + + if (!noAssert) { + var limit = Math.pow(2, 8 * byteLength - 1); + checkInt(this, value, offset, byteLength, limit - 1, -limit); + } + + var i = 0; + var mul = 1; + var sub = 0; + this[offset] = value & 0xFF; + + while (++i < byteLength && (mul *= 0x100)) { + if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) { + sub = 1; + } + + this[offset + i] = (value / mul >> 0) - sub & 0xFF; + } + + return offset + byteLength; +}; + +Buffer.prototype.writeIntBE = function writeIntBE(value, offset, byteLength, noAssert) { + value = +value; + offset = offset | 0; + + if (!noAssert) { + var limit = Math.pow(2, 8 * byteLength - 1); + checkInt(this, value, offset, byteLength, limit - 1, -limit); + } + + var i = byteLength - 1; + var mul = 1; + var sub = 0; + this[offset + i] = value & 0xFF; + + while (--i >= 0 && (mul *= 0x100)) { + if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) { + sub = 1; + } + + this[offset + i] = (value / mul >> 0) - sub & 0xFF; + } + + return offset + byteLength; +}; + +Buffer.prototype.writeInt8 = function writeInt8(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80); + if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value); + if (value < 0) value = 0xff + value + 1; + this[offset] = value & 0xff; + return offset + 1; +}; + +Buffer.prototype.writeInt16LE = function writeInt16LE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value & 0xff; + this[offset + 1] = value >>> 8; + } else { + objectWriteUInt16(this, value, offset, true); + } + + return offset + 2; +}; + +Buffer.prototype.writeInt16BE = function writeInt16BE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value >>> 8; + this[offset + 1] = value & 0xff; + } else { + objectWriteUInt16(this, value, offset, false); + } + + return offset + 2; +}; + +Buffer.prototype.writeInt32LE = function writeInt32LE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000); + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value & 0xff; + this[offset + 1] = value >>> 8; + this[offset + 2] = value >>> 16; + this[offset + 3] = value >>> 24; + } else { + objectWriteUInt32(this, value, offset, true); + } + + return offset + 4; +}; + +Buffer.prototype.writeInt32BE = function writeInt32BE(value, offset, noAssert) { + value = +value; + offset = offset | 0; + if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000); + if (value < 0) value = 0xffffffff + value + 1; + + if (Buffer.TYPED_ARRAY_SUPPORT) { + this[offset] = value >>> 24; + this[offset + 1] = value >>> 16; + this[offset + 2] = value >>> 8; + this[offset + 3] = value & 0xff; + } else { + objectWriteUInt32(this, value, offset, false); + } + + return offset + 4; +}; + +function checkIEEE754(buf, value, offset, ext, max, min) { + if (offset + ext > buf.length) throw new RangeError('Index out of range'); + if (offset < 0) throw new RangeError('Index out of range'); +} + +function writeFloat(buf, value, offset, littleEndian, noAssert) { + if (!noAssert) { + checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38); + } + + ieee754.write(buf, value, offset, littleEndian, 23, 4); + return offset + 4; +} + +Buffer.prototype.writeFloatLE = function writeFloatLE(value, offset, noAssert) { + return writeFloat(this, value, offset, true, noAssert); +}; + +Buffer.prototype.writeFloatBE = function writeFloatBE(value, offset, noAssert) { + return writeFloat(this, value, offset, false, noAssert); +}; + +function writeDouble(buf, value, offset, littleEndian, noAssert) { + if (!noAssert) { + checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308); + } + + ieee754.write(buf, value, offset, littleEndian, 52, 8); + return offset + 8; +} + +Buffer.prototype.writeDoubleLE = function writeDoubleLE(value, offset, noAssert) { + return writeDouble(this, value, offset, true, noAssert); +}; + +Buffer.prototype.writeDoubleBE = function writeDoubleBE(value, offset, noAssert) { + return writeDouble(this, value, offset, false, noAssert); +}; // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) + + +Buffer.prototype.copy = function copy(target, targetStart, start, end) { + if (!start) start = 0; + if (!end && end !== 0) end = this.length; + if (targetStart >= target.length) targetStart = target.length; + if (!targetStart) targetStart = 0; + if (end > 0 && end < start) end = start; // Copy 0 bytes; we're done + + if (end === start) return 0; + if (target.length === 0 || this.length === 0) return 0; // Fatal error conditions + + if (targetStart < 0) { + throw new RangeError('targetStart out of bounds'); + } + + if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds'); + if (end < 0) throw new RangeError('sourceEnd out of bounds'); // Are we oob? + + if (end > this.length) end = this.length; + + if (target.length - targetStart < end - start) { + end = target.length - targetStart + start; + } + + var len = end - start; + var i; + + if (this === target && start < targetStart && targetStart < end) { + // descending copy from end + for (i = len - 1; i >= 0; --i) { + target[i + targetStart] = this[i + start]; + } + } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) { + // ascending copy from start + for (i = 0; i < len; ++i) { + target[i + targetStart] = this[i + start]; + } + } else { + Uint8Array.prototype.set.call(target, this.subarray(start, start + len), targetStart); + } + + return len; +}; // Usage: +// buffer.fill(number[, offset[, end]]) +// buffer.fill(buffer[, offset[, end]]) +// buffer.fill(string[, offset[, end]][, encoding]) + + +Buffer.prototype.fill = function fill(val, start, end, encoding) { + // Handle string cases: + if (typeof val === 'string') { + if (typeof start === 'string') { + encoding = start; + start = 0; + end = this.length; + } else if (typeof end === 'string') { + encoding = end; + end = this.length; + } + + if (val.length === 1) { + var code = val.charCodeAt(0); + + if (code < 256) { + val = code; + } + } + + if (encoding !== undefined && typeof encoding !== 'string') { + throw new TypeError('encoding must be a string'); + } + + if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) { + throw new TypeError('Unknown encoding: ' + encoding); + } + } else if (typeof val === 'number') { + val = val & 255; + } // Invalid ranges are not set to a default, so can range check early. + + + if (start < 0 || this.length < start || this.length < end) { + throw new RangeError('Out of range index'); + } + + if (end <= start) { + return this; + } + + start = start >>> 0; + end = end === undefined ? this.length : end >>> 0; + if (!val) val = 0; + var i; + + if (typeof val === 'number') { + for (i = start; i < end; ++i) { + this[i] = val; + } + } else { + var bytes = Buffer.isBuffer(val) ? val : utf8ToBytes(new Buffer(val, encoding).toString()); + var len = bytes.length; + + for (i = 0; i < end - start; ++i) { + this[i + start] = bytes[i % len]; + } + } + + return this; +}; // HELPER FUNCTIONS +// ================ + + +var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g; + +function base64clean(str) { + // Node strips out invalid characters like \n and \t from the string, base64-js does not + str = stringtrim(str).replace(INVALID_BASE64_RE, ''); // Node converts strings with length < 2 to '' + + if (str.length < 2) return ''; // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not + + while (str.length % 4 !== 0) { + str = str + '='; + } + + return str; +} + +function stringtrim(str) { + if (str.trim) return str.trim(); + return str.replace(/^\s+|\s+$/g, ''); +} + +function toHex(n) { + if (n < 16) return '0' + n.toString(16); + return n.toString(16); +} + +function utf8ToBytes(string, units) { + units = units || Infinity; + var codePoint; + var length = string.length; + var leadSurrogate = null; + var bytes = []; + + for (var i = 0; i < length; ++i) { + codePoint = string.charCodeAt(i); // is surrogate component + + if (codePoint > 0xD7FF && codePoint < 0xE000) { + // last char was a lead + if (!leadSurrogate) { + // no lead yet + if (codePoint > 0xDBFF) { + // unexpected trail + if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); + continue; + } else if (i + 1 === length) { + // unpaired lead + if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); + continue; + } // valid lead + + + leadSurrogate = codePoint; + continue; + } // 2 leads in a row + + + if (codePoint < 0xDC00) { + if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); + leadSurrogate = codePoint; + continue; + } // valid surrogate pair + + + codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000; + } else if (leadSurrogate) { + // valid bmp char, but last char was a lead + if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD); + } + + leadSurrogate = null; // encode utf8 + + if (codePoint < 0x80) { + if ((units -= 1) < 0) break; + bytes.push(codePoint); + } else if (codePoint < 0x800) { + if ((units -= 2) < 0) break; + bytes.push(codePoint >> 0x6 | 0xC0, codePoint & 0x3F | 0x80); + } else if (codePoint < 0x10000) { + if ((units -= 3) < 0) break; + bytes.push(codePoint >> 0xC | 0xE0, codePoint >> 0x6 & 0x3F | 0x80, codePoint & 0x3F | 0x80); + } else if (codePoint < 0x110000) { + if ((units -= 4) < 0) break; + bytes.push(codePoint >> 0x12 | 0xF0, codePoint >> 0xC & 0x3F | 0x80, codePoint >> 0x6 & 0x3F | 0x80, codePoint & 0x3F | 0x80); + } else { + throw new Error('Invalid code point'); + } + } + + return bytes; +} + +function asciiToBytes(str) { + var byteArray = []; + + for (var i = 0; i < str.length; ++i) { + // Node's code seems to be doing this and not & 0x7F.. + byteArray.push(str.charCodeAt(i) & 0xFF); + } + + return byteArray; +} + +function utf16leToBytes(str, units) { + var c, hi, lo; + var byteArray = []; + + for (var i = 0; i < str.length; ++i) { + if ((units -= 2) < 0) break; + c = str.charCodeAt(i); + hi = c >> 8; + lo = c % 256; + byteArray.push(lo); + byteArray.push(hi); + } + + return byteArray; +} + +function base64ToBytes(str) { + return base64.toByteArray(base64clean(str)); +} + +function blitBuffer(src, dst, offset, length) { + for (var i = 0; i < length; ++i) { + if (i + offset >= dst.length || i >= src.length) break; + dst[i + offset] = src[i]; + } + + return i; +} + +function isnan(val) { + return val !== val; // eslint-disable-line no-self-compare +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10))) + +/***/ }), +/* 1 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** PROMISIFY CALLBACK-STYLE FUNCTIONS TO ES6 PROMISES +* +* 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 createCallback = function createCallback(method, context) { + return function () { + var args = Array.prototype.slice.call(arguments); + var lastIndex = args.length - 1; + var lastArg = args && args.length > 0 ? args[lastIndex] : null; + var cb = typeof lastArg === 'function' ? lastArg : null; + + if (cb) { + return method.apply(context, args); + } + + return new Promise(function (resolve, reject) { + args.push(function (err, val) { + if (err) return reject(err); + resolve(val); + }); + method.apply(context, args); + }); + }; +}; + +if (false) {} // Browserify this module + +module.exports = function (methods, options) { + options = options || {}; + var type = Object.prototype.toString.call(methods); + + if (type === "[object Object]" || type === "[object Array]") { + var obj = options.replace ? methods : {}; + + for (var key in methods) { + if (methods.hasOwnProperty(key)) obj[key] = createCallback(methods[key]); + } + + return obj; + } + + return createCallback(methods, options.context || methods); +}; // Browserify this module + + +if (false) {} + +/***/ }), +/* 2 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +if (typeof Object.create === 'function') { + // implementation from standard node.js 'util' module + module.exports = function inherits(ctor, superCtor) { + ctor.super_ = superCtor; + ctor.prototype = Object.create(superCtor.prototype, { + constructor: { + value: ctor, + enumerable: false, + writable: true, + configurable: true + } + }); + }; +} else { + // old school shim for old browsers + module.exports = function inherits(ctor, superCtor) { + ctor.super_ = superCtor; + + var TempCtor = function TempCtor() {}; + + TempCtor.prototype = superCtor.prototype; + ctor.prototype = new TempCtor(); + ctor.prototype.constructor = ctor; + }; +} + +/***/ }), +/* 3 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var getConfig = __webpack_require__(171); + +var sendRequest = __webpack_require__(172); + +var multiaddr = __webpack_require__(16); + +module.exports = function (arg) { + var config = getConfig(); + + if (typeof arg === 'function') { + return arg; + } else if (_typeof(arg) === 'object') { + return sendRequest(arg); + } else if (typeof arg === 'string') { + var maddr = multiaddr(arg).nodeAddress(); + config.host = maddr.address; + config.port = maddr.port; + return sendRequest(config); + } else { + throw new Error('Argument must be a send function or a config object.'); + } +}; + +/***/ }), +/* 4 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var mh = __webpack_require__(14); + +var multibase = __webpack_require__(49); + +var multicodec = __webpack_require__(50); + +var codecs = __webpack_require__(68); + +var CIDUtil = __webpack_require__(215); + +var withIs = __webpack_require__(27); +/** + * @typedef {Object} SerializedCID + * @param {string} codec + * @param {number} version + * @param {Buffer} multihash + */ + +/** + * Test if the given input is a CID. + * @function isCID + * @memberof CID + * @static + * @param {any} other + * @returns {bool} + */ + +/** + * Class representing a CID `` + * , as defined in [ipld/cid](https://github.com/multiformats/cid). + * @class CID + */ + + +var CID = +/*#__PURE__*/ +function () { + /** + * Create a new CID. + * + * The algorithm for argument input is roughly: + * ``` + * if (cid) + * -> create a copy + * else if (str) + * if (1st char is on multibase table) -> CID String + * else -> bs58 encoded multihash + * else if (Buffer) + * if (1st byte is 0 or 1) -> CID + * else -> multihash + * else if (Number) + * -> construct CID by parts + * ``` + * + * @param {string|Buffer|CID} version + * @param {string} [codec] + * @param {Buffer} [multihash] + * @param {string} [multibaseName] + * + * @example + * new CID(, , , ) + * new CID() + * new CID() + * new CID() + * new CID() + * new CID() + */ + function CID(version, codec, multihash, multibaseName) { + _classCallCheck(this, CID); + + if (_CID.isCID(version)) { + // version is an exising CID instance + var cid = version; + this.version = cid.version; + this.codec = cid.codec; + this.multihash = Buffer.from(cid.multihash); // Default guard for when a CID < 0.7 is passed with no multibaseName + + this.multibaseName = cid.multibaseName || (cid.version === 0 ? 'base58btc' : 'base32'); + return; + } + + if (typeof version === 'string') { + // e.g. 'base32' or false + var baseName = multibase.isEncoded(version); + + if (baseName) { + // version is a CID String encoded with multibase, so v1 + var _cid = multibase.decode(version); + + this.version = parseInt(_cid.slice(0, 1).toString('hex'), 16); + this.codec = multicodec.getCodec(_cid.slice(1)); + this.multihash = multicodec.rmPrefix(_cid.slice(1)); + this.multibaseName = baseName; + } else { + // version is a base58btc string multihash, so v0 + this.version = 0; + this.codec = 'dag-pb'; + this.multihash = mh.fromB58String(version); + this.multibaseName = 'base58btc'; + } + + CID.validateCID(this); + Object.defineProperty(this, 'string', { + value: version + }); + return; + } + + if (Buffer.isBuffer(version)) { + var firstByte = version.slice(0, 1); + var v = parseInt(firstByte.toString('hex'), 16); + + if (v === 1) { + // version is a CID buffer + var _cid2 = version; + this.version = v; + this.codec = multicodec.getCodec(_cid2.slice(1)); + this.multihash = multicodec.rmPrefix(_cid2.slice(1)); + this.multibaseName = 'base32'; + } else { + // version is a raw multihash buffer, so v0 + this.version = 0; + this.codec = 'dag-pb'; + this.multihash = version; + this.multibaseName = 'base58btc'; + } + + CID.validateCID(this); + return; + } // otherwise, assemble the CID from the parameters + + /** + * @type {number} + */ + + + this.version = version; + /** + * @type {string} + */ + + this.codec = codec; + /** + * @type {Buffer} + */ + + this.multihash = multihash; + /** + * @type {string} + */ + + this.multibaseName = multibaseName || (version === 0 ? 'base58btc' : 'base32'); + CID.validateCID(this); + } + /** + * The CID as a `Buffer` + * + * @return {Buffer} + * @readonly + * + * @memberOf CID + */ + + + _createClass(CID, [{ + key: "toV0", + + /** + * Convert to a CID of version `0`. + * + * @returns {CID} + */ + value: function toV0() { + if (this.codec !== 'dag-pb') { + throw new Error('Cannot convert a non dag-pb CID to CIDv0'); + } + + var _mh$decode = mh.decode(this.multihash), + name = _mh$decode.name, + length = _mh$decode.length; + + if (name !== 'sha2-256') { + throw new Error('Cannot convert non sha2-256 multihash CID to CIDv0'); + } + + if (length !== 32) { + throw new Error('Cannot convert non 32 byte multihash CID to CIDv0'); + } + + return new _CID(0, this.codec, this.multihash); + } + /** + * Convert to a CID of version `1`. + * + * @returns {CID} + */ + + }, { + key: "toV1", + value: function toV1() { + return new _CID(1, this.codec, this.multihash); + } + /** + * Encode the CID into a string. + * + * @param {string} [base=this.multibaseName] - Base encoding to use. + * @returns {string} + */ + + }, { + key: "toBaseEncodedString", + value: function toBaseEncodedString() { + var base = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : this.multibaseName; + + if (this.string && base === this.multibaseName) { + return this.string; + } + + var str = null; + + if (this.version === 0) { + if (base !== 'base58btc') { + throw new Error('not supported with CIDv0, to support different bases, please migrate the instance do CIDv1, you can do that through cid.toV1()'); + } + + str = mh.toB58String(this.multihash); + } else if (this.version === 1) { + str = multibase.encode(base, this.buffer).toString(); + } else { + throw new Error('unsupported version'); + } + + if (base === this.multibaseName) { + // cache the string value + Object.defineProperty(this, 'string', { + value: str + }); + } + + return str; + } + }, { + key: "toString", + value: function toString(base) { + return this.toBaseEncodedString(base); + } + /** + * Serialize to a plain object. + * + * @returns {SerializedCID} + */ + + }, { + key: "toJSON", + value: function toJSON() { + return { + codec: this.codec, + version: this.version, + hash: this.multihash + }; + } + /** + * Compare equality with another CID. + * + * @param {CID} other + * @returns {bool} + */ + + }, { + key: "equals", + value: function equals(other) { + return this.codec === other.codec && this.version === other.version && this.multihash.equals(other.multihash); + } + /** + * Test if the given input is a valid CID object. + * Throws if it is not. + * + * @param {any} other + * @returns {void} + */ + + }, { + key: "buffer", + get: function get() { + var buffer = this._buffer; + + if (!buffer) { + if (this.version === 0) { + buffer = this.multihash; + } else if (this.version === 1) { + buffer = Buffer.concat([Buffer.from('01', 'hex'), multicodec.getCodeVarint(this.codec), this.multihash]); + } else { + throw new Error('unsupported version'); + } // Cache this buffer so it doesn't have to be recreated + + + Object.defineProperty(this, '_buffer', { + value: buffer + }); + } + + return buffer; + } + /** + * Get the prefix of the CID. + * + * @returns {Buffer} + * @readonly + */ + + }, { + key: "prefix", + get: function get() { + return Buffer.concat([Buffer.from("0".concat(this.version), 'hex'), multicodec.getCodeVarint(this.codec), mh.prefix(this.multihash)]); + } + }], [{ + key: "validateCID", + value: function validateCID(other) { + var errorMsg = CIDUtil.checkCIDComponents(other); + + if (errorMsg) { + throw new Error(errorMsg); + } + } + }]); + + return CID; +}(); + +var _CID = withIs(CID, { + className: 'CID', + symbolName: '@ipld/js-cid/CID' +}); + +_CID.codecs = codecs; +module.exports = _CID; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 5 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports = module.exports = __webpack_require__(150); +exports.Stream = exports; +exports.Readable = exports; +exports.Writable = __webpack_require__(154); +exports.Duplex = __webpack_require__(32); +exports.Transform = __webpack_require__(155); +exports.PassThrough = __webpack_require__(319); + +/***/ }), +/* 6 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +// shim for using process in browser +var process = module.exports = {}; // cached from whatever global is present so that test runners that stub it +// don't break things. But we need to wrap it in a try catch in case it is +// wrapped in strict mode code which doesn't define any globals. It's inside a +// function because try/catches deoptimize in certain engines. + +var cachedSetTimeout; +var cachedClearTimeout; + +function defaultSetTimout() { + throw new Error('setTimeout has not been defined'); +} + +function defaultClearTimeout() { + throw new Error('clearTimeout has not been defined'); +} + +(function () { + try { + if (typeof setTimeout === 'function') { + cachedSetTimeout = setTimeout; + } else { + cachedSetTimeout = defaultSetTimout; + } + } catch (e) { + cachedSetTimeout = defaultSetTimout; + } + + try { + if (typeof clearTimeout === 'function') { + cachedClearTimeout = clearTimeout; + } else { + cachedClearTimeout = defaultClearTimeout; + } + } catch (e) { + cachedClearTimeout = defaultClearTimeout; + } +})(); + +function runTimeout(fun) { + if (cachedSetTimeout === setTimeout) { + //normal enviroments in sane situations + return setTimeout(fun, 0); + } // if setTimeout wasn't available but was latter defined + + + if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) { + cachedSetTimeout = setTimeout; + return setTimeout(fun, 0); + } + + try { + // when when somebody has screwed with setTimeout but no I.E. maddness + return cachedSetTimeout(fun, 0); + } catch (e) { + try { + // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally + return cachedSetTimeout.call(null, fun, 0); + } catch (e) { + // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error + return cachedSetTimeout.call(this, fun, 0); + } + } +} + +function runClearTimeout(marker) { + if (cachedClearTimeout === clearTimeout) { + //normal enviroments in sane situations + return clearTimeout(marker); + } // if clearTimeout wasn't available but was latter defined + + + if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) { + cachedClearTimeout = clearTimeout; + return clearTimeout(marker); + } + + try { + // when when somebody has screwed with setTimeout but no I.E. maddness + return cachedClearTimeout(marker); + } catch (e) { + try { + // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally + return cachedClearTimeout.call(null, marker); + } catch (e) { + // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error. + // Some versions of I.E. have different rules for clearTimeout vs setTimeout + return cachedClearTimeout.call(this, marker); + } + } +} + +var queue = []; +var draining = false; +var currentQueue; +var queueIndex = -1; + +function cleanUpNextTick() { + if (!draining || !currentQueue) { + return; + } + + draining = false; + + if (currentQueue.length) { + queue = currentQueue.concat(queue); + } else { + queueIndex = -1; + } + + if (queue.length) { + drainQueue(); + } +} + +function drainQueue() { + if (draining) { + return; + } + + var timeout = runTimeout(cleanUpNextTick); + draining = true; + var len = queue.length; + + while (len) { + currentQueue = queue; + queue = []; + + while (++queueIndex < len) { + if (currentQueue) { + currentQueue[queueIndex].run(); + } + } + + queueIndex = -1; + len = queue.length; + } + + currentQueue = null; + draining = false; + runClearTimeout(timeout); +} + +process.nextTick = function (fun) { + var args = new Array(arguments.length - 1); + + if (arguments.length > 1) { + for (var i = 1; i < arguments.length; i++) { + args[i - 1] = arguments[i]; + } + } + + queue.push(new Item(fun, args)); + + if (queue.length === 1 && !draining) { + runTimeout(drainQueue); + } +}; // v8 likes predictible objects + + +function Item(fun, array) { + this.fun = fun; + this.array = array; +} + +Item.prototype.run = function () { + this.fun.apply(null, this.array); +}; + +process.title = 'browser'; +process.browser = true; +process.env = {}; +process.argv = []; +process.version = ''; // empty string to avoid regexp issues + +process.versions = {}; + +function noop() {} + +process.on = noop; +process.addListener = noop; +process.once = noop; +process.off = noop; +process.removeListener = noop; +process.removeAllListeners = noop; +process.emit = noop; +process.prependListener = noop; +process.prependOnceListener = noop; + +process.listeners = function (name) { + return []; +}; + +process.binding = function (name) { + throw new Error('process.binding is not supported'); +}; + +process.cwd = function () { + return '/'; +}; + +process.chdir = function (dir) { + throw new Error('process.chdir is not supported'); +}; + +process.umask = function () { + return 0; +}; + +/***/ }), +/* 7 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/* eslint-disable node/no-deprecated-api */ +var buffer = __webpack_require__(0); + +var Buffer = buffer.Buffer; // alternative to using Object.keys for old browsers + +function copyProps(src, dst) { + for (var key in src) { + dst[key] = src[key]; + } +} + +if (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) { + module.exports = buffer; +} else { + // Copy properties from require('buffer') + copyProps(buffer, exports); + exports.Buffer = SafeBuffer; +} + +function SafeBuffer(arg, encodingOrOffset, length) { + return Buffer(arg, encodingOrOffset, length); +} // Copy static methods from Buffer + + +copyProps(Buffer, SafeBuffer); + +SafeBuffer.from = function (arg, encodingOrOffset, length) { + if (typeof arg === 'number') { + throw new TypeError('Argument must not be a number'); + } + + return Buffer(arg, encodingOrOffset, length); +}; + +SafeBuffer.alloc = function (size, fill, encoding) { + if (typeof size !== 'number') { + throw new TypeError('Argument must be a number'); + } + + var buf = Buffer(size); + + if (fill !== undefined) { + if (typeof encoding === 'string') { + buf.fill(fill, encoding); + } else { + buf.fill(fill); + } + } else { + buf.fill(0); + } + + return buf; +}; + +SafeBuffer.allocUnsafe = function (size) { + if (typeof size !== 'number') { + throw new TypeError('Argument must be a number'); + } + + return Buffer(size); +}; + +SafeBuffer.allocUnsafeSlow = function (size) { + if (typeof size !== 'number') { + throw new TypeError('Argument must be a number'); + } + + return buffer.SlowBuffer(size); +}; + +/***/ }), +/* 8 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Node.js module for Forge. + * + * @author Dave Longley + * + * Copyright 2011-2016 Digital Bazaar, Inc. + */ +module.exports = { + // default options + options: { + usePureJavaScript: false + } +}; + +/***/ }), +/* 9 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, setImmediate, Buffer) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** + * Utility functions for web applications. + * + * @author Dave Longley + * + * Copyright (c) 2010-2018 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +var baseN = __webpack_require__(228); +/* Utilities API */ + + +var util = module.exports = forge.util = forge.util || {}; // define setImmediate and nextTick + +(function () { + // use native nextTick (unless we're in webpack) + // webpack (or better node-libs-browser polyfill) sets process.browser. + // this way we can detect webpack properly + if (typeof process !== 'undefined' && process.nextTick && !process.browser) { + util.nextTick = process.nextTick; + + if (typeof setImmediate === 'function') { + util.setImmediate = setImmediate; + } else { + // polyfill setImmediate with nextTick, older versions of node + // (those w/o setImmediate) won't totally starve IO + util.setImmediate = util.nextTick; + } + + return; + } // polyfill nextTick with native setImmediate + + + if (typeof setImmediate === 'function') { + util.setImmediate = function () { + return setImmediate.apply(undefined, arguments); + }; + + util.nextTick = function (callback) { + return setImmediate(callback); + }; + + return; + } + /* Note: A polyfill upgrade pattern is used here to allow combining + polyfills. For example, MutationObserver is fast, but blocks UI updates, + so it needs to allow UI updates periodically, so it falls back on + postMessage or setTimeout. */ + // polyfill with setTimeout + + + util.setImmediate = function (callback) { + setTimeout(callback, 0); + }; // upgrade polyfill to use postMessage + + + if (typeof window !== 'undefined' && typeof window.postMessage === 'function') { + var handler = function handler(event) { + if (event.source === window && event.data === msg) { + event.stopPropagation(); + var copy = callbacks.slice(); + callbacks.length = 0; + copy.forEach(function (callback) { + callback(); + }); + } + }; + + var msg = 'forge.setImmediate'; + var callbacks = []; + + util.setImmediate = function (callback) { + callbacks.push(callback); // only send message when one hasn't been sent in + // the current turn of the event loop + + if (callbacks.length === 1) { + window.postMessage(msg, '*'); + } + }; + + window.addEventListener('message', handler, true); + } // upgrade polyfill to use MutationObserver + + + if (typeof MutationObserver !== 'undefined') { + // polyfill with MutationObserver + var now = Date.now(); + var attr = true; + var div = document.createElement('div'); + var callbacks = []; + new MutationObserver(function () { + var copy = callbacks.slice(); + callbacks.length = 0; + copy.forEach(function (callback) { + callback(); + }); + }).observe(div, { + attributes: true + }); + var oldSetImmediate = util.setImmediate; + + util.setImmediate = function (callback) { + if (Date.now() - now > 15) { + now = Date.now(); + oldSetImmediate(callback); + } else { + callbacks.push(callback); // only trigger observer when it hasn't been triggered in + // the current turn of the event loop + + if (callbacks.length === 1) { + div.setAttribute('a', attr = !attr); + } + } + }; + } + + util.nextTick = util.setImmediate; +})(); // check if running under Node.js + + +util.isNodejs = typeof process !== 'undefined' && process.versions && process.versions.node; // define isArray + +util.isArray = Array.isArray || function (x) { + return Object.prototype.toString.call(x) === '[object Array]'; +}; // define isArrayBuffer + + +util.isArrayBuffer = function (x) { + return typeof ArrayBuffer !== 'undefined' && x instanceof ArrayBuffer; +}; // define isArrayBufferView + + +util.isArrayBufferView = function (x) { + return x && util.isArrayBuffer(x.buffer) && x.byteLength !== undefined; +}; +/** + * Ensure a bits param is 8, 16, 24, or 32. Used to validate input for + * algorithms where bit manipulation, JavaScript limitations, and/or algorithm + * design only allow for byte operations of a limited size. + * + * @param n number of bits. + * + * Throw Error if n invalid. + */ + + +function _checkBitsParam(n) { + if (!(n === 8 || n === 16 || n === 24 || n === 32)) { + throw new Error('Only 8, 16, 24, or 32 bits supported: ' + n); + } +} // TODO: set ByteBuffer to best available backing + + +util.ByteBuffer = ByteStringBuffer; +/** Buffer w/BinaryString backing */ + +/** + * Constructor for a binary string backed byte buffer. + * + * @param [b] the bytes to wrap (either encoded as string, one byte per + * character, or as an ArrayBuffer or Typed Array). + */ + +function ByteStringBuffer(b) { + // TODO: update to match DataBuffer API + // the data in this buffer + this.data = ''; // the pointer for reading from this buffer + + this.read = 0; + + if (typeof b === 'string') { + this.data = b; + } else if (util.isArrayBuffer(b) || util.isArrayBufferView(b)) { + if (typeof Buffer !== 'undefined' && b instanceof Buffer) { + this.data = b.toString('binary'); + } else { + // convert native buffer to forge buffer + // FIXME: support native buffers internally instead + var arr = new Uint8Array(b); + + try { + this.data = String.fromCharCode.apply(null, arr); + } catch (e) { + for (var i = 0; i < arr.length; ++i) { + this.putByte(arr[i]); + } + } + } + } else if (b instanceof ByteStringBuffer || _typeof(b) === 'object' && typeof b.data === 'string' && typeof b.read === 'number') { + // copy existing buffer + this.data = b.data; + this.read = b.read; + } // used for v8 optimization + + + this._constructedStringLength = 0; +} + +util.ByteStringBuffer = ByteStringBuffer; +/* Note: This is an optimization for V8-based browsers. When V8 concatenates + a string, the strings are only joined logically using a "cons string" or + "constructed/concatenated string". These containers keep references to one + another and can result in very large memory usage. For example, if a 2MB + string is constructed by concatenating 4 bytes together at a time, the + memory usage will be ~44MB; so ~22x increase. The strings are only joined + together when an operation requiring their joining takes place, such as + substr(). This function is called when adding data to this buffer to ensure + these types of strings are periodically joined to reduce the memory + footprint. */ + +var _MAX_CONSTRUCTED_STRING_LENGTH = 4096; + +util.ByteStringBuffer.prototype._optimizeConstructedString = function (x) { + this._constructedStringLength += x; + + if (this._constructedStringLength > _MAX_CONSTRUCTED_STRING_LENGTH) { + // this substr() should cause the constructed string to join + this.data.substr(0, 1); + this._constructedStringLength = 0; + } +}; +/** + * Gets the number of bytes in this buffer. + * + * @return the number of bytes in this buffer. + */ + + +util.ByteStringBuffer.prototype.length = function () { + return this.data.length - this.read; +}; +/** + * Gets whether or not this buffer is empty. + * + * @return true if this buffer is empty, false if not. + */ + + +util.ByteStringBuffer.prototype.isEmpty = function () { + return this.length() <= 0; +}; +/** + * Puts a byte in this buffer. + * + * @param b the byte to put. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putByte = function (b) { + return this.putBytes(String.fromCharCode(b)); +}; +/** + * Puts a byte in this buffer N times. + * + * @param b the byte to put. + * @param n the number of bytes of value b to put. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.fillWithByte = function (b, n) { + b = String.fromCharCode(b); + var d = this.data; + + while (n > 0) { + if (n & 1) { + d += b; + } + + n >>>= 1; + + if (n > 0) { + b += b; + } + } + + this.data = d; + + this._optimizeConstructedString(n); + + return this; +}; +/** + * Puts bytes in this buffer. + * + * @param bytes the bytes (as a UTF-8 encoded string) to put. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putBytes = function (bytes) { + this.data += bytes; + + this._optimizeConstructedString(bytes.length); + + return this; +}; +/** + * Puts a UTF-16 encoded string into this buffer. + * + * @param str the string to put. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putString = function (str) { + return this.putBytes(util.encodeUtf8(str)); +}; +/** + * Puts a 16-bit integer in this buffer in big-endian order. + * + * @param i the 16-bit integer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt16 = function (i) { + return this.putBytes(String.fromCharCode(i >> 8 & 0xFF) + String.fromCharCode(i & 0xFF)); +}; +/** + * Puts a 24-bit integer in this buffer in big-endian order. + * + * @param i the 24-bit integer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt24 = function (i) { + return this.putBytes(String.fromCharCode(i >> 16 & 0xFF) + String.fromCharCode(i >> 8 & 0xFF) + String.fromCharCode(i & 0xFF)); +}; +/** + * Puts a 32-bit integer in this buffer in big-endian order. + * + * @param i the 32-bit integer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt32 = function (i) { + return this.putBytes(String.fromCharCode(i >> 24 & 0xFF) + String.fromCharCode(i >> 16 & 0xFF) + String.fromCharCode(i >> 8 & 0xFF) + String.fromCharCode(i & 0xFF)); +}; +/** + * Puts a 16-bit integer in this buffer in little-endian order. + * + * @param i the 16-bit integer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt16Le = function (i) { + return this.putBytes(String.fromCharCode(i & 0xFF) + String.fromCharCode(i >> 8 & 0xFF)); +}; +/** + * Puts a 24-bit integer in this buffer in little-endian order. + * + * @param i the 24-bit integer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt24Le = function (i) { + return this.putBytes(String.fromCharCode(i & 0xFF) + String.fromCharCode(i >> 8 & 0xFF) + String.fromCharCode(i >> 16 & 0xFF)); +}; +/** + * Puts a 32-bit integer in this buffer in little-endian order. + * + * @param i the 32-bit integer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt32Le = function (i) { + return this.putBytes(String.fromCharCode(i & 0xFF) + String.fromCharCode(i >> 8 & 0xFF) + String.fromCharCode(i >> 16 & 0xFF) + String.fromCharCode(i >> 24 & 0xFF)); +}; +/** + * Puts an n-bit integer in this buffer in big-endian order. + * + * @param i the n-bit integer. + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putInt = function (i, n) { + _checkBitsParam(n); + + var bytes = ''; + + do { + n -= 8; + bytes += String.fromCharCode(i >> n & 0xFF); + } while (n > 0); + + return this.putBytes(bytes); +}; +/** + * Puts a signed n-bit integer in this buffer in big-endian order. Two's + * complement representation is used. + * + * @param i the n-bit integer. + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putSignedInt = function (i, n) { + // putInt checks n + if (i < 0) { + i += 2 << n - 1; + } + + return this.putInt(i, n); +}; +/** + * Puts the given buffer into this buffer. + * + * @param buffer the buffer to put into this one. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.putBuffer = function (buffer) { + return this.putBytes(buffer.getBytes()); +}; +/** + * Gets a byte from this buffer and advances the read pointer by 1. + * + * @return the byte. + */ + + +util.ByteStringBuffer.prototype.getByte = function () { + return this.data.charCodeAt(this.read++); +}; +/** + * Gets a uint16 from this buffer in big-endian order and advances the read + * pointer by 2. + * + * @return the uint16. + */ + + +util.ByteStringBuffer.prototype.getInt16 = function () { + var rval = this.data.charCodeAt(this.read) << 8 ^ this.data.charCodeAt(this.read + 1); + this.read += 2; + return rval; +}; +/** + * Gets a uint24 from this buffer in big-endian order and advances the read + * pointer by 3. + * + * @return the uint24. + */ + + +util.ByteStringBuffer.prototype.getInt24 = function () { + var rval = this.data.charCodeAt(this.read) << 16 ^ this.data.charCodeAt(this.read + 1) << 8 ^ this.data.charCodeAt(this.read + 2); + this.read += 3; + return rval; +}; +/** + * Gets a uint32 from this buffer in big-endian order and advances the read + * pointer by 4. + * + * @return the word. + */ + + +util.ByteStringBuffer.prototype.getInt32 = function () { + var rval = this.data.charCodeAt(this.read) << 24 ^ this.data.charCodeAt(this.read + 1) << 16 ^ this.data.charCodeAt(this.read + 2) << 8 ^ this.data.charCodeAt(this.read + 3); + this.read += 4; + return rval; +}; +/** + * Gets a uint16 from this buffer in little-endian order and advances the read + * pointer by 2. + * + * @return the uint16. + */ + + +util.ByteStringBuffer.prototype.getInt16Le = function () { + var rval = this.data.charCodeAt(this.read) ^ this.data.charCodeAt(this.read + 1) << 8; + this.read += 2; + return rval; +}; +/** + * Gets a uint24 from this buffer in little-endian order and advances the read + * pointer by 3. + * + * @return the uint24. + */ + + +util.ByteStringBuffer.prototype.getInt24Le = function () { + var rval = this.data.charCodeAt(this.read) ^ this.data.charCodeAt(this.read + 1) << 8 ^ this.data.charCodeAt(this.read + 2) << 16; + this.read += 3; + return rval; +}; +/** + * Gets a uint32 from this buffer in little-endian order and advances the read + * pointer by 4. + * + * @return the word. + */ + + +util.ByteStringBuffer.prototype.getInt32Le = function () { + var rval = this.data.charCodeAt(this.read) ^ this.data.charCodeAt(this.read + 1) << 8 ^ this.data.charCodeAt(this.read + 2) << 16 ^ this.data.charCodeAt(this.read + 3) << 24; + this.read += 4; + return rval; +}; +/** + * Gets an n-bit integer from this buffer in big-endian order and advances the + * read pointer by ceil(n/8). + * + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return the integer. + */ + + +util.ByteStringBuffer.prototype.getInt = function (n) { + _checkBitsParam(n); + + var rval = 0; + + do { + // TODO: Use (rval * 0x100) if adding support for 33 to 53 bits. + rval = (rval << 8) + this.data.charCodeAt(this.read++); + n -= 8; + } while (n > 0); + + return rval; +}; +/** + * Gets a signed n-bit integer from this buffer in big-endian order, using + * two's complement, and advances the read pointer by n/8. + * + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return the integer. + */ + + +util.ByteStringBuffer.prototype.getSignedInt = function (n) { + // getInt checks n + var x = this.getInt(n); + var max = 2 << n - 2; + + if (x >= max) { + x -= max << 1; + } + + return x; +}; +/** + * Reads bytes out into a UTF-8 string and clears them from the buffer. + * + * @param count the number of bytes to read, undefined or null for all. + * + * @return a UTF-8 string of bytes. + */ + + +util.ByteStringBuffer.prototype.getBytes = function (count) { + var rval; + + if (count) { + // read count bytes + count = Math.min(this.length(), count); + rval = this.data.slice(this.read, this.read + count); + this.read += count; + } else if (count === 0) { + rval = ''; + } else { + // read all bytes, optimize to only copy when needed + rval = this.read === 0 ? this.data : this.data.slice(this.read); + this.clear(); + } + + return rval; +}; +/** + * Gets a UTF-8 encoded string of the bytes from this buffer without modifying + * the read pointer. + * + * @param count the number of bytes to get, omit to get all. + * + * @return a string full of UTF-8 encoded characters. + */ + + +util.ByteStringBuffer.prototype.bytes = function (count) { + return typeof count === 'undefined' ? this.data.slice(this.read) : this.data.slice(this.read, this.read + count); +}; +/** + * Gets a byte at the given index without modifying the read pointer. + * + * @param i the byte index. + * + * @return the byte. + */ + + +util.ByteStringBuffer.prototype.at = function (i) { + return this.data.charCodeAt(this.read + i); +}; +/** + * Puts a byte at the given index without modifying the read pointer. + * + * @param i the byte index. + * @param b the byte to put. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.setAt = function (i, b) { + this.data = this.data.substr(0, this.read + i) + String.fromCharCode(b) + this.data.substr(this.read + i + 1); + return this; +}; +/** + * Gets the last byte without modifying the read pointer. + * + * @return the last byte. + */ + + +util.ByteStringBuffer.prototype.last = function () { + return this.data.charCodeAt(this.data.length - 1); +}; +/** + * Creates a copy of this buffer. + * + * @return the copy. + */ + + +util.ByteStringBuffer.prototype.copy = function () { + var c = util.createBuffer(this.data); + c.read = this.read; + return c; +}; +/** + * Compacts this buffer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.compact = function () { + if (this.read > 0) { + this.data = this.data.slice(this.read); + this.read = 0; + } + + return this; +}; +/** + * Clears this buffer. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.clear = function () { + this.data = ''; + this.read = 0; + return this; +}; +/** + * Shortens this buffer by triming bytes off of the end of this buffer. + * + * @param count the number of bytes to trim off. + * + * @return this buffer. + */ + + +util.ByteStringBuffer.prototype.truncate = function (count) { + var len = Math.max(0, this.length() - count); + this.data = this.data.substr(this.read, len); + this.read = 0; + return this; +}; +/** + * Converts this buffer to a hexadecimal string. + * + * @return a hexadecimal string. + */ + + +util.ByteStringBuffer.prototype.toHex = function () { + var rval = ''; + + for (var i = this.read; i < this.data.length; ++i) { + var b = this.data.charCodeAt(i); + + if (b < 16) { + rval += '0'; + } + + rval += b.toString(16); + } + + return rval; +}; +/** + * Converts this buffer to a UTF-16 string (standard JavaScript string). + * + * @return a UTF-16 string. + */ + + +util.ByteStringBuffer.prototype.toString = function () { + return util.decodeUtf8(this.bytes()); +}; +/** End Buffer w/BinaryString backing */ + +/** Buffer w/UInt8Array backing */ + +/** + * FIXME: Experimental. Do not use yet. + * + * Constructor for an ArrayBuffer-backed byte buffer. + * + * The buffer may be constructed from a string, an ArrayBuffer, DataView, or a + * TypedArray. + * + * If a string is given, its encoding should be provided as an option, + * otherwise it will default to 'binary'. A 'binary' string is encoded such + * that each character is one byte in length and size. + * + * If an ArrayBuffer, DataView, or TypedArray is given, it will be used + * *directly* without any copying. Note that, if a write to the buffer requires + * more space, the buffer will allocate a new backing ArrayBuffer to + * accommodate. The starting read and write offsets for the buffer may be + * given as options. + * + * @param [b] the initial bytes for this buffer. + * @param options the options to use: + * [readOffset] the starting read offset to use (default: 0). + * [writeOffset] the starting write offset to use (default: the + * length of the first parameter). + * [growSize] the minimum amount, in bytes, to grow the buffer by to + * accommodate writes (default: 1024). + * [encoding] the encoding ('binary', 'utf8', 'utf16', 'hex') for the + * first parameter, if it is a string (default: 'binary'). + */ + + +function DataBuffer(b, options) { + // default options + options = options || {}; // pointers for read from/write to buffer + + this.read = options.readOffset || 0; + this.growSize = options.growSize || 1024; + var isArrayBuffer = util.isArrayBuffer(b); + var isArrayBufferView = util.isArrayBufferView(b); + + if (isArrayBuffer || isArrayBufferView) { + // use ArrayBuffer directly + if (isArrayBuffer) { + this.data = new DataView(b); + } else { + // TODO: adjust read/write offset based on the type of view + // or specify that this must be done in the options ... that the + // offsets are byte-based + this.data = new DataView(b.buffer, b.byteOffset, b.byteLength); + } + + this.write = 'writeOffset' in options ? options.writeOffset : this.data.byteLength; + return; + } // initialize to empty array buffer and add any given bytes using putBytes + + + this.data = new DataView(new ArrayBuffer(0)); + this.write = 0; + + if (b !== null && b !== undefined) { + this.putBytes(b); + } + + if ('writeOffset' in options) { + this.write = options.writeOffset; + } +} + +util.DataBuffer = DataBuffer; +/** + * Gets the number of bytes in this buffer. + * + * @return the number of bytes in this buffer. + */ + +util.DataBuffer.prototype.length = function () { + return this.write - this.read; +}; +/** + * Gets whether or not this buffer is empty. + * + * @return true if this buffer is empty, false if not. + */ + + +util.DataBuffer.prototype.isEmpty = function () { + return this.length() <= 0; +}; +/** + * Ensures this buffer has enough empty space to accommodate the given number + * of bytes. An optional parameter may be given that indicates a minimum + * amount to grow the buffer if necessary. If the parameter is not given, + * the buffer will be grown by some previously-specified default amount + * or heuristic. + * + * @param amount the number of bytes to accommodate. + * @param [growSize] the minimum amount, in bytes, to grow the buffer by if + * necessary. + */ + + +util.DataBuffer.prototype.accommodate = function (amount, growSize) { + if (this.length() >= amount) { + return this; + } + + growSize = Math.max(growSize || this.growSize, amount); // grow buffer + + var src = new Uint8Array(this.data.buffer, this.data.byteOffset, this.data.byteLength); + var dst = new Uint8Array(this.length() + growSize); + dst.set(src); + this.data = new DataView(dst.buffer); + return this; +}; +/** + * Puts a byte in this buffer. + * + * @param b the byte to put. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putByte = function (b) { + this.accommodate(1); + this.data.setUint8(this.write++, b); + return this; +}; +/** + * Puts a byte in this buffer N times. + * + * @param b the byte to put. + * @param n the number of bytes of value b to put. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.fillWithByte = function (b, n) { + this.accommodate(n); + + for (var i = 0; i < n; ++i) { + this.data.setUint8(b); + } + + return this; +}; +/** + * Puts bytes in this buffer. The bytes may be given as a string, an + * ArrayBuffer, a DataView, or a TypedArray. + * + * @param bytes the bytes to put. + * @param [encoding] the encoding for the first parameter ('binary', 'utf8', + * 'utf16', 'hex'), if it is a string (default: 'binary'). + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putBytes = function (bytes, encoding) { + if (util.isArrayBufferView(bytes)) { + var src = new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength); + var len = src.byteLength - src.byteOffset; + this.accommodate(len); + var dst = new Uint8Array(this.data.buffer, this.write); + dst.set(src); + this.write += len; + return this; + } + + if (util.isArrayBuffer(bytes)) { + var src = new Uint8Array(bytes); + this.accommodate(src.byteLength); + var dst = new Uint8Array(this.data.buffer); + dst.set(src, this.write); + this.write += src.byteLength; + return this; + } // bytes is a util.DataBuffer or equivalent + + + if (bytes instanceof util.DataBuffer || _typeof(bytes) === 'object' && typeof bytes.read === 'number' && typeof bytes.write === 'number' && util.isArrayBufferView(bytes.data)) { + var src = new Uint8Array(bytes.data.byteLength, bytes.read, bytes.length()); + this.accommodate(src.byteLength); + var dst = new Uint8Array(bytes.data.byteLength, this.write); + dst.set(src); + this.write += src.byteLength; + return this; + } + + if (bytes instanceof util.ByteStringBuffer) { + // copy binary string and process as the same as a string parameter below + bytes = bytes.data; + encoding = 'binary'; + } // string conversion + + + encoding = encoding || 'binary'; + + if (typeof bytes === 'string') { + var view; // decode from string + + if (encoding === 'hex') { + this.accommodate(Math.ceil(bytes.length / 2)); + view = new Uint8Array(this.data.buffer, this.write); + this.write += util.binary.hex.decode(bytes, view, this.write); + return this; + } + + if (encoding === 'base64') { + this.accommodate(Math.ceil(bytes.length / 4) * 3); + view = new Uint8Array(this.data.buffer, this.write); + this.write += util.binary.base64.decode(bytes, view, this.write); + return this; + } // encode text as UTF-8 bytes + + + if (encoding === 'utf8') { + // encode as UTF-8 then decode string as raw binary + bytes = util.encodeUtf8(bytes); + encoding = 'binary'; + } // decode string as raw binary + + + if (encoding === 'binary' || encoding === 'raw') { + // one byte per character + this.accommodate(bytes.length); + view = new Uint8Array(this.data.buffer, this.write); + this.write += util.binary.raw.decode(view); + return this; + } // encode text as UTF-16 bytes + + + if (encoding === 'utf16') { + // two bytes per character + this.accommodate(bytes.length * 2); + view = new Uint16Array(this.data.buffer, this.write); + this.write += util.text.utf16.encode(view); + return this; + } + + throw new Error('Invalid encoding: ' + encoding); + } + + throw Error('Invalid parameter: ' + bytes); +}; +/** + * Puts the given buffer into this buffer. + * + * @param buffer the buffer to put into this one. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putBuffer = function (buffer) { + this.putBytes(buffer); + buffer.clear(); + return this; +}; +/** + * Puts a string into this buffer. + * + * @param str the string to put. + * @param [encoding] the encoding for the string (default: 'utf16'). + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putString = function (str) { + return this.putBytes(str, 'utf16'); +}; +/** + * Puts a 16-bit integer in this buffer in big-endian order. + * + * @param i the 16-bit integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt16 = function (i) { + this.accommodate(2); + this.data.setInt16(this.write, i); + this.write += 2; + return this; +}; +/** + * Puts a 24-bit integer in this buffer in big-endian order. + * + * @param i the 24-bit integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt24 = function (i) { + this.accommodate(3); + this.data.setInt16(this.write, i >> 8 & 0xFFFF); + this.data.setInt8(this.write, i >> 16 & 0xFF); + this.write += 3; + return this; +}; +/** + * Puts a 32-bit integer in this buffer in big-endian order. + * + * @param i the 32-bit integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt32 = function (i) { + this.accommodate(4); + this.data.setInt32(this.write, i); + this.write += 4; + return this; +}; +/** + * Puts a 16-bit integer in this buffer in little-endian order. + * + * @param i the 16-bit integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt16Le = function (i) { + this.accommodate(2); + this.data.setInt16(this.write, i, true); + this.write += 2; + return this; +}; +/** + * Puts a 24-bit integer in this buffer in little-endian order. + * + * @param i the 24-bit integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt24Le = function (i) { + this.accommodate(3); + this.data.setInt8(this.write, i >> 16 & 0xFF); + this.data.setInt16(this.write, i >> 8 & 0xFFFF, true); + this.write += 3; + return this; +}; +/** + * Puts a 32-bit integer in this buffer in little-endian order. + * + * @param i the 32-bit integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt32Le = function (i) { + this.accommodate(4); + this.data.setInt32(this.write, i, true); + this.write += 4; + return this; +}; +/** + * Puts an n-bit integer in this buffer in big-endian order. + * + * @param i the n-bit integer. + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putInt = function (i, n) { + _checkBitsParam(n); + + this.accommodate(n / 8); + + do { + n -= 8; + this.data.setInt8(this.write++, i >> n & 0xFF); + } while (n > 0); + + return this; +}; +/** + * Puts a signed n-bit integer in this buffer in big-endian order. Two's + * complement representation is used. + * + * @param i the n-bit integer. + * @param n the number of bits in the integer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.putSignedInt = function (i, n) { + _checkBitsParam(n); + + this.accommodate(n / 8); + + if (i < 0) { + i += 2 << n - 1; + } + + return this.putInt(i, n); +}; +/** + * Gets a byte from this buffer and advances the read pointer by 1. + * + * @return the byte. + */ + + +util.DataBuffer.prototype.getByte = function () { + return this.data.getInt8(this.read++); +}; +/** + * Gets a uint16 from this buffer in big-endian order and advances the read + * pointer by 2. + * + * @return the uint16. + */ + + +util.DataBuffer.prototype.getInt16 = function () { + var rval = this.data.getInt16(this.read); + this.read += 2; + return rval; +}; +/** + * Gets a uint24 from this buffer in big-endian order and advances the read + * pointer by 3. + * + * @return the uint24. + */ + + +util.DataBuffer.prototype.getInt24 = function () { + var rval = this.data.getInt16(this.read) << 8 ^ this.data.getInt8(this.read + 2); + this.read += 3; + return rval; +}; +/** + * Gets a uint32 from this buffer in big-endian order and advances the read + * pointer by 4. + * + * @return the word. + */ + + +util.DataBuffer.prototype.getInt32 = function () { + var rval = this.data.getInt32(this.read); + this.read += 4; + return rval; +}; +/** + * Gets a uint16 from this buffer in little-endian order and advances the read + * pointer by 2. + * + * @return the uint16. + */ + + +util.DataBuffer.prototype.getInt16Le = function () { + var rval = this.data.getInt16(this.read, true); + this.read += 2; + return rval; +}; +/** + * Gets a uint24 from this buffer in little-endian order and advances the read + * pointer by 3. + * + * @return the uint24. + */ + + +util.DataBuffer.prototype.getInt24Le = function () { + var rval = this.data.getInt8(this.read) ^ this.data.getInt16(this.read + 1, true) << 8; + this.read += 3; + return rval; +}; +/** + * Gets a uint32 from this buffer in little-endian order and advances the read + * pointer by 4. + * + * @return the word. + */ + + +util.DataBuffer.prototype.getInt32Le = function () { + var rval = this.data.getInt32(this.read, true); + this.read += 4; + return rval; +}; +/** + * Gets an n-bit integer from this buffer in big-endian order and advances the + * read pointer by n/8. + * + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return the integer. + */ + + +util.DataBuffer.prototype.getInt = function (n) { + _checkBitsParam(n); + + var rval = 0; + + do { + // TODO: Use (rval * 0x100) if adding support for 33 to 53 bits. + rval = (rval << 8) + this.data.getInt8(this.read++); + n -= 8; + } while (n > 0); + + return rval; +}; +/** + * Gets a signed n-bit integer from this buffer in big-endian order, using + * two's complement, and advances the read pointer by n/8. + * + * @param n the number of bits in the integer (8, 16, 24, or 32). + * + * @return the integer. + */ + + +util.DataBuffer.prototype.getSignedInt = function (n) { + // getInt checks n + var x = this.getInt(n); + var max = 2 << n - 2; + + if (x >= max) { + x -= max << 1; + } + + return x; +}; +/** + * Reads bytes out into a UTF-8 string and clears them from the buffer. + * + * @param count the number of bytes to read, undefined or null for all. + * + * @return a UTF-8 string of bytes. + */ + + +util.DataBuffer.prototype.getBytes = function (count) { + // TODO: deprecate this method, it is poorly named and + // this.toString('binary') replaces it + // add a toTypedArray()/toArrayBuffer() function + var rval; + + if (count) { + // read count bytes + count = Math.min(this.length(), count); + rval = this.data.slice(this.read, this.read + count); + this.read += count; + } else if (count === 0) { + rval = ''; + } else { + // read all bytes, optimize to only copy when needed + rval = this.read === 0 ? this.data : this.data.slice(this.read); + this.clear(); + } + + return rval; +}; +/** + * Gets a UTF-8 encoded string of the bytes from this buffer without modifying + * the read pointer. + * + * @param count the number of bytes to get, omit to get all. + * + * @return a string full of UTF-8 encoded characters. + */ + + +util.DataBuffer.prototype.bytes = function (count) { + // TODO: deprecate this method, it is poorly named, add "getString()" + return typeof count === 'undefined' ? this.data.slice(this.read) : this.data.slice(this.read, this.read + count); +}; +/** + * Gets a byte at the given index without modifying the read pointer. + * + * @param i the byte index. + * + * @return the byte. + */ + + +util.DataBuffer.prototype.at = function (i) { + return this.data.getUint8(this.read + i); +}; +/** + * Puts a byte at the given index without modifying the read pointer. + * + * @param i the byte index. + * @param b the byte to put. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.setAt = function (i, b) { + this.data.setUint8(i, b); + return this; +}; +/** + * Gets the last byte without modifying the read pointer. + * + * @return the last byte. + */ + + +util.DataBuffer.prototype.last = function () { + return this.data.getUint8(this.write - 1); +}; +/** + * Creates a copy of this buffer. + * + * @return the copy. + */ + + +util.DataBuffer.prototype.copy = function () { + return new util.DataBuffer(this); +}; +/** + * Compacts this buffer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.compact = function () { + if (this.read > 0) { + var src = new Uint8Array(this.data.buffer, this.read); + var dst = new Uint8Array(src.byteLength); + dst.set(src); + this.data = new DataView(dst); + this.write -= this.read; + this.read = 0; + } + + return this; +}; +/** + * Clears this buffer. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.clear = function () { + this.data = new DataView(new ArrayBuffer(0)); + this.read = this.write = 0; + return this; +}; +/** + * Shortens this buffer by triming bytes off of the end of this buffer. + * + * @param count the number of bytes to trim off. + * + * @return this buffer. + */ + + +util.DataBuffer.prototype.truncate = function (count) { + this.write = Math.max(0, this.length() - count); + this.read = Math.min(this.read, this.write); + return this; +}; +/** + * Converts this buffer to a hexadecimal string. + * + * @return a hexadecimal string. + */ + + +util.DataBuffer.prototype.toHex = function () { + var rval = ''; + + for (var i = this.read; i < this.data.byteLength; ++i) { + var b = this.data.getUint8(i); + + if (b < 16) { + rval += '0'; + } + + rval += b.toString(16); + } + + return rval; +}; +/** + * Converts this buffer to a string, using the given encoding. If no + * encoding is given, 'utf8' (UTF-8) is used. + * + * @param [encoding] the encoding to use: 'binary', 'utf8', 'utf16', 'hex', + * 'base64' (default: 'utf8'). + * + * @return a string representation of the bytes in this buffer. + */ + + +util.DataBuffer.prototype.toString = function (encoding) { + var view = new Uint8Array(this.data, this.read, this.length()); + encoding = encoding || 'utf8'; // encode to string + + if (encoding === 'binary' || encoding === 'raw') { + return util.binary.raw.encode(view); + } + + if (encoding === 'hex') { + return util.binary.hex.encode(view); + } + + if (encoding === 'base64') { + return util.binary.base64.encode(view); + } // decode to text + + + if (encoding === 'utf8') { + return util.text.utf8.decode(view); + } + + if (encoding === 'utf16') { + return util.text.utf16.decode(view); + } + + throw new Error('Invalid encoding: ' + encoding); +}; +/** End Buffer w/UInt8Array backing */ + +/** + * Creates a buffer that stores bytes. A value may be given to put into the + * buffer that is either a string of bytes or a UTF-16 string that will + * be encoded using UTF-8 (to do the latter, specify 'utf8' as the encoding). + * + * @param [input] the bytes to wrap (as a string) or a UTF-16 string to encode + * as UTF-8. + * @param [encoding] (default: 'raw', other: 'utf8'). + */ + + +util.createBuffer = function (input, encoding) { + // TODO: deprecate, use new ByteBuffer() instead + encoding = encoding || 'raw'; + + if (input !== undefined && encoding === 'utf8') { + input = util.encodeUtf8(input); + } + + return new util.ByteBuffer(input); +}; +/** + * Fills a string with a particular value. If you want the string to be a byte + * string, pass in String.fromCharCode(theByte). + * + * @param c the character to fill the string with, use String.fromCharCode + * to fill the string with a byte value. + * @param n the number of characters of value c to fill with. + * + * @return the filled string. + */ + + +util.fillString = function (c, n) { + var s = ''; + + while (n > 0) { + if (n & 1) { + s += c; + } + + n >>>= 1; + + if (n > 0) { + c += c; + } + } + + return s; +}; +/** + * Performs a per byte XOR between two byte strings and returns the result as a + * string of bytes. + * + * @param s1 first string of bytes. + * @param s2 second string of bytes. + * @param n the number of bytes to XOR. + * + * @return the XOR'd result. + */ + + +util.xorBytes = function (s1, s2, n) { + var s3 = ''; + var b = ''; + var t = ''; + var i = 0; + var c = 0; + + for (; n > 0; --n, ++i) { + b = s1.charCodeAt(i) ^ s2.charCodeAt(i); + + if (c >= 10) { + s3 += t; + t = ''; + c = 0; + } + + t += String.fromCharCode(b); + ++c; + } + + s3 += t; + return s3; +}; +/** + * Converts a hex string into a 'binary' encoded string of bytes. + * + * @param hex the hexadecimal string to convert. + * + * @return the binary-encoded string of bytes. + */ + + +util.hexToBytes = function (hex) { + // TODO: deprecate: "Deprecated. Use util.binary.hex.decode instead." + var rval = ''; + var i = 0; + + if (hex.length & 1 == 1) { + // odd number of characters, convert first character alone + i = 1; + rval += String.fromCharCode(parseInt(hex[0], 16)); + } // convert 2 characters (1 byte) at a time + + + for (; i < hex.length; i += 2) { + rval += String.fromCharCode(parseInt(hex.substr(i, 2), 16)); + } + + return rval; +}; +/** + * Converts a 'binary' encoded string of bytes to hex. + * + * @param bytes the byte string to convert. + * + * @return the string of hexadecimal characters. + */ + + +util.bytesToHex = function (bytes) { + // TODO: deprecate: "Deprecated. Use util.binary.hex.encode instead." + return util.createBuffer(bytes).toHex(); +}; +/** + * Converts an 32-bit integer to 4-big-endian byte string. + * + * @param i the integer. + * + * @return the byte string. + */ + + +util.int32ToBytes = function (i) { + return String.fromCharCode(i >> 24 & 0xFF) + String.fromCharCode(i >> 16 & 0xFF) + String.fromCharCode(i >> 8 & 0xFF) + String.fromCharCode(i & 0xFF); +}; // base64 characters, reverse mapping + + +var _base64 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='; +var _base64Idx = [ +/*43 -43 = 0*/ + +/*'+', 1, 2, 3,'/' */ +62, -1, -1, -1, 63, +/*'0','1','2','3','4','5','6','7','8','9' */ +52, 53, 54, 55, 56, 57, 58, 59, 60, 61, +/*15, 16, 17,'=', 19, 20, 21 */ +-1, -1, -1, 64, -1, -1, -1, +/*65 - 43 = 22*/ + +/*'A','B','C','D','E','F','G','H','I','J','K','L','M', */ +0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, +/*'N','O','P','Q','R','S','T','U','V','W','X','Y','Z' */ +13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, +/*91 - 43 = 48 */ + +/*48, 49, 50, 51, 52, 53 */ +-1, -1, -1, -1, -1, -1, +/*97 - 43 = 54*/ + +/*'a','b','c','d','e','f','g','h','i','j','k','l','m' */ +26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, +/*'n','o','p','q','r','s','t','u','v','w','x','y','z' */ +39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]; // base58 characters (Bitcoin alphabet) + +var _base58 = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'; +/** + * Base64 encodes a 'binary' encoded string of bytes. + * + * @param input the binary encoded string of bytes to base64-encode. + * @param maxline the maximum number of encoded characters per line to use, + * defaults to none. + * + * @return the base64-encoded output. + */ + +util.encode64 = function (input, maxline) { + // TODO: deprecate: "Deprecated. Use util.binary.base64.encode instead." + var line = ''; + var output = ''; + var chr1, chr2, chr3; + var i = 0; + + while (i < input.length) { + chr1 = input.charCodeAt(i++); + chr2 = input.charCodeAt(i++); + chr3 = input.charCodeAt(i++); // encode 4 character group + + line += _base64.charAt(chr1 >> 2); + line += _base64.charAt((chr1 & 3) << 4 | chr2 >> 4); + + if (isNaN(chr2)) { + line += '=='; + } else { + line += _base64.charAt((chr2 & 15) << 2 | chr3 >> 6); + line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63); + } + + if (maxline && line.length > maxline) { + output += line.substr(0, maxline) + '\r\n'; + line = line.substr(maxline); + } + } + + output += line; + return output; +}; +/** + * Base64 decodes a string into a 'binary' encoded string of bytes. + * + * @param input the base64-encoded input. + * + * @return the binary encoded string. + */ + + +util.decode64 = function (input) { + // TODO: deprecate: "Deprecated. Use util.binary.base64.decode instead." + // remove all non-base64 characters + input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ''); + var output = ''; + var enc1, enc2, enc3, enc4; + var i = 0; + + while (i < input.length) { + enc1 = _base64Idx[input.charCodeAt(i++) - 43]; + enc2 = _base64Idx[input.charCodeAt(i++) - 43]; + enc3 = _base64Idx[input.charCodeAt(i++) - 43]; + enc4 = _base64Idx[input.charCodeAt(i++) - 43]; + output += String.fromCharCode(enc1 << 2 | enc2 >> 4); + + if (enc3 !== 64) { + // decoded at least 2 bytes + output += String.fromCharCode((enc2 & 15) << 4 | enc3 >> 2); + + if (enc4 !== 64) { + // decoded 3 bytes + output += String.fromCharCode((enc3 & 3) << 6 | enc4); + } + } + } + + return output; +}; +/** + * UTF-8 encodes the given UTF-16 encoded string (a standard JavaScript + * string). Non-ASCII characters will be encoded as multiple bytes according + * to UTF-8. + * + * @param str the string to encode. + * + * @return the UTF-8 encoded string. + */ + + +util.encodeUtf8 = function (str) { + return unescape(encodeURIComponent(str)); +}; +/** + * Decodes a UTF-8 encoded string into a UTF-16 string. + * + * @param str the string to decode. + * + * @return the UTF-16 encoded string (standard JavaScript string). + */ + + +util.decodeUtf8 = function (str) { + return decodeURIComponent(escape(str)); +}; // binary encoding/decoding tools +// FIXME: Experimental. Do not use yet. + + +util.binary = { + raw: {}, + hex: {}, + base64: {}, + base58: {}, + baseN: { + encode: baseN.encode, + decode: baseN.decode + } +}; +/** + * Encodes a Uint8Array as a binary-encoded string. This encoding uses + * a value between 0 and 255 for each character. + * + * @param bytes the Uint8Array to encode. + * + * @return the binary-encoded string. + */ + +util.binary.raw.encode = function (bytes) { + return String.fromCharCode.apply(null, bytes); +}; +/** + * Decodes a binary-encoded string to a Uint8Array. This encoding uses + * a value between 0 and 255 for each character. + * + * @param str the binary-encoded string to decode. + * @param [output] an optional Uint8Array to write the output to; if it + * is too small, an exception will be thrown. + * @param [offset] the start offset for writing to the output (default: 0). + * + * @return the Uint8Array or the number of bytes written if output was given. + */ + + +util.binary.raw.decode = function (str, output, offset) { + var out = output; + + if (!out) { + out = new Uint8Array(str.length); + } + + offset = offset || 0; + var j = offset; + + for (var i = 0; i < str.length; ++i) { + out[j++] = str.charCodeAt(i); + } + + return output ? j - offset : out; +}; +/** + * Encodes a 'binary' string, ArrayBuffer, DataView, TypedArray, or + * ByteBuffer as a string of hexadecimal characters. + * + * @param bytes the bytes to convert. + * + * @return the string of hexadecimal characters. + */ + + +util.binary.hex.encode = util.bytesToHex; +/** + * Decodes a hex-encoded string to a Uint8Array. + * + * @param hex the hexadecimal string to convert. + * @param [output] an optional Uint8Array to write the output to; if it + * is too small, an exception will be thrown. + * @param [offset] the start offset for writing to the output (default: 0). + * + * @return the Uint8Array or the number of bytes written if output was given. + */ + +util.binary.hex.decode = function (hex, output, offset) { + var out = output; + + if (!out) { + out = new Uint8Array(Math.ceil(hex.length / 2)); + } + + offset = offset || 0; + var i = 0, + j = offset; + + if (hex.length & 1) { + // odd number of characters, convert first character alone + i = 1; + out[j++] = parseInt(hex[0], 16); + } // convert 2 characters (1 byte) at a time + + + for (; i < hex.length; i += 2) { + out[j++] = parseInt(hex.substr(i, 2), 16); + } + + return output ? j - offset : out; +}; +/** + * Base64-encodes a Uint8Array. + * + * @param input the Uint8Array to encode. + * @param maxline the maximum number of encoded characters per line to use, + * defaults to none. + * + * @return the base64-encoded output string. + */ + + +util.binary.base64.encode = function (input, maxline) { + var line = ''; + var output = ''; + var chr1, chr2, chr3; + var i = 0; + + while (i < input.byteLength) { + chr1 = input[i++]; + chr2 = input[i++]; + chr3 = input[i++]; // encode 4 character group + + line += _base64.charAt(chr1 >> 2); + line += _base64.charAt((chr1 & 3) << 4 | chr2 >> 4); + + if (isNaN(chr2)) { + line += '=='; + } else { + line += _base64.charAt((chr2 & 15) << 2 | chr3 >> 6); + line += isNaN(chr3) ? '=' : _base64.charAt(chr3 & 63); + } + + if (maxline && line.length > maxline) { + output += line.substr(0, maxline) + '\r\n'; + line = line.substr(maxline); + } + } + + output += line; + return output; +}; +/** + * Decodes a base64-encoded string to a Uint8Array. + * + * @param input the base64-encoded input string. + * @param [output] an optional Uint8Array to write the output to; if it + * is too small, an exception will be thrown. + * @param [offset] the start offset for writing to the output (default: 0). + * + * @return the Uint8Array or the number of bytes written if output was given. + */ + + +util.binary.base64.decode = function (input, output, offset) { + var out = output; + + if (!out) { + out = new Uint8Array(Math.ceil(input.length / 4) * 3); + } // remove all non-base64 characters + + + input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ''); + offset = offset || 0; + var enc1, enc2, enc3, enc4; + var i = 0, + j = offset; + + while (i < input.length) { + enc1 = _base64Idx[input.charCodeAt(i++) - 43]; + enc2 = _base64Idx[input.charCodeAt(i++) - 43]; + enc3 = _base64Idx[input.charCodeAt(i++) - 43]; + enc4 = _base64Idx[input.charCodeAt(i++) - 43]; + out[j++] = enc1 << 2 | enc2 >> 4; + + if (enc3 !== 64) { + // decoded at least 2 bytes + out[j++] = (enc2 & 15) << 4 | enc3 >> 2; + + if (enc4 !== 64) { + // decoded 3 bytes + out[j++] = (enc3 & 3) << 6 | enc4; + } + } + } // make sure result is the exact decoded length + + + return output ? j - offset : out.subarray(0, j); +}; // add support for base58 encoding/decoding with Bitcoin alphabet + + +util.binary.base58.encode = function (input, maxline) { + return util.binary.baseN.encode(input, _base58, maxline); +}; + +util.binary.base58.decode = function (input, maxline) { + return util.binary.baseN.decode(input, _base58, maxline); +}; // text encoding/decoding tools +// FIXME: Experimental. Do not use yet. + + +util.text = { + utf8: {}, + utf16: {} +}; +/** + * Encodes the given string as UTF-8 in a Uint8Array. + * + * @param str the string to encode. + * @param [output] an optional Uint8Array to write the output to; if it + * is too small, an exception will be thrown. + * @param [offset] the start offset for writing to the output (default: 0). + * + * @return the Uint8Array or the number of bytes written if output was given. + */ + +util.text.utf8.encode = function (str, output, offset) { + str = util.encodeUtf8(str); + var out = output; + + if (!out) { + out = new Uint8Array(str.length); + } + + offset = offset || 0; + var j = offset; + + for (var i = 0; i < str.length; ++i) { + out[j++] = str.charCodeAt(i); + } + + return output ? j - offset : out; +}; +/** + * Decodes the UTF-8 contents from a Uint8Array. + * + * @param bytes the Uint8Array to decode. + * + * @return the resulting string. + */ + + +util.text.utf8.decode = function (bytes) { + return util.decodeUtf8(String.fromCharCode.apply(null, bytes)); +}; +/** + * Encodes the given string as UTF-16 in a Uint8Array. + * + * @param str the string to encode. + * @param [output] an optional Uint8Array to write the output to; if it + * is too small, an exception will be thrown. + * @param [offset] the start offset for writing to the output (default: 0). + * + * @return the Uint8Array or the number of bytes written if output was given. + */ + + +util.text.utf16.encode = function (str, output, offset) { + var out = output; + + if (!out) { + out = new Uint8Array(str.length * 2); + } + + var view = new Uint16Array(out.buffer); + offset = offset || 0; + var j = offset; + var k = offset; + + for (var i = 0; i < str.length; ++i) { + view[k++] = str.charCodeAt(i); + j += 2; + } + + return output ? j - offset : out; +}; +/** + * Decodes the UTF-16 contents from a Uint8Array. + * + * @param bytes the Uint8Array to decode. + * + * @return the resulting string. + */ + + +util.text.utf16.decode = function (bytes) { + return String.fromCharCode.apply(null, new Uint16Array(bytes.buffer)); +}; +/** + * Deflates the given data using a flash interface. + * + * @param api the flash interface. + * @param bytes the data. + * @param raw true to return only raw deflate data, false to include zlib + * header and trailer. + * + * @return the deflated data as a string. + */ + + +util.deflate = function (api, bytes, raw) { + bytes = util.decode64(api.deflate(util.encode64(bytes)).rval); // strip zlib header and trailer if necessary + + if (raw) { + // zlib header is 2 bytes (CMF,FLG) where FLG indicates that + // there is a 4-byte DICT (alder-32) block before the data if + // its 5th bit is set + var start = 2; + var flg = bytes.charCodeAt(1); + + if (flg & 0x20) { + start = 6; + } // zlib trailer is 4 bytes of adler-32 + + + bytes = bytes.substring(start, bytes.length - 4); + } + + return bytes; +}; +/** + * Inflates the given data using a flash interface. + * + * @param api the flash interface. + * @param bytes the data. + * @param raw true if the incoming data has no zlib header or trailer and is + * raw DEFLATE data. + * + * @return the inflated data as a string, null on error. + */ + + +util.inflate = function (api, bytes, raw) { + // TODO: add zlib header and trailer if necessary/possible + var rval = api.inflate(util.encode64(bytes)).rval; + return rval === null ? null : util.decode64(rval); +}; +/** + * Sets a storage object. + * + * @param api the storage interface. + * @param id the storage ID to use. + * @param obj the storage object, null to remove. + */ + + +var _setStorageObject = function _setStorageObject(api, id, obj) { + if (!api) { + throw new Error('WebStorage not available.'); + } + + var rval; + + if (obj === null) { + rval = api.removeItem(id); + } else { + // json-encode and base64-encode object + obj = util.encode64(JSON.stringify(obj)); + rval = api.setItem(id, obj); + } // handle potential flash error + + + if (typeof rval !== 'undefined' && rval.rval !== true) { + var error = new Error(rval.error.message); + error.id = rval.error.id; + error.name = rval.error.name; + throw error; + } +}; +/** + * Gets a storage object. + * + * @param api the storage interface. + * @param id the storage ID to use. + * + * @return the storage object entry or null if none exists. + */ + + +var _getStorageObject = function _getStorageObject(api, id) { + if (!api) { + throw new Error('WebStorage not available.'); + } // get the existing entry + + + var rval = api.getItem(id); + /* Note: We check api.init because we can't do (api == localStorage) + on IE because of "Class doesn't support Automation" exception. Only + the flash api has an init method so this works too, but we need a + better solution in the future. */ + // flash returns item wrapped in an object, handle special case + + if (api.init) { + if (rval.rval === null) { + if (rval.error) { + var error = new Error(rval.error.message); + error.id = rval.error.id; + error.name = rval.error.name; + throw error; + } // no error, but also no item + + + rval = null; + } else { + rval = rval.rval; + } + } // handle decoding + + + if (rval !== null) { + // base64-decode and json-decode data + rval = JSON.parse(util.decode64(rval)); + } + + return rval; +}; +/** + * Stores an item in local storage. + * + * @param api the storage interface. + * @param id the storage ID to use. + * @param key the key for the item. + * @param data the data for the item (any javascript object/primitive). + */ + + +var _setItem = function _setItem(api, id, key, data) { + // get storage object + var obj = _getStorageObject(api, id); + + if (obj === null) { + // create a new storage object + obj = {}; + } // update key + + + obj[key] = data; // set storage object + + _setStorageObject(api, id, obj); +}; +/** + * Gets an item from local storage. + * + * @param api the storage interface. + * @param id the storage ID to use. + * @param key the key for the item. + * + * @return the item. + */ + + +var _getItem = function _getItem(api, id, key) { + // get storage object + var rval = _getStorageObject(api, id); + + if (rval !== null) { + // return data at key + rval = key in rval ? rval[key] : null; + } + + return rval; +}; +/** + * Removes an item from local storage. + * + * @param api the storage interface. + * @param id the storage ID to use. + * @param key the key for the item. + */ + + +var _removeItem = function _removeItem(api, id, key) { + // get storage object + var obj = _getStorageObject(api, id); + + if (obj !== null && key in obj) { + // remove key + delete obj[key]; // see if entry has no keys remaining + + var empty = true; + + for (var prop in obj) { + empty = false; + break; + } + + if (empty) { + // remove entry entirely if no keys are left + obj = null; + } // set storage object + + + _setStorageObject(api, id, obj); + } +}; +/** + * Clears the local disk storage identified by the given ID. + * + * @param api the storage interface. + * @param id the storage ID to use. + */ + + +var _clearItems = function _clearItems(api, id) { + _setStorageObject(api, id, null); +}; +/** + * Calls a storage function. + * + * @param func the function to call. + * @param args the arguments for the function. + * @param location the location argument. + * + * @return the return value from the function. + */ + + +var _callStorageFunction = function _callStorageFunction(func, args, location) { + var rval = null; // default storage types + + if (typeof location === 'undefined') { + location = ['web', 'flash']; + } // apply storage types in order of preference + + + var type; + var done = false; + var exception = null; + + for (var idx in location) { + type = location[idx]; + + try { + if (type === 'flash' || type === 'both') { + if (args[0] === null) { + throw new Error('Flash local storage not available.'); + } + + rval = func.apply(this, args); + done = type === 'flash'; + } + + if (type === 'web' || type === 'both') { + args[0] = localStorage; + rval = func.apply(this, args); + done = true; + } + } catch (ex) { + exception = ex; + } + + if (done) { + break; + } + } + + if (!done) { + throw exception; + } + + return rval; +}; +/** + * Stores an item on local disk. + * + * The available types of local storage include 'flash', 'web', and 'both'. + * + * The type 'flash' refers to flash local storage (SharedObject). In order + * to use flash local storage, the 'api' parameter must be valid. The type + * 'web' refers to WebStorage, if supported by the browser. The type 'both' + * refers to storing using both 'flash' and 'web', not just one or the + * other. + * + * The location array should list the storage types to use in order of + * preference: + * + * ['flash']: flash only storage + * ['web']: web only storage + * ['both']: try to store in both + * ['flash','web']: store in flash first, but if not available, 'web' + * ['web','flash']: store in web first, but if not available, 'flash' + * + * The location array defaults to: ['web', 'flash'] + * + * @param api the flash interface, null to use only WebStorage. + * @param id the storage ID to use. + * @param key the key for the item. + * @param data the data for the item (any javascript object/primitive). + * @param location an array with the preferred types of storage to use. + */ + + +util.setItem = function (api, id, key, data, location) { + _callStorageFunction(_setItem, arguments, location); +}; +/** + * Gets an item on local disk. + * + * Set setItem() for details on storage types. + * + * @param api the flash interface, null to use only WebStorage. + * @param id the storage ID to use. + * @param key the key for the item. + * @param location an array with the preferred types of storage to use. + * + * @return the item. + */ + + +util.getItem = function (api, id, key, location) { + return _callStorageFunction(_getItem, arguments, location); +}; +/** + * Removes an item on local disk. + * + * Set setItem() for details on storage types. + * + * @param api the flash interface. + * @param id the storage ID to use. + * @param key the key for the item. + * @param location an array with the preferred types of storage to use. + */ + + +util.removeItem = function (api, id, key, location) { + _callStorageFunction(_removeItem, arguments, location); +}; +/** + * Clears the local disk storage identified by the given ID. + * + * Set setItem() for details on storage types. + * + * @param api the flash interface if flash is available. + * @param id the storage ID to use. + * @param location an array with the preferred types of storage to use. + */ + + +util.clearItems = function (api, id, location) { + _callStorageFunction(_clearItems, arguments, location); +}; +/** + * Parses the scheme, host, and port from an http(s) url. + * + * @param str the url string. + * + * @return the parsed url object or null if the url is invalid. + */ + + +util.parseUrl = function (str) { + // FIXME: this regex looks a bit broken + var regex = /^(https?):\/\/([^:&^\/]*):?(\d*)(.*)$/g; + regex.lastIndex = 0; + var m = regex.exec(str); + var url = m === null ? null : { + full: str, + scheme: m[1], + host: m[2], + port: m[3], + path: m[4] + }; + + if (url) { + url.fullHost = url.host; + + if (url.port) { + if (url.port !== 80 && url.scheme === 'http') { + url.fullHost += ':' + url.port; + } else if (url.port !== 443 && url.scheme === 'https') { + url.fullHost += ':' + url.port; + } + } else if (url.scheme === 'http') { + url.port = 80; + } else if (url.scheme === 'https') { + url.port = 443; + } + + url.full = url.scheme + '://' + url.fullHost; + } + + return url; +}; +/* Storage for query variables */ + + +var _queryVariables = null; +/** + * Returns the window location query variables. Query is parsed on the first + * call and the same object is returned on subsequent calls. The mapping + * is from keys to an array of values. Parameters without values will have + * an object key set but no value added to the value array. Values are + * unescaped. + * + * ...?k1=v1&k2=v2: + * { + * "k1": ["v1"], + * "k2": ["v2"] + * } + * + * ...?k1=v1&k1=v2: + * { + * "k1": ["v1", "v2"] + * } + * + * ...?k1=v1&k2: + * { + * "k1": ["v1"], + * "k2": [] + * } + * + * ...?k1=v1&k1: + * { + * "k1": ["v1"] + * } + * + * ...?k1&k1: + * { + * "k1": [] + * } + * + * @param query the query string to parse (optional, default to cached + * results from parsing window location search query). + * + * @return object mapping keys to variables. + */ + +util.getQueryVariables = function (query) { + var parse = function parse(q) { + var rval = {}; + var kvpairs = q.split('&'); + + for (var i = 0; i < kvpairs.length; i++) { + var pos = kvpairs[i].indexOf('='); + var key; + var val; + + if (pos > 0) { + key = kvpairs[i].substring(0, pos); + val = kvpairs[i].substring(pos + 1); + } else { + key = kvpairs[i]; + val = null; + } + + if (!(key in rval)) { + rval[key] = []; + } // disallow overriding object prototype keys + + + if (!(key in Object.prototype) && val !== null) { + rval[key].push(unescape(val)); + } + } + + return rval; + }; + + var rval; + + if (typeof query === 'undefined') { + // set cached variables if needed + if (_queryVariables === null) { + if (typeof window !== 'undefined' && window.location && window.location.search) { + // parse window search query + _queryVariables = parse(window.location.search.substring(1)); + } else { + // no query variables available + _queryVariables = {}; + } + } + + rval = _queryVariables; + } else { + // parse given query + rval = parse(query); + } + + return rval; +}; +/** + * Parses a fragment into a path and query. This method will take a URI + * fragment and break it up as if it were the main URI. For example: + * /bar/baz?a=1&b=2 + * results in: + * { + * path: ["bar", "baz"], + * query: {"k1": ["v1"], "k2": ["v2"]} + * } + * + * @return object with a path array and query object. + */ + + +util.parseFragment = function (fragment) { + // default to whole fragment + var fp = fragment; + var fq = ''; // split into path and query if possible at the first '?' + + var pos = fragment.indexOf('?'); + + if (pos > 0) { + fp = fragment.substring(0, pos); + fq = fragment.substring(pos + 1); + } // split path based on '/' and ignore first element if empty + + + var path = fp.split('/'); + + if (path.length > 0 && path[0] === '') { + path.shift(); + } // convert query into object + + + var query = fq === '' ? {} : util.getQueryVariables(fq); + return { + pathString: fp, + queryString: fq, + path: path, + query: query + }; +}; +/** + * Makes a request out of a URI-like request string. This is intended to + * be used where a fragment id (after a URI '#') is parsed as a URI with + * path and query parts. The string should have a path beginning and + * delimited by '/' and optional query parameters following a '?'. The + * query should be a standard URL set of key value pairs delimited by + * '&'. For backwards compatibility the initial '/' on the path is not + * required. The request object has the following API, (fully described + * in the method code): + * { + * path: . + * query: , + * getPath(i): get part or all of the split path array, + * getQuery(k, i): get part or all of a query key array, + * getQueryLast(k, _default): get last element of a query key array. + * } + * + * @return object with request parameters. + */ + + +util.makeRequest = function (reqString) { + var frag = util.parseFragment(reqString); + var req = { + // full path string + path: frag.pathString, + // full query string + query: frag.queryString, + + /** + * Get path or element in path. + * + * @param i optional path index. + * + * @return path or part of path if i provided. + */ + getPath: function getPath(i) { + return typeof i === 'undefined' ? frag.path : frag.path[i]; + }, + + /** + * Get query, values for a key, or value for a key index. + * + * @param k optional query key. + * @param i optional query key index. + * + * @return query, values for a key, or value for a key index. + */ + getQuery: function getQuery(k, i) { + var rval; + + if (typeof k === 'undefined') { + rval = frag.query; + } else { + rval = frag.query[k]; + + if (rval && typeof i !== 'undefined') { + rval = rval[i]; + } + } + + return rval; + }, + getQueryLast: function getQueryLast(k, _default) { + var rval; + var vals = req.getQuery(k); + + if (vals) { + rval = vals[vals.length - 1]; + } else { + rval = _default; + } + + return rval; + } + }; + return req; +}; +/** + * Makes a URI out of a path, an object with query parameters, and a + * fragment. Uses jQuery.param() internally for query string creation. + * If the path is an array, it will be joined with '/'. + * + * @param path string path or array of strings. + * @param query object with query parameters. (optional) + * @param fragment fragment string. (optional) + * + * @return string object with request parameters. + */ + + +util.makeLink = function (path, query, fragment) { + // join path parts if needed + path = jQuery.isArray(path) ? path.join('/') : path; + var qstr = jQuery.param(query || {}); + fragment = fragment || ''; + return path + (qstr.length > 0 ? '?' + qstr : '') + (fragment.length > 0 ? '#' + fragment : ''); +}; +/** + * Follows a path of keys deep into an object hierarchy and set a value. + * If a key does not exist or it's value is not an object, create an + * object in it's place. This can be destructive to a object tree if + * leaf nodes are given as non-final path keys. + * Used to avoid exceptions from missing parts of the path. + * + * @param object the starting object. + * @param keys an array of string keys. + * @param value the value to set. + */ + + +util.setPath = function (object, keys, value) { + // need to start at an object + if (_typeof(object) === 'object' && object !== null) { + var i = 0; + var len = keys.length; + + while (i < len) { + var next = keys[i++]; + + if (i == len) { + // last + object[next] = value; + } else { + // more + var hasNext = next in object; + + if (!hasNext || hasNext && _typeof(object[next]) !== 'object' || hasNext && object[next] === null) { + object[next] = {}; + } + + object = object[next]; + } + } + } +}; +/** + * Follows a path of keys deep into an object hierarchy and return a value. + * If a key does not exist, create an object in it's place. + * Used to avoid exceptions from missing parts of the path. + * + * @param object the starting object. + * @param keys an array of string keys. + * @param _default value to return if path not found. + * + * @return the value at the path if found, else default if given, else + * undefined. + */ + + +util.getPath = function (object, keys, _default) { + var i = 0; + var len = keys.length; + var hasNext = true; + + while (hasNext && i < len && _typeof(object) === 'object' && object !== null) { + var next = keys[i++]; + hasNext = next in object; + + if (hasNext) { + object = object[next]; + } + } + + return hasNext ? object : _default; +}; +/** + * Follow a path of keys deep into an object hierarchy and delete the + * last one. If a key does not exist, do nothing. + * Used to avoid exceptions from missing parts of the path. + * + * @param object the starting object. + * @param keys an array of string keys. + */ + + +util.deletePath = function (object, keys) { + // need to start at an object + if (_typeof(object) === 'object' && object !== null) { + var i = 0; + var len = keys.length; + + while (i < len) { + var next = keys[i++]; + + if (i == len) { + // last + delete object[next]; + } else { + // more + if (!(next in object) || _typeof(object[next]) !== 'object' || object[next] === null) { + break; + } + + object = object[next]; + } + } + } +}; +/** + * Check if an object is empty. + * + * Taken from: + * http://stackoverflow.com/questions/679915/how-do-i-test-for-an-empty-javascript-object-from-json/679937#679937 + * + * @param object the object to check. + */ + + +util.isEmpty = function (obj) { + for (var prop in obj) { + if (obj.hasOwnProperty(prop)) { + return false; + } + } + + return true; +}; +/** + * Format with simple printf-style interpolation. + * + * %%: literal '%' + * %s,%o: convert next argument into a string. + * + * @param format the string to format. + * @param ... arguments to interpolate into the format string. + */ + + +util.format = function (format) { + var re = /%./g; // current match + + var match; // current part + + var part; // current arg index + + var argi = 0; // collected parts to recombine later + + var parts = []; // last index found + + var last = 0; // loop while matches remain + + while (match = re.exec(format)) { + part = format.substring(last, re.lastIndex - 2); // don't add empty strings (ie, parts between %s%s) + + if (part.length > 0) { + parts.push(part); + } + + last = re.lastIndex; // switch on % code + + var code = match[0][1]; + + switch (code) { + case 's': + case 'o': + // check if enough arguments were given + if (argi < arguments.length) { + parts.push(arguments[argi++ + 1]); + } else { + parts.push(''); + } + + break; + // FIXME: do proper formating for numbers, etc + //case 'f': + //case 'd': + + case '%': + parts.push('%'); + break; + + default: + parts.push('<%' + code + '?>'); + } + } // add trailing part of format string + + + parts.push(format.substring(last)); + return parts.join(''); +}; +/** + * Formats a number. + * + * http://snipplr.com/view/5945/javascript-numberformat--ported-from-php/ + */ + + +util.formatNumber = function (number, decimals, dec_point, thousands_sep) { + // http://kevin.vanzonneveld.net + // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) + // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) + // + bugfix by: Michael White (http://crestidg.com) + // + bugfix by: Benjamin Lupton + // + bugfix by: Allan Jensen (http://www.winternet.no) + // + revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) + // * example 1: number_format(1234.5678, 2, '.', ''); + // * returns 1: 1234.57 + var n = number, + c = isNaN(decimals = Math.abs(decimals)) ? 2 : decimals; + var d = dec_point === undefined ? ',' : dec_point; + var t = thousands_sep === undefined ? '.' : thousands_sep, + s = n < 0 ? '-' : ''; + var i = parseInt(n = Math.abs(+n || 0).toFixed(c), 10) + ''; + var j = i.length > 3 ? i.length % 3 : 0; + return s + (j ? i.substr(0, j) + t : '') + i.substr(j).replace(/(\d{3})(?=\d)/g, '$1' + t) + (c ? d + Math.abs(n - i).toFixed(c).slice(2) : ''); +}; +/** + * Formats a byte size. + * + * http://snipplr.com/view/5949/format-humanize-file-byte-size-presentation-in-javascript/ + */ + + +util.formatSize = function (size) { + if (size >= 1073741824) { + size = util.formatNumber(size / 1073741824, 2, '.', '') + ' GiB'; + } else if (size >= 1048576) { + size = util.formatNumber(size / 1048576, 2, '.', '') + ' MiB'; + } else if (size >= 1024) { + size = util.formatNumber(size / 1024, 0) + ' KiB'; + } else { + size = util.formatNumber(size, 0) + ' bytes'; + } + + return size; +}; +/** + * Converts an IPv4 or IPv6 string representation into bytes (in network order). + * + * @param ip the IPv4 or IPv6 address to convert. + * + * @return the 4-byte IPv6 or 16-byte IPv6 address or null if the address can't + * be parsed. + */ + + +util.bytesFromIP = function (ip) { + if (ip.indexOf('.') !== -1) { + return util.bytesFromIPv4(ip); + } + + if (ip.indexOf(':') !== -1) { + return util.bytesFromIPv6(ip); + } + + return null; +}; +/** + * Converts an IPv4 string representation into bytes (in network order). + * + * @param ip the IPv4 address to convert. + * + * @return the 4-byte address or null if the address can't be parsed. + */ + + +util.bytesFromIPv4 = function (ip) { + ip = ip.split('.'); + + if (ip.length !== 4) { + return null; + } + + var b = util.createBuffer(); + + for (var i = 0; i < ip.length; ++i) { + var num = parseInt(ip[i], 10); + + if (isNaN(num)) { + return null; + } + + b.putByte(num); + } + + return b.getBytes(); +}; +/** + * Converts an IPv6 string representation into bytes (in network order). + * + * @param ip the IPv6 address to convert. + * + * @return the 16-byte address or null if the address can't be parsed. + */ + + +util.bytesFromIPv6 = function (ip) { + var blanks = 0; + ip = ip.split(':').filter(function (e) { + if (e.length === 0) ++blanks; + return true; + }); + var zeros = (8 - ip.length + blanks) * 2; + var b = util.createBuffer(); + + for (var i = 0; i < 8; ++i) { + if (!ip[i] || ip[i].length === 0) { + b.fillWithByte(0, zeros); + zeros = 0; + continue; + } + + var bytes = util.hexToBytes(ip[i]); + + if (bytes.length < 2) { + b.putByte(0); + } + + b.putBytes(bytes); + } + + return b.getBytes(); +}; +/** + * Converts 4-bytes into an IPv4 string representation or 16-bytes into + * an IPv6 string representation. The bytes must be in network order. + * + * @param bytes the bytes to convert. + * + * @return the IPv4 or IPv6 string representation if 4 or 16 bytes, + * respectively, are given, otherwise null. + */ + + +util.bytesToIP = function (bytes) { + if (bytes.length === 4) { + return util.bytesToIPv4(bytes); + } + + if (bytes.length === 16) { + return util.bytesToIPv6(bytes); + } + + return null; +}; +/** + * Converts 4-bytes into an IPv4 string representation. The bytes must be + * in network order. + * + * @param bytes the bytes to convert. + * + * @return the IPv4 string representation or null for an invalid # of bytes. + */ + + +util.bytesToIPv4 = function (bytes) { + if (bytes.length !== 4) { + return null; + } + + var ip = []; + + for (var i = 0; i < bytes.length; ++i) { + ip.push(bytes.charCodeAt(i)); + } + + return ip.join('.'); +}; +/** + * Converts 16-bytes into an IPv16 string representation. The bytes must be + * in network order. + * + * @param bytes the bytes to convert. + * + * @return the IPv16 string representation or null for an invalid # of bytes. + */ + + +util.bytesToIPv6 = function (bytes) { + if (bytes.length !== 16) { + return null; + } + + var ip = []; + var zeroGroups = []; + var zeroMaxGroup = 0; + + for (var i = 0; i < bytes.length; i += 2) { + var hex = util.bytesToHex(bytes[i] + bytes[i + 1]); // canonicalize zero representation + + while (hex[0] === '0' && hex !== '0') { + hex = hex.substr(1); + } + + if (hex === '0') { + var last = zeroGroups[zeroGroups.length - 1]; + var idx = ip.length; + + if (!last || idx !== last.end + 1) { + zeroGroups.push({ + start: idx, + end: idx + }); + } else { + last.end = idx; + + if (last.end - last.start > zeroGroups[zeroMaxGroup].end - zeroGroups[zeroMaxGroup].start) { + zeroMaxGroup = zeroGroups.length - 1; + } + } + } + + ip.push(hex); + } + + if (zeroGroups.length > 0) { + var group = zeroGroups[zeroMaxGroup]; // only shorten group of length > 0 + + if (group.end - group.start > 0) { + ip.splice(group.start, group.end - group.start + 1, ''); + + if (group.start === 0) { + ip.unshift(''); + } + + if (group.end === 7) { + ip.push(''); + } + } + } + + return ip.join(':'); +}; +/** + * Estimates the number of processes that can be run concurrently. If + * creating Web Workers, keep in mind that the main JavaScript process needs + * its own core. + * + * @param options the options to use: + * update true to force an update (not use the cached value). + * @param callback(err, max) called once the operation completes. + */ + + +util.estimateCores = function (options, callback) { + if (typeof options === 'function') { + callback = options; + options = {}; + } + + options = options || {}; + + if ('cores' in util && !options.update) { + return callback(null, util.cores); + } + + if (typeof navigator !== 'undefined' && 'hardwareConcurrency' in navigator && navigator.hardwareConcurrency > 0) { + util.cores = navigator.hardwareConcurrency; + return callback(null, util.cores); + } + + if (typeof Worker === 'undefined') { + // workers not available + util.cores = 1; + return callback(null, util.cores); + } + + if (typeof Blob === 'undefined') { + // can't estimate, default to 2 + util.cores = 2; + return callback(null, util.cores); + } // create worker concurrency estimation code as blob + + + var blobUrl = URL.createObjectURL(new Blob(['(', function () { + self.addEventListener('message', function (e) { + // run worker for 4 ms + var st = Date.now(); + var et = st + 4; + + while (Date.now() < et) { + ; + } + + self.postMessage({ + st: st, + et: et + }); + }); + }.toString(), ')()'], { + type: 'application/javascript' + })); // take 5 samples using 16 workers + + sample([], 5, 16); + + function sample(max, samples, numWorkers) { + if (samples === 0) { + // get overlap average + var avg = Math.floor(max.reduce(function (avg, x) { + return avg + x; + }, 0) / max.length); + util.cores = Math.max(1, avg); + URL.revokeObjectURL(blobUrl); + return callback(null, util.cores); + } + + map(numWorkers, function (err, results) { + max.push(reduce(numWorkers, results)); + sample(max, samples - 1, numWorkers); + }); + } + + function map(numWorkers, callback) { + var workers = []; + var results = []; + + for (var i = 0; i < numWorkers; ++i) { + var worker = new Worker(blobUrl); + worker.addEventListener('message', function (e) { + results.push(e.data); + + if (results.length === numWorkers) { + for (var i = 0; i < numWorkers; ++i) { + workers[i].terminate(); + } + + callback(null, results); + } + }); + workers.push(worker); + } + + for (var i = 0; i < numWorkers; ++i) { + workers[i].postMessage(i); + } + } + + function reduce(numWorkers, results) { + // find overlapping time windows + var overlaps = []; + + for (var n = 0; n < numWorkers; ++n) { + var r1 = results[n]; + var overlap = overlaps[n] = []; + + for (var i = 0; i < numWorkers; ++i) { + if (n === i) { + continue; + } + + var r2 = results[i]; + + if (r1.st > r2.st && r1.st < r2.et || r2.st > r1.st && r2.st < r1.et) { + overlap.push(i); + } + } + } // get maximum overlaps ... don't include overlapping worker itself + // as the main JS process was also being scheduled during the work and + // would have to be subtracted from the estimate anyway + + + return overlaps.reduce(function (max, overlap) { + return Math.max(max, overlap.length); + }, 0); + } +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(36).setImmediate, __webpack_require__(0).Buffer)) + +/***/ }), +/* 10 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var g; // This works in non-strict mode + +g = function () { + return this; +}(); + +try { + // This works if eval is allowed (see CSP) + g = g || new Function("return this")(); +} catch (e) { + // This works if the window reference is available + if ((typeof window === "undefined" ? "undefined" : _typeof(window)) === "object") g = window; +} // g can still be undefined, but nothing to do about it... +// We return undefined, instead of nothing here, so it's +// easier to handle this case. if(!global) { ...} + + +module.exports = g; + +/***/ }), +/* 11 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) { + +var once = __webpack_require__(17); + +var eos = __webpack_require__(89); + +var fs = __webpack_require__(369); // we only need fs to get the ReadStream and WriteStream prototypes + + +var noop = function noop() {}; + +var ancient = /^v?\.0/.test(process.version); + +var isFn = function isFn(fn) { + return typeof fn === 'function'; +}; + +var isFS = function isFS(stream) { + if (!ancient) return false; // newer node version do not need to care about fs is a special way + + if (!fs) return false; // browser + + return (stream instanceof (fs.ReadStream || noop) || stream instanceof (fs.WriteStream || noop)) && isFn(stream.close); +}; + +var isRequest = function isRequest(stream) { + return stream.setHeader && isFn(stream.abort); +}; + +var destroyer = function destroyer(stream, reading, writing, callback) { + callback = once(callback); + var closed = false; + stream.on('close', function () { + closed = true; + }); + eos(stream, { + readable: reading, + writable: writing + }, function (err) { + if (err) return callback(err); + closed = true; + callback(); + }); + var destroyed = false; + return function (err) { + if (closed) return; + if (destroyed) return; + destroyed = true; + if (isFS(stream)) return stream.close(noop); // use close for fs streams to avoid fd leaks + + if (isRequest(stream)) return stream.abort(); // request.destroy just do .end - .abort is what we want + + if (isFn(stream.destroy)) return stream.destroy(); + callback(err || new Error('stream was destroyed')); + }; +}; + +var call = function call(fn) { + fn(); +}; + +var pipe = function pipe(from, to) { + return from.pipe(to); +}; + +var pump = function pump() { + var streams = Array.prototype.slice.call(arguments); + var callback = isFn(streams[streams.length - 1] || noop) && streams.pop() || noop; + if (Array.isArray(streams[0])) streams = streams[0]; + if (streams.length < 2) throw new Error('pump requires two streams per minimum'); + var error; + var destroys = streams.map(function (stream, i) { + var reading = i < streams.length - 1; + var writing = i > 0; + return destroyer(stream, reading, writing, function (err) { + if (!error) error = err; + if (err) destroys.forEach(call); + if (reading) return; + destroys.forEach(call); + callback(error); + }); + }); + return streams.reduce(pipe); +}; + +module.exports = pump; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 12 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = { + encode: __webpack_require__(196), + decode: __webpack_require__(197), + encodingLength: __webpack_require__(198) +}; + +/***/ }), +/* 13 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var base58 = __webpack_require__(21); + +var multihash = __webpack_require__(14); + +var multibase = __webpack_require__(49); + +var Multiaddr = __webpack_require__(16); + +var mafmt = __webpack_require__(210); + +var CID = __webpack_require__(4); + +var urlPattern = /^https?:\/\/[^/]+\/(ip(f|n)s)\/((\w+).*)/; +var pathPattern = /^\/(ip(f|n)s)\/((\w+).*)/; +var defaultProtocolMatch = 1; +var defaultHashMath = 4; +var fqdnPattern = /^https?:\/\/([^/]+)\.(ip(?:f|n)s)\.[^/]+/; +var fqdnHashMatch = 1; +var fqdnProtocolMatch = 2; + +function isMultihash(hash) { + var formatted = convertToString(hash); + + try { + var buffer = Buffer.from(base58.decode(formatted)); + multihash.decode(buffer); + return true; + } catch (e) { + return false; + } +} + +function isMultibase(hash) { + try { + return multibase.isEncoded(hash); + } catch (e) { + return false; + } +} + +function isCID(hash) { + try { + new CID(hash); // eslint-disable-line no-new + + return true; + } catch (e) { + return false; + } +} + +function isMultiaddr(input) { + if (!input) return false; + if (Multiaddr.isMultiaddr(input)) return true; + + try { + new Multiaddr(input); // eslint-disable-line no-new + + return true; + } catch (e) { + return false; + } +} + +function isPeerMultiaddr(input) { + return isMultiaddr(input) && mafmt.IPFS.matches(input); +} + +function isIpfs(input, pattern) { + var protocolMatch = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultProtocolMatch; + var hashMatch = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : defaultHashMath; + var formatted = convertToString(input); + + if (!formatted) { + return false; + } + + var match = formatted.match(pattern); + + if (!match) { + return false; + } + + if (match[protocolMatch] !== 'ipfs') { + return false; + } + + var hash = match[hashMatch]; + + if (hash && pattern === fqdnPattern) { + // when doing checks for subdomain context + // ensure hash is case-insensitive + // (browsers force-lowercase authority compotent anyway) + hash = hash.toLowerCase(); + } + + return isCID(hash); +} + +function isIpns(input, pattern) { + var protocolMatch = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultProtocolMatch; + var hashMatch = arguments.length > 3 ? arguments[3] : undefined; + var formatted = convertToString(input); + + if (!formatted) { + return false; + } + + var match = formatted.match(pattern); + + if (!match) { + return false; + } + + if (match[protocolMatch] !== 'ipns') { + return false; + } + + if (hashMatch && pattern === fqdnPattern) { + var hash = match[hashMatch]; // when doing checks for subdomain context + // ensure hash is case-insensitive + // (browsers force-lowercase authority compotent anyway) + + hash = hash.toLowerCase(); + return isCID(hash); + } + + return true; +} + +function isString(input) { + return typeof input === 'string'; +} + +function convertToString(input) { + if (Buffer.isBuffer(input)) { + return base58.encode(input); + } + + if (isString(input)) { + return input; + } + + return false; +} + +var ipfsSubdomain = function ipfsSubdomain(url) { + return isIpfs(url, fqdnPattern, fqdnProtocolMatch, fqdnHashMatch); +}; + +var ipnsSubdomain = function ipnsSubdomain(url) { + return isIpns(url, fqdnPattern, fqdnProtocolMatch, fqdnHashMatch); +}; + +module.exports = { + multihash: isMultihash, + multiaddr: isMultiaddr, + peerMultiaddr: isPeerMultiaddr, + cid: isCID, + base32cid: function base32cid(cid) { + return isMultibase(cid) === 'base32' && isCID(cid); + }, + ipfsSubdomain: ipfsSubdomain, + ipnsSubdomain: ipnsSubdomain, + subdomain: function subdomain(url) { + return ipfsSubdomain(url) || ipnsSubdomain(url); + }, + subdomainPattern: fqdnPattern, + ipfsUrl: function ipfsUrl(url) { + return isIpfs(url, urlPattern); + }, + ipnsUrl: function ipnsUrl(url) { + return isIpns(url, urlPattern); + }, + url: function url(_url) { + return isIpfs(_url, urlPattern) || isIpns(_url, urlPattern); + }, + urlPattern: urlPattern, + ipfsPath: function ipfsPath(path) { + return isIpfs(path, pathPattern); + }, + ipnsPath: function ipnsPath(path) { + return isIpns(path, pathPattern); + }, + path: function path(_path) { + return isIpfs(_path, pathPattern) || isIpns(_path, pathPattern); + }, + pathPattern: pathPattern, + urlOrPath: function urlOrPath(x) { + return isIpfs(x, urlPattern) || isIpns(x, urlPattern) || isIpfs(x, pathPattern) || isIpns(x, pathPattern); + }, + cidPath: function cidPath(path) { + return isString(path) && !isCID(path) && isIpfs("/ipfs/".concat(path), pathPattern); + } +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 14 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) {/** + * Multihash implementation in JavaScript. + * + * @module multihash + */ + + +var bs58 = __webpack_require__(21); + +var cs = __webpack_require__(195); + +exports.names = cs.names; +exports.codes = cs.codes; +exports.defaultLengths = cs.defaultLengths; + +var varint = __webpack_require__(12); +/** + * Convert the given multihash to a hex encoded string. + * + * @param {Buffer} hash + * @returns {string} + */ + + +exports.toHexString = function toHexString(hash) { + if (!Buffer.isBuffer(hash)) { + throw new Error('must be passed a buffer'); + } + + return hash.toString('hex'); +}; +/** + * Convert the given hex encoded string to a multihash. + * + * @param {string} hash + * @returns {Buffer} + */ + + +exports.fromHexString = function fromHexString(hash) { + return Buffer.from(hash, 'hex'); +}; +/** + * Convert the given multihash to a base58 encoded string. + * + * @param {Buffer} hash + * @returns {string} + */ + + +exports.toB58String = function toB58String(hash) { + if (!Buffer.isBuffer(hash)) { + throw new Error('must be passed a buffer'); + } + + return bs58.encode(hash); +}; +/** + * Convert the given base58 encoded string to a multihash. + * + * @param {string|Buffer} hash + * @returns {Buffer} + */ + + +exports.fromB58String = function fromB58String(hash) { + var encoded = hash; + + if (Buffer.isBuffer(hash)) { + encoded = hash.toString(); + } + + return Buffer.from(bs58.decode(encoded)); +}; +/** + * Decode a hash from the given multihash. + * + * @param {Buffer} buf + * @returns {{code: number, name: string, length: number, digest: Buffer}} result + */ + + +exports.decode = function decode(buf) { + if (!Buffer.isBuffer(buf)) { + throw new Error('multihash must be a Buffer'); + } + + if (buf.length < 3) { + throw new Error('multihash too short. must be > 3 bytes.'); + } + + var code = varint.decode(buf); + + if (!exports.isValidCode(code)) { + throw new Error("multihash unknown function code: 0x".concat(code.toString(16))); + } + + buf = buf.slice(varint.decode.bytes); + var len = varint.decode(buf); + + if (len < 1) { + throw new Error("multihash invalid length: 0x".concat(len.toString(16))); + } + + buf = buf.slice(varint.decode.bytes); + + if (buf.length !== len) { + throw new Error("multihash length inconsistent: 0x".concat(buf.toString('hex'))); + } + + return { + code: code, + name: cs.codes[code], + length: len, + digest: buf + }; +}; +/** + * Encode a hash digest along with the specified function code. + * + * > **Note:** the length is derived from the length of the digest itself. + * + * @param {Buffer} digest + * @param {string|number} code + * @param {number} [length] + * @returns {Buffer} + */ + + +exports.encode = function encode(digest, code, length) { + if (!digest || !code) { + throw new Error('multihash encode requires at least two args: digest, code'); + } // ensure it's a hashfunction code. + + + var hashfn = exports.coerceCode(code); + + if (!Buffer.isBuffer(digest)) { + throw new Error('digest should be a Buffer'); + } + + if (length == null) { + length = digest.length; + } + + if (length && digest.length !== length) { + throw new Error('digest length should be equal to specified length.'); + } + + return Buffer.concat([Buffer.from(varint.encode(hashfn)), Buffer.from(varint.encode(length)), digest]); +}; +/** + * Converts a hash function name into the matching code. + * If passed a number it will return the number if it's a valid code. + * @param {string|number} name + * @returns {number} + */ + + +exports.coerceCode = function coerceCode(name) { + var code = name; + + if (typeof name === 'string') { + if (!cs.names[name]) { + throw new Error("Unrecognized hash function named: ".concat(name)); + } + + code = cs.names[name]; + } + + if (typeof code !== 'number') { + throw new Error("Hash function code should be a number. Got: ".concat(code)); + } + + if (!cs.codes[code] && !exports.isAppCode(code)) { + throw new Error("Unrecognized function code: ".concat(code)); + } + + return code; +}; +/** + * Checks wether a code is part of the app range + * + * @param {number} code + * @returns {boolean} + */ + + +exports.isAppCode = function appCode(code) { + return code > 0 && code < 0x10; +}; +/** + * Checks whether a multihash code is valid. + * + * @param {number} code + * @returns {boolean} + */ + + +exports.isValidCode = function validCode(code) { + if (exports.isAppCode(code)) { + return true; + } + + if (cs.codes[code]) { + return true; + } + + return false; +}; +/** + * Check if the given buffer is a valid multihash. Throws an error if it is not valid. + * + * @param {Buffer} multihash + * @returns {undefined} + * @throws {Error} + */ + + +function validate(multihash) { + exports.decode(multihash); // throws if bad. +} + +exports.validate = validate; +/** + * Returns a prefix from a valid multihash. Throws an error if it is not valid. + * + * @param {Buffer} multihash + * @returns {undefined} + * @throws {Error} + */ + +exports.prefix = function prefix(multihash) { + validate(multihash); + return multihash.slice(0, 2); +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 15 */ +/***/ (function(module, exports, __webpack_require__) { + +module.exports = __webpack_require__(444); + + +/***/ }), +/* 16 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var codec = __webpack_require__(205); + +var protocols = __webpack_require__(67); + +var varint = __webpack_require__(12); + +var bs58 = __webpack_require__(21); + +var withIs = __webpack_require__(27); +/** + * Creates a [multiaddr](https://github.com/multiformats/multiaddr) from + * a Buffer, String or another Multiaddr instance + * public key. + * @class Multiaddr + * @param {(String|Buffer|Multiaddr)} addr - If String or Buffer, needs to adhere + * to the address format of a [multiaddr](https://github.com/multiformats/multiaddr#string-format) + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001') + * // + */ + + +var Multiaddr = withIs.proto(function (addr) { + if (!(this instanceof Multiaddr)) { + return new Multiaddr(addr); + } // default + + + if (addr == null) { + addr = ''; + } + + if (addr instanceof Buffer) { + /** + * @type {Buffer} - The raw bytes representing this multiaddress + */ + this.buffer = codec.fromBuffer(addr); + } else if (typeof addr === 'string' || addr instanceof String) { + if (addr.length > 0 && addr.charAt(0) !== '/') { + throw new Error("multiaddr \"".concat(addr, "\" must start with a \"/\"")); + } + + this.buffer = codec.fromString(addr); + } else if (addr.buffer && addr.protos && addr.protoCodes) { + // Multiaddr + this.buffer = codec.fromBuffer(addr.buffer); // validate + copy buffer + } else { + throw new Error('addr must be a string, Buffer, or another Multiaddr'); + } +}, { + className: 'Multiaddr', + symbolName: '@multiformats/js-multiaddr/multiaddr' +}); +/** + * Returns Multiaddr as a String + * + * @returns {String} + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').toString() + * // '/ip4/127.0.0.1/tcp/4001' + */ + +Multiaddr.prototype.toString = function toString() { + return codec.bufferToString(this.buffer); +}; +/** + * Returns Multiaddr as a JSON encoded object + * + * @returns {String} + * @example + * JSON.stringify(Multiaddr('/ip4/127.0.0.1/tcp/4001')) + * // '/ip4/127.0.0.1/tcp/4001' + */ + + +Multiaddr.prototype.toJSON = Multiaddr.prototype.toString; +/** + * Returns Multiaddr as a convinient options object to be used with net.createConnection + * + * @returns {{family: String, host: String, transport: String, port: String}} + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').toOptions() + * // { family: 'ipv4', host: '127.0.0.1', transport: 'tcp', port: '4001' } + */ + +Multiaddr.prototype.toOptions = function toOptions() { + var opts = {}; + var parsed = this.toString().split('/'); + opts.family = parsed[1] === 'ip4' ? 'ipv4' : 'ipv6'; + opts.host = parsed[2]; + opts.transport = parsed[3]; + opts.port = parsed[4]; + return opts; +}; +/** + * Returns Multiaddr as a human-readable string + * + * @returns {String} + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').inspect() + * // '' + */ + + +Multiaddr.prototype.inspect = function inspect() { + return ''; +}; +/** + * Returns the protocols the Multiaddr is defined with, as an array of objects, in + * left-to-right order. Each object contains the protocol code, protocol name, + * and the size of its address space in bits. + * [See list of protocols](https://github.com/multiformats/multiaddr/blob/master/protocols.csv) + * + * @returns {Array.} protocols - All the protocols the address is composed of + * @returns {Number} protocols[].code + * @returns {Number} protocols[].size + * @returns {String} protocols[].name + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').protos() + * // [ { code: 4, size: 32, name: 'ip4' }, + * // { code: 6, size: 16, name: 'tcp' } ] + */ + + +Multiaddr.prototype.protos = function protos() { + return this.protoCodes().map(function (code) { + return Object.assign({}, protocols(code)); + }); +}; +/** + * Returns the codes of the protocols in left-to-right order. + * [See list of protocols](https://github.com/multiformats/multiaddr/blob/master/protocols.csv) + * + * @returns {Array.} protocol codes + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').protoCodes() + * // [ 4, 6 ] + */ + + +Multiaddr.prototype.protoCodes = function protoCodes() { + var codes = []; + var buf = this.buffer; + var i = 0; + + while (i < buf.length) { + var code = varint.decode(buf, i); + var n = varint.decode.bytes; + var p = protocols(code); + var size = codec.sizeForAddr(p, buf.slice(i + n)); + i += size + n; + codes.push(code); + } + + return codes; +}; +/** + * Returns the names of the protocols in left-to-right order. + * [See list of protocols](https://github.com/multiformats/multiaddr/blob/master/protocols.csv) + * + * @return {Array.} protocol names + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').protoNames() + * // [ 'ip4', 'tcp' ] + */ + + +Multiaddr.prototype.protoNames = function protoNames() { + return this.protos().map(function (proto) { + return proto.name; + }); +}; +/** + * Returns a tuple of parts + * + * @return {Array.} tuples + * @return {Number} tuples[].0 code of protocol + * @return {Buffer} tuples[].1 contents of address + * @example + * Multiaddr("/ip4/127.0.0.1/tcp/4001").tuples() + * // [ [ 4, ], [ 6, ] ] + */ + + +Multiaddr.prototype.tuples = function tuples() { + return codec.bufferToTuples(this.buffer); +}; +/** + * Returns a tuple of string/number parts + * + * @return {Array.} tuples + * @return {Number} tuples[].0 code of protocol + * @return {(String|Number)} tuples[].1 contents of address + * @example + * Multiaddr("/ip4/127.0.0.1/tcp/4001").stringTuples() + * // [ [ 4, '127.0.0.1' ], [ 6, 4001 ] ] + */ + + +Multiaddr.prototype.stringTuples = function stringTuples() { + var t = codec.bufferToTuples(this.buffer); + return codec.tuplesToStringTuples(t); +}; +/** + * Encapsulates a Multiaddr in another Multiaddr + * + * @param {Multiaddr} addr - Multiaddr to add into this Multiaddr + * @return {Multiaddr} + * @example + * const mh1 = Multiaddr('/ip4/8.8.8.8/tcp/1080') + * // + * + * const mh2 = Multiaddr('/ip4/127.0.0.1/tcp/4001') + * // + * + * const mh3 = mh1.encapsulate(mh2) + * // + * + * mh3.toString() + * // '/ip4/8.8.8.8/tcp/1080/ip4/127.0.0.1/tcp/4001' + */ + + +Multiaddr.prototype.encapsulate = function encapsulate(addr) { + addr = Multiaddr(addr); + return Multiaddr(this.toString() + addr.toString()); +}; +/** + * Decapsulates a Multiaddr from another Multiaddr + * + * @param {Multiaddr} addr - Multiaddr to remove from this Multiaddr + * @return {Multiaddr} + * @example + * const mh1 = Multiaddr('/ip4/8.8.8.8/tcp/1080') + * // + * + * const mh2 = Multiaddr('/ip4/127.0.0.1/tcp/4001') + * // + * + * const mh3 = mh1.encapsulate(mh2) + * // + * + * mh3.decapsulate(mh2).toString() + * // '/ip4/8.8.8.8/tcp/1080' + */ + + +Multiaddr.prototype.decapsulate = function decapsulate(addr) { + addr = addr.toString(); + var s = this.toString(); + var i = s.lastIndexOf(addr); + + if (i < 0) { + throw new Error('Address ' + this + ' does not contain subaddress: ' + addr); + } + + return Multiaddr(s.slice(0, i)); +}; +/** + * Extract the peerId if the multiaddr contains one + * + * @return {String|null} peerId - The id of the peer or null if invalid or missing from the ma + * @example + * const mh1 = Multiaddr('/ip4/8.8.8.8/tcp/1080/ipfs/QmValidBase58string') + * // + * + * // should return QmValidBase58string or null if the id is missing or invalid + * const peerId = mh1.getPeerId() + */ + + +Multiaddr.prototype.getPeerId = function getPeerId() { + var b58str = null; + + try { + b58str = this.stringTuples().filter(function (tuple) { + if (tuple[0] === protocols.names.ipfs.code) { + return true; + } + })[0][1]; + bs58.decode(b58str); + } catch (e) { + b58str = null; + } + + return b58str; +}; +/** + * Extract the path if the multiaddr contains one + * + * @return {String|null} path - The path of the multiaddr, or null if no path protocol is present + * @example + * const mh1 = Multiaddr('/ip4/8.8.8.8/tcp/1080/unix/tmp/p2p.sock') + * // + * + * // should return utf8 string or null if the id is missing or invalid + * const path = mh1.getPath() + */ + + +Multiaddr.prototype.getPath = function getPath() { + var path = null; + + try { + path = this.stringTuples().filter(function (tuple) { + var proto = protocols(tuple[0]); + + if (proto.path) { + return true; + } + })[0][1]; + } catch (e) { + path = null; + } + + return path; +}; +/** + * Checks if two Multiaddrs are the same + * + * @param {Multiaddr} addr + * @return {Bool} + * @example + * const mh1 = Multiaddr('/ip4/8.8.8.8/tcp/1080') + * // + * + * const mh2 = Multiaddr('/ip4/127.0.0.1/tcp/4001') + * // + * + * mh1.equals(mh1) + * // true + * + * mh1.equals(mh2) + * // false + */ + + +Multiaddr.prototype.equals = function equals(addr) { + return this.buffer.equals(addr.buffer); +}; +/** + * Gets a Multiaddrs node-friendly address object. Note that protocol information + * is left out: in Node (and most network systems) the protocol is unknowable + * given only the address. + * + * Has to be a ThinWaist Address, otherwise throws error + * + * @returns {{family: String, address: String, port: String}} + * @throws {Error} Throws error if Multiaddr is not a Thin Waist address + * @example + * Multiaddr('/ip4/127.0.0.1/tcp/4001').nodeAddress() + * // {family: 'IPv4', address: '127.0.0.1', port: '4001'} + */ + + +Multiaddr.prototype.nodeAddress = function nodeAddress() { + var codes = this.protoCodes(); + var names = this.protoNames(); + var parts = this.toString().split('/').slice(1); + + if (parts.length < 4) { + throw new Error('multiaddr must have a valid format: "/{ip4, ip6, dns4, dns6}/{address}/{tcp, udp}/{port}".'); + } else if (codes[0] !== 4 && codes[0] !== 41 && codes[0] !== 54 && codes[0] !== 55) { + throw new Error("no protocol with name: \"'".concat(names[0], "'\". Must have a valid family name: \"{ip4, ip6, dns4, dns6}\".")); + } else if (parts[2] !== 'tcp' && parts[2] !== 'udp') { + throw new Error("no protocol with name: \"'".concat(names[1], "'\". Must have a valid transport protocol: \"{tcp, udp}\".")); + } + + return { + family: codes[0] === 41 || codes[0] === 55 ? 6 : 4, + address: parts[1], + // ip addr + port: parts[3] // tcp or udp port + + }; +}; +/** + * Creates a Multiaddr from a node-friendly address object + * + * @param {String} addr + * @param {String} transport + * @returns {Multiaddr} multiaddr + * @throws {Error} Throws error if addr is not truthy + * @throws {Error} Throws error if transport is not truthy + * @example + * Multiaddr.fromNodeAddress({address: '127.0.0.1', port: '4001'}, 'tcp') + * // + */ + + +Multiaddr.fromNodeAddress = function fromNodeAddress(addr, transport) { + if (!addr) throw new Error('requires node address object'); + if (!transport) throw new Error('requires transport protocol'); + var ip = addr.family === 'IPv6' ? 'ip6' : 'ip4'; + return Multiaddr('/' + [ip, addr.address, transport, addr.port].join('/')); +}; // TODO find a better example, not sure about it's good enough + +/** + * Returns if a Multiaddr is a Thin Waist address or not. + * + * Thin Waist is if a Multiaddr adheres to the standard combination of: + * + * `{IPv4, IPv6}/{TCP, UDP}` + * + * @param {Multiaddr} [addr] - Defaults to using `this` instance + * @returns {Boolean} isThinWaistAddress + * @example + * const mh1 = Multiaddr('/ip4/127.0.0.1/tcp/4001') + * // + * const mh2 = Multiaddr('/ip4/192.168.2.1/tcp/5001') + * // + * const mh3 = mh1.encapsulate(mh2) + * // + * mh1.isThinWaistAddress() + * // true + * mh2.isThinWaistAddress() + * // true + * mh3.isThinWaistAddress() + * // false + */ + + +Multiaddr.prototype.isThinWaistAddress = function isThinWaistAddress(addr) { + var protos = (addr || this).protos(); + + if (protos.length !== 2) { + return false; + } + + if (protos[0].code !== 4 && protos[0].code !== 41) { + return false; + } + + if (protos[1].code !== 6 && protos[1].code !== 273) { + return false; + } + + return true; +}; +/** + * Object containing table, names and codes of all supported protocols. + * To get the protocol values from a Multiaddr, you can use + * [`.protos()`](#multiaddrprotos), + * [`.protoCodes()`](#multiaddrprotocodes) or + * [`.protoNames()`](#multiaddrprotonames) + * + * @instance + * @returns {{table: Array, names: Object, codes: Object}} + * + */ + + +Multiaddr.protocols = protocols; +/** + * Returns if something is a Multiaddr that is a name + * + * @param {Multiaddr} addr + * @return {Bool} isName + */ + +Multiaddr.isName = function isName(addr) { + if (!Multiaddr.isMultiaddr(addr)) { + return false; + } // if a part of the multiaddr is resolvable, then return true + + + return addr.protos().some(function (proto) { + return proto.resolvable; + }); +}; +/** + * Returns an array of multiaddrs, by resolving the multiaddr that is a name + * + * @param {Multiaddr} addr + * + * @param {Function} callback + * @return {Bool} isName + */ + + +Multiaddr.resolve = function resolve(addr, callback) { + if (!Multiaddr.isMultiaddr(addr) || !Multiaddr.isName(addr)) { + return callback(new Error('not a valid name')); + } + /* + * Needs more consideration from spec design: + * - what to return + * - how to achieve it in the browser? + */ + + + return callback(new Error('not implemented yet')); +}; + +exports = module.exports = Multiaddr; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 17 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var wrappy = __webpack_require__(320); + +module.exports = wrappy(once); +module.exports.strict = wrappy(onceStrict); +once.proto = once(function () { + Object.defineProperty(Function.prototype, 'once', { + value: function value() { + return once(this); + }, + configurable: true + }); + Object.defineProperty(Function.prototype, 'onceStrict', { + value: function value() { + return onceStrict(this); + }, + configurable: true + }); +}); + +function once(fn) { + var f = function f() { + if (f.called) return f.value; + f.called = true; + return f.value = fn.apply(this, arguments); + }; + + f.called = false; + return f; +} + +function onceStrict(fn) { + var f = function f() { + if (f.called) throw new Error(f.onceError); + f.called = true; + return f.value = fn.apply(this, arguments); + }; + + var name = fn.name || 'Function wrapped with `once`'; + f.onceError = name + " shouldn't be called more than once"; + f.called = false; + return f; +} + +/***/ }), +/* 18 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var CID = __webpack_require__(4); + +module.exports = function (cid) { + if (Buffer.isBuffer(cid)) { + return new CID(cid).toString(); + } + + if (CID.isCID(cid)) { + return cid.toString(); + } + + if (typeof cid !== 'string') { + throw new Error('unexpected cid type: ' + _typeof(cid)); + } + + new CID(cid.split('/')[0]); // eslint-disable-line no-new + + return cid; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 19 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) { + +var pull = __webpack_require__(59); + +var looper = __webpack_require__(360); + +function destroy(stream) { + if (!stream.destroy) console.error('warning, stream-to-pull-stream: \n' + 'the wrapped node-stream does not implement `destroy`, \n' + 'this may cause resource leaks.');else stream.destroy(); +} + +function write(read, stream, cb) { + var ended, + closed = false, + did; + + function done() { + if (did) return; + did = true; + cb && cb(ended === true ? null : ended); + } + + function onClose() { + if (closed) return; + closed = true; + cleanup(); + if (!ended) read(ended = true, done);else done(); + } + + function onError(err) { + cleanup(); + if (!ended) read(ended = err, done); + } + + function cleanup() { + stream.on('finish', onClose); + stream.removeListener('close', onClose); + stream.removeListener('error', onError); + } + + stream.on('close', onClose); + stream.on('finish', onClose); + stream.on('error', onError); + process.nextTick(function () { + looper(function (next) { + read(null, function (end, data) { + ended = ended || end; //you can't "end" a stdout stream, so this needs to be handled specially. + + if (end === true) return stream._isStdio ? done() : stream.end(); + + if (ended = ended || end) { + destroy(stream); + return done(ended); + } //I noticed a problem streaming to the terminal: + //sometimes the end got cut off, creating invalid output. + //it seems that stdout always emits "drain" when it ends. + //so this seems to work, but i have been unable to reproduce this test + //automatically, so you need to run ./test/stdout.js a few times and the end is valid json. + + + if (stream._isStdio) stream.write(data, function () { + next(); + });else { + var pause = stream.write(data); + if (pause === false) stream.once('drain', next);else next(); + } + }); + }); + }); +} + +function first(emitter, events, handler) { + function listener(val) { + events.forEach(function (e) { + emitter.removeListener(e, listener); + }); + handler(val); + } + + events.forEach(function (e) { + emitter.on(e, listener); + }); + return emitter; +} + +function read2(stream) { + var ended = false, + waiting = false; + + var _cb; + + function read() { + var data = stream.read(); + + if (data !== null && _cb) { + var cb = _cb; + _cb = null; + cb(null, data); + } + } + + stream.on('readable', function () { + waiting = true; + _cb && read(); + }).on('end', function () { + ended = true; + _cb && _cb(ended); + }).on('error', function (err) { + ended = err; + _cb && _cb(ended); + }); + return function (end, cb) { + _cb = cb; + if (ended) cb(ended);else if (waiting) read(); + }; +} + +function read1(stream) { + var buffer = [], + cbs = [], + ended, + paused = false; + var draining; + + function drain() { + while ((buffer.length || ended) && cbs.length) { + cbs.shift()(buffer.length ? null : ended, buffer.shift()); + } + + if (!buffer.length && paused) { + paused = false; + stream.resume(); + } + } + + stream.on('data', function (data) { + buffer.push(data); + drain(); + + if (buffer.length && stream.pause) { + paused = true; + stream.pause(); + } + }); + stream.on('end', function () { + ended = true; + drain(); + }); + stream.on('close', function () { + ended = true; + drain(); + }); + stream.on('error', function (err) { + ended = err; + drain(); + }); + return function (abort, cb) { + if (!cb) throw new Error('*must* provide cb'); + + if (abort) { + var onAbort = function onAbort() { + while (cbs.length) { + cbs.shift()(abort); + } + + cb(abort); + }; //if the stream happens to have already ended, then we don't need to abort. + + + if (ended) return onAbort(); + stream.once('close', onAbort); + destroy(stream); + } else { + cbs.push(cb); + drain(); + } + }; +} + +var read = read1; + +var sink = function sink(stream, cb) { + return function (read) { + return write(read, stream, cb); + }; +}; + +var source = function source(stream) { + return read1(stream); +}; + +exports = module.exports = function (stream, cb) { + return stream.writable && stream.write ? stream.readable ? function (_read) { + write(_read, stream, cb); + return read1(stream); + } : sink(stream, cb) : source(stream); +}; + +exports.sink = sink; +exports.source = source; +exports.read = read; +exports.read1 = read1; +exports.read2 = read2; + +exports.duplex = function (stream, cb) { + return { + source: source(stream), + sink: sink(stream, cb) + }; +}; + +exports.transform = function (stream) { + return function (read) { + var _source = source(stream); + + sink(stream)(read); + return _source; + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 20 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +var __WEBPACK_AMD_DEFINE_RESULT__; + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +; + +(function (globalObject) { + 'use strict'; + /* + * bignumber.js v8.1.1 + * A JavaScript library for arbitrary-precision arithmetic. + * https://github.com/MikeMcl/bignumber.js + * Copyright (c) 2019 Michael Mclaughlin + * MIT Licensed. + * + * BigNumber.prototype methods | BigNumber methods + * | + * absoluteValue abs | clone + * comparedTo | config set + * decimalPlaces dp | DECIMAL_PLACES + * dividedBy div | ROUNDING_MODE + * dividedToIntegerBy idiv | EXPONENTIAL_AT + * exponentiatedBy pow | RANGE + * integerValue | CRYPTO + * isEqualTo eq | MODULO_MODE + * isFinite | POW_PRECISION + * isGreaterThan gt | FORMAT + * isGreaterThanOrEqualTo gte | ALPHABET + * isInteger | isBigNumber + * isLessThan lt | maximum max + * isLessThanOrEqualTo lte | minimum min + * isNaN | random + * isNegative | sum + * isPositive | + * isZero | + * minus | + * modulo mod | + * multipliedBy times | + * negated | + * plus | + * precision sd | + * shiftedBy | + * squareRoot sqrt | + * toExponential | + * toFixed | + * toFormat | + * toFraction | + * toJSON | + * toNumber | + * toPrecision | + * toString | + * valueOf | + * + */ + + var BigNumber, + isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, + hasSymbol = typeof Symbol == 'function' && _typeof(Symbol.iterator) == 'symbol', + mathceil = Math.ceil, + mathfloor = Math.floor, + bignumberError = '[BigNumber Error] ', + tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ', + BASE = 1e14, + LOG_BASE = 14, + MAX_SAFE_INTEGER = 0x1fffffffffffff, + // 2^53 - 1 + // MAX_INT32 = 0x7fffffff, // 2^31 - 1 + POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], + SQRT_BASE = 1e7, + // EDITABLE + // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and + // the arguments to toExponential, toFixed, toFormat, and toPrecision. + MAX = 1E9; // 0 to MAX_INT32 + + /* + * Create and return a BigNumber constructor. + */ + + function clone(configObject) { + var div, + convertBase, + parseNumeric, + P = BigNumber.prototype = { + constructor: BigNumber, + toString: null, + valueOf: null + }, + ONE = new BigNumber(1), + //----------------------------- EDITABLE CONFIG DEFAULTS ------------------------------- + // The default values below must be integers within the inclusive ranges stated. + // The values can also be changed at run-time using BigNumber.set. + // The maximum number of decimal places for operations involving division. + DECIMAL_PLACES = 20, + // 0 to MAX + // The rounding mode used when rounding to the above decimal places, and when using + // toExponential, toFixed, toFormat and toPrecision, and round (default value). + // UP 0 Away from zero. + // DOWN 1 Towards zero. + // CEIL 2 Towards +Infinity. + // FLOOR 3 Towards -Infinity. + // HALF_UP 4 Towards nearest neighbour. If equidistant, up. + // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down. + // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour. + // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity. + // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity. + ROUNDING_MODE = 4, + // 0 to 8 + // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS] + // The exponent value at and beneath which toString returns exponential notation. + // Number type: -7 + TO_EXP_NEG = -7, + // 0 to -MAX + // The exponent value at and above which toString returns exponential notation. + // Number type: 21 + TO_EXP_POS = 21, + // 0 to MAX + // RANGE : [MIN_EXP, MAX_EXP] + // The minimum exponent value, beneath which underflow to zero occurs. + // Number type: -324 (5e-324) + MIN_EXP = -1e7, + // -1 to -MAX + // The maximum exponent value, above which overflow to Infinity occurs. + // Number type: 308 (1.7976931348623157e+308) + // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow. + MAX_EXP = 1e7, + // 1 to MAX + // Whether to use cryptographically-secure random number generation, if available. + CRYPTO = false, + // true or false + // The modulo mode used when calculating the modulus: a mod n. + // The quotient (q = a / n) is calculated according to the corresponding rounding mode. + // The remainder (r) is calculated as: r = a - n * q. + // + // UP 0 The remainder is positive if the dividend is negative, else is negative. + // DOWN 1 The remainder has the same sign as the dividend. + // This modulo mode is commonly known as 'truncated division' and is + // equivalent to (a % n) in JavaScript. + // FLOOR 3 The remainder has the same sign as the divisor (Python %). + // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function. + // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). + // The remainder is always positive. + // + // The truncated division, floored division, Euclidian division and IEEE 754 remainder + // modes are commonly used for the modulus operation. + // Although the other rounding modes can also be used, they may not give useful results. + MODULO_MODE = 1, + // 0 to 9 + // The maximum number of significant digits of the result of the exponentiatedBy operation. + // If POW_PRECISION is 0, there will be unlimited significant digits. + POW_PRECISION = 0, + // 0 to MAX + // The format specification used by the BigNumber.prototype.toFormat method. + FORMAT = { + prefix: '', + groupSize: 3, + secondaryGroupSize: 0, + groupSeparator: ',', + decimalSeparator: '.', + fractionGroupSize: 0, + fractionGroupSeparator: '\xA0', + // non-breaking space + suffix: '' + }, + // The alphabet used for base conversion. It must be at least 2 characters long, with no '+', + // '-', '.', whitespace, or repeated character. + // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_' + ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz'; //------------------------------------------------------------------------------------------ + // CONSTRUCTOR + + /* + * The BigNumber constructor and exported function. + * Create and return a new instance of a BigNumber object. + * + * v {number|string|BigNumber} A numeric value. + * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive. + */ + + function BigNumber(v, b) { + var alphabet, + c, + caseChanged, + e, + i, + isNum, + len, + str, + x = this; // Enable constructor call without `new`. + + if (!(x instanceof BigNumber)) return new BigNumber(v, b); + + if (b == null) { + if (v && v._isBigNumber === true) { + x.s = v.s; + + if (!v.c || v.e > MAX_EXP) { + x.c = x.e = null; + } else if (v.e < MIN_EXP) { + x.c = [x.e = 0]; + } else { + x.e = v.e; + x.c = v.c.slice(); + } + + return; + } + + if ((isNum = typeof v == 'number') && v * 0 == 0) { + // Use `1 / n` to handle minus zero also. + x.s = 1 / v < 0 ? (v = -v, -1) : 1; // Fast path for integers, where n < 2147483648 (2**31). + + if (v === ~~v) { + for (e = 0, i = v; i >= 10; i /= 10, e++) { + ; + } + + if (e > MAX_EXP) { + x.c = x.e = null; + } else { + x.e = e; + x.c = [v]; + } + + return; + } + + str = String(v); + } else { + if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum); + x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1; + } // Decimal point? + + + if ((e = str.indexOf('.')) > -1) str = str.replace('.', ''); // Exponential form? + + if ((i = str.search(/e/i)) > 0) { + // Determine exponent. + if (e < 0) e = i; + e += +str.slice(i + 1); + str = str.substring(0, i); + } else if (e < 0) { + // Integer. + e = str.length; + } + } else { + // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}' + intCheck(b, 2, ALPHABET.length, 'Base'); // Allow exponential notation to be used with base 10 argument, while + // also rounding to DECIMAL_PLACES as with other bases. + + if (b == 10) { + x = new BigNumber(v); + return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE); + } + + str = String(v); + + if (isNum = typeof v == 'number') { + // Avoid potential interpretation of Infinity and NaN as base 44+ values. + if (v * 0 != 0) return parseNumeric(x, str, isNum, b); + x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1; // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}' + + if (BigNumber.DEBUG && str.replace(/^0\.0*|\./, '').length > 15) { + throw Error(tooManyDigits + v); + } + } else { + x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1; + } + + alphabet = ALPHABET.slice(0, b); + e = i = 0; // Check that str is a valid base b number. + // Don't use RegExp, so alphabet can contain special characters. + + for (len = str.length; i < len; i++) { + if (alphabet.indexOf(c = str.charAt(i)) < 0) { + if (c == '.') { + // If '.' is not the first character and it has not be found before. + if (i > e) { + e = len; + continue; + } + } else if (!caseChanged) { + // Allow e.g. hexadecimal 'FF' as well as 'ff'. + if (str == str.toUpperCase() && (str = str.toLowerCase()) || str == str.toLowerCase() && (str = str.toUpperCase())) { + caseChanged = true; + i = -1; + e = 0; + continue; + } + } + + return parseNumeric(x, String(v), isNum, b); + } + } // Prevent later check for length on converted number. + + + isNum = false; + str = convertBase(str, b, 10, x.s); // Decimal point? + + if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');else e = str.length; + } // Determine leading zeros. + + + for (i = 0; str.charCodeAt(i) === 48; i++) { + ; + } // Determine trailing zeros. + + + for (len = str.length; str.charCodeAt(--len) === 48;) { + ; + } + + if (str = str.slice(i, ++len)) { + len -= i; // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}' + + if (isNum && BigNumber.DEBUG && len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) { + throw Error(tooManyDigits + x.s * v); + } // Overflow? + + + if ((e = e - i - 1) > MAX_EXP) { + // Infinity. + x.c = x.e = null; // Underflow? + } else if (e < MIN_EXP) { + // Zero. + x.c = [x.e = 0]; + } else { + x.e = e; + x.c = []; // Transform base + // e is the base 10 exponent. + // i is where to slice str to get the first element of the coefficient array. + + i = (e + 1) % LOG_BASE; + if (e < 0) i += LOG_BASE; // i < 1 + + if (i < len) { + if (i) x.c.push(+str.slice(0, i)); + + for (len -= LOG_BASE; i < len;) { + x.c.push(+str.slice(i, i += LOG_BASE)); + } + + i = LOG_BASE - (str = str.slice(i)).length; + } else { + i -= len; + } + + for (; i--; str += '0') { + ; + } + + x.c.push(+str); + } + } else { + // Zero. + x.c = [x.e = 0]; + } + } // CONSTRUCTOR PROPERTIES + + + BigNumber.clone = clone; + BigNumber.ROUND_UP = 0; + BigNumber.ROUND_DOWN = 1; + BigNumber.ROUND_CEIL = 2; + BigNumber.ROUND_FLOOR = 3; + BigNumber.ROUND_HALF_UP = 4; + BigNumber.ROUND_HALF_DOWN = 5; + BigNumber.ROUND_HALF_EVEN = 6; + BigNumber.ROUND_HALF_CEIL = 7; + BigNumber.ROUND_HALF_FLOOR = 8; + BigNumber.EUCLID = 9; + /* + * Configure infrequently-changing library-wide settings. + * + * Accept an object with the following optional properties (if the value of a property is + * a number, it must be an integer within the inclusive range stated): + * + * DECIMAL_PLACES {number} 0 to MAX + * ROUNDING_MODE {number} 0 to 8 + * EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX] + * RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX] + * CRYPTO {boolean} true or false + * MODULO_MODE {number} 0 to 9 + * POW_PRECISION {number} 0 to MAX + * ALPHABET {string} A string of two or more unique characters which does + * not contain '.'. + * FORMAT {object} An object with some of the following properties: + * prefix {string} + * groupSize {number} + * secondaryGroupSize {number} + * groupSeparator {string} + * decimalSeparator {string} + * fractionGroupSize {number} + * fractionGroupSeparator {string} + * suffix {string} + * + * (The values assigned to the above FORMAT object properties are not checked for validity.) + * + * E.g. + * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 }) + * + * Ignore properties/parameters set to null or undefined, except for ALPHABET. + * + * Return an object with the properties current values. + */ + + BigNumber.config = BigNumber.set = function (obj) { + var p, v; + + if (obj != null) { + if (_typeof(obj) == 'object') { + // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive. + // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}' + if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) { + v = obj[p]; + intCheck(v, 0, MAX, p); + DECIMAL_PLACES = v; + } // ROUNDING_MODE {number} Integer, 0 to 8 inclusive. + // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}' + + + if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) { + v = obj[p]; + intCheck(v, 0, 8, p); + ROUNDING_MODE = v; + } // EXPONENTIAL_AT {number|number[]} + // Integer, -MAX to MAX inclusive or + // [integer -MAX to 0 inclusive, 0 to MAX inclusive]. + // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}' + + + if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) { + v = obj[p]; + + if (v && v.pop) { + intCheck(v[0], -MAX, 0, p); + intCheck(v[1], 0, MAX, p); + TO_EXP_NEG = v[0]; + TO_EXP_POS = v[1]; + } else { + intCheck(v, -MAX, MAX, p); + TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v); + } + } // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or + // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive]. + // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}' + + + if (obj.hasOwnProperty(p = 'RANGE')) { + v = obj[p]; + + if (v && v.pop) { + intCheck(v[0], -MAX, -1, p); + intCheck(v[1], 1, MAX, p); + MIN_EXP = v[0]; + MAX_EXP = v[1]; + } else { + intCheck(v, -MAX, MAX, p); + + if (v) { + MIN_EXP = -(MAX_EXP = v < 0 ? -v : v); + } else { + throw Error(bignumberError + p + ' cannot be zero: ' + v); + } + } + } // CRYPTO {boolean} true or false. + // '[BigNumber Error] CRYPTO not true or false: {v}' + // '[BigNumber Error] crypto unavailable' + + + if (obj.hasOwnProperty(p = 'CRYPTO')) { + v = obj[p]; + + if (v === !!v) { + if (v) { + if (typeof crypto != 'undefined' && crypto && (crypto.getRandomValues || crypto.randomBytes)) { + CRYPTO = v; + } else { + CRYPTO = !v; + throw Error(bignumberError + 'crypto unavailable'); + } + } else { + CRYPTO = v; + } + } else { + throw Error(bignumberError + p + ' not true or false: ' + v); + } + } // MODULO_MODE {number} Integer, 0 to 9 inclusive. + // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}' + + + if (obj.hasOwnProperty(p = 'MODULO_MODE')) { + v = obj[p]; + intCheck(v, 0, 9, p); + MODULO_MODE = v; + } // POW_PRECISION {number} Integer, 0 to MAX inclusive. + // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}' + + + if (obj.hasOwnProperty(p = 'POW_PRECISION')) { + v = obj[p]; + intCheck(v, 0, MAX, p); + POW_PRECISION = v; + } // FORMAT {object} + // '[BigNumber Error] FORMAT not an object: {v}' + + + if (obj.hasOwnProperty(p = 'FORMAT')) { + v = obj[p]; + if (_typeof(v) == 'object') FORMAT = v;else throw Error(bignumberError + p + ' not an object: ' + v); + } // ALPHABET {string} + // '[BigNumber Error] ALPHABET invalid: {v}' + + + if (obj.hasOwnProperty(p = 'ALPHABET')) { + v = obj[p]; // Disallow if only one character, + // or if it contains '+', '-', '.', whitespace, or a repeated character. + + if (typeof v == 'string' && !/^.$|[+-.\s]|(.).*\1/.test(v)) { + ALPHABET = v; + } else { + throw Error(bignumberError + p + ' invalid: ' + v); + } + } + } else { + // '[BigNumber Error] Object expected: {v}' + throw Error(bignumberError + 'Object expected: ' + obj); + } + } + + return { + DECIMAL_PLACES: DECIMAL_PLACES, + ROUNDING_MODE: ROUNDING_MODE, + EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS], + RANGE: [MIN_EXP, MAX_EXP], + CRYPTO: CRYPTO, + MODULO_MODE: MODULO_MODE, + POW_PRECISION: POW_PRECISION, + FORMAT: FORMAT, + ALPHABET: ALPHABET + }; + }; + /* + * Return true if v is a BigNumber instance, otherwise return false. + * + * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed. + * + * v {any} + * + * '[BigNumber Error] Invalid BigNumber: {v}' + */ + + + BigNumber.isBigNumber = function (v) { + if (!v || v._isBigNumber !== true) return false; + if (!BigNumber.DEBUG) return true; + var i, + n, + c = v.c, + e = v.e, + s = v.s; + + out: if ({}.toString.call(c) == '[object Array]') { + if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) { + // If the first element is zero, the BigNumber value must be zero. + if (c[0] === 0) { + if (e === 0 && c.length === 1) return true; + break out; + } // Calculate number of digits that c[0] should have, based on the exponent. + + + i = (e + 1) % LOG_BASE; + if (i < 1) i += LOG_BASE; // Calculate number of digits of c[0]. + //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) { + + if (String(c[0]).length == i) { + for (i = 0; i < c.length; i++) { + n = c[i]; + if (n < 0 || n >= BASE || n !== mathfloor(n)) break out; + } // Last element cannot be zero, unless it is the only element. + + + if (n !== 0) return true; + } + } // Infinity/NaN + + } else if (c === null && e === null && (s === null || s === 1 || s === -1)) { + return true; + } + + throw Error(bignumberError + 'Invalid BigNumber: ' + v); + }; + /* + * Return a new BigNumber whose value is the maximum of the arguments. + * + * arguments {number|string|BigNumber} + */ + + + BigNumber.maximum = BigNumber.max = function () { + return maxOrMin(arguments, P.lt); + }; + /* + * Return a new BigNumber whose value is the minimum of the arguments. + * + * arguments {number|string|BigNumber} + */ + + + BigNumber.minimum = BigNumber.min = function () { + return maxOrMin(arguments, P.gt); + }; + /* + * Return a new BigNumber with a random value equal to or greater than 0 and less than 1, + * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing + * zeros are produced). + * + * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}' + * '[BigNumber Error] crypto unavailable' + */ + + + BigNumber.random = function () { + var pow2_53 = 0x20000000000000; // Return a 53 bit integer n, where 0 <= n < 9007199254740992. + // Check if Math.random() produces more than 32 bits of randomness. + // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits. + // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1. + + var random53bitInt = Math.random() * pow2_53 & 0x1fffff ? function () { + return mathfloor(Math.random() * pow2_53); + } : function () { + return (Math.random() * 0x40000000 | 0) * 0x800000 + (Math.random() * 0x800000 | 0); + }; + return function (dp) { + var a, + b, + e, + k, + v, + i = 0, + c = [], + rand = new BigNumber(ONE); + if (dp == null) dp = DECIMAL_PLACES;else intCheck(dp, 0, MAX); + k = mathceil(dp / LOG_BASE); + + if (CRYPTO) { + // Browsers supporting crypto.getRandomValues. + if (crypto.getRandomValues) { + a = crypto.getRandomValues(new Uint32Array(k *= 2)); + + for (; i < k;) { + // 53 bits: + // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2) + // 11111 11111111 11111111 11111111 11100000 00000000 00000000 + // ((Math.pow(2, 32) - 1) >>> 11).toString(2) + // 11111 11111111 11111111 + // 0x20000 is 2^21. + v = a[i] * 0x20000 + (a[i + 1] >>> 11); // Rejection sampling: + // 0 <= v < 9007199254740992 + // Probability that v >= 9e15, is + // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251 + + if (v >= 9e15) { + b = crypto.getRandomValues(new Uint32Array(2)); + a[i] = b[0]; + a[i + 1] = b[1]; + } else { + // 0 <= v <= 8999999999999999 + // 0 <= (v % 1e14) <= 99999999999999 + c.push(v % 1e14); + i += 2; + } + } + + i = k / 2; // Node.js supporting crypto.randomBytes. + } else if (crypto.randomBytes) { + // buffer + a = crypto.randomBytes(k *= 7); + + for (; i < k;) { + // 0x1000000000000 is 2^48, 0x10000000000 is 2^40 + // 0x100000000 is 2^32, 0x1000000 is 2^24 + // 11111 11111111 11111111 11111111 11111111 11111111 11111111 + // 0 <= v < 9007199254740992 + v = (a[i] & 31) * 0x1000000000000 + a[i + 1] * 0x10000000000 + a[i + 2] * 0x100000000 + a[i + 3] * 0x1000000 + (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6]; + + if (v >= 9e15) { + crypto.randomBytes(7).copy(a, i); + } else { + // 0 <= (v % 1e14) <= 99999999999999 + c.push(v % 1e14); + i += 7; + } + } + + i = k / 7; + } else { + CRYPTO = false; + throw Error(bignumberError + 'crypto unavailable'); + } + } // Use Math.random. + + + if (!CRYPTO) { + for (; i < k;) { + v = random53bitInt(); + if (v < 9e15) c[i++] = v % 1e14; + } + } + + k = c[--i]; + dp %= LOG_BASE; // Convert trailing digits to zeros according to dp. + + if (k && dp) { + v = POWS_TEN[LOG_BASE - dp]; + c[i] = mathfloor(k / v) * v; + } // Remove trailing elements which are zero. + + + for (; c[i] === 0; c.pop(), i--) { + ; + } // Zero? + + + if (i < 0) { + c = [e = 0]; + } else { + // Remove leading elements which are zero and adjust exponent accordingly. + for (e = -1; c[0] === 0; c.splice(0, 1), e -= LOG_BASE) { + ; + } // Count the digits of the first element of c to determine leading zeros, and... + + + for (i = 1, v = c[0]; v >= 10; v /= 10, i++) { + ; + } // adjust the exponent accordingly. + + + if (i < LOG_BASE) e -= LOG_BASE - i; + } + + rand.e = e; + rand.c = c; + return rand; + }; + }(); + /* + * Return a BigNumber whose value is the sum of the arguments. + * + * arguments {number|string|BigNumber} + */ + + + BigNumber.sum = function () { + var i = 1, + args = arguments, + sum = new BigNumber(args[0]); + + for (; i < args.length;) { + sum = sum.plus(args[i++]); + } + + return sum; + }; // PRIVATE FUNCTIONS + // Called by BigNumber and BigNumber.prototype.toString. + + + convertBase = function () { + var decimal = '0123456789'; + /* + * Convert string of baseIn to an array of numbers of baseOut. + * Eg. toBaseOut('255', 10, 16) returns [15, 15]. + * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5]. + */ + + function toBaseOut(str, baseIn, baseOut, alphabet) { + var j, + arr = [0], + arrL, + i = 0, + len = str.length; + + for (; i < len;) { + for (arrL = arr.length; arrL--; arr[arrL] *= baseIn) { + ; + } + + arr[0] += alphabet.indexOf(str.charAt(i++)); + + for (j = 0; j < arr.length; j++) { + if (arr[j] > baseOut - 1) { + if (arr[j + 1] == null) arr[j + 1] = 0; + arr[j + 1] += arr[j] / baseOut | 0; + arr[j] %= baseOut; + } + } + } + + return arr.reverse(); + } // Convert a numeric string of baseIn to a numeric string of baseOut. + // If the caller is toString, we are converting from base 10 to baseOut. + // If the caller is BigNumber, we are converting from baseIn to base 10. + + + return function (str, baseIn, baseOut, sign, callerIsToString) { + var alphabet, + d, + e, + k, + r, + x, + xc, + y, + i = str.indexOf('.'), + dp = DECIMAL_PLACES, + rm = ROUNDING_MODE; // Non-integer. + + if (i >= 0) { + k = POW_PRECISION; // Unlimited precision. + + POW_PRECISION = 0; + str = str.replace('.', ''); + y = new BigNumber(baseIn); + x = y.pow(str.length - i); + POW_PRECISION = k; // Convert str as if an integer, then restore the fraction part by dividing the + // result by its base raised to a power. + + y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'), 10, baseOut, decimal); + y.e = y.c.length; + } // Convert the number as integer. + + + xc = toBaseOut(str, baseIn, baseOut, callerIsToString ? (alphabet = ALPHABET, decimal) : (alphabet = decimal, ALPHABET)); // xc now represents str as an integer and converted to baseOut. e is the exponent. + + e = k = xc.length; // Remove trailing zeros. + + for (; xc[--k] == 0; xc.pop()) { + ; + } // Zero? + + + if (!xc[0]) return alphabet.charAt(0); // Does str represent an integer? If so, no need for the division. + + if (i < 0) { + --e; + } else { + x.c = xc; + x.e = e; // The sign is needed for correct rounding. + + x.s = sign; + x = div(x, y, dp, rm, baseOut); + xc = x.c; + r = x.r; + e = x.e; + } // xc now represents str converted to baseOut. + // THe index of the rounding digit. + + + d = e + dp + 1; // The rounding digit: the digit to the right of the digit that may be rounded up. + + i = xc[d]; // Look at the rounding digits and mode to determine whether to round up. + + k = baseOut / 2; + r = r || d < 0 || xc[d + 1] != null; + r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : i > k || i == k && (rm == 4 || r || rm == 6 && xc[d - 1] & 1 || rm == (x.s < 0 ? 8 : 7)); // If the index of the rounding digit is not greater than zero, or xc represents + // zero, then the result of the base conversion is zero or, if rounding up, a value + // such as 0.00001. + + if (d < 1 || !xc[0]) { + // 1^-dp or 0 + str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0); + } else { + // Truncate xc to the required number of decimal places. + xc.length = d; // Round up? + + if (r) { + // Rounding up may mean the previous digit has to be rounded up and so on. + for (--baseOut; ++xc[--d] > baseOut;) { + xc[d] = 0; + + if (!d) { + ++e; + xc = [1].concat(xc); + } + } + } // Determine trailing zeros. + + + for (k = xc.length; !xc[--k];) { + ; + } // E.g. [4, 11, 15] becomes 4bf. + + + for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++])) { + ; + } // Add leading zeros, decimal point and trailing zeros as required. + + + str = toFixedPoint(str, e, alphabet.charAt(0)); + } // The caller will add the sign. + + + return str; + }; + }(); // Perform division in the specified base. Called by div and convertBase. + + + div = function () { + // Assume non-zero x and k. + function multiply(x, k, base) { + var m, + temp, + xlo, + xhi, + carry = 0, + i = x.length, + klo = k % SQRT_BASE, + khi = k / SQRT_BASE | 0; + + for (x = x.slice(); i--;) { + xlo = x[i] % SQRT_BASE; + xhi = x[i] / SQRT_BASE | 0; + m = khi * xlo + xhi * klo; + temp = klo * xlo + m % SQRT_BASE * SQRT_BASE + carry; + carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi; + x[i] = temp % base; + } + + if (carry) x = [carry].concat(x); + return x; + } + + function compare(a, b, aL, bL) { + var i, cmp; + + if (aL != bL) { + cmp = aL > bL ? 1 : -1; + } else { + for (i = cmp = 0; i < aL; i++) { + if (a[i] != b[i]) { + cmp = a[i] > b[i] ? 1 : -1; + break; + } + } + } + + return cmp; + } + + function subtract(a, b, aL, base) { + var i = 0; // Subtract b from a. + + for (; aL--;) { + a[aL] -= i; + i = a[aL] < b[aL] ? 1 : 0; + a[aL] = i * base + a[aL] - b[aL]; + } // Remove leading zeros. + + + for (; !a[0] && a.length > 1; a.splice(0, 1)) { + ; + } + } // x: dividend, y: divisor. + + + return function (x, y, dp, rm, base) { + var cmp, + e, + i, + more, + n, + prod, + prodL, + q, + qc, + rem, + remL, + rem0, + xi, + xL, + yc0, + yL, + yz, + s = x.s == y.s ? 1 : -1, + xc = x.c, + yc = y.c; // Either NaN, Infinity or 0? + + if (!xc || !xc[0] || !yc || !yc[0]) { + return new BigNumber( // Return NaN if either NaN, or both Infinity or 0. + !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN : // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0. + xc && xc[0] == 0 || !yc ? s * 0 : s / 0); + } + + q = new BigNumber(s); + qc = q.c = []; + e = x.e - y.e; + s = dp + e + 1; + + if (!base) { + base = BASE; + e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE); + s = s / LOG_BASE | 0; + } // Result exponent may be one less then the current value of e. + // The coefficients of the BigNumbers from convertBase may have trailing zeros. + + + for (i = 0; yc[i] == (xc[i] || 0); i++) { + ; + } + + if (yc[i] > (xc[i] || 0)) e--; + + if (s < 0) { + qc.push(1); + more = true; + } else { + xL = xc.length; + yL = yc.length; + i = 0; + s += 2; // Normalise xc and yc so highest order digit of yc is >= base / 2. + + n = mathfloor(base / (yc[0] + 1)); // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1. + // if (n > 1 || n++ == 1 && yc[0] < base / 2) { + + if (n > 1) { + yc = multiply(yc, n, base); + xc = multiply(xc, n, base); + yL = yc.length; + xL = xc.length; + } + + xi = yL; + rem = xc.slice(0, yL); + remL = rem.length; // Add zeros to make remainder as long as divisor. + + for (; remL < yL; rem[remL++] = 0) { + ; + } + + yz = yc.slice(); + yz = [0].concat(yz); + yc0 = yc[0]; + if (yc[1] >= base / 2) yc0++; // Not necessary, but to prevent trial digit n > base, when using base 3. + // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15; + + do { + n = 0; // Compare divisor and remainder. + + cmp = compare(yc, rem, yL, remL); // If divisor < remainder. + + if (cmp < 0) { + // Calculate trial digit, n. + rem0 = rem[0]; + if (yL != remL) rem0 = rem0 * base + (rem[1] || 0); // n is how many times the divisor goes into the current remainder. + + n = mathfloor(rem0 / yc0); // Algorithm: + // product = divisor multiplied by trial digit (n). + // Compare product and remainder. + // If product is greater than remainder: + // Subtract divisor from product, decrement trial digit. + // Subtract product from remainder. + // If product was less than remainder at the last compare: + // Compare new remainder and divisor. + // If remainder is greater than divisor: + // Subtract divisor from remainder, increment trial digit. + + if (n > 1) { + // n may be > base only when base is 3. + if (n >= base) n = base - 1; // product = divisor * trial digit. + + prod = multiply(yc, n, base); + prodL = prod.length; + remL = rem.length; // Compare product and remainder. + // If product > remainder then trial digit n too high. + // n is 1 too high about 5% of the time, and is not known to have + // ever been more than 1 too high. + + while (compare(prod, rem, prodL, remL) == 1) { + n--; // Subtract divisor from product. + + subtract(prod, yL < prodL ? yz : yc, prodL, base); + prodL = prod.length; + cmp = 1; + } + } else { + // n is 0 or 1, cmp is -1. + // If n is 0, there is no need to compare yc and rem again below, + // so change cmp to 1 to avoid it. + // If n is 1, leave cmp as -1, so yc and rem are compared again. + if (n == 0) { + // divisor < remainder, so n must be at least 1. + cmp = n = 1; + } // product = divisor + + + prod = yc.slice(); + prodL = prod.length; + } + + if (prodL < remL) prod = [0].concat(prod); // Subtract product from remainder. + + subtract(rem, prod, remL, base); + remL = rem.length; // If product was < remainder. + + if (cmp == -1) { + // Compare divisor and new remainder. + // If divisor < new remainder, subtract divisor from remainder. + // Trial digit n too low. + // n is 1 too low about 5% of the time, and very rarely 2 too low. + while (compare(yc, rem, yL, remL) < 1) { + n++; // Subtract divisor from remainder. + + subtract(rem, yL < remL ? yz : yc, remL, base); + remL = rem.length; + } + } + } else if (cmp === 0) { + n++; + rem = [0]; + } // else cmp === 1 and n will be 0 + // Add the next digit, n, to the result array. + + + qc[i++] = n; // Update the remainder. + + if (rem[0]) { + rem[remL++] = xc[xi] || 0; + } else { + rem = [xc[xi]]; + remL = 1; + } + } while ((xi++ < xL || rem[0] != null) && s--); + + more = rem[0] != null; // Leading zero? + + if (!qc[0]) qc.splice(0, 1); + } + + if (base == BASE) { + // To calculate q.e, first get the number of digits of qc[0]. + for (i = 1, s = qc[0]; s >= 10; s /= 10, i++) { + ; + } + + round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more); // Caller is convertBase. + } else { + q.e = e; + q.r = +more; + } + + return q; + }; + }(); + /* + * Return a string representing the value of BigNumber n in fixed-point or exponential + * notation rounded to the specified decimal places or significant digits. + * + * n: a BigNumber. + * i: the index of the last digit required (i.e. the digit that may be rounded up). + * rm: the rounding mode. + * id: 1 (toExponential) or 2 (toPrecision). + */ + + + function format(n, i, rm, id) { + var c0, e, ne, len, str; + if (rm == null) rm = ROUNDING_MODE;else intCheck(rm, 0, 8); + if (!n.c) return n.toString(); + c0 = n.c[0]; + ne = n.e; + + if (i == null) { + str = coeffToString(n.c); + str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS) ? toExponential(str, ne) : toFixedPoint(str, ne, '0'); + } else { + n = round(new BigNumber(n), i, rm); // n.e may have changed if the value was rounded up. + + e = n.e; + str = coeffToString(n.c); + len = str.length; // toPrecision returns exponential notation if the number of significant digits + // specified is less than the number of digits necessary to represent the integer + // part of the value in fixed-point notation. + // Exponential notation. + + if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) { + // Append zeros? + for (; len < i; str += '0', len++) { + ; + } + + str = toExponential(str, e); // Fixed-point notation. + } else { + i -= ne; + str = toFixedPoint(str, e, '0'); // Append zeros? + + if (e + 1 > len) { + if (--i > 0) for (str += '.'; i--; str += '0') { + ; + } + } else { + i += e - len; + + if (i > 0) { + if (e + 1 == len) str += '.'; + + for (; i--; str += '0') { + ; + } + } + } + } + } + + return n.s < 0 && c0 ? '-' + str : str; + } // Handle BigNumber.max and BigNumber.min. + + + function maxOrMin(args, method) { + var n, + i = 1, + m = new BigNumber(args[0]); + + for (; i < args.length; i++) { + n = new BigNumber(args[i]); // If any number is NaN, return NaN. + + if (!n.s) { + m = n; + break; + } else if (method.call(m, n)) { + m = n; + } + } + + return m; + } + /* + * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP. + * Called by minus, plus and times. + */ + + + function normalise(n, c, e) { + var i = 1, + j = c.length; // Remove trailing zeros. + + for (; !c[--j]; c.pop()) { + ; + } // Calculate the base 10 exponent. First get the number of digits of c[0]. + + + for (j = c[0]; j >= 10; j /= 10, i++) { + ; + } // Overflow? + + + if ((e = i + e * LOG_BASE - 1) > MAX_EXP) { + // Infinity. + n.c = n.e = null; // Underflow? + } else if (e < MIN_EXP) { + // Zero. + n.c = [n.e = 0]; + } else { + n.e = e; + n.c = c; + } + + return n; + } // Handle values that fail the validity test in BigNumber. + + + parseNumeric = function () { + var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i, + dotAfter = /^([^.]+)\.$/, + dotBefore = /^\.([^.]+)$/, + isInfinityOrNaN = /^-?(Infinity|NaN)$/, + whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g; + return function (x, str, isNum, b) { + var base, + s = isNum ? str : str.replace(whitespaceOrPlus, ''); // No exception on ±Infinity or NaN. + + if (isInfinityOrNaN.test(s)) { + x.s = isNaN(s) ? null : s < 0 ? -1 : 1; + } else { + if (!isNum) { + // basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i + s = s.replace(basePrefix, function (m, p1, p2) { + base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8; + return !b || b == base ? p1 : m; + }); + + if (b) { + base = b; // E.g. '1.' to '1', '.1' to '0.1' + + s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1'); + } + + if (str != s) return new BigNumber(s, base); + } // '[BigNumber Error] Not a number: {n}' + // '[BigNumber Error] Not a base {b} number: {n}' + + + if (BigNumber.DEBUG) { + throw Error(bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str); + } // NaN + + + x.s = null; + } + + x.c = x.e = null; + }; + }(); + /* + * Round x to sd significant digits using rounding mode rm. Check for over/under-flow. + * If r is truthy, it is known that there are more digits after the rounding digit. + */ + + + function round(x, sd, rm, r) { + var d, + i, + j, + k, + n, + ni, + rd, + xc = x.c, + pows10 = POWS_TEN; // if x is not Infinity or NaN... + + if (xc) { + // rd is the rounding digit, i.e. the digit after the digit that may be rounded up. + // n is a base 1e14 number, the value of the element of array x.c containing rd. + // ni is the index of n within x.c. + // d is the number of digits of n. + // i is the index of rd within n including leading zeros. + // j is the actual index of rd within n (if < 0, rd is a leading zero). + out: { + // Get the number of digits of the first element of xc. + for (d = 1, k = xc[0]; k >= 10; k /= 10, d++) { + ; + } + + i = sd - d; // If the rounding digit is in the first element of xc... + + if (i < 0) { + i += LOG_BASE; + j = sd; + n = xc[ni = 0]; // Get the rounding digit at index j of n. + + rd = n / pows10[d - j - 1] % 10 | 0; + } else { + ni = mathceil((i + 1) / LOG_BASE); + + if (ni >= xc.length) { + if (r) { + // Needed by sqrt. + for (; xc.length <= ni; xc.push(0)) { + ; + } + + n = rd = 0; + d = 1; + i %= LOG_BASE; + j = i - LOG_BASE + 1; + } else { + break out; + } + } else { + n = k = xc[ni]; // Get the number of digits of n. + + for (d = 1; k >= 10; k /= 10, d++) { + ; + } // Get the index of rd within n. + + + i %= LOG_BASE; // Get the index of rd within n, adjusted for leading zeros. + // The number of leading zeros of n is given by LOG_BASE - d. + + j = i - LOG_BASE + d; // Get the rounding digit at index j of n. + + rd = j < 0 ? 0 : n / pows10[d - j - 1] % 10 | 0; + } + } + + r = r || sd < 0 || // Are there any non-zero digits after the rounding digit? + // The expression n % pows10[d - j - 1] returns all digits of n to the right + // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714. + xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]); + r = rm < 4 ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 && // Check whether the digit to the left of the rounding digit is odd. + (i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10 & 1 || rm == (x.s < 0 ? 8 : 7)); + + if (sd < 1 || !xc[0]) { + xc.length = 0; + + if (r) { + // Convert sd to decimal places. + sd -= x.e + 1; // 1, 0.1, 0.01, 0.001, 0.0001 etc. + + xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE]; + x.e = -sd || 0; + } else { + // Zero. + xc[0] = x.e = 0; + } + + return x; + } // Remove excess digits. + + + if (i == 0) { + xc.length = ni; + k = 1; + ni--; + } else { + xc.length = ni + 1; + k = pows10[LOG_BASE - i]; // E.g. 56700 becomes 56000 if 7 is the rounding digit. + // j > 0 means i > number of leading zeros of n. + + xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0; + } // Round up? + + + if (r) { + for (;;) { + // If the digit to be rounded up is in the first element of xc... + if (ni == 0) { + // i will be the length of xc[0] before k is added. + for (i = 1, j = xc[0]; j >= 10; j /= 10, i++) { + ; + } + + j = xc[0] += k; + + for (k = 1; j >= 10; j /= 10, k++) { + ; + } // if i != k the length has increased. + + + if (i != k) { + x.e++; + if (xc[0] == BASE) xc[0] = 1; + } + + break; + } else { + xc[ni] += k; + if (xc[ni] != BASE) break; + xc[ni--] = 0; + k = 1; + } + } + } // Remove trailing zeros. + + + for (i = xc.length; xc[--i] === 0; xc.pop()) { + ; + } + } // Overflow? Infinity. + + + if (x.e > MAX_EXP) { + x.c = x.e = null; // Underflow? Zero. + } else if (x.e < MIN_EXP) { + x.c = [x.e = 0]; + } + } + + return x; + } + + function valueOf(n) { + var str, + e = n.e; + if (e === null) return n.toString(); + str = coeffToString(n.c); + str = e <= TO_EXP_NEG || e >= TO_EXP_POS ? toExponential(str, e) : toFixedPoint(str, e, '0'); + return n.s < 0 ? '-' + str : str; + } // PROTOTYPE/INSTANCE METHODS + + /* + * Return a new BigNumber whose value is the absolute value of this BigNumber. + */ + + + P.absoluteValue = P.abs = function () { + var x = new BigNumber(this); + if (x.s < 0) x.s = 1; + return x; + }; + /* + * Return + * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b), + * -1 if the value of this BigNumber is less than the value of BigNumber(y, b), + * 0 if they have the same value, + * or null if the value of either is NaN. + */ + + + P.comparedTo = function (y, b) { + return compare(this, new BigNumber(y, b)); + }; + /* + * If dp is undefined or null or true or false, return the number of decimal places of the + * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN. + * + * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this + * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or + * ROUNDING_MODE if rm is omitted. + * + * [dp] {number} Decimal places: integer, 0 to MAX inclusive. + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' + */ + + + P.decimalPlaces = P.dp = function (dp, rm) { + var c, + n, + v, + x = this; + + if (dp != null) { + intCheck(dp, 0, MAX); + if (rm == null) rm = ROUNDING_MODE;else intCheck(rm, 0, 8); + return round(new BigNumber(x), dp + x.e + 1, rm); + } + + if (!(c = x.c)) return null; + n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE; // Subtract the number of trailing zeros of the last number. + + if (v = c[v]) for (; v % 10 == 0; v /= 10, n--) { + ; + } + if (n < 0) n = 0; + return n; + }; + /* + * n / 0 = I + * n / N = N + * n / I = 0 + * 0 / n = 0 + * 0 / 0 = N + * 0 / N = N + * 0 / I = 0 + * N / n = N + * N / 0 = N + * N / N = N + * N / I = N + * I / n = I + * I / 0 = I + * I / N = N + * I / I = N + * + * Return a new BigNumber whose value is the value of this BigNumber divided by the value of + * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE. + */ + + + P.dividedBy = P.div = function (y, b) { + return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE); + }; + /* + * Return a new BigNumber whose value is the integer part of dividing the value of this + * BigNumber by the value of BigNumber(y, b). + */ + + + P.dividedToIntegerBy = P.idiv = function (y, b) { + return div(this, new BigNumber(y, b), 0, 1); + }; + /* + * Return a BigNumber whose value is the value of this BigNumber exponentiated by n. + * + * If m is present, return the result modulo m. + * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE. + * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE. + * + * The modular power operation works efficiently when x, n, and m are integers, otherwise it + * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0. + * + * n {number|string|BigNumber} The exponent. An integer. + * [m] {number|string|BigNumber} The modulus. + * + * '[BigNumber Error] Exponent not an integer: {n}' + */ + + + P.exponentiatedBy = P.pow = function (n, m) { + var half, + isModExp, + i, + k, + more, + nIsBig, + nIsNeg, + nIsOdd, + y, + x = this; + n = new BigNumber(n); // Allow NaN and ±Infinity, but not other non-integers. + + if (n.c && !n.isInteger()) { + throw Error(bignumberError + 'Exponent not an integer: ' + valueOf(n)); + } + + if (m != null) m = new BigNumber(m); // Exponent of MAX_SAFE_INTEGER is 15. + + nIsBig = n.e > 14; // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0. + + if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) { + // The sign of the result of pow when x is negative depends on the evenness of n. + // If +n overflows to ±Infinity, the evenness of n would be not be known. + y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? 2 - isOdd(n) : +valueOf(n))); + return m ? y.mod(m) : y; + } + + nIsNeg = n.s < 0; + + if (m) { + // x % m returns NaN if abs(m) is zero, or m is NaN. + if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN); + isModExp = !nIsNeg && x.isInteger() && m.isInteger(); + if (isModExp) x = x.mod(m); // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15. + // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15. + } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0 // [1, 240000000] + ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7 // [80000000000000] [99999750000000] + : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) { + // If x is negative and n is odd, k = -0, else k = 0. + k = x.s < 0 && isOdd(n) ? -0 : 0; // If x >= 1, k = ±Infinity. + + if (x.e > -1) k = 1 / k; // If n is negative return ±0, else return ±Infinity. + + return new BigNumber(nIsNeg ? 1 / k : k); + } else if (POW_PRECISION) { + // Truncating each coefficient array to a length of k after each multiplication + // equates to truncating significant digits to POW_PRECISION + [28, 41], + // i.e. there will be a minimum of 28 guard digits retained. + k = mathceil(POW_PRECISION / LOG_BASE + 2); + } + + if (nIsBig) { + half = new BigNumber(0.5); + if (nIsNeg) n.s = 1; + nIsOdd = isOdd(n); + } else { + i = Math.abs(+valueOf(n)); + nIsOdd = i % 2; + } + + y = new BigNumber(ONE); // Performs 54 loop iterations for n of 9007199254740991. + + for (;;) { + if (nIsOdd) { + y = y.times(x); + if (!y.c) break; + + if (k) { + if (y.c.length > k) y.c.length = k; + } else if (isModExp) { + y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m)); + } + } + + if (i) { + i = mathfloor(i / 2); + if (i === 0) break; + nIsOdd = i % 2; + } else { + n = n.times(half); + round(n, n.e + 1, 1); + + if (n.e > 14) { + nIsOdd = isOdd(n); + } else { + i = +valueOf(n); + if (i === 0) break; + nIsOdd = i % 2; + } + } + + x = x.times(x); + + if (k) { + if (x.c && x.c.length > k) x.c.length = k; + } else if (isModExp) { + x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m)); + } + } + + if (isModExp) return y; + if (nIsNeg) y = ONE.div(y); + return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y; + }; + /* + * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer + * using rounding mode rm, or ROUNDING_MODE if rm is omitted. + * + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}' + */ + + + P.integerValue = function (rm) { + var n = new BigNumber(this); + if (rm == null) rm = ROUNDING_MODE;else intCheck(rm, 0, 8); + return round(n, n.e + 1, rm); + }; + /* + * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b), + * otherwise return false. + */ + + + P.isEqualTo = P.eq = function (y, b) { + return compare(this, new BigNumber(y, b)) === 0; + }; + /* + * Return true if the value of this BigNumber is a finite number, otherwise return false. + */ + + + P.isFinite = function () { + return !!this.c; + }; + /* + * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b), + * otherwise return false. + */ + + + P.isGreaterThan = P.gt = function (y, b) { + return compare(this, new BigNumber(y, b)) > 0; + }; + /* + * Return true if the value of this BigNumber is greater than or equal to the value of + * BigNumber(y, b), otherwise return false. + */ + + + P.isGreaterThanOrEqualTo = P.gte = function (y, b) { + return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0; + }; + /* + * Return true if the value of this BigNumber is an integer, otherwise return false. + */ + + + P.isInteger = function () { + return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2; + }; + /* + * Return true if the value of this BigNumber is less than the value of BigNumber(y, b), + * otherwise return false. + */ + + + P.isLessThan = P.lt = function (y, b) { + return compare(this, new BigNumber(y, b)) < 0; + }; + /* + * Return true if the value of this BigNumber is less than or equal to the value of + * BigNumber(y, b), otherwise return false. + */ + + + P.isLessThanOrEqualTo = P.lte = function (y, b) { + return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0; + }; + /* + * Return true if the value of this BigNumber is NaN, otherwise return false. + */ + + + P.isNaN = function () { + return !this.s; + }; + /* + * Return true if the value of this BigNumber is negative, otherwise return false. + */ + + + P.isNegative = function () { + return this.s < 0; + }; + /* + * Return true if the value of this BigNumber is positive, otherwise return false. + */ + + + P.isPositive = function () { + return this.s > 0; + }; + /* + * Return true if the value of this BigNumber is 0 or -0, otherwise return false. + */ + + + P.isZero = function () { + return !!this.c && this.c[0] == 0; + }; + /* + * n - 0 = n + * n - N = N + * n - I = -I + * 0 - n = -n + * 0 - 0 = 0 + * 0 - N = N + * 0 - I = -I + * N - n = N + * N - 0 = N + * N - N = N + * N - I = N + * I - n = I + * I - 0 = I + * I - N = N + * I - I = N + * + * Return a new BigNumber whose value is the value of this BigNumber minus the value of + * BigNumber(y, b). + */ + + + P.minus = function (y, b) { + var i, + j, + t, + xLTy, + x = this, + a = x.s; + y = new BigNumber(y, b); + b = y.s; // Either NaN? + + if (!a || !b) return new BigNumber(NaN); // Signs differ? + + if (a != b) { + y.s = -b; + return x.plus(y); + } + + var xe = x.e / LOG_BASE, + ye = y.e / LOG_BASE, + xc = x.c, + yc = y.c; + + if (!xe || !ye) { + // Either Infinity? + if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN); // Either zero? + + if (!xc[0] || !yc[0]) { + // Return y if y is non-zero, x if x is non-zero, or zero if both are zero. + return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x : // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity + ROUNDING_MODE == 3 ? -0 : 0); + } + } + + xe = bitFloor(xe); + ye = bitFloor(ye); + xc = xc.slice(); // Determine which is the bigger number. + + if (a = xe - ye) { + if (xLTy = a < 0) { + a = -a; + t = xc; + } else { + ye = xe; + t = yc; + } + + t.reverse(); // Prepend zeros to equalise exponents. + + for (b = a; b--; t.push(0)) { + ; + } + + t.reverse(); + } else { + // Exponents equal. Check digit by digit. + j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b; + + for (a = b = 0; b < j; b++) { + if (xc[b] != yc[b]) { + xLTy = xc[b] < yc[b]; + break; + } + } + } // x < y? Point xc to the array of the bigger number. + + + if (xLTy) t = xc, xc = yc, yc = t, y.s = -y.s; + b = (j = yc.length) - (i = xc.length); // Append zeros to xc if shorter. + // No need to add zeros to yc if shorter as subtract only needs to start at yc.length. + + if (b > 0) for (; b--; xc[i++] = 0) { + ; + } + b = BASE - 1; // Subtract yc from xc. + + for (; j > a;) { + if (xc[--j] < yc[j]) { + for (i = j; i && !xc[--i]; xc[i] = b) { + ; + } + + --xc[i]; + xc[j] += BASE; + } + + xc[j] -= yc[j]; + } // Remove leading zeros and adjust exponent accordingly. + + + for (; xc[0] == 0; xc.splice(0, 1), --ye) { + ; + } // Zero? + + + if (!xc[0]) { + // Following IEEE 754 (2008) 6.3, + // n - n = +0 but n - n = -0 when rounding towards -Infinity. + y.s = ROUNDING_MODE == 3 ? -1 : 1; + y.c = [y.e = 0]; + return y; + } // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity + // for finite x and y. + + + return normalise(y, xc, ye); + }; + /* + * n % 0 = N + * n % N = N + * n % I = n + * 0 % n = 0 + * -0 % n = -0 + * 0 % 0 = N + * 0 % N = N + * 0 % I = 0 + * N % n = N + * N % 0 = N + * N % N = N + * N % I = N + * I % n = N + * I % 0 = N + * I % N = N + * I % I = N + * + * Return a new BigNumber whose value is the value of this BigNumber modulo the value of + * BigNumber(y, b). The result depends on the value of MODULO_MODE. + */ + + + P.modulo = P.mod = function (y, b) { + var q, + s, + x = this; + y = new BigNumber(y, b); // Return NaN if x is Infinity or NaN, or y is NaN or zero. + + if (!x.c || !y.s || y.c && !y.c[0]) { + return new BigNumber(NaN); // Return x if y is Infinity or x is zero. + } else if (!y.c || x.c && !x.c[0]) { + return new BigNumber(x); + } + + if (MODULO_MODE == 9) { + // Euclidian division: q = sign(y) * floor(x / abs(y)) + // r = x - qy where 0 <= r < abs(y) + s = y.s; + y.s = 1; + q = div(x, y, 0, 3); + y.s = s; + q.s *= s; + } else { + q = div(x, y, 0, MODULO_MODE); + } + + y = x.minus(q.times(y)); // To match JavaScript %, ensure sign of zero is sign of dividend. + + if (!y.c[0] && MODULO_MODE == 1) y.s = x.s; + return y; + }; + /* + * n * 0 = 0 + * n * N = N + * n * I = I + * 0 * n = 0 + * 0 * 0 = 0 + * 0 * N = N + * 0 * I = N + * N * n = N + * N * 0 = N + * N * N = N + * N * I = N + * I * n = I + * I * 0 = N + * I * N = N + * I * I = I + * + * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value + * of BigNumber(y, b). + */ + + + P.multipliedBy = P.times = function (y, b) { + var c, + e, + i, + j, + k, + m, + xcL, + xlo, + xhi, + ycL, + ylo, + yhi, + zc, + base, + sqrtBase, + x = this, + xc = x.c, + yc = (y = new BigNumber(y, b)).c; // Either NaN, ±Infinity or ±0? + + if (!xc || !yc || !xc[0] || !yc[0]) { + // Return NaN if either is NaN, or one is 0 and the other is Infinity. + if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) { + y.c = y.e = y.s = null; + } else { + y.s *= x.s; // Return ±Infinity if either is ±Infinity. + + if (!xc || !yc) { + y.c = y.e = null; // Return ±0 if either is ±0. + } else { + y.c = [0]; + y.e = 0; + } + } + + return y; + } + + e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE); + y.s *= x.s; + xcL = xc.length; + ycL = yc.length; // Ensure xc points to longer array and xcL to its length. + + if (xcL < ycL) zc = xc, xc = yc, yc = zc, i = xcL, xcL = ycL, ycL = i; // Initialise the result array with zeros. + + for (i = xcL + ycL, zc = []; i--; zc.push(0)) { + ; + } + + base = BASE; + sqrtBase = SQRT_BASE; + + for (i = ycL; --i >= 0;) { + c = 0; + ylo = yc[i] % sqrtBase; + yhi = yc[i] / sqrtBase | 0; + + for (k = xcL, j = i + k; j > i;) { + xlo = xc[--k] % sqrtBase; + xhi = xc[k] / sqrtBase | 0; + m = yhi * xlo + xhi * ylo; + xlo = ylo * xlo + m % sqrtBase * sqrtBase + zc[j] + c; + c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi; + zc[j--] = xlo % base; + } + + zc[j] = c; + } + + if (c) { + ++e; + } else { + zc.splice(0, 1); + } + + return normalise(y, zc, e); + }; + /* + * Return a new BigNumber whose value is the value of this BigNumber negated, + * i.e. multiplied by -1. + */ + + + P.negated = function () { + var x = new BigNumber(this); + x.s = -x.s || null; + return x; + }; + /* + * n + 0 = n + * n + N = N + * n + I = I + * 0 + n = n + * 0 + 0 = 0 + * 0 + N = N + * 0 + I = I + * N + n = N + * N + 0 = N + * N + N = N + * N + I = N + * I + n = I + * I + 0 = I + * I + N = N + * I + I = I + * + * Return a new BigNumber whose value is the value of this BigNumber plus the value of + * BigNumber(y, b). + */ + + + P.plus = function (y, b) { + var t, + x = this, + a = x.s; + y = new BigNumber(y, b); + b = y.s; // Either NaN? + + if (!a || !b) return new BigNumber(NaN); // Signs differ? + + if (a != b) { + y.s = -b; + return x.minus(y); + } + + var xe = x.e / LOG_BASE, + ye = y.e / LOG_BASE, + xc = x.c, + yc = y.c; + + if (!xe || !ye) { + // Return ±Infinity if either ±Infinity. + if (!xc || !yc) return new BigNumber(a / 0); // Either zero? + // Return y if y is non-zero, x if x is non-zero, or zero if both are zero. + + if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0); + } + + xe = bitFloor(xe); + ye = bitFloor(ye); + xc = xc.slice(); // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts. + + if (a = xe - ye) { + if (a > 0) { + ye = xe; + t = yc; + } else { + a = -a; + t = xc; + } + + t.reverse(); + + for (; a--; t.push(0)) { + ; + } + + t.reverse(); + } + + a = xc.length; + b = yc.length; // Point xc to the longer array, and b to the shorter length. + + if (a - b < 0) t = yc, yc = xc, xc = t, b = a; // Only start adding at yc.length - 1 as the further digits of xc can be ignored. + + for (a = 0; b;) { + a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0; + xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE; + } + + if (a) { + xc = [a].concat(xc); + ++ye; + } // No need to check for zero, as +x + +y != 0 && -x + -y != 0 + // ye = MAX_EXP + 1 possible + + + return normalise(y, xc, ye); + }; + /* + * If sd is undefined or null or true or false, return the number of significant digits of + * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN. + * If sd is true include integer-part trailing zeros in the count. + * + * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this + * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or + * ROUNDING_MODE if rm is omitted. + * + * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive. + * boolean: whether to count integer-part trailing zeros: true or false. + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}' + */ + + + P.precision = P.sd = function (sd, rm) { + var c, + n, + v, + x = this; + + if (sd != null && sd !== !!sd) { + intCheck(sd, 1, MAX); + if (rm == null) rm = ROUNDING_MODE;else intCheck(rm, 0, 8); + return round(new BigNumber(x), sd, rm); + } + + if (!(c = x.c)) return null; + v = c.length - 1; + n = v * LOG_BASE + 1; + + if (v = c[v]) { + // Subtract the number of trailing zeros of the last element. + for (; v % 10 == 0; v /= 10, n--) { + ; + } // Add the number of digits of the first element. + + + for (v = c[0]; v >= 10; v /= 10, n++) { + ; + } + } + + if (sd && x.e + 1 > n) n = x.e + 1; + return n; + }; + /* + * Return a new BigNumber whose value is the value of this BigNumber shifted by k places + * (powers of 10). Shift to the right if n > 0, and to the left if n < 0. + * + * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}' + */ + + + P.shiftedBy = function (k) { + intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER); + return this.times('1e' + k); + }; + /* + * sqrt(-n) = N + * sqrt(N) = N + * sqrt(-I) = N + * sqrt(I) = I + * sqrt(0) = 0 + * sqrt(-0) = -0 + * + * Return a new BigNumber whose value is the square root of the value of this BigNumber, + * rounded according to DECIMAL_PLACES and ROUNDING_MODE. + */ + + + P.squareRoot = P.sqrt = function () { + var m, + n, + r, + rep, + t, + x = this, + c = x.c, + s = x.s, + e = x.e, + dp = DECIMAL_PLACES + 4, + half = new BigNumber('0.5'); // Negative/NaN/Infinity/zero? + + if (s !== 1 || !c || !c[0]) { + return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0); + } // Initial estimate. + + + s = Math.sqrt(+valueOf(x)); // Math.sqrt underflow/overflow? + // Pass x to Math.sqrt as integer, then adjust the exponent of the result. + + if (s == 0 || s == 1 / 0) { + n = coeffToString(c); + if ((n.length + e) % 2 == 0) n += '0'; + s = Math.sqrt(+n); + e = bitFloor((e + 1) / 2) - (e < 0 || e % 2); + + if (s == 1 / 0) { + n = '1e' + e; + } else { + n = s.toExponential(); + n = n.slice(0, n.indexOf('e') + 1) + e; + } + + r = new BigNumber(n); + } else { + r = new BigNumber(s + ''); + } // Check for zero. + // r could be zero if MIN_EXP is changed after the this value was created. + // This would cause a division by zero (x/t) and hence Infinity below, which would cause + // coeffToString to throw. + + + if (r.c[0]) { + e = r.e; + s = e + dp; + if (s < 3) s = 0; // Newton-Raphson iteration. + + for (;;) { + t = r; + r = half.times(t.plus(div(x, t, dp, 1))); + + if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) { + // The exponent of r may here be one less than the final result exponent, + // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits + // are indexed correctly. + if (r.e < e) --s; + n = n.slice(s - 3, s + 1); // The 4th rounding digit may be in error by -1 so if the 4 rounding digits + // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the + // iteration. + + if (n == '9999' || !rep && n == '4999') { + // On the first iteration only, check to see if rounding up gives the + // exact result as the nines may infinitely repeat. + if (!rep) { + round(t, t.e + DECIMAL_PLACES + 2, 0); + + if (t.times(t).eq(x)) { + r = t; + break; + } + } + + dp += 4; + s += 4; + rep = 1; + } else { + // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact + // result. If not, then there are further digits and m will be truthy. + if (!+n || !+n.slice(1) && n.charAt(0) == '5') { + // Truncate to the first rounding digit. + round(r, r.e + DECIMAL_PLACES + 2, 1); + m = !r.times(r).eq(x); + } + + break; + } + } + } + } + + return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m); + }; + /* + * Return a string representing the value of this BigNumber in exponential notation and + * rounded using ROUNDING_MODE to dp fixed decimal places. + * + * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' + */ + + + P.toExponential = function (dp, rm) { + if (dp != null) { + intCheck(dp, 0, MAX); + dp++; + } + + return format(this, dp, rm, 1); + }; + /* + * Return a string representing the value of this BigNumber in fixed-point notation rounding + * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted. + * + * Note: as with JavaScript's number type, (-0).toFixed(0) is '0', + * but e.g. (-0.00001).toFixed(0) is '-0'. + * + * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' + */ + + + P.toFixed = function (dp, rm) { + if (dp != null) { + intCheck(dp, 0, MAX); + dp = dp + this.e + 1; + } + + return format(this, dp, rm); + }; + /* + * Return a string representing the value of this BigNumber in fixed-point notation rounded + * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties + * of the format or FORMAT object (see BigNumber.set). + * + * The formatting object may contain some or all of the properties shown below. + * + * FORMAT = { + * prefix: '', + * groupSize: 3, + * secondaryGroupSize: 0, + * groupSeparator: ',', + * decimalSeparator: '.', + * fractionGroupSize: 0, + * fractionGroupSeparator: '\xA0', // non-breaking space + * suffix: '' + * }; + * + * [dp] {number} Decimal places. Integer, 0 to MAX inclusive. + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * [format] {object} Formatting options. See FORMAT pbject above. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}' + * '[BigNumber Error] Argument not an object: {format}' + */ + + + P.toFormat = function (dp, rm, format) { + var str, + x = this; + + if (format == null) { + if (dp != null && rm && _typeof(rm) == 'object') { + format = rm; + rm = null; + } else if (dp && _typeof(dp) == 'object') { + format = dp; + dp = rm = null; + } else { + format = FORMAT; + } + } else if (_typeof(format) != 'object') { + throw Error(bignumberError + 'Argument not an object: ' + format); + } + + str = x.toFixed(dp, rm); + + if (x.c) { + var i, + arr = str.split('.'), + g1 = +format.groupSize, + g2 = +format.secondaryGroupSize, + groupSeparator = format.groupSeparator || '', + intPart = arr[0], + fractionPart = arr[1], + isNeg = x.s < 0, + intDigits = isNeg ? intPart.slice(1) : intPart, + len = intDigits.length; + if (g2) i = g1, g1 = g2, g2 = i, len -= i; + + if (g1 > 0 && len > 0) { + i = len % g1 || g1; + intPart = intDigits.substr(0, i); + + for (; i < len; i += g1) { + intPart += groupSeparator + intDigits.substr(i, g1); + } + + if (g2 > 0) intPart += groupSeparator + intDigits.slice(i); + if (isNeg) intPart = '-' + intPart; + } + + str = fractionPart ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize) ? fractionPart.replace(new RegExp('\\d{' + g2 + '}\\B', 'g'), '$&' + (format.fractionGroupSeparator || '')) : fractionPart) : intPart; + } + + return (format.prefix || '') + str + (format.suffix || ''); + }; + /* + * Return an array of two BigNumbers representing the value of this BigNumber as a simple + * fraction with an integer numerator and an integer denominator. + * The denominator will be a positive non-zero value less than or equal to the specified + * maximum denominator. If a maximum denominator is not specified, the denominator will be + * the lowest value necessary to represent the number exactly. + * + * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator. + * + * '[BigNumber Error] Argument {not an integer|out of range} : {md}' + */ + + + P.toFraction = function (md) { + var d, + d0, + d1, + d2, + e, + exp, + n, + n0, + n1, + q, + r, + s, + x = this, + xc = x.c; + + if (md != null) { + n = new BigNumber(md); // Throw if md is less than one or is not an integer, unless it is Infinity. + + if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) { + throw Error(bignumberError + 'Argument ' + (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n)); + } + } + + if (!xc) return new BigNumber(x); + d = new BigNumber(ONE); + n1 = d0 = new BigNumber(ONE); + d1 = n0 = new BigNumber(ONE); + s = coeffToString(xc); // Determine initial denominator. + // d is a power of 10 and the minimum max denominator that specifies the value exactly. + + e = d.e = s.length - x.e - 1; + d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp]; + md = !md || n.comparedTo(d) > 0 ? e > 0 ? d : n1 : n; + exp = MAX_EXP; + MAX_EXP = 1 / 0; + n = new BigNumber(s); // n0 = d1 = 0 + + n0.c[0] = 0; + + for (;;) { + q = div(n, d, 0, 1); + d2 = d0.plus(q.times(d1)); + if (d2.comparedTo(md) == 1) break; + d0 = d1; + d1 = d2; + n1 = n0.plus(q.times(d2 = n1)); + n0 = d2; + d = n.minus(q.times(d2 = d)); + n = d2; + } + + d2 = div(md.minus(d0), d1, 0, 1); + n0 = n0.plus(d2.times(n1)); + d0 = d0.plus(d2.times(d1)); + n0.s = n1.s = x.s; + e = e * 2; // Determine which fraction is closer to x, n0/d0 or n1/d1 + + r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0]; + MAX_EXP = exp; + return r; + }; + /* + * Return the value of this BigNumber converted to a number primitive. + */ + + + P.toNumber = function () { + return +valueOf(this); + }; + /* + * Return a string representing the value of this BigNumber rounded to sd significant digits + * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits + * necessary to represent the integer part of the value in fixed-point notation, then use + * exponential notation. + * + * [sd] {number} Significant digits. Integer, 1 to MAX inclusive. + * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive. + * + * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}' + */ + + + P.toPrecision = function (sd, rm) { + if (sd != null) intCheck(sd, 1, MAX); + return format(this, sd, rm, 2); + }; + /* + * Return a string representing the value of this BigNumber in base b, or base 10 if b is + * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and + * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent + * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than + * TO_EXP_NEG, return exponential notation. + * + * [b] {number} Integer, 2 to ALPHABET.length inclusive. + * + * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}' + */ + + + P.toString = function (b) { + var str, + n = this, + s = n.s, + e = n.e; // Infinity or NaN? + + if (e === null) { + if (s) { + str = 'Infinity'; + if (s < 0) str = '-' + str; + } else { + str = 'NaN'; + } + } else { + if (b == null) { + str = e <= TO_EXP_NEG || e >= TO_EXP_POS ? toExponential(coeffToString(n.c), e) : toFixedPoint(coeffToString(n.c), e, '0'); + } else if (b === 10) { + n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE); + str = toFixedPoint(coeffToString(n.c), n.e, '0'); + } else { + intCheck(b, 2, ALPHABET.length, 'Base'); + str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true); + } + + if (s < 0 && n.c[0]) str = '-' + str; + } + + return str; + }; + /* + * Return as toString, but do not accept a base argument, and include the minus sign for + * negative zero. + */ + + + P.valueOf = P.toJSON = function () { + return valueOf(this); + }; + + P._isBigNumber = true; + + if (hasSymbol) { + P[Symbol.toStringTag] = 'BigNumber'; // Node.js v10.12.0+ + + P[Symbol["for"]('nodejs.util.inspect.custom')] = P.valueOf; + } + + if (configObject != null) BigNumber.set(configObject); + return BigNumber; + } // PRIVATE HELPER FUNCTIONS + // These functions don't need access to variables, + // e.g. DECIMAL_PLACES, in the scope of the `clone` function above. + + + function bitFloor(n) { + var i = n | 0; + return n > 0 || n === i ? i : i - 1; + } // Return a coefficient array as a string of base 10 digits. + + + function coeffToString(a) { + var s, + z, + i = 1, + j = a.length, + r = a[0] + ''; + + for (; i < j;) { + s = a[i++] + ''; + z = LOG_BASE - s.length; + + for (; z--; s = '0' + s) { + ; + } + + r += s; + } // Determine trailing zeros. + + + for (j = r.length; r.charCodeAt(--j) === 48;) { + ; + } + + return r.slice(0, j + 1 || 1); + } // Compare the value of BigNumbers x and y. + + + function compare(x, y) { + var a, + b, + xc = x.c, + yc = y.c, + i = x.s, + j = y.s, + k = x.e, + l = y.e; // Either NaN? + + if (!i || !j) return null; + a = xc && !xc[0]; + b = yc && !yc[0]; // Either zero? + + if (a || b) return a ? b ? 0 : -j : i; // Signs differ? + + if (i != j) return i; + a = i < 0; + b = k == l; // Either Infinity? + + if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1; // Compare exponents. + + if (!b) return k > l ^ a ? 1 : -1; + j = (k = xc.length) < (l = yc.length) ? k : l; // Compare digit by digit. + + for (i = 0; i < j; i++) { + if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1; + } // Compare lengths. + + + return k == l ? 0 : k > l ^ a ? 1 : -1; + } + /* + * Check that n is a primitive number, an integer, and in range, otherwise throw. + */ + + + function intCheck(n, min, max, name) { + if (n < min || n > max || n !== mathfloor(n)) { + throw Error(bignumberError + (name || 'Argument') + (typeof n == 'number' ? n < min || n > max ? ' out of range: ' : ' not an integer: ' : ' not a primitive number: ') + String(n)); + } + } // Assumes finite n. + + + function isOdd(n) { + var k = n.c.length - 1; + return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0; + } + + function toExponential(str, e) { + return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) + (e < 0 ? 'e' : 'e+') + e; + } + + function toFixedPoint(str, e, z) { + var len, zs; // Negative exponent? + + if (e < 0) { + // Prepend zeros. + for (zs = z + '.'; ++e; zs += z) { + ; + } + + str = zs + str; // Positive exponent + } else { + len = str.length; // Append zeros. + + if (++e > len) { + for (zs = z, e -= len; --e; zs += z) { + ; + } + + str += zs; + } else if (e < len) { + str = str.slice(0, e) + '.' + str.slice(e); + } + } + + return str; + } // EXPORT + + + BigNumber = clone(); + BigNumber['default'] = BigNumber.BigNumber = BigNumber; // AMD. + + if (true) { + !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () { + return BigNumber; + }).call(exports, __webpack_require__, exports, module), + __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); // Node.js and other environments that support module.exports. + } else {} +})(void 0); + +/***/ }), +/* 21 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var basex = __webpack_require__(194); + +var ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'; +module.exports = basex(ALPHABET); + +/***/ }), +/* 22 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.source = __webpack_require__(168); +exports.through = __webpack_require__(371); +exports.sink = __webpack_require__(169); +exports.duplex = __webpack_require__(372); + +/***/ }), +/* 23 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) {/* + * Id is an object representation of a peer Id. a peer Id is a multihash + */ + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var mh = __webpack_require__(14); + +var cryptoKeys = __webpack_require__(216); + +var assert = __webpack_require__(56); + +var waterfall = __webpack_require__(145); + +var withIs = __webpack_require__(27); + +var PeerId = +/*#__PURE__*/ +function () { + function PeerId(id, privKey, pubKey) { + _classCallCheck(this, PeerId); + + assert(Buffer.isBuffer(id), 'invalid id provided'); + + if (privKey && pubKey) { + assert(privKey["public"].bytes.equals(pubKey.bytes), 'inconsistent arguments'); + } + + this._id = id; + this._idB58String = mh.toB58String(this.id); + this._privKey = privKey; + this._pubKey = pubKey; + } + + _createClass(PeerId, [{ + key: "marshalPubKey", + // Return the protobuf version of the public key, matching go ipfs formatting + value: function marshalPubKey() { + if (this.pubKey) { + return cryptoKeys.marshalPublicKey(this.pubKey); + } + } // Return the protobuf version of the private key, matching go ipfs formatting + + }, { + key: "marshalPrivKey", + value: function marshalPrivKey() { + if (this.privKey) { + return cryptoKeys.marshalPrivateKey(this.privKey); + } + } + }, { + key: "toPrint", + value: function toPrint() { + var pid = this.toB58String(); // All sha256 nodes start with Qm + // We can skip the Qm to make the peer.ID more useful + + if (pid.startsWith('Qm')) { + pid = pid.slice(2); + } + + var maxRunes = 6; + + if (pid.length < maxRunes) { + maxRunes = pid.length; + } + + return ''; + } // return the jsonified version of the key, matching the formatting + // of go-ipfs for its config file + + }, { + key: "toJSON", + value: function toJSON() { + return { + id: this.toB58String(), + privKey: toB64Opt(this.marshalPrivKey()), + pubKey: toB64Opt(this.marshalPubKey()) + }; + } // encode/decode functions + + }, { + key: "toHexString", + value: function toHexString() { + return mh.toHexString(this.id); + } + }, { + key: "toBytes", + value: function toBytes() { + return this.id; + } + }, { + key: "toB58String", + value: function toB58String() { + return this._idB58String; + } + }, { + key: "isEqual", + value: function isEqual(id) { + if (Buffer.isBuffer(id)) { + return this.id.equals(id); + } else if (id.id) { + return this.id.equals(id.id); + } else { + throw new Error('not valid Id'); + } + } + /* + * Check if this PeerId instance is valid (privKey -> pubKey -> Id) + */ + + }, { + key: "isValid", + value: function isValid(callback) { + // TODO Needs better checking + if (this.privKey && this.privKey["public"] && this.privKey["public"].bytes && Buffer.isBuffer(this.pubKey.bytes) && this.privKey["public"].bytes.equals(this.pubKey.bytes)) { + callback(); + } else { + callback(new Error('Keys not match')); + } + } + }, { + key: "id", + get: function get() { + return this._id; + }, + set: function set(val) { + throw new Error('Id is immutable'); + } + }, { + key: "privKey", + get: function get() { + return this._privKey; + }, + set: function set(privKey) { + this._privKey = privKey; + } + }, { + key: "pubKey", + get: function get() { + if (this._pubKey) { + return this._pubKey; + } + + if (this._privKey) { + return this._privKey["public"]; + } + }, + set: function set(pubKey) { + this._pubKey = pubKey; + } + }]); + + return PeerId; +}(); + +var PeerIdWithIs = withIs(PeerId, { + className: 'PeerId', + symbolName: '@libp2p/js-peer-id/PeerId' +}); +exports = module.exports = PeerIdWithIs; // generation + +exports.create = function (opts, callback) { + if (typeof opts === 'function') { + callback = opts; + opts = {}; + } + + opts = opts || {}; + opts.bits = opts.bits || 2048; + waterfall([function (cb) { + return cryptoKeys.generateKeyPair('RSA', opts.bits, cb); + }, function (privKey, cb) { + return privKey["public"].hash(function (err, digest) { + cb(err, digest, privKey); + }); + }], function (err, digest, privKey) { + if (err) { + return callback(err); + } + + callback(null, new PeerIdWithIs(digest, privKey)); + }); +}; + +exports.createFromHexString = function (str) { + return new PeerIdWithIs(mh.fromHexString(str)); +}; + +exports.createFromBytes = function (buf) { + return new PeerIdWithIs(buf); +}; + +exports.createFromB58String = function (str) { + return new PeerIdWithIs(mh.fromB58String(str)); +}; // Public Key input will be a buffer + + +exports.createFromPubKey = function (key, callback) { + if (typeof callback !== 'function') { + throw new Error('callback is required'); + } + + var pubKey; + + try { + var buf = key; + + if (typeof buf === 'string') { + buf = Buffer.from(key, 'base64'); + } + + if (!Buffer.isBuffer(buf)) throw new Error('Supplied key is neither a base64 string nor a buffer'); + pubKey = cryptoKeys.unmarshalPublicKey(buf); + } catch (err) { + return callback(err); + } + + pubKey.hash(function (err, digest) { + if (err) { + return callback(err); + } + + callback(null, new PeerIdWithIs(digest, null, pubKey)); + }); +}; // Private key input will be a string + + +exports.createFromPrivKey = function (key, callback) { + if (typeof callback !== 'function') { + throw new Error('callback is required'); + } + + var buf = key; + + try { + if (typeof buf === 'string') { + buf = Buffer.from(key, 'base64'); + } + + if (!Buffer.isBuffer(buf)) throw new Error('Supplied key is neither a base64 string nor a buffer'); + } catch (err) { + return callback(err); + } + + waterfall([function (cb) { + return cryptoKeys.unmarshalPrivateKey(buf, cb); + }, function (privKey, cb) { + return privKey["public"].hash(function (err, digest) { + cb(err, digest, privKey); + }); + }], function (err, digest, privKey) { + if (err) { + return callback(err); + } + + callback(null, new PeerIdWithIs(digest, privKey, privKey["public"])); + }); +}; + +exports.createFromJSON = function (obj, callback) { + if (typeof callback !== 'function') { + throw new Error('callback is required'); + } + + var id; + var rawPrivKey; + var rawPubKey; + var pub; + + try { + id = mh.fromB58String(obj.id); + rawPrivKey = obj.privKey && Buffer.from(obj.privKey, 'base64'); + rawPubKey = obj.pubKey && Buffer.from(obj.pubKey, 'base64'); + pub = rawPubKey && cryptoKeys.unmarshalPublicKey(rawPubKey); + } catch (err) { + return callback(err); + } + + if (rawPrivKey) { + waterfall([function (cb) { + return cryptoKeys.unmarshalPrivateKey(rawPrivKey, cb); + }, function (priv, cb) { + return priv["public"].hash(function (err, digest) { + cb(err, digest, priv); + }); + }, function (privDigest, priv, cb) { + if (pub) { + pub.hash(function (err, pubDigest) { + cb(err, privDigest, priv, pubDigest); + }); + } else { + cb(null, privDigest, priv); + } + }], function (err, privDigest, priv, pubDigest) { + if (err) { + return callback(err); + } + + if (pub && !privDigest.equals(pubDigest)) { + return callback(new Error('Public and private key do not match')); + } + + if (id && !privDigest.equals(id)) { + return callback(new Error('Id and private key do not match')); + } + + callback(null, new PeerIdWithIs(id, priv, pub)); + }); + } else { + callback(null, new PeerIdWithIs(id, null, pub)); + } +}; + +exports.isPeerId = function (peerId) { + return Boolean(_typeof(peerId) === 'object' && peerId._id && peerId._idB58String); +}; + +function toB64Opt(val) { + if (val) { + return val.toString('base64'); + } +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 24 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// a duplex stream is just a stream that is both readable and writable. +// Since JS doesn't have multiple prototypal inheritance, this class +// prototypally inherits from Readable, and then parasitically from +// Writable. + +/**/ + +var pna = __webpack_require__(54); +/**/ + +/**/ + + +var objectKeys = Object.keys || function (obj) { + var keys = []; + + for (var key in obj) { + keys.push(key); + } + + return keys; +}; +/**/ + + +module.exports = Duplex; +/**/ + +var util = __webpack_require__(39); + +util.inherits = __webpack_require__(2); +/**/ + +var Readable = __webpack_require__(132); + +var Writable = __webpack_require__(79); + +util.inherits(Duplex, Readable); +{ + // avoid scope creep, the keys array can then be collected + var keys = objectKeys(Writable.prototype); + + for (var v = 0; v < keys.length; v++) { + var method = keys[v]; + if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method]; + } +} + +function Duplex(options) { + if (!(this instanceof Duplex)) return new Duplex(options); + Readable.call(this, options); + Writable.call(this, options); + if (options && options.readable === false) this.readable = false; + if (options && options.writable === false) this.writable = false; + this.allowHalfOpen = true; + if (options && options.allowHalfOpen === false) this.allowHalfOpen = false; + this.once('end', onend); +} + +Object.defineProperty(Duplex.prototype, 'writableHighWaterMark', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState.highWaterMark; + } +}); // the no-half-open enforcer + +function onend() { + // if we allow half-open state, or if the writable side ended, + // then we're ok. + if (this.allowHalfOpen || this._writableState.ended) return; // no more data can be written. + // But allow more writes to happen in this tick. + + pna.nextTick(onEndNT, this); +} + +function onEndNT(self) { + self.end(); +} + +Object.defineProperty(Duplex.prototype, 'destroyed', { + get: function get() { + if (this._readableState === undefined || this._writableState === undefined) { + return false; + } + + return this._readableState.destroyed && this._writableState.destroyed; + }, + set: function set(value) { + // we ignore the value if the stream + // has not been initialized yet + if (this._readableState === undefined || this._writableState === undefined) { + return; + } // backward compatibility, the user is explicitly + // managing destroyed + + + this._readableState.destroyed = value; + this._writableState.destroyed = value; + } +}); + +Duplex.prototype._destroy = function (err, cb) { + this.push(null); + this.end(); + pna.nextTick(cb, err); +}; + +/***/ }), +/* 25 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + +/**/ + +var Buffer = __webpack_require__(7).Buffer; +/**/ + + +var isEncoding = Buffer.isEncoding || function (encoding) { + encoding = '' + encoding; + + switch (encoding && encoding.toLowerCase()) { + case 'hex': + case 'utf8': + case 'utf-8': + case 'ascii': + case 'binary': + case 'base64': + case 'ucs2': + case 'ucs-2': + case 'utf16le': + case 'utf-16le': + case 'raw': + return true; + + default: + return false; + } +}; + +function _normalizeEncoding(enc) { + if (!enc) return 'utf8'; + var retried; + + while (true) { + switch (enc) { + case 'utf8': + case 'utf-8': + return 'utf8'; + + case 'ucs2': + case 'ucs-2': + case 'utf16le': + case 'utf-16le': + return 'utf16le'; + + case 'latin1': + case 'binary': + return 'latin1'; + + case 'base64': + case 'ascii': + case 'hex': + return enc; + + default: + if (retried) return; // undefined + + enc = ('' + enc).toLowerCase(); + retried = true; + } + } +} + +; // Do not cache `Buffer.isEncoding` when checking encoding names as some +// modules monkey-patch it to support additional encodings + +function normalizeEncoding(enc) { + var nenc = _normalizeEncoding(enc); + + if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc); + return nenc || enc; +} // StringDecoder provides an interface for efficiently splitting a series of +// buffers into a series of JS strings without breaking apart multi-byte +// characters. + + +exports.StringDecoder = StringDecoder; + +function StringDecoder(encoding) { + this.encoding = normalizeEncoding(encoding); + var nb; + + switch (this.encoding) { + case 'utf16le': + this.text = utf16Text; + this.end = utf16End; + nb = 4; + break; + + case 'utf8': + this.fillLast = utf8FillLast; + nb = 4; + break; + + case 'base64': + this.text = base64Text; + this.end = base64End; + nb = 3; + break; + + default: + this.write = simpleWrite; + this.end = simpleEnd; + return; + } + + this.lastNeed = 0; + this.lastTotal = 0; + this.lastChar = Buffer.allocUnsafe(nb); +} + +StringDecoder.prototype.write = function (buf) { + if (buf.length === 0) return ''; + var r; + var i; + + if (this.lastNeed) { + r = this.fillLast(buf); + if (r === undefined) return ''; + i = this.lastNeed; + this.lastNeed = 0; + } else { + i = 0; + } + + if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i); + return r || ''; +}; + +StringDecoder.prototype.end = utf8End; // Returns only complete characters in a Buffer + +StringDecoder.prototype.text = utf8Text; // Attempts to complete a partial non-UTF-8 character using bytes from a Buffer + +StringDecoder.prototype.fillLast = function (buf) { + if (this.lastNeed <= buf.length) { + buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed); + return this.lastChar.toString(this.encoding, 0, this.lastTotal); + } + + buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length); + this.lastNeed -= buf.length; +}; // Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a +// continuation byte. If an invalid byte is detected, -2 is returned. + + +function utf8CheckByte(_byte) { + if (_byte <= 0x7F) return 0;else if (_byte >> 5 === 0x06) return 2;else if (_byte >> 4 === 0x0E) return 3;else if (_byte >> 3 === 0x1E) return 4; + return _byte >> 6 === 0x02 ? -1 : -2; +} // Checks at most 3 bytes at the end of a Buffer in order to detect an +// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4) +// needed to complete the UTF-8 character (if applicable) are returned. + + +function utf8CheckIncomplete(self, buf, i) { + var j = buf.length - 1; + if (j < i) return 0; + var nb = utf8CheckByte(buf[j]); + + if (nb >= 0) { + if (nb > 0) self.lastNeed = nb - 1; + return nb; + } + + if (--j < i || nb === -2) return 0; + nb = utf8CheckByte(buf[j]); + + if (nb >= 0) { + if (nb > 0) self.lastNeed = nb - 2; + return nb; + } + + if (--j < i || nb === -2) return 0; + nb = utf8CheckByte(buf[j]); + + if (nb >= 0) { + if (nb > 0) { + if (nb === 2) nb = 0;else self.lastNeed = nb - 3; + } + + return nb; + } + + return 0; +} // Validates as many continuation bytes for a multi-byte UTF-8 character as +// needed or are available. If we see a non-continuation byte where we expect +// one, we "replace" the validated continuation bytes we've seen so far with +// a single UTF-8 replacement character ('\ufffd'), to match v8's UTF-8 decoding +// behavior. The continuation byte check is included three times in the case +// where all of the continuation bytes for a character exist in the same buffer. +// It is also done this way as a slight performance increase instead of using a +// loop. + + +function utf8CheckExtraBytes(self, buf, p) { + if ((buf[0] & 0xC0) !== 0x80) { + self.lastNeed = 0; + return "\uFFFD"; + } + + if (self.lastNeed > 1 && buf.length > 1) { + if ((buf[1] & 0xC0) !== 0x80) { + self.lastNeed = 1; + return "\uFFFD"; + } + + if (self.lastNeed > 2 && buf.length > 2) { + if ((buf[2] & 0xC0) !== 0x80) { + self.lastNeed = 2; + return "\uFFFD"; + } + } + } +} // Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer. + + +function utf8FillLast(buf) { + var p = this.lastTotal - this.lastNeed; + var r = utf8CheckExtraBytes(this, buf, p); + if (r !== undefined) return r; + + if (this.lastNeed <= buf.length) { + buf.copy(this.lastChar, p, 0, this.lastNeed); + return this.lastChar.toString(this.encoding, 0, this.lastTotal); + } + + buf.copy(this.lastChar, p, 0, buf.length); + this.lastNeed -= buf.length; +} // Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a +// partial character, the character's bytes are buffered until the required +// number of bytes are available. + + +function utf8Text(buf, i) { + var total = utf8CheckIncomplete(this, buf, i); + if (!this.lastNeed) return buf.toString('utf8', i); + this.lastTotal = total; + var end = buf.length - (total - this.lastNeed); + buf.copy(this.lastChar, 0, end); + return buf.toString('utf8', i, end); +} // For UTF-8, a replacement character is added when ending on a partial +// character. + + +function utf8End(buf) { + var r = buf && buf.length ? this.write(buf) : ''; + if (this.lastNeed) return r + "\uFFFD"; + return r; +} // UTF-16LE typically needs two bytes per character, but even if we have an even +// number of bytes available, we need to check if we end on a leading/high +// surrogate. In that case, we need to wait for the next two bytes in order to +// decode the last character properly. + + +function utf16Text(buf, i) { + if ((buf.length - i) % 2 === 0) { + var r = buf.toString('utf16le', i); + + if (r) { + var c = r.charCodeAt(r.length - 1); + + if (c >= 0xD800 && c <= 0xDBFF) { + this.lastNeed = 2; + this.lastTotal = 4; + this.lastChar[0] = buf[buf.length - 2]; + this.lastChar[1] = buf[buf.length - 1]; + return r.slice(0, -1); + } + } + + return r; + } + + this.lastNeed = 1; + this.lastTotal = 2; + this.lastChar[0] = buf[buf.length - 1]; + return buf.toString('utf16le', i, buf.length - 1); +} // For UTF-16LE we do not explicitly append special replacement characters if we +// end on a partial character, we simply let v8 handle that. + + +function utf16End(buf) { + var r = buf && buf.length ? this.write(buf) : ''; + + if (this.lastNeed) { + var end = this.lastTotal - this.lastNeed; + return r + this.lastChar.toString('utf16le', 0, end); + } + + return r; +} + +function base64Text(buf, i) { + var n = (buf.length - i) % 3; + if (n === 0) return buf.toString('base64', i); + this.lastNeed = 3 - n; + this.lastTotal = 3; + + if (n === 1) { + this.lastChar[0] = buf[buf.length - 1]; + } else { + this.lastChar[0] = buf[buf.length - 2]; + this.lastChar[1] = buf[buf.length - 1]; + } + + return buf.toString('base64', i, buf.length - n); +} + +function base64End(buf) { + var r = buf && buf.length ? this.write(buf) : ''; + if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed); + return r; +} // Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex) + + +function simpleWrite(buf) { + return buf.toString(this.encoding); +} + +function simpleEnd(buf) { + return buf && buf.length ? this.write(buf) : ''; +} + +/***/ }), +/* 26 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var pump = __webpack_require__(11); + +var concat = __webpack_require__(41); +/* + Concatenate a stream to a single value. +*/ + + +function streamToValue(response, callback) { + var data; + pump(response, concat(function (d) { + data = d; + }), function (err) { + return callback(err, data); + }); +} + +module.exports = streamToValue; + +/***/ }), +/* 27 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } } + +function _construct(Parent, args, Class) { if (isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); } + +function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } + +function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } + +function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } + +function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } + +function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } + +function withIs(Class, _ref) { + var className = _ref.className, + symbolName = _ref.symbolName; + var symbol = Symbol["for"](symbolName); + + var ClassIsWrapper = _defineProperty({}, className, + /*#__PURE__*/ + function (_Class) { + _inherits(_class, _Class); + + function _class() { + var _getPrototypeOf2; + + var _this2; + + _classCallCheck(this, _class); + + for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { + args[_key] = arguments[_key]; + } + + _this2 = _possibleConstructorReturn(this, (_getPrototypeOf2 = _getPrototypeOf(_class)).call.apply(_getPrototypeOf2, [this].concat(args))); + Object.defineProperty(_assertThisInitialized(_this2), symbol, { + value: true + }); + return _this2; + } + + _createClass(_class, [{ + key: Symbol.toStringTag, + get: function get() { + return className; + } + }]); + + return _class; + }(Class))[className]; + + ClassIsWrapper["is".concat(className)] = function (obj) { + return !!(obj && obj[symbol]); + }; + + return ClassIsWrapper; +} + +function withIsProto(Class, _ref2) { + var className = _ref2.className, + symbolName = _ref2.symbolName, + withoutNew = _ref2.withoutNew; + var symbol = Symbol["for"](symbolName); + /* eslint-disable object-shorthand */ + + var ClassIsWrapper = _defineProperty({}, className, function () { + for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) { + args[_key2] = arguments[_key2]; + } + + if (withoutNew && !(this instanceof ClassIsWrapper)) { + return _construct(ClassIsWrapper, args); + } + + var _this = Class.call.apply(Class, [this].concat(args)) || this; + + if (_this && !_this[symbol]) { + Object.defineProperty(_this, symbol, { + value: true + }); + } + + return _this; + })[className]; + /* eslint-enable object-shorthand */ + + + ClassIsWrapper.prototype = Object.create(Class.prototype); + ClassIsWrapper.prototype.constructor = ClassIsWrapper; + Object.defineProperty(ClassIsWrapper.prototype, Symbol.toStringTag, { + get: function get() { + return className; + } + }); + + ClassIsWrapper["is".concat(className)] = function (obj) { + return !!(obj && obj[symbol]); + }; + + return ClassIsWrapper; +} + +module.exports = withIs; +module.exports.proto = withIsProto; + +/***/ }), +/* 28 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Node.js module for Forge message digests. + * + * @author Dave Longley + * + * Copyright 2011-2017 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +module.exports = forge.md = forge.md || {}; +forge.md.algorithms = forge.md.algorithms || {}; + +/***/ }), +/* 29 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var asn1 = exports; +asn1.bignum = __webpack_require__(251); +asn1.define = __webpack_require__(253).define; +asn1.base = __webpack_require__(38); +asn1.constants = __webpack_require__(122); +asn1.decoders = __webpack_require__(260); +asn1.encoders = __webpack_require__(262); + +/***/ }), +/* 30 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var R = (typeof Reflect === "undefined" ? "undefined" : _typeof(Reflect)) === 'object' ? Reflect : null; +var ReflectApply = R && typeof R.apply === 'function' ? R.apply : function ReflectApply(target, receiver, args) { + return Function.prototype.apply.call(target, receiver, args); +}; +var ReflectOwnKeys; + +if (R && typeof R.ownKeys === 'function') { + ReflectOwnKeys = R.ownKeys; +} else if (Object.getOwnPropertySymbols) { + ReflectOwnKeys = function ReflectOwnKeys(target) { + return Object.getOwnPropertyNames(target).concat(Object.getOwnPropertySymbols(target)); + }; +} else { + ReflectOwnKeys = function ReflectOwnKeys(target) { + return Object.getOwnPropertyNames(target); + }; +} + +function ProcessEmitWarning(warning) { + if (console && console.warn) console.warn(warning); +} + +var NumberIsNaN = Number.isNaN || function NumberIsNaN(value) { + return value !== value; +}; + +function EventEmitter() { + EventEmitter.init.call(this); +} + +module.exports = EventEmitter; // Backwards-compat with node 0.10.x + +EventEmitter.EventEmitter = EventEmitter; +EventEmitter.prototype._events = undefined; +EventEmitter.prototype._eventsCount = 0; +EventEmitter.prototype._maxListeners = undefined; // By default EventEmitters will print a warning if more than 10 listeners are +// added to it. This is a useful default which helps finding memory leaks. + +var defaultMaxListeners = 10; +Object.defineProperty(EventEmitter, 'defaultMaxListeners', { + enumerable: true, + get: function get() { + return defaultMaxListeners; + }, + set: function set(arg) { + if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) { + throw new RangeError('The value of "defaultMaxListeners" is out of range. It must be a non-negative number. Received ' + arg + '.'); + } + + defaultMaxListeners = arg; + } +}); + +EventEmitter.init = function () { + if (this._events === undefined || this._events === Object.getPrototypeOf(this)._events) { + this._events = Object.create(null); + this._eventsCount = 0; + } + + this._maxListeners = this._maxListeners || undefined; +}; // Obviously not all Emitters should be limited to 10. This function allows +// that to be increased. Set to zero for unlimited. + + +EventEmitter.prototype.setMaxListeners = function setMaxListeners(n) { + if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) { + throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received ' + n + '.'); + } + + this._maxListeners = n; + return this; +}; + +function $getMaxListeners(that) { + if (that._maxListeners === undefined) return EventEmitter.defaultMaxListeners; + return that._maxListeners; +} + +EventEmitter.prototype.getMaxListeners = function getMaxListeners() { + return $getMaxListeners(this); +}; + +EventEmitter.prototype.emit = function emit(type) { + var args = []; + + for (var i = 1; i < arguments.length; i++) { + args.push(arguments[i]); + } + + var doError = type === 'error'; + var events = this._events; + if (events !== undefined) doError = doError && events.error === undefined;else if (!doError) return false; // If there is no 'error' event listener then throw. + + if (doError) { + var er; + if (args.length > 0) er = args[0]; + + if (er instanceof Error) { + // Note: The comments on the `throw` lines are intentional, they show + // up in Node's output if this results in an unhandled exception. + throw er; // Unhandled 'error' event + } // At least give some kind of context to the user + + + var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : '')); + err.context = er; + throw err; // Unhandled 'error' event + } + + var handler = events[type]; + if (handler === undefined) return false; + + if (typeof handler === 'function') { + ReflectApply(handler, this, args); + } else { + var len = handler.length; + var listeners = arrayClone(handler, len); + + for (var i = 0; i < len; ++i) { + ReflectApply(listeners[i], this, args); + } + } + + return true; +}; + +function _addListener(target, type, listener, prepend) { + var m; + var events; + var existing; + + if (typeof listener !== 'function') { + throw new TypeError('The "listener" argument must be of type Function. Received type ' + _typeof(listener)); + } + + events = target._events; + + if (events === undefined) { + events = target._events = Object.create(null); + target._eventsCount = 0; + } else { + // To avoid recursion in the case that type === "newListener"! Before + // adding it to the listeners, first emit "newListener". + if (events.newListener !== undefined) { + target.emit('newListener', type, listener.listener ? listener.listener : listener); // Re-assign `events` because a newListener handler could have caused the + // this._events to be assigned to a new object + + events = target._events; + } + + existing = events[type]; + } + + if (existing === undefined) { + // Optimize the case of one listener. Don't need the extra array object. + existing = events[type] = listener; + ++target._eventsCount; + } else { + if (typeof existing === 'function') { + // Adding the second element, need to change to array. + existing = events[type] = prepend ? [listener, existing] : [existing, listener]; // If we've already got an array, just append. + } else if (prepend) { + existing.unshift(listener); + } else { + existing.push(listener); + } // Check for listener leak + + + m = $getMaxListeners(target); + + if (m > 0 && existing.length > m && !existing.warned) { + existing.warned = true; // No error code for this since it is a Warning + // eslint-disable-next-line no-restricted-syntax + + var w = new Error('Possible EventEmitter memory leak detected. ' + existing.length + ' ' + String(type) + ' listeners ' + 'added. Use emitter.setMaxListeners() to ' + 'increase limit'); + w.name = 'MaxListenersExceededWarning'; + w.emitter = target; + w.type = type; + w.count = existing.length; + ProcessEmitWarning(w); + } + } + + return target; +} + +EventEmitter.prototype.addListener = function addListener(type, listener) { + return _addListener(this, type, listener, false); +}; + +EventEmitter.prototype.on = EventEmitter.prototype.addListener; + +EventEmitter.prototype.prependListener = function prependListener(type, listener) { + return _addListener(this, type, listener, true); +}; + +function onceWrapper() { + var args = []; + + for (var i = 0; i < arguments.length; i++) { + args.push(arguments[i]); + } + + if (!this.fired) { + this.target.removeListener(this.type, this.wrapFn); + this.fired = true; + ReflectApply(this.listener, this.target, args); + } +} + +function _onceWrap(target, type, listener) { + var state = { + fired: false, + wrapFn: undefined, + target: target, + type: type, + listener: listener + }; + var wrapped = onceWrapper.bind(state); + wrapped.listener = listener; + state.wrapFn = wrapped; + return wrapped; +} + +EventEmitter.prototype.once = function once(type, listener) { + if (typeof listener !== 'function') { + throw new TypeError('The "listener" argument must be of type Function. Received type ' + _typeof(listener)); + } + + this.on(type, _onceWrap(this, type, listener)); + return this; +}; + +EventEmitter.prototype.prependOnceListener = function prependOnceListener(type, listener) { + if (typeof listener !== 'function') { + throw new TypeError('The "listener" argument must be of type Function. Received type ' + _typeof(listener)); + } + + this.prependListener(type, _onceWrap(this, type, listener)); + return this; +}; // Emits a 'removeListener' event if and only if the listener was removed. + + +EventEmitter.prototype.removeListener = function removeListener(type, listener) { + var list, events, position, i, originalListener; + + if (typeof listener !== 'function') { + throw new TypeError('The "listener" argument must be of type Function. Received type ' + _typeof(listener)); + } + + events = this._events; + if (events === undefined) return this; + list = events[type]; + if (list === undefined) return this; + + if (list === listener || list.listener === listener) { + if (--this._eventsCount === 0) this._events = Object.create(null);else { + delete events[type]; + if (events.removeListener) this.emit('removeListener', type, list.listener || listener); + } + } else if (typeof list !== 'function') { + position = -1; + + for (i = list.length - 1; i >= 0; i--) { + if (list[i] === listener || list[i].listener === listener) { + originalListener = list[i].listener; + position = i; + break; + } + } + + if (position < 0) return this; + if (position === 0) list.shift();else { + spliceOne(list, position); + } + if (list.length === 1) events[type] = list[0]; + if (events.removeListener !== undefined) this.emit('removeListener', type, originalListener || listener); + } + + return this; +}; + +EventEmitter.prototype.off = EventEmitter.prototype.removeListener; + +EventEmitter.prototype.removeAllListeners = function removeAllListeners(type) { + var listeners, events, i; + events = this._events; + if (events === undefined) return this; // not listening for removeListener, no need to emit + + if (events.removeListener === undefined) { + if (arguments.length === 0) { + this._events = Object.create(null); + this._eventsCount = 0; + } else if (events[type] !== undefined) { + if (--this._eventsCount === 0) this._events = Object.create(null);else delete events[type]; + } + + return this; + } // emit removeListener for all listeners on all events + + + if (arguments.length === 0) { + var keys = Object.keys(events); + var key; + + for (i = 0; i < keys.length; ++i) { + key = keys[i]; + if (key === 'removeListener') continue; + this.removeAllListeners(key); + } + + this.removeAllListeners('removeListener'); + this._events = Object.create(null); + this._eventsCount = 0; + return this; + } + + listeners = events[type]; + + if (typeof listeners === 'function') { + this.removeListener(type, listeners); + } else if (listeners !== undefined) { + // LIFO order + for (i = listeners.length - 1; i >= 0; i--) { + this.removeListener(type, listeners[i]); + } + } + + return this; +}; + +function _listeners(target, type, unwrap) { + var events = target._events; + if (events === undefined) return []; + var evlistener = events[type]; + if (evlistener === undefined) return []; + if (typeof evlistener === 'function') return unwrap ? [evlistener.listener || evlistener] : [evlistener]; + return unwrap ? unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length); +} + +EventEmitter.prototype.listeners = function listeners(type) { + return _listeners(this, type, true); +}; + +EventEmitter.prototype.rawListeners = function rawListeners(type) { + return _listeners(this, type, false); +}; + +EventEmitter.listenerCount = function (emitter, type) { + if (typeof emitter.listenerCount === 'function') { + return emitter.listenerCount(type); + } else { + return listenerCount.call(emitter, type); + } +}; + +EventEmitter.prototype.listenerCount = listenerCount; + +function listenerCount(type) { + var events = this._events; + + if (events !== undefined) { + var evlistener = events[type]; + + if (typeof evlistener === 'function') { + return 1; + } else if (evlistener !== undefined) { + return evlistener.length; + } + } + + return 0; +} + +EventEmitter.prototype.eventNames = function eventNames() { + return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : []; +}; + +function arrayClone(arr, n) { + var copy = new Array(n); + + for (var i = 0; i < n; ++i) { + copy[i] = arr[i]; + } + + return copy; +} + +function spliceOne(list, index) { + for (; index + 1 < list.length; index++) { + list[index] = list[index + 1]; + } + + list.pop(); +} + +function unwrapListeners(arr) { + var ret = new Array(arr.length); + + for (var i = 0; i < ret.length; ++i) { + ret[i] = arr[i].listener || arr[i]; + } + + return ret; +} + +/***/ }), +/* 31 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Buffer = __webpack_require__(7).Buffer; // prototype class for hash functions + + +function Hash(blockSize, finalSize) { + this._block = Buffer.alloc(blockSize); + this._finalSize = finalSize; + this._blockSize = blockSize; + this._len = 0; +} + +Hash.prototype.update = function (data, enc) { + if (typeof data === 'string') { + enc = enc || 'utf8'; + data = Buffer.from(data, enc); + } + + var block = this._block; + var blockSize = this._blockSize; + var length = data.length; + var accum = this._len; + + for (var offset = 0; offset < length;) { + var assigned = accum % blockSize; + var remainder = Math.min(length - offset, blockSize - assigned); + + for (var i = 0; i < remainder; i++) { + block[assigned + i] = data[offset + i]; + } + + accum += remainder; + offset += remainder; + + if (accum % blockSize === 0) { + this._update(block); + } + } + + this._len += length; + return this; +}; + +Hash.prototype.digest = function (enc) { + var rem = this._len % this._blockSize; + this._block[rem] = 0x80; // zero (rem + 1) trailing bits, where (rem + 1) is the smallest + // non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize + + this._block.fill(0, rem + 1); + + if (rem >= this._finalSize) { + this._update(this._block); + + this._block.fill(0); + } + + var bits = this._len * 8; // uint32 + + if (bits <= 0xffffffff) { + this._block.writeUInt32BE(bits, this._blockSize - 4); // uint64 + + } else { + var lowBits = (bits & 0xffffffff) >>> 0; + var highBits = (bits - lowBits) / 0x100000000; + + this._block.writeUInt32BE(highBits, this._blockSize - 8); + + this._block.writeUInt32BE(lowBits, this._blockSize - 4); + } + + this._update(this._block); + + var hash = this._hash(); + + return enc ? hash.toString(enc) : hash; +}; + +Hash.prototype._update = function () { + throw new Error('_update must be implemented by subclass'); +}; + +module.exports = Hash; + +/***/ }), +/* 32 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) {// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// a duplex stream is just a stream that is both readable and writable. +// Since JS doesn't have multiple prototypal inheritance, this class +// prototypally inherits from Readable, and then parasitically from +// Writable. + +/**/ + +var objectKeys = Object.keys || function (obj) { + var keys = []; + + for (var key in obj) { + keys.push(key); + } + + return keys; +}; +/**/ + + +module.exports = Duplex; + +var Readable = __webpack_require__(150); + +var Writable = __webpack_require__(154); + +__webpack_require__(2)(Duplex, Readable); + +{ + // Allow the keys array to be GC'ed. + var keys = objectKeys(Writable.prototype); + + for (var v = 0; v < keys.length; v++) { + var method = keys[v]; + if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method]; + } +} + +function Duplex(options) { + if (!(this instanceof Duplex)) return new Duplex(options); + Readable.call(this, options); + Writable.call(this, options); + this.allowHalfOpen = true; + + if (options) { + if (options.readable === false) this.readable = false; + if (options.writable === false) this.writable = false; + + if (options.allowHalfOpen === false) { + this.allowHalfOpen = false; + this.once('end', onend); + } + } +} + +Object.defineProperty(Duplex.prototype, 'writableHighWaterMark', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState.highWaterMark; + } +}); +Object.defineProperty(Duplex.prototype, 'writableBuffer', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState && this._writableState.getBuffer(); + } +}); +Object.defineProperty(Duplex.prototype, 'writableLength', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState.length; + } +}); // the no-half-open enforcer + +function onend() { + // If the writable side ended, then we're ok. + if (this._writableState.ended) return; // no more data can be written. + // But allow more writes to happen in this tick. + + process.nextTick(onEndNT, this); +} + +function onEndNT(self) { + self.end(); +} + +Object.defineProperty(Duplex.prototype, 'destroyed', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + if (this._readableState === undefined || this._writableState === undefined) { + return false; + } + + return this._readableState.destroyed && this._writableState.destroyed; + }, + set: function set(value) { + // we ignore the value if the stream + // has not been initialized yet + if (this._readableState === undefined || this._writableState === undefined) { + return; + } // backward compatibility, the user is explicitly + // managing destroyed + + + this._readableState.destroyed = value; + this._writableState.destroyed = value; + } +}); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 33 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } + +function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } + +function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } + +function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } + +function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } + +var TransformStream = __webpack_require__(5).Transform; +/* + Transforms a stream of {Name, Hash} objects to include size + of the DAG object. + + Usage: inputStream.pipe(new FileResultStreamConverter()) + + Input object format: + { + Name: '/path/to/file/foo.txt', + Hash: 'Qma4hjFTnCasJ8PVp3mZbZK5g2vGDT4LByLJ7m8ciyRFZP' + Size: '20' + } + + Output object format: + { + path: '/path/to/file/foo.txt', + hash: 'Qma4hjFTnCasJ8PVp3mZbZK5g2vGDT4LByLJ7m8ciyRFZP', + size: 20 + } +*/ + + +var FileResultStreamConverter = +/*#__PURE__*/ +function (_TransformStream) { + _inherits(FileResultStreamConverter, _TransformStream); + + function FileResultStreamConverter(options) { + _classCallCheck(this, FileResultStreamConverter); + + var opts = Object.assign({}, options || {}, { + objectMode: true + }); + return _possibleConstructorReturn(this, _getPrototypeOf(FileResultStreamConverter).call(this, opts)); + } + + _createClass(FileResultStreamConverter, [{ + key: "_transform", + value: function _transform(obj, enc, callback) { + if (!obj.Hash) { + return callback(); + } + + callback(null, { + path: obj.Name, + hash: obj.Hash, + size: parseInt(obj.Size, 10) + }); + } + }]); + + return FileResultStreamConverter; +}(TransformStream); + +module.exports = FileResultStreamConverter; + +/***/ }), +/* 34 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var SendOneFileMultipleResults = __webpack_require__(87); + +module.exports = function (send, path) { + var sendFile = SendOneFileMultipleResults(send, path); + return function (file, options, callback) { + sendFile(file, options, function (err, results) { + if (err) { + return callback(err); + } + + callback(null, results[0]); + }); + }; +}; + +/***/ }), +/* 35 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var CID = __webpack_require__(4); + +var assert = __webpack_require__(56); + +var withIs = __webpack_require__(27); + +var visibility = __webpack_require__(183); // Link represents an IPFS Merkle DAG Link between Nodes. + + +var DAGLink = +/*#__PURE__*/ +function () { + function DAGLink(name, size, cid) { + _classCallCheck(this, DAGLink); + + assert(cid, 'A link requires a cid to point to'); // assert(size, 'A link requires a size') + // note - links should include size, but this assert is disabled + // for now to maintain consistency with go-ipfs pinset + + this._name = name || ''; + this._nameBuf = null; + this._size = size; + this._cid = new CID(cid); // Make sure we have a nice public API that can be used by an IPLD resolver + + visibility.hidePrivateFields(this); + visibility.addEnumerableGetters(this, ['Hash', 'Name', 'Tsize']); + } + + _createClass(DAGLink, [{ + key: "toString", + value: function toString() { + return "DAGLink <".concat(this._cid.toBaseEncodedString(), " - name: \"").concat(this.Name, "\", size: ").concat(this.Tsize, ">"); + } + }, { + key: "toJSON", + value: function toJSON() { + if (!this._json) { + this._json = Object.freeze({ + name: this.Name, + size: this.Tsize, + cid: this.Hash.toBaseEncodedString() + }); + } + + return Object.assign({}, this._json); + } + }, { + key: "Name", + get: function get() { + return this._name; + } // Memoize the Buffer representation of name + // We need this to sort the links, otherwise + // we will reallocate new buffers every time + , + set: function set(name) { + throw new Error("Can't set property: 'name' is immutable"); + } + }, { + key: "nameAsBuffer", + get: function get() { + if (this._nameBuf !== null) { + return this._nameBuf; + } + + this._nameBuf = Buffer.from(this._name); + return this._nameBuf; + } + }, { + key: "Tsize", + get: function get() { + return this._size; + }, + set: function set(size) { + throw new Error("Can't set property: 'size' is immutable"); + } + }, { + key: "Hash", + get: function get() { + return this._cid; + }, + set: function set(cid) { + throw new Error("Can't set property: 'cid' is immutable"); + } + }]); + + return DAGLink; +}(); + +exports = module.exports = withIs(DAGLink, { + className: 'DAGLink', + symbolName: '@ipld/js-ipld-dag-pb/daglink' +}); +exports.util = __webpack_require__(446); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 36 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global) { + +var scope = typeof global !== "undefined" && global || typeof self !== "undefined" && self || window; +var apply = Function.prototype.apply; // DOM APIs, for completeness + +exports.setTimeout = function () { + return new Timeout(apply.call(setTimeout, scope, arguments), clearTimeout); +}; + +exports.setInterval = function () { + return new Timeout(apply.call(setInterval, scope, arguments), clearInterval); +}; + +exports.clearTimeout = exports.clearInterval = function (timeout) { + if (timeout) { + timeout.close(); + } +}; + +function Timeout(id, clearFn) { + this._id = id; + this._clearFn = clearFn; +} + +Timeout.prototype.unref = Timeout.prototype.ref = function () {}; + +Timeout.prototype.close = function () { + this._clearFn.call(scope, this._id); +}; // Does not start the time, just sets up the members needed. + + +exports.enroll = function (item, msecs) { + clearTimeout(item._idleTimeoutId); + item._idleTimeout = msecs; +}; + +exports.unenroll = function (item) { + clearTimeout(item._idleTimeoutId); + item._idleTimeout = -1; +}; + +exports._unrefActive = exports.active = function (item) { + clearTimeout(item._idleTimeoutId); + var msecs = item._idleTimeout; + + if (msecs >= 0) { + item._idleTimeoutId = setTimeout(function onTimeout() { + if (item._onTimeout) item._onTimeout(); + }, msecs); + } +}; // setimmediate attaches itself to the global object + + +__webpack_require__(227); // On some exotic environments, it's not clear which object `setimmediate` was +// able to install onto. Search each possibility in the same order as the +// `setimmediate` library. + + +exports.setImmediate = typeof self !== "undefined" && self.setImmediate || typeof global !== "undefined" && global.setImmediate || void 0 && (void 0).setImmediate; +exports.clearImmediate = typeof self !== "undefined" && self.clearImmediate || typeof global !== "undefined" && global.clearImmediate || void 0 && (void 0).clearImmediate; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10))) + +/***/ }), +/* 37 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = function (module) { + if (!module.webpackPolyfill) { + module.deprecate = function () {}; + + module.paths = []; // module.parent = undefined by default + + if (!module.children) module.children = []; + Object.defineProperty(module, "loaded", { + enumerable: true, + get: function get() { + return module.l; + } + }); + Object.defineProperty(module, "id", { + enumerable: true, + get: function get() { + return module.i; + } + }); + module.webpackPolyfill = 1; + } + + return module; +}; + +/***/ }), +/* 38 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var base = exports; +base.Reporter = __webpack_require__(256).Reporter; +base.DecoderBuffer = __webpack_require__(121).DecoderBuffer; +base.EncoderBuffer = __webpack_require__(121).EncoderBuffer; +base.Node = __webpack_require__(257); + +/***/ }), +/* 39 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// NOTE: These type checking functions intentionally don't use `instanceof` +// because it is fragile and can be easily faked with `Object.create()`. +function isArray(arg) { + if (Array.isArray) { + return Array.isArray(arg); + } + + return objectToString(arg) === '[object Array]'; +} + +exports.isArray = isArray; + +function isBoolean(arg) { + return typeof arg === 'boolean'; +} + +exports.isBoolean = isBoolean; + +function isNull(arg) { + return arg === null; +} + +exports.isNull = isNull; + +function isNullOrUndefined(arg) { + return arg == null; +} + +exports.isNullOrUndefined = isNullOrUndefined; + +function isNumber(arg) { + return typeof arg === 'number'; +} + +exports.isNumber = isNumber; + +function isString(arg) { + return typeof arg === 'string'; +} + +exports.isString = isString; + +function isSymbol(arg) { + return _typeof(arg) === 'symbol'; +} + +exports.isSymbol = isSymbol; + +function isUndefined(arg) { + return arg === void 0; +} + +exports.isUndefined = isUndefined; + +function isRegExp(re) { + return objectToString(re) === '[object RegExp]'; +} + +exports.isRegExp = isRegExp; + +function isObject(arg) { + return _typeof(arg) === 'object' && arg !== null; +} + +exports.isObject = isObject; + +function isDate(d) { + return objectToString(d) === '[object Date]'; +} + +exports.isDate = isDate; + +function isError(e) { + return objectToString(e) === '[object Error]' || e instanceof Error; +} + +exports.isError = isError; + +function isFunction(arg) { + return typeof arg === 'function'; +} + +exports.isFunction = isFunction; + +function isPrimitive(arg) { + return arg === null || typeof arg === 'boolean' || typeof arg === 'number' || typeof arg === 'string' || _typeof(arg) === 'symbol' || // ES6 symbol + typeof arg === 'undefined'; +} + +exports.isPrimitive = isPrimitive; +exports.isBuffer = Buffer.isBuffer; + +function objectToString(o) { + return Object.prototype.toString.call(o); +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 40 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var PeerId = __webpack_require__(23); + +var _require = __webpack_require__(148), + ensureMultiaddr = _require.ensureMultiaddr; + +var MultiaddrSet = __webpack_require__(310); + +var assert = __webpack_require__(56); // Peer represents a peer on the IPFS network + + +var PeerInfo = +/*#__PURE__*/ +function () { + function PeerInfo(peerId) { + _classCallCheck(this, PeerInfo); + + assert(peerId, 'Missing peerId. Use Peer.create(cb) to create one'); + this.id = peerId; + this.multiaddrs = new MultiaddrSet(); + this.protocols = new Set(); + this._connectedMultiaddr = undefined; + } // only stores the current multiaddr being used + + + _createClass(PeerInfo, [{ + key: "connect", + value: function connect(ma) { + ma = ensureMultiaddr(ma); + + if (!this.multiaddrs.has(ma) && ma.toString() !== "/ipfs/".concat(this.id.toB58String())) { + throw new Error('can\'t be connected to missing multiaddr from set'); + } + + this._connectedMultiaddr = ma; + } + }, { + key: "disconnect", + value: function disconnect() { + this._connectedMultiaddr = undefined; + } + }, { + key: "isConnected", + value: function isConnected() { + return this._connectedMultiaddr; + } + }]); + + return PeerInfo; +}(); + +PeerInfo.create = function (peerId, callback) { + if (typeof peerId === 'function') { + callback = peerId; + peerId = null; + PeerId.create(function (err, id) { + if (err) { + return callback(err); + } + + callback(null, new PeerInfo(id)); + }); + return; + } // Already a PeerId instance + + + if (typeof peerId.toJSON === 'function') { + callback(null, new PeerInfo(peerId)); + } else { + PeerId.createFromJSON(peerId, function (err, id) { + return callback(err, new PeerInfo(id)); + }); + } +}; + +PeerInfo.isPeerInfo = function (peerInfo) { + return Boolean(_typeof(peerInfo) === 'object' && peerInfo.id && peerInfo.multiaddrs); +}; + +module.exports = PeerInfo; + +/***/ }), +/* 41 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var Writable = __webpack_require__(5).Writable; + +var inherits = __webpack_require__(2); + +var U8 = Uint8Array; + +function ConcatStream(opts, cb) { + if (!(this instanceof ConcatStream)) return new ConcatStream(opts, cb); + + if (typeof opts === 'function') { + cb = opts; + opts = {}; + } + + if (!opts) opts = {}; + var encoding = opts.encoding; + var shouldInferEncoding = false; + + if (!encoding) { + shouldInferEncoding = true; + } else { + encoding = String(encoding).toLowerCase(); + + if (encoding === 'u8' || encoding === 'uint8') { + encoding = 'uint8array'; + } + } + + Writable.call(this, { + objectMode: true + }); + this.encoding = encoding; + this.shouldInferEncoding = shouldInferEncoding; + if (cb) this.on('finish', function () { + cb(this.getBody()); + }); + this.body = []; +} + +module.exports = ConcatStream; +inherits(ConcatStream, Writable); + +ConcatStream.prototype._write = function (chunk, enc, next) { + this.body.push(chunk); + next(); +}; + +ConcatStream.prototype.inferEncoding = function (buff) { + var firstBuffer = buff === undefined ? this.body[0] : buff; + if (Buffer.isBuffer(firstBuffer)) return 'buffer'; + if (typeof Uint8Array !== 'undefined' && firstBuffer instanceof Uint8Array) return 'uint8array'; + if (Array.isArray(firstBuffer)) return 'array'; + if (typeof firstBuffer === 'string') return 'string'; + if (Object.prototype.toString.call(firstBuffer) === "[object Object]") return 'object'; + return 'buffer'; +}; + +ConcatStream.prototype.getBody = function () { + if (!this.encoding && this.body.length === 0) return []; + if (this.shouldInferEncoding) this.encoding = this.inferEncoding(); + if (this.encoding === 'array') return arrayConcat(this.body); + if (this.encoding === 'string') return stringConcat(this.body); + if (this.encoding === 'buffer') return bufferConcat(this.body); + if (this.encoding === 'uint8array') return u8Concat(this.body); + return this.body; +}; + +function isArrayish(arr) { + return /Array\]$/.test(Object.prototype.toString.call(arr)); +} + +function isBufferish(p) { + return typeof p === 'string' || isArrayish(p) || p && typeof p.subarray === 'function'; +} + +function stringConcat(parts) { + var strings = []; + + for (var i = 0; i < parts.length; i++) { + var p = parts[i]; + + if (typeof p === 'string') { + strings.push(p); + } else if (Buffer.isBuffer(p)) { + strings.push(p); + } else if (isBufferish(p)) { + strings.push(Buffer.from(p)); + } else { + strings.push(Buffer.from(String(p))); + } + } + + if (Buffer.isBuffer(parts[0])) { + strings = Buffer.concat(strings); + strings = strings.toString('utf8'); + } else { + strings = strings.join(''); + } + + return strings; +} + +function bufferConcat(parts) { + var bufs = []; + + for (var i = 0; i < parts.length; i++) { + var p = parts[i]; + + if (Buffer.isBuffer(p)) { + bufs.push(p); + } else if (isBufferish(p)) { + bufs.push(Buffer.from(p)); + } else { + bufs.push(Buffer.from(String(p))); + } + } + + return Buffer.concat(bufs); +} + +function arrayConcat(parts) { + var res = []; + + for (var i = 0; i < parts.length; i++) { + res.push.apply(res, parts[i]); + } + + return res; +} + +function u8Concat(parts) { + var len = 0; + + for (var i = 0; i < parts.length; i++) { + if (typeof parts[i] === 'string') { + parts[i] = Buffer.from(parts[i]); + } + + len += parts[i].length; + } + + var u8 = new U8(len); + + for (var i = 0, offset = 0; i < parts.length; i++) { + var part = parts[i]; + + for (var j = 0; j < part.length; j++) { + u8[offset++] = part[j]; + } + } + + return u8; +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 42 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _inheritsLoose(subClass, superClass) { + subClass.prototype = Object.create(superClass.prototype); + subClass.prototype.constructor = subClass; + subClass.__proto__ = superClass; +} + +var codes = {}; + +function createErrorType(code, message, Base) { + if (!Base) { + Base = Error; + } + + function getMessage(arg1, arg2, arg3) { + if (typeof message === 'string') { + return message; + } else { + return message(arg1, arg2, arg3); + } + } + + var NodeError = + /*#__PURE__*/ + function (_Base) { + _inheritsLoose(NodeError, _Base); + + function NodeError(arg1, arg2, arg3) { + return _Base.call(this, getMessage(arg1, arg2, arg3)) || this; + } + + return NodeError; + }(Base); + + NodeError.prototype.name = Base.name; + NodeError.prototype.code = code; + codes[code] = NodeError; +} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js + + +function oneOf(expected, thing) { + if (Array.isArray(expected)) { + var len = expected.length; + expected = expected.map(function (i) { + return String(i); + }); + + if (len > 2) { + return "one of ".concat(thing, " ").concat(expected.slice(0, len - 1).join(', '), ", or ") + expected[len - 1]; + } else if (len === 2) { + return "one of ".concat(thing, " ").concat(expected[0], " or ").concat(expected[1]); + } else { + return "of ".concat(thing, " ").concat(expected[0]); + } + } else { + return "of ".concat(thing, " ").concat(String(expected)); + } +} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith + + +function startsWith(str, search, pos) { + return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search; +} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith + + +function endsWith(str, search, this_len) { + if (this_len === undefined || this_len > str.length) { + this_len = str.length; + } + + return str.substring(this_len - search.length, this_len) === search; +} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes + + +function includes(str, search, start) { + if (typeof start !== 'number') { + start = 0; + } + + if (start + search.length > str.length) { + return false; + } else { + return str.indexOf(search, start) !== -1; + } +} + +createErrorType('ERR_INVALID_OPT_VALUE', function (name, value) { + return 'The value "' + value + '" is invalid for option "' + name + '"'; +}, TypeError); +createErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) { + // determiner: 'must be' or 'must not be' + var determiner; + + if (typeof expected === 'string' && startsWith(expected, 'not ')) { + determiner = 'must not be'; + expected = expected.replace(/^not /, ''); + } else { + determiner = 'must be'; + } + + var msg; + + if (endsWith(name, ' argument')) { + // For cases like 'first argument' + msg = "The ".concat(name, " ").concat(determiner, " ").concat(oneOf(expected, 'type')); + } else { + var type = includes(name, '.') ? 'property' : 'argument'; + msg = "The \"".concat(name, "\" ").concat(type, " ").concat(determiner, " ").concat(oneOf(expected, 'type')); + } + + msg += ". Received type ".concat(_typeof(actual)); + return msg; +}, TypeError); +createErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF'); +createErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) { + return 'The ' + name + ' method is not implemented'; +}); +createErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close'); +createErrorType('ERR_STREAM_DESTROYED', function (name) { + return 'Cannot call ' + name + ' after a stream was destroyed'; +}); +createErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times'); +createErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable'); +createErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end'); +createErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError); +createErrorType('ERR_UNKNOWN_ENCODING', function (arg) { + return 'Unknown encoding: ' + arg; +}, TypeError); +createErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event'); +module.exports.codes = codes; + +/***/ }), +/* 43 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var _require = __webpack_require__(5), + Duplex = _require.Duplex; + +var eachSeries = __webpack_require__(321); + +var isStream = __webpack_require__(58); + +var once = __webpack_require__(17); + +var prepareFile = __webpack_require__(348); + +var Multipart = __webpack_require__(355); + +function headers(file) { + var name = file.path ? encodeURIComponent(file.path) : ''; + var header = { + 'Content-Disposition': "file; filename=\"".concat(name, "\"") + }; + + if (!file.content) { + header['Content-Type'] = 'application/x-directory'; + } else if (file.symlink) { + header['Content-Type'] = 'application/symlink'; + } else { + header['Content-Type'] = 'application/octet-stream'; + } + + return header; +} + +module.exports = function (send, path) { + return function (options) { + var request; + var ended = false; + var writing = false; + options = options ? Object.assign({}, options, options.qs) : {}; + var multipart = new Multipart(); + var retStream = new Duplex({ + objectMode: true + }); + + retStream._read = function (n) {}; + + retStream._write = function (file, enc, _next) { + var next = once(_next); + + try { + var files = prepareFile(file, options).map(function (file) { + return Object.assign({ + headers: headers(file) + }, file); + }); + writing = true; + eachSeries(files, function (file, cb) { + return multipart.write(file, enc, cb); + }, function (err) { + writing = false; + + if (err) { + return next(err); + } + + if (ended) { + multipart.end(); + } + + next(); + }); + } catch (err) { + next(err); + } + }; + + retStream.once('finish', function () { + if (!ended) { + ended = true; + + if (!writing) { + multipart.end(); + } + } + }); + var qs = options.qs || {}; + qs['cid-version'] = propOrProp(options, 'cid-version', 'cidVersion'); + qs['raw-leaves'] = propOrProp(options, 'raw-leaves', 'rawLeaves'); + qs['only-hash'] = propOrProp(options, 'only-hash', 'onlyHash'); + qs['wrap-with-directory'] = propOrProp(options, 'wrap-with-directory', 'wrapWithDirectory'); + qs.hash = propOrProp(options, 'hash', 'hashAlg'); + + if (options.strategy === 'trickle' || options.trickle) { + qs['trickle'] = 'true'; + } + + var args = { + path: path, + qs: qs, + args: options.args, + multipart: true, + multipartBoundary: multipart._boundary, + stream: true, + recursive: true, + progress: options.progress + }; + multipart.on('error', function (err) { + retStream.emit('error', err); + }); + request = send(args, function (err, response) { + if (err) { + return retStream.emit('error', err); + } + + if (!response) { + // no response, which means everything is ok, so we end the retStream + return retStream.push(null); // early + } + + if (!isStream(response)) { + retStream.push(response); + retStream.push(null); + return; + } + + response.on('error', function (err) { + return retStream.emit('error', err); + }); + + if (options.converter) { + response.on('data', function (d) { + if (d.Bytes && options.progress) { + options.progress(d.Bytes); + } + }); + var Converter = options.converter; + var convertedResponse = new Converter(); + convertedResponse.once('end', function () { + return retStream.push(null); + }); + convertedResponse.on('data', function (d) { + return retStream.push(d); + }); + response.pipe(convertedResponse); + } else { + response.on('data', function (d) { + if (d.Bytes && options.progress) { + options.progress(d.Bytes); + } + + retStream.push(d); + }); + response.once('end', function () { + return retStream.push(null); + }); + } + }); // signal the multipart that the underlying stream has drained and that + // it can continue producing data.. + + request.on('drain', function () { + return multipart.emit('drain'); + }); + multipart.pipe(request); + return retStream; + }; +}; + +function propOrProp(source, prop1, prop2) { + if (prop1 in source) { + return source[prop1]; + } else if (prop2 in source) { + return source[prop2]; + } +} + +/***/ }), +/* 44 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = false; + +/***/ }), +/* 45 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +module.exports = function prop(key) { + return key && ('string' == typeof key ? function (data) { + return data[key]; + } : 'object' === _typeof(key) && 'function' === typeof key.exec //regexp + ? function (data) { + var v = key.exec(data); + return v && v[0]; + } : key); +}; + +/***/ }), +/* 46 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var streamToValue = __webpack_require__(26); + +function streamToValueWithTransformer(response, transformer, callback) { + if (typeof response.pipe === 'function') { + streamToValue(response, function (err, res) { + if (err) { + return callback(err); + } + + transformer(res, callback); + }); + } else { + transformer(response, callback); + } +} + +module.exports = streamToValueWithTransformer; + +/***/ }), +/* 47 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = function drain(op, done) { + var read, abort; + + function sink(_read) { + read = _read; + if (abort) return sink.abort() //this function is much simpler to write if you + //just use recursion, but by using a while loop + //we do not blow the stack if the stream happens to be sync. + ; + + (function next() { + var loop = true, + cbed = false; + + while (loop) { + cbed = false; + read(null, function (end, data) { + cbed = true; + + if (end = end || abort) { + loop = false; + if (done) done(end === true ? null : end);else if (end && end !== true) throw end; + } else if (op && false === op(data) || abort) { + loop = false; + read(abort || true, done || function () {}); + } else if (!loop) { + next(); + } + }); + + if (!cbed) { + loop = false; + return; + } + } + })(); + } + + sink.abort = function (err, cb) { + if ('function' == typeof err) cb = err, err = true; + abort = err || true; + if (read) return read(abort, cb || function () {}); + }; + + return sink; +}; + +/***/ }), +/* 48 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.DAGNode = __webpack_require__(62); +exports.DAGLink = __webpack_require__(35); +/* + * Functions to fulfil IPLD Format interface + * https://github.com/ipld/interface-ipld-format + */ + +exports.resolver = __webpack_require__(456); +exports.util = __webpack_require__(64); +exports.codec = exports.util.codec; +exports.defaultHashAlg = exports.util.defaultHashAlg; + +/***/ }), +/* 49 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) {/** + * Implementation of the [multibase](https://github.com/multiformats/multibase) specification. + * @module Multibase + */ + + +var constants = __webpack_require__(199); + +exports = module.exports = multibase; +exports.encode = encode; +exports.decode = decode; +exports.isEncoded = isEncoded; +exports.names = Object.freeze(Object.keys(constants.names)); +exports.codes = Object.freeze(Object.keys(constants.codes)); +var errNotSupported = new Error('Unsupported encoding'); +/** + * Create a new buffer with the multibase varint+code. + * + * @param {string|number} nameOrCode - The multibase name or code number. + * @param {Buffer} buf - The data to be prefixed with multibase. + * @memberof Multibase + * @returns {Buffer} + */ + +function multibase(nameOrCode, buf) { + if (!buf) { + throw new Error('requires an encoded buffer'); + } + + var base = getBase(nameOrCode); + var codeBuf = Buffer.from(base.code); + var name = base.name; + validEncode(name, buf); + return Buffer.concat([codeBuf, buf]); +} +/** + * Encode data with the specified base and add the multibase prefix. + * + * @param {string|number} nameOrCode - The multibase name or code number. + * @param {Buffer} buf - The data to be encoded. + * @returns {Buffer} + * @memberof Multibase + */ + + +function encode(nameOrCode, buf) { + var base = getBase(nameOrCode); + var name = base.name; + return multibase(name, Buffer.from(base.encode(buf))); +} +/** + * Takes a buffer or string encoded with multibase header, decodes it and + * returns the decoded buffer + * + * @param {Buffer|string} bufOrString + * @returns {Buffer} + * @memberof Multibase + * + */ + + +function decode(bufOrString) { + if (Buffer.isBuffer(bufOrString)) { + bufOrString = bufOrString.toString(); + } + + var code = bufOrString.substring(0, 1); + bufOrString = bufOrString.substring(1, bufOrString.length); + + if (typeof bufOrString === 'string') { + bufOrString = Buffer.from(bufOrString); + } + + var base = getBase(code); + return Buffer.from(base.decode(bufOrString.toString())); +} +/** + * Is the given data multibase encoded? + * + * @param {Buffer|string} bufOrString + * @returns {boolean} + * @memberof Multibase + */ + + +function isEncoded(bufOrString) { + if (Buffer.isBuffer(bufOrString)) { + bufOrString = bufOrString.toString(); + } // Ensure bufOrString is a string + + + if (Object.prototype.toString.call(bufOrString) !== '[object String]') { + return false; + } + + var code = bufOrString.substring(0, 1); + + try { + var base = getBase(code); + return base.name; + } catch (err) { + return false; + } +} +/** + * @param {string} name + * @param {Buffer} buf + * @private + * @returns {undefined} + */ + + +function validEncode(name, buf) { + var base = getBase(name); + base.decode(buf.toString()); +} + +function getBase(nameOrCode) { + var base; + + if (constants.names[nameOrCode]) { + base = constants.names[nameOrCode]; + } else if (constants.codes[nameOrCode]) { + base = constants.codes[nameOrCode]; + } else { + throw errNotSupported; + } + + if (!base.isImplemented()) { + throw new Error('Base ' + nameOrCode + ' is not implemented yet'); + } + + return base; +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 50 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) {/** + * Implementation of the multicodec specification. + * + * @module multicodec + * @example + * const multicodec = require('multicodec') + * + * const prefixedProtobuf = multicodec.addPrefix('protobuf', protobufBuffer) + * // prefixedProtobuf 0x50... + * + */ + + +var varint = __webpack_require__(12); + +var codecNameToCodeVarint = __webpack_require__(211); + +var codeToCodecName = __webpack_require__(212); + +var util = __webpack_require__(105); + +exports = module.exports; +/** + * Prefix a buffer with a multicodec-packed. + * + * @param {string|number} multicodecStrOrCode + * @param {Buffer} data + * @returns {Buffer} + */ + +exports.addPrefix = function (multicodecStrOrCode, data) { + var prefix; + + if (Buffer.isBuffer(multicodecStrOrCode)) { + prefix = util.varintBufferEncode(multicodecStrOrCode); + } else { + if (codecNameToCodeVarint[multicodecStrOrCode]) { + prefix = codecNameToCodeVarint[multicodecStrOrCode]; + } else { + throw new Error('multicodec not recognized'); + } + } + + return Buffer.concat([prefix, data]); +}; +/** + * Decapsulate the multicodec-packed prefix from the data. + * + * @param {Buffer} data + * @returns {Buffer} + */ + + +exports.rmPrefix = function (data) { + varint.decode(data); + return data.slice(varint.decode.bytes); +}; +/** + * Get the codec of the prefixed data. + * @param {Buffer} prefixedData + * @returns {string} + */ + + +exports.getCodec = function (prefixedData) { + var code = util.varintBufferDecode(prefixedData); + var codecName = codeToCodecName[code.toString('hex')]; + + if (codecName === undefined) { + throw new Error('Code `0x' + code.toString('hex') + '` not found'); + } + + return codecName; +}; +/** + * Get the code of the prefixed data. + * @param {Buffer} prefixedData + * @returns {number} + */ + + +exports.getCode = function (prefixedData) { + return varint.decode(prefixedData); +}; +/** + * Get the code as varint of a codec name. + * @param {string} codecName + * @returns {Buffer} + */ + + +exports.getCodeVarint = function (codecName) { + var code = codecNameToCodeVarint[codecName]; + + if (code === undefined) { + throw new Error('Codec `' + codecName + '` not found'); + } + + return code; +}; +/** + * Get the varint of a code. + * @param {Number} code + * @returns {Array.} + */ + + +exports.getVarint = function (code) { + return varint.encode(code); +}; // Make the constants top-level constants + + +var constants = __webpack_require__(213); + +Object.assign(exports, constants); // Human friendly names for printing, e.g. in error messages + +exports.print = __webpack_require__(214); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 51 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var schema = __webpack_require__(217); + +var compile = __webpack_require__(221); + +var flatten = function flatten(values) { + if (!values) return null; + var result = {}; + Object.keys(values).forEach(function (k) { + result[k] = values[k].value; + }); + return result; +}; + +module.exports = function (proto, opts) { + if (!opts) opts = {}; + if (!proto) throw new Error('Pass in a .proto string or a protobuf-schema parsed object'); + var sch = _typeof(proto) === 'object' && !Buffer.isBuffer(proto) ? proto : schema.parse(proto); // to not make toString,toJSON enumarable we make a fire-and-forget prototype + + var Messages = function Messages() { + var self = this; + compile(sch, opts.encodings || {}).forEach(function (m) { + self[m.name] = flatten(m.values) || m; + }); + }; + + Messages.prototype.toString = function () { + return schema.stringify(sch); + }; + + Messages.prototype.toJSON = function () { + return sch; + }; + + return new Messages(); +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 52 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * An API for getting cryptographically-secure random bytes. The bytes are + * generated using the Fortuna algorithm devised by Bruce Schneier and + * Niels Ferguson. + * + * Getting strong random bytes is not yet easy to do in javascript. The only + * truish random entropy that can be collected is from the mouse, keyboard, or + * from timing with respect to page loads, etc. This generator makes a poor + * attempt at providing random bytes when those sources haven't yet provided + * enough entropy to initially seed or to reseed the PRNG. + * + * @author Dave Longley + * + * Copyright (c) 2009-2014 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +__webpack_require__(108); + +__webpack_require__(230); + +__webpack_require__(231); + +__webpack_require__(9); + +(function () { + // forge.random already defined + if (forge.random && forge.random.getBytes) { + module.exports = forge.random; + return; + } + + (function (jQuery) { + // the default prng plugin, uses AES-128 + var prng_aes = {}; + + var _prng_aes_output = new Array(4); + + var _prng_aes_buffer = forge.util.createBuffer(); + + prng_aes.formatKey = function (key) { + // convert the key into 32-bit integers + var tmp = forge.util.createBuffer(key); + key = new Array(4); + key[0] = tmp.getInt32(); + key[1] = tmp.getInt32(); + key[2] = tmp.getInt32(); + key[3] = tmp.getInt32(); // return the expanded key + + return forge.aes._expandKey(key, false); + }; + + prng_aes.formatSeed = function (seed) { + // convert seed into 32-bit integers + var tmp = forge.util.createBuffer(seed); + seed = new Array(4); + seed[0] = tmp.getInt32(); + seed[1] = tmp.getInt32(); + seed[2] = tmp.getInt32(); + seed[3] = tmp.getInt32(); + return seed; + }; + + prng_aes.cipher = function (key, seed) { + forge.aes._updateBlock(key, seed, _prng_aes_output, false); + + _prng_aes_buffer.putInt32(_prng_aes_output[0]); + + _prng_aes_buffer.putInt32(_prng_aes_output[1]); + + _prng_aes_buffer.putInt32(_prng_aes_output[2]); + + _prng_aes_buffer.putInt32(_prng_aes_output[3]); + + return _prng_aes_buffer.getBytes(); + }; + + prng_aes.increment = function (seed) { + // FIXME: do we care about carry or signed issues? + ++seed[3]; + return seed; + }; + + prng_aes.md = forge.md.sha256; + /** + * Creates a new PRNG. + */ + + function spawnPrng() { + var ctx = forge.prng.create(prng_aes); + /** + * Gets random bytes. If a native secure crypto API is unavailable, this + * method tries to make the bytes more unpredictable by drawing from data that + * can be collected from the user of the browser, eg: mouse movement. + * + * If a callback is given, this method will be called asynchronously. + * + * @param count the number of random bytes to get. + * @param [callback(err, bytes)] called once the operation completes. + * + * @return the random bytes in a string. + */ + + ctx.getBytes = function (count, callback) { + return ctx.generate(count, callback); + }; + /** + * Gets random bytes asynchronously. If a native secure crypto API is + * unavailable, this method tries to make the bytes more unpredictable by + * drawing from data that can be collected from the user of the browser, + * eg: mouse movement. + * + * @param count the number of random bytes to get. + * + * @return the random bytes in a string. + */ + + + ctx.getBytesSync = function (count) { + return ctx.generate(count); + }; + + return ctx; + } // create default prng context + + + var _ctx = spawnPrng(); // add other sources of entropy only if window.crypto.getRandomValues is not + // available -- otherwise this source will be automatically used by the prng + + + var getRandomValues = null; + + if (typeof window !== 'undefined') { + var _crypto = window.crypto || window.msCrypto; + + if (_crypto && _crypto.getRandomValues) { + getRandomValues = function getRandomValues(arr) { + return _crypto.getRandomValues(arr); + }; + } + } + + if (forge.options.usePureJavaScript || !forge.util.isNodejs && !getRandomValues) { + // if this is a web worker, do not use weak entropy, instead register to + // receive strong entropy asynchronously from the main thread + if (typeof window === 'undefined' || window.document === undefined) {} // FIXME: + // get load time entropy + + + _ctx.collectInt(+new Date(), 32); // add some entropy from navigator object + + + if (typeof navigator !== 'undefined') { + var _navBytes = ''; + + for (var key in navigator) { + try { + if (typeof navigator[key] == 'string') { + _navBytes += navigator[key]; + } + } catch (e) { + /* Some navigator keys might not be accessible, e.g. the geolocation + attribute throws an exception if touched in Mozilla chrome:// + context. + Silently ignore this and just don't use this as a source of + entropy. */ + } + } + + _ctx.collect(_navBytes); + + _navBytes = null; + } // add mouse and keyboard collectors if jquery is available + + + if (jQuery) { + // set up mouse entropy capture + jQuery().mousemove(function (e) { + // add mouse coords + _ctx.collectInt(e.clientX, 16); + + _ctx.collectInt(e.clientY, 16); + }); // set up keyboard entropy capture + + jQuery().keypress(function (e) { + _ctx.collectInt(e.charCode, 8); + }); + } + } + /* Random API */ + + + if (!forge.random) { + forge.random = _ctx; + } else { + // extend forge.random with _ctx + for (var key in _ctx) { + forge.random[key] = _ctx[key]; + } + } // expose spawn PRNG + + + forge.random.createInstance = spawnPrng; + module.exports = forge.random; + })(typeof jQuery !== 'undefined' ? jQuery : null); +})(); + +/***/ }), +/* 53 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports["default"] = slice; + +function slice(arrayLike, start) { + start = start | 0; + var newLen = Math.max(arrayLike.length - start, 0); + var newArr = Array(newLen); + + for (var idx = 0; idx < newLen; idx++) { + newArr[idx] = arrayLike[start + idx]; + } + + return newArr; +} + +module.exports = exports["default"]; + +/***/ }), +/* 54 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) { + +if (!process.version || process.version.indexOf('v0.') === 0 || process.version.indexOf('v1.') === 0 && process.version.indexOf('v1.8.') !== 0) { + module.exports = { + nextTick: nextTick + }; +} else { + module.exports = process; +} + +function nextTick(fn, arg1, arg2, arg3) { + if (typeof fn !== 'function') { + throw new TypeError('"callback" argument must be a function'); + } + + var len = arguments.length; + var args, i; + + switch (len) { + case 0: + case 1: + return process.nextTick(fn); + + case 2: + return process.nextTick(function afterTickOne() { + fn.call(null, arg1); + }); + + case 3: + return process.nextTick(function afterTickTwo() { + fn.call(null, arg1, arg2); + }); + + case 4: + return process.nextTick(function afterTickThree() { + fn.call(null, arg1, arg2, arg3); + }); + + default: + args = new Array(len - 1); + i = 0; + + while (i < args.length) { + args[i++] = arguments[i]; + } + + return process.nextTick(function afterTick() { + fn.apply(null, args); + }); + } +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 55 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Buffer = __webpack_require__(7).Buffer; + +var optimized = __webpack_require__(298); + +function BN() { + this.negative = 0; + this.words = null; + this.length = 0; +} + +BN.fromNumber = function (n) { + var bn = new BN(); + bn.words = [n & 0x03ffffff]; + bn.length = 1; + return bn; +}; + +BN.fromBuffer = function (b32) { + var bn = new BN(); + bn.words = new Array(10); + bn.words[0] = (b32[28] & 0x03) << 24 | b32[29] << 16 | b32[30] << 8 | b32[31]; + bn.words[1] = (b32[25] & 0x0F) << 22 | b32[26] << 14 | b32[27] << 6 | b32[28] >>> 2; + bn.words[2] = (b32[22] & 0x3F) << 20 | b32[23] << 12 | b32[24] << 4 | b32[25] >>> 4; + bn.words[3] = (b32[19] & 0xFF) << 18 | b32[20] << 10 | b32[21] << 2 | b32[22] >>> 6; + bn.words[4] = (b32[15] & 0x03) << 24 | b32[16] << 16 | b32[17] << 8 | b32[18]; + bn.words[5] = (b32[12] & 0x0F) << 22 | b32[13] << 14 | b32[14] << 6 | b32[15] >>> 2; + bn.words[6] = (b32[9] & 0x3F) << 20 | b32[10] << 12 | b32[11] << 4 | b32[12] >>> 4; + bn.words[7] = (b32[6] & 0xFF) << 18 | b32[7] << 10 | b32[8] << 2 | b32[9] >>> 6; + bn.words[8] = (b32[2] & 0x03) << 24 | b32[3] << 16 | b32[4] << 8 | b32[5]; + bn.words[9] = b32[0] << 14 | b32[1] << 6 | b32[2] >>> 2; + bn.length = 10; + return bn.strip(); +}; + +BN.prototype.toBuffer = function () { + var w = this.words; + + for (var i = this.length; i < 10; ++i) { + w[i] = 0; + } + + return Buffer.from([w[9] >>> 14 & 0xFF, w[9] >>> 6 & 0xFF, (w[9] & 0x3F) << 2 | w[8] >>> 24 & 0x03, // 0, 1, 2 + w[8] >>> 16 & 0xFF, w[8] >>> 8 & 0xFF, w[8] & 0xFF, // 3, 4, 5 + w[7] >>> 18 & 0xFF, w[7] >>> 10 & 0xFF, w[7] >>> 2 & 0xFF, // 6, 7, 8 + (w[7] & 0x03) << 6 | w[6] >>> 20 & 0x3F, w[6] >>> 12 & 0xFF, w[6] >>> 4 & 0xFF, // 9, 10, 11 + (w[6] & 0x0F) << 4 | w[5] >>> 22 & 0x0F, w[5] >>> 14 & 0xFF, w[5] >>> 6 & 0xFF, // 12, 13, 14 + (w[5] & 0x3F) << 2 | w[4] >>> 24 & 0x03, w[4] >>> 16 & 0xFF, w[4] >>> 8 & 0xFF, w[4] & 0xFF, // 15, 16, 17, 18 + w[3] >>> 18 & 0xFF, w[3] >>> 10 & 0xFF, w[3] >>> 2 & 0xFF, // 19, 20, 21 + (w[3] & 0x03) << 6 | w[2] >>> 20 & 0x3F, w[2] >>> 12 & 0xFF, w[2] >>> 4 & 0xFF, // 22, 23, 24 + (w[2] & 0x0F) << 4 | w[1] >>> 22 & 0x0F, w[1] >>> 14 & 0xFF, w[1] >>> 6 & 0xFF, // 25, 26, 27 + (w[1] & 0x3F) << 2 | w[0] >>> 24 & 0x03, w[0] >>> 16 & 0xFF, w[0] >>> 8 & 0xFF, w[0] & 0xFF // 28, 29, 30, 31 + ]); +}; + +BN.prototype.clone = function () { + var r = new BN(); + r.words = new Array(this.length); + + for (var i = 0; i < this.length; i++) { + r.words[i] = this.words[i]; + } + + r.length = this.length; + r.negative = this.negative; + return r; +}; + +BN.prototype.strip = function () { + while (this.length > 1 && (this.words[this.length - 1] | 0) === 0) { + this.length--; + } + + return this; +}; + +BN.prototype.normSign = function () { + // -0 = 0 + if (this.length === 1 && this.words[0] === 0) this.negative = 0; + return this; +}; + +BN.prototype.isEven = function () { + return (this.words[0] & 1) === 0; +}; + +BN.prototype.isOdd = function () { + return (this.words[0] & 1) === 1; +}; + +BN.prototype.isZero = function () { + return this.length === 1 && this.words[0] === 0; +}; + +BN.prototype.ucmp = function (num) { + if (this.length !== num.length) return this.length > num.length ? 1 : -1; + + for (var i = this.length - 1; i >= 0; --i) { + if (this.words[i] !== num.words[i]) return this.words[i] > num.words[i] ? 1 : -1; + } + + return 0; +}; + +BN.prototype.gtOne = function () { + return this.length > 1 || this.words[0] > 1; +}; + +BN.prototype.isOverflow = function () { + return this.ucmp(BN.n) >= 0; +}; + +BN.prototype.isHigh = function () { + return this.ucmp(BN.nh) === 1; +}; + +BN.prototype.bitLengthGT256 = function () { + return this.length > 10 || this.length === 10 && this.words[9] > 0x003fffff; +}; + +BN.prototype.iuaddn = function (num) { + this.words[0] += num; + + for (var i = 0; this.words[i] > 0x03ffffff && i < this.length; ++i) { + this.words[i] -= 0x04000000; + this.words[i + 1] += 1; + } + + if (i === this.length) { + this.words[i] = 1; + this.length += 1; + } + + return this; +}; + +BN.prototype.iadd = function (num) { + // (-this) + num -> -(this - num) + // this + (-num) -> this - num + if (this.negative !== num.negative) { + if (this.negative !== 0) { + this.negative = 0; + this.isub(num); + this.negative ^= 1; + } else { + num.negative = 0; + this.isub(num); + num.negative = 1; + } + + return this.normSign(); + } // a.length > b.length + + + var a; + var b; + + if (this.length > num.length) { + a = this; + b = num; + } else { + a = num; + b = this; + } + + for (var i = 0, carry = 0; i < b.length; ++i) { + var word = a.words[i] + b.words[i] + carry; + this.words[i] = word & 0x03ffffff; + carry = word >>> 26; + } + + for (; carry !== 0 && i < a.length; ++i) { + word = a.words[i] + carry; + this.words[i] = word & 0x03ffffff; + carry = word >>> 26; + } + + this.length = a.length; + + if (carry !== 0) { + this.words[this.length++] = carry; + } else if (a !== this) { + for (; i < a.length; ++i) { + this.words[i] = a.words[i]; + } + } + + return this; +}; + +BN.prototype.add = function (num) { + return this.clone().iadd(num); +}; + +BN.prototype.isub = function (num) { + // (-this) - num -> -(this + num) + // this - (-num) -> this + num + if (this.negative !== num.negative) { + if (this.negative !== 0) { + this.negative = 0; + this.iadd(num); + this.negative = 1; + } else { + num.negative = 0; + this.iadd(num); + num.negative = 1; + } + + return this.normSign(); + } + + var cmp = this.ucmp(num); + + if (cmp === 0) { + this.negative = 0; + this.words[0] = 0; + this.length = 1; + return this; + } // a > b + + + var a; + var b; + + if (cmp > 0) { + a = this; + b = num; + } else { + a = num; + b = this; + } + + for (var i = 0, carry = 0; i < b.length; ++i) { + var word = a.words[i] - b.words[i] + carry; + carry = word >> 26; + this.words[i] = word & 0x03ffffff; + } + + for (; carry !== 0 && i < a.length; ++i) { + word = a.words[i] + carry; + carry = word >> 26; + this.words[i] = word & 0x03ffffff; + } + + if (carry === 0 && i < a.length && a !== this) { + for (; i < a.length; ++i) { + this.words[i] = a.words[i]; + } + } + + this.length = Math.max(this.length, i); + if (a !== this) this.negative ^= 1; + return this.strip().normSign(); +}; + +BN.prototype.sub = function (num) { + return this.clone().isub(num); +}; + +BN.umulTo = function (num1, num2, out) { + out.length = num1.length + num2.length - 1; + var a1 = num1.words[0]; + var b1 = num2.words[0]; + var r1 = a1 * b1; + var carry = r1 / 0x04000000 | 0; + out.words[0] = r1 & 0x03ffffff; + + for (var k = 1, maxK = out.length; k < maxK; k++) { + var ncarry = carry >>> 26; + var rword = carry & 0x03ffffff; + + for (var j = Math.max(0, k - num1.length + 1), maxJ = Math.min(k, num2.length - 1); j <= maxJ; j++) { + var i = k - j; + var a = num1.words[i]; + var b = num2.words[j]; + var r = a * b + rword; + ncarry += r / 0x04000000 | 0; + rword = r & 0x03ffffff; + } + + out.words[k] = rword; + carry = ncarry; + } + + if (carry !== 0) out.words[out.length++] = carry; + return out.strip(); +}; + +BN.umulTo10x10 = Math.imul ? optimized.umulTo10x10 : BN.umulTo; + +BN.umulnTo = function (num, k, out) { + if (k === 0) { + out.words = [0]; + out.length = 1; + return out; + } + + for (var i = 0, carry = 0; i < num.length; ++i) { + var r = num.words[i] * k + carry; + out.words[i] = r & 0x03ffffff; + carry = r / 0x04000000 | 0; + } + + if (carry > 0) { + out.words[i] = carry; + out.length = num.length + 1; + } else { + out.length = num.length; + } + + return out; +}; + +BN.prototype.umul = function (num) { + var out = new BN(); + out.words = new Array(this.length + num.length); + + if (this.length === 10 && num.length === 10) { + return BN.umulTo10x10(this, num, out); + } else if (this.length === 1) { + return BN.umulnTo(num, this.words[0], out); + } else if (num.length === 1) { + return BN.umulnTo(this, num.words[0], out); + } else { + return BN.umulTo(this, num, out); + } +}; + +BN.prototype.isplit = function (output) { + output.length = Math.min(this.length, 9); + + for (var i = 0; i < output.length; ++i) { + output.words[i] = this.words[i]; + } + + if (this.length <= 9) { + this.words[0] = 0; + this.length = 1; + return this; + } // Shift by 9 limbs + + + var prev = this.words[9]; + output.words[output.length++] = prev & 0x003fffff; + + for (i = 10; i < this.length; ++i) { + var word = this.words[i]; + this.words[i - 10] = (word & 0x003fffff) << 4 | prev >>> 22; + prev = word; + } + + prev >>>= 22; + this.words[i - 10] = prev; + + if (prev === 0 && this.length > 10) { + this.length -= 10; + } else { + this.length -= 9; + } + + return this; +}; + +BN.prototype.fireduce = function () { + if (this.isOverflow()) this.isub(BN.n); + return this; +}; + +BN.prototype.ureduce = function () { + var num = this.clone().isplit(BN.tmp).umul(BN.nc).iadd(BN.tmp); + + if (num.bitLengthGT256()) { + num = num.isplit(BN.tmp).umul(BN.nc).iadd(BN.tmp); + if (num.bitLengthGT256()) num = num.isplit(BN.tmp).umul(BN.nc).iadd(BN.tmp); + } + + return num.fireduce(); +}; + +BN.prototype.ishrn = function (n) { + var mask = (1 << n) - 1; + var m = 26 - n; + + for (var i = this.length - 1, carry = 0; i >= 0; --i) { + var word = this.words[i]; + this.words[i] = carry << m | word >>> n; + carry = word & mask; + } + + if (this.length > 1 && this.words[this.length - 1] === 0) this.length -= 1; + return this; +}; + +BN.prototype.uinvm = function () { + var x = this.clone(); + var y = BN.n.clone(); // A * x + B * y = x + + var A = BN.fromNumber(1); + var B = BN.fromNumber(0); // C * x + D * y = y + + var C = BN.fromNumber(0); + var D = BN.fromNumber(1); + + while (x.isEven() && y.isEven()) { + for (var k = 1, m = 1; (x.words[0] & m) === 0 && (y.words[0] & m) === 0 && k < 26; ++k, m <<= 1) { + ; + } + + x.ishrn(k); + y.ishrn(k); + } + + var yp = y.clone(); + var xp = x.clone(); + + while (!x.isZero()) { + for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1) { + ; + } + + if (i > 0) { + x.ishrn(i); + + while (i-- > 0) { + if (A.isOdd() || B.isOdd()) { + A.iadd(yp); + B.isub(xp); + } + + A.ishrn(1); + B.ishrn(1); + } + } + + for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) { + ; + } + + if (j > 0) { + y.ishrn(j); + + while (j-- > 0) { + if (C.isOdd() || D.isOdd()) { + C.iadd(yp); + D.isub(xp); + } + + C.ishrn(1); + D.ishrn(1); + } + } + + if (x.ucmp(y) >= 0) { + x.isub(y); + A.isub(C); + B.isub(D); + } else { + y.isub(x); + C.isub(A); + D.isub(B); + } + } + + if (C.negative === 1) { + C.negative = 0; + var result = C.ureduce(); + result.negative ^= 1; + return result.normSign().iadd(BN.n); + } else { + return C.ureduce(); + } +}; + +BN.prototype.imulK = function () { + this.words[this.length] = 0; + this.words[this.length + 1] = 0; + this.length += 2; + + for (var i = 0, lo = 0; i < this.length; ++i) { + var w = this.words[i] | 0; + lo += w * 0x3d1; + this.words[i] = lo & 0x03ffffff; + lo = w * 0x40 + (lo / 0x04000000 | 0); + } + + if (this.words[this.length - 1] === 0) { + this.length -= 1; + if (this.words[this.length - 1] === 0) this.length -= 1; + } + + return this; +}; + +BN.prototype.redIReduce = function () { + this.isplit(BN.tmp).imulK().iadd(BN.tmp); + if (this.bitLengthGT256()) this.isplit(BN.tmp).imulK().iadd(BN.tmp); + var cmp = this.ucmp(BN.p); + + if (cmp === 0) { + this.words[0] = 0; + this.length = 1; + } else if (cmp > 0) { + this.isub(BN.p); + } else { + this.strip(); + } + + return this; +}; + +BN.prototype.redNeg = function () { + if (this.isZero()) return BN.fromNumber(0); + return BN.p.sub(this); +}; + +BN.prototype.redAdd = function (num) { + return this.clone().redIAdd(num); +}; + +BN.prototype.redIAdd = function (num) { + this.iadd(num); + if (this.ucmp(BN.p) >= 0) this.isub(BN.p); + return this; +}; + +BN.prototype.redIAdd7 = function () { + this.iuaddn(7); + if (this.ucmp(BN.p) >= 0) this.isub(BN.p); + return this; +}; + +BN.prototype.redSub = function (num) { + return this.clone().redISub(num); +}; + +BN.prototype.redISub = function (num) { + this.isub(num); + if (this.negative !== 0) this.iadd(BN.p); + return this; +}; + +BN.prototype.redMul = function (num) { + return this.umul(num).redIReduce(); +}; + +BN.prototype.redSqr = function () { + return this.umul(this).redIReduce(); +}; + +BN.prototype.redSqrt = function () { + if (this.isZero()) return this.clone(); + var wv2 = this.redSqr(); + var wv4 = wv2.redSqr(); + var wv12 = wv4.redSqr().redMul(wv4); + var wv14 = wv12.redMul(wv2); + var wv15 = wv14.redMul(this); + var out = wv15; + + for (var i = 0; i < 54; ++i) { + out = out.redSqr().redSqr().redSqr().redSqr().redMul(wv15); + } + + out = out.redSqr().redSqr().redSqr().redSqr().redMul(wv14); + + for (i = 0; i < 5; ++i) { + out = out.redSqr().redSqr().redSqr().redSqr().redMul(wv15); + } + + out = out.redSqr().redSqr().redSqr().redSqr().redMul(wv12); + out = out.redSqr().redSqr().redSqr().redSqr().redSqr().redSqr().redMul(wv12); + + if (out.redSqr().ucmp(this) === 0) { + return out; + } else { + return null; + } +}; + +BN.prototype.redInvm = function () { + var a = this.clone(); + var b = BN.p.clone(); + var x1 = BN.fromNumber(1); + var x2 = BN.fromNumber(0); + + while (a.gtOne() && b.gtOne()) { + for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1) { + ; + } + + if (i > 0) { + a.ishrn(i); + + while (i-- > 0) { + if (x1.isOdd()) x1.iadd(BN.p); + x1.ishrn(1); + } + } + + for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1) { + ; + } + + if (j > 0) { + b.ishrn(j); + + while (j-- > 0) { + if (x2.isOdd()) x2.iadd(BN.p); + x2.ishrn(1); + } + } + + if (a.ucmp(b) >= 0) { + a.isub(b); + x1.isub(x2); + } else { + b.isub(a); + x2.isub(x1); + } + } + + var res; + + if (a.length === 1 && a.words[0] === 1) { + res = x1; + } else { + res = x2; + } + + if (res.negative !== 0) res.iadd(BN.p); + + if (res.negative !== 0) { + res.negative = 0; + return res.redIReduce().redNeg(); + } else { + return res.redIReduce(); + } +}; + +BN.prototype.getNAF = function (w) { + var naf = []; + var ws = 1 << w + 1; + var wsm1 = ws - 1; + var ws2 = ws >> 1; + var k = this.clone(); + + while (!k.isZero()) { + for (var i = 0, m = 1; (k.words[0] & m) === 0 && i < 26; ++i, m <<= 1) { + naf.push(0); + } + + if (i !== 0) { + k.ishrn(i); + } else { + var mod = k.words[0] & wsm1; + + if (mod >= ws2) { + naf.push(ws2 - mod); + k.iuaddn(mod - ws2).ishrn(1); + } else { + naf.push(mod); + k.words[0] -= mod; + + if (!k.isZero()) { + for (i = w - 1; i > 0; --i) { + naf.push(0); + } + + k.ishrn(w); + } + } + } + } + + return naf; +}; + +BN.prototype.inspect = function () { + if (this.isZero()) return '0'; + var buffer = this.toBuffer().toString('hex'); + + for (var i = 0; buffer[i] === '0'; ++i) { + ; + } + + return buffer.slice(i); +}; + +BN.n = BN.fromBuffer(Buffer.from('FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141', 'hex')); +BN.nh = BN.n.clone().ishrn(1); +BN.nc = BN.fromBuffer(Buffer.from('000000000000000000000000000000014551231950B75FC4402DA1732FC9BEBF', 'hex')); +BN.p = BN.fromBuffer(Buffer.from('FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F', 'hex')); +BN.psn = BN.p.sub(BN.n); +BN.tmp = new BN(); +BN.tmp.words = new Array(10) // WTF?! it speed-up benchmark on ~20% +; + +(function () { + var x = BN.fromNumber(1); + x.words[3] = 0; +})(); + +module.exports = BN; + +/***/ }), +/* 56 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var objectAssign = __webpack_require__(308); // compare and isBuffer taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js +// original notice: + +/*! + * The buffer module from node.js, for the browser. + * + * @author Feross Aboukhadijeh + * @license MIT + */ + + +function compare(a, b) { + if (a === b) { + return 0; + } + + var x = a.length; + var y = b.length; + + for (var i = 0, len = Math.min(x, y); i < len; ++i) { + if (a[i] !== b[i]) { + x = a[i]; + y = b[i]; + break; + } + } + + if (x < y) { + return -1; + } + + if (y < x) { + return 1; + } + + return 0; +} + +function isBuffer(b) { + if (global.Buffer && typeof global.Buffer.isBuffer === 'function') { + return global.Buffer.isBuffer(b); + } + + return !!(b != null && b._isBuffer); +} // based on node assert, original notice: +// NB: The URL to the CommonJS spec is kept just for tradition. +// node-assert has evolved a lot since then, both in API and behavior. +// http://wiki.commonjs.org/wiki/Unit_Testing/1.0 +// +// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8! +// +// Originally from narwhal.js (http://narwhaljs.org) +// Copyright (c) 2009 Thomas Robinson <280north.com> +// +// Permission is hereby granted, free of charge, to any person obtaining a copy +// of this software and associated documentation files (the 'Software'), to +// deal in the Software without restriction, including without limitation the +// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or +// sell copies of the Software, and to permit persons to whom the Software is +// furnished to do so, subject to the following conditions: +// +// The above copyright notice and this permission notice shall be included in +// all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN +// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION +// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + +var util = __webpack_require__(57); + +var hasOwn = Object.prototype.hasOwnProperty; +var pSlice = Array.prototype.slice; + +var functionsHaveNames = function () { + return function foo() {}.name === 'foo'; +}(); + +function pToString(obj) { + return Object.prototype.toString.call(obj); +} + +function isView(arrbuf) { + if (isBuffer(arrbuf)) { + return false; + } + + if (typeof global.ArrayBuffer !== 'function') { + return false; + } + + if (typeof ArrayBuffer.isView === 'function') { + return ArrayBuffer.isView(arrbuf); + } + + if (!arrbuf) { + return false; + } + + if (arrbuf instanceof DataView) { + return true; + } + + if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) { + return true; + } + + return false; +} // 1. The assert module provides functions that throw +// AssertionError's when particular conditions are not met. The +// assert module must conform to the following interface. + + +var assert = module.exports = ok; // 2. The AssertionError is defined in assert. +// new assert.AssertionError({ message: message, +// actual: actual, +// expected: expected }) + +var regex = /\s*function\s+([^\(\s]*)\s*/; // based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js + +function getName(func) { + if (!util.isFunction(func)) { + return; + } + + if (functionsHaveNames) { + return func.name; + } + + var str = func.toString(); + var match = str.match(regex); + return match && match[1]; +} + +assert.AssertionError = function AssertionError(options) { + this.name = 'AssertionError'; + this.actual = options.actual; + this.expected = options.expected; + this.operator = options.operator; + + if (options.message) { + this.message = options.message; + this.generatedMessage = false; + } else { + this.message = getMessage(this); + this.generatedMessage = true; + } + + var stackStartFunction = options.stackStartFunction || fail; + + if (Error.captureStackTrace) { + Error.captureStackTrace(this, stackStartFunction); + } else { + // non v8 browsers so we can have a stacktrace + var err = new Error(); + + if (err.stack) { + var out = err.stack; // try to strip useless frames + + var fn_name = getName(stackStartFunction); + var idx = out.indexOf('\n' + fn_name); + + if (idx >= 0) { + // once we have located the function frame + // we need to strip out everything before it (and its line) + var next_line = out.indexOf('\n', idx + 1); + out = out.substring(next_line + 1); + } + + this.stack = out; + } + } +}; // assert.AssertionError instanceof Error + + +util.inherits(assert.AssertionError, Error); + +function truncate(s, n) { + if (typeof s === 'string') { + return s.length < n ? s : s.slice(0, n); + } else { + return s; + } +} + +function inspect(something) { + if (functionsHaveNames || !util.isFunction(something)) { + return util.inspect(something); + } + + var rawname = getName(something); + var name = rawname ? ': ' + rawname : ''; + return '[Function' + name + ']'; +} + +function getMessage(self) { + return truncate(inspect(self.actual), 128) + ' ' + self.operator + ' ' + truncate(inspect(self.expected), 128); +} // At present only the three keys mentioned above are used and +// understood by the spec. Implementations or sub modules can pass +// other keys to the AssertionError's constructor - they will be +// ignored. +// 3. All of the following functions must throw an AssertionError +// when a corresponding condition is not met, with a message that +// may be undefined if not provided. All assertion methods provide +// both the actual and expected values to the assertion error for +// display purposes. + + +function fail(actual, expected, message, operator, stackStartFunction) { + throw new assert.AssertionError({ + message: message, + actual: actual, + expected: expected, + operator: operator, + stackStartFunction: stackStartFunction + }); +} // EXTENSION! allows for well behaved errors defined elsewhere. + + +assert.fail = fail; // 4. Pure assertion tests whether a value is truthy, as determined +// by !!guard. +// assert.ok(guard, message_opt); +// This statement is equivalent to assert.equal(true, !!guard, +// message_opt);. To test strictly for the value true, use +// assert.strictEqual(true, guard, message_opt);. + +function ok(value, message) { + if (!value) fail(value, true, message, '==', assert.ok); +} + +assert.ok = ok; // 5. The equality assertion tests shallow, coercive equality with +// ==. +// assert.equal(actual, expected, message_opt); + +assert.equal = function equal(actual, expected, message) { + if (actual != expected) fail(actual, expected, message, '==', assert.equal); +}; // 6. The non-equality assertion tests for whether two objects are not equal +// with != assert.notEqual(actual, expected, message_opt); + + +assert.notEqual = function notEqual(actual, expected, message) { + if (actual == expected) { + fail(actual, expected, message, '!=', assert.notEqual); + } +}; // 7. The equivalence assertion tests a deep equality relation. +// assert.deepEqual(actual, expected, message_opt); + + +assert.deepEqual = function deepEqual(actual, expected, message) { + if (!_deepEqual(actual, expected, false)) { + fail(actual, expected, message, 'deepEqual', assert.deepEqual); + } +}; + +assert.deepStrictEqual = function deepStrictEqual(actual, expected, message) { + if (!_deepEqual(actual, expected, true)) { + fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual); + } +}; + +function _deepEqual(actual, expected, strict, memos) { + // 7.1. All identical values are equivalent, as determined by ===. + if (actual === expected) { + return true; + } else if (isBuffer(actual) && isBuffer(expected)) { + return compare(actual, expected) === 0; // 7.2. If the expected value is a Date object, the actual value is + // equivalent if it is also a Date object that refers to the same time. + } else if (util.isDate(actual) && util.isDate(expected)) { + return actual.getTime() === expected.getTime(); // 7.3 If the expected value is a RegExp object, the actual value is + // equivalent if it is also a RegExp object with the same source and + // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`). + } else if (util.isRegExp(actual) && util.isRegExp(expected)) { + return actual.source === expected.source && actual.global === expected.global && actual.multiline === expected.multiline && actual.lastIndex === expected.lastIndex && actual.ignoreCase === expected.ignoreCase; // 7.4. Other pairs that do not both pass typeof value == 'object', + // equivalence is determined by ==. + } else if ((actual === null || _typeof(actual) !== 'object') && (expected === null || _typeof(expected) !== 'object')) { + return strict ? actual === expected : actual == expected; // If both values are instances of typed arrays, wrap their underlying + // ArrayBuffers in a Buffer each to increase performance + // This optimization requires the arrays to have the same type as checked by + // Object.prototype.toString (aka pToString). Never perform binary + // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their + // bit patterns are not identical. + } else if (isView(actual) && isView(expected) && pToString(actual) === pToString(expected) && !(actual instanceof Float32Array || actual instanceof Float64Array)) { + return compare(new Uint8Array(actual.buffer), new Uint8Array(expected.buffer)) === 0; // 7.5 For all other Object pairs, including Array objects, equivalence is + // determined by having the same number of owned properties (as verified + // with Object.prototype.hasOwnProperty.call), the same set of keys + // (although not necessarily the same order), equivalent values for every + // corresponding key, and an identical 'prototype' property. Note: this + // accounts for both named and indexed properties on Arrays. + } else if (isBuffer(actual) !== isBuffer(expected)) { + return false; + } else { + memos = memos || { + actual: [], + expected: [] + }; + var actualIndex = memos.actual.indexOf(actual); + + if (actualIndex !== -1) { + if (actualIndex === memos.expected.indexOf(expected)) { + return true; + } + } + + memos.actual.push(actual); + memos.expected.push(expected); + return objEquiv(actual, expected, strict, memos); + } +} + +function isArguments(object) { + return Object.prototype.toString.call(object) == '[object Arguments]'; +} + +function objEquiv(a, b, strict, actualVisitedObjects) { + if (a === null || a === undefined || b === null || b === undefined) return false; // if one is a primitive, the other must be same + + if (util.isPrimitive(a) || util.isPrimitive(b)) return a === b; + if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false; + var aIsArgs = isArguments(a); + var bIsArgs = isArguments(b); + if (aIsArgs && !bIsArgs || !aIsArgs && bIsArgs) return false; + + if (aIsArgs) { + a = pSlice.call(a); + b = pSlice.call(b); + return _deepEqual(a, b, strict); + } + + var ka = objectKeys(a); + var kb = objectKeys(b); + var key, i; // having the same number of owned properties (keys incorporates + // hasOwnProperty) + + if (ka.length !== kb.length) return false; //the same set of keys (although not necessarily the same order), + + ka.sort(); + kb.sort(); //~~~cheap key test + + for (i = ka.length - 1; i >= 0; i--) { + if (ka[i] !== kb[i]) return false; + } //equivalent values for every corresponding key, and + //~~~possibly expensive deep test + + + for (i = ka.length - 1; i >= 0; i--) { + key = ka[i]; + if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects)) return false; + } + + return true; +} // 8. The non-equivalence assertion tests for any deep inequality. +// assert.notDeepEqual(actual, expected, message_opt); + + +assert.notDeepEqual = function notDeepEqual(actual, expected, message) { + if (_deepEqual(actual, expected, false)) { + fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual); + } +}; + +assert.notDeepStrictEqual = notDeepStrictEqual; + +function notDeepStrictEqual(actual, expected, message) { + if (_deepEqual(actual, expected, true)) { + fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual); + } +} // 9. The strict equality assertion tests strict equality, as determined by ===. +// assert.strictEqual(actual, expected, message_opt); + + +assert.strictEqual = function strictEqual(actual, expected, message) { + if (actual !== expected) { + fail(actual, expected, message, '===', assert.strictEqual); + } +}; // 10. The strict non-equality assertion tests for strict inequality, as +// determined by !==. assert.notStrictEqual(actual, expected, message_opt); + + +assert.notStrictEqual = function notStrictEqual(actual, expected, message) { + if (actual === expected) { + fail(actual, expected, message, '!==', assert.notStrictEqual); + } +}; + +function expectedException(actual, expected) { + if (!actual || !expected) { + return false; + } + + if (Object.prototype.toString.call(expected) == '[object RegExp]') { + return expected.test(actual); + } + + try { + if (actual instanceof expected) { + return true; + } + } catch (e) {// Ignore. The instanceof check doesn't work for arrow functions. + } + + if (Error.isPrototypeOf(expected)) { + return false; + } + + return expected.call({}, actual) === true; +} + +function _tryBlock(block) { + var error; + + try { + block(); + } catch (e) { + error = e; + } + + return error; +} + +function _throws(shouldThrow, block, expected, message) { + var actual; + + if (typeof block !== 'function') { + throw new TypeError('"block" argument must be a function'); + } + + if (typeof expected === 'string') { + message = expected; + expected = null; + } + + actual = _tryBlock(block); + message = (expected && expected.name ? ' (' + expected.name + ').' : '.') + (message ? ' ' + message : '.'); + + if (shouldThrow && !actual) { + fail(actual, expected, 'Missing expected exception' + message); + } + + var userProvidedMessage = typeof message === 'string'; + var isUnwantedException = !shouldThrow && util.isError(actual); + var isUnexpectedException = !shouldThrow && actual && !expected; + + if (isUnwantedException && userProvidedMessage && expectedException(actual, expected) || isUnexpectedException) { + fail(actual, expected, 'Got unwanted exception' + message); + } + + if (shouldThrow && actual && expected && !expectedException(actual, expected) || !shouldThrow && actual) { + throw actual; + } +} // 11. Expected to throw an error: +// assert.throws(block, Error_opt, message_opt); + + +assert["throws"] = function (block, +/*optional*/ +error, +/*optional*/ +message) { + _throws(true, block, error, message); +}; // EXTENSION! This is annoying to write outside this module. + + +assert.doesNotThrow = function (block, +/*optional*/ +error, +/*optional*/ +message) { + _throws(false, block, error, message); +}; + +assert.ifError = function (err) { + if (err) throw err; +}; // Expose a strict only variant of assert + + +function strict(value, message) { + if (!value) fail(value, true, message, '==', strict); +} + +assert.strict = objectAssign(strict, assert, { + equal: assert.strictEqual, + deepEqual: assert.deepStrictEqual, + notEqual: assert.notStrictEqual, + notDeepEqual: assert.notDeepStrictEqual +}); +assert.strict.strict = assert.strict; + +var objectKeys = Object.keys || function (obj) { + var keys = []; + + for (var key in obj) { + if (hasOwn.call(obj, key)) keys.push(key); + } + + return keys; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10))) + +/***/ }), +/* 57 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +var getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors || function getOwnPropertyDescriptors(obj) { + var keys = Object.keys(obj); + var descriptors = {}; + + for (var i = 0; i < keys.length; i++) { + descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]); + } + + return descriptors; +}; + +var formatRegExp = /%[sdj%]/g; + +exports.format = function (f) { + if (!isString(f)) { + var objects = []; + + for (var i = 0; i < arguments.length; i++) { + objects.push(inspect(arguments[i])); + } + + return objects.join(' '); + } + + var i = 1; + var args = arguments; + var len = args.length; + var str = String(f).replace(formatRegExp, function (x) { + if (x === '%%') return '%'; + if (i >= len) return x; + + switch (x) { + case '%s': + return String(args[i++]); + + case '%d': + return Number(args[i++]); + + case '%j': + try { + return JSON.stringify(args[i++]); + } catch (_) { + return '[Circular]'; + } + + default: + return x; + } + }); + + for (var x = args[i]; i < len; x = args[++i]) { + if (isNull(x) || !isObject(x)) { + str += ' ' + x; + } else { + str += ' ' + inspect(x); + } + } + + return str; +}; // Mark that a method should not be used. +// Returns a modified function which warns once by default. +// If --no-deprecation is set, then it is a no-op. + + +exports.deprecate = function (fn, msg) { + if (typeof process !== 'undefined' && process.noDeprecation === true) { + return fn; + } // Allow for deprecating things in the process of starting up. + + + if (typeof process === 'undefined') { + return function () { + return exports.deprecate(fn, msg).apply(this, arguments); + }; + } + + var warned = false; + + function deprecated() { + if (!warned) { + if (process.throwDeprecation) { + throw new Error(msg); + } else if (process.traceDeprecation) { + console.trace(msg); + } else { + console.error(msg); + } + + warned = true; + } + + return fn.apply(this, arguments); + } + + return deprecated; +}; + +var debugs = {}; +var debugEnviron; + +exports.debuglog = function (set) { + if (isUndefined(debugEnviron)) debugEnviron = process.env.NODE_DEBUG || ''; + set = set.toUpperCase(); + + if (!debugs[set]) { + if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) { + var pid = process.pid; + + debugs[set] = function () { + var msg = exports.format.apply(exports, arguments); + console.error('%s %d: %s', set, pid, msg); + }; + } else { + debugs[set] = function () {}; + } + } + + return debugs[set]; +}; +/** + * Echos the value of a value. Trys to print the value out + * in the best way possible given the different types. + * + * @param {Object} obj The object to print out. + * @param {Object} opts Optional options object that alters the output. + */ + +/* legacy: obj, showHidden, depth, colors*/ + + +function inspect(obj, opts) { + // default options + var ctx = { + seen: [], + stylize: stylizeNoColor + }; // legacy... + + if (arguments.length >= 3) ctx.depth = arguments[2]; + if (arguments.length >= 4) ctx.colors = arguments[3]; + + if (isBoolean(opts)) { + // legacy... + ctx.showHidden = opts; + } else if (opts) { + // got an "options" object + exports._extend(ctx, opts); + } // set default options + + + if (isUndefined(ctx.showHidden)) ctx.showHidden = false; + if (isUndefined(ctx.depth)) ctx.depth = 2; + if (isUndefined(ctx.colors)) ctx.colors = false; + if (isUndefined(ctx.customInspect)) ctx.customInspect = true; + if (ctx.colors) ctx.stylize = stylizeWithColor; + return formatValue(ctx, obj, ctx.depth); +} + +exports.inspect = inspect; // http://en.wikipedia.org/wiki/ANSI_escape_code#graphics + +inspect.colors = { + 'bold': [1, 22], + 'italic': [3, 23], + 'underline': [4, 24], + 'inverse': [7, 27], + 'white': [37, 39], + 'grey': [90, 39], + 'black': [30, 39], + 'blue': [34, 39], + 'cyan': [36, 39], + 'green': [32, 39], + 'magenta': [35, 39], + 'red': [31, 39], + 'yellow': [33, 39] +}; // Don't use 'blue' not visible on cmd.exe + +inspect.styles = { + 'special': 'cyan', + 'number': 'yellow', + 'boolean': 'yellow', + 'undefined': 'grey', + 'null': 'bold', + 'string': 'green', + 'date': 'magenta', + // "name": intentionally not styling + 'regexp': 'red' +}; + +function stylizeWithColor(str, styleType) { + var style = inspect.styles[styleType]; + + if (style) { + return "\x1B[" + inspect.colors[style][0] + 'm' + str + "\x1B[" + inspect.colors[style][1] + 'm'; + } else { + return str; + } +} + +function stylizeNoColor(str, styleType) { + return str; +} + +function arrayToHash(array) { + var hash = {}; + array.forEach(function (val, idx) { + hash[val] = true; + }); + return hash; +} + +function formatValue(ctx, value, recurseTimes) { + // Provide a hook for user-specified inspect functions. + // Check that value is an object with an inspect function on it + if (ctx.customInspect && value && isFunction(value.inspect) && // Filter out the util module, it's inspect function is special + value.inspect !== exports.inspect && // Also filter out any prototype objects using the circular check. + !(value.constructor && value.constructor.prototype === value)) { + var ret = value.inspect(recurseTimes, ctx); + + if (!isString(ret)) { + ret = formatValue(ctx, ret, recurseTimes); + } + + return ret; + } // Primitive types cannot have properties + + + var primitive = formatPrimitive(ctx, value); + + if (primitive) { + return primitive; + } // Look up the keys of the object. + + + var keys = Object.keys(value); + var visibleKeys = arrayToHash(keys); + + if (ctx.showHidden) { + keys = Object.getOwnPropertyNames(value); + } // IE doesn't make error fields non-enumerable + // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx + + + if (isError(value) && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) { + return formatError(value); + } // Some type of object without properties can be shortcutted. + + + if (keys.length === 0) { + if (isFunction(value)) { + var name = value.name ? ': ' + value.name : ''; + return ctx.stylize('[Function' + name + ']', 'special'); + } + + if (isRegExp(value)) { + return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); + } + + if (isDate(value)) { + return ctx.stylize(Date.prototype.toString.call(value), 'date'); + } + + if (isError(value)) { + return formatError(value); + } + } + + var base = '', + array = false, + braces = ['{', '}']; // Make Array say that they are Array + + if (isArray(value)) { + array = true; + braces = ['[', ']']; + } // Make functions say that they are functions + + + if (isFunction(value)) { + var n = value.name ? ': ' + value.name : ''; + base = ' [Function' + n + ']'; + } // Make RegExps say that they are RegExps + + + if (isRegExp(value)) { + base = ' ' + RegExp.prototype.toString.call(value); + } // Make dates with properties first say the date + + + if (isDate(value)) { + base = ' ' + Date.prototype.toUTCString.call(value); + } // Make error with message first say the error + + + if (isError(value)) { + base = ' ' + formatError(value); + } + + if (keys.length === 0 && (!array || value.length == 0)) { + return braces[0] + base + braces[1]; + } + + if (recurseTimes < 0) { + if (isRegExp(value)) { + return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); + } else { + return ctx.stylize('[Object]', 'special'); + } + } + + ctx.seen.push(value); + var output; + + if (array) { + output = formatArray(ctx, value, recurseTimes, visibleKeys, keys); + } else { + output = keys.map(function (key) { + return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array); + }); + } + + ctx.seen.pop(); + return reduceToSingleString(output, base, braces); +} + +function formatPrimitive(ctx, value) { + if (isUndefined(value)) return ctx.stylize('undefined', 'undefined'); + + if (isString(value)) { + var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '').replace(/'/g, "\\'").replace(/\\"/g, '"') + '\''; + return ctx.stylize(simple, 'string'); + } + + if (isNumber(value)) return ctx.stylize('' + value, 'number'); + if (isBoolean(value)) return ctx.stylize('' + value, 'boolean'); // For some reason typeof null is "object", so special case here. + + if (isNull(value)) return ctx.stylize('null', 'null'); +} + +function formatError(value) { + return '[' + Error.prototype.toString.call(value) + ']'; +} + +function formatArray(ctx, value, recurseTimes, visibleKeys, keys) { + var output = []; + + for (var i = 0, l = value.length; i < l; ++i) { + if (hasOwnProperty(value, String(i))) { + output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, String(i), true)); + } else { + output.push(''); + } + } + + keys.forEach(function (key) { + if (!key.match(/^\d+$/)) { + output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, key, true)); + } + }); + return output; +} + +function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) { + var name, str, desc; + desc = Object.getOwnPropertyDescriptor(value, key) || { + value: value[key] + }; + + if (desc.get) { + if (desc.set) { + str = ctx.stylize('[Getter/Setter]', 'special'); + } else { + str = ctx.stylize('[Getter]', 'special'); + } + } else { + if (desc.set) { + str = ctx.stylize('[Setter]', 'special'); + } + } + + if (!hasOwnProperty(visibleKeys, key)) { + name = '[' + key + ']'; + } + + if (!str) { + if (ctx.seen.indexOf(desc.value) < 0) { + if (isNull(recurseTimes)) { + str = formatValue(ctx, desc.value, null); + } else { + str = formatValue(ctx, desc.value, recurseTimes - 1); + } + + if (str.indexOf('\n') > -1) { + if (array) { + str = str.split('\n').map(function (line) { + return ' ' + line; + }).join('\n').substr(2); + } else { + str = '\n' + str.split('\n').map(function (line) { + return ' ' + line; + }).join('\n'); + } + } + } else { + str = ctx.stylize('[Circular]', 'special'); + } + } + + if (isUndefined(name)) { + if (array && key.match(/^\d+$/)) { + return str; + } + + name = JSON.stringify('' + key); + + if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) { + name = name.substr(1, name.length - 2); + name = ctx.stylize(name, 'name'); + } else { + name = name.replace(/'/g, "\\'").replace(/\\"/g, '"').replace(/(^"|"$)/g, "'"); + name = ctx.stylize(name, 'string'); + } + } + + return name + ': ' + str; +} + +function reduceToSingleString(output, base, braces) { + var numLinesEst = 0; + var length = output.reduce(function (prev, cur) { + numLinesEst++; + if (cur.indexOf('\n') >= 0) numLinesEst++; + return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1; + }, 0); + + if (length > 60) { + return braces[0] + (base === '' ? '' : base + '\n ') + ' ' + output.join(',\n ') + ' ' + braces[1]; + } + + return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1]; +} // NOTE: These type checking functions intentionally don't use `instanceof` +// because it is fragile and can be easily faked with `Object.create()`. + + +function isArray(ar) { + return Array.isArray(ar); +} + +exports.isArray = isArray; + +function isBoolean(arg) { + return typeof arg === 'boolean'; +} + +exports.isBoolean = isBoolean; + +function isNull(arg) { + return arg === null; +} + +exports.isNull = isNull; + +function isNullOrUndefined(arg) { + return arg == null; +} + +exports.isNullOrUndefined = isNullOrUndefined; + +function isNumber(arg) { + return typeof arg === 'number'; +} + +exports.isNumber = isNumber; + +function isString(arg) { + return typeof arg === 'string'; +} + +exports.isString = isString; + +function isSymbol(arg) { + return _typeof(arg) === 'symbol'; +} + +exports.isSymbol = isSymbol; + +function isUndefined(arg) { + return arg === void 0; +} + +exports.isUndefined = isUndefined; + +function isRegExp(re) { + return isObject(re) && objectToString(re) === '[object RegExp]'; +} + +exports.isRegExp = isRegExp; + +function isObject(arg) { + return _typeof(arg) === 'object' && arg !== null; +} + +exports.isObject = isObject; + +function isDate(d) { + return isObject(d) && objectToString(d) === '[object Date]'; +} + +exports.isDate = isDate; + +function isError(e) { + return isObject(e) && (objectToString(e) === '[object Error]' || e instanceof Error); +} + +exports.isError = isError; + +function isFunction(arg) { + return typeof arg === 'function'; +} + +exports.isFunction = isFunction; + +function isPrimitive(arg) { + return arg === null || typeof arg === 'boolean' || typeof arg === 'number' || typeof arg === 'string' || _typeof(arg) === 'symbol' || // ES6 symbol + typeof arg === 'undefined'; +} + +exports.isPrimitive = isPrimitive; +exports.isBuffer = __webpack_require__(309); + +function objectToString(o) { + return Object.prototype.toString.call(o); +} + +function pad(n) { + return n < 10 ? '0' + n.toString(10) : n.toString(10); +} + +var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec']; // 26 Feb 16:19:34 + +function timestamp() { + var d = new Date(); + var time = [pad(d.getHours()), pad(d.getMinutes()), pad(d.getSeconds())].join(':'); + return [d.getDate(), months[d.getMonth()], time].join(' '); +} // log is just a thin wrapper to console.log that prepends a timestamp + + +exports.log = function () { + console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments)); +}; +/** + * Inherit the prototype methods from one constructor into another. + * + * The Function.prototype.inherits from lang.js rewritten as a standalone + * function (not on Function.prototype). NOTE: If this file is to be loaded + * during bootstrapping this function needs to be rewritten using some native + * functions as prototype setup using normal JavaScript does not work as + * expected during bootstrapping (see mirror.js in r114903). + * + * @param {function} ctor Constructor function which needs to inherit the + * prototype. + * @param {function} superCtor Constructor function to inherit prototype from. + */ + + +exports.inherits = __webpack_require__(2); + +exports._extend = function (origin, add) { + // Don't do anything if add isn't an object + if (!add || !isObject(add)) return origin; + var keys = Object.keys(add); + var i = keys.length; + + while (i--) { + origin[keys[i]] = add[keys[i]]; + } + + return origin; +}; + +function hasOwnProperty(obj, prop) { + return Object.prototype.hasOwnProperty.call(obj, prop); +} + +var kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined; + +exports.promisify = function promisify(original) { + if (typeof original !== 'function') throw new TypeError('The "original" argument must be of type Function'); + + if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) { + var fn = original[kCustomPromisifiedSymbol]; + + if (typeof fn !== 'function') { + throw new TypeError('The "util.promisify.custom" argument must be of type Function'); + } + + Object.defineProperty(fn, kCustomPromisifiedSymbol, { + value: fn, + enumerable: false, + writable: false, + configurable: true + }); + return fn; + } + + function fn() { + var promiseResolve, promiseReject; + var promise = new Promise(function (resolve, reject) { + promiseResolve = resolve; + promiseReject = reject; + }); + var args = []; + + for (var i = 0; i < arguments.length; i++) { + args.push(arguments[i]); + } + + args.push(function (err, value) { + if (err) { + promiseReject(err); + } else { + promiseResolve(value); + } + }); + + try { + original.apply(this, args); + } catch (err) { + promiseReject(err); + } + + return promise; + } + + Object.setPrototypeOf(fn, Object.getPrototypeOf(original)); + if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, { + value: fn, + enumerable: false, + writable: false, + configurable: true + }); + return Object.defineProperties(fn, getOwnPropertyDescriptors(original)); +}; + +exports.promisify.custom = kCustomPromisifiedSymbol; + +function callbackifyOnRejected(reason, cb) { + // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M). + // Because `null` is a special error value in callbacks which means "no error + // occurred", we error-wrap so the callback consumer can distinguish between + // "the promise rejected with null" or "the promise fulfilled with undefined". + if (!reason) { + var newReason = new Error('Promise was rejected with a falsy value'); + newReason.reason = reason; + reason = newReason; + } + + return cb(reason); +} + +function callbackify(original) { + if (typeof original !== 'function') { + throw new TypeError('The "original" argument must be of type Function'); + } // We DO NOT return the promise as it gives the user a false sense that + // the promise is actually somehow related to the callback's execution + // and that the callback throwing will reject the promise. + + + function callbackified() { + var args = []; + + for (var i = 0; i < arguments.length; i++) { + args.push(arguments[i]); + } + + var maybeCb = args.pop(); + + if (typeof maybeCb !== 'function') { + throw new TypeError('The last argument must be of type Function'); + } + + var self = this; + + var cb = function cb() { + return maybeCb.apply(self, arguments); + }; // In true node style we process the callback on `nextTick` with all the + // implications (stack, `uncaughtException`, `async_hooks`) + + + original.apply(this, args).then(function (ret) { + process.nextTick(cb, null, ret); + }, function (rej) { + process.nextTick(callbackifyOnRejected, rej, cb); + }); + } + + Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original)); + Object.defineProperties(callbackified, getOwnPropertyDescriptors(original)); + return callbackified; +} + +exports.callbackify = callbackify; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 58 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var isStream = function isStream(stream) { + return stream !== null && _typeof(stream) === 'object' && typeof stream.pipe === 'function'; +}; + +isStream.writable = function (stream) { + return isStream(stream) && stream.writable !== false && typeof stream._write === 'function' && _typeof(stream._writableState) === 'object'; +}; + +isStream.readable = function (stream) { + return isStream(stream) && stream.readable !== false && typeof stream._read === 'function' && _typeof(stream._readableState) === 'object'; +}; + +isStream.duplex = function (stream) { + return isStream.writable(stream) && isStream.readable(stream); +}; + +isStream.transform = function (stream) { + return isStream.duplex(stream) && typeof stream._transform === 'function' && _typeof(stream._transformState) === 'object'; +}; + +module.exports = isStream; + +/***/ }), +/* 59 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +module.exports = function pull(a) { + var length = arguments.length; + + if (typeof a === 'function' && a.length === 1) { + var args = new Array(length); + + for (var i = 0; i < length; i++) { + args[i] = arguments[i]; + } + + return function (read) { + if (args == null) { + throw new TypeError("partial sink should only be called once!"); + } // Grab the reference after the check, because it's always an array now + // (engines like that kind of consistency). + + + var ref = args; + args = null; // Prioritize common case of small number of pulls. + + switch (length) { + case 1: + return pull(read, ref[0]); + + case 2: + return pull(read, ref[0], ref[1]); + + case 3: + return pull(read, ref[0], ref[1], ref[2]); + + case 4: + return pull(read, ref[0], ref[1], ref[2], ref[3]); + + default: + ref.unshift(read); + return pull.apply(null, ref); + } + }; + } + + var read = a; + + if (read && typeof read.source === 'function') { + read = read.source; + } + + for (var i = 1; i < length; i++) { + var s = arguments[i]; + + if (typeof s === 'function') { + read = s(read); + } else if (s && _typeof(s) === 'object') { + s.sink(read); + read = s.source; + } + } + + return read; +}; + +/***/ }), +/* 60 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) { + +var Transform = __webpack_require__(5).Transform, + inherits = __webpack_require__(57).inherits; + +function DestroyableTransform(opts) { + Transform.call(this, opts); + this._destroyed = false; +} + +inherits(DestroyableTransform, Transform); + +DestroyableTransform.prototype.destroy = function (err) { + if (this._destroyed) return; + this._destroyed = true; + var self = this; + process.nextTick(function () { + if (err) self.emit('error', err); + self.emit('close'); + }); +}; // a noop _transform function + + +function noop(chunk, enc, callback) { + callback(null, chunk); +} // create a new export function, used by both the main export and +// the .ctor export, contains common logic for dealing with arguments + + +function through2(construct) { + return function (options, transform, flush) { + if (typeof options == 'function') { + flush = transform; + transform = options; + options = {}; + } + + if (typeof transform != 'function') transform = noop; + if (typeof flush != 'function') flush = null; + return construct(options, transform, flush); + }; +} // main export, just make me a transform stream! + + +module.exports = through2(function (options, transform, flush) { + var t2 = new DestroyableTransform(options); + t2._transform = transform; + if (flush) t2._flush = flush; + return t2; +}); // make me a reusable prototype that I can `new`, or implicitly `new` +// with a constructor call + +module.exports.ctor = through2(function (options, transform, flush) { + function Through2(override) { + if (!(this instanceof Through2)) return new Through2(override); + this.options = Object.assign({}, options, override); + DestroyableTransform.call(this, this.options); + } + + inherits(Through2, DestroyableTransform); + Through2.prototype._transform = transform; + if (flush) Through2.prototype._flush = flush; + return Through2; +}); +module.exports.obj = through2(function (options, transform, flush) { + var t2 = new DestroyableTransform(Object.assign({ + objectMode: true, + highWaterMark: 16 + }, options)); + t2._transform = transform; + if (flush) t2._flush = flush; + return t2; +}); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 61 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var abortCb = __webpack_require__(174); + +module.exports = function values(array, onAbort) { + if (!array) return function (abort, cb) { + if (abort) return abortCb(cb, abort, onAbort); + return cb(true); + }; + if (!Array.isArray(array)) array = Object.keys(array).map(function (k) { + return array[k]; + }); + var i = 0; + return function (abort, cb) { + if (abort) return abortCb(cb, abort, onAbort); + if (i >= array.length) cb(true);else cb(null, array[i++]); + }; +}; + +/***/ }), +/* 62 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var assert = __webpack_require__(56); + +var withIs = __webpack_require__(27); + +var addNamedLink = __webpack_require__(442); + +var visibility = __webpack_require__(183); + +var DAGNode = +/*#__PURE__*/ +function () { + function DAGNode(data, links, serializedSize) { + var _this = this; + + _classCallCheck(this, DAGNode); + + if (serializedSize !== 0) { + assert(serializedSize, 'A DAGNode requires it\'s serialized size'); + } + + this._data = data || Buffer.alloc(0); + this._links = links; + this._serializedSize = serializedSize; // Make sure we have a nice public API that can be used by an IPLD resolver + + visibility.hidePrivateFields(this); + visibility.addEnumerableGetters(this, ['Data', 'Links']); // Add getters for existing links by the name of the link + // This is how paths are traversed in IPFS. Links with names won't + // override existing fields like `data` or `links`. + + links.forEach(function (link, position) { + addNamedLink(_this, link.Name, position); + }); + } + + _createClass(DAGNode, [{ + key: "toJSON", + value: function toJSON() { + if (!this._json) { + this._json = Object.freeze({ + data: this.Data, + links: this._links.map(function (l) { + return l.toJSON(); + }), + size: this.size + }); + } + + return Object.assign({}, this._json); + } + }, { + key: "toString", + value: function toString() { + return "DAGNode "); + } + }, { + key: "size", + get: function get() { + if (this._size === undefined) { + this._size = this._links.reduce(function (sum, l) { + return sum + l.Tsize; + }, this._serializedSize); + } + + return this._size; + }, + set: function set(size) { + throw new Error("Can't set property: 'size' is immutable"); + } // Getters for backwards compatible path resolving + + }, { + key: "Data", + get: function get() { + return this._data; + }, + set: function set(_) { + throw new Error("Can't set property: 'Data' is immutable"); + } + }, { + key: "Links", + get: function get() { + return this._links.map(function (link) { + return { + Name: link.Name, + Tsize: link.Tsize, + Hash: link.Hash + }; + }); + }, + set: function set(_) { + throw new Error("Can't set property: 'Links' is immutable"); + } + }]); + + return DAGNode; +}(); + +exports = module.exports = withIs(DAGNode, { + className: 'DAGNode', + symbolName: '@ipld/js-ipld-dag-pb/dagnode' +}); +exports.create = __webpack_require__(63); +exports.clone = __webpack_require__(453); +exports.addLink = __webpack_require__(454); +exports.rmLink = __webpack_require__(455); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 63 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var sort = __webpack_require__(443); + +var _require = __webpack_require__(64), + serialize = _require.serialize; + +var dagNodeUtil = __webpack_require__(65); + +var linkSort = dagNodeUtil.linkSort; + +var DAGNode = __webpack_require__(62); + +var DAGLink = __webpack_require__(35); + +var create = function create(data) { + var links = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : []; + + if (typeof data === 'string') { + data = Buffer.from(data); + } + + if (!Buffer.isBuffer(data)) { + throw new Error('Passed \'data\' is not a buffer or a string!'); + } + + links = links.map(function (link) { + return DAGLink.isDAGLink(link) ? link : DAGLink.util.createDagLinkFromB58EncodedHash(link); + }); + links = sort(links, linkSort); + var serialized = serialize({ + Data: data, + Links: links + }); + return new DAGNode(data, links, serialized.length); +}; + +module.exports = create; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 64 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var _regenerator = _interopRequireDefault(__webpack_require__(15)); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } + +function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } } + +function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; } + +var CID = __webpack_require__(4); + +var protons = __webpack_require__(51); + +var proto = protons(__webpack_require__(445)); + +var DAGLink = __webpack_require__(35); + +var DAGNode = __webpack_require__(62); + +var multicodec = __webpack_require__(50); + +var multihashing = __webpack_require__(184); + +exports = module.exports; +exports.codec = multicodec.DAG_PB; +exports.defaultHashAlg = multicodec.SHA2_256; +/** + * Calculate the CID of the binary blob. + * + * @param {Object} binaryBlob - Encoded IPLD Node + * @param {Object} [userOptions] - Options to create the CID + * @param {number} [userOptions.cidVersion=1] - CID version number + * @param {string} [UserOptions.hashAlg] - Defaults to the defaultHashAlg of the format + * @returns {Promise.} + */ + +var cid = +/*#__PURE__*/ +function () { + var _ref = _asyncToGenerator( + /*#__PURE__*/ + _regenerator["default"].mark(function _callee(binaryBlob, userOptions) { + var defaultOptions, options, multihash, codecName, cid; + return _regenerator["default"].wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + defaultOptions = { + cidVersion: 1, + hashAlg: exports.defaultHashAlg + }; + options = Object.assign(defaultOptions, userOptions); + _context.next = 4; + return multihashing(binaryBlob, options.hashAlg); + + case 4: + multihash = _context.sent; + codecName = multicodec.print[exports.codec]; + cid = new CID(options.cidVersion, codecName, multihash); + return _context.abrupt("return", cid); + + case 8: + case "end": + return _context.stop(); + } + } + }, _callee); + })); + + return function cid(_x, _x2) { + return _ref.apply(this, arguments); + }; +}(); +/** + * Serialize internal representation into a binary PB block. + * + * @param {Object} node - Internal representation of a CBOR block + * @returns {Buffer} - The encoded binary representation + */ + + +var serialize = function serialize(node) { + var data = node.Data; + var links = node.Links || []; // If the node is not an instance of a DAGNode, the link.hash might be a Base58 encoded string; decode it + + if (!DAGNode.isDAGNode(node) && links) { + links = links.map(function (link) { + return DAGLink.isDAGLink(link) ? link : DAGLink.util.createDagLinkFromB58EncodedHash(link); + }); + } + + var serialized = proto.PBNode.encode(toProtoBuf({ + Data: data, + Links: links + })); + return serialized; +}; +/** + * Deserialize PB block into the internal representation. + * + * @param {Buffer} buffer - Binary representation of a PB block + * @returns {Object} - An object that conforms to the IPLD Data Model + */ + + +var deserialize = function deserialize(buffer) { + var pbn = proto.PBNode.decode(buffer); + var links = pbn.Links.map(function (link) { + return new DAGLink(link.Name, link.Tsize, link.Hash); + }); + var data = pbn.Data == null ? Buffer.alloc(0) : pbn.Data; + return new DAGNode(data, links, buffer.length); +}; + +function toProtoBuf(node) { + var pbn = {}; + + if (node.Data && node.Data.length > 0) { + pbn.Data = node.Data; + } else { + // NOTE: this has to be null in order to match go-ipfs serialization `null !== new Buffer(0)` + pbn.Data = null; + } + + if (node.Links && node.Links.length > 0) { + pbn.Links = node.Links.map(function (link) { + return { + Hash: link.Hash.buffer, + Name: link.Name, + Tsize: link.Tsize + }; + }); + } else { + pbn.Links = null; + } + + return pbn; +} + +exports.serialize = serialize; +exports.deserialize = deserialize; +exports.cid = cid; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 65 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var _regenerator = _interopRequireDefault(__webpack_require__(15)); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } + +function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } } + +function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; } + +var DAGLink = __webpack_require__(35); + +var _require = __webpack_require__(64), + cid = _require.cid, + serialize = _require.serialize; + +exports = module.exports; + +function cloneData(dagNode) { + var data; + + if (dagNode.Data && dagNode.Data.length > 0) { + data = Buffer.alloc(dagNode.Data.length); + dagNode.Data.copy(data); + } else { + data = Buffer.alloc(0); + } + + return data; +} + +function cloneLinks(dagNode) { + return dagNode.Links.slice(); +} + +function linkSort(a, b) { + return Buffer.compare(a.nameAsBuffer, b.nameAsBuffer); +} +/* + * toDAGLink converts a DAGNode to a DAGLink + */ + + +var toDAGLink = +/*#__PURE__*/ +function () { + var _ref = _asyncToGenerator( + /*#__PURE__*/ + _regenerator["default"].mark(function _callee(node) { + var options, + serialized, + nodeCid, + _args = arguments; + return _regenerator["default"].wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + options = _args.length > 1 && _args[1] !== undefined ? _args[1] : {}; + serialized = serialize(node); + _context.next = 4; + return cid(serialized); + + case 4: + nodeCid = _context.sent; + return _context.abrupt("return", new DAGLink(options.name || '', serialized.length, nodeCid)); + + case 6: + case "end": + return _context.stop(); + } + } + }, _callee); + })); + + return function toDAGLink(_x) { + return _ref.apply(this, arguments); + }; +}(); + +exports.cloneData = cloneData; +exports.cloneLinks = cloneLinks; +exports.linkSort = linkSort; +exports.toDAGLink = toDAGLink; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 66 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Bignumber = __webpack_require__(20); + +exports.MT = { + POS_INT: 0, + NEG_INT: 1, + BYTE_STRING: 2, + UTF8_STRING: 3, + ARRAY: 4, + MAP: 5, + TAG: 6, + SIMPLE_FLOAT: 7 +}; +exports.TAG = { + DATE_STRING: 0, + DATE_EPOCH: 1, + POS_BIGINT: 2, + NEG_BIGINT: 3, + DECIMAL_FRAC: 4, + BIGFLOAT: 5, + BASE64URL_EXPECTED: 21, + BASE64_EXPECTED: 22, + BASE16_EXPECTED: 23, + CBOR: 24, + URI: 32, + BASE64URL: 33, + BASE64: 34, + REGEXP: 35, + MIME: 36 +}; +exports.NUMBYTES = { + ZERO: 0, + ONE: 24, + TWO: 25, + FOUR: 26, + EIGHT: 27, + INDEFINITE: 31 +}; +exports.SIMPLE = { + FALSE: 20, + TRUE: 21, + NULL: 22, + UNDEFINED: 23 +}; +exports.SYMS = { + NULL: Symbol('null'), + UNDEFINED: Symbol('undef'), + PARENT: Symbol('parent'), + BREAK: Symbol('break'), + STREAM: Symbol('stream') +}; +exports.SHIFT32 = Math.pow(2, 32); +exports.SHIFT16 = Math.pow(2, 16); +exports.MAX_SAFE_HIGH = 0x1fffff; +exports.NEG_ONE = new Bignumber(-1); +exports.TEN = new Bignumber(10); +exports.TWO = new Bignumber(2); +exports.PARENT = { + ARRAY: 0, + OBJECT: 1, + MAP: 2, + TAG: 3, + BYTE_STRING: 4, + UTF8_STRING: 5 +}; + +/***/ }), +/* 67 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function Protocols(proto) { + if (typeof proto === 'number') { + if (Protocols.codes[proto]) { + return Protocols.codes[proto]; + } + + throw new Error('no protocol with code: ' + proto); + } else if (typeof proto === 'string' || proto instanceof String) { + if (Protocols.names[proto]) { + return Protocols.names[proto]; + } + + throw new Error('no protocol with name: ' + proto); + } + + throw new Error('invalid protocol id type: ' + proto); +} + +var V = -1; +Protocols.lengthPrefixedVarSize = V; +Protocols.V = V; +Protocols.table = [[4, 32, 'ip4'], [6, 16, 'tcp'], [33, 16, 'dccp'], [41, 128, 'ip6'], [42, V, 'ip6zone'], [53, V, 'dns', 'resolvable'], [54, V, 'dns4', 'resolvable'], [55, V, 'dns6', 'resolvable'], [56, V, 'dnsaddr', 'resolvable'], [132, 16, 'sctp'], [273, 16, 'udp'], [275, 0, 'p2p-webrtc-star'], [276, 0, 'p2p-webrtc-direct'], [277, 0, 'p2p-stardust'], [290, 0, 'p2p-circuit'], [301, 0, 'udt'], [302, 0, 'utp'], [400, V, 'unix', false, 'path'], // `p2p` is the preferred name for 421 +[421, V, 'p2p'], // `ipfs` has been added after `p2p` so that it is used by default. +// The reason for this is to provide better backwards support for +// code bases that do not yet support the `p2p` proto name. Eventually +// `p2p` should become the default. +[421, V, 'ipfs'], [443, 0, 'https'], [444, 96, 'onion'], [445, 296, 'onion3'], [446, V, 'garlic64'], [460, 0, 'quic'], [477, 0, 'ws'], [478, 0, 'wss'], [479, 0, 'p2p-websocket-star'], [480, 0, 'http']]; +Protocols.names = {}; +Protocols.codes = {}; // populate tables + +Protocols.table.map(function (row) { + var proto = p.apply(null, row); + Protocols.codes[proto.code] = proto; + Protocols.names[proto.name] = proto; +}); +Protocols.object = p; + +function p(code, size, name, resolvable, path) { + return { + code: code, + size: size, + name: name, + resolvable: Boolean(resolvable), + path: Boolean(path) + }; +} + +module.exports = Protocols; + +/***/ }), +/* 68 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) {// THIS FILE IS GENERATED, DO NO EDIT MANUALLY +// For more information see the README.md + +/* eslint-disable dot-notation */ + // serialization + +exports['protobuf'] = Buffer.from('50', 'hex'); +exports['cbor'] = Buffer.from('51', 'hex'); +exports['rlp'] = Buffer.from('60', 'hex'); +exports['bencode'] = Buffer.from('63', 'hex'); // multiformat + +exports['multicodec'] = Buffer.from('30', 'hex'); +exports['multihash'] = Buffer.from('31', 'hex'); +exports['multiaddr'] = Buffer.from('32', 'hex'); +exports['multibase'] = Buffer.from('33', 'hex'); // multihash + +exports['identity'] = Buffer.from('00', 'hex'); +exports['sha1'] = Buffer.from('11', 'hex'); +exports['sha2-256'] = Buffer.from('12', 'hex'); +exports['sha2-512'] = Buffer.from('13', 'hex'); +exports['sha3-512'] = Buffer.from('14', 'hex'); +exports['sha3-384'] = Buffer.from('15', 'hex'); +exports['sha3-256'] = Buffer.from('16', 'hex'); +exports['sha3-224'] = Buffer.from('17', 'hex'); +exports['shake-128'] = Buffer.from('18', 'hex'); +exports['shake-256'] = Buffer.from('19', 'hex'); +exports['keccak-224'] = Buffer.from('1a', 'hex'); +exports['keccak-256'] = Buffer.from('1b', 'hex'); +exports['keccak-384'] = Buffer.from('1c', 'hex'); +exports['keccak-512'] = Buffer.from('1d', 'hex'); +exports['murmur3-128'] = Buffer.from('22', 'hex'); +exports['murmur3-32'] = Buffer.from('23', 'hex'); +exports['dbl-sha2-256'] = Buffer.from('56', 'hex'); +exports['md4'] = Buffer.from('d4', 'hex'); +exports['md5'] = Buffer.from('d5', 'hex'); +exports['bmt'] = Buffer.from('d6', 'hex'); +exports['x11'] = Buffer.from('1100', 'hex'); +exports['blake2b-8'] = Buffer.from('b201', 'hex'); +exports['blake2b-16'] = Buffer.from('b202', 'hex'); +exports['blake2b-24'] = Buffer.from('b203', 'hex'); +exports['blake2b-32'] = Buffer.from('b204', 'hex'); +exports['blake2b-40'] = Buffer.from('b205', 'hex'); +exports['blake2b-48'] = Buffer.from('b206', 'hex'); +exports['blake2b-56'] = Buffer.from('b207', 'hex'); +exports['blake2b-64'] = Buffer.from('b208', 'hex'); +exports['blake2b-72'] = Buffer.from('b209', 'hex'); +exports['blake2b-80'] = Buffer.from('b20a', 'hex'); +exports['blake2b-88'] = Buffer.from('b20b', 'hex'); +exports['blake2b-96'] = Buffer.from('b20c', 'hex'); +exports['blake2b-104'] = Buffer.from('b20d', 'hex'); +exports['blake2b-112'] = Buffer.from('b20e', 'hex'); +exports['blake2b-120'] = Buffer.from('b20f', 'hex'); +exports['blake2b-128'] = Buffer.from('b210', 'hex'); +exports['blake2b-136'] = Buffer.from('b211', 'hex'); +exports['blake2b-144'] = Buffer.from('b212', 'hex'); +exports['blake2b-152'] = Buffer.from('b213', 'hex'); +exports['blake2b-160'] = Buffer.from('b214', 'hex'); +exports['blake2b-168'] = Buffer.from('b215', 'hex'); +exports['blake2b-176'] = Buffer.from('b216', 'hex'); +exports['blake2b-184'] = Buffer.from('b217', 'hex'); +exports['blake2b-192'] = Buffer.from('b218', 'hex'); +exports['blake2b-200'] = Buffer.from('b219', 'hex'); +exports['blake2b-208'] = Buffer.from('b21a', 'hex'); +exports['blake2b-216'] = Buffer.from('b21b', 'hex'); +exports['blake2b-224'] = Buffer.from('b21c', 'hex'); +exports['blake2b-232'] = Buffer.from('b21d', 'hex'); +exports['blake2b-240'] = Buffer.from('b21e', 'hex'); +exports['blake2b-248'] = Buffer.from('b21f', 'hex'); +exports['blake2b-256'] = Buffer.from('b220', 'hex'); +exports['blake2b-264'] = Buffer.from('b221', 'hex'); +exports['blake2b-272'] = Buffer.from('b222', 'hex'); +exports['blake2b-280'] = Buffer.from('b223', 'hex'); +exports['blake2b-288'] = Buffer.from('b224', 'hex'); +exports['blake2b-296'] = Buffer.from('b225', 'hex'); +exports['blake2b-304'] = Buffer.from('b226', 'hex'); +exports['blake2b-312'] = Buffer.from('b227', 'hex'); +exports['blake2b-320'] = Buffer.from('b228', 'hex'); +exports['blake2b-328'] = Buffer.from('b229', 'hex'); +exports['blake2b-336'] = Buffer.from('b22a', 'hex'); +exports['blake2b-344'] = Buffer.from('b22b', 'hex'); +exports['blake2b-352'] = Buffer.from('b22c', 'hex'); +exports['blake2b-360'] = Buffer.from('b22d', 'hex'); +exports['blake2b-368'] = Buffer.from('b22e', 'hex'); +exports['blake2b-376'] = Buffer.from('b22f', 'hex'); +exports['blake2b-384'] = Buffer.from('b230', 'hex'); +exports['blake2b-392'] = Buffer.from('b231', 'hex'); +exports['blake2b-400'] = Buffer.from('b232', 'hex'); +exports['blake2b-408'] = Buffer.from('b233', 'hex'); +exports['blake2b-416'] = Buffer.from('b234', 'hex'); +exports['blake2b-424'] = Buffer.from('b235', 'hex'); +exports['blake2b-432'] = Buffer.from('b236', 'hex'); +exports['blake2b-440'] = Buffer.from('b237', 'hex'); +exports['blake2b-448'] = Buffer.from('b238', 'hex'); +exports['blake2b-456'] = Buffer.from('b239', 'hex'); +exports['blake2b-464'] = Buffer.from('b23a', 'hex'); +exports['blake2b-472'] = Buffer.from('b23b', 'hex'); +exports['blake2b-480'] = Buffer.from('b23c', 'hex'); +exports['blake2b-488'] = Buffer.from('b23d', 'hex'); +exports['blake2b-496'] = Buffer.from('b23e', 'hex'); +exports['blake2b-504'] = Buffer.from('b23f', 'hex'); +exports['blake2b-512'] = Buffer.from('b240', 'hex'); +exports['blake2s-8'] = Buffer.from('b241', 'hex'); +exports['blake2s-16'] = Buffer.from('b242', 'hex'); +exports['blake2s-24'] = Buffer.from('b243', 'hex'); +exports['blake2s-32'] = Buffer.from('b244', 'hex'); +exports['blake2s-40'] = Buffer.from('b245', 'hex'); +exports['blake2s-48'] = Buffer.from('b246', 'hex'); +exports['blake2s-56'] = Buffer.from('b247', 'hex'); +exports['blake2s-64'] = Buffer.from('b248', 'hex'); +exports['blake2s-72'] = Buffer.from('b249', 'hex'); +exports['blake2s-80'] = Buffer.from('b24a', 'hex'); +exports['blake2s-88'] = Buffer.from('b24b', 'hex'); +exports['blake2s-96'] = Buffer.from('b24c', 'hex'); +exports['blake2s-104'] = Buffer.from('b24d', 'hex'); +exports['blake2s-112'] = Buffer.from('b24e', 'hex'); +exports['blake2s-120'] = Buffer.from('b24f', 'hex'); +exports['blake2s-128'] = Buffer.from('b250', 'hex'); +exports['blake2s-136'] = Buffer.from('b251', 'hex'); +exports['blake2s-144'] = Buffer.from('b252', 'hex'); +exports['blake2s-152'] = Buffer.from('b253', 'hex'); +exports['blake2s-160'] = Buffer.from('b254', 'hex'); +exports['blake2s-168'] = Buffer.from('b255', 'hex'); +exports['blake2s-176'] = Buffer.from('b256', 'hex'); +exports['blake2s-184'] = Buffer.from('b257', 'hex'); +exports['blake2s-192'] = Buffer.from('b258', 'hex'); +exports['blake2s-200'] = Buffer.from('b259', 'hex'); +exports['blake2s-208'] = Buffer.from('b25a', 'hex'); +exports['blake2s-216'] = Buffer.from('b25b', 'hex'); +exports['blake2s-224'] = Buffer.from('b25c', 'hex'); +exports['blake2s-232'] = Buffer.from('b25d', 'hex'); +exports['blake2s-240'] = Buffer.from('b25e', 'hex'); +exports['blake2s-248'] = Buffer.from('b25f', 'hex'); +exports['blake2s-256'] = Buffer.from('b260', 'hex'); +exports['skein256-8'] = Buffer.from('b301', 'hex'); +exports['skein256-16'] = Buffer.from('b302', 'hex'); +exports['skein256-24'] = Buffer.from('b303', 'hex'); +exports['skein256-32'] = Buffer.from('b304', 'hex'); +exports['skein256-40'] = Buffer.from('b305', 'hex'); +exports['skein256-48'] = Buffer.from('b306', 'hex'); +exports['skein256-56'] = Buffer.from('b307', 'hex'); +exports['skein256-64'] = Buffer.from('b308', 'hex'); +exports['skein256-72'] = Buffer.from('b309', 'hex'); +exports['skein256-80'] = Buffer.from('b30a', 'hex'); +exports['skein256-88'] = Buffer.from('b30b', 'hex'); +exports['skein256-96'] = Buffer.from('b30c', 'hex'); +exports['skein256-104'] = Buffer.from('b30d', 'hex'); +exports['skein256-112'] = Buffer.from('b30e', 'hex'); +exports['skein256-120'] = Buffer.from('b30f', 'hex'); +exports['skein256-128'] = Buffer.from('b310', 'hex'); +exports['skein256-136'] = Buffer.from('b311', 'hex'); +exports['skein256-144'] = Buffer.from('b312', 'hex'); +exports['skein256-152'] = Buffer.from('b313', 'hex'); +exports['skein256-160'] = Buffer.from('b314', 'hex'); +exports['skein256-168'] = Buffer.from('b315', 'hex'); +exports['skein256-176'] = Buffer.from('b316', 'hex'); +exports['skein256-184'] = Buffer.from('b317', 'hex'); +exports['skein256-192'] = Buffer.from('b318', 'hex'); +exports['skein256-200'] = Buffer.from('b319', 'hex'); +exports['skein256-208'] = Buffer.from('b31a', 'hex'); +exports['skein256-216'] = Buffer.from('b31b', 'hex'); +exports['skein256-224'] = Buffer.from('b31c', 'hex'); +exports['skein256-232'] = Buffer.from('b31d', 'hex'); +exports['skein256-240'] = Buffer.from('b31e', 'hex'); +exports['skein256-248'] = Buffer.from('b31f', 'hex'); +exports['skein256-256'] = Buffer.from('b320', 'hex'); +exports['skein512-8'] = Buffer.from('b321', 'hex'); +exports['skein512-16'] = Buffer.from('b322', 'hex'); +exports['skein512-24'] = Buffer.from('b323', 'hex'); +exports['skein512-32'] = Buffer.from('b324', 'hex'); +exports['skein512-40'] = Buffer.from('b325', 'hex'); +exports['skein512-48'] = Buffer.from('b326', 'hex'); +exports['skein512-56'] = Buffer.from('b327', 'hex'); +exports['skein512-64'] = Buffer.from('b328', 'hex'); +exports['skein512-72'] = Buffer.from('b329', 'hex'); +exports['skein512-80'] = Buffer.from('b32a', 'hex'); +exports['skein512-88'] = Buffer.from('b32b', 'hex'); +exports['skein512-96'] = Buffer.from('b32c', 'hex'); +exports['skein512-104'] = Buffer.from('b32d', 'hex'); +exports['skein512-112'] = Buffer.from('b32e', 'hex'); +exports['skein512-120'] = Buffer.from('b32f', 'hex'); +exports['skein512-128'] = Buffer.from('b330', 'hex'); +exports['skein512-136'] = Buffer.from('b331', 'hex'); +exports['skein512-144'] = Buffer.from('b332', 'hex'); +exports['skein512-152'] = Buffer.from('b333', 'hex'); +exports['skein512-160'] = Buffer.from('b334', 'hex'); +exports['skein512-168'] = Buffer.from('b335', 'hex'); +exports['skein512-176'] = Buffer.from('b336', 'hex'); +exports['skein512-184'] = Buffer.from('b337', 'hex'); +exports['skein512-192'] = Buffer.from('b338', 'hex'); +exports['skein512-200'] = Buffer.from('b339', 'hex'); +exports['skein512-208'] = Buffer.from('b33a', 'hex'); +exports['skein512-216'] = Buffer.from('b33b', 'hex'); +exports['skein512-224'] = Buffer.from('b33c', 'hex'); +exports['skein512-232'] = Buffer.from('b33d', 'hex'); +exports['skein512-240'] = Buffer.from('b33e', 'hex'); +exports['skein512-248'] = Buffer.from('b33f', 'hex'); +exports['skein512-256'] = Buffer.from('b340', 'hex'); +exports['skein512-264'] = Buffer.from('b341', 'hex'); +exports['skein512-272'] = Buffer.from('b342', 'hex'); +exports['skein512-280'] = Buffer.from('b343', 'hex'); +exports['skein512-288'] = Buffer.from('b344', 'hex'); +exports['skein512-296'] = Buffer.from('b345', 'hex'); +exports['skein512-304'] = Buffer.from('b346', 'hex'); +exports['skein512-312'] = Buffer.from('b347', 'hex'); +exports['skein512-320'] = Buffer.from('b348', 'hex'); +exports['skein512-328'] = Buffer.from('b349', 'hex'); +exports['skein512-336'] = Buffer.from('b34a', 'hex'); +exports['skein512-344'] = Buffer.from('b34b', 'hex'); +exports['skein512-352'] = Buffer.from('b34c', 'hex'); +exports['skein512-360'] = Buffer.from('b34d', 'hex'); +exports['skein512-368'] = Buffer.from('b34e', 'hex'); +exports['skein512-376'] = Buffer.from('b34f', 'hex'); +exports['skein512-384'] = Buffer.from('b350', 'hex'); +exports['skein512-392'] = Buffer.from('b351', 'hex'); +exports['skein512-400'] = Buffer.from('b352', 'hex'); +exports['skein512-408'] = Buffer.from('b353', 'hex'); +exports['skein512-416'] = Buffer.from('b354', 'hex'); +exports['skein512-424'] = Buffer.from('b355', 'hex'); +exports['skein512-432'] = Buffer.from('b356', 'hex'); +exports['skein512-440'] = Buffer.from('b357', 'hex'); +exports['skein512-448'] = Buffer.from('b358', 'hex'); +exports['skein512-456'] = Buffer.from('b359', 'hex'); +exports['skein512-464'] = Buffer.from('b35a', 'hex'); +exports['skein512-472'] = Buffer.from('b35b', 'hex'); +exports['skein512-480'] = Buffer.from('b35c', 'hex'); +exports['skein512-488'] = Buffer.from('b35d', 'hex'); +exports['skein512-496'] = Buffer.from('b35e', 'hex'); +exports['skein512-504'] = Buffer.from('b35f', 'hex'); +exports['skein512-512'] = Buffer.from('b360', 'hex'); +exports['skein1024-8'] = Buffer.from('b361', 'hex'); +exports['skein1024-16'] = Buffer.from('b362', 'hex'); +exports['skein1024-24'] = Buffer.from('b363', 'hex'); +exports['skein1024-32'] = Buffer.from('b364', 'hex'); +exports['skein1024-40'] = Buffer.from('b365', 'hex'); +exports['skein1024-48'] = Buffer.from('b366', 'hex'); +exports['skein1024-56'] = Buffer.from('b367', 'hex'); +exports['skein1024-64'] = Buffer.from('b368', 'hex'); +exports['skein1024-72'] = Buffer.from('b369', 'hex'); +exports['skein1024-80'] = Buffer.from('b36a', 'hex'); +exports['skein1024-88'] = Buffer.from('b36b', 'hex'); +exports['skein1024-96'] = Buffer.from('b36c', 'hex'); +exports['skein1024-104'] = Buffer.from('b36d', 'hex'); +exports['skein1024-112'] = Buffer.from('b36e', 'hex'); +exports['skein1024-120'] = Buffer.from('b36f', 'hex'); +exports['skein1024-128'] = Buffer.from('b370', 'hex'); +exports['skein1024-136'] = Buffer.from('b371', 'hex'); +exports['skein1024-144'] = Buffer.from('b372', 'hex'); +exports['skein1024-152'] = Buffer.from('b373', 'hex'); +exports['skein1024-160'] = Buffer.from('b374', 'hex'); +exports['skein1024-168'] = Buffer.from('b375', 'hex'); +exports['skein1024-176'] = Buffer.from('b376', 'hex'); +exports['skein1024-184'] = Buffer.from('b377', 'hex'); +exports['skein1024-192'] = Buffer.from('b378', 'hex'); +exports['skein1024-200'] = Buffer.from('b379', 'hex'); +exports['skein1024-208'] = Buffer.from('b37a', 'hex'); +exports['skein1024-216'] = Buffer.from('b37b', 'hex'); +exports['skein1024-224'] = Buffer.from('b37c', 'hex'); +exports['skein1024-232'] = Buffer.from('b37d', 'hex'); +exports['skein1024-240'] = Buffer.from('b37e', 'hex'); +exports['skein1024-248'] = Buffer.from('b37f', 'hex'); +exports['skein1024-256'] = Buffer.from('b380', 'hex'); +exports['skein1024-264'] = Buffer.from('b381', 'hex'); +exports['skein1024-272'] = Buffer.from('b382', 'hex'); +exports['skein1024-280'] = Buffer.from('b383', 'hex'); +exports['skein1024-288'] = Buffer.from('b384', 'hex'); +exports['skein1024-296'] = Buffer.from('b385', 'hex'); +exports['skein1024-304'] = Buffer.from('b386', 'hex'); +exports['skein1024-312'] = Buffer.from('b387', 'hex'); +exports['skein1024-320'] = Buffer.from('b388', 'hex'); +exports['skein1024-328'] = Buffer.from('b389', 'hex'); +exports['skein1024-336'] = Buffer.from('b38a', 'hex'); +exports['skein1024-344'] = Buffer.from('b38b', 'hex'); +exports['skein1024-352'] = Buffer.from('b38c', 'hex'); +exports['skein1024-360'] = Buffer.from('b38d', 'hex'); +exports['skein1024-368'] = Buffer.from('b38e', 'hex'); +exports['skein1024-376'] = Buffer.from('b38f', 'hex'); +exports['skein1024-384'] = Buffer.from('b390', 'hex'); +exports['skein1024-392'] = Buffer.from('b391', 'hex'); +exports['skein1024-400'] = Buffer.from('b392', 'hex'); +exports['skein1024-408'] = Buffer.from('b393', 'hex'); +exports['skein1024-416'] = Buffer.from('b394', 'hex'); +exports['skein1024-424'] = Buffer.from('b395', 'hex'); +exports['skein1024-432'] = Buffer.from('b396', 'hex'); +exports['skein1024-440'] = Buffer.from('b397', 'hex'); +exports['skein1024-448'] = Buffer.from('b398', 'hex'); +exports['skein1024-456'] = Buffer.from('b399', 'hex'); +exports['skein1024-464'] = Buffer.from('b39a', 'hex'); +exports['skein1024-472'] = Buffer.from('b39b', 'hex'); +exports['skein1024-480'] = Buffer.from('b39c', 'hex'); +exports['skein1024-488'] = Buffer.from('b39d', 'hex'); +exports['skein1024-496'] = Buffer.from('b39e', 'hex'); +exports['skein1024-504'] = Buffer.from('b39f', 'hex'); +exports['skein1024-512'] = Buffer.from('b3a0', 'hex'); +exports['skein1024-520'] = Buffer.from('b3a1', 'hex'); +exports['skein1024-528'] = Buffer.from('b3a2', 'hex'); +exports['skein1024-536'] = Buffer.from('b3a3', 'hex'); +exports['skein1024-544'] = Buffer.from('b3a4', 'hex'); +exports['skein1024-552'] = Buffer.from('b3a5', 'hex'); +exports['skein1024-560'] = Buffer.from('b3a6', 'hex'); +exports['skein1024-568'] = Buffer.from('b3a7', 'hex'); +exports['skein1024-576'] = Buffer.from('b3a8', 'hex'); +exports['skein1024-584'] = Buffer.from('b3a9', 'hex'); +exports['skein1024-592'] = Buffer.from('b3aa', 'hex'); +exports['skein1024-600'] = Buffer.from('b3ab', 'hex'); +exports['skein1024-608'] = Buffer.from('b3ac', 'hex'); +exports['skein1024-616'] = Buffer.from('b3ad', 'hex'); +exports['skein1024-624'] = Buffer.from('b3ae', 'hex'); +exports['skein1024-632'] = Buffer.from('b3af', 'hex'); +exports['skein1024-640'] = Buffer.from('b3b0', 'hex'); +exports['skein1024-648'] = Buffer.from('b3b1', 'hex'); +exports['skein1024-656'] = Buffer.from('b3b2', 'hex'); +exports['skein1024-664'] = Buffer.from('b3b3', 'hex'); +exports['skein1024-672'] = Buffer.from('b3b4', 'hex'); +exports['skein1024-680'] = Buffer.from('b3b5', 'hex'); +exports['skein1024-688'] = Buffer.from('b3b6', 'hex'); +exports['skein1024-696'] = Buffer.from('b3b7', 'hex'); +exports['skein1024-704'] = Buffer.from('b3b8', 'hex'); +exports['skein1024-712'] = Buffer.from('b3b9', 'hex'); +exports['skein1024-720'] = Buffer.from('b3ba', 'hex'); +exports['skein1024-728'] = Buffer.from('b3bb', 'hex'); +exports['skein1024-736'] = Buffer.from('b3bc', 'hex'); +exports['skein1024-744'] = Buffer.from('b3bd', 'hex'); +exports['skein1024-752'] = Buffer.from('b3be', 'hex'); +exports['skein1024-760'] = Buffer.from('b3bf', 'hex'); +exports['skein1024-768'] = Buffer.from('b3c0', 'hex'); +exports['skein1024-776'] = Buffer.from('b3c1', 'hex'); +exports['skein1024-784'] = Buffer.from('b3c2', 'hex'); +exports['skein1024-792'] = Buffer.from('b3c3', 'hex'); +exports['skein1024-800'] = Buffer.from('b3c4', 'hex'); +exports['skein1024-808'] = Buffer.from('b3c5', 'hex'); +exports['skein1024-816'] = Buffer.from('b3c6', 'hex'); +exports['skein1024-824'] = Buffer.from('b3c7', 'hex'); +exports['skein1024-832'] = Buffer.from('b3c8', 'hex'); +exports['skein1024-840'] = Buffer.from('b3c9', 'hex'); +exports['skein1024-848'] = Buffer.from('b3ca', 'hex'); +exports['skein1024-856'] = Buffer.from('b3cb', 'hex'); +exports['skein1024-864'] = Buffer.from('b3cc', 'hex'); +exports['skein1024-872'] = Buffer.from('b3cd', 'hex'); +exports['skein1024-880'] = Buffer.from('b3ce', 'hex'); +exports['skein1024-888'] = Buffer.from('b3cf', 'hex'); +exports['skein1024-896'] = Buffer.from('b3d0', 'hex'); +exports['skein1024-904'] = Buffer.from('b3d1', 'hex'); +exports['skein1024-912'] = Buffer.from('b3d2', 'hex'); +exports['skein1024-920'] = Buffer.from('b3d3', 'hex'); +exports['skein1024-928'] = Buffer.from('b3d4', 'hex'); +exports['skein1024-936'] = Buffer.from('b3d5', 'hex'); +exports['skein1024-944'] = Buffer.from('b3d6', 'hex'); +exports['skein1024-952'] = Buffer.from('b3d7', 'hex'); +exports['skein1024-960'] = Buffer.from('b3d8', 'hex'); +exports['skein1024-968'] = Buffer.from('b3d9', 'hex'); +exports['skein1024-976'] = Buffer.from('b3da', 'hex'); +exports['skein1024-984'] = Buffer.from('b3db', 'hex'); +exports['skein1024-992'] = Buffer.from('b3dc', 'hex'); +exports['skein1024-1000'] = Buffer.from('b3dd', 'hex'); +exports['skein1024-1008'] = Buffer.from('b3de', 'hex'); +exports['skein1024-1016'] = Buffer.from('b3df', 'hex'); +exports['skein1024-1024'] = Buffer.from('b3e0', 'hex'); // multiaddr + +exports['ip4'] = Buffer.from('04', 'hex'); +exports['tcp'] = Buffer.from('06', 'hex'); +exports['dccp'] = Buffer.from('21', 'hex'); +exports['ip6'] = Buffer.from('29', 'hex'); +exports['ip6zone'] = Buffer.from('2a', 'hex'); +exports['dns'] = Buffer.from('35', 'hex'); +exports['dns4'] = Buffer.from('36', 'hex'); +exports['dns6'] = Buffer.from('37', 'hex'); +exports['dnsaddr'] = Buffer.from('38', 'hex'); +exports['sctp'] = Buffer.from('84', 'hex'); +exports['udp'] = Buffer.from('0111', 'hex'); +exports['p2p-webrtc-star'] = Buffer.from('0113', 'hex'); +exports['p2p-webrtc-direct'] = Buffer.from('0114', 'hex'); +exports['p2p-stardust'] = Buffer.from('0115', 'hex'); +exports['p2p-circuit'] = Buffer.from('0122', 'hex'); +exports['udt'] = Buffer.from('012d', 'hex'); +exports['utp'] = Buffer.from('012e', 'hex'); +exports['unix'] = Buffer.from('0190', 'hex'); +exports['p2p'] = Buffer.from('01a5', 'hex'); +exports['ipfs'] = Buffer.from('01a5', 'hex'); +exports['https'] = Buffer.from('01bb', 'hex'); +exports['onion'] = Buffer.from('01bc', 'hex'); +exports['onion3'] = Buffer.from('01bd', 'hex'); +exports['garlic64'] = Buffer.from('01be', 'hex'); +exports['quic'] = Buffer.from('01cc', 'hex'); +exports['ws'] = Buffer.from('01dd', 'hex'); +exports['wss'] = Buffer.from('01de', 'hex'); +exports['p2p-websocket-star'] = Buffer.from('01df', 'hex'); +exports['http'] = Buffer.from('01e0', 'hex'); // ipld + +exports['raw'] = Buffer.from('55', 'hex'); +exports['dag-pb'] = Buffer.from('70', 'hex'); +exports['dag-cbor'] = Buffer.from('71', 'hex'); +exports['git-raw'] = Buffer.from('78', 'hex'); +exports['torrent-info'] = Buffer.from('7b', 'hex'); +exports['torrent-file'] = Buffer.from('7c', 'hex'); +exports['leofcoin-block'] = Buffer.from('81', 'hex'); +exports['leofcoin-tx'] = Buffer.from('82', 'hex'); +exports['leofcoin-pr'] = Buffer.from('83', 'hex'); +exports['eth-block'] = Buffer.from('90', 'hex'); +exports['eth-block-list'] = Buffer.from('91', 'hex'); +exports['eth-tx-trie'] = Buffer.from('92', 'hex'); +exports['eth-tx'] = Buffer.from('93', 'hex'); +exports['eth-tx-receipt-trie'] = Buffer.from('94', 'hex'); +exports['eth-tx-receipt'] = Buffer.from('95', 'hex'); +exports['eth-state-trie'] = Buffer.from('96', 'hex'); +exports['eth-account-snapshot'] = Buffer.from('97', 'hex'); +exports['eth-storage-trie'] = Buffer.from('98', 'hex'); +exports['bitcoin-block'] = Buffer.from('b0', 'hex'); +exports['bitcoin-tx'] = Buffer.from('b1', 'hex'); +exports['zcash-block'] = Buffer.from('c0', 'hex'); +exports['zcash-tx'] = Buffer.from('c1', 'hex'); +exports['stellar-block'] = Buffer.from('d0', 'hex'); +exports['stellar-tx'] = Buffer.from('d1', 'hex'); +exports['decred-block'] = Buffer.from('e0', 'hex'); +exports['decred-tx'] = Buffer.from('e1', 'hex'); +exports['dash-block'] = Buffer.from('f0', 'hex'); +exports['dash-tx'] = Buffer.from('f1', 'hex'); +exports['swarm-manifest'] = Buffer.from('fa', 'hex'); +exports['swarm-feed'] = Buffer.from('fb', 'hex'); +exports['dag-json'] = Buffer.from('0129', 'hex'); // namespace + +exports['path'] = Buffer.from('2f', 'hex'); +exports['ipld-ns'] = Buffer.from('e2', 'hex'); +exports['ipfs-ns'] = Buffer.from('e3', 'hex'); +exports['swarm-ns'] = Buffer.from('e4', 'hex'); // key + +exports['ed25519-pub'] = Buffer.from('ed', 'hex'); // holochain + +exports['holochain-adr-v0'] = Buffer.from('807124', 'hex'); +exports['holochain-adr-v1'] = Buffer.from('817124', 'hex'); +exports['holochain-key-v0'] = Buffer.from('947124', 'hex'); +exports['holochain-key-v1'] = Buffer.from('957124', 'hex'); +exports['holochain-sig-v0'] = Buffer.from('a27124', 'hex'); +exports['holochain-sig-v1'] = Buffer.from('a37124', 'hex'); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 69 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.defined = function (val) { + return val !== null && val !== undefined && (typeof val !== 'number' || !isNaN(val)); +}; + +/***/ }), +/* 70 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = "enum KeyType {\n RSA = 0;\n Ed25519 = 1;\n Secp256k1 = 2;\n}\nmessage PublicKey {\n required KeyType Type = 1;\n required bytes Data = 2;\n}\nmessage PrivateKey {\n required KeyType Type = 1;\n required bytes Data = 2;\n}"; + +/***/ }), +/* 71 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** + * Javascript implementation of Abstract Syntax Notation Number One. + * + * @author Dave Longley + * + * Copyright (c) 2010-2015 Digital Bazaar, Inc. + * + * An API for storing data using the Abstract Syntax Notation Number One + * format using DER (Distinguished Encoding Rules) encoding. This encoding is + * commonly used to store data for PKI, i.e. X.509 Certificates, and this + * implementation exists for that purpose. + * + * Abstract Syntax Notation Number One (ASN.1) is used to define the abstract + * syntax of information without restricting the way the information is encoded + * for transmission. It provides a standard that allows for open systems + * communication. ASN.1 defines the syntax of information data and a number of + * simple data types as well as a notation for describing them and specifying + * values for them. + * + * The RSA algorithm creates public and private keys that are often stored in + * X.509 or PKCS#X formats -- which use ASN.1 (encoded in DER format). This + * class provides the most basic functionality required to store and load DSA + * keys that are encoded according to ASN.1. + * + * The most common binary encodings for ASN.1 are BER (Basic Encoding Rules) + * and DER (Distinguished Encoding Rules). DER is just a subset of BER that + * has stricter requirements for how data must be encoded. + * + * Each ASN.1 structure has a tag (a byte identifying the ASN.1 structure type) + * and a byte array for the value of this ASN1 structure which may be data or a + * list of ASN.1 structures. + * + * Each ASN.1 structure using BER is (Tag-Length-Value): + * + * | byte 0 | bytes X | bytes Y | + * |--------|---------|---------- + * | tag | length | value | + * + * ASN.1 allows for tags to be of "High-tag-number form" which allows a tag to + * be two or more octets, but that is not supported by this class. A tag is + * only 1 byte. Bits 1-5 give the tag number (ie the data type within a + * particular 'class'), 6 indicates whether or not the ASN.1 value is + * constructed from other ASN.1 values, and bits 7 and 8 give the 'class'. If + * bits 7 and 8 are both zero, the class is UNIVERSAL. If only bit 7 is set, + * then the class is APPLICATION. If only bit 8 is set, then the class is + * CONTEXT_SPECIFIC. If both bits 7 and 8 are set, then the class is PRIVATE. + * The tag numbers for the data types for the class UNIVERSAL are listed below: + * + * UNIVERSAL 0 Reserved for use by the encoding rules + * UNIVERSAL 1 Boolean type + * UNIVERSAL 2 Integer type + * UNIVERSAL 3 Bitstring type + * UNIVERSAL 4 Octetstring type + * UNIVERSAL 5 Null type + * UNIVERSAL 6 Object identifier type + * UNIVERSAL 7 Object descriptor type + * UNIVERSAL 8 External type and Instance-of type + * UNIVERSAL 9 Real type + * UNIVERSAL 10 Enumerated type + * UNIVERSAL 11 Embedded-pdv type + * UNIVERSAL 12 UTF8String type + * UNIVERSAL 13 Relative object identifier type + * UNIVERSAL 14-15 Reserved for future editions + * UNIVERSAL 16 Sequence and Sequence-of types + * UNIVERSAL 17 Set and Set-of types + * UNIVERSAL 18-22, 25-30 Character string types + * UNIVERSAL 23-24 Time types + * + * The length of an ASN.1 structure is specified after the tag identifier. + * There is a definite form and an indefinite form. The indefinite form may + * be used if the encoding is constructed and not all immediately available. + * The indefinite form is encoded using a length byte with only the 8th bit + * set. The end of the constructed object is marked using end-of-contents + * octets (two zero bytes). + * + * The definite form looks like this: + * + * The length may take up 1 or more bytes, it depends on the length of the + * value of the ASN.1 structure. DER encoding requires that if the ASN.1 + * structure has a value that has a length greater than 127, more than 1 byte + * will be used to store its length, otherwise just one byte will be used. + * This is strict. + * + * In the case that the length of the ASN.1 value is less than 127, 1 octet + * (byte) is used to store the "short form" length. The 8th bit has a value of + * 0 indicating the length is "short form" and not "long form" and bits 7-1 + * give the length of the data. (The 8th bit is the left-most, most significant + * bit: also known as big endian or network format). + * + * In the case that the length of the ASN.1 value is greater than 127, 2 to + * 127 octets (bytes) are used to store the "long form" length. The first + * byte's 8th bit is set to 1 to indicate the length is "long form." Bits 7-1 + * give the number of additional octets. All following octets are in base 256 + * with the most significant digit first (typical big-endian binary unsigned + * integer storage). So, for instance, if the length of a value was 257, the + * first byte would be set to: + * + * 10000010 = 130 = 0x82. + * + * This indicates there are 2 octets (base 256) for the length. The second and + * third bytes (the octets just mentioned) would store the length in base 256: + * + * octet 2: 00000001 = 1 * 256^1 = 256 + * octet 3: 00000001 = 1 * 256^0 = 1 + * total = 257 + * + * The algorithm for converting a js integer value of 257 to base-256 is: + * + * var value = 257; + * var bytes = []; + * bytes[0] = (value >>> 8) & 0xFF; // most significant byte first + * bytes[1] = value & 0xFF; // least significant byte last + * + * On the ASN.1 UNIVERSAL Object Identifier (OID) type: + * + * An OID can be written like: "value1.value2.value3...valueN" + * + * The DER encoding rules: + * + * The first byte has the value 40 * value1 + value2. + * The following bytes, if any, encode the remaining values. Each value is + * encoded in base 128, most significant digit first (big endian), with as + * few digits as possible, and the most significant bit of each byte set + * to 1 except the last in each value's encoding. For example: Given the + * OID "1.2.840.113549", its DER encoding is (remember each byte except the + * last one in each encoding is OR'd with 0x80): + * + * byte 1: 40 * 1 + 2 = 42 = 0x2A. + * bytes 2-3: 128 * 6 + 72 = 840 = 6 72 = 6 72 = 0x0648 = 0x8648 + * bytes 4-6: 16384 * 6 + 128 * 119 + 13 = 6 119 13 = 0x06770D = 0x86F70D + * + * The final value is: 0x2A864886F70D. + * The full OID (including ASN.1 tag and length of 6 bytes) is: + * 0x06062A864886F70D + */ +var forge = __webpack_require__(8); + +__webpack_require__(9); + +__webpack_require__(72); +/* ASN.1 API */ + + +var asn1 = module.exports = forge.asn1 = forge.asn1 || {}; +/** + * ASN.1 classes. + */ + +asn1.Class = { + UNIVERSAL: 0x00, + APPLICATION: 0x40, + CONTEXT_SPECIFIC: 0x80, + PRIVATE: 0xC0 +}; +/** + * ASN.1 types. Not all types are supported by this implementation, only + * those necessary to implement a simple PKI are implemented. + */ + +asn1.Type = { + NONE: 0, + BOOLEAN: 1, + INTEGER: 2, + BITSTRING: 3, + OCTETSTRING: 4, + NULL: 5, + OID: 6, + ODESC: 7, + EXTERNAL: 8, + REAL: 9, + ENUMERATED: 10, + EMBEDDED: 11, + UTF8: 12, + ROID: 13, + SEQUENCE: 16, + SET: 17, + PRINTABLESTRING: 19, + IA5STRING: 22, + UTCTIME: 23, + GENERALIZEDTIME: 24, + BMPSTRING: 30 +}; +/** + * Creates a new asn1 object. + * + * @param tagClass the tag class for the object. + * @param type the data type (tag number) for the object. + * @param constructed true if the asn1 object is in constructed form. + * @param value the value for the object, if it is not constructed. + * @param [options] the options to use: + * [bitStringContents] the plain BIT STRING content including padding + * byte. + * + * @return the asn1 object. + */ + +asn1.create = function (tagClass, type, constructed, value, options) { + /* An asn1 object has a tagClass, a type, a constructed flag, and a + value. The value's type depends on the constructed flag. If + constructed, it will contain a list of other asn1 objects. If not, + it will contain the ASN.1 value as an array of bytes formatted + according to the ASN.1 data type. */ + // remove undefined values + if (forge.util.isArray(value)) { + var tmp = []; + + for (var i = 0; i < value.length; ++i) { + if (value[i] !== undefined) { + tmp.push(value[i]); + } + } + + value = tmp; + } + + var obj = { + tagClass: tagClass, + type: type, + constructed: constructed, + composed: constructed || forge.util.isArray(value), + value: value + }; + + if (options && 'bitStringContents' in options) { + // TODO: copy byte buffer if it's a buffer not a string + obj.bitStringContents = options.bitStringContents; // TODO: add readonly flag to avoid this overhead + // save copy to detect changes + + obj.original = asn1.copy(obj); + } + + return obj; +}; +/** + * Copies an asn1 object. + * + * @param obj the asn1 object. + * @param [options] copy options: + * [excludeBitStringContents] true to not copy bitStringContents + * + * @return the a copy of the asn1 object. + */ + + +asn1.copy = function (obj, options) { + var copy; + + if (forge.util.isArray(obj)) { + copy = []; + + for (var i = 0; i < obj.length; ++i) { + copy.push(asn1.copy(obj[i], options)); + } + + return copy; + } + + if (typeof obj === 'string') { + // TODO: copy byte buffer if it's a buffer not a string + return obj; + } + + copy = { + tagClass: obj.tagClass, + type: obj.type, + constructed: obj.constructed, + composed: obj.composed, + value: asn1.copy(obj.value, options) + }; + + if (options && !options.excludeBitStringContents) { + // TODO: copy byte buffer if it's a buffer not a string + copy.bitStringContents = obj.bitStringContents; + } + + return copy; +}; +/** + * Compares asn1 objects for equality. + * + * Note this function does not run in constant time. + * + * @param obj1 the first asn1 object. + * @param obj2 the second asn1 object. + * @param [options] compare options: + * [includeBitStringContents] true to compare bitStringContents + * + * @return true if the asn1 objects are equal. + */ + + +asn1.equals = function (obj1, obj2, options) { + if (forge.util.isArray(obj1)) { + if (!forge.util.isArray(obj2)) { + return false; + } + + if (obj1.length !== obj2.length) { + return false; + } + + for (var i = 0; i < obj1.length; ++i) { + if (!asn1.equals(obj1[i], obj2[i])) { + return false; + } + } + + return true; + } + + if (_typeof(obj1) !== _typeof(obj2)) { + return false; + } + + if (typeof obj1 === 'string') { + return obj1 === obj2; + } + + var equal = obj1.tagClass === obj2.tagClass && obj1.type === obj2.type && obj1.constructed === obj2.constructed && obj1.composed === obj2.composed && asn1.equals(obj1.value, obj2.value); + + if (options && options.includeBitStringContents) { + equal = equal && obj1.bitStringContents === obj2.bitStringContents; + } + + return equal; +}; +/** + * Gets the length of a BER-encoded ASN.1 value. + * + * In case the length is not specified, undefined is returned. + * + * @param b the BER-encoded ASN.1 byte buffer, starting with the first + * length byte. + * + * @return the length of the BER-encoded ASN.1 value or undefined. + */ + + +asn1.getBerValueLength = function (b) { + // TODO: move this function and related DER/BER functions to a der.js + // file; better abstract ASN.1 away from der/ber. + var b2 = b.getByte(); + + if (b2 === 0x80) { + return undefined; + } // see if the length is "short form" or "long form" (bit 8 set) + + + var length; + var longForm = b2 & 0x80; + + if (!longForm) { + // length is just the first byte + length = b2; + } else { + // the number of bytes the length is specified in bits 7 through 1 + // and each length byte is in big-endian base-256 + length = b.getInt((b2 & 0x7F) << 3); + } + + return length; +}; +/** + * Check if the byte buffer has enough bytes. Throws an Error if not. + * + * @param bytes the byte buffer to parse from. + * @param remaining the bytes remaining in the current parsing state. + * @param n the number of bytes the buffer must have. + */ + + +function _checkBufferLength(bytes, remaining, n) { + if (n > remaining) { + var error = new Error('Too few bytes to parse DER.'); + error.available = bytes.length(); + error.remaining = remaining; + error.requested = n; + throw error; + } +} +/** + * Gets the length of a BER-encoded ASN.1 value. + * + * In case the length is not specified, undefined is returned. + * + * @param bytes the byte buffer to parse from. + * @param remaining the bytes remaining in the current parsing state. + * + * @return the length of the BER-encoded ASN.1 value or undefined. + */ + + +var _getValueLength = function _getValueLength(bytes, remaining) { + // TODO: move this function and related DER/BER functions to a der.js + // file; better abstract ASN.1 away from der/ber. + // fromDer already checked that this byte exists + var b2 = bytes.getByte(); + remaining--; + + if (b2 === 0x80) { + return undefined; + } // see if the length is "short form" or "long form" (bit 8 set) + + + var length; + var longForm = b2 & 0x80; + + if (!longForm) { + // length is just the first byte + length = b2; + } else { + // the number of bytes the length is specified in bits 7 through 1 + // and each length byte is in big-endian base-256 + var longFormBytes = b2 & 0x7F; + + _checkBufferLength(bytes, remaining, longFormBytes); + + length = bytes.getInt(longFormBytes << 3); + } // FIXME: this will only happen for 32 bit getInt with high bit set + + + if (length < 0) { + throw new Error('Negative length: ' + length); + } + + return length; +}; +/** + * Parses an asn1 object from a byte buffer in DER format. + * + * @param bytes the byte buffer to parse from. + * @param [strict] true to be strict when checking value lengths, false to + * allow truncated values (default: true). + * @param [options] object with options or boolean strict flag + * [strict] true to be strict when checking value lengths, false to + * allow truncated values (default: true). + * [decodeBitStrings] true to attempt to decode the content of + * BIT STRINGs (not OCTET STRINGs) using strict mode. Note that + * without schema support to understand the data context this can + * erroneously decode values that happen to be valid ASN.1. This + * flag will be deprecated or removed as soon as schema support is + * available. (default: true) + * + * @return the parsed asn1 object. + */ + + +asn1.fromDer = function (bytes, options) { + if (options === undefined) { + options = { + strict: true, + decodeBitStrings: true + }; + } + + if (typeof options === 'boolean') { + options = { + strict: options, + decodeBitStrings: true + }; + } + + if (!('strict' in options)) { + options.strict = true; + } + + if (!('decodeBitStrings' in options)) { + options.decodeBitStrings = true; + } // wrap in buffer if needed + + + if (typeof bytes === 'string') { + bytes = forge.util.createBuffer(bytes); + } + + return _fromDer(bytes, bytes.length(), 0, options); +}; +/** + * Internal function to parse an asn1 object from a byte buffer in DER format. + * + * @param bytes the byte buffer to parse from. + * @param remaining the number of bytes remaining for this chunk. + * @param depth the current parsing depth. + * @param options object with same options as fromDer(). + * + * @return the parsed asn1 object. + */ + + +function _fromDer(bytes, remaining, depth, options) { + // temporary storage for consumption calculations + var start; // minimum length for ASN.1 DER structure is 2 + + _checkBufferLength(bytes, remaining, 2); // get the first byte + + + var b1 = bytes.getByte(); // consumed one byte + + remaining--; // get the tag class + + var tagClass = b1 & 0xC0; // get the type (bits 1-5) + + var type = b1 & 0x1F; // get the variable value length and adjust remaining bytes + + start = bytes.length(); + + var length = _getValueLength(bytes, remaining); + + remaining -= start - bytes.length(); // ensure there are enough bytes to get the value + + if (length !== undefined && length > remaining) { + if (options.strict) { + var error = new Error('Too few bytes to read ASN.1 value.'); + error.available = bytes.length(); + error.remaining = remaining; + error.requested = length; + throw error; + } // Note: be lenient with truncated values and use remaining state bytes + + + length = remaining; + } // value storage + + + var value; // possible BIT STRING contents storage + + var bitStringContents; // constructed flag is bit 6 (32 = 0x20) of the first byte + + var constructed = (b1 & 0x20) === 0x20; + + if (constructed) { + // parse child asn1 objects from the value + value = []; + + if (length === undefined) { + // asn1 object of indefinite length, read until end tag + for (;;) { + _checkBufferLength(bytes, remaining, 2); + + if (bytes.bytes(2) === String.fromCharCode(0, 0)) { + bytes.getBytes(2); + remaining -= 2; + break; + } + + start = bytes.length(); + value.push(_fromDer(bytes, remaining, depth + 1, options)); + remaining -= start - bytes.length(); + } + } else { + // parsing asn1 object of definite length + while (length > 0) { + start = bytes.length(); + value.push(_fromDer(bytes, length, depth + 1, options)); + remaining -= start - bytes.length(); + length -= start - bytes.length(); + } + } + } // if a BIT STRING, save the contents including padding + + + if (value === undefined && tagClass === asn1.Class.UNIVERSAL && type === asn1.Type.BITSTRING) { + bitStringContents = bytes.bytes(length); + } // determine if a non-constructed value should be decoded as a composed + // value that contains other ASN.1 objects. BIT STRINGs (and OCTET STRINGs) + // can be used this way. + + + if (value === undefined && options.decodeBitStrings && tagClass === asn1.Class.UNIVERSAL && // FIXME: OCTET STRINGs not yet supported here + // .. other parts of forge expect to decode OCTET STRINGs manually + type === asn1.Type.BITSTRING + /*|| type === asn1.Type.OCTETSTRING*/ + && length > 1) { + // save read position + var savedRead = bytes.read; + var savedRemaining = remaining; + var unused = 0; + + if (type === asn1.Type.BITSTRING) { + /* The first octet gives the number of bits by which the length of the + bit string is less than the next multiple of eight (this is called + the "number of unused bits"). + The second and following octets give the value of the bit string + converted to an octet string. */ + _checkBufferLength(bytes, remaining, 1); + + unused = bytes.getByte(); + remaining--; + } // if all bits are used, maybe the BIT/OCTET STRING holds ASN.1 objs + + + if (unused === 0) { + try { + // attempt to parse child asn1 object from the value + // (stored in array to signal composed value) + start = bytes.length(); + var subOptions = { + // enforce strict mode to avoid parsing ASN.1 from plain data + verbose: options.verbose, + strict: true, + decodeBitStrings: true + }; + + var composed = _fromDer(bytes, remaining, depth + 1, subOptions); + + var used = start - bytes.length(); + remaining -= used; + + if (type == asn1.Type.BITSTRING) { + used++; + } // if the data all decoded and the class indicates UNIVERSAL or + // CONTEXT_SPECIFIC then assume we've got an encapsulated ASN.1 object + + + var tc = composed.tagClass; + + if (used === length && (tc === asn1.Class.UNIVERSAL || tc === asn1.Class.CONTEXT_SPECIFIC)) { + value = [composed]; + } + } catch (ex) {} + } + + if (value === undefined) { + // restore read position + bytes.read = savedRead; + remaining = savedRemaining; + } + } + + if (value === undefined) { + // asn1 not constructed or composed, get raw value + // TODO: do DER to OID conversion and vice-versa in .toDer? + if (length === undefined) { + if (options.strict) { + throw new Error('Non-constructed ASN.1 object of indefinite length.'); + } // be lenient and use remaining state bytes + + + length = remaining; + } + + if (type === asn1.Type.BMPSTRING) { + value = ''; + + for (; length > 0; length -= 2) { + _checkBufferLength(bytes, remaining, 2); + + value += String.fromCharCode(bytes.getInt16()); + remaining -= 2; + } + } else { + value = bytes.getBytes(length); + } + } // add BIT STRING contents if available + + + var asn1Options = bitStringContents === undefined ? null : { + bitStringContents: bitStringContents + }; // create and return asn1 object + + return asn1.create(tagClass, type, constructed, value, asn1Options); +} +/** + * Converts the given asn1 object to a buffer of bytes in DER format. + * + * @param asn1 the asn1 object to convert to bytes. + * + * @return the buffer of bytes. + */ + + +asn1.toDer = function (obj) { + var bytes = forge.util.createBuffer(); // build the first byte + + var b1 = obj.tagClass | obj.type; // for storing the ASN.1 value + + var value = forge.util.createBuffer(); // use BIT STRING contents if available and data not changed + + var useBitStringContents = false; + + if ('bitStringContents' in obj) { + useBitStringContents = true; + + if (obj.original) { + useBitStringContents = asn1.equals(obj, obj.original); + } + } + + if (useBitStringContents) { + value.putBytes(obj.bitStringContents); + } else if (obj.composed) { + // if composed, use each child asn1 object's DER bytes as value + // turn on 6th bit (0x20 = 32) to indicate asn1 is constructed + // from other asn1 objects + if (obj.constructed) { + b1 |= 0x20; + } else { + // type is a bit string, add unused bits of 0x00 + value.putByte(0x00); + } // add all of the child DER bytes together + + + for (var i = 0; i < obj.value.length; ++i) { + if (obj.value[i] !== undefined) { + value.putBuffer(asn1.toDer(obj.value[i])); + } + } + } else { + // use asn1.value directly + if (obj.type === asn1.Type.BMPSTRING) { + for (var i = 0; i < obj.value.length; ++i) { + value.putInt16(obj.value.charCodeAt(i)); + } + } else { + // ensure integer is minimally-encoded + // TODO: should all leading bytes be stripped vs just one? + // .. ex '00 00 01' => '01'? + if (obj.type === asn1.Type.INTEGER && obj.value.length > 1 && ( // leading 0x00 for positive integer + obj.value.charCodeAt(0) === 0 && (obj.value.charCodeAt(1) & 0x80) === 0 || // leading 0xFF for negative integer + obj.value.charCodeAt(0) === 0xFF && (obj.value.charCodeAt(1) & 0x80) === 0x80)) { + value.putBytes(obj.value.substr(1)); + } else { + value.putBytes(obj.value); + } + } + } // add tag byte + + + bytes.putByte(b1); // use "short form" encoding + + if (value.length() <= 127) { + // one byte describes the length + // bit 8 = 0 and bits 7-1 = length + bytes.putByte(value.length() & 0x7F); + } else { + // use "long form" encoding + // 2 to 127 bytes describe the length + // first byte: bit 8 = 1 and bits 7-1 = # of additional bytes + // other bytes: length in base 256, big-endian + var len = value.length(); + var lenBytes = ''; + + do { + lenBytes += String.fromCharCode(len & 0xFF); + len = len >>> 8; + } while (len > 0); // set first byte to # bytes used to store the length and turn on + // bit 8 to indicate long-form length is used + + + bytes.putByte(lenBytes.length | 0x80); // concatenate length bytes in reverse since they were generated + // little endian and we need big endian + + for (var i = lenBytes.length - 1; i >= 0; --i) { + bytes.putByte(lenBytes.charCodeAt(i)); + } + } // concatenate value bytes + + + bytes.putBuffer(value); + return bytes; +}; +/** + * Converts an OID dot-separated string to a byte buffer. The byte buffer + * contains only the DER-encoded value, not any tag or length bytes. + * + * @param oid the OID dot-separated string. + * + * @return the byte buffer. + */ + + +asn1.oidToDer = function (oid) { + // split OID into individual values + var values = oid.split('.'); + var bytes = forge.util.createBuffer(); // first byte is 40 * value1 + value2 + + bytes.putByte(40 * parseInt(values[0], 10) + parseInt(values[1], 10)); // other bytes are each value in base 128 with 8th bit set except for + // the last byte for each value + + var last, valueBytes, value, b; + + for (var i = 2; i < values.length; ++i) { + // produce value bytes in reverse because we don't know how many + // bytes it will take to store the value + last = true; + valueBytes = []; + value = parseInt(values[i], 10); + + do { + b = value & 0x7F; + value = value >>> 7; // if value is not last, then turn on 8th bit + + if (!last) { + b |= 0x80; + } + + valueBytes.push(b); + last = false; + } while (value > 0); // add value bytes in reverse (needs to be in big endian) + + + for (var n = valueBytes.length - 1; n >= 0; --n) { + bytes.putByte(valueBytes[n]); + } + } + + return bytes; +}; +/** + * Converts a DER-encoded byte buffer to an OID dot-separated string. The + * byte buffer should contain only the DER-encoded value, not any tag or + * length bytes. + * + * @param bytes the byte buffer. + * + * @return the OID dot-separated string. + */ + + +asn1.derToOid = function (bytes) { + var oid; // wrap in buffer if needed + + if (typeof bytes === 'string') { + bytes = forge.util.createBuffer(bytes); + } // first byte is 40 * value1 + value2 + + + var b = bytes.getByte(); + oid = Math.floor(b / 40) + '.' + b % 40; // other bytes are each value in base 128 with 8th bit set except for + // the last byte for each value + + var value = 0; + + while (bytes.length() > 0) { + b = bytes.getByte(); + value = value << 7; // not the last byte for the value + + if (b & 0x80) { + value += b & 0x7F; + } else { + // last byte + oid += '.' + (value + b); + value = 0; + } + } + + return oid; +}; +/** + * Converts a UTCTime value to a date. + * + * Note: GeneralizedTime has 4 digits for the year and is used for X.509 + * dates past 2049. Parsing that structure hasn't been implemented yet. + * + * @param utc the UTCTime value to convert. + * + * @return the date. + */ + + +asn1.utcTimeToDate = function (utc) { + /* The following formats can be used: + YYMMDDhhmmZ + YYMMDDhhmm+hh'mm' + YYMMDDhhmm-hh'mm' + YYMMDDhhmmssZ + YYMMDDhhmmss+hh'mm' + YYMMDDhhmmss-hh'mm' + Where: + YY is the least significant two digits of the year + MM is the month (01 to 12) + DD is the day (01 to 31) + hh is the hour (00 to 23) + mm are the minutes (00 to 59) + ss are the seconds (00 to 59) + Z indicates that local time is GMT, + indicates that local time is + later than GMT, and - indicates that local time is earlier than GMT + hh' is the absolute value of the offset from GMT in hours + mm' is the absolute value of the offset from GMT in minutes */ + var date = new Date(); // if YY >= 50 use 19xx, if YY < 50 use 20xx + + var year = parseInt(utc.substr(0, 2), 10); + year = year >= 50 ? 1900 + year : 2000 + year; + var MM = parseInt(utc.substr(2, 2), 10) - 1; // use 0-11 for month + + var DD = parseInt(utc.substr(4, 2), 10); + var hh = parseInt(utc.substr(6, 2), 10); + var mm = parseInt(utc.substr(8, 2), 10); + var ss = 0; // not just YYMMDDhhmmZ + + if (utc.length > 11) { + // get character after minutes + var c = utc.charAt(10); + var end = 10; // see if seconds are present + + if (c !== '+' && c !== '-') { + // get seconds + ss = parseInt(utc.substr(10, 2), 10); + end += 2; + } + } // update date + + + date.setUTCFullYear(year, MM, DD); + date.setUTCHours(hh, mm, ss, 0); + + if (end) { + // get +/- after end of time + c = utc.charAt(end); + + if (c === '+' || c === '-') { + // get hours+minutes offset + var hhoffset = parseInt(utc.substr(end + 1, 2), 10); + var mmoffset = parseInt(utc.substr(end + 4, 2), 10); // calculate offset in milliseconds + + var offset = hhoffset * 60 + mmoffset; + offset *= 60000; // apply offset + + if (c === '+') { + date.setTime(+date - offset); + } else { + date.setTime(+date + offset); + } + } + } + + return date; +}; +/** + * Converts a GeneralizedTime value to a date. + * + * @param gentime the GeneralizedTime value to convert. + * + * @return the date. + */ + + +asn1.generalizedTimeToDate = function (gentime) { + /* The following formats can be used: + YYYYMMDDHHMMSS + YYYYMMDDHHMMSS.fff + YYYYMMDDHHMMSSZ + YYYYMMDDHHMMSS.fffZ + YYYYMMDDHHMMSS+hh'mm' + YYYYMMDDHHMMSS.fff+hh'mm' + YYYYMMDDHHMMSS-hh'mm' + YYYYMMDDHHMMSS.fff-hh'mm' + Where: + YYYY is the year + MM is the month (01 to 12) + DD is the day (01 to 31) + hh is the hour (00 to 23) + mm are the minutes (00 to 59) + ss are the seconds (00 to 59) + .fff is the second fraction, accurate to three decimal places + Z indicates that local time is GMT, + indicates that local time is + later than GMT, and - indicates that local time is earlier than GMT + hh' is the absolute value of the offset from GMT in hours + mm' is the absolute value of the offset from GMT in minutes */ + var date = new Date(); + var YYYY = parseInt(gentime.substr(0, 4), 10); + var MM = parseInt(gentime.substr(4, 2), 10) - 1; // use 0-11 for month + + var DD = parseInt(gentime.substr(6, 2), 10); + var hh = parseInt(gentime.substr(8, 2), 10); + var mm = parseInt(gentime.substr(10, 2), 10); + var ss = parseInt(gentime.substr(12, 2), 10); + var fff = 0; + var offset = 0; + var isUTC = false; + + if (gentime.charAt(gentime.length - 1) === 'Z') { + isUTC = true; + } + + var end = gentime.length - 5, + c = gentime.charAt(end); + + if (c === '+' || c === '-') { + // get hours+minutes offset + var hhoffset = parseInt(gentime.substr(end + 1, 2), 10); + var mmoffset = parseInt(gentime.substr(end + 4, 2), 10); // calculate offset in milliseconds + + offset = hhoffset * 60 + mmoffset; + offset *= 60000; // apply offset + + if (c === '+') { + offset *= -1; + } + + isUTC = true; + } // check for second fraction + + + if (gentime.charAt(14) === '.') { + fff = parseFloat(gentime.substr(14), 10) * 1000; + } + + if (isUTC) { + date.setUTCFullYear(YYYY, MM, DD); + date.setUTCHours(hh, mm, ss, fff); // apply offset + + date.setTime(+date + offset); + } else { + date.setFullYear(YYYY, MM, DD); + date.setHours(hh, mm, ss, fff); + } + + return date; +}; +/** + * Converts a date to a UTCTime value. + * + * Note: GeneralizedTime has 4 digits for the year and is used for X.509 + * dates past 2049. Converting to a GeneralizedTime hasn't been + * implemented yet. + * + * @param date the date to convert. + * + * @return the UTCTime value. + */ + + +asn1.dateToUtcTime = function (date) { + // TODO: validate; currently assumes proper format + if (typeof date === 'string') { + return date; + } + + var rval = ''; // create format YYMMDDhhmmssZ + + var format = []; + format.push(('' + date.getUTCFullYear()).substr(2)); + format.push('' + (date.getUTCMonth() + 1)); + format.push('' + date.getUTCDate()); + format.push('' + date.getUTCHours()); + format.push('' + date.getUTCMinutes()); + format.push('' + date.getUTCSeconds()); // ensure 2 digits are used for each format entry + + for (var i = 0; i < format.length; ++i) { + if (format[i].length < 2) { + rval += '0'; + } + + rval += format[i]; + } + + rval += 'Z'; + return rval; +}; +/** + * Converts a date to a GeneralizedTime value. + * + * @param date the date to convert. + * + * @return the GeneralizedTime value as a string. + */ + + +asn1.dateToGeneralizedTime = function (date) { + // TODO: validate; currently assumes proper format + if (typeof date === 'string') { + return date; + } + + var rval = ''; // create format YYYYMMDDHHMMSSZ + + var format = []; + format.push('' + date.getUTCFullYear()); + format.push('' + (date.getUTCMonth() + 1)); + format.push('' + date.getUTCDate()); + format.push('' + date.getUTCHours()); + format.push('' + date.getUTCMinutes()); + format.push('' + date.getUTCSeconds()); // ensure 2 digits are used for each format entry + + for (var i = 0; i < format.length; ++i) { + if (format[i].length < 2) { + rval += '0'; + } + + rval += format[i]; + } + + rval += 'Z'; + return rval; +}; +/** + * Converts a javascript integer to a DER-encoded byte buffer to be used + * as the value for an INTEGER type. + * + * @param x the integer. + * + * @return the byte buffer. + */ + + +asn1.integerToDer = function (x) { + var rval = forge.util.createBuffer(); + + if (x >= -0x80 && x < 0x80) { + return rval.putSignedInt(x, 8); + } + + if (x >= -0x8000 && x < 0x8000) { + return rval.putSignedInt(x, 16); + } + + if (x >= -0x800000 && x < 0x800000) { + return rval.putSignedInt(x, 24); + } + + if (x >= -0x80000000 && x < 0x80000000) { + return rval.putSignedInt(x, 32); + } + + var error = new Error('Integer too large; max is 32-bits.'); + error.integer = x; + throw error; +}; +/** + * Converts a DER-encoded byte buffer to a javascript integer. This is + * typically used to decode the value of an INTEGER type. + * + * @param bytes the byte buffer. + * + * @return the integer. + */ + + +asn1.derToInteger = function (bytes) { + // wrap in buffer if needed + if (typeof bytes === 'string') { + bytes = forge.util.createBuffer(bytes); + } + + var n = bytes.length() * 8; + + if (n > 32) { + throw new Error('Integer too large; max is 32-bits.'); + } + + return bytes.getSignedInt(n); +}; +/** + * Validates that the given ASN.1 object is at least a super set of the + * given ASN.1 structure. Only tag classes and types are checked. An + * optional map may also be provided to capture ASN.1 values while the + * structure is checked. + * + * To capture an ASN.1 value, set an object in the validator's 'capture' + * parameter to the key to use in the capture map. To capture the full + * ASN.1 object, specify 'captureAsn1'. To capture BIT STRING bytes, including + * the leading unused bits counter byte, specify 'captureBitStringContents'. + * To capture BIT STRING bytes, without the leading unused bits counter byte, + * specify 'captureBitStringValue'. + * + * Objects in the validator may set a field 'optional' to true to indicate + * that it isn't necessary to pass validation. + * + * @param obj the ASN.1 object to validate. + * @param v the ASN.1 structure validator. + * @param capture an optional map to capture values in. + * @param errors an optional array for storing validation errors. + * + * @return true on success, false on failure. + */ + + +asn1.validate = function (obj, v, capture, errors) { + var rval = false; // ensure tag class and type are the same if specified + + if ((obj.tagClass === v.tagClass || typeof v.tagClass === 'undefined') && (obj.type === v.type || typeof v.type === 'undefined')) { + // ensure constructed flag is the same if specified + if (obj.constructed === v.constructed || typeof v.constructed === 'undefined') { + rval = true; // handle sub values + + if (v.value && forge.util.isArray(v.value)) { + var j = 0; + + for (var i = 0; rval && i < v.value.length; ++i) { + rval = v.value[i].optional || false; + + if (obj.value[j]) { + rval = asn1.validate(obj.value[j], v.value[i], capture, errors); + + if (rval) { + ++j; + } else if (v.value[i].optional) { + rval = true; + } + } + + if (!rval && errors) { + errors.push('[' + v.name + '] ' + 'Tag class "' + v.tagClass + '", type "' + v.type + '" expected value length "' + v.value.length + '", got "' + obj.value.length + '"'); + } + } + } + + if (rval && capture) { + if (v.capture) { + capture[v.capture] = obj.value; + } + + if (v.captureAsn1) { + capture[v.captureAsn1] = obj; + } + + if (v.captureBitStringContents && 'bitStringContents' in obj) { + capture[v.captureBitStringContents] = obj.bitStringContents; + } + + if (v.captureBitStringValue && 'bitStringContents' in obj) { + var value; + + if (obj.bitStringContents.length < 2) { + capture[v.captureBitStringValue] = ''; + } else { + // FIXME: support unused bits with data shifting + var unused = obj.bitStringContents.charCodeAt(0); + + if (unused !== 0) { + throw new Error('captureBitStringValue only supported for zero unused bits'); + } + + capture[v.captureBitStringValue] = obj.bitStringContents.slice(1); + } + } + } + } else if (errors) { + errors.push('[' + v.name + '] ' + 'Expected constructed "' + v.constructed + '", got "' + obj.constructed + '"'); + } + } else if (errors) { + if (obj.tagClass !== v.tagClass) { + errors.push('[' + v.name + '] ' + 'Expected tag class "' + v.tagClass + '", got "' + obj.tagClass + '"'); + } + + if (obj.type !== v.type) { + errors.push('[' + v.name + '] ' + 'Expected type "' + v.type + '", got "' + obj.type + '"'); + } + } + + return rval; +}; // regex for testing for non-latin characters + + +var _nonLatinRegex = /[^\\u0000-\\u00ff]/; +/** + * Pretty prints an ASN.1 object to a string. + * + * @param obj the object to write out. + * @param level the level in the tree. + * @param indentation the indentation to use. + * + * @return the string. + */ + +asn1.prettyPrint = function (obj, level, indentation) { + var rval = ''; // set default level and indentation + + level = level || 0; + indentation = indentation || 2; // start new line for deep levels + + if (level > 0) { + rval += '\n'; + } // create indent + + + var indent = ''; + + for (var i = 0; i < level * indentation; ++i) { + indent += ' '; + } // print class:type + + + rval += indent + 'Tag: '; + + switch (obj.tagClass) { + case asn1.Class.UNIVERSAL: + rval += 'Universal:'; + break; + + case asn1.Class.APPLICATION: + rval += 'Application:'; + break; + + case asn1.Class.CONTEXT_SPECIFIC: + rval += 'Context-Specific:'; + break; + + case asn1.Class.PRIVATE: + rval += 'Private:'; + break; + } + + if (obj.tagClass === asn1.Class.UNIVERSAL) { + rval += obj.type; // known types + + switch (obj.type) { + case asn1.Type.NONE: + rval += ' (None)'; + break; + + case asn1.Type.BOOLEAN: + rval += ' (Boolean)'; + break; + + case asn1.Type.INTEGER: + rval += ' (Integer)'; + break; + + case asn1.Type.BITSTRING: + rval += ' (Bit string)'; + break; + + case asn1.Type.OCTETSTRING: + rval += ' (Octet string)'; + break; + + case asn1.Type.NULL: + rval += ' (Null)'; + break; + + case asn1.Type.OID: + rval += ' (Object Identifier)'; + break; + + case asn1.Type.ODESC: + rval += ' (Object Descriptor)'; + break; + + case asn1.Type.EXTERNAL: + rval += ' (External or Instance of)'; + break; + + case asn1.Type.REAL: + rval += ' (Real)'; + break; + + case asn1.Type.ENUMERATED: + rval += ' (Enumerated)'; + break; + + case asn1.Type.EMBEDDED: + rval += ' (Embedded PDV)'; + break; + + case asn1.Type.UTF8: + rval += ' (UTF8)'; + break; + + case asn1.Type.ROID: + rval += ' (Relative Object Identifier)'; + break; + + case asn1.Type.SEQUENCE: + rval += ' (Sequence)'; + break; + + case asn1.Type.SET: + rval += ' (Set)'; + break; + + case asn1.Type.PRINTABLESTRING: + rval += ' (Printable String)'; + break; + + case asn1.Type.IA5String: + rval += ' (IA5String (ASCII))'; + break; + + case asn1.Type.UTCTIME: + rval += ' (UTC time)'; + break; + + case asn1.Type.GENERALIZEDTIME: + rval += ' (Generalized time)'; + break; + + case asn1.Type.BMPSTRING: + rval += ' (BMP String)'; + break; + } + } else { + rval += obj.type; + } + + rval += '\n'; + rval += indent + 'Constructed: ' + obj.constructed + '\n'; + + if (obj.composed) { + var subvalues = 0; + var sub = ''; + + for (var i = 0; i < obj.value.length; ++i) { + if (obj.value[i] !== undefined) { + subvalues += 1; + sub += asn1.prettyPrint(obj.value[i], level + 1, indentation); + + if (i + 1 < obj.value.length) { + sub += ','; + } + } + } + + rval += indent + 'Sub values: ' + subvalues + sub; + } else { + rval += indent + 'Value: '; + + if (obj.type === asn1.Type.OID) { + var oid = asn1.derToOid(obj.value); + rval += oid; + + if (forge.pki && forge.pki.oids) { + if (oid in forge.pki.oids) { + rval += ' (' + forge.pki.oids[oid] + ') '; + } + } + } + + if (obj.type === asn1.Type.INTEGER) { + try { + rval += asn1.derToInteger(obj.value); + } catch (ex) { + rval += '0x' + forge.util.bytesToHex(obj.value); + } + } else if (obj.type === asn1.Type.BITSTRING) { + // TODO: shift bits as needed to display without padding + if (obj.value.length > 1) { + // remove unused bits field + rval += '0x' + forge.util.bytesToHex(obj.value.slice(1)); + } else { + rval += '(none)'; + } // show unused bit count + + + if (obj.value.length > 0) { + var unused = obj.value.charCodeAt(0); + + if (unused == 1) { + rval += ' (1 unused bit shown)'; + } else if (unused > 1) { + rval += ' (' + unused + ' unused bits shown)'; + } + } + } else if (obj.type === asn1.Type.OCTETSTRING) { + if (!_nonLatinRegex.test(obj.value)) { + rval += '(' + obj.value + ') '; + } + + rval += '0x' + forge.util.bytesToHex(obj.value); + } else if (obj.type === asn1.Type.UTF8) { + rval += forge.util.decodeUtf8(obj.value); + } else if (obj.type === asn1.Type.PRINTABLESTRING || obj.type === asn1.Type.IA5String) { + rval += obj.value; + } else if (_nonLatinRegex.test(obj.value)) { + rval += '0x' + forge.util.bytesToHex(obj.value); + } else if (obj.value.length === 0) { + rval += '[null]'; + } else { + rval += obj.value; + } + } + + return rval; +}; + +/***/ }), +/* 72 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Object IDs for ASN.1. + * + * @author Dave Longley + * + * Copyright (c) 2010-2013 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +forge.pki = forge.pki || {}; +var oids = module.exports = forge.pki.oids = forge.oids = forge.oids || {}; // set id to name mapping and name to id mapping + +function _IN(id, name) { + oids[id] = name; + oids[name] = id; +} // set id to name mapping only + + +function _I_(id, name) { + oids[id] = name; +} // algorithm OIDs + + +_IN('1.2.840.113549.1.1.1', 'rsaEncryption'); // Note: md2 & md4 not implemented +//_IN('1.2.840.113549.1.1.2', 'md2WithRSAEncryption'); +//_IN('1.2.840.113549.1.1.3', 'md4WithRSAEncryption'); + + +_IN('1.2.840.113549.1.1.4', 'md5WithRSAEncryption'); + +_IN('1.2.840.113549.1.1.5', 'sha1WithRSAEncryption'); + +_IN('1.2.840.113549.1.1.7', 'RSAES-OAEP'); + +_IN('1.2.840.113549.1.1.8', 'mgf1'); + +_IN('1.2.840.113549.1.1.9', 'pSpecified'); + +_IN('1.2.840.113549.1.1.10', 'RSASSA-PSS'); + +_IN('1.2.840.113549.1.1.11', 'sha256WithRSAEncryption'); + +_IN('1.2.840.113549.1.1.12', 'sha384WithRSAEncryption'); + +_IN('1.2.840.113549.1.1.13', 'sha512WithRSAEncryption'); + +_IN('1.2.840.10040.4.3', 'dsa-with-sha1'); + +_IN('1.3.14.3.2.7', 'desCBC'); + +_IN('1.3.14.3.2.26', 'sha1'); + +_IN('2.16.840.1.101.3.4.2.1', 'sha256'); + +_IN('2.16.840.1.101.3.4.2.2', 'sha384'); + +_IN('2.16.840.1.101.3.4.2.3', 'sha512'); + +_IN('1.2.840.113549.2.5', 'md5'); // pkcs#7 content types + + +_IN('1.2.840.113549.1.7.1', 'data'); + +_IN('1.2.840.113549.1.7.2', 'signedData'); + +_IN('1.2.840.113549.1.7.3', 'envelopedData'); + +_IN('1.2.840.113549.1.7.4', 'signedAndEnvelopedData'); + +_IN('1.2.840.113549.1.7.5', 'digestedData'); + +_IN('1.2.840.113549.1.7.6', 'encryptedData'); // pkcs#9 oids + + +_IN('1.2.840.113549.1.9.1', 'emailAddress'); + +_IN('1.2.840.113549.1.9.2', 'unstructuredName'); + +_IN('1.2.840.113549.1.9.3', 'contentType'); + +_IN('1.2.840.113549.1.9.4', 'messageDigest'); + +_IN('1.2.840.113549.1.9.5', 'signingTime'); + +_IN('1.2.840.113549.1.9.6', 'counterSignature'); + +_IN('1.2.840.113549.1.9.7', 'challengePassword'); + +_IN('1.2.840.113549.1.9.8', 'unstructuredAddress'); + +_IN('1.2.840.113549.1.9.14', 'extensionRequest'); + +_IN('1.2.840.113549.1.9.20', 'friendlyName'); + +_IN('1.2.840.113549.1.9.21', 'localKeyId'); + +_IN('1.2.840.113549.1.9.22.1', 'x509Certificate'); // pkcs#12 safe bags + + +_IN('1.2.840.113549.1.12.10.1.1', 'keyBag'); + +_IN('1.2.840.113549.1.12.10.1.2', 'pkcs8ShroudedKeyBag'); + +_IN('1.2.840.113549.1.12.10.1.3', 'certBag'); + +_IN('1.2.840.113549.1.12.10.1.4', 'crlBag'); + +_IN('1.2.840.113549.1.12.10.1.5', 'secretBag'); + +_IN('1.2.840.113549.1.12.10.1.6', 'safeContentsBag'); // password-based-encryption for pkcs#12 + + +_IN('1.2.840.113549.1.5.13', 'pkcs5PBES2'); + +_IN('1.2.840.113549.1.5.12', 'pkcs5PBKDF2'); + +_IN('1.2.840.113549.1.12.1.1', 'pbeWithSHAAnd128BitRC4'); + +_IN('1.2.840.113549.1.12.1.2', 'pbeWithSHAAnd40BitRC4'); + +_IN('1.2.840.113549.1.12.1.3', 'pbeWithSHAAnd3-KeyTripleDES-CBC'); + +_IN('1.2.840.113549.1.12.1.4', 'pbeWithSHAAnd2-KeyTripleDES-CBC'); + +_IN('1.2.840.113549.1.12.1.5', 'pbeWithSHAAnd128BitRC2-CBC'); + +_IN('1.2.840.113549.1.12.1.6', 'pbewithSHAAnd40BitRC2-CBC'); // hmac OIDs + + +_IN('1.2.840.113549.2.7', 'hmacWithSHA1'); + +_IN('1.2.840.113549.2.8', 'hmacWithSHA224'); + +_IN('1.2.840.113549.2.9', 'hmacWithSHA256'); + +_IN('1.2.840.113549.2.10', 'hmacWithSHA384'); + +_IN('1.2.840.113549.2.11', 'hmacWithSHA512'); // symmetric key algorithm oids + + +_IN('1.2.840.113549.3.7', 'des-EDE3-CBC'); + +_IN('2.16.840.1.101.3.4.1.2', 'aes128-CBC'); + +_IN('2.16.840.1.101.3.4.1.22', 'aes192-CBC'); + +_IN('2.16.840.1.101.3.4.1.42', 'aes256-CBC'); // certificate issuer/subject OIDs + + +_IN('2.5.4.3', 'commonName'); + +_IN('2.5.4.5', 'serialName'); + +_IN('2.5.4.6', 'countryName'); + +_IN('2.5.4.7', 'localityName'); + +_IN('2.5.4.8', 'stateOrProvinceName'); + +_IN('2.5.4.10', 'organizationName'); + +_IN('2.5.4.11', 'organizationalUnitName'); // X.509 extension OIDs + + +_IN('2.16.840.1.113730.1.1', 'nsCertType'); + +_I_('2.5.29.1', 'authorityKeyIdentifier'); // deprecated, use .35 + + +_I_('2.5.29.2', 'keyAttributes'); // obsolete use .37 or .15 + + +_I_('2.5.29.3', 'certificatePolicies'); // deprecated, use .32 + + +_I_('2.5.29.4', 'keyUsageRestriction'); // obsolete use .37 or .15 + + +_I_('2.5.29.5', 'policyMapping'); // deprecated use .33 + + +_I_('2.5.29.6', 'subtreesConstraint'); // obsolete use .30 + + +_I_('2.5.29.7', 'subjectAltName'); // deprecated use .17 + + +_I_('2.5.29.8', 'issuerAltName'); // deprecated use .18 + + +_I_('2.5.29.9', 'subjectDirectoryAttributes'); + +_I_('2.5.29.10', 'basicConstraints'); // deprecated use .19 + + +_I_('2.5.29.11', 'nameConstraints'); // deprecated use .30 + + +_I_('2.5.29.12', 'policyConstraints'); // deprecated use .36 + + +_I_('2.5.29.13', 'basicConstraints'); // deprecated use .19 + + +_IN('2.5.29.14', 'subjectKeyIdentifier'); + +_IN('2.5.29.15', 'keyUsage'); + +_I_('2.5.29.16', 'privateKeyUsagePeriod'); + +_IN('2.5.29.17', 'subjectAltName'); + +_IN('2.5.29.18', 'issuerAltName'); + +_IN('2.5.29.19', 'basicConstraints'); + +_I_('2.5.29.20', 'cRLNumber'); + +_I_('2.5.29.21', 'cRLReason'); + +_I_('2.5.29.22', 'expirationDate'); + +_I_('2.5.29.23', 'instructionCode'); + +_I_('2.5.29.24', 'invalidityDate'); + +_I_('2.5.29.25', 'cRLDistributionPoints'); // deprecated use .31 + + +_I_('2.5.29.26', 'issuingDistributionPoint'); // deprecated use .28 + + +_I_('2.5.29.27', 'deltaCRLIndicator'); + +_I_('2.5.29.28', 'issuingDistributionPoint'); + +_I_('2.5.29.29', 'certificateIssuer'); + +_I_('2.5.29.30', 'nameConstraints'); + +_IN('2.5.29.31', 'cRLDistributionPoints'); + +_IN('2.5.29.32', 'certificatePolicies'); + +_I_('2.5.29.33', 'policyMappings'); + +_I_('2.5.29.34', 'policyConstraints'); // deprecated use .36 + + +_IN('2.5.29.35', 'authorityKeyIdentifier'); + +_I_('2.5.29.36', 'policyConstraints'); + +_IN('2.5.29.37', 'extKeyUsage'); + +_I_('2.5.29.46', 'freshestCRL'); + +_I_('2.5.29.54', 'inhibitAnyPolicy'); // extKeyUsage purposes + + +_IN('1.3.6.1.4.1.11129.2.4.2', 'timestampList'); + +_IN('1.3.6.1.5.5.7.1.1', 'authorityInfoAccess'); + +_IN('1.3.6.1.5.5.7.3.1', 'serverAuth'); + +_IN('1.3.6.1.5.5.7.3.2', 'clientAuth'); + +_IN('1.3.6.1.5.5.7.3.3', 'codeSigning'); + +_IN('1.3.6.1.5.5.7.3.4', 'emailProtection'); + +_IN('1.3.6.1.5.5.7.3.8', 'timeStamping'); + +/***/ }), +/* 73 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, global, module) {var __WEBPACK_AMD_DEFINE_RESULT__; + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** + * [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 + */ + +/*jslint bitwise: true */ +(function () { + 'use strict'; + + var INPUT_ERROR = 'input is invalid type'; + var FINALIZE_ERROR = 'finalize already called'; + var WINDOW = (typeof window === "undefined" ? "undefined" : _typeof(window)) === 'object'; + var root = WINDOW ? window : {}; + + if (root.JS_SHA3_NO_WINDOW) { + WINDOW = false; + } + + var WEB_WORKER = !WINDOW && (typeof self === "undefined" ? "undefined" : _typeof(self)) === 'object'; + var NODE_JS = !root.JS_SHA3_NO_NODE_JS && (typeof process === "undefined" ? "undefined" : _typeof(process)) === 'object' && process.versions && process.versions.node; + + if (NODE_JS) { + root = global; + } else if (WEB_WORKER) { + root = self; + } + + var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && ( false ? undefined : _typeof(module)) === 'object' && module.exports; + var AMD = true && __webpack_require__(241); + var ARRAY_BUFFER = !root.JS_SHA3_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined'; + var HEX_CHARS = '0123456789abcdef'.split(''); + var SHAKE_PADDING = [31, 7936, 2031616, 520093696]; + var CSHAKE_PADDING = [4, 1024, 262144, 67108864]; + var KECCAK_PADDING = [1, 256, 65536, 16777216]; + var PADDING = [6, 1536, 393216, 100663296]; + var SHIFT = [0, 8, 16, 24]; + var RC = [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]; + var BITS = [224, 256, 384, 512]; + var SHAKE_BITS = [128, 256]; + var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array', 'digest']; + var CSHAKE_BYTEPAD = { + '128': 168, + '256': 136 + }; + + if (root.JS_SHA3_NO_NODE_JS || !Array.isArray) { + Array.isArray = function (obj) { + return Object.prototype.toString.call(obj) === '[object Array]'; + }; + } + + if (ARRAY_BUFFER && (root.JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) { + ArrayBuffer.isView = function (obj) { + return _typeof(obj) === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer; + }; + } + + var createOutputMethod = function createOutputMethod(bits, padding, outputType) { + return function (message) { + return new Keccak(bits, padding, bits).update(message)[outputType](); + }; + }; + + var createShakeOutputMethod = function createShakeOutputMethod(bits, padding, outputType) { + return function (message, outputBits) { + return new Keccak(bits, padding, outputBits).update(message)[outputType](); + }; + }; + + var createCshakeOutputMethod = function createCshakeOutputMethod(bits, padding, outputType) { + return function (message, outputBits, n, s) { + return methods['cshake' + bits].update(message, outputBits, n, s)[outputType](); + }; + }; + + var createKmacOutputMethod = function createKmacOutputMethod(bits, padding, outputType) { + return function (key, message, outputBits, s) { + return methods['kmac' + bits].update(key, message, outputBits, s)[outputType](); + }; + }; + + var createOutputMethods = function createOutputMethods(method, createMethod, bits, padding) { + for (var i = 0; i < OUTPUT_TYPES.length; ++i) { + var type = OUTPUT_TYPES[i]; + method[type] = createMethod(bits, padding, type); + } + + return method; + }; + + var createMethod = function createMethod(bits, padding) { + var method = createOutputMethod(bits, padding, 'hex'); + + method.create = function () { + return new Keccak(bits, padding, bits); + }; + + method.update = function (message) { + return method.create().update(message); + }; + + return createOutputMethods(method, createOutputMethod, bits, padding); + }; + + var createShakeMethod = function createShakeMethod(bits, padding) { + var method = createShakeOutputMethod(bits, padding, 'hex'); + + method.create = function (outputBits) { + return new Keccak(bits, padding, outputBits); + }; + + method.update = function (message, outputBits) { + return method.create(outputBits).update(message); + }; + + return createOutputMethods(method, createShakeOutputMethod, bits, padding); + }; + + var createCshakeMethod = function createCshakeMethod(bits, padding) { + var w = CSHAKE_BYTEPAD[bits]; + var method = createCshakeOutputMethod(bits, padding, 'hex'); + + method.create = function (outputBits, n, s) { + if (!n && !s) { + return methods['shake' + bits].create(outputBits); + } else { + return new Keccak(bits, padding, outputBits).bytepad([n, s], w); + } + }; + + method.update = function (message, outputBits, n, s) { + return method.create(outputBits, n, s).update(message); + }; + + return createOutputMethods(method, createCshakeOutputMethod, bits, padding); + }; + + var createKmacMethod = function createKmacMethod(bits, padding) { + var w = CSHAKE_BYTEPAD[bits]; + var method = createKmacOutputMethod(bits, padding, 'hex'); + + method.create = function (key, outputBits, s) { + return new Kmac(bits, padding, outputBits).bytepad(['KMAC', s], w).bytepad([key], w); + }; + + method.update = function (key, message, outputBits, s) { + return method.create(key, outputBits, s).update(message); + }; + + return createOutputMethods(method, createKmacOutputMethod, bits, padding); + }; + + var algorithms = [{ + name: 'keccak', + padding: KECCAK_PADDING, + bits: BITS, + createMethod: createMethod + }, { + name: 'sha3', + padding: PADDING, + bits: BITS, + createMethod: createMethod + }, { + name: 'shake', + padding: SHAKE_PADDING, + bits: SHAKE_BITS, + createMethod: createShakeMethod + }, { + name: 'cshake', + padding: CSHAKE_PADDING, + bits: SHAKE_BITS, + createMethod: createCshakeMethod + }, { + name: 'kmac', + padding: CSHAKE_PADDING, + bits: SHAKE_BITS, + createMethod: createKmacMethod + }]; + var methods = {}, + methodNames = []; + + for (var i = 0; i < algorithms.length; ++i) { + var algorithm = algorithms[i]; + var bits = algorithm.bits; + + for (var j = 0; j < bits.length; ++j) { + var methodName = algorithm.name + '_' + bits[j]; + methodNames.push(methodName); + methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding); + + if (algorithm.name !== 'sha3') { + var newMethodName = algorithm.name + bits[j]; + methodNames.push(newMethodName); + methods[newMethodName] = methods[methodName]; + } + } + } + + function Keccak(bits, padding, outputBits) { + this.blocks = []; + this.s = []; + this.padding = padding; + this.outputBits = outputBits; + this.reset = true; + this.finalized = false; + this.block = 0; + this.start = 0; + this.blockCount = 1600 - (bits << 1) >> 5; + this.byteCount = this.blockCount << 2; + this.outputBlocks = outputBits >> 5; + this.extraBytes = (outputBits & 31) >> 3; + + for (var i = 0; i < 50; ++i) { + this.s[i] = 0; + } + } + + Keccak.prototype.update = function (message) { + if (this.finalized) { + throw new Error(FINALIZE_ERROR); + } + + var notString, + type = _typeof(message); + + if (type !== 'string') { + if (type === 'object') { + if (message === null) { + throw new Error(INPUT_ERROR); + } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) { + message = new Uint8Array(message); + } else if (!Array.isArray(message)) { + if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) { + throw new Error(INPUT_ERROR); + } + } + } else { + throw new Error(INPUT_ERROR); + } + + notString = true; + } + + var blocks = this.blocks, + byteCount = this.byteCount, + length = message.length, + blockCount = this.blockCount, + index = 0, + s = this.s, + i, + code; + + while (index < length) { + if (this.reset) { + this.reset = false; + blocks[0] = this.block; + + for (i = 1; i < blockCount + 1; ++i) { + blocks[i] = 0; + } + } + + if (notString) { + for (i = this.start; index < length && i < byteCount; ++index) { + blocks[i >> 2] |= message[index] << SHIFT[i++ & 3]; + } + } else { + for (i = this.start; index < length && i < byteCount; ++index) { + code = message.charCodeAt(index); + + if (code < 0x80) { + blocks[i >> 2] |= code << SHIFT[i++ & 3]; + } else if (code < 0x800) { + blocks[i >> 2] |= (0xc0 | code >> 6) << SHIFT[i++ & 3]; + blocks[i >> 2] |= (0x80 | code & 0x3f) << SHIFT[i++ & 3]; + } else if (code < 0xd800 || code >= 0xe000) { + blocks[i >> 2] |= (0xe0 | code >> 12) << SHIFT[i++ & 3]; + blocks[i >> 2] |= (0x80 | code >> 6 & 0x3f) << SHIFT[i++ & 3]; + blocks[i >> 2] |= (0x80 | code & 0x3f) << SHIFT[i++ & 3]; + } else { + code = 0x10000 + ((code & 0x3ff) << 10 | message.charCodeAt(++index) & 0x3ff); + blocks[i >> 2] |= (0xf0 | code >> 18) << SHIFT[i++ & 3]; + blocks[i >> 2] |= (0x80 | code >> 12 & 0x3f) << SHIFT[i++ & 3]; + blocks[i >> 2] |= (0x80 | code >> 6 & 0x3f) << SHIFT[i++ & 3]; + blocks[i >> 2] |= (0x80 | code & 0x3f) << SHIFT[i++ & 3]; + } + } + } + + this.lastByteIndex = i; + + if (i >= byteCount) { + this.start = i - byteCount; + this.block = blocks[blockCount]; + + for (i = 0; i < blockCount; ++i) { + s[i] ^= blocks[i]; + } + + f(s); + this.reset = true; + } else { + this.start = i; + } + } + + return this; + }; + + Keccak.prototype.encode = function (x, right) { + var o = x & 255, + n = 1; + var bytes = [o]; + x = x >> 8; + o = x & 255; + + while (o > 0) { + bytes.unshift(o); + x = x >> 8; + o = x & 255; + ++n; + } + + if (right) { + bytes.push(n); + } else { + bytes.unshift(n); + } + + this.update(bytes); + return bytes.length; + }; + + Keccak.prototype.encodeString = function (str) { + var notString, + type = _typeof(str); + + if (type !== 'string') { + if (type === 'object') { + if (str === null) { + throw new Error(INPUT_ERROR); + } else if (ARRAY_BUFFER && str.constructor === ArrayBuffer) { + str = new Uint8Array(str); + } else if (!Array.isArray(str)) { + if (!ARRAY_BUFFER || !ArrayBuffer.isView(str)) { + throw new Error(INPUT_ERROR); + } + } + } else { + throw new Error(INPUT_ERROR); + } + + notString = true; + } + + var bytes = 0, + length = str.length; + + if (notString) { + bytes = length; + } else { + for (var i = 0; i < str.length; ++i) { + var code = str.charCodeAt(i); + + if (code < 0x80) { + bytes += 1; + } else if (code < 0x800) { + bytes += 2; + } else if (code < 0xd800 || code >= 0xe000) { + bytes += 3; + } else { + code = 0x10000 + ((code & 0x3ff) << 10 | str.charCodeAt(++i) & 0x3ff); + bytes += 4; + } + } + } + + bytes += this.encode(bytes * 8); + this.update(str); + return bytes; + }; + + Keccak.prototype.bytepad = function (strs, w) { + var bytes = this.encode(w); + + for (var i = 0; i < strs.length; ++i) { + bytes += this.encodeString(strs[i]); + } + + var paddingBytes = w - bytes % w; + var zeros = []; + zeros.length = paddingBytes; + this.update(zeros); + return this; + }; + + Keccak.prototype.finalize = function () { + if (this.finalized) { + return; + } + + this.finalized = true; + var blocks = this.blocks, + i = this.lastByteIndex, + blockCount = this.blockCount, + s = this.s; + blocks[i >> 2] |= this.padding[i & 3]; + + if (this.lastByteIndex === this.byteCount) { + blocks[0] = blocks[blockCount]; + + for (i = 1; i < blockCount + 1; ++i) { + blocks[i] = 0; + } + } + + blocks[blockCount - 1] |= 0x80000000; + + for (i = 0; i < blockCount; ++i) { + s[i] ^= blocks[i]; + } + + f(s); + }; + + Keccak.prototype.toString = Keccak.prototype.hex = function () { + this.finalize(); + var blockCount = this.blockCount, + s = this.s, + outputBlocks = this.outputBlocks, + extraBytes = this.extraBytes, + i = 0, + j = 0; + var hex = '', + block; + + while (j < outputBlocks) { + for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) { + block = s[i]; + hex += HEX_CHARS[block >> 4 & 0x0F] + HEX_CHARS[block & 0x0F] + HEX_CHARS[block >> 12 & 0x0F] + HEX_CHARS[block >> 8 & 0x0F] + HEX_CHARS[block >> 20 & 0x0F] + HEX_CHARS[block >> 16 & 0x0F] + HEX_CHARS[block >> 28 & 0x0F] + HEX_CHARS[block >> 24 & 0x0F]; + } + + if (j % blockCount === 0) { + f(s); + i = 0; + } + } + + if (extraBytes) { + block = s[i]; + hex += HEX_CHARS[block >> 4 & 0x0F] + HEX_CHARS[block & 0x0F]; + + if (extraBytes > 1) { + hex += HEX_CHARS[block >> 12 & 0x0F] + HEX_CHARS[block >> 8 & 0x0F]; + } + + if (extraBytes > 2) { + hex += HEX_CHARS[block >> 20 & 0x0F] + HEX_CHARS[block >> 16 & 0x0F]; + } + } + + return hex; + }; + + Keccak.prototype.arrayBuffer = function () { + this.finalize(); + var blockCount = this.blockCount, + s = this.s, + outputBlocks = this.outputBlocks, + extraBytes = this.extraBytes, + i = 0, + j = 0; + var bytes = this.outputBits >> 3; + var buffer; + + if (extraBytes) { + buffer = new ArrayBuffer(outputBlocks + 1 << 2); + } else { + buffer = new ArrayBuffer(bytes); + } + + var array = new Uint32Array(buffer); + + while (j < outputBlocks) { + for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) { + array[j] = s[i]; + } + + if (j % blockCount === 0) { + f(s); + } + } + + if (extraBytes) { + array[i] = s[i]; + buffer = buffer.slice(0, bytes); + } + + return buffer; + }; + + Keccak.prototype.buffer = Keccak.prototype.arrayBuffer; + + Keccak.prototype.digest = Keccak.prototype.array = function () { + this.finalize(); + var blockCount = this.blockCount, + s = this.s, + outputBlocks = this.outputBlocks, + extraBytes = this.extraBytes, + i = 0, + j = 0; + var array = [], + offset, + block; + + while (j < outputBlocks) { + for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) { + offset = j << 2; + block = s[i]; + array[offset] = block & 0xFF; + array[offset + 1] = block >> 8 & 0xFF; + array[offset + 2] = block >> 16 & 0xFF; + array[offset + 3] = block >> 24 & 0xFF; + } + + if (j % blockCount === 0) { + f(s); + } + } + + if (extraBytes) { + offset = j << 2; + block = s[i]; + array[offset] = block & 0xFF; + + if (extraBytes > 1) { + array[offset + 1] = block >> 8 & 0xFF; + } + + if (extraBytes > 2) { + array[offset + 2] = block >> 16 & 0xFF; + } + } + + return array; + }; + + function Kmac(bits, padding, outputBits) { + Keccak.call(this, bits, padding, outputBits); + } + + Kmac.prototype = new Keccak(); + + Kmac.prototype.finalize = function () { + this.encode(this.outputBits, true); + return Keccak.prototype.finalize.call(this); + }; + + var f = function f(s) { + var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33, b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49; + + for (n = 0; n < 48; n += 2) { + c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40]; + c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41]; + c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42]; + c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43]; + c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44]; + c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45]; + c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46]; + c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47]; + c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48]; + c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49]; + h = c8 ^ (c2 << 1 | c3 >>> 31); + l = c9 ^ (c3 << 1 | c2 >>> 31); + s[0] ^= h; + s[1] ^= l; + s[10] ^= h; + s[11] ^= l; + s[20] ^= h; + s[21] ^= l; + s[30] ^= h; + s[31] ^= l; + s[40] ^= h; + s[41] ^= l; + h = c0 ^ (c4 << 1 | c5 >>> 31); + l = c1 ^ (c5 << 1 | c4 >>> 31); + s[2] ^= h; + s[3] ^= l; + s[12] ^= h; + s[13] ^= l; + s[22] ^= h; + s[23] ^= l; + s[32] ^= h; + s[33] ^= l; + s[42] ^= h; + s[43] ^= l; + h = c2 ^ (c6 << 1 | c7 >>> 31); + l = c3 ^ (c7 << 1 | c6 >>> 31); + s[4] ^= h; + s[5] ^= l; + s[14] ^= h; + s[15] ^= l; + s[24] ^= h; + s[25] ^= l; + s[34] ^= h; + s[35] ^= l; + s[44] ^= h; + s[45] ^= l; + h = c4 ^ (c8 << 1 | c9 >>> 31); + l = c5 ^ (c9 << 1 | c8 >>> 31); + s[6] ^= h; + s[7] ^= l; + s[16] ^= h; + s[17] ^= l; + s[26] ^= h; + s[27] ^= l; + s[36] ^= h; + s[37] ^= l; + s[46] ^= h; + s[47] ^= l; + h = c6 ^ (c0 << 1 | c1 >>> 31); + l = c7 ^ (c1 << 1 | c0 >>> 31); + s[8] ^= h; + s[9] ^= l; + s[18] ^= h; + s[19] ^= l; + s[28] ^= h; + s[29] ^= l; + s[38] ^= h; + s[39] ^= l; + s[48] ^= h; + s[49] ^= l; + b0 = s[0]; + b1 = s[1]; + b32 = s[11] << 4 | s[10] >>> 28; + b33 = s[10] << 4 | s[11] >>> 28; + b14 = s[20] << 3 | s[21] >>> 29; + b15 = s[21] << 3 | s[20] >>> 29; + b46 = s[31] << 9 | s[30] >>> 23; + b47 = s[30] << 9 | s[31] >>> 23; + b28 = s[40] << 18 | s[41] >>> 14; + b29 = s[41] << 18 | s[40] >>> 14; + b20 = s[2] << 1 | s[3] >>> 31; + b21 = s[3] << 1 | s[2] >>> 31; + b2 = s[13] << 12 | s[12] >>> 20; + b3 = s[12] << 12 | s[13] >>> 20; + b34 = s[22] << 10 | s[23] >>> 22; + b35 = s[23] << 10 | s[22] >>> 22; + b16 = s[33] << 13 | s[32] >>> 19; + b17 = s[32] << 13 | s[33] >>> 19; + b48 = s[42] << 2 | s[43] >>> 30; + b49 = s[43] << 2 | s[42] >>> 30; + b40 = s[5] << 30 | s[4] >>> 2; + b41 = s[4] << 30 | s[5] >>> 2; + b22 = s[14] << 6 | s[15] >>> 26; + b23 = s[15] << 6 | s[14] >>> 26; + b4 = s[25] << 11 | s[24] >>> 21; + b5 = s[24] << 11 | s[25] >>> 21; + b36 = s[34] << 15 | s[35] >>> 17; + b37 = s[35] << 15 | s[34] >>> 17; + b18 = s[45] << 29 | s[44] >>> 3; + b19 = s[44] << 29 | s[45] >>> 3; + b10 = s[6] << 28 | s[7] >>> 4; + b11 = s[7] << 28 | s[6] >>> 4; + b42 = s[17] << 23 | s[16] >>> 9; + b43 = s[16] << 23 | s[17] >>> 9; + b24 = s[26] << 25 | s[27] >>> 7; + b25 = s[27] << 25 | s[26] >>> 7; + b6 = s[36] << 21 | s[37] >>> 11; + b7 = s[37] << 21 | s[36] >>> 11; + b38 = s[47] << 24 | s[46] >>> 8; + b39 = s[46] << 24 | s[47] >>> 8; + b30 = s[8] << 27 | s[9] >>> 5; + b31 = s[9] << 27 | s[8] >>> 5; + b12 = s[18] << 20 | s[19] >>> 12; + b13 = s[19] << 20 | s[18] >>> 12; + b44 = s[29] << 7 | s[28] >>> 25; + b45 = s[28] << 7 | s[29] >>> 25; + b26 = s[38] << 8 | s[39] >>> 24; + b27 = s[39] << 8 | s[38] >>> 24; + b8 = s[48] << 14 | s[49] >>> 18; + b9 = s[49] << 14 | s[48] >>> 18; + s[0] = b0 ^ ~b2 & b4; + s[1] = b1 ^ ~b3 & b5; + s[10] = b10 ^ ~b12 & b14; + s[11] = b11 ^ ~b13 & b15; + s[20] = b20 ^ ~b22 & b24; + s[21] = b21 ^ ~b23 & b25; + s[30] = b30 ^ ~b32 & b34; + s[31] = b31 ^ ~b33 & b35; + s[40] = b40 ^ ~b42 & b44; + s[41] = b41 ^ ~b43 & b45; + s[2] = b2 ^ ~b4 & b6; + s[3] = b3 ^ ~b5 & b7; + s[12] = b12 ^ ~b14 & b16; + s[13] = b13 ^ ~b15 & b17; + s[22] = b22 ^ ~b24 & b26; + s[23] = b23 ^ ~b25 & b27; + s[32] = b32 ^ ~b34 & b36; + s[33] = b33 ^ ~b35 & b37; + s[42] = b42 ^ ~b44 & b46; + s[43] = b43 ^ ~b45 & b47; + s[4] = b4 ^ ~b6 & b8; + s[5] = b5 ^ ~b7 & b9; + s[14] = b14 ^ ~b16 & b18; + s[15] = b15 ^ ~b17 & b19; + s[24] = b24 ^ ~b26 & b28; + s[25] = b25 ^ ~b27 & b29; + s[34] = b34 ^ ~b36 & b38; + s[35] = b35 ^ ~b37 & b39; + s[44] = b44 ^ ~b46 & b48; + s[45] = b45 ^ ~b47 & b49; + s[6] = b6 ^ ~b8 & b0; + s[7] = b7 ^ ~b9 & b1; + s[16] = b16 ^ ~b18 & b10; + s[17] = b17 ^ ~b19 & b11; + s[26] = b26 ^ ~b28 & b20; + s[27] = b27 ^ ~b29 & b21; + s[36] = b36 ^ ~b38 & b30; + s[37] = b37 ^ ~b39 & b31; + s[46] = b46 ^ ~b48 & b40; + s[47] = b47 ^ ~b49 & b41; + s[8] = b8 ^ ~b0 & b2; + s[9] = b9 ^ ~b1 & b3; + s[18] = b18 ^ ~b10 & b12; + s[19] = b19 ^ ~b11 & b13; + s[28] = b28 ^ ~b20 & b22; + s[29] = b29 ^ ~b21 & b23; + s[38] = b38 ^ ~b30 & b32; + s[39] = b39 ^ ~b31 & b33; + s[48] = b48 ^ ~b40 & b42; + s[49] = b49 ^ ~b41 & b43; + s[0] ^= RC[n]; + s[1] ^= RC[n + 1]; + } + }; + + if (COMMON_JS) { + module.exports = methods; + } else { + for (i = 0; i < methodNames.length; ++i) { + root[methodNames[i]] = methods[methodNames[i]]; + } + + if (AMD) { + !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () { + return methods; + }).call(exports, __webpack_require__, exports, module), + __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); + } + } +})(); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(10), __webpack_require__(37)(module))) + +/***/ }), +/* 74 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var b2b = __webpack_require__(246); + +var b2s = __webpack_require__(247); + +module.exports = { + blake2b: b2b.blake2b, + blake2bHex: b2b.blake2bHex, + blake2bInit: b2b.blake2bInit, + blake2bUpdate: b2b.blake2bUpdate, + blake2bFinal: b2b.blake2bFinal, + blake2s: b2s.blake2s, + blake2sHex: b2s.blake2sHex, + blake2sInit: b2s.blake2sInit, + blake2sUpdate: b2s.blake2sUpdate, + blake2sFinal: b2s.blake2sFinal +}; + +/***/ }), +/* 75 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(setImmediate, process) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.hasNextTick = exports.hasSetImmediate = undefined; +exports.fallback = fallback; +exports.wrap = wrap; + +var _slice = __webpack_require__(53); + +var _slice2 = _interopRequireDefault(_slice); + +function _interopRequireDefault(obj) { + return obj && obj.__esModule ? obj : { + "default": obj + }; +} + +var hasSetImmediate = exports.hasSetImmediate = typeof setImmediate === 'function' && setImmediate; +var hasNextTick = exports.hasNextTick = (typeof process === "undefined" ? "undefined" : _typeof(process)) === 'object' && typeof process.nextTick === 'function'; + +function fallback(fn) { + setTimeout(fn, 0); +} + +function wrap(defer) { + return function (fn + /*, ...args*/ + ) { + var args = (0, _slice2["default"])(arguments, 1); + defer(function () { + fn.apply(null, args); + }); + }; +} + +var _defer; + +if (hasSetImmediate) { + _defer = setImmediate; +} else if (hasNextTick) { + _defer = process.nextTick; +} else { + _defer = fallback; +} + +exports["default"] = wrap(_defer); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(36).setImmediate, __webpack_require__(6))) + +/***/ }), +/* 76 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + // Based on npmjs.com/nodeify but without additional `nextTick` calls +// to keep the overhead low + +module.exports = function nodeify(promise, cb) { + return promise.then(function (res) { + cb(null, res); + }, function (err) { + cb(err); + }); +}; + +/***/ }), +/* 77 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* global self */ + + +module.exports = self.crypto || self.msCrypto; + +/***/ }), +/* 78 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports = module.exports = __webpack_require__(132); +exports.Stream = exports; +exports.Readable = exports; +exports.Writable = __webpack_require__(79); +exports.Duplex = __webpack_require__(24); +exports.Transform = __webpack_require__(136); +exports.PassThrough = __webpack_require__(284); + +/***/ }), +/* 79 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, setImmediate, global) {// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// A bit simpler than readable streams. +// Implement an async ._write(chunk, encoding, cb), and it'll handle all +// the drain event emission and buffering. + +/**/ + +var pna = __webpack_require__(54); +/**/ + + +module.exports = Writable; +/* */ + +function WriteReq(chunk, encoding, cb) { + this.chunk = chunk; + this.encoding = encoding; + this.callback = cb; + this.next = null; +} // It seems a linked list but it is not +// there will be only 2 of these for each stream + + +function CorkedRequest(state) { + var _this = this; + + this.next = null; + this.entry = null; + + this.finish = function () { + onCorkedFinish(_this, state); + }; +} +/* */ + +/**/ + + +var asyncWrite = !process.browser && ['v0.10', 'v0.9.'].indexOf(process.version.slice(0, 5)) > -1 ? setImmediate : pna.nextTick; +/**/ + +/**/ + +var Duplex; +/**/ + +Writable.WritableState = WritableState; +/**/ + +var util = __webpack_require__(39); + +util.inherits = __webpack_require__(2); +/**/ + +/**/ + +var internalUtil = { + deprecate: __webpack_require__(135) +}; +/**/ + +/**/ + +var Stream = __webpack_require__(133); +/**/ + +/**/ + + +var Buffer = __webpack_require__(7).Buffer; + +var OurUint8Array = global.Uint8Array || function () {}; + +function _uint8ArrayToBuffer(chunk) { + return Buffer.from(chunk); +} + +function _isUint8Array(obj) { + return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; +} +/**/ + + +var destroyImpl = __webpack_require__(134); + +util.inherits(Writable, Stream); + +function nop() {} + +function WritableState(options, stream) { + Duplex = Duplex || __webpack_require__(24); + options = options || {}; // Duplex streams are both readable and writable, but share + // the same options object. + // However, some cases require setting options to different + // values for the readable and the writable sides of the duplex stream. + // These options can be provided separately as readableXXX and writableXXX. + + var isDuplex = stream instanceof Duplex; // object stream flag to indicate whether or not this stream + // contains buffers or objects. + + this.objectMode = !!options.objectMode; + if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; // the point at which write() starts returning false + // Note: 0 is a valid value, means that we always return false if + // the entire buffer is not flushed immediately on write() + + var hwm = options.highWaterMark; + var writableHwm = options.writableHighWaterMark; + var defaultHwm = this.objectMode ? 16 : 16 * 1024; + if (hwm || hwm === 0) this.highWaterMark = hwm;else if (isDuplex && (writableHwm || writableHwm === 0)) this.highWaterMark = writableHwm;else this.highWaterMark = defaultHwm; // cast to ints. + + this.highWaterMark = Math.floor(this.highWaterMark); // if _final has been called + + this.finalCalled = false; // drain event flag. + + this.needDrain = false; // at the start of calling end() + + this.ending = false; // when end() has been called, and returned + + this.ended = false; // when 'finish' is emitted + + this.finished = false; // has it been destroyed + + this.destroyed = false; // should we decode strings into buffers before passing to _write? + // this is here so that some node-core streams can optimize string + // handling at a lower level. + + var noDecode = options.decodeStrings === false; + this.decodeStrings = !noDecode; // Crypto is kind of old and crusty. Historically, its default string + // encoding is 'binary' so we have to make this configurable. + // Everything else in the universe uses 'utf8', though. + + this.defaultEncoding = options.defaultEncoding || 'utf8'; // not an actual buffer we keep track of, but a measurement + // of how much we're waiting to get pushed to some underlying + // socket or file. + + this.length = 0; // a flag to see when we're in the middle of a write. + + this.writing = false; // when true all writes will be buffered until .uncork() call + + this.corked = 0; // a flag to be able to tell if the onwrite cb is called immediately, + // or on a later tick. We set this to true at first, because any + // actions that shouldn't happen until "later" should generally also + // not happen before the first write call. + + this.sync = true; // a flag to know if we're processing previously buffered items, which + // may call the _write() callback in the same tick, so that we don't + // end up in an overlapped onwrite situation. + + this.bufferProcessing = false; // the callback that's passed to _write(chunk,cb) + + this.onwrite = function (er) { + onwrite(stream, er); + }; // the callback that the user supplies to write(chunk,encoding,cb) + + + this.writecb = null; // the amount that is being written when _write is called. + + this.writelen = 0; + this.bufferedRequest = null; + this.lastBufferedRequest = null; // number of pending user-supplied write callbacks + // this must be 0 before 'finish' can be emitted + + this.pendingcb = 0; // emit prefinish if the only thing we're waiting for is _write cbs + // This is relevant for synchronous Transform streams + + this.prefinished = false; // True if the error was already emitted and should not be thrown again + + this.errorEmitted = false; // count buffered requests + + this.bufferedRequestCount = 0; // allocate the first CorkedRequest, there is always + // one allocated and free to use, and we maintain at most two + + this.corkedRequestsFree = new CorkedRequest(this); +} + +WritableState.prototype.getBuffer = function getBuffer() { + var current = this.bufferedRequest; + var out = []; + + while (current) { + out.push(current); + current = current.next; + } + + return out; +}; + +(function () { + try { + Object.defineProperty(WritableState.prototype, 'buffer', { + get: internalUtil.deprecate(function () { + return this.getBuffer(); + }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003') + }); + } catch (_) {} +})(); // Test _writableState for inheritance to account for Duplex streams, +// whose prototype chain only points to Readable. + + +var realHasInstance; + +if (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') { + realHasInstance = Function.prototype[Symbol.hasInstance]; + Object.defineProperty(Writable, Symbol.hasInstance, { + value: function value(object) { + if (realHasInstance.call(this, object)) return true; + if (this !== Writable) return false; + return object && object._writableState instanceof WritableState; + } + }); +} else { + realHasInstance = function realHasInstance(object) { + return object instanceof this; + }; +} + +function Writable(options) { + Duplex = Duplex || __webpack_require__(24); // Writable ctor is applied to Duplexes, too. + // `realHasInstance` is necessary because using plain `instanceof` + // would return false, as no `_writableState` property is attached. + // Trying to use the custom `instanceof` for Writable here will also break the + // Node.js LazyTransform implementation, which has a non-trivial getter for + // `_writableState` that would lead to infinite recursion. + + if (!realHasInstance.call(Writable, this) && !(this instanceof Duplex)) { + return new Writable(options); + } + + this._writableState = new WritableState(options, this); // legacy. + + this.writable = true; + + if (options) { + if (typeof options.write === 'function') this._write = options.write; + if (typeof options.writev === 'function') this._writev = options.writev; + if (typeof options.destroy === 'function') this._destroy = options.destroy; + if (typeof options["final"] === 'function') this._final = options["final"]; + } + + Stream.call(this); +} // Otherwise people can pipe Writable streams, which is just wrong. + + +Writable.prototype.pipe = function () { + this.emit('error', new Error('Cannot pipe, not readable')); +}; + +function writeAfterEnd(stream, cb) { + var er = new Error('write after end'); // TODO: defer error events consistently everywhere, not just the cb + + stream.emit('error', er); + pna.nextTick(cb, er); +} // Checks that a user-supplied chunk is valid, especially for the particular +// mode the stream is in. Currently this means that `null` is never accepted +// and undefined/non-string values are only allowed in object mode. + + +function validChunk(stream, state, chunk, cb) { + var valid = true; + var er = false; + + if (chunk === null) { + er = new TypeError('May not write null values to stream'); + } else if (typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) { + er = new TypeError('Invalid non-string/buffer chunk'); + } + + if (er) { + stream.emit('error', er); + pna.nextTick(cb, er); + valid = false; + } + + return valid; +} + +Writable.prototype.write = function (chunk, encoding, cb) { + var state = this._writableState; + var ret = false; + + var isBuf = !state.objectMode && _isUint8Array(chunk); + + if (isBuf && !Buffer.isBuffer(chunk)) { + chunk = _uint8ArrayToBuffer(chunk); + } + + if (typeof encoding === 'function') { + cb = encoding; + encoding = null; + } + + if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding; + if (typeof cb !== 'function') cb = nop; + if (state.ended) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) { + state.pendingcb++; + ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb); + } + return ret; +}; + +Writable.prototype.cork = function () { + var state = this._writableState; + state.corked++; +}; + +Writable.prototype.uncork = function () { + var state = this._writableState; + + if (state.corked) { + state.corked--; + if (!state.writing && !state.corked && !state.finished && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state); + } +}; + +Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) { + // node::ParseEncoding() requires lower case. + if (typeof encoding === 'string') encoding = encoding.toLowerCase(); + if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new TypeError('Unknown encoding: ' + encoding); + this._writableState.defaultEncoding = encoding; + return this; +}; + +function decodeChunk(state, chunk, encoding) { + if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') { + chunk = Buffer.from(chunk, encoding); + } + + return chunk; +} + +Object.defineProperty(Writable.prototype, 'writableHighWaterMark', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState.highWaterMark; + } +}); // if we're already writing something, then just put this +// in the queue, and wait our turn. Otherwise, call _write +// If we return false, then we need a drain event, so set that flag. + +function writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) { + if (!isBuf) { + var newChunk = decodeChunk(state, chunk, encoding); + + if (chunk !== newChunk) { + isBuf = true; + encoding = 'buffer'; + chunk = newChunk; + } + } + + var len = state.objectMode ? 1 : chunk.length; + state.length += len; + var ret = state.length < state.highWaterMark; // we must ensure that previous needDrain will not be reset to false. + + if (!ret) state.needDrain = true; + + if (state.writing || state.corked) { + var last = state.lastBufferedRequest; + state.lastBufferedRequest = { + chunk: chunk, + encoding: encoding, + isBuf: isBuf, + callback: cb, + next: null + }; + + if (last) { + last.next = state.lastBufferedRequest; + } else { + state.bufferedRequest = state.lastBufferedRequest; + } + + state.bufferedRequestCount += 1; + } else { + doWrite(stream, state, false, len, chunk, encoding, cb); + } + + return ret; +} + +function doWrite(stream, state, writev, len, chunk, encoding, cb) { + state.writelen = len; + state.writecb = cb; + state.writing = true; + state.sync = true; + if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite); + state.sync = false; +} + +function onwriteError(stream, state, sync, er, cb) { + --state.pendingcb; + + if (sync) { + // defer the callback if we are being called synchronously + // to avoid piling up things on the stack + pna.nextTick(cb, er); // this can emit finish, and it will always happen + // after error + + pna.nextTick(finishMaybe, stream, state); + stream._writableState.errorEmitted = true; + stream.emit('error', er); + } else { + // the caller expect this to happen before if + // it is async + cb(er); + stream._writableState.errorEmitted = true; + stream.emit('error', er); // this can emit finish, but finish must + // always follow error + + finishMaybe(stream, state); + } +} + +function onwriteStateUpdate(state) { + state.writing = false; + state.writecb = null; + state.length -= state.writelen; + state.writelen = 0; +} + +function onwrite(stream, er) { + var state = stream._writableState; + var sync = state.sync; + var cb = state.writecb; + onwriteStateUpdate(state); + if (er) onwriteError(stream, state, sync, er, cb);else { + // Check if we're actually ready to finish, but don't emit yet + var finished = needFinish(state); + + if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) { + clearBuffer(stream, state); + } + + if (sync) { + /**/ + asyncWrite(afterWrite, stream, state, finished, cb); + /**/ + } else { + afterWrite(stream, state, finished, cb); + } + } +} + +function afterWrite(stream, state, finished, cb) { + if (!finished) onwriteDrain(stream, state); + state.pendingcb--; + cb(); + finishMaybe(stream, state); +} // Must force callback to be called on nextTick, so that we don't +// emit 'drain' before the write() consumer gets the 'false' return +// value, and has a chance to attach a 'drain' listener. + + +function onwriteDrain(stream, state) { + if (state.length === 0 && state.needDrain) { + state.needDrain = false; + stream.emit('drain'); + } +} // if there's something in the buffer waiting, then process it + + +function clearBuffer(stream, state) { + state.bufferProcessing = true; + var entry = state.bufferedRequest; + + if (stream._writev && entry && entry.next) { + // Fast case, write everything using _writev() + var l = state.bufferedRequestCount; + var buffer = new Array(l); + var holder = state.corkedRequestsFree; + holder.entry = entry; + var count = 0; + var allBuffers = true; + + while (entry) { + buffer[count] = entry; + if (!entry.isBuf) allBuffers = false; + entry = entry.next; + count += 1; + } + + buffer.allBuffers = allBuffers; + doWrite(stream, state, true, state.length, buffer, '', holder.finish); // doWrite is almost always async, defer these to save a bit of time + // as the hot path ends with doWrite + + state.pendingcb++; + state.lastBufferedRequest = null; + + if (holder.next) { + state.corkedRequestsFree = holder.next; + holder.next = null; + } else { + state.corkedRequestsFree = new CorkedRequest(state); + } + + state.bufferedRequestCount = 0; + } else { + // Slow case, write chunks one-by-one + while (entry) { + var chunk = entry.chunk; + var encoding = entry.encoding; + var cb = entry.callback; + var len = state.objectMode ? 1 : chunk.length; + doWrite(stream, state, false, len, chunk, encoding, cb); + entry = entry.next; + state.bufferedRequestCount--; // if we didn't call the onwrite immediately, then + // it means that we need to wait until it does. + // also, that means that the chunk and cb are currently + // being processed, so move the buffer counter past them. + + if (state.writing) { + break; + } + } + + if (entry === null) state.lastBufferedRequest = null; + } + + state.bufferedRequest = entry; + state.bufferProcessing = false; +} + +Writable.prototype._write = function (chunk, encoding, cb) { + cb(new Error('_write() is not implemented')); +}; + +Writable.prototype._writev = null; + +Writable.prototype.end = function (chunk, encoding, cb) { + var state = this._writableState; + + if (typeof chunk === 'function') { + cb = chunk; + chunk = null; + encoding = null; + } else if (typeof encoding === 'function') { + cb = encoding; + encoding = null; + } + + if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); // .end() fully uncorks + + if (state.corked) { + state.corked = 1; + this.uncork(); + } // ignore unnecessary end() calls. + + + if (!state.ending && !state.finished) endWritable(this, state, cb); +}; + +function needFinish(state) { + return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing; +} + +function callFinal(stream, state) { + stream._final(function (err) { + state.pendingcb--; + + if (err) { + stream.emit('error', err); + } + + state.prefinished = true; + stream.emit('prefinish'); + finishMaybe(stream, state); + }); +} + +function prefinish(stream, state) { + if (!state.prefinished && !state.finalCalled) { + if (typeof stream._final === 'function') { + state.pendingcb++; + state.finalCalled = true; + pna.nextTick(callFinal, stream, state); + } else { + state.prefinished = true; + stream.emit('prefinish'); + } + } +} + +function finishMaybe(stream, state) { + var need = needFinish(state); + + if (need) { + prefinish(stream, state); + + if (state.pendingcb === 0) { + state.finished = true; + stream.emit('finish'); + } + } + + return need; +} + +function endWritable(stream, state, cb) { + state.ending = true; + finishMaybe(stream, state); + + if (cb) { + if (state.finished) pna.nextTick(cb);else stream.once('finish', cb); + } + + state.ended = true; + stream.writable = false; +} + +function onCorkedFinish(corkReq, state, err) { + var entry = corkReq.entry; + corkReq.entry = null; + + while (entry) { + var cb = entry.callback; + state.pendingcb--; + cb(err); + entry = entry.next; + } + + if (state.corkedRequestsFree) { + state.corkedRequestsFree.next = corkReq; + } else { + state.corkedRequestsFree = corkReq; + } +} + +Object.defineProperty(Writable.prototype, 'destroyed', { + get: function get() { + if (this._writableState === undefined) { + return false; + } + + return this._writableState.destroyed; + }, + set: function set(value) { + // we ignore the value if the stream + // has not been initialized yet + if (!this._writableState) { + return; + } // backward compatibility, the user is explicitly + // managing destroyed + + + this._writableState.destroyed = value; + } +}); +Writable.prototype.destroy = destroyImpl.destroy; +Writable.prototype._undestroy = destroyImpl.undestroy; + +Writable.prototype._destroy = function (err, cb) { + this.end(); + cb(err); +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(36).setImmediate, __webpack_require__(10))) + +/***/ }), +/* 80 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Buffer = __webpack_require__(7).Buffer; + +var Transform = __webpack_require__(131).Transform; + +var StringDecoder = __webpack_require__(25).StringDecoder; + +var inherits = __webpack_require__(2); + +function CipherBase(hashMode) { + Transform.call(this); + this.hashMode = typeof hashMode === 'string'; + + if (this.hashMode) { + this[hashMode] = this._finalOrDigest; + } else { + this["final"] = this._finalOrDigest; + } + + if (this._final) { + this.__final = this._final; + this._final = null; + } + + this._decoder = null; + this._encoding = null; +} + +inherits(CipherBase, Transform); + +CipherBase.prototype.update = function (data, inputEnc, outputEnc) { + if (typeof data === 'string') { + data = Buffer.from(data, inputEnc); + } + + var outData = this._update(data); + + if (this.hashMode) return this; + + if (outputEnc) { + outData = this._toString(outData, outputEnc); + } + + return outData; +}; + +CipherBase.prototype.setAutoPadding = function () {}; + +CipherBase.prototype.getAuthTag = function () { + throw new Error('trying to get auth tag in unsupported state'); +}; + +CipherBase.prototype.setAuthTag = function () { + throw new Error('trying to set auth tag in unsupported state'); +}; + +CipherBase.prototype.setAAD = function () { + throw new Error('trying to set aad in unsupported state'); +}; + +CipherBase.prototype._transform = function (data, _, next) { + var err; + + try { + if (this.hashMode) { + this._update(data); + } else { + this.push(this._update(data)); + } + } catch (e) { + err = e; + } finally { + next(err); + } +}; + +CipherBase.prototype._flush = function (done) { + var err; + + try { + this.push(this.__final()); + } catch (e) { + err = e; + } + + done(err); +}; + +CipherBase.prototype._finalOrDigest = function (outputEnc) { + var outData = this.__final() || Buffer.alloc(0); + + if (outputEnc) { + outData = this._toString(outData, outputEnc, true); + } + + return outData; +}; + +CipherBase.prototype._toString = function (value, enc, fin) { + if (!this._decoder) { + this._decoder = new StringDecoder(enc); + this._encoding = enc; + } + + if (this._encoding !== enc) throw new Error('can\'t switch encodings'); + + var out = this._decoder.write(value); + + if (fin) { + out += this._decoder.end(); + } + + return out; +}; + +module.exports = CipherBase; + +/***/ }), +/* 81 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * This method returns `undefined`. + * + * @static + * @memberOf _ + * @since 2.3.0 + * @category Util + * @example + * + * _.times(2, _.noop); + * // => [undefined, undefined] + */ +function noop() {// No operation performed. +} + +module.exports = noop; + +/***/ }), +/* 82 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports["default"] = onlyOnce; + +function onlyOnce(fn) { + return function () { + if (fn === null) throw new Error("Callback was already called."); + var callFn = fn; + fn = null; + callFn.apply(this, arguments); + }; +} + +module.exports = exports["default"]; + +/***/ }), +/* 83 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports.isAsync = undefined; + +var _asyncify = __webpack_require__(302); + +var _asyncify2 = _interopRequireDefault(_asyncify); + +function _interopRequireDefault(obj) { + return obj && obj.__esModule ? obj : { + "default": obj + }; +} + +var supportsSymbol = typeof Symbol === 'function'; + +function isAsync(fn) { + return supportsSymbol && fn[Symbol.toStringTag] === 'AsyncFunction'; +} + +function wrapAsync(asyncFn) { + return isAsync(asyncFn) ? (0, _asyncify2["default"])(asyncFn) : asyncFn; +} + +exports["default"] = wrapAsync; +exports.isAsync = isAsync; + +/***/ }), +/* 84 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function isFunction(f) { + return 'function' === typeof f; +} + +function isDuplex(d) { + return 'object' === _typeof(d) && isSource(d.source) && isSink(d.sink); +} + +function isSource(s) { + return isFunction(s) && s.length === 2; +} + +function isSink(s) { + return isFunction(s) && s.length === 1; +} + +exports.isDuplex = isDuplex; +exports.isSource = isSource; +exports.isSink = isSink; //can't do is through, it will appear as a sink til you git it a source. + +/***/ }), +/* 85 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var _Symbol = __webpack_require__(157), + getRawTag = __webpack_require__(326), + objectToString = __webpack_require__(327); +/** `Object#toString` result references. */ + + +var nullTag = '[object Null]', + undefinedTag = '[object Undefined]'; +/** Built-in value references. */ + +var symToStringTag = _Symbol ? _Symbol.toStringTag : undefined; +/** + * The base implementation of `getTag` without fallbacks for buggy environments. + * + * @private + * @param {*} value The value to query. + * @returns {string} Returns the `toStringTag`. + */ + +function baseGetTag(value) { + if (value == null) { + return value === undefined ? undefinedTag : nullTag; + } + + return symToStringTag && symToStringTag in Object(value) ? getRawTag(value) : objectToString(value); +} + +module.exports = baseGetTag; + +/***/ }), +/* 86 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** + * Checks if `value` is object-like. A value is object-like if it's not `null` + * and has a `typeof` result of "object". + * + * @static + * @memberOf _ + * @since 4.0.0 + * @category Lang + * @param {*} value The value to check. + * @returns {boolean} Returns `true` if `value` is object-like, else `false`. + * @example + * + * _.isObjectLike({}); + * // => true + * + * _.isObjectLike([1, 2, 3]); + * // => true + * + * _.isObjectLike(_.noop); + * // => false + * + * _.isObjectLike(null); + * // => false + */ +function isObjectLike(value) { + return value != null && _typeof(value) == 'object'; +} + +module.exports = isObjectLike; + +/***/ }), +/* 87 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var once = __webpack_require__(17); + +var ConcatStream = __webpack_require__(41); + +var SendFilesStream = __webpack_require__(43); + +module.exports = function (send, path) { + var sendFilesStream = SendFilesStream(send, path); + return function (file, options, _callback) { + var callback = once(_callback); + var stream = sendFilesStream(options); + var concat = ConcatStream(function (results) { + return callback(null, results); + }); + stream.once('error', callback); + stream.pipe(concat); + stream.write(file); + stream.end(); + }; +}; + +/***/ }), +/* 88 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var _require = __webpack_require__(163), + URLWithLegacySupport = _require.URLWithLegacySupport, + format = _require.format, + URLSearchParams = _require.URLSearchParams, + defaultBase = _require.defaultBase; + +var relative = __webpack_require__(363); + +module.exports = { + URL: URLWithLegacySupport, + URLSearchParams: URLSearchParams, + format: format, + relative: relative, + defaultBase: defaultBase +}; + +/***/ }), +/* 89 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var once = __webpack_require__(17); + +var noop = function noop() {}; + +var isRequest = function isRequest(stream) { + return stream.setHeader && typeof stream.abort === 'function'; +}; + +var isChildProcess = function isChildProcess(stream) { + return stream.stdio && Array.isArray(stream.stdio) && stream.stdio.length === 3; +}; + +var eos = function eos(stream, opts, callback) { + if (typeof opts === 'function') return eos(stream, null, opts); + if (!opts) opts = {}; + callback = once(callback || noop); + var ws = stream._writableState; + var rs = stream._readableState; + var readable = opts.readable || opts.readable !== false && stream.readable; + var writable = opts.writable || opts.writable !== false && stream.writable; + + var onlegacyfinish = function onlegacyfinish() { + if (!stream.writable) onfinish(); + }; + + var onfinish = function onfinish() { + writable = false; + if (!readable) callback.call(stream); + }; + + var onend = function onend() { + readable = false; + if (!writable) callback.call(stream); + }; + + var onexit = function onexit(exitCode) { + callback.call(stream, exitCode ? new Error('exited with error code: ' + exitCode) : null); + }; + + var onerror = function onerror(err) { + callback.call(stream, err); + }; + + var onclose = function onclose() { + if (readable && !(rs && rs.ended)) return callback.call(stream, new Error('premature close')); + if (writable && !(ws && ws.ended)) return callback.call(stream, new Error('premature close')); + }; + + var onrequest = function onrequest() { + stream.req.on('finish', onfinish); + }; + + if (isRequest(stream)) { + stream.on('complete', onfinish); + stream.on('abort', onclose); + if (stream.req) onrequest();else stream.on('request', onrequest); + } else if (writable && !ws) { + // legacy streams + stream.on('end', onlegacyfinish); + stream.on('close', onlegacyfinish); + } + + if (isChildProcess(stream)) stream.on('exit', onexit); + stream.on('end', onend); + stream.on('finish', onfinish); + if (opts.error !== false) stream.on('error', onerror); + stream.on('close', onclose); + return function () { + stream.removeListener('complete', onfinish); + stream.removeListener('abort', onclose); + stream.removeListener('request', onrequest); + if (stream.req) stream.req.removeListener('finish', onfinish); + stream.removeListener('end', onlegacyfinish); + stream.removeListener('close', onlegacyfinish); + stream.removeListener('finish', onfinish); + stream.removeListener('exit', onexit); + stream.removeListener('end', onend); + stream.removeListener('error', onerror); + stream.removeListener('close', onclose); + }; +}; + +module.exports = eos; + +/***/ }), +/* 90 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } + +function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } + +function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } + +function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } + +function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } + +var pump = __webpack_require__(11); + +var tar = __webpack_require__(374); + +var ReadableStream = __webpack_require__(5).Readable; + +var ObjectsStreams = +/*#__PURE__*/ +function (_ReadableStream) { + _inherits(ObjectsStreams, _ReadableStream); + + function ObjectsStreams(options) { + _classCallCheck(this, ObjectsStreams); + + var opts = Object.assign(options || {}, { + objectMode: true + }); + return _possibleConstructorReturn(this, _getPrototypeOf(ObjectsStreams).call(this, opts)); + } + + _createClass(ObjectsStreams, [{ + key: "_read", + value: function _read() {} + }]); + + return ObjectsStreams; +}(ReadableStream); +/* + Transform a tar stream into a stream of objects: + + Output format: + { path: 'string', content: Stream } +*/ + + +var TarStreamToObjects = function TarStreamToObjects(inputStream, callback) { + var outputStream = new ObjectsStreams(); + var extractStream = tar.extract(); + extractStream.on('entry', function (header, stream, next) { + stream.on('end', next); + + if (header.type !== 'directory') { + outputStream.push({ + path: header.name, + content: stream + }); + } else { + outputStream.push({ + path: header.name + }); + stream.resume(); + } + }).on('finish', function () { + return outputStream.push(null); + }); + pump(inputStream, extractStream); + callback(null, outputStream); +}; + +module.exports = TarStreamToObjects; + +/***/ }), +/* 91 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function id(e) { + return e; +} + +var prop = __webpack_require__(45); + +module.exports = function map(mapper) { + if (!mapper) return id; + mapper = prop(mapper); + return function (read) { + return function (abort, cb) { + read(abort, function (end, data) { + try { + data = !end ? mapper(data) : null; + } catch (err) { + return read(err, function () { + return cb(err); + }); + } + + cb(end, data); + }); + }; + }; +}; + +/***/ }), +/* 92 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var has = Object.prototype.hasOwnProperty; +var isArray = Array.isArray; + +var hexTable = function () { + var array = []; + + for (var i = 0; i < 256; ++i) { + array.push('%' + ((i < 16 ? '0' : '') + i.toString(16)).toUpperCase()); + } + + return array; +}(); + +var compactQueue = function compactQueue(queue) { + while (queue.length > 1) { + var item = queue.pop(); + var obj = item.obj[item.prop]; + + if (isArray(obj)) { + var compacted = []; + + for (var j = 0; j < obj.length; ++j) { + if (typeof obj[j] !== 'undefined') { + compacted.push(obj[j]); + } + } + + item.obj[item.prop] = compacted; + } + } +}; + +var arrayToObject = function arrayToObject(source, options) { + var obj = options && options.plainObjects ? Object.create(null) : {}; + + for (var i = 0; i < source.length; ++i) { + if (typeof source[i] !== 'undefined') { + obj[i] = source[i]; + } + } + + return obj; +}; + +var merge = function merge(target, source, options) { + if (!source) { + return target; + } + + if (_typeof(source) !== 'object') { + if (isArray(target)) { + target.push(source); + } else if (target && _typeof(target) === 'object') { + if (options && (options.plainObjects || options.allowPrototypes) || !has.call(Object.prototype, source)) { + target[source] = true; + } + } else { + return [target, source]; + } + + return target; + } + + if (!target || _typeof(target) !== 'object') { + return [target].concat(source); + } + + var mergeTarget = target; + + if (isArray(target) && !isArray(source)) { + mergeTarget = arrayToObject(target, options); + } + + if (isArray(target) && isArray(source)) { + source.forEach(function (item, i) { + if (has.call(target, i)) { + var targetItem = target[i]; + + if (targetItem && _typeof(targetItem) === 'object' && item && _typeof(item) === 'object') { + target[i] = merge(targetItem, item, options); + } else { + target.push(item); + } + } else { + target[i] = item; + } + }); + return target; + } + + return Object.keys(source).reduce(function (acc, key) { + var value = source[key]; + + if (has.call(acc, key)) { + acc[key] = merge(acc[key], value, options); + } else { + acc[key] = value; + } + + return acc; + }, mergeTarget); +}; + +var assign = function assignSingleSource(target, source) { + return Object.keys(source).reduce(function (acc, key) { + acc[key] = source[key]; + return acc; + }, target); +}; + +var decode = function decode(str, decoder, charset) { + var strWithoutPlus = str.replace(/\+/g, ' '); + + if (charset === 'iso-8859-1') { + // unescape never throws, no try...catch needed: + return strWithoutPlus.replace(/%[0-9a-f]{2}/gi, unescape); + } // utf-8 + + + try { + return decodeURIComponent(strWithoutPlus); + } catch (e) { + return strWithoutPlus; + } +}; + +var encode = function encode(str, defaultEncoder, charset) { + // This code was originally written by Brian White (mscdex) for the io.js core querystring library. + // It has been adapted here for stricter adherence to RFC 3986 + if (str.length === 0) { + return str; + } + + var string = typeof str === 'string' ? str : String(str); + + if (charset === 'iso-8859-1') { + return escape(string).replace(/%u[0-9a-f]{4}/gi, function ($0) { + return '%26%23' + parseInt($0.slice(2), 16) + '%3B'; + }); + } + + var out = ''; + + for (var i = 0; i < string.length; ++i) { + var c = string.charCodeAt(i); + + if (c === 0x2D // - + || c === 0x2E // . + || c === 0x5F // _ + || c === 0x7E // ~ + || c >= 0x30 && c <= 0x39 // 0-9 + || c >= 0x41 && c <= 0x5A // a-z + || c >= 0x61 && c <= 0x7A // A-Z + ) { + out += string.charAt(i); + continue; + } + + if (c < 0x80) { + out = out + hexTable[c]; + continue; + } + + if (c < 0x800) { + out = out + (hexTable[0xC0 | c >> 6] + hexTable[0x80 | c & 0x3F]); + continue; + } + + if (c < 0xD800 || c >= 0xE000) { + out = out + (hexTable[0xE0 | c >> 12] + hexTable[0x80 | c >> 6 & 0x3F] + hexTable[0x80 | c & 0x3F]); + continue; + } + + i += 1; + c = 0x10000 + ((c & 0x3FF) << 10 | string.charCodeAt(i) & 0x3FF); + out += hexTable[0xF0 | c >> 18] + hexTable[0x80 | c >> 12 & 0x3F] + hexTable[0x80 | c >> 6 & 0x3F] + hexTable[0x80 | c & 0x3F]; + } + + return out; +}; + +var compact = function compact(value) { + var queue = [{ + obj: { + o: value + }, + prop: 'o' + }]; + var refs = []; + + for (var i = 0; i < queue.length; ++i) { + var item = queue[i]; + var obj = item.obj[item.prop]; + var keys = Object.keys(obj); + + for (var j = 0; j < keys.length; ++j) { + var key = keys[j]; + var val = obj[key]; + + if (_typeof(val) === 'object' && val !== null && refs.indexOf(val) === -1) { + queue.push({ + obj: obj, + prop: key + }); + refs.push(val); + } + } + } + + compactQueue(queue); + return value; +}; + +var isRegExp = function isRegExp(obj) { + return Object.prototype.toString.call(obj) === '[object RegExp]'; +}; + +var isBuffer = function isBuffer(obj) { + if (!obj || _typeof(obj) !== 'object') { + return false; + } + + return !!(obj.constructor && obj.constructor.isBuffer && obj.constructor.isBuffer(obj)); +}; + +var combine = function combine(a, b) { + return [].concat(a, b); +}; + +module.exports = { + arrayToObject: arrayToObject, + assign: assign, + combine: combine, + compact: compact, + decode: decode, + encode: encode, + isBuffer: isBuffer, + isRegExp: isRegExp, + merge: merge +}; + +/***/ }), +/* 93 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var through = __webpack_require__(60); + +var split = __webpack_require__(386); + +var EOL = __webpack_require__(104).EOL; + +var stringify = __webpack_require__(387); + +module.exports = parse; +module.exports.serialize = module.exports.stringify = serialize; +module.exports.parse = parse; + +function parse(opts) { + opts = opts || {}; + opts.strict = opts.strict !== false; + + function parseRow(row) { + try { + if (row) return JSON.parse(row); + } catch (e) { + if (opts.strict) { + this.emit('error', new Error('Could not parse row ' + row.slice(0, 50) + '...')); + } + } + } + + return split(parseRow, opts); +} + +function serialize(opts) { + return through.obj(opts, function (obj, enc, cb) { + cb(null, stringify(obj) + EOL); + }); +} + +/***/ }), +/* 94 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var IsIpfs = __webpack_require__(13); + +var promisify = __webpack_require__(1); + +var streamToValueWithTransformer = __webpack_require__(46); + +var moduleConfig = __webpack_require__(3); + +var cleanCID = __webpack_require__(18); + +module.exports = function (arg) { + var send = moduleConfig(arg); + var refs = promisify(function (args, opts, callback) { + if (typeof opts === 'function') { + callback = opts; + opts = {}; + } + + opts = module.exports.normalizeOpts(opts); + + try { + args = module.exports.checkArgs(args); + } catch (err) { + return callback(err); + } + + var transform = function transform(res, cb) { + cb(null, res.map(function (r) { + return { + ref: r.Ref, + err: r.Err + }; + })); + }; + + var request = { + args: args, + path: 'refs', + qs: opts + }; + send(request, function (err, result) { + if (err) { + return callback(err); + } + + streamToValueWithTransformer(result, transform, callback); + }); + }); + refs.local = __webpack_require__(394)(arg); + refs.localReadableStream = __webpack_require__(395)(arg); + refs.localPullStream = __webpack_require__(396)(arg); + return refs; +}; + +module.exports.checkArgs = function (args) { + var isArray = Array.isArray(args); + args = isArray ? args : [args]; + var res = []; + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = args[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var arg = _step.value; + + try { + arg = cleanCID(arg); + } catch (err) { + if (!IsIpfs.ipfsPath(arg)) { + throw err; + } + } + + res.push(arg); + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator["return"] != null) { + _iterator["return"](); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } + + return isArray ? res : res[0]; +}; + +module.exports.normalizeOpts = function (opts) { + opts = opts || {}; + + if (typeof opts.maxDepth === 'number') { + opts['max-depth'] = opts.maxDepth; + } + + return opts; +}; + +/***/ }), +/* 95 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var drain = __webpack_require__(47); + +module.exports = function reduce(reducer, acc, cb) { + if (!cb) cb = acc, acc = null; + var sink = drain(function (data) { + acc = reducer(acc, data); + }, function (err) { + cb(err, acc); + }); + if (arguments.length === 2) return function (source) { + source(null, function (end, data) { + //if ended immediately, and no initial... + if (end) return cb(end === true ? null : end); + acc = data; + sink(source); + }); + };else return sink; +}; + +/***/ }), +/* 96 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var tester = __webpack_require__(177); + +module.exports = function filter(test) { + //regexp + test = tester(test); + return function (read) { + return function next(end, cb) { + var sync, + loop = true; + + while (loop) { + loop = false; + sync = true; + read(end, function (end, data) { + if (!end && !test(data)) return sync ? loop = true : next(end, cb); + cb(end, data); + }); + sync = false; + } + }; + }; +}; + +/***/ }), +/* 97 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function createError(msg, code, props) { + var err = msg instanceof Error ? msg : new Error(msg); + var key; + + if (_typeof(code) === 'object') { + props = code; + } else if (code != null) { + err.code = code; + } + + if (props) { + for (key in props) { + err[key] = props[key]; + } + } + + return err; +} + +module.exports = createError; + +/***/ }), +/* 98 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var Bignumber = __webpack_require__(20); + +var constants = __webpack_require__(66); + +var SHIFT32 = constants.SHIFT32; +var SHIFT16 = constants.SHIFT16; +var MAX_SAFE_HIGH = 0x1fffff; + +exports.parseHalf = function parseHalf(buf) { + var exp, mant, sign; + sign = buf[0] & 0x80 ? -1 : 1; + exp = (buf[0] & 0x7C) >> 2; + mant = (buf[0] & 0x03) << 8 | buf[1]; + + if (!exp) { + return sign * 5.9604644775390625e-8 * mant; + } else if (exp === 0x1f) { + return sign * (mant ? 0 / 0 : 2e308); + } else { + return sign * Math.pow(2, exp - 25) * (1024 + mant); + } +}; + +function toHex(n) { + if (n < 16) { + return '0' + n.toString(16); + } + + return n.toString(16); +} + +exports.arrayBufferToBignumber = function (buf) { + var len = buf.byteLength; + var res = ''; + + for (var i = 0; i < len; i++) { + res += toHex(buf[i]); + } + + return new Bignumber(res, 16); +}; // convert an Object into a Map + + +exports.buildMap = function (obj) { + var res = new Map(); + var keys = Object.keys(obj); + var length = keys.length; + + for (var i = 0; i < length; i++) { + res.set(keys[i], obj[keys[i]]); + } + + return res; +}; + +exports.buildInt32 = function (f, g) { + return f * SHIFT16 + g; +}; + +exports.buildInt64 = function (f1, f2, g1, g2) { + var f = exports.buildInt32(f1, f2); + var g = exports.buildInt32(g1, g2); + + if (f > MAX_SAFE_HIGH) { + return new Bignumber(f).times(SHIFT32).plus(g); + } else { + return f * SHIFT32 + g; + } +}; + +exports.writeHalf = function writeHalf(buf, half) { + // assume 0, -0, NaN, Infinity, and -Infinity have already been caught + // HACK: everyone settle in. This isn't going to be pretty. + // Translate cn-cbor's C code (from Carsten Borman): + // uint32_t be32; + // uint16_t be16, u16; + // union { + // float f; + // uint32_t u; + // } u32; + // u32.f = float_val; + var u32 = Buffer.allocUnsafe(4); + u32.writeFloatBE(half, 0); + var u = u32.readUInt32BE(0); // if ((u32.u & 0x1FFF) == 0) { /* worth trying half */ + // hildjj: If the lower 13 bits are 0, we won't lose anything in the conversion + + if ((u & 0x1FFF) !== 0) { + return false; + } // int s16 = (u32.u >> 16) & 0x8000; + // int exp = (u32.u >> 23) & 0xff; + // int mant = u32.u & 0x7fffff; + + + var s16 = u >> 16 & 0x8000; // top bit is sign + + var exp = u >> 23 & 0xff; // then 5 bits of exponent + + var mant = u & 0x7fffff; // if (exp == 0 && mant == 0) + // ; /* 0.0, -0.0 */ + // hildjj: zeros already handled. Assert if you don't believe me. + // else if (exp >= 113 && exp <= 142) /* normalized */ + // s16 += ((exp - 112) << 10) + (mant >> 13); + + if (exp >= 113 && exp <= 142) { + s16 += (exp - 112 << 10) + (mant >> 13); // else if (exp >= 103 && exp < 113) { /* denorm, exp16 = 0 */ + // if (mant & ((1 << (126 - exp)) - 1)) + // goto float32; /* loss of precision */ + // s16 += ((mant + 0x800000) >> (126 - exp)); + } else if (exp >= 103 && exp < 113) { + if (mant & (1 << 126 - exp) - 1) { + return false; + } + + s16 += mant + 0x800000 >> 126 - exp; // } else if (exp == 255 && mant == 0) { /* Inf */ + // s16 += 0x7c00; + // hildjj: Infinity already handled + // } else + // goto float32; /* loss of range */ + } else { + return false; + } // ensure_writable(3); + // u16 = s16; + // be16 = hton16p((const uint8_t*)&u16); + + + buf.writeUInt16BE(s16, 0); + return true; +}; + +exports.keySorter = function (a, b) { + var lenA = a[0].byteLength; + var lenB = b[0].byteLength; + + if (lenA > lenB) { + return 1; + } + + if (lenB > lenA) { + return -1; + } + + return a[0].compare(b[0]); +}; // Adapted from http://www.2ality.com/2012/03/signedzero.html + + +exports.isNegativeZero = function (x) { + return x === 0 && 1 / x < 0; +}; + +exports.nextPowerOf2 = function (n) { + var count = 0; // First n in the below condition is for + // the case where n is 0 + + if (n && !(n & n - 1)) { + return n; + } + + while (n !== 0) { + n >>= 1; + count += 1; + } + + return 1 << count; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 99 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + // A linked list to keep track of recently-used-ness + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var Yallist = __webpack_require__(467); + +var MAX = Symbol('max'); +var LENGTH = Symbol('length'); +var LENGTH_CALCULATOR = Symbol('lengthCalculator'); +var ALLOW_STALE = Symbol('allowStale'); +var MAX_AGE = Symbol('maxAge'); +var DISPOSE = Symbol('dispose'); +var NO_DISPOSE_ON_SET = Symbol('noDisposeOnSet'); +var LRU_LIST = Symbol('lruList'); +var CACHE = Symbol('cache'); +var UPDATE_AGE_ON_GET = Symbol('updateAgeOnGet'); + +var naiveLength = function naiveLength() { + return 1; +}; // lruList is a yallist where the head is the youngest +// item, and the tail is the oldest. the list contains the Hit +// objects as the entries. +// Each Hit object has a reference to its Yallist.Node. This +// never changes. +// +// cache is a Map (or PseudoMap) that matches the keys to +// the Yallist.Node object. + + +var LRUCache = +/*#__PURE__*/ +function () { + function LRUCache(options) { + _classCallCheck(this, LRUCache); + + if (typeof options === 'number') options = { + max: options + }; + if (!options) options = {}; + if (options.max && (typeof options.max !== 'number' || options.max < 0)) throw new TypeError('max must be a non-negative number'); // Kind of weird to have a default max of Infinity, but oh well. + + var max = this[MAX] = options.max || Infinity; + var lc = options.length || naiveLength; + this[LENGTH_CALCULATOR] = typeof lc !== 'function' ? naiveLength : lc; + this[ALLOW_STALE] = options.stale || false; + if (options.maxAge && typeof options.maxAge !== 'number') throw new TypeError('maxAge must be a number'); + this[MAX_AGE] = options.maxAge || 0; + this[DISPOSE] = options.dispose; + this[NO_DISPOSE_ON_SET] = options.noDisposeOnSet || false; + this[UPDATE_AGE_ON_GET] = options.updateAgeOnGet || false; + this.reset(); + } // resize the cache when the max changes. + + + _createClass(LRUCache, [{ + key: "rforEach", + value: function rforEach(fn, thisp) { + thisp = thisp || this; + + for (var walker = this[LRU_LIST].tail; walker !== null;) { + var prev = walker.prev; + forEachStep(this, fn, walker, thisp); + walker = prev; + } + } + }, { + key: "forEach", + value: function forEach(fn, thisp) { + thisp = thisp || this; + + for (var walker = this[LRU_LIST].head; walker !== null;) { + var next = walker.next; + forEachStep(this, fn, walker, thisp); + walker = next; + } + } + }, { + key: "keys", + value: function keys() { + return this[LRU_LIST].toArray().map(function (k) { + return k.key; + }); + } + }, { + key: "values", + value: function values() { + return this[LRU_LIST].toArray().map(function (k) { + return k.value; + }); + } + }, { + key: "reset", + value: function reset() { + var _this = this; + + if (this[DISPOSE] && this[LRU_LIST] && this[LRU_LIST].length) { + this[LRU_LIST].forEach(function (hit) { + return _this[DISPOSE](hit.key, hit.value); + }); + } + + this[CACHE] = new Map(); // hash of items by key + + this[LRU_LIST] = new Yallist(); // list of items in order of use recency + + this[LENGTH] = 0; // length of items in the list + } + }, { + key: "dump", + value: function dump() { + var _this2 = this; + + return this[LRU_LIST].map(function (hit) { + return isStale(_this2, hit) ? false : { + k: hit.key, + v: hit.value, + e: hit.now + (hit.maxAge || 0) + }; + }).toArray().filter(function (h) { + return h; + }); + } + }, { + key: "dumpLru", + value: function dumpLru() { + return this[LRU_LIST]; + } + }, { + key: "set", + value: function set(key, value, maxAge) { + maxAge = maxAge || this[MAX_AGE]; + if (maxAge && typeof maxAge !== 'number') throw new TypeError('maxAge must be a number'); + var now = maxAge ? Date.now() : 0; + var len = this[LENGTH_CALCULATOR](value, key); + + if (this[CACHE].has(key)) { + if (len > this[MAX]) { + _del(this, this[CACHE].get(key)); + + return false; + } + + var node = this[CACHE].get(key); + var item = node.value; // dispose of the old one before overwriting + // split out into 2 ifs for better coverage tracking + + if (this[DISPOSE]) { + if (!this[NO_DISPOSE_ON_SET]) this[DISPOSE](key, item.value); + } + + item.now = now; + item.maxAge = maxAge; + item.value = value; + this[LENGTH] += len - item.length; + item.length = len; + this.get(key); + trim(this); + return true; + } + + var hit = new Entry(key, value, len, now, maxAge); // oversized objects fall out of cache automatically. + + if (hit.length > this[MAX]) { + if (this[DISPOSE]) this[DISPOSE](key, value); + return false; + } + + this[LENGTH] += hit.length; + this[LRU_LIST].unshift(hit); + this[CACHE].set(key, this[LRU_LIST].head); + trim(this); + return true; + } + }, { + key: "has", + value: function has(key) { + if (!this[CACHE].has(key)) return false; + var hit = this[CACHE].get(key).value; + return !isStale(this, hit); + } + }, { + key: "get", + value: function get(key) { + return _get(this, key, true); + } + }, { + key: "peek", + value: function peek(key) { + return _get(this, key, false); + } + }, { + key: "pop", + value: function pop() { + var node = this[LRU_LIST].tail; + if (!node) return null; + + _del(this, node); + + return node.value; + } + }, { + key: "del", + value: function del(key) { + _del(this, this[CACHE].get(key)); + } + }, { + key: "load", + value: function load(arr) { + // reset the cache + this.reset(); + var now = Date.now(); // A previous serialized cache has the most recent items first + + for (var l = arr.length - 1; l >= 0; l--) { + var hit = arr[l]; + var expiresAt = hit.e || 0; + if (expiresAt === 0) // the item was created without expiration in a non aged cache + this.set(hit.k, hit.v);else { + var maxAge = expiresAt - now; // dont add already expired items + + if (maxAge > 0) { + this.set(hit.k, hit.v, maxAge); + } + } + } + } + }, { + key: "prune", + value: function prune() { + var _this3 = this; + + this[CACHE].forEach(function (value, key) { + return _get(_this3, key, false); + }); + } + }, { + key: "max", + set: function set(mL) { + if (typeof mL !== 'number' || mL < 0) throw new TypeError('max must be a non-negative number'); + this[MAX] = mL || Infinity; + trim(this); + }, + get: function get() { + return this[MAX]; + } + }, { + key: "allowStale", + set: function set(allowStale) { + this[ALLOW_STALE] = !!allowStale; + }, + get: function get() { + return this[ALLOW_STALE]; + } + }, { + key: "maxAge", + set: function set(mA) { + if (typeof mA !== 'number') throw new TypeError('maxAge must be a non-negative number'); + this[MAX_AGE] = mA; + trim(this); + }, + get: function get() { + return this[MAX_AGE]; + } // resize the cache when the lengthCalculator changes. + + }, { + key: "lengthCalculator", + set: function set(lC) { + var _this4 = this; + + if (typeof lC !== 'function') lC = naiveLength; + + if (lC !== this[LENGTH_CALCULATOR]) { + this[LENGTH_CALCULATOR] = lC; + this[LENGTH] = 0; + this[LRU_LIST].forEach(function (hit) { + hit.length = _this4[LENGTH_CALCULATOR](hit.value, hit.key); + _this4[LENGTH] += hit.length; + }); + } + + trim(this); + }, + get: function get() { + return this[LENGTH_CALCULATOR]; + } + }, { + key: "length", + get: function get() { + return this[LENGTH]; + } + }, { + key: "itemCount", + get: function get() { + return this[LRU_LIST].length; + } + }]); + + return LRUCache; +}(); + +var _get = function _get(self, key, doUse) { + var node = self[CACHE].get(key); + + if (node) { + var hit = node.value; + + if (isStale(self, hit)) { + _del(self, node); + + if (!self[ALLOW_STALE]) return undefined; + } else { + if (doUse) { + if (self[UPDATE_AGE_ON_GET]) node.value.now = Date.now(); + self[LRU_LIST].unshiftNode(node); + } + } + + return hit.value; + } +}; + +var isStale = function isStale(self, hit) { + if (!hit || !hit.maxAge && !self[MAX_AGE]) return false; + var diff = Date.now() - hit.now; + return hit.maxAge ? diff > hit.maxAge : self[MAX_AGE] && diff > self[MAX_AGE]; +}; + +var trim = function trim(self) { + if (self[LENGTH] > self[MAX]) { + for (var walker = self[LRU_LIST].tail; self[LENGTH] > self[MAX] && walker !== null;) { + // We know that we're about to delete this one, and also + // what the next least recently used key will be, so just + // go ahead and set it now. + var prev = walker.prev; + + _del(self, walker); + + walker = prev; + } + } +}; + +var _del = function _del(self, node) { + if (node) { + var hit = node.value; + if (self[DISPOSE]) self[DISPOSE](hit.key, hit.value); + self[LENGTH] -= hit.length; + self[CACHE]["delete"](hit.key); + self[LRU_LIST].removeNode(node); + } +}; + +var Entry = function Entry(key, value, length, now, maxAge) { + _classCallCheck(this, Entry); + + this.key = key; + this.value = value; + this.length = length; + this.now = now; + this.maxAge = maxAge || 0; +}; + +var forEachStep = function forEachStep(self, fn, node, thisp) { + var hit = node.value; + + if (isStale(self, hit)) { + _del(self, node); + + if (!self[ALLOW_STALE]) hit = undefined; + } + + if (hit) fn.call(thisp, hit.value, hit.key, self); +}; + +module.exports = LRUCache; + +/***/ }), +/* 100 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } + +function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } + +function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } + +function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } + +function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } + +var TransformStream = __webpack_require__(5).Transform; + +var pingMessageConverter = __webpack_require__(501); + +var PingMessageStream = +/*#__PURE__*/ +function (_TransformStream) { + _inherits(PingMessageStream, _TransformStream); + + function PingMessageStream(options) { + _classCallCheck(this, PingMessageStream); + + var opts = Object.assign(options || {}, { + objectMode: true + }); + return _possibleConstructorReturn(this, _getPrototypeOf(PingMessageStream).call(this, opts)); + } + + _createClass(PingMessageStream, [{ + key: "_transform", + value: function _transform(obj, enc, callback) { + try { + var msg = pingMessageConverter(obj); + this.push(msg); + + if (!msg.success) { + throw new Error(msg.text); + } + } catch (err) { + return callback(err); + } + + callback(); + } + }]); + + return PingMessageStream; +}(TransformStream); + +module.exports = PingMessageStream; + +/***/ }), +/* 101 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Big = __webpack_require__(20); + +module.exports = function (chunk) { + return { + totalIn: new Big(chunk.TotalIn), + totalOut: new Big(chunk.TotalOut), + rateIn: new Big(chunk.RateIn), + rateOut: new Big(chunk.RateOut) + }; +}; + +/***/ }), +/* 102 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.read = function (buffer, offset, isLE, mLen, nBytes) { + var e, m; + var eLen = nBytes * 8 - mLen - 1; + var eMax = (1 << eLen) - 1; + var eBias = eMax >> 1; + var nBits = -7; + var i = isLE ? nBytes - 1 : 0; + var d = isLE ? -1 : 1; + var s = buffer[offset + i]; + i += d; + e = s & (1 << -nBits) - 1; + s >>= -nBits; + nBits += eLen; + + for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {} + + m = e & (1 << -nBits) - 1; + e >>= -nBits; + nBits += mLen; + + for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {} + + if (e === 0) { + e = 1 - eBias; + } else if (e === eMax) { + return m ? NaN : (s ? -1 : 1) * Infinity; + } else { + m = m + Math.pow(2, mLen); + e = e - eBias; + } + + return (s ? -1 : 1) * m * Math.pow(2, e - mLen); +}; + +exports.write = function (buffer, value, offset, isLE, mLen, nBytes) { + var e, m, c; + var eLen = nBytes * 8 - mLen - 1; + var eMax = (1 << eLen) - 1; + var eBias = eMax >> 1; + var rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0; + var i = isLE ? 0 : nBytes - 1; + var d = isLE ? 1 : -1; + var s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0; + value = Math.abs(value); + + if (isNaN(value) || value === Infinity) { + m = isNaN(value) ? 1 : 0; + e = eMax; + } else { + e = Math.floor(Math.log(value) / Math.LN2); + + if (value * (c = Math.pow(2, -e)) < 1) { + e--; + c *= 2; + } + + if (e + eBias >= 1) { + value += rt / c; + } else { + value += rt * Math.pow(2, 1 - eBias); + } + + if (value * c >= 2) { + e++; + c /= 2; + } + + if (e + eBias >= eMax) { + m = 0; + e = eMax; + } else if (e + eBias >= 1) { + m = (value * c - 1) * Math.pow(2, mLen); + e = e + eBias; + } else { + m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen); + e = 0; + } + } + + for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {} + + e = e << mLen | m; + eLen += mLen; + + for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {} + + buffer[offset + i - d] |= s * 128; +}; + +/***/ }), +/* 103 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var toString = {}.toString; + +module.exports = Array.isArray || function (arr) { + return toString.call(arr) == '[object Array]'; +}; + +/***/ }), +/* 104 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.endianness = function () { + return 'LE'; +}; + +exports.hostname = function () { + if (typeof location !== 'undefined') { + return location.hostname; + } else return ''; +}; + +exports.loadavg = function () { + return []; +}; + +exports.uptime = function () { + return 0; +}; + +exports.freemem = function () { + return Number.MAX_VALUE; +}; + +exports.totalmem = function () { + return Number.MAX_VALUE; +}; + +exports.cpus = function () { + return []; +}; + +exports.type = function () { + return 'Browser'; +}; + +exports.release = function () { + if (typeof navigator !== 'undefined') { + return navigator.appVersion; + } + + return ''; +}; + +exports.networkInterfaces = exports.getNetworkInterfaces = function () { + return {}; +}; + +exports.arch = function () { + return 'javascript'; +}; + +exports.platform = function () { + return 'browser'; +}; + +exports.tmpdir = exports.tmpDir = function () { + return '/tmp'; +}; + +exports.EOL = '\n'; + +exports.homedir = function () { + return '/'; +}; + +/***/ }), +/* 105 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var varint = __webpack_require__(12); + +module.exports = { + numberToBuffer: numberToBuffer, + bufferToNumber: bufferToNumber, + varintBufferEncode: varintBufferEncode, + varintBufferDecode: varintBufferDecode +}; + +function bufferToNumber(buf) { + return parseInt(buf.toString('hex'), 16); +} + +function numberToBuffer(num) { + var hexString = num.toString(16); + + if (hexString.length % 2 === 1) { + hexString = '0' + hexString; + } + + return Buffer.from(hexString, 'hex'); +} + +function varintBufferEncode(input) { + return Buffer.from(varint.encode(bufferToNumber(input))); +} + +function varintBufferDecode(input) { + return numberToBuffer(varint.decode(input)); +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 106 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** + * Javascript implementation of basic RSA algorithms. + * + * @author Dave Longley + * + * Copyright (c) 2010-2014 Digital Bazaar, Inc. + * + * The only algorithm currently supported for PKI is RSA. + * + * An RSA key is often stored in ASN.1 DER format. The SubjectPublicKeyInfo + * ASN.1 structure is composed of an algorithm of type AlgorithmIdentifier + * and a subjectPublicKey of type bit string. + * + * The AlgorithmIdentifier contains an Object Identifier (OID) and parameters + * for the algorithm, if any. In the case of RSA, there aren't any. + * + * SubjectPublicKeyInfo ::= SEQUENCE { + * algorithm AlgorithmIdentifier, + * subjectPublicKey BIT STRING + * } + * + * AlgorithmIdentifer ::= SEQUENCE { + * algorithm OBJECT IDENTIFIER, + * parameters ANY DEFINED BY algorithm OPTIONAL + * } + * + * For an RSA public key, the subjectPublicKey is: + * + * RSAPublicKey ::= SEQUENCE { + * modulus INTEGER, -- n + * publicExponent INTEGER -- e + * } + * + * PrivateKeyInfo ::= SEQUENCE { + * version Version, + * privateKeyAlgorithm PrivateKeyAlgorithmIdentifier, + * privateKey PrivateKey, + * attributes [0] IMPLICIT Attributes OPTIONAL + * } + * + * Version ::= INTEGER + * PrivateKeyAlgorithmIdentifier ::= AlgorithmIdentifier + * PrivateKey ::= OCTET STRING + * Attributes ::= SET OF Attribute + * + * An RSA private key as the following structure: + * + * RSAPrivateKey ::= SEQUENCE { + * version Version, + * modulus INTEGER, -- n + * publicExponent INTEGER, -- e + * privateExponent INTEGER, -- d + * prime1 INTEGER, -- p + * prime2 INTEGER, -- q + * exponent1 INTEGER, -- d mod (p-1) + * exponent2 INTEGER, -- d mod (q-1) + * coefficient INTEGER -- (inverse of q) mod p + * } + * + * Version ::= INTEGER + * + * The OID for the RSA key algorithm is: 1.2.840.113549.1.1.1 + */ +var forge = __webpack_require__(8); + +__webpack_require__(71); + +__webpack_require__(107); + +__webpack_require__(72); + +__webpack_require__(229); + +__webpack_require__(233); + +__webpack_require__(52); + +__webpack_require__(9); + +if (typeof BigInteger === 'undefined') { + var BigInteger = forge.jsbn.BigInteger; +} // shortcut for asn.1 API + + +var asn1 = forge.asn1; +/* + * RSA encryption and decryption, see RFC 2313. + */ + +forge.pki = forge.pki || {}; +module.exports = forge.pki.rsa = forge.rsa = forge.rsa || {}; +var pki = forge.pki; // for finding primes, which are 30k+i for i = 1, 7, 11, 13, 17, 19, 23, 29 + +var GCD_30_DELTA = [6, 4, 2, 4, 2, 4, 6, 2]; // validator for a PrivateKeyInfo structure + +var privateKeyValidator = { + // PrivateKeyInfo + name: 'PrivateKeyInfo', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + // Version (INTEGER) + name: 'PrivateKeyInfo.version', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyVersion' + }, { + // privateKeyAlgorithm + name: 'PrivateKeyInfo.privateKeyAlgorithm', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'AlgorithmIdentifier.algorithm', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OID, + constructed: false, + capture: 'privateKeyOid' + }] + }, { + // PrivateKey + name: 'PrivateKeyInfo', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OCTETSTRING, + constructed: false, + capture: 'privateKey' + }] +}; // validator for an RSA private key + +var rsaPrivateKeyValidator = { + // RSAPrivateKey + name: 'RSAPrivateKey', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + // Version (INTEGER) + name: 'RSAPrivateKey.version', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyVersion' + }, { + // modulus (n) + name: 'RSAPrivateKey.modulus', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyModulus' + }, { + // publicExponent (e) + name: 'RSAPrivateKey.publicExponent', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyPublicExponent' + }, { + // privateExponent (d) + name: 'RSAPrivateKey.privateExponent', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyPrivateExponent' + }, { + // prime1 (p) + name: 'RSAPrivateKey.prime1', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyPrime1' + }, { + // prime2 (q) + name: 'RSAPrivateKey.prime2', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyPrime2' + }, { + // exponent1 (d mod (p-1)) + name: 'RSAPrivateKey.exponent1', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyExponent1' + }, { + // exponent2 (d mod (q-1)) + name: 'RSAPrivateKey.exponent2', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyExponent2' + }, { + // coefficient ((inverse of q) mod p) + name: 'RSAPrivateKey.coefficient', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'privateKeyCoefficient' + }] +}; // validator for an RSA public key + +var rsaPublicKeyValidator = { + // RSAPublicKey + name: 'RSAPublicKey', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + // modulus (n) + name: 'RSAPublicKey.modulus', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'publicKeyModulus' + }, { + // publicExponent (e) + name: 'RSAPublicKey.exponent', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'publicKeyExponent' + }] +}; // validator for an SubjectPublicKeyInfo structure +// Note: Currently only works with an RSA public key + +var publicKeyValidator = forge.pki.rsa.publicKeyValidator = { + name: 'SubjectPublicKeyInfo', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + captureAsn1: 'subjectPublicKeyInfo', + value: [{ + name: 'SubjectPublicKeyInfo.AlgorithmIdentifier', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'AlgorithmIdentifier.algorithm', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OID, + constructed: false, + capture: 'publicKeyOid' + }] + }, { + // subjectPublicKey + name: 'SubjectPublicKeyInfo.subjectPublicKey', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.BITSTRING, + constructed: false, + value: [{ + // RSAPublicKey + name: 'SubjectPublicKeyInfo.subjectPublicKey.RSAPublicKey', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + optional: true, + captureAsn1: 'rsaPublicKey' + }] + }] +}; +/** + * Wrap digest in DigestInfo object. + * + * This function implements EMSA-PKCS1-v1_5-ENCODE as per RFC 3447. + * + * DigestInfo ::= SEQUENCE { + * digestAlgorithm DigestAlgorithmIdentifier, + * digest Digest + * } + * + * DigestAlgorithmIdentifier ::= AlgorithmIdentifier + * Digest ::= OCTET STRING + * + * @param md the message digest object with the hash to sign. + * + * @return the encoded message (ready for RSA encrytion) + */ + +var emsaPkcs1v15encode = function emsaPkcs1v15encode(md) { + // get the oid for the algorithm + var oid; + + if (md.algorithm in pki.oids) { + oid = pki.oids[md.algorithm]; + } else { + var error = new Error('Unknown message digest algorithm.'); + error.algorithm = md.algorithm; + throw error; + } + + var oidBytes = asn1.oidToDer(oid).getBytes(); // create the digest info + + var digestInfo = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []); + var digestAlgorithm = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, []); + digestAlgorithm.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, oidBytes)); + digestAlgorithm.value.push(asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')); + var digest = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, md.digest().getBytes()); + digestInfo.value.push(digestAlgorithm); + digestInfo.value.push(digest); // encode digest info + + return asn1.toDer(digestInfo).getBytes(); +}; +/** + * Performs x^c mod n (RSA encryption or decryption operation). + * + * @param x the number to raise and mod. + * @param key the key to use. + * @param pub true if the key is public, false if private. + * + * @return the result of x^c mod n. + */ + + +var _modPow = function _modPow(x, key, pub) { + if (pub) { + return x.modPow(key.e, key.n); + } + + if (!key.p || !key.q) { + // allow calculation without CRT params (slow) + return x.modPow(key.d, key.n); + } // pre-compute dP, dQ, and qInv if necessary + + + if (!key.dP) { + key.dP = key.d.mod(key.p.subtract(BigInteger.ONE)); + } + + if (!key.dQ) { + key.dQ = key.d.mod(key.q.subtract(BigInteger.ONE)); + } + + if (!key.qInv) { + key.qInv = key.q.modInverse(key.p); + } + /* Chinese remainder theorem (CRT) states: + Suppose n1, n2, ..., nk are positive integers which are pairwise + coprime (n1 and n2 have no common factors other than 1). For any + integers x1, x2, ..., xk there exists an integer x solving the + system of simultaneous congruences (where ~= means modularly + congruent so a ~= b mod n means a mod n = b mod n): + x ~= x1 mod n1 + x ~= x2 mod n2 + ... + x ~= xk mod nk + This system of congruences has a single simultaneous solution x + between 0 and n - 1. Furthermore, each xk solution and x itself + is congruent modulo the product n = n1*n2*...*nk. + So x1 mod n = x2 mod n = xk mod n = x mod n. + The single simultaneous solution x can be solved with the following + equation: + x = sum(xi*ri*si) mod n where ri = n/ni and si = ri^-1 mod ni. + Where x is less than n, xi = x mod ni. + For RSA we are only concerned with k = 2. The modulus n = pq, where + p and q are coprime. The RSA decryption algorithm is: + y = x^d mod n + Given the above: + x1 = x^d mod p + r1 = n/p = q + s1 = q^-1 mod p + x2 = x^d mod q + r2 = n/q = p + s2 = p^-1 mod q + So y = (x1r1s1 + x2r2s2) mod n + = ((x^d mod p)q(q^-1 mod p) + (x^d mod q)p(p^-1 mod q)) mod n + According to Fermat's Little Theorem, if the modulus P is prime, + for any integer A not evenly divisible by P, A^(P-1) ~= 1 mod P. + Since A is not divisible by P it follows that if: + N ~= M mod (P - 1), then A^N mod P = A^M mod P. Therefore: + A^N mod P = A^(M mod (P - 1)) mod P. (The latter takes less effort + to calculate). In order to calculate x^d mod p more quickly the + exponent d mod (p - 1) is stored in the RSA private key (the same + is done for x^d mod q). These values are referred to as dP and dQ + respectively. Therefore we now have: + y = ((x^dP mod p)q(q^-1 mod p) + (x^dQ mod q)p(p^-1 mod q)) mod n + Since we'll be reducing x^dP by modulo p (same for q) we can also + reduce x by p (and q respectively) before hand. Therefore, let + xp = ((x mod p)^dP mod p), and + xq = ((x mod q)^dQ mod q), yielding: + y = (xp*q*(q^-1 mod p) + xq*p*(p^-1 mod q)) mod n + This can be further reduced to a simple algorithm that only + requires 1 inverse (the q inverse is used) to be used and stored. + The algorithm is called Garner's algorithm. If qInv is the + inverse of q, we simply calculate: + y = (qInv*(xp - xq) mod p) * q + xq + However, there are two further complications. First, we need to + ensure that xp > xq to prevent signed BigIntegers from being used + so we add p until this is true (since we will be mod'ing with + p anyway). Then, there is a known timing attack on algorithms + using the CRT. To mitigate this risk, "cryptographic blinding" + should be used. This requires simply generating a random number r + between 0 and n-1 and its inverse and multiplying x by r^e before + calculating y and then multiplying y by r^-1 afterwards. Note that + r must be coprime with n (gcd(r, n) === 1) in order to have an + inverse. + */ + // cryptographic blinding + + + var r; + + do { + r = new BigInteger(forge.util.bytesToHex(forge.random.getBytes(key.n.bitLength() / 8)), 16); + } while (r.compareTo(key.n) >= 0 || !r.gcd(key.n).equals(BigInteger.ONE)); + + x = x.multiply(r.modPow(key.e, key.n)).mod(key.n); // calculate xp and xq + + var xp = x.mod(key.p).modPow(key.dP, key.p); + var xq = x.mod(key.q).modPow(key.dQ, key.q); // xp must be larger than xq to avoid signed bit usage + + while (xp.compareTo(xq) < 0) { + xp = xp.add(key.p); + } // do last step + + + var y = xp.subtract(xq).multiply(key.qInv).mod(key.p).multiply(key.q).add(xq); // remove effect of random for cryptographic blinding + + y = y.multiply(r.modInverse(key.n)).mod(key.n); + return y; +}; +/** + * NOTE: THIS METHOD IS DEPRECATED, use 'sign' on a private key object or + * 'encrypt' on a public key object instead. + * + * Performs RSA encryption. + * + * The parameter bt controls whether to put padding bytes before the + * message passed in. Set bt to either true or false to disable padding + * completely (in order to handle e.g. EMSA-PSS encoding seperately before), + * signaling whether the encryption operation is a public key operation + * (i.e. encrypting data) or not, i.e. private key operation (data signing). + * + * For PKCS#1 v1.5 padding pass in the block type to use, i.e. either 0x01 + * (for signing) or 0x02 (for encryption). The key operation mode (private + * or public) is derived from this flag in that case). + * + * @param m the message to encrypt as a byte string. + * @param key the RSA key to use. + * @param bt for PKCS#1 v1.5 padding, the block type to use + * (0x01 for private key, 0x02 for public), + * to disable padding: true = public key, false = private key. + * + * @return the encrypted bytes as a string. + */ + + +pki.rsa.encrypt = function (m, key, bt) { + var pub = bt; + var eb; // get the length of the modulus in bytes + + var k = Math.ceil(key.n.bitLength() / 8); + + if (bt !== false && bt !== true) { + // legacy, default to PKCS#1 v1.5 padding + pub = bt === 0x02; + eb = _encodePkcs1_v1_5(m, key, bt); + } else { + eb = forge.util.createBuffer(); + eb.putBytes(m); + } // load encryption block as big integer 'x' + // FIXME: hex conversion inefficient, get BigInteger w/byte strings + + + var x = new BigInteger(eb.toHex(), 16); // do RSA encryption + + var y = _modPow(x, key, pub); // convert y into the encrypted data byte string, if y is shorter in + // bytes than k, then prepend zero bytes to fill up ed + // FIXME: hex conversion inefficient, get BigInteger w/byte strings + + + var yhex = y.toString(16); + var ed = forge.util.createBuffer(); + var zeros = k - Math.ceil(yhex.length / 2); + + while (zeros > 0) { + ed.putByte(0x00); + --zeros; + } + + ed.putBytes(forge.util.hexToBytes(yhex)); + return ed.getBytes(); +}; +/** + * NOTE: THIS METHOD IS DEPRECATED, use 'decrypt' on a private key object or + * 'verify' on a public key object instead. + * + * Performs RSA decryption. + * + * The parameter ml controls whether to apply PKCS#1 v1.5 padding + * or not. Set ml = false to disable padding removal completely + * (in order to handle e.g. EMSA-PSS later on) and simply pass back + * the RSA encryption block. + * + * @param ed the encrypted data to decrypt in as a byte string. + * @param key the RSA key to use. + * @param pub true for a public key operation, false for private. + * @param ml the message length, if known, false to disable padding. + * + * @return the decrypted message as a byte string. + */ + + +pki.rsa.decrypt = function (ed, key, pub, ml) { + // get the length of the modulus in bytes + var k = Math.ceil(key.n.bitLength() / 8); // error if the length of the encrypted data ED is not k + + if (ed.length !== k) { + var error = new Error('Encrypted message length is invalid.'); + error.length = ed.length; + error.expected = k; + throw error; + } // convert encrypted data into a big integer + // FIXME: hex conversion inefficient, get BigInteger w/byte strings + + + var y = new BigInteger(forge.util.createBuffer(ed).toHex(), 16); // y must be less than the modulus or it wasn't the result of + // a previous mod operation (encryption) using that modulus + + if (y.compareTo(key.n) >= 0) { + throw new Error('Encrypted message is invalid.'); + } // do RSA decryption + + + var x = _modPow(y, key, pub); // create the encryption block, if x is shorter in bytes than k, then + // prepend zero bytes to fill up eb + // FIXME: hex conversion inefficient, get BigInteger w/byte strings + + + var xhex = x.toString(16); + var eb = forge.util.createBuffer(); + var zeros = k - Math.ceil(xhex.length / 2); + + while (zeros > 0) { + eb.putByte(0x00); + --zeros; + } + + eb.putBytes(forge.util.hexToBytes(xhex)); + + if (ml !== false) { + // legacy, default to PKCS#1 v1.5 padding + return _decodePkcs1_v1_5(eb.getBytes(), key, pub); + } // return message + + + return eb.getBytes(); +}; +/** + * Creates an RSA key-pair generation state object. It is used to allow + * key-generation to be performed in steps. It also allows for a UI to + * display progress updates. + * + * @param bits the size for the private key in bits, defaults to 2048. + * @param e the public exponent to use, defaults to 65537 (0x10001). + * @param [options] the options to use. + * prng a custom crypto-secure pseudo-random number generator to use, + * that must define "getBytesSync". + * algorithm the algorithm to use (default: 'PRIMEINC'). + * + * @return the state object to use to generate the key-pair. + */ + + +pki.rsa.createKeyPairGenerationState = function (bits, e, options) { + // TODO: migrate step-based prime generation code to forge.prime + // set default bits + if (typeof bits === 'string') { + bits = parseInt(bits, 10); + } + + bits = bits || 2048; // create prng with api that matches BigInteger secure random + + options = options || {}; + var prng = options.prng || forge.random; + var rng = { + // x is an array to fill with bytes + nextBytes: function nextBytes(x) { + var b = prng.getBytesSync(x.length); + + for (var i = 0; i < x.length; ++i) { + x[i] = b.charCodeAt(i); + } + } + }; + var algorithm = options.algorithm || 'PRIMEINC'; // create PRIMEINC algorithm state + + var rval; + + if (algorithm === 'PRIMEINC') { + rval = { + algorithm: algorithm, + state: 0, + bits: bits, + rng: rng, + eInt: e || 65537, + e: new BigInteger(null), + p: null, + q: null, + qBits: bits >> 1, + pBits: bits - (bits >> 1), + pqState: 0, + num: null, + keys: null + }; + rval.e.fromInt(rval.eInt); + } else { + throw new Error('Invalid key generation algorithm: ' + algorithm); + } + + return rval; +}; +/** + * Attempts to runs the key-generation algorithm for at most n seconds + * (approximately) using the given state. When key-generation has completed, + * the keys will be stored in state.keys. + * + * To use this function to update a UI while generating a key or to prevent + * causing browser lockups/warnings, set "n" to a value other than 0. A + * simple pattern for generating a key and showing a progress indicator is: + * + * var state = pki.rsa.createKeyPairGenerationState(2048); + * var step = function() { + * // step key-generation, run algorithm for 100 ms, repeat + * if(!forge.pki.rsa.stepKeyPairGenerationState(state, 100)) { + * setTimeout(step, 1); + * } else { + * // key-generation complete + * // TODO: turn off progress indicator here + * // TODO: use the generated key-pair in "state.keys" + * } + * }; + * // TODO: turn on progress indicator here + * setTimeout(step, 0); + * + * @param state the state to use. + * @param n the maximum number of milliseconds to run the algorithm for, 0 + * to run the algorithm to completion. + * + * @return true if the key-generation completed, false if not. + */ + + +pki.rsa.stepKeyPairGenerationState = function (state, n) { + // set default algorithm if not set + if (!('algorithm' in state)) { + state.algorithm = 'PRIMEINC'; + } // TODO: migrate step-based prime generation code to forge.prime + // TODO: abstract as PRIMEINC algorithm + // do key generation (based on Tom Wu's rsa.js, see jsbn.js license) + // with some minor optimizations and designed to run in steps + // local state vars + + + var THIRTY = new BigInteger(null); + THIRTY.fromInt(30); + var deltaIdx = 0; + + var op_or = function op_or(x, y) { + return x | y; + }; // keep stepping until time limit is reached or done + + + var t1 = +new Date(); + var t2; + var total = 0; + + while (state.keys === null && (n <= 0 || total < n)) { + // generate p or q + if (state.state === 0) { + /* Note: All primes are of the form: + 30k+i, for i < 30 and gcd(30, i)=1, where there are 8 values for i + When we generate a random number, we always align it at 30k + 1. Each + time the number is determined not to be prime we add to get to the + next 'i', eg: if the number was at 30k + 1 we add 6. */ + var bits = state.p === null ? state.pBits : state.qBits; + var bits1 = bits - 1; // get a random number + + if (state.pqState === 0) { + state.num = new BigInteger(bits, state.rng); // force MSB set + + if (!state.num.testBit(bits1)) { + state.num.bitwiseTo(BigInteger.ONE.shiftLeft(bits1), op_or, state.num); + } // align number on 30k+1 boundary + + + state.num.dAddOffset(31 - state.num.mod(THIRTY).byteValue(), 0); + deltaIdx = 0; + ++state.pqState; + } else if (state.pqState === 1) { + // try to make the number a prime + if (state.num.bitLength() > bits) { + // overflow, try again + state.pqState = 0; // do primality test + } else if (state.num.isProbablePrime(_getMillerRabinTests(state.num.bitLength()))) { + ++state.pqState; + } else { + // get next potential prime + state.num.dAddOffset(GCD_30_DELTA[deltaIdx++ % 8], 0); + } + } else if (state.pqState === 2) { + // ensure number is coprime with e + state.pqState = state.num.subtract(BigInteger.ONE).gcd(state.e).compareTo(BigInteger.ONE) === 0 ? 3 : 0; + } else if (state.pqState === 3) { + // store p or q + state.pqState = 0; + + if (state.p === null) { + state.p = state.num; + } else { + state.q = state.num; + } // advance state if both p and q are ready + + + if (state.p !== null && state.q !== null) { + ++state.state; + } + + state.num = null; + } + } else if (state.state === 1) { + // ensure p is larger than q (swap them if not) + if (state.p.compareTo(state.q) < 0) { + state.num = state.p; + state.p = state.q; + state.q = state.num; + } + + ++state.state; + } else if (state.state === 2) { + // compute phi: (p - 1)(q - 1) (Euler's totient function) + state.p1 = state.p.subtract(BigInteger.ONE); + state.q1 = state.q.subtract(BigInteger.ONE); + state.phi = state.p1.multiply(state.q1); + ++state.state; + } else if (state.state === 3) { + // ensure e and phi are coprime + if (state.phi.gcd(state.e).compareTo(BigInteger.ONE) === 0) { + // phi and e are coprime, advance + ++state.state; + } else { + // phi and e aren't coprime, so generate a new p and q + state.p = null; + state.q = null; + state.state = 0; + } + } else if (state.state === 4) { + // create n, ensure n is has the right number of bits + state.n = state.p.multiply(state.q); // ensure n is right number of bits + + if (state.n.bitLength() === state.bits) { + // success, advance + ++state.state; + } else { + // failed, get new q + state.q = null; + state.state = 0; + } + } else if (state.state === 5) { + // set keys + var d = state.e.modInverse(state.phi); + state.keys = { + privateKey: pki.rsa.setPrivateKey(state.n, state.e, d, state.p, state.q, d.mod(state.p1), d.mod(state.q1), state.q.modInverse(state.p)), + publicKey: pki.rsa.setPublicKey(state.n, state.e) + }; + } // update timing + + + t2 = +new Date(); + total += t2 - t1; + t1 = t2; + } + + return state.keys !== null; +}; +/** + * Generates an RSA public-private key pair in a single call. + * + * To generate a key-pair in steps (to allow for progress updates and to + * prevent blocking or warnings in slow browsers) then use the key-pair + * generation state functions. + * + * To generate a key-pair asynchronously (either through web-workers, if + * available, or by breaking up the work on the main thread), pass a + * callback function. + * + * @param [bits] the size for the private key in bits, defaults to 2048. + * @param [e] the public exponent to use, defaults to 65537. + * @param [options] options for key-pair generation, if given then 'bits' + * and 'e' must *not* be given: + * bits the size for the private key in bits, (default: 2048). + * e the public exponent to use, (default: 65537 (0x10001)). + * workerScript the worker script URL. + * workers the number of web workers (if supported) to use, + * (default: 2). + * workLoad the size of the work load, ie: number of possible prime + * numbers for each web worker to check per work assignment, + * (default: 100). + * prng a custom crypto-secure pseudo-random number generator to use, + * that must define "getBytesSync". + * algorithm the algorithm to use (default: 'PRIMEINC'). + * @param [callback(err, keypair)] called once the operation completes. + * + * @return an object with privateKey and publicKey properties. + */ + + +pki.rsa.generateKeyPair = function (bits, e, options, callback) { + // (bits), (options), (callback) + if (arguments.length === 1) { + if (_typeof(bits) === 'object') { + options = bits; + bits = undefined; + } else if (typeof bits === 'function') { + callback = bits; + bits = undefined; + } + } else if (arguments.length === 2) { + // (bits, e), (bits, options), (bits, callback), (options, callback) + if (typeof bits === 'number') { + if (typeof e === 'function') { + callback = e; + e = undefined; + } else if (typeof e !== 'number') { + options = e; + e = undefined; + } + } else { + options = bits; + callback = e; + bits = undefined; + e = undefined; + } + } else if (arguments.length === 3) { + // (bits, e, options), (bits, e, callback), (bits, options, callback) + if (typeof e === 'number') { + if (typeof options === 'function') { + callback = options; + options = undefined; + } + } else { + callback = options; + options = e; + e = undefined; + } + } + + options = options || {}; + + if (bits === undefined) { + bits = options.bits || 2048; + } + + if (e === undefined) { + e = options.e || 0x10001; + } // if native code is permitted and a callback is given, use native + // key generation code if available and if parameters are acceptable + + + if (!forge.options.usePureJavaScript && callback && bits >= 256 && bits <= 16384 && (e === 0x10001 || e === 3)) { + if (_detectSubtleCrypto('generateKey') && _detectSubtleCrypto('exportKey')) { + // use standard native generateKey + return window.crypto.subtle.generateKey({ + name: 'RSASSA-PKCS1-v1_5', + modulusLength: bits, + publicExponent: _intToUint8Array(e), + hash: { + name: 'SHA-256' + } + }, true + /* key can be exported*/ + , ['sign', 'verify']).then(function (pair) { + return window.crypto.subtle.exportKey('pkcs8', pair.privateKey); // avoiding catch(function(err) {...}) to support IE <= 8 + }).then(undefined, function (err) { + callback(err); + }).then(function (pkcs8) { + if (pkcs8) { + var privateKey = pki.privateKeyFromAsn1(asn1.fromDer(forge.util.createBuffer(pkcs8))); + callback(null, { + privateKey: privateKey, + publicKey: pki.setRsaPublicKey(privateKey.n, privateKey.e) + }); + } + }); + } + + if (_detectSubtleMsCrypto('generateKey') && _detectSubtleMsCrypto('exportKey')) { + var genOp = window.msCrypto.subtle.generateKey({ + name: 'RSASSA-PKCS1-v1_5', + modulusLength: bits, + publicExponent: _intToUint8Array(e), + hash: { + name: 'SHA-256' + } + }, true + /* key can be exported*/ + , ['sign', 'verify']); + + genOp.oncomplete = function (e) { + var pair = e.target.result; + var exportOp = window.msCrypto.subtle.exportKey('pkcs8', pair.privateKey); + + exportOp.oncomplete = function (e) { + var pkcs8 = e.target.result; + var privateKey = pki.privateKeyFromAsn1(asn1.fromDer(forge.util.createBuffer(pkcs8))); + callback(null, { + privateKey: privateKey, + publicKey: pki.setRsaPublicKey(privateKey.n, privateKey.e) + }); + }; + + exportOp.onerror = function (err) { + callback(err); + }; + }; + + genOp.onerror = function (err) { + callback(err); + }; + + return; + } + } // use JavaScript implementation + + + var state = pki.rsa.createKeyPairGenerationState(bits, e, options); + + if (!callback) { + pki.rsa.stepKeyPairGenerationState(state, 0); + return state.keys; + } + + _generateKeyPair(state, options, callback); +}; +/** + * Sets an RSA public key from BigIntegers modulus and exponent. + * + * @param n the modulus. + * @param e the exponent. + * + * @return the public key. + */ + + +pki.setRsaPublicKey = pki.rsa.setPublicKey = function (n, e) { + var key = { + n: n, + e: e + }; + /** + * Encrypts the given data with this public key. Newer applications + * should use the 'RSA-OAEP' decryption scheme, 'RSAES-PKCS1-V1_5' is for + * legacy applications. + * + * @param data the byte string to encrypt. + * @param scheme the encryption scheme to use: + * 'RSAES-PKCS1-V1_5' (default), + * 'RSA-OAEP', + * 'RAW', 'NONE', or null to perform raw RSA encryption, + * an object with an 'encode' property set to a function + * with the signature 'function(data, key)' that returns + * a binary-encoded string representing the encoded data. + * @param schemeOptions any scheme-specific options. + * + * @return the encrypted byte string. + */ + + key.encrypt = function (data, scheme, schemeOptions) { + if (typeof scheme === 'string') { + scheme = scheme.toUpperCase(); + } else if (scheme === undefined) { + scheme = 'RSAES-PKCS1-V1_5'; + } + + if (scheme === 'RSAES-PKCS1-V1_5') { + scheme = { + encode: function encode(m, key, pub) { + return _encodePkcs1_v1_5(m, key, 0x02).getBytes(); + } + }; + } else if (scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') { + scheme = { + encode: function encode(m, key) { + return forge.pkcs1.encode_rsa_oaep(key, m, schemeOptions); + } + }; + } else if (['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) { + scheme = { + encode: function encode(e) { + return e; + } + }; + } else if (typeof scheme === 'string') { + throw new Error('Unsupported encryption scheme: "' + scheme + '".'); + } // do scheme-based encoding then rsa encryption + + + var e = scheme.encode(data, key, true); + return pki.rsa.encrypt(e, key, true); + }; + /** + * Verifies the given signature against the given digest. + * + * PKCS#1 supports multiple (currently two) signature schemes: + * RSASSA-PKCS1-V1_5 and RSASSA-PSS. + * + * By default this implementation uses the "old scheme", i.e. + * RSASSA-PKCS1-V1_5, in which case once RSA-decrypted, the + * signature is an OCTET STRING that holds a DigestInfo. + * + * DigestInfo ::= SEQUENCE { + * digestAlgorithm DigestAlgorithmIdentifier, + * digest Digest + * } + * DigestAlgorithmIdentifier ::= AlgorithmIdentifier + * Digest ::= OCTET STRING + * + * To perform PSS signature verification, provide an instance + * of Forge PSS object as the scheme parameter. + * + * @param digest the message digest hash to compare against the signature, + * as a binary-encoded string. + * @param signature the signature to verify, as a binary-encoded string. + * @param scheme signature verification scheme to use: + * 'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5, + * a Forge PSS object for RSASSA-PSS, + * 'NONE' or null for none, DigestInfo will not be expected, but + * PKCS#1 v1.5 padding will still be used. + * + * @return true if the signature was verified, false if not. + */ + + + key.verify = function (digest, signature, scheme) { + if (typeof scheme === 'string') { + scheme = scheme.toUpperCase(); + } else if (scheme === undefined) { + scheme = 'RSASSA-PKCS1-V1_5'; + } + + if (scheme === 'RSASSA-PKCS1-V1_5') { + scheme = { + verify: function verify(digest, d) { + // remove padding + d = _decodePkcs1_v1_5(d, key, true); // d is ASN.1 BER-encoded DigestInfo + + var obj = asn1.fromDer(d); // compare the given digest to the decrypted one + + return digest === obj.value[1].value; + } + }; + } else if (scheme === 'NONE' || scheme === 'NULL' || scheme === null) { + scheme = { + verify: function verify(digest, d) { + // remove padding + d = _decodePkcs1_v1_5(d, key, true); + return digest === d; + } + }; + } // do rsa decryption w/o any decoding, then verify -- which does decoding + + + var d = pki.rsa.decrypt(signature, key, true, false); + return scheme.verify(digest, d, key.n.bitLength()); + }; + + return key; +}; +/** + * Sets an RSA private key from BigIntegers modulus, exponent, primes, + * prime exponents, and modular multiplicative inverse. + * + * @param n the modulus. + * @param e the public exponent. + * @param d the private exponent ((inverse of e) mod n). + * @param p the first prime. + * @param q the second prime. + * @param dP exponent1 (d mod (p-1)). + * @param dQ exponent2 (d mod (q-1)). + * @param qInv ((inverse of q) mod p) + * + * @return the private key. + */ + + +pki.setRsaPrivateKey = pki.rsa.setPrivateKey = function (n, e, d, p, q, dP, dQ, qInv) { + var key = { + n: n, + e: e, + d: d, + p: p, + q: q, + dP: dP, + dQ: dQ, + qInv: qInv + }; + /** + * Decrypts the given data with this private key. The decryption scheme + * must match the one used to encrypt the data. + * + * @param data the byte string to decrypt. + * @param scheme the decryption scheme to use: + * 'RSAES-PKCS1-V1_5' (default), + * 'RSA-OAEP', + * 'RAW', 'NONE', or null to perform raw RSA decryption. + * @param schemeOptions any scheme-specific options. + * + * @return the decrypted byte string. + */ + + key.decrypt = function (data, scheme, schemeOptions) { + if (typeof scheme === 'string') { + scheme = scheme.toUpperCase(); + } else if (scheme === undefined) { + scheme = 'RSAES-PKCS1-V1_5'; + } // do rsa decryption w/o any decoding + + + var d = pki.rsa.decrypt(data, key, false, false); + + if (scheme === 'RSAES-PKCS1-V1_5') { + scheme = { + decode: _decodePkcs1_v1_5 + }; + } else if (scheme === 'RSA-OAEP' || scheme === 'RSAES-OAEP') { + scheme = { + decode: function decode(d, key) { + return forge.pkcs1.decode_rsa_oaep(key, d, schemeOptions); + } + }; + } else if (['RAW', 'NONE', 'NULL', null].indexOf(scheme) !== -1) { + scheme = { + decode: function decode(d) { + return d; + } + }; + } else { + throw new Error('Unsupported encryption scheme: "' + scheme + '".'); + } // decode according to scheme + + + return scheme.decode(d, key, false); + }; + /** + * Signs the given digest, producing a signature. + * + * PKCS#1 supports multiple (currently two) signature schemes: + * RSASSA-PKCS1-V1_5 and RSASSA-PSS. + * + * By default this implementation uses the "old scheme", i.e. + * RSASSA-PKCS1-V1_5. In order to generate a PSS signature, provide + * an instance of Forge PSS object as the scheme parameter. + * + * @param md the message digest object with the hash to sign. + * @param scheme the signature scheme to use: + * 'RSASSA-PKCS1-V1_5' or undefined for RSASSA PKCS#1 v1.5, + * a Forge PSS object for RSASSA-PSS, + * 'NONE' or null for none, DigestInfo will not be used but + * PKCS#1 v1.5 padding will still be used. + * + * @return the signature as a byte string. + */ + + + key.sign = function (md, scheme) { + /* Note: The internal implementation of RSA operations is being + transitioned away from a PKCS#1 v1.5 hard-coded scheme. Some legacy + code like the use of an encoding block identifier 'bt' will eventually + be removed. */ + // private key operation + var bt = false; + + if (typeof scheme === 'string') { + scheme = scheme.toUpperCase(); + } + + if (scheme === undefined || scheme === 'RSASSA-PKCS1-V1_5') { + scheme = { + encode: emsaPkcs1v15encode + }; + bt = 0x01; + } else if (scheme === 'NONE' || scheme === 'NULL' || scheme === null) { + scheme = { + encode: function encode() { + return md; + } + }; + bt = 0x01; + } // encode and then encrypt + + + var d = scheme.encode(md, key.n.bitLength()); + return pki.rsa.encrypt(d, key, bt); + }; + + return key; +}; +/** + * Wraps an RSAPrivateKey ASN.1 object in an ASN.1 PrivateKeyInfo object. + * + * @param rsaKey the ASN.1 RSAPrivateKey. + * + * @return the ASN.1 PrivateKeyInfo. + */ + + +pki.wrapRsaPrivateKey = function (rsaKey) { + // PrivateKeyInfo + return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// version (0) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, asn1.integerToDer(0).getBytes()), // privateKeyAlgorithm + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(pki.oids.rsaEncryption).getBytes()), asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]), // PrivateKey + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, asn1.toDer(rsaKey).getBytes())]); +}; +/** + * Converts a private key from an ASN.1 object. + * + * @param obj the ASN.1 representation of a PrivateKeyInfo containing an + * RSAPrivateKey or an RSAPrivateKey. + * + * @return the private key. + */ + + +pki.privateKeyFromAsn1 = function (obj) { + // get PrivateKeyInfo + var capture = {}; + var errors = []; + + if (asn1.validate(obj, privateKeyValidator, capture, errors)) { + obj = asn1.fromDer(forge.util.createBuffer(capture.privateKey)); + } // get RSAPrivateKey + + + capture = {}; + errors = []; + + if (!asn1.validate(obj, rsaPrivateKeyValidator, capture, errors)) { + var error = new Error('Cannot read private key. ' + 'ASN.1 object does not contain an RSAPrivateKey.'); + error.errors = errors; + throw error; + } // Note: Version is currently ignored. + // capture.privateKeyVersion + // FIXME: inefficient, get a BigInteger that uses byte strings + + + var n, e, d, p, q, dP, dQ, qInv; + n = forge.util.createBuffer(capture.privateKeyModulus).toHex(); + e = forge.util.createBuffer(capture.privateKeyPublicExponent).toHex(); + d = forge.util.createBuffer(capture.privateKeyPrivateExponent).toHex(); + p = forge.util.createBuffer(capture.privateKeyPrime1).toHex(); + q = forge.util.createBuffer(capture.privateKeyPrime2).toHex(); + dP = forge.util.createBuffer(capture.privateKeyExponent1).toHex(); + dQ = forge.util.createBuffer(capture.privateKeyExponent2).toHex(); + qInv = forge.util.createBuffer(capture.privateKeyCoefficient).toHex(); // set private key + + return pki.setRsaPrivateKey(new BigInteger(n, 16), new BigInteger(e, 16), new BigInteger(d, 16), new BigInteger(p, 16), new BigInteger(q, 16), new BigInteger(dP, 16), new BigInteger(dQ, 16), new BigInteger(qInv, 16)); +}; +/** + * Converts a private key to an ASN.1 RSAPrivateKey. + * + * @param key the private key. + * + * @return the ASN.1 representation of an RSAPrivateKey. + */ + + +pki.privateKeyToAsn1 = pki.privateKeyToRSAPrivateKey = function (key) { + // RSAPrivateKey + return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// version (0 = only 2 primes, 1 multiple primes) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, asn1.integerToDer(0).getBytes()), // modulus (n) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.n)), // publicExponent (e) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.e)), // privateExponent (d) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.d)), // privateKeyPrime1 (p) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.p)), // privateKeyPrime2 (q) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.q)), // privateKeyExponent1 (dP) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.dP)), // privateKeyExponent2 (dQ) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.dQ)), // coefficient (qInv) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.qInv))]); +}; +/** + * Converts a public key from an ASN.1 SubjectPublicKeyInfo or RSAPublicKey. + * + * @param obj the asn1 representation of a SubjectPublicKeyInfo or RSAPublicKey. + * + * @return the public key. + */ + + +pki.publicKeyFromAsn1 = function (obj) { + // get SubjectPublicKeyInfo + var capture = {}; + var errors = []; + + if (asn1.validate(obj, publicKeyValidator, capture, errors)) { + // get oid + var oid = asn1.derToOid(capture.publicKeyOid); + + if (oid !== pki.oids.rsaEncryption) { + var error = new Error('Cannot read public key. Unknown OID.'); + error.oid = oid; + throw error; + } + + obj = capture.rsaPublicKey; + } // get RSA params + + + errors = []; + + if (!asn1.validate(obj, rsaPublicKeyValidator, capture, errors)) { + var error = new Error('Cannot read public key. ' + 'ASN.1 object does not contain an RSAPublicKey.'); + error.errors = errors; + throw error; + } // FIXME: inefficient, get a BigInteger that uses byte strings + + + var n = forge.util.createBuffer(capture.publicKeyModulus).toHex(); + var e = forge.util.createBuffer(capture.publicKeyExponent).toHex(); // set public key + + return pki.setRsaPublicKey(new BigInteger(n, 16), new BigInteger(e, 16)); +}; +/** + * Converts a public key to an ASN.1 SubjectPublicKeyInfo. + * + * @param key the public key. + * + * @return the asn1 representation of a SubjectPublicKeyInfo. + */ + + +pki.publicKeyToAsn1 = pki.publicKeyToSubjectPublicKeyInfo = function (key) { + // SubjectPublicKeyInfo + return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// AlgorithmIdentifier + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithm + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(pki.oids.rsaEncryption).getBytes()), // parameters (null) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')]), // subjectPublicKey + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.BITSTRING, false, [pki.publicKeyToRSAPublicKey(key)])]); +}; +/** + * Converts a public key to an ASN.1 RSAPublicKey. + * + * @param key the public key. + * + * @return the asn1 representation of a RSAPublicKey. + */ + + +pki.publicKeyToRSAPublicKey = function (key) { + // RSAPublicKey + return asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// modulus (n) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.n)), // publicExponent (e) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, _bnToBytes(key.e))]); +}; +/** + * Encodes a message using PKCS#1 v1.5 padding. + * + * @param m the message to encode. + * @param key the RSA key to use. + * @param bt the block type to use, i.e. either 0x01 (for signing) or 0x02 + * (for encryption). + * + * @return the padded byte buffer. + */ + + +function _encodePkcs1_v1_5(m, key, bt) { + var eb = forge.util.createBuffer(); // get the length of the modulus in bytes + + var k = Math.ceil(key.n.bitLength() / 8); + /* use PKCS#1 v1.5 padding */ + + if (m.length > k - 11) { + var error = new Error('Message is too long for PKCS#1 v1.5 padding.'); + error.length = m.length; + error.max = k - 11; + throw error; + } + /* A block type BT, a padding string PS, and the data D shall be + formatted into an octet string EB, the encryption block: + EB = 00 || BT || PS || 00 || D + The block type BT shall be a single octet indicating the structure of + the encryption block. For this version of the document it shall have + value 00, 01, or 02. For a private-key operation, the block type + shall be 00 or 01. For a public-key operation, it shall be 02. + The padding string PS shall consist of k-3-||D|| octets. For block + type 00, the octets shall have value 00; for block type 01, they + shall have value FF; and for block type 02, they shall be + pseudorandomly generated and nonzero. This makes the length of the + encryption block EB equal to k. */ + // build the encryption block + + + eb.putByte(0x00); + eb.putByte(bt); // create the padding + + var padNum = k - 3 - m.length; + var padByte; // private key op + + if (bt === 0x00 || bt === 0x01) { + padByte = bt === 0x00 ? 0x00 : 0xFF; + + for (var i = 0; i < padNum; ++i) { + eb.putByte(padByte); + } + } else { + // public key op + // pad with random non-zero values + while (padNum > 0) { + var numZeros = 0; + var padBytes = forge.random.getBytes(padNum); + + for (var i = 0; i < padNum; ++i) { + padByte = padBytes.charCodeAt(i); + + if (padByte === 0) { + ++numZeros; + } else { + eb.putByte(padByte); + } + } + + padNum = numZeros; + } + } // zero followed by message + + + eb.putByte(0x00); + eb.putBytes(m); + return eb; +} +/** + * Decodes a message using PKCS#1 v1.5 padding. + * + * @param em the message to decode. + * @param key the RSA key to use. + * @param pub true if the key is a public key, false if it is private. + * @param ml the message length, if specified. + * + * @return the decoded bytes. + */ + + +function _decodePkcs1_v1_5(em, key, pub, ml) { + // get the length of the modulus in bytes + var k = Math.ceil(key.n.bitLength() / 8); + /* It is an error if any of the following conditions occurs: + 1. The encryption block EB cannot be parsed unambiguously. + 2. The padding string PS consists of fewer than eight octets + or is inconsisent with the block type BT. + 3. The decryption process is a public-key operation and the block + type BT is not 00 or 01, or the decryption process is a + private-key operation and the block type is not 02. + */ + // parse the encryption block + + var eb = forge.util.createBuffer(em); + var first = eb.getByte(); + var bt = eb.getByte(); + + if (first !== 0x00 || pub && bt !== 0x00 && bt !== 0x01 || !pub && bt != 0x02 || pub && bt === 0x00 && typeof ml === 'undefined') { + throw new Error('Encryption block is invalid.'); + } + + var padNum = 0; + + if (bt === 0x00) { + // check all padding bytes for 0x00 + padNum = k - 3 - ml; + + for (var i = 0; i < padNum; ++i) { + if (eb.getByte() !== 0x00) { + throw new Error('Encryption block is invalid.'); + } + } + } else if (bt === 0x01) { + // find the first byte that isn't 0xFF, should be after all padding + padNum = 0; + + while (eb.length() > 1) { + if (eb.getByte() !== 0xFF) { + --eb.read; + break; + } + + ++padNum; + } + } else if (bt === 0x02) { + // look for 0x00 byte + padNum = 0; + + while (eb.length() > 1) { + if (eb.getByte() === 0x00) { + --eb.read; + break; + } + + ++padNum; + } + } // zero must be 0x00 and padNum must be (k - 3 - message length) + + + var zero = eb.getByte(); + + if (zero !== 0x00 || padNum !== k - 3 - eb.length()) { + throw new Error('Encryption block is invalid.'); + } + + return eb.getBytes(); +} +/** + * Runs the key-generation algorithm asynchronously, either in the background + * via Web Workers, or using the main thread and setImmediate. + * + * @param state the key-pair generation state. + * @param [options] options for key-pair generation: + * workerScript the worker script URL. + * workers the number of web workers (if supported) to use, + * (default: 2, -1 to use estimated cores minus one). + * workLoad the size of the work load, ie: number of possible prime + * numbers for each web worker to check per work assignment, + * (default: 100). + * @param callback(err, keypair) called once the operation completes. + */ + + +function _generateKeyPair(state, options, callback) { + if (typeof options === 'function') { + callback = options; + options = {}; + } + + options = options || {}; + var opts = { + algorithm: { + name: options.algorithm || 'PRIMEINC', + options: { + workers: options.workers || 2, + workLoad: options.workLoad || 100, + workerScript: options.workerScript + } + } + }; + + if ('prng' in options) { + opts.prng = options.prng; + } + + generate(); + + function generate() { + // find p and then q (done in series to simplify) + getPrime(state.pBits, function (err, num) { + if (err) { + return callback(err); + } + + state.p = num; + + if (state.q !== null) { + return finish(err, state.q); + } + + getPrime(state.qBits, finish); + }); + } + + function getPrime(bits, callback) { + forge.prime.generateProbablePrime(bits, opts, callback); + } + + function finish(err, num) { + if (err) { + return callback(err); + } // set q + + + state.q = num; // ensure p is larger than q (swap them if not) + + if (state.p.compareTo(state.q) < 0) { + var tmp = state.p; + state.p = state.q; + state.q = tmp; + } // ensure p is coprime with e + + + if (state.p.subtract(BigInteger.ONE).gcd(state.e).compareTo(BigInteger.ONE) !== 0) { + state.p = null; + generate(); + return; + } // ensure q is coprime with e + + + if (state.q.subtract(BigInteger.ONE).gcd(state.e).compareTo(BigInteger.ONE) !== 0) { + state.q = null; + getPrime(state.qBits, finish); + return; + } // compute phi: (p - 1)(q - 1) (Euler's totient function) + + + state.p1 = state.p.subtract(BigInteger.ONE); + state.q1 = state.q.subtract(BigInteger.ONE); + state.phi = state.p1.multiply(state.q1); // ensure e and phi are coprime + + if (state.phi.gcd(state.e).compareTo(BigInteger.ONE) !== 0) { + // phi and e aren't coprime, so generate a new p and q + state.p = state.q = null; + generate(); + return; + } // create n, ensure n is has the right number of bits + + + state.n = state.p.multiply(state.q); + + if (state.n.bitLength() !== state.bits) { + // failed, get new q + state.q = null; + getPrime(state.qBits, finish); + return; + } // set keys + + + var d = state.e.modInverse(state.phi); + state.keys = { + privateKey: pki.rsa.setPrivateKey(state.n, state.e, d, state.p, state.q, d.mod(state.p1), d.mod(state.q1), state.q.modInverse(state.p)), + publicKey: pki.rsa.setPublicKey(state.n, state.e) + }; + callback(null, state.keys); + } +} +/** + * Converts a positive BigInteger into 2's-complement big-endian bytes. + * + * @param b the big integer to convert. + * + * @return the bytes. + */ + + +function _bnToBytes(b) { + // prepend 0x00 if first byte >= 0x80 + var hex = b.toString(16); + + if (hex[0] >= '8') { + hex = '00' + hex; + } + + var bytes = forge.util.hexToBytes(hex); // ensure integer is minimally-encoded + + if (bytes.length > 1 && ( // leading 0x00 for positive integer + bytes.charCodeAt(0) === 0 && (bytes.charCodeAt(1) & 0x80) === 0 || // leading 0xFF for negative integer + bytes.charCodeAt(0) === 0xFF && (bytes.charCodeAt(1) & 0x80) === 0x80)) { + return bytes.substr(1); + } + + return bytes; +} +/** + * Returns the required number of Miller-Rabin tests to generate a + * prime with an error probability of (1/2)^80. + * + * See Handbook of Applied Cryptography Chapter 4, Table 4.4. + * + * @param bits the bit size. + * + * @return the required number of iterations. + */ + + +function _getMillerRabinTests(bits) { + if (bits <= 100) return 27; + if (bits <= 150) return 18; + if (bits <= 200) return 15; + if (bits <= 250) return 12; + if (bits <= 300) return 9; + if (bits <= 350) return 8; + if (bits <= 400) return 7; + if (bits <= 500) return 6; + if (bits <= 600) return 5; + if (bits <= 800) return 4; + if (bits <= 1250) return 3; + return 2; +} +/** + * Performs feature detection on the SubtleCrypto interface. + * + * @param fn the feature (function) to detect. + * + * @return true if detected, false if not. + */ + + +function _detectSubtleCrypto(fn) { + return typeof window !== 'undefined' && _typeof(window.crypto) === 'object' && _typeof(window.crypto.subtle) === 'object' && typeof window.crypto.subtle[fn] === 'function'; +} +/** + * Performs feature detection on the deprecated Microsoft Internet Explorer + * outdated SubtleCrypto interface. This function should only be used after + * checking for the modern, standard SubtleCrypto interface. + * + * @param fn the feature (function) to detect. + * + * @return true if detected, false if not. + */ + + +function _detectSubtleMsCrypto(fn) { + return typeof window !== 'undefined' && _typeof(window.msCrypto) === 'object' && _typeof(window.msCrypto.subtle) === 'object' && typeof window.msCrypto.subtle[fn] === 'function'; +} + +function _intToUint8Array(x) { + var bytes = forge.util.hexToBytes(x.toString(16)); + var buffer = new Uint8Array(bytes.length); + + for (var i = 0; i < bytes.length; ++i) { + buffer[i] = bytes.charCodeAt(i); + } + + return buffer; +} + +function _privateKeyFromJwk(jwk) { + if (jwk.kty !== 'RSA') { + throw new Error('Unsupported key algorithm "' + jwk.kty + '"; algorithm must be "RSA".'); + } + + return pki.setRsaPrivateKey(_base64ToBigInt(jwk.n), _base64ToBigInt(jwk.e), _base64ToBigInt(jwk.d), _base64ToBigInt(jwk.p), _base64ToBigInt(jwk.q), _base64ToBigInt(jwk.dp), _base64ToBigInt(jwk.dq), _base64ToBigInt(jwk.qi)); +} + +function _publicKeyFromJwk(jwk) { + if (jwk.kty !== 'RSA') { + throw new Error('Key algorithm must be "RSA".'); + } + + return pki.setRsaPublicKey(_base64ToBigInt(jwk.n), _base64ToBigInt(jwk.e)); +} + +function _base64ToBigInt(b64) { + return new BigInteger(forge.util.bytesToHex(forge.util.decode64(b64)), 16); +} + +/***/ }), +/* 107 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +// Copyright (c) 2005 Tom Wu +// All Rights Reserved. +// See "LICENSE" for details. +// Basic JavaScript BN library - subset useful for RSA encryption. + +/* +Licensing (LICENSE) +------------------- + +This software is covered under the following copyright: +*/ + +/* + * Copyright (c) 2003-2005 Tom Wu + * All Rights Reserved. + * + * Permission is hereby granted, free of charge, to any person obtaining + * a copy of this software and associated documentation files (the + * "Software"), to deal in the Software without restriction, including + * without limitation the rights to use, copy, modify, merge, publish, + * distribute, sublicense, and/or sell copies of the Software, and to + * permit persons to whom the Software is furnished to do so, subject to + * the following conditions: + * + * The above copyright notice and this permission notice shall be + * included in all copies or substantial portions of the Software. + * + * THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND, + * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY + * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. + * + * IN NO EVENT SHALL TOM WU BE LIABLE FOR ANY SPECIAL, INCIDENTAL, + * INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, OR ANY DAMAGES WHATSOEVER + * RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER OR NOT ADVISED OF + * THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF LIABILITY, ARISING OUT + * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. + * + * In addition, the following condition applies: + * + * All redistributions must retain an intact copy of this copyright notice + * and disclaimer. + */ + +/* +Address all questions regarding this license to: + + Tom Wu + tjw@cs.Stanford.EDU +*/ +var forge = __webpack_require__(8); + +module.exports = forge.jsbn = forge.jsbn || {}; // Bits per digit + +var dbits; // JavaScript engine analysis + +var canary = 0xdeadbeefcafe; +var j_lm = (canary & 0xffffff) == 0xefcafe; // (public) Constructor + +function BigInteger(a, b, c) { + this.data = []; + if (a != null) if ("number" == typeof a) this.fromNumber(a, b, c);else if (b == null && "string" != typeof a) this.fromString(a, 256);else this.fromString(a, b); +} + +forge.jsbn.BigInteger = BigInteger; // return new, unset BigInteger + +function nbi() { + return new BigInteger(null); +} // am: Compute w_j += (x*this_i), propagate carries, +// c is initial carry, returns final carry. +// c < 3*dvalue, x < 2*dvalue, this_i < dvalue +// We need to select the fastest one that works in this environment. +// am1: use a single mult and divide to get the high bits, +// max digit bits should be 26 because +// max internal value = 2*dvalue^2-2*dvalue (< 2^53) + + +function am1(i, x, w, j, c, n) { + while (--n >= 0) { + var v = x * this.data[i++] + w.data[j] + c; + c = Math.floor(v / 0x4000000); + w.data[j++] = v & 0x3ffffff; + } + + return c; +} // am2 avoids a big mult-and-extract completely. +// Max digit bits should be <= 30 because we do bitwise ops +// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31) + + +function am2(i, x, w, j, c, n) { + var xl = x & 0x7fff, + xh = x >> 15; + + while (--n >= 0) { + var l = this.data[i] & 0x7fff; + var h = this.data[i++] >> 15; + var m = xh * l + h * xl; + l = xl * l + ((m & 0x7fff) << 15) + w.data[j] + (c & 0x3fffffff); + c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30); + w.data[j++] = l & 0x3fffffff; + } + + return c; +} // Alternately, set max digit bits to 28 since some +// browsers slow down when dealing with 32-bit numbers. + + +function am3(i, x, w, j, c, n) { + var xl = x & 0x3fff, + xh = x >> 14; + + while (--n >= 0) { + var l = this.data[i] & 0x3fff; + var h = this.data[i++] >> 14; + var m = xh * l + h * xl; + l = xl * l + ((m & 0x3fff) << 14) + w.data[j] + c; + c = (l >> 28) + (m >> 14) + xh * h; + w.data[j++] = l & 0xfffffff; + } + + return c; +} // node.js (no browser) + + +if (typeof navigator === 'undefined') { + BigInteger.prototype.am = am3; + dbits = 28; +} else if (j_lm && navigator.appName == "Microsoft Internet Explorer") { + BigInteger.prototype.am = am2; + dbits = 30; +} else if (j_lm && navigator.appName != "Netscape") { + BigInteger.prototype.am = am1; + dbits = 26; +} else { + // Mozilla/Netscape seems to prefer am3 + BigInteger.prototype.am = am3; + dbits = 28; +} + +BigInteger.prototype.DB = dbits; +BigInteger.prototype.DM = (1 << dbits) - 1; +BigInteger.prototype.DV = 1 << dbits; +var BI_FP = 52; +BigInteger.prototype.FV = Math.pow(2, BI_FP); +BigInteger.prototype.F1 = BI_FP - dbits; +BigInteger.prototype.F2 = 2 * dbits - BI_FP; // Digit conversions + +var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz"; +var BI_RC = new Array(); +var rr, vv; +rr = "0".charCodeAt(0); + +for (vv = 0; vv <= 9; ++vv) { + BI_RC[rr++] = vv; +} + +rr = "a".charCodeAt(0); + +for (vv = 10; vv < 36; ++vv) { + BI_RC[rr++] = vv; +} + +rr = "A".charCodeAt(0); + +for (vv = 10; vv < 36; ++vv) { + BI_RC[rr++] = vv; +} + +function int2char(n) { + return BI_RM.charAt(n); +} + +function intAt(s, i) { + var c = BI_RC[s.charCodeAt(i)]; + return c == null ? -1 : c; +} // (protected) copy this to r + + +function bnpCopyTo(r) { + for (var i = this.t - 1; i >= 0; --i) { + r.data[i] = this.data[i]; + } + + r.t = this.t; + r.s = this.s; +} // (protected) set from integer value x, -DV <= x < DV + + +function bnpFromInt(x) { + this.t = 1; + this.s = x < 0 ? -1 : 0; + if (x > 0) this.data[0] = x;else if (x < -1) this.data[0] = x + this.DV;else this.t = 0; +} // return bigint initialized to value + + +function nbv(i) { + var r = nbi(); + r.fromInt(i); + return r; +} // (protected) set from string and radix + + +function bnpFromString(s, b) { + var k; + if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 256) k = 8; // byte array + else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else { + this.fromRadix(s, b); + return; + } + this.t = 0; + this.s = 0; + var i = s.length, + mi = false, + sh = 0; + + while (--i >= 0) { + var x = k == 8 ? s[i] & 0xff : intAt(s, i); + + if (x < 0) { + if (s.charAt(i) == "-") mi = true; + continue; + } + + mi = false; + if (sh == 0) this.data[this.t++] = x;else if (sh + k > this.DB) { + this.data[this.t - 1] |= (x & (1 << this.DB - sh) - 1) << sh; + this.data[this.t++] = x >> this.DB - sh; + } else this.data[this.t - 1] |= x << sh; + sh += k; + if (sh >= this.DB) sh -= this.DB; + } + + if (k == 8 && (s[0] & 0x80) != 0) { + this.s = -1; + if (sh > 0) this.data[this.t - 1] |= (1 << this.DB - sh) - 1 << sh; + } + + this.clamp(); + if (mi) BigInteger.ZERO.subTo(this, this); +} // (protected) clamp off excess high words + + +function bnpClamp() { + var c = this.s & this.DM; + + while (this.t > 0 && this.data[this.t - 1] == c) { + --this.t; + } +} // (public) return string representation in given radix + + +function bnToString(b) { + if (this.s < 0) return "-" + this.negate().toString(b); + var k; + if (b == 16) k = 4;else if (b == 8) k = 3;else if (b == 2) k = 1;else if (b == 32) k = 5;else if (b == 4) k = 2;else return this.toRadix(b); + var km = (1 << k) - 1, + d, + m = false, + r = "", + i = this.t; + var p = this.DB - i * this.DB % k; + + if (i-- > 0) { + if (p < this.DB && (d = this.data[i] >> p) > 0) { + m = true; + r = int2char(d); + } + + while (i >= 0) { + if (p < k) { + d = (this.data[i] & (1 << p) - 1) << k - p; + d |= this.data[--i] >> (p += this.DB - k); + } else { + d = this.data[i] >> (p -= k) & km; + + if (p <= 0) { + p += this.DB; + --i; + } + } + + if (d > 0) m = true; + if (m) r += int2char(d); + } + } + + return m ? r : "0"; +} // (public) -this + + +function bnNegate() { + var r = nbi(); + BigInteger.ZERO.subTo(this, r); + return r; +} // (public) |this| + + +function bnAbs() { + return this.s < 0 ? this.negate() : this; +} // (public) return + if this > a, - if this < a, 0 if equal + + +function bnCompareTo(a) { + var r = this.s - a.s; + if (r != 0) return r; + var i = this.t; + r = i - a.t; + if (r != 0) return this.s < 0 ? -r : r; + + while (--i >= 0) { + if ((r = this.data[i] - a.data[i]) != 0) return r; + } + + return 0; +} // returns bit length of the integer x + + +function nbits(x) { + var r = 1, + t; + + if ((t = x >>> 16) != 0) { + x = t; + r += 16; + } + + if ((t = x >> 8) != 0) { + x = t; + r += 8; + } + + if ((t = x >> 4) != 0) { + x = t; + r += 4; + } + + if ((t = x >> 2) != 0) { + x = t; + r += 2; + } + + if ((t = x >> 1) != 0) { + x = t; + r += 1; + } + + return r; +} // (public) return the number of bits in "this" + + +function bnBitLength() { + if (this.t <= 0) return 0; + return this.DB * (this.t - 1) + nbits(this.data[this.t - 1] ^ this.s & this.DM); +} // (protected) r = this << n*DB + + +function bnpDLShiftTo(n, r) { + var i; + + for (i = this.t - 1; i >= 0; --i) { + r.data[i + n] = this.data[i]; + } + + for (i = n - 1; i >= 0; --i) { + r.data[i] = 0; + } + + r.t = this.t + n; + r.s = this.s; +} // (protected) r = this >> n*DB + + +function bnpDRShiftTo(n, r) { + for (var i = n; i < this.t; ++i) { + r.data[i - n] = this.data[i]; + } + + r.t = Math.max(this.t - n, 0); + r.s = this.s; +} // (protected) r = this << n + + +function bnpLShiftTo(n, r) { + var bs = n % this.DB; + var cbs = this.DB - bs; + var bm = (1 << cbs) - 1; + var ds = Math.floor(n / this.DB), + c = this.s << bs & this.DM, + i; + + for (i = this.t - 1; i >= 0; --i) { + r.data[i + ds + 1] = this.data[i] >> cbs | c; + c = (this.data[i] & bm) << bs; + } + + for (i = ds - 1; i >= 0; --i) { + r.data[i] = 0; + } + + r.data[ds] = c; + r.t = this.t + ds + 1; + r.s = this.s; + r.clamp(); +} // (protected) r = this >> n + + +function bnpRShiftTo(n, r) { + r.s = this.s; + var ds = Math.floor(n / this.DB); + + if (ds >= this.t) { + r.t = 0; + return; + } + + var bs = n % this.DB; + var cbs = this.DB - bs; + var bm = (1 << bs) - 1; + r.data[0] = this.data[ds] >> bs; + + for (var i = ds + 1; i < this.t; ++i) { + r.data[i - ds - 1] |= (this.data[i] & bm) << cbs; + r.data[i - ds] = this.data[i] >> bs; + } + + if (bs > 0) r.data[this.t - ds - 1] |= (this.s & bm) << cbs; + r.t = this.t - ds; + r.clamp(); +} // (protected) r = this - a + + +function bnpSubTo(a, r) { + var i = 0, + c = 0, + m = Math.min(a.t, this.t); + + while (i < m) { + c += this.data[i] - a.data[i]; + r.data[i++] = c & this.DM; + c >>= this.DB; + } + + if (a.t < this.t) { + c -= a.s; + + while (i < this.t) { + c += this.data[i]; + r.data[i++] = c & this.DM; + c >>= this.DB; + } + + c += this.s; + } else { + c += this.s; + + while (i < a.t) { + c -= a.data[i]; + r.data[i++] = c & this.DM; + c >>= this.DB; + } + + c -= a.s; + } + + r.s = c < 0 ? -1 : 0; + if (c < -1) r.data[i++] = this.DV + c;else if (c > 0) r.data[i++] = c; + r.t = i; + r.clamp(); +} // (protected) r = this * a, r != this,a (HAC 14.12) +// "this" should be the larger one if appropriate. + + +function bnpMultiplyTo(a, r) { + var x = this.abs(), + y = a.abs(); + var i = x.t; + r.t = i + y.t; + + while (--i >= 0) { + r.data[i] = 0; + } + + for (i = 0; i < y.t; ++i) { + r.data[i + x.t] = x.am(0, y.data[i], r, i, 0, x.t); + } + + r.s = 0; + r.clamp(); + if (this.s != a.s) BigInteger.ZERO.subTo(r, r); +} // (protected) r = this^2, r != this (HAC 14.16) + + +function bnpSquareTo(r) { + var x = this.abs(); + var i = r.t = 2 * x.t; + + while (--i >= 0) { + r.data[i] = 0; + } + + for (i = 0; i < x.t - 1; ++i) { + var c = x.am(i, x.data[i], r, 2 * i, 0, 1); + + if ((r.data[i + x.t] += x.am(i + 1, 2 * x.data[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) { + r.data[i + x.t] -= x.DV; + r.data[i + x.t + 1] = 1; + } + } + + if (r.t > 0) r.data[r.t - 1] += x.am(i, x.data[i], r, 2 * i, 0, 1); + r.s = 0; + r.clamp(); +} // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20) +// r != q, this != m. q or r may be null. + + +function bnpDivRemTo(m, q, r) { + var pm = m.abs(); + if (pm.t <= 0) return; + var pt = this.abs(); + + if (pt.t < pm.t) { + if (q != null) q.fromInt(0); + if (r != null) this.copyTo(r); + return; + } + + if (r == null) r = nbi(); + var y = nbi(), + ts = this.s, + ms = m.s; + var nsh = this.DB - nbits(pm.data[pm.t - 1]); // normalize modulus + + if (nsh > 0) { + pm.lShiftTo(nsh, y); + pt.lShiftTo(nsh, r); + } else { + pm.copyTo(y); + pt.copyTo(r); + } + + var ys = y.t; + var y0 = y.data[ys - 1]; + if (y0 == 0) return; + var yt = y0 * (1 << this.F1) + (ys > 1 ? y.data[ys - 2] >> this.F2 : 0); + var d1 = this.FV / yt, + d2 = (1 << this.F1) / yt, + e = 1 << this.F2; + var i = r.t, + j = i - ys, + t = q == null ? nbi() : q; + y.dlShiftTo(j, t); + + if (r.compareTo(t) >= 0) { + r.data[r.t++] = 1; + r.subTo(t, r); + } + + BigInteger.ONE.dlShiftTo(ys, t); + t.subTo(y, y); // "negative" y so we can replace sub with am later + + while (y.t < ys) { + y.data[y.t++] = 0; + } + + while (--j >= 0) { + // Estimate quotient digit + var qd = r.data[--i] == y0 ? this.DM : Math.floor(r.data[i] * d1 + (r.data[i - 1] + e) * d2); + + if ((r.data[i] += y.am(0, qd, r, j, 0, ys)) < qd) { + // Try it out + y.dlShiftTo(j, t); + r.subTo(t, r); + + while (r.data[i] < --qd) { + r.subTo(t, r); + } + } + } + + if (q != null) { + r.drShiftTo(ys, q); + if (ts != ms) BigInteger.ZERO.subTo(q, q); + } + + r.t = ys; + r.clamp(); + if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder + + if (ts < 0) BigInteger.ZERO.subTo(r, r); +} // (public) this mod a + + +function bnMod(a) { + var r = nbi(); + this.abs().divRemTo(a, null, r); + if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r); + return r; +} // Modular reduction using "classic" algorithm + + +function Classic(m) { + this.m = m; +} + +function cConvert(x) { + if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);else return x; +} + +function cRevert(x) { + return x; +} + +function cReduce(x) { + x.divRemTo(this.m, null, x); +} + +function cMulTo(x, y, r) { + x.multiplyTo(y, r); + this.reduce(r); +} + +function cSqrTo(x, r) { + x.squareTo(r); + this.reduce(r); +} + +Classic.prototype.convert = cConvert; +Classic.prototype.revert = cRevert; +Classic.prototype.reduce = cReduce; +Classic.prototype.mulTo = cMulTo; +Classic.prototype.sqrTo = cSqrTo; // (protected) return "-1/this % 2^DB"; useful for Mont. reduction +// justification: +// xy == 1 (mod m) +// xy = 1+km +// xy(2-xy) = (1+km)(1-km) +// x[y(2-xy)] = 1-k^2m^2 +// x[y(2-xy)] == 1 (mod m^2) +// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2 +// should reduce x and y(2-xy) by m^2 at each step to keep size bounded. +// JS multiply "overflows" differently from C/C++, so care is needed here. + +function bnpInvDigit() { + if (this.t < 1) return 0; + var x = this.data[0]; + if ((x & 1) == 0) return 0; + var y = x & 3; // y == 1/x mod 2^2 + + y = y * (2 - (x & 0xf) * y) & 0xf; // y == 1/x mod 2^4 + + y = y * (2 - (x & 0xff) * y) & 0xff; // y == 1/x mod 2^8 + + y = y * (2 - ((x & 0xffff) * y & 0xffff)) & 0xffff; // y == 1/x mod 2^16 + // last step - calculate inverse mod DV directly; + // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints + + y = y * (2 - x * y % this.DV) % this.DV; // y == 1/x mod 2^dbits + // we really want the negative inverse, and -DV < y < DV + + return y > 0 ? this.DV - y : -y; +} // Montgomery reduction + + +function Montgomery(m) { + this.m = m; + this.mp = m.invDigit(); + this.mpl = this.mp & 0x7fff; + this.mph = this.mp >> 15; + this.um = (1 << m.DB - 15) - 1; + this.mt2 = 2 * m.t; +} // xR mod m + + +function montConvert(x) { + var r = nbi(); + x.abs().dlShiftTo(this.m.t, r); + r.divRemTo(this.m, null, r); + if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r); + return r; +} // x/R mod m + + +function montRevert(x) { + var r = nbi(); + x.copyTo(r); + this.reduce(r); + return r; +} // x = x/R mod m (HAC 14.32) + + +function montReduce(x) { + while (x.t <= this.mt2) { + // pad x so am has enough room later + x.data[x.t++] = 0; + } + + for (var i = 0; i < this.m.t; ++i) { + // faster way of calculating u0 = x.data[i]*mp mod DV + var j = x.data[i] & 0x7fff; + var u0 = j * this.mpl + ((j * this.mph + (x.data[i] >> 15) * this.mpl & this.um) << 15) & x.DM; // use am to combine the multiply-shift-add into one call + + j = i + this.m.t; + x.data[j] += this.m.am(0, u0, x, i, 0, this.m.t); // propagate carry + + while (x.data[j] >= x.DV) { + x.data[j] -= x.DV; + x.data[++j]++; + } + } + + x.clamp(); + x.drShiftTo(this.m.t, x); + if (x.compareTo(this.m) >= 0) x.subTo(this.m, x); +} // r = "x^2/R mod m"; x != r + + +function montSqrTo(x, r) { + x.squareTo(r); + this.reduce(r); +} // r = "xy/R mod m"; x,y != r + + +function montMulTo(x, y, r) { + x.multiplyTo(y, r); + this.reduce(r); +} + +Montgomery.prototype.convert = montConvert; +Montgomery.prototype.revert = montRevert; +Montgomery.prototype.reduce = montReduce; +Montgomery.prototype.mulTo = montMulTo; +Montgomery.prototype.sqrTo = montSqrTo; // (protected) true iff this is even + +function bnpIsEven() { + return (this.t > 0 ? this.data[0] & 1 : this.s) == 0; +} // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79) + + +function bnpExp(e, z) { + if (e > 0xffffffff || e < 1) return BigInteger.ONE; + var r = nbi(), + r2 = nbi(), + g = z.convert(this), + i = nbits(e) - 1; + g.copyTo(r); + + while (--i >= 0) { + z.sqrTo(r, r2); + if ((e & 1 << i) > 0) z.mulTo(r2, g, r);else { + var t = r; + r = r2; + r2 = t; + } + } + + return z.revert(r); +} // (public) this^e % m, 0 <= e < 2^32 + + +function bnModPowInt(e, m) { + var z; + if (e < 256 || m.isEven()) z = new Classic(m);else z = new Montgomery(m); + return this.exp(e, z); +} // protected + + +BigInteger.prototype.copyTo = bnpCopyTo; +BigInteger.prototype.fromInt = bnpFromInt; +BigInteger.prototype.fromString = bnpFromString; +BigInteger.prototype.clamp = bnpClamp; +BigInteger.prototype.dlShiftTo = bnpDLShiftTo; +BigInteger.prototype.drShiftTo = bnpDRShiftTo; +BigInteger.prototype.lShiftTo = bnpLShiftTo; +BigInteger.prototype.rShiftTo = bnpRShiftTo; +BigInteger.prototype.subTo = bnpSubTo; +BigInteger.prototype.multiplyTo = bnpMultiplyTo; +BigInteger.prototype.squareTo = bnpSquareTo; +BigInteger.prototype.divRemTo = bnpDivRemTo; +BigInteger.prototype.invDigit = bnpInvDigit; +BigInteger.prototype.isEven = bnpIsEven; +BigInteger.prototype.exp = bnpExp; // public + +BigInteger.prototype.toString = bnToString; +BigInteger.prototype.negate = bnNegate; +BigInteger.prototype.abs = bnAbs; +BigInteger.prototype.compareTo = bnCompareTo; +BigInteger.prototype.bitLength = bnBitLength; +BigInteger.prototype.mod = bnMod; +BigInteger.prototype.modPowInt = bnModPowInt; // "constants" + +BigInteger.ZERO = nbv(0); +BigInteger.ONE = nbv(1); // jsbn2 lib +//Copyright (c) 2005-2009 Tom Wu +//All Rights Reserved. +//See "LICENSE" for details (See jsbn.js for LICENSE). +//Extended JavaScript BN functions, required for RSA private ops. +//Version 1.1: new BigInteger("0", 10) returns "proper" zero +//(public) + +function bnClone() { + var r = nbi(); + this.copyTo(r); + return r; +} //(public) return value as integer + + +function bnIntValue() { + if (this.s < 0) { + if (this.t == 1) return this.data[0] - this.DV;else if (this.t == 0) return -1; + } else if (this.t == 1) return this.data[0];else if (this.t == 0) return 0; // assumes 16 < DB < 32 + + + return (this.data[1] & (1 << 32 - this.DB) - 1) << this.DB | this.data[0]; +} //(public) return value as byte + + +function bnByteValue() { + return this.t == 0 ? this.s : this.data[0] << 24 >> 24; +} //(public) return value as short (assumes DB>=16) + + +function bnShortValue() { + return this.t == 0 ? this.s : this.data[0] << 16 >> 16; +} //(protected) return x s.t. r^x < DV + + +function bnpChunkSize(r) { + return Math.floor(Math.LN2 * this.DB / Math.log(r)); +} //(public) 0 if this == 0, 1 if this > 0 + + +function bnSigNum() { + if (this.s < 0) return -1;else if (this.t <= 0 || this.t == 1 && this.data[0] <= 0) return 0;else return 1; +} //(protected) convert to radix string + + +function bnpToRadix(b) { + if (b == null) b = 10; + if (this.signum() == 0 || b < 2 || b > 36) return "0"; + var cs = this.chunkSize(b); + var a = Math.pow(b, cs); + var d = nbv(a), + y = nbi(), + z = nbi(), + r = ""; + this.divRemTo(d, y, z); + + while (y.signum() > 0) { + r = (a + z.intValue()).toString(b).substr(1) + r; + y.divRemTo(d, y, z); + } + + return z.intValue().toString(b) + r; +} //(protected) convert from radix string + + +function bnpFromRadix(s, b) { + this.fromInt(0); + if (b == null) b = 10; + var cs = this.chunkSize(b); + var d = Math.pow(b, cs), + mi = false, + j = 0, + w = 0; + + for (var i = 0; i < s.length; ++i) { + var x = intAt(s, i); + + if (x < 0) { + if (s.charAt(i) == "-" && this.signum() == 0) mi = true; + continue; + } + + w = b * w + x; + + if (++j >= cs) { + this.dMultiply(d); + this.dAddOffset(w, 0); + j = 0; + w = 0; + } + } + + if (j > 0) { + this.dMultiply(Math.pow(b, j)); + this.dAddOffset(w, 0); + } + + if (mi) BigInteger.ZERO.subTo(this, this); +} //(protected) alternate constructor + + +function bnpFromNumber(a, b, c) { + if ("number" == typeof b) { + // new BigInteger(int,int,RNG) + if (a < 2) this.fromInt(1);else { + this.fromNumber(a, c); + if (!this.testBit(a - 1)) // force MSB set + this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this); + if (this.isEven()) this.dAddOffset(1, 0); // force odd + + while (!this.isProbablePrime(b)) { + this.dAddOffset(2, 0); + if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this); + } + } + } else { + // new BigInteger(int,RNG) + var x = new Array(), + t = a & 7; + x.length = (a >> 3) + 1; + b.nextBytes(x); + if (t > 0) x[0] &= (1 << t) - 1;else x[0] = 0; + this.fromString(x, 256); + } +} //(public) convert to bigendian byte array + + +function bnToByteArray() { + var i = this.t, + r = new Array(); + r[0] = this.s; + var p = this.DB - i * this.DB % 8, + d, + k = 0; + + if (i-- > 0) { + if (p < this.DB && (d = this.data[i] >> p) != (this.s & this.DM) >> p) r[k++] = d | this.s << this.DB - p; + + while (i >= 0) { + if (p < 8) { + d = (this.data[i] & (1 << p) - 1) << 8 - p; + d |= this.data[--i] >> (p += this.DB - 8); + } else { + d = this.data[i] >> (p -= 8) & 0xff; + + if (p <= 0) { + p += this.DB; + --i; + } + } + + if ((d & 0x80) != 0) d |= -256; + if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k; + if (k > 0 || d != this.s) r[k++] = d; + } + } + + return r; +} + +function bnEquals(a) { + return this.compareTo(a) == 0; +} + +function bnMin(a) { + return this.compareTo(a) < 0 ? this : a; +} + +function bnMax(a) { + return this.compareTo(a) > 0 ? this : a; +} //(protected) r = this op a (bitwise) + + +function bnpBitwiseTo(a, op, r) { + var i, + f, + m = Math.min(a.t, this.t); + + for (i = 0; i < m; ++i) { + r.data[i] = op(this.data[i], a.data[i]); + } + + if (a.t < this.t) { + f = a.s & this.DM; + + for (i = m; i < this.t; ++i) { + r.data[i] = op(this.data[i], f); + } + + r.t = this.t; + } else { + f = this.s & this.DM; + + for (i = m; i < a.t; ++i) { + r.data[i] = op(f, a.data[i]); + } + + r.t = a.t; + } + + r.s = op(this.s, a.s); + r.clamp(); +} //(public) this & a + + +function op_and(x, y) { + return x & y; +} + +function bnAnd(a) { + var r = nbi(); + this.bitwiseTo(a, op_and, r); + return r; +} //(public) this | a + + +function op_or(x, y) { + return x | y; +} + +function bnOr(a) { + var r = nbi(); + this.bitwiseTo(a, op_or, r); + return r; +} //(public) this ^ a + + +function op_xor(x, y) { + return x ^ y; +} + +function bnXor(a) { + var r = nbi(); + this.bitwiseTo(a, op_xor, r); + return r; +} //(public) this & ~a + + +function op_andnot(x, y) { + return x & ~y; +} + +function bnAndNot(a) { + var r = nbi(); + this.bitwiseTo(a, op_andnot, r); + return r; +} //(public) ~this + + +function bnNot() { + var r = nbi(); + + for (var i = 0; i < this.t; ++i) { + r.data[i] = this.DM & ~this.data[i]; + } + + r.t = this.t; + r.s = ~this.s; + return r; +} //(public) this << n + + +function bnShiftLeft(n) { + var r = nbi(); + if (n < 0) this.rShiftTo(-n, r);else this.lShiftTo(n, r); + return r; +} //(public) this >> n + + +function bnShiftRight(n) { + var r = nbi(); + if (n < 0) this.lShiftTo(-n, r);else this.rShiftTo(n, r); + return r; +} //return index of lowest 1-bit in x, x < 2^31 + + +function lbit(x) { + if (x == 0) return -1; + var r = 0; + + if ((x & 0xffff) == 0) { + x >>= 16; + r += 16; + } + + if ((x & 0xff) == 0) { + x >>= 8; + r += 8; + } + + if ((x & 0xf) == 0) { + x >>= 4; + r += 4; + } + + if ((x & 3) == 0) { + x >>= 2; + r += 2; + } + + if ((x & 1) == 0) ++r; + return r; +} //(public) returns index of lowest 1-bit (or -1 if none) + + +function bnGetLowestSetBit() { + for (var i = 0; i < this.t; ++i) { + if (this.data[i] != 0) return i * this.DB + lbit(this.data[i]); + } + + if (this.s < 0) return this.t * this.DB; + return -1; +} //return number of 1 bits in x + + +function cbit(x) { + var r = 0; + + while (x != 0) { + x &= x - 1; + ++r; + } + + return r; +} //(public) return number of set bits + + +function bnBitCount() { + var r = 0, + x = this.s & this.DM; + + for (var i = 0; i < this.t; ++i) { + r += cbit(this.data[i] ^ x); + } + + return r; +} //(public) true iff nth bit is set + + +function bnTestBit(n) { + var j = Math.floor(n / this.DB); + if (j >= this.t) return this.s != 0; + return (this.data[j] & 1 << n % this.DB) != 0; +} //(protected) this op (1<>= this.DB; + } + + if (a.t < this.t) { + c += a.s; + + while (i < this.t) { + c += this.data[i]; + r.data[i++] = c & this.DM; + c >>= this.DB; + } + + c += this.s; + } else { + c += this.s; + + while (i < a.t) { + c += a.data[i]; + r.data[i++] = c & this.DM; + c >>= this.DB; + } + + c += a.s; + } + + r.s = c < 0 ? -1 : 0; + if (c > 0) r.data[i++] = c;else if (c < -1) r.data[i++] = this.DV + c; + r.t = i; + r.clamp(); +} //(public) this + a + + +function bnAdd(a) { + var r = nbi(); + this.addTo(a, r); + return r; +} //(public) this - a + + +function bnSubtract(a) { + var r = nbi(); + this.subTo(a, r); + return r; +} //(public) this * a + + +function bnMultiply(a) { + var r = nbi(); + this.multiplyTo(a, r); + return r; +} //(public) this / a + + +function bnDivide(a) { + var r = nbi(); + this.divRemTo(a, r, null); + return r; +} //(public) this % a + + +function bnRemainder(a) { + var r = nbi(); + this.divRemTo(a, null, r); + return r; +} //(public) [this/a,this%a] + + +function bnDivideAndRemainder(a) { + var q = nbi(), + r = nbi(); + this.divRemTo(a, q, r); + return new Array(q, r); +} //(protected) this *= n, this >= 0, 1 < n < DV + + +function bnpDMultiply(n) { + this.data[this.t] = this.am(0, n - 1, this, 0, 0, this.t); + ++this.t; + this.clamp(); +} //(protected) this += n << w words, this >= 0 + + +function bnpDAddOffset(n, w) { + if (n == 0) return; + + while (this.t <= w) { + this.data[this.t++] = 0; + } + + this.data[w] += n; + + while (this.data[w] >= this.DV) { + this.data[w] -= this.DV; + if (++w >= this.t) this.data[this.t++] = 0; + ++this.data[w]; + } +} //A "null" reducer + + +function NullExp() {} + +function nNop(x) { + return x; +} + +function nMulTo(x, y, r) { + x.multiplyTo(y, r); +} + +function nSqrTo(x, r) { + x.squareTo(r); +} + +NullExp.prototype.convert = nNop; +NullExp.prototype.revert = nNop; +NullExp.prototype.mulTo = nMulTo; +NullExp.prototype.sqrTo = nSqrTo; //(public) this^e + +function bnPow(e) { + return this.exp(e, new NullExp()); +} //(protected) r = lower n words of "this * a", a.t <= n +//"this" should be the larger one if appropriate. + + +function bnpMultiplyLowerTo(a, n, r) { + var i = Math.min(this.t + a.t, n); + r.s = 0; // assumes a,this >= 0 + + r.t = i; + + while (i > 0) { + r.data[--i] = 0; + } + + var j; + + for (j = r.t - this.t; i < j; ++i) { + r.data[i + this.t] = this.am(0, a.data[i], r, i, 0, this.t); + } + + for (j = Math.min(a.t, n); i < j; ++i) { + this.am(0, a.data[i], r, i, 0, n - i); + } + + r.clamp(); +} //(protected) r = "this * a" without lower n words, n > 0 +//"this" should be the larger one if appropriate. + + +function bnpMultiplyUpperTo(a, n, r) { + --n; + var i = r.t = this.t + a.t - n; + r.s = 0; // assumes a,this >= 0 + + while (--i >= 0) { + r.data[i] = 0; + } + + for (i = Math.max(n - this.t, 0); i < a.t; ++i) { + r.data[this.t + i - n] = this.am(n - i, a.data[i], r, 0, 0, this.t + i - n); + } + + r.clamp(); + r.drShiftTo(1, r); +} //Barrett modular reduction + + +function Barrett(m) { + // setup Barrett + this.r2 = nbi(); + this.q3 = nbi(); + BigInteger.ONE.dlShiftTo(2 * m.t, this.r2); + this.mu = this.r2.divide(m); + this.m = m; +} + +function barrettConvert(x) { + if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);else if (x.compareTo(this.m) < 0) return x;else { + var r = nbi(); + x.copyTo(r); + this.reduce(r); + return r; + } +} + +function barrettRevert(x) { + return x; +} //x = x mod m (HAC 14.42) + + +function barrettReduce(x) { + x.drShiftTo(this.m.t - 1, this.r2); + + if (x.t > this.m.t + 1) { + x.t = this.m.t + 1; + x.clamp(); + } + + this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3); + this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2); + + while (x.compareTo(this.r2) < 0) { + x.dAddOffset(1, this.m.t + 1); + } + + x.subTo(this.r2, x); + + while (x.compareTo(this.m) >= 0) { + x.subTo(this.m, x); + } +} //r = x^2 mod m; x != r + + +function barrettSqrTo(x, r) { + x.squareTo(r); + this.reduce(r); +} //r = x*y mod m; x,y != r + + +function barrettMulTo(x, y, r) { + x.multiplyTo(y, r); + this.reduce(r); +} + +Barrett.prototype.convert = barrettConvert; +Barrett.prototype.revert = barrettRevert; +Barrett.prototype.reduce = barrettReduce; +Barrett.prototype.mulTo = barrettMulTo; +Barrett.prototype.sqrTo = barrettSqrTo; //(public) this^e % m (HAC 14.85) + +function bnModPow(e, m) { + var i = e.bitLength(), + k, + r = nbv(1), + z; + if (i <= 0) return r;else if (i < 18) k = 1;else if (i < 48) k = 3;else if (i < 144) k = 4;else if (i < 768) k = 5;else k = 6; + if (i < 8) z = new Classic(m);else if (m.isEven()) z = new Barrett(m);else z = new Montgomery(m); // precomputation + + var g = new Array(), + n = 3, + k1 = k - 1, + km = (1 << k) - 1; + g[1] = z.convert(this); + + if (k > 1) { + var g2 = nbi(); + z.sqrTo(g[1], g2); + + while (n <= km) { + g[n] = nbi(); + z.mulTo(g2, g[n - 2], g[n]); + n += 2; + } + } + + var j = e.t - 1, + w, + is1 = true, + r2 = nbi(), + t; + i = nbits(e.data[j]) - 1; + + while (j >= 0) { + if (i >= k1) w = e.data[j] >> i - k1 & km;else { + w = (e.data[j] & (1 << i + 1) - 1) << k1 - i; + if (j > 0) w |= e.data[j - 1] >> this.DB + i - k1; + } + n = k; + + while ((w & 1) == 0) { + w >>= 1; + --n; + } + + if ((i -= n) < 0) { + i += this.DB; + --j; + } + + if (is1) { + // ret == 1, don't bother squaring or multiplying it + g[w].copyTo(r); + is1 = false; + } else { + while (n > 1) { + z.sqrTo(r, r2); + z.sqrTo(r2, r); + n -= 2; + } + + if (n > 0) z.sqrTo(r, r2);else { + t = r; + r = r2; + r2 = t; + } + z.mulTo(r2, g[w], r); + } + + while (j >= 0 && (e.data[j] & 1 << i) == 0) { + z.sqrTo(r, r2); + t = r; + r = r2; + r2 = t; + + if (--i < 0) { + i = this.DB - 1; + --j; + } + } + } + + return z.revert(r); +} //(public) gcd(this,a) (HAC 14.54) + + +function bnGCD(a) { + var x = this.s < 0 ? this.negate() : this.clone(); + var y = a.s < 0 ? a.negate() : a.clone(); + + if (x.compareTo(y) < 0) { + var t = x; + x = y; + y = t; + } + + var i = x.getLowestSetBit(), + g = y.getLowestSetBit(); + if (g < 0) return x; + if (i < g) g = i; + + if (g > 0) { + x.rShiftTo(g, x); + y.rShiftTo(g, y); + } + + while (x.signum() > 0) { + if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x); + if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y); + + if (x.compareTo(y) >= 0) { + x.subTo(y, x); + x.rShiftTo(1, x); + } else { + y.subTo(x, y); + y.rShiftTo(1, y); + } + } + + if (g > 0) y.lShiftTo(g, y); + return y; +} //(protected) this % n, n < 2^26 + + +function bnpModInt(n) { + if (n <= 0) return 0; + var d = this.DV % n, + r = this.s < 0 ? n - 1 : 0; + if (this.t > 0) if (d == 0) r = this.data[0] % n;else for (var i = this.t - 1; i >= 0; --i) { + r = (d * r + this.data[i]) % n; + } + return r; +} //(public) 1/this % m (HAC 14.61) + + +function bnModInverse(m) { + var ac = m.isEven(); + if (this.isEven() && ac || m.signum() == 0) return BigInteger.ZERO; + var u = m.clone(), + v = this.clone(); + var a = nbv(1), + b = nbv(0), + c = nbv(0), + d = nbv(1); + + while (u.signum() != 0) { + while (u.isEven()) { + u.rShiftTo(1, u); + + if (ac) { + if (!a.isEven() || !b.isEven()) { + a.addTo(this, a); + b.subTo(m, b); + } + + a.rShiftTo(1, a); + } else if (!b.isEven()) b.subTo(m, b); + + b.rShiftTo(1, b); + } + + while (v.isEven()) { + v.rShiftTo(1, v); + + if (ac) { + if (!c.isEven() || !d.isEven()) { + c.addTo(this, c); + d.subTo(m, d); + } + + c.rShiftTo(1, c); + } else if (!d.isEven()) d.subTo(m, d); + + d.rShiftTo(1, d); + } + + if (u.compareTo(v) >= 0) { + u.subTo(v, u); + if (ac) a.subTo(c, a); + b.subTo(d, b); + } else { + v.subTo(u, v); + if (ac) c.subTo(a, c); + d.subTo(b, d); + } + } + + if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO; + if (d.compareTo(m) >= 0) return d.subtract(m); + if (d.signum() < 0) d.addTo(m, d);else return d; + if (d.signum() < 0) return d.add(m);else return d; +} + +var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509]; +var lplim = (1 << 26) / lowprimes[lowprimes.length - 1]; //(public) test primality with certainty >= 1-.5^t + +function bnIsProbablePrime(t) { + var i, + x = this.abs(); + + if (x.t == 1 && x.data[0] <= lowprimes[lowprimes.length - 1]) { + for (i = 0; i < lowprimes.length; ++i) { + if (x.data[0] == lowprimes[i]) return true; + } + + return false; + } + + if (x.isEven()) return false; + i = 1; + + while (i < lowprimes.length) { + var m = lowprimes[i], + j = i + 1; + + while (j < lowprimes.length && m < lplim) { + m *= lowprimes[j++]; + } + + m = x.modInt(m); + + while (i < j) { + if (m % lowprimes[i++] == 0) return false; + } + } + + return x.millerRabin(t); +} //(protected) true if probably prime (HAC 4.24, Miller-Rabin) + + +function bnpMillerRabin(t) { + var n1 = this.subtract(BigInteger.ONE); + var k = n1.getLowestSetBit(); + if (k <= 0) return false; + var r = n1.shiftRight(k); + var prng = bnGetPrng(); + var a; + + for (var i = 0; i < t; ++i) { + // select witness 'a' at random from between 1 and n1 + do { + a = new BigInteger(this.bitLength(), prng); + } while (a.compareTo(BigInteger.ONE) <= 0 || a.compareTo(n1) >= 0); + + var y = a.modPow(r, this); + + if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) { + var j = 1; + + while (j++ < k && y.compareTo(n1) != 0) { + y = y.modPowInt(2, this); + if (y.compareTo(BigInteger.ONE) == 0) return false; + } + + if (y.compareTo(n1) != 0) return false; + } + } + + return true; +} // get pseudo random number generator + + +function bnGetPrng() { + // create prng with api that matches BigInteger secure random + return { + // x is an array to fill with bytes + nextBytes: function nextBytes(x) { + for (var i = 0; i < x.length; ++i) { + x[i] = Math.floor(Math.random() * 0x0100); + } + } + }; +} //protected + + +BigInteger.prototype.chunkSize = bnpChunkSize; +BigInteger.prototype.toRadix = bnpToRadix; +BigInteger.prototype.fromRadix = bnpFromRadix; +BigInteger.prototype.fromNumber = bnpFromNumber; +BigInteger.prototype.bitwiseTo = bnpBitwiseTo; +BigInteger.prototype.changeBit = bnpChangeBit; +BigInteger.prototype.addTo = bnpAddTo; +BigInteger.prototype.dMultiply = bnpDMultiply; +BigInteger.prototype.dAddOffset = bnpDAddOffset; +BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo; +BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo; +BigInteger.prototype.modInt = bnpModInt; +BigInteger.prototype.millerRabin = bnpMillerRabin; //public + +BigInteger.prototype.clone = bnClone; +BigInteger.prototype.intValue = bnIntValue; +BigInteger.prototype.byteValue = bnByteValue; +BigInteger.prototype.shortValue = bnShortValue; +BigInteger.prototype.signum = bnSigNum; +BigInteger.prototype.toByteArray = bnToByteArray; +BigInteger.prototype.equals = bnEquals; +BigInteger.prototype.min = bnMin; +BigInteger.prototype.max = bnMax; +BigInteger.prototype.and = bnAnd; +BigInteger.prototype.or = bnOr; +BigInteger.prototype.xor = bnXor; +BigInteger.prototype.andNot = bnAndNot; +BigInteger.prototype.not = bnNot; +BigInteger.prototype.shiftLeft = bnShiftLeft; +BigInteger.prototype.shiftRight = bnShiftRight; +BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit; +BigInteger.prototype.bitCount = bnBitCount; +BigInteger.prototype.testBit = bnTestBit; +BigInteger.prototype.setBit = bnSetBit; +BigInteger.prototype.clearBit = bnClearBit; +BigInteger.prototype.flipBit = bnFlipBit; +BigInteger.prototype.add = bnAdd; +BigInteger.prototype.subtract = bnSubtract; +BigInteger.prototype.multiply = bnMultiply; +BigInteger.prototype.divide = bnDivide; +BigInteger.prototype.remainder = bnRemainder; +BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder; +BigInteger.prototype.modPow = bnModPow; +BigInteger.prototype.modInverse = bnModInverse; +BigInteger.prototype.pow = bnPow; +BigInteger.prototype.gcd = bnGCD; +BigInteger.prototype.isProbablePrime = bnIsProbablePrime; //BigInteger interfaces not implemented in jsbn: +//BigInteger(int signum, byte[] magnitude) +//double doubleValue() +//float floatValue() +//int hashCode() +//long longValue() +//static BigInteger valueOf(long val) + +/***/ }), +/* 108 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Advanced Encryption Standard (AES) implementation. + * + * This implementation is based on the public domain library 'jscrypto' which + * was written by: + * + * Emily Stark (estark@stanford.edu) + * Mike Hamburg (mhamburg@stanford.edu) + * Dan Boneh (dabo@cs.stanford.edu) + * + * Parts of this code are based on the OpenSSL implementation of AES: + * http://www.openssl.org + * + * @author Dave Longley + * + * Copyright (c) 2010-2014 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +__webpack_require__(109); + +__webpack_require__(110); + +__webpack_require__(9); +/* AES API */ + + +module.exports = forge.aes = forge.aes || {}; +/** + * Deprecated. Instead, use: + * + * var cipher = forge.cipher.createCipher('AES-', key); + * cipher.start({iv: iv}); + * + * Creates an AES cipher object to encrypt data using the given symmetric key. + * The output will be stored in the 'output' member of the returned cipher. + * + * The key and iv may be given as a string of bytes, an array of bytes, + * a byte buffer, or an array of 32-bit words. + * + * @param key the symmetric key to use. + * @param iv the initialization vector to use. + * @param output the buffer to write to, null to create one. + * @param mode the cipher mode to use (default: 'CBC'). + * + * @return the cipher. + */ + +forge.aes.startEncrypting = function (key, iv, output, mode) { + var cipher = _createCipher({ + key: key, + output: output, + decrypt: false, + mode: mode + }); + + cipher.start(iv); + return cipher; +}; +/** + * Deprecated. Instead, use: + * + * var cipher = forge.cipher.createCipher('AES-', key); + * + * Creates an AES cipher object to encrypt data using the given symmetric key. + * + * The key may be given as a string of bytes, an array of bytes, a + * byte buffer, or an array of 32-bit words. + * + * @param key the symmetric key to use. + * @param mode the cipher mode to use (default: 'CBC'). + * + * @return the cipher. + */ + + +forge.aes.createEncryptionCipher = function (key, mode) { + return _createCipher({ + key: key, + output: null, + decrypt: false, + mode: mode + }); +}; +/** + * Deprecated. Instead, use: + * + * var decipher = forge.cipher.createDecipher('AES-', key); + * decipher.start({iv: iv}); + * + * Creates an AES cipher object to decrypt data using the given symmetric key. + * The output will be stored in the 'output' member of the returned cipher. + * + * The key and iv may be given as a string of bytes, an array of bytes, + * a byte buffer, or an array of 32-bit words. + * + * @param key the symmetric key to use. + * @param iv the initialization vector to use. + * @param output the buffer to write to, null to create one. + * @param mode the cipher mode to use (default: 'CBC'). + * + * @return the cipher. + */ + + +forge.aes.startDecrypting = function (key, iv, output, mode) { + var cipher = _createCipher({ + key: key, + output: output, + decrypt: true, + mode: mode + }); + + cipher.start(iv); + return cipher; +}; +/** + * Deprecated. Instead, use: + * + * var decipher = forge.cipher.createDecipher('AES-', key); + * + * Creates an AES cipher object to decrypt data using the given symmetric key. + * + * The key may be given as a string of bytes, an array of bytes, a + * byte buffer, or an array of 32-bit words. + * + * @param key the symmetric key to use. + * @param mode the cipher mode to use (default: 'CBC'). + * + * @return the cipher. + */ + + +forge.aes.createDecryptionCipher = function (key, mode) { + return _createCipher({ + key: key, + output: null, + decrypt: true, + mode: mode + }); +}; +/** + * Creates a new AES cipher algorithm object. + * + * @param name the name of the algorithm. + * @param mode the mode factory function. + * + * @return the AES algorithm object. + */ + + +forge.aes.Algorithm = function (name, mode) { + if (!init) { + initialize(); + } + + var self = this; + self.name = name; + self.mode = new mode({ + blockSize: 16, + cipher: { + encrypt: function encrypt(inBlock, outBlock) { + return _updateBlock(self._w, inBlock, outBlock, false); + }, + decrypt: function decrypt(inBlock, outBlock) { + return _updateBlock(self._w, inBlock, outBlock, true); + } + } + }); + self._init = false; +}; +/** + * Initializes this AES algorithm by expanding its key. + * + * @param options the options to use. + * key the key to use with this algorithm. + * decrypt true if the algorithm should be initialized for decryption, + * false for encryption. + */ + + +forge.aes.Algorithm.prototype.initialize = function (options) { + if (this._init) { + return; + } + + var key = options.key; + var tmp; + /* Note: The key may be a string of bytes, an array of bytes, a byte + buffer, or an array of 32-bit integers. If the key is in bytes, then + it must be 16, 24, or 32 bytes in length. If it is in 32-bit + integers, it must be 4, 6, or 8 integers long. */ + + if (typeof key === 'string' && (key.length === 16 || key.length === 24 || key.length === 32)) { + // convert key string into byte buffer + key = forge.util.createBuffer(key); + } else if (forge.util.isArray(key) && (key.length === 16 || key.length === 24 || key.length === 32)) { + // convert key integer array into byte buffer + tmp = key; + key = forge.util.createBuffer(); + + for (var i = 0; i < tmp.length; ++i) { + key.putByte(tmp[i]); + } + } // convert key byte buffer into 32-bit integer array + + + if (!forge.util.isArray(key)) { + tmp = key; + key = []; // key lengths of 16, 24, 32 bytes allowed + + var len = tmp.length(); + + if (len === 16 || len === 24 || len === 32) { + len = len >>> 2; + + for (var i = 0; i < len; ++i) { + key.push(tmp.getInt32()); + } + } + } // key must be an array of 32-bit integers by now + + + if (!forge.util.isArray(key) || !(key.length === 4 || key.length === 6 || key.length === 8)) { + throw new Error('Invalid key parameter.'); + } // encryption operation is always used for these modes + + + var mode = this.mode.name; + var encryptOp = ['CFB', 'OFB', 'CTR', 'GCM'].indexOf(mode) !== -1; // do key expansion + + this._w = _expandKey(key, options.decrypt && !encryptOp); + this._init = true; +}; +/** + * Expands a key. Typically only used for testing. + * + * @param key the symmetric key to expand, as an array of 32-bit words. + * @param decrypt true to expand for decryption, false for encryption. + * + * @return the expanded key. + */ + + +forge.aes._expandKey = function (key, decrypt) { + if (!init) { + initialize(); + } + + return _expandKey(key, decrypt); +}; +/** + * Updates a single block. Typically only used for testing. + * + * @param w the expanded key to use. + * @param input an array of block-size 32-bit words. + * @param output an array of block-size 32-bit words. + * @param decrypt true to decrypt, false to encrypt. + */ + + +forge.aes._updateBlock = _updateBlock; +/** Register AES algorithms **/ + +registerAlgorithm('AES-ECB', forge.cipher.modes.ecb); +registerAlgorithm('AES-CBC', forge.cipher.modes.cbc); +registerAlgorithm('AES-CFB', forge.cipher.modes.cfb); +registerAlgorithm('AES-OFB', forge.cipher.modes.ofb); +registerAlgorithm('AES-CTR', forge.cipher.modes.ctr); +registerAlgorithm('AES-GCM', forge.cipher.modes.gcm); + +function registerAlgorithm(name, mode) { + var factory = function factory() { + return new forge.aes.Algorithm(name, mode); + }; + + forge.cipher.registerAlgorithm(name, factory); +} +/** AES implementation **/ + + +var init = false; // not yet initialized + +var Nb = 4; // number of words comprising the state (AES = 4) + +var sbox; // non-linear substitution table used in key expansion + +var isbox; // inversion of sbox + +var rcon; // round constant word array + +var mix; // mix-columns table + +var imix; // inverse mix-columns table + +/** + * Performs initialization, ie: precomputes tables to optimize for speed. + * + * One way to understand how AES works is to imagine that 'addition' and + * 'multiplication' are interfaces that require certain mathematical + * properties to hold true (ie: they are associative) but they might have + * different implementations and produce different kinds of results ... + * provided that their mathematical properties remain true. AES defines + * its own methods of addition and multiplication but keeps some important + * properties the same, ie: associativity and distributivity. The + * explanation below tries to shed some light on how AES defines addition + * and multiplication of bytes and 32-bit words in order to perform its + * encryption and decryption algorithms. + * + * The basics: + * + * The AES algorithm views bytes as binary representations of polynomials + * that have either 1 or 0 as the coefficients. It defines the addition + * or subtraction of two bytes as the XOR operation. It also defines the + * multiplication of two bytes as a finite field referred to as GF(2^8) + * (Note: 'GF' means "Galois Field" which is a field that contains a finite + * number of elements so GF(2^8) has 256 elements). + * + * This means that any two bytes can be represented as binary polynomials; + * when they multiplied together and modularly reduced by an irreducible + * polynomial of the 8th degree, the results are the field GF(2^8). The + * specific irreducible polynomial that AES uses in hexadecimal is 0x11b. + * This multiplication is associative with 0x01 as the identity: + * + * (b * 0x01 = GF(b, 0x01) = b). + * + * The operation GF(b, 0x02) can be performed at the byte level by left + * shifting b once and then XOR'ing it (to perform the modular reduction) + * with 0x11b if b is >= 128. Repeated application of the multiplication + * of 0x02 can be used to implement the multiplication of any two bytes. + * + * For instance, multiplying 0x57 and 0x13, denoted as GF(0x57, 0x13), can + * be performed by factoring 0x13 into 0x01, 0x02, and 0x10. Then these + * factors can each be multiplied by 0x57 and then added together. To do + * the multiplication, values for 0x57 multiplied by each of these 3 factors + * can be precomputed and stored in a table. To add them, the values from + * the table are XOR'd together. + * + * AES also defines addition and multiplication of words, that is 4-byte + * numbers represented as polynomials of 3 degrees where the coefficients + * are the values of the bytes. + * + * The word [a0, a1, a2, a3] is a polynomial a3x^3 + a2x^2 + a1x + a0. + * + * Addition is performed by XOR'ing like powers of x. Multiplication + * is performed in two steps, the first is an algebriac expansion as + * you would do normally (where addition is XOR). But the result is + * a polynomial larger than 3 degrees and thus it cannot fit in a word. So + * next the result is modularly reduced by an AES-specific polynomial of + * degree 4 which will always produce a polynomial of less than 4 degrees + * such that it will fit in a word. In AES, this polynomial is x^4 + 1. + * + * The modular product of two polynomials 'a' and 'b' is thus: + * + * d(x) = d3x^3 + d2x^2 + d1x + d0 + * with + * d0 = GF(a0, b0) ^ GF(a3, b1) ^ GF(a2, b2) ^ GF(a1, b3) + * d1 = GF(a1, b0) ^ GF(a0, b1) ^ GF(a3, b2) ^ GF(a2, b3) + * d2 = GF(a2, b0) ^ GF(a1, b1) ^ GF(a0, b2) ^ GF(a3, b3) + * d3 = GF(a3, b0) ^ GF(a2, b1) ^ GF(a1, b2) ^ GF(a0, b3) + * + * As a matrix: + * + * [d0] = [a0 a3 a2 a1][b0] + * [d1] [a1 a0 a3 a2][b1] + * [d2] [a2 a1 a0 a3][b2] + * [d3] [a3 a2 a1 a0][b3] + * + * Special polynomials defined by AES (0x02 == {02}): + * a(x) = {03}x^3 + {01}x^2 + {01}x + {02} + * a^-1(x) = {0b}x^3 + {0d}x^2 + {09}x + {0e}. + * + * These polynomials are used in the MixColumns() and InverseMixColumns() + * operations, respectively, to cause each element in the state to affect + * the output (referred to as diffusing). + * + * RotWord() uses: a0 = a1 = a2 = {00} and a3 = {01}, which is the + * polynomial x3. + * + * The ShiftRows() method modifies the last 3 rows in the state (where + * the state is 4 words with 4 bytes per word) by shifting bytes cyclically. + * The 1st byte in the second row is moved to the end of the row. The 1st + * and 2nd bytes in the third row are moved to the end of the row. The 1st, + * 2nd, and 3rd bytes are moved in the fourth row. + * + * More details on how AES arithmetic works: + * + * In the polynomial representation of binary numbers, XOR performs addition + * and subtraction and multiplication in GF(2^8) denoted as GF(a, b) + * corresponds with the multiplication of polynomials modulo an irreducible + * polynomial of degree 8. In other words, for AES, GF(a, b) will multiply + * polynomial 'a' with polynomial 'b' and then do a modular reduction by + * an AES-specific irreducible polynomial of degree 8. + * + * A polynomial is irreducible if its only divisors are one and itself. For + * the AES algorithm, this irreducible polynomial is: + * + * m(x) = x^8 + x^4 + x^3 + x + 1, + * + * or {01}{1b} in hexadecimal notation, where each coefficient is a bit: + * 100011011 = 283 = 0x11b. + * + * For example, GF(0x57, 0x83) = 0xc1 because + * + * 0x57 = 87 = 01010111 = x^6 + x^4 + x^2 + x + 1 + * 0x85 = 131 = 10000101 = x^7 + x + 1 + * + * (x^6 + x^4 + x^2 + x + 1) * (x^7 + x + 1) + * = x^13 + x^11 + x^9 + x^8 + x^7 + + * x^7 + x^5 + x^3 + x^2 + x + + * x^6 + x^4 + x^2 + x + 1 + * = x^13 + x^11 + x^9 + x^8 + x^6 + x^5 + x^4 + x^3 + 1 = y + * y modulo (x^8 + x^4 + x^3 + x + 1) + * = x^7 + x^6 + 1. + * + * The modular reduction by m(x) guarantees the result will be a binary + * polynomial of less than degree 8, so that it can fit in a byte. + * + * The operation to multiply a binary polynomial b with x (the polynomial + * x in binary representation is 00000010) is: + * + * b_7x^8 + b_6x^7 + b_5x^6 + b_4x^5 + b_3x^4 + b_2x^3 + b_1x^2 + b_0x^1 + * + * To get GF(b, x) we must reduce that by m(x). If b_7 is 0 (that is the + * most significant bit is 0 in b) then the result is already reduced. If + * it is 1, then we can reduce it by subtracting m(x) via an XOR. + * + * It follows that multiplication by x (00000010 or 0x02) can be implemented + * by performing a left shift followed by a conditional bitwise XOR with + * 0x1b. This operation on bytes is denoted by xtime(). Multiplication by + * higher powers of x can be implemented by repeated application of xtime(). + * + * By adding intermediate results, multiplication by any constant can be + * implemented. For instance: + * + * GF(0x57, 0x13) = 0xfe because: + * + * xtime(b) = (b & 128) ? (b << 1 ^ 0x11b) : (b << 1) + * + * Note: We XOR with 0x11b instead of 0x1b because in javascript our + * datatype for b can be larger than 1 byte, so a left shift will not + * automatically eliminate bits that overflow a byte ... by XOR'ing the + * overflow bit with 1 (the extra one from 0x11b) we zero it out. + * + * GF(0x57, 0x02) = xtime(0x57) = 0xae + * GF(0x57, 0x04) = xtime(0xae) = 0x47 + * GF(0x57, 0x08) = xtime(0x47) = 0x8e + * GF(0x57, 0x10) = xtime(0x8e) = 0x07 + * + * GF(0x57, 0x13) = GF(0x57, (0x01 ^ 0x02 ^ 0x10)) + * + * And by the distributive property (since XOR is addition and GF() is + * multiplication): + * + * = GF(0x57, 0x01) ^ GF(0x57, 0x02) ^ GF(0x57, 0x10) + * = 0x57 ^ 0xae ^ 0x07 + * = 0xfe. + */ + +function initialize() { + init = true; + /* Populate the Rcon table. These are the values given by + [x^(i-1),{00},{00},{00}] where x^(i-1) are powers of x (and x = 0x02) + in the field of GF(2^8), where i starts at 1. + rcon[0] = [0x00, 0x00, 0x00, 0x00] + rcon[1] = [0x01, 0x00, 0x00, 0x00] 2^(1-1) = 2^0 = 1 + rcon[2] = [0x02, 0x00, 0x00, 0x00] 2^(2-1) = 2^1 = 2 + ... + rcon[9] = [0x1B, 0x00, 0x00, 0x00] 2^(9-1) = 2^8 = 0x1B + rcon[10] = [0x36, 0x00, 0x00, 0x00] 2^(10-1) = 2^9 = 0x36 + We only store the first byte because it is the only one used. + */ + + rcon = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1B, 0x36]; // compute xtime table which maps i onto GF(i, 0x02) + + var xtime = new Array(256); + + for (var i = 0; i < 128; ++i) { + xtime[i] = i << 1; + xtime[i + 128] = i + 128 << 1 ^ 0x11B; + } // compute all other tables + + + sbox = new Array(256); + isbox = new Array(256); + mix = new Array(4); + imix = new Array(4); + + for (var i = 0; i < 4; ++i) { + mix[i] = new Array(256); + imix[i] = new Array(256); + } + + var e = 0, + ei = 0, + e2, + e4, + e8, + sx, + sx2, + me, + ime; + + for (var i = 0; i < 256; ++i) { + /* We need to generate the SubBytes() sbox and isbox tables so that + we can perform byte substitutions. This requires us to traverse + all of the elements in GF, find their multiplicative inverses, + and apply to each the following affine transformation: + bi' = bi ^ b(i + 4) mod 8 ^ b(i + 5) mod 8 ^ b(i + 6) mod 8 ^ + b(i + 7) mod 8 ^ ci + for 0 <= i < 8, where bi is the ith bit of the byte, and ci is the + ith bit of a byte c with the value {63} or {01100011}. + It is possible to traverse every possible value in a Galois field + using what is referred to as a 'generator'. There are many + generators (128 out of 256): 3,5,6,9,11,82 to name a few. To fully + traverse GF we iterate 255 times, multiplying by our generator + each time. + On each iteration we can determine the multiplicative inverse for + the current element. + Suppose there is an element in GF 'e'. For a given generator 'g', + e = g^x. The multiplicative inverse of e is g^(255 - x). It turns + out that if use the inverse of a generator as another generator + it will produce all of the corresponding multiplicative inverses + at the same time. For this reason, we choose 5 as our inverse + generator because it only requires 2 multiplies and 1 add and its + inverse, 82, requires relatively few operations as well. + In order to apply the affine transformation, the multiplicative + inverse 'ei' of 'e' can be repeatedly XOR'd (4 times) with a + bit-cycling of 'ei'. To do this 'ei' is first stored in 's' and + 'x'. Then 's' is left shifted and the high bit of 's' is made the + low bit. The resulting value is stored in 's'. Then 'x' is XOR'd + with 's' and stored in 'x'. On each subsequent iteration the same + operation is performed. When 4 iterations are complete, 'x' is + XOR'd with 'c' (0x63) and the transformed value is stored in 'x'. + For example: + s = 01000001 + x = 01000001 + iteration 1: s = 10000010, x ^= s + iteration 2: s = 00000101, x ^= s + iteration 3: s = 00001010, x ^= s + iteration 4: s = 00010100, x ^= s + x ^= 0x63 + This can be done with a loop where s = (s << 1) | (s >> 7). However, + it can also be done by using a single 16-bit (in this case 32-bit) + number 'sx'. Since XOR is an associative operation, we can set 'sx' + to 'ei' and then XOR it with 'sx' left-shifted 1,2,3, and 4 times. + The most significant bits will flow into the high 8 bit positions + and be correctly XOR'd with one another. All that remains will be + to cycle the high 8 bits by XOR'ing them all with the lower 8 bits + afterwards. + At the same time we're populating sbox and isbox we can precompute + the multiplication we'll need to do to do MixColumns() later. + */ + // apply affine transformation + sx = ei ^ ei << 1 ^ ei << 2 ^ ei << 3 ^ ei << 4; + sx = sx >> 8 ^ sx & 255 ^ 0x63; // update tables + + sbox[e] = sx; + isbox[sx] = e; + /* Mixing columns is done using matrix multiplication. The columns + that are to be mixed are each a single word in the current state. + The state has Nb columns (4 columns). Therefore each column is a + 4 byte word. So to mix the columns in a single column 'c' where + its rows are r0, r1, r2, and r3, we use the following matrix + multiplication: + [2 3 1 1]*[r0,c]=[r'0,c] + [1 2 3 1] [r1,c] [r'1,c] + [1 1 2 3] [r2,c] [r'2,c] + [3 1 1 2] [r3,c] [r'3,c] + r0, r1, r2, and r3 are each 1 byte of one of the words in the + state (a column). To do matrix multiplication for each mixed + column c' we multiply the corresponding row from the left matrix + with the corresponding column from the right matrix. In total, we + get 4 equations: + r0,c' = 2*r0,c + 3*r1,c + 1*r2,c + 1*r3,c + r1,c' = 1*r0,c + 2*r1,c + 3*r2,c + 1*r3,c + r2,c' = 1*r0,c + 1*r1,c + 2*r2,c + 3*r3,c + r3,c' = 3*r0,c + 1*r1,c + 1*r2,c + 2*r3,c + As usual, the multiplication is as previously defined and the + addition is XOR. In order to optimize mixing columns we can store + the multiplication results in tables. If you think of the whole + column as a word (it might help to visualize by mentally rotating + the equations above by counterclockwise 90 degrees) then you can + see that it would be useful to map the multiplications performed on + each byte (r0, r1, r2, r3) onto a word as well. For instance, we + could map 2*r0,1*r0,1*r0,3*r0 onto a word by storing 2*r0 in the + highest 8 bits and 3*r0 in the lowest 8 bits (with the other two + respectively in the middle). This means that a table can be + constructed that uses r0 as an index to the word. We can do the + same with r1, r2, and r3, creating a total of 4 tables. + To construct a full c', we can just look up each byte of c in + their respective tables and XOR the results together. + Also, to build each table we only have to calculate the word + for 2,1,1,3 for every byte ... which we can do on each iteration + of this loop since we will iterate over every byte. After we have + calculated 2,1,1,3 we can get the results for the other tables + by cycling the byte at the end to the beginning. For instance + we can take the result of table 2,1,1,3 and produce table 3,2,1,1 + by moving the right most byte to the left most position just like + how you can imagine the 3 moved out of 2,1,1,3 and to the front + to produce 3,2,1,1. + There is another optimization in that the same multiples of + the current element we need in order to advance our generator + to the next iteration can be reused in performing the 2,1,1,3 + calculation. We also calculate the inverse mix column tables, + with e,9,d,b being the inverse of 2,1,1,3. + When we're done, and we need to actually mix columns, the first + byte of each state word should be put through mix[0] (2,1,1,3), + the second through mix[1] (3,2,1,1) and so forth. Then they should + be XOR'd together to produce the fully mixed column. + */ + // calculate mix and imix table values + + sx2 = xtime[sx]; + e2 = xtime[e]; + e4 = xtime[e2]; + e8 = xtime[e4]; + me = sx2 << 24 ^ // 2 + sx << 16 ^ // 1 + sx << 8 ^ ( // 1 + sx ^ sx2); // 3 + + ime = (e2 ^ e4 ^ e8) << 24 ^ // E (14) + (e ^ e8) << 16 ^ // 9 + (e ^ e4 ^ e8) << 8 ^ ( // D (13) + e ^ e2 ^ e8); // B (11) + // produce each of the mix tables by rotating the 2,1,1,3 value + + for (var n = 0; n < 4; ++n) { + mix[n][e] = me; + imix[n][sx] = ime; // cycle the right most byte to the left most position + // ie: 2,1,1,3 becomes 3,2,1,1 + + me = me << 24 | me >>> 8; + ime = ime << 24 | ime >>> 8; + } // get next element and inverse + + + if (e === 0) { + // 1 is the inverse of 1 + e = ei = 1; + } else { + // e = 2e + 2*2*2*(10e)) = multiply e by 82 (chosen generator) + // ei = ei + 2*2*ei = multiply ei by 5 (inverse generator) + e = e2 ^ xtime[xtime[xtime[e2 ^ e8]]]; + ei ^= xtime[xtime[ei]]; + } + } +} +/** + * Generates a key schedule using the AES key expansion algorithm. + * + * The AES algorithm takes the Cipher Key, K, and performs a Key Expansion + * routine to generate a key schedule. The Key Expansion generates a total + * of Nb*(Nr + 1) words: the algorithm requires an initial set of Nb words, + * and each of the Nr rounds requires Nb words of key data. The resulting + * key schedule consists of a linear array of 4-byte words, denoted [wi ], + * with i in the range 0 ≤ i < Nb(Nr + 1). + * + * KeyExpansion(byte key[4*Nk], word w[Nb*(Nr+1)], Nk) + * AES-128 (Nb=4, Nk=4, Nr=10) + * AES-192 (Nb=4, Nk=6, Nr=12) + * AES-256 (Nb=4, Nk=8, Nr=14) + * Note: Nr=Nk+6. + * + * Nb is the number of columns (32-bit words) comprising the State (or + * number of bytes in a block). For AES, Nb=4. + * + * @param key the key to schedule (as an array of 32-bit words). + * @param decrypt true to modify the key schedule to decrypt, false not to. + * + * @return the generated key schedule. + */ + + +function _expandKey(key, decrypt) { + // copy the key's words to initialize the key schedule + var w = key.slice(0); + /* RotWord() will rotate a word, moving the first byte to the last + byte's position (shifting the other bytes left). + We will be getting the value of Rcon at i / Nk. 'i' will iterate + from Nk to (Nb * Nr+1). Nk = 4 (4 byte key), Nb = 4 (4 words in + a block), Nr = Nk + 6 (10). Therefore 'i' will iterate from + 4 to 44 (exclusive). Each time we iterate 4 times, i / Nk will + increase by 1. We use a counter iNk to keep track of this. + */ + // go through the rounds expanding the key + + var temp, + iNk = 1; + var Nk = w.length; + var Nr1 = Nk + 6 + 1; + var end = Nb * Nr1; + + for (var i = Nk; i < end; ++i) { + temp = w[i - 1]; + + if (i % Nk === 0) { + // temp = SubWord(RotWord(temp)) ^ Rcon[i / Nk] + temp = sbox[temp >>> 16 & 255] << 24 ^ sbox[temp >>> 8 & 255] << 16 ^ sbox[temp & 255] << 8 ^ sbox[temp >>> 24] ^ rcon[iNk] << 24; + iNk++; + } else if (Nk > 6 && i % Nk === 4) { + // temp = SubWord(temp) + temp = sbox[temp >>> 24] << 24 ^ sbox[temp >>> 16 & 255] << 16 ^ sbox[temp >>> 8 & 255] << 8 ^ sbox[temp & 255]; + } + + w[i] = w[i - Nk] ^ temp; + } + /* When we are updating a cipher block we always use the code path for + encryption whether we are decrypting or not (to shorten code and + simplify the generation of look up tables). However, because there + are differences in the decryption algorithm, other than just swapping + in different look up tables, we must transform our key schedule to + account for these changes: + 1. The decryption algorithm gets its key rounds in reverse order. + 2. The decryption algorithm adds the round key before mixing columns + instead of afterwards. + We don't need to modify our key schedule to handle the first case, + we can just traverse the key schedule in reverse order when decrypting. + The second case requires a little work. + The tables we built for performing rounds will take an input and then + perform SubBytes() and MixColumns() or, for the decrypt version, + InvSubBytes() and InvMixColumns(). But the decrypt algorithm requires + us to AddRoundKey() before InvMixColumns(). This means we'll need to + apply some transformations to the round key to inverse-mix its columns + so they'll be correct for moving AddRoundKey() to after the state has + had its columns inverse-mixed. + To inverse-mix the columns of the state when we're decrypting we use a + lookup table that will apply InvSubBytes() and InvMixColumns() at the + same time. However, the round key's bytes are not inverse-substituted + in the decryption algorithm. To get around this problem, we can first + substitute the bytes in the round key so that when we apply the + transformation via the InvSubBytes()+InvMixColumns() table, it will + undo our substitution leaving us with the original value that we + want -- and then inverse-mix that value. + This change will correctly alter our key schedule so that we can XOR + each round key with our already transformed decryption state. This + allows us to use the same code path as the encryption algorithm. + We make one more change to the decryption key. Since the decryption + algorithm runs in reverse from the encryption algorithm, we reverse + the order of the round keys to avoid having to iterate over the key + schedule backwards when running the encryption algorithm later in + decryption mode. In addition to reversing the order of the round keys, + we also swap each round key's 2nd and 4th rows. See the comments + section where rounds are performed for more details about why this is + done. These changes are done inline with the other substitution + described above. + */ + + + if (decrypt) { + var tmp; + var m0 = imix[0]; + var m1 = imix[1]; + var m2 = imix[2]; + var m3 = imix[3]; + var wnew = w.slice(0); + end = w.length; + + for (var i = 0, wi = end - Nb; i < end; i += Nb, wi -= Nb) { + // do not sub the first or last round key (round keys are Nb + // words) as no column mixing is performed before they are added, + // but do change the key order + if (i === 0 || i === end - Nb) { + wnew[i] = w[wi]; + wnew[i + 1] = w[wi + 3]; + wnew[i + 2] = w[wi + 2]; + wnew[i + 3] = w[wi + 1]; + } else { + // substitute each round key byte because the inverse-mix + // table will inverse-substitute it (effectively cancel the + // substitution because round key bytes aren't sub'd in + // decryption mode) and swap indexes 3 and 1 + for (var n = 0; n < Nb; ++n) { + tmp = w[wi + n]; + wnew[i + (3 & -n)] = m0[sbox[tmp >>> 24]] ^ m1[sbox[tmp >>> 16 & 255]] ^ m2[sbox[tmp >>> 8 & 255]] ^ m3[sbox[tmp & 255]]; + } + } + } + + w = wnew; + } + + return w; +} +/** + * Updates a single block (16 bytes) using AES. The update will either + * encrypt or decrypt the block. + * + * @param w the key schedule. + * @param input the input block (an array of 32-bit words). + * @param output the updated output block. + * @param decrypt true to decrypt the block, false to encrypt it. + */ + + +function _updateBlock(w, input, output, decrypt) { + /* + Cipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)]) + begin + byte state[4,Nb] + state = in + AddRoundKey(state, w[0, Nb-1]) + for round = 1 step 1 to Nr–1 + SubBytes(state) + ShiftRows(state) + MixColumns(state) + AddRoundKey(state, w[round*Nb, (round+1)*Nb-1]) + end for + SubBytes(state) + ShiftRows(state) + AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1]) + out = state + end + InvCipher(byte in[4*Nb], byte out[4*Nb], word w[Nb*(Nr+1)]) + begin + byte state[4,Nb] + state = in + AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1]) + for round = Nr-1 step -1 downto 1 + InvShiftRows(state) + InvSubBytes(state) + AddRoundKey(state, w[round*Nb, (round+1)*Nb-1]) + InvMixColumns(state) + end for + InvShiftRows(state) + InvSubBytes(state) + AddRoundKey(state, w[0, Nb-1]) + out = state + end + */ + // Encrypt: AddRoundKey(state, w[0, Nb-1]) + // Decrypt: AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1]) + var Nr = w.length / 4 - 1; + var m0, m1, m2, m3, sub; + + if (decrypt) { + m0 = imix[0]; + m1 = imix[1]; + m2 = imix[2]; + m3 = imix[3]; + sub = isbox; + } else { + m0 = mix[0]; + m1 = mix[1]; + m2 = mix[2]; + m3 = mix[3]; + sub = sbox; + } + + var a, b, c, d, a2, b2, c2; + a = input[0] ^ w[0]; + b = input[decrypt ? 3 : 1] ^ w[1]; + c = input[2] ^ w[2]; + d = input[decrypt ? 1 : 3] ^ w[3]; + var i = 3; + /* In order to share code we follow the encryption algorithm when both + encrypting and decrypting. To account for the changes required in the + decryption algorithm, we use different lookup tables when decrypting + and use a modified key schedule to account for the difference in the + order of transformations applied when performing rounds. We also get + key rounds in reverse order (relative to encryption). */ + + for (var round = 1; round < Nr; ++round) { + /* As described above, we'll be using table lookups to perform the + column mixing. Each column is stored as a word in the state (the + array 'input' has one column as a word at each index). In order to + mix a column, we perform these transformations on each row in c, + which is 1 byte in each word. The new column for c0 is c'0: + m0 m1 m2 m3 + r0,c'0 = 2*r0,c0 + 3*r1,c0 + 1*r2,c0 + 1*r3,c0 + r1,c'0 = 1*r0,c0 + 2*r1,c0 + 3*r2,c0 + 1*r3,c0 + r2,c'0 = 1*r0,c0 + 1*r1,c0 + 2*r2,c0 + 3*r3,c0 + r3,c'0 = 3*r0,c0 + 1*r1,c0 + 1*r2,c0 + 2*r3,c0 + So using mix tables where c0 is a word with r0 being its upper + 8 bits and r3 being its lower 8 bits: + m0[c0 >> 24] will yield this word: [2*r0,1*r0,1*r0,3*r0] + ... + m3[c0 & 255] will yield this word: [1*r3,1*r3,3*r3,2*r3] + Therefore to mix the columns in each word in the state we + do the following (& 255 omitted for brevity): + c'0,r0 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3] + c'0,r1 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3] + c'0,r2 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3] + c'0,r3 = m0[c0 >> 24] ^ m1[c1 >> 16] ^ m2[c2 >> 8] ^ m3[c3] + However, before mixing, the algorithm requires us to perform + ShiftRows(). The ShiftRows() transformation cyclically shifts the + last 3 rows of the state over different offsets. The first row + (r = 0) is not shifted. + s'_r,c = s_r,(c + shift(r, Nb) mod Nb + for 0 < r < 4 and 0 <= c < Nb and + shift(1, 4) = 1 + shift(2, 4) = 2 + shift(3, 4) = 3. + This causes the first byte in r = 1 to be moved to the end of + the row, the first 2 bytes in r = 2 to be moved to the end of + the row, the first 3 bytes in r = 3 to be moved to the end of + the row: + r1: [c0 c1 c2 c3] => [c1 c2 c3 c0] + r2: [c0 c1 c2 c3] [c2 c3 c0 c1] + r3: [c0 c1 c2 c3] [c3 c0 c1 c2] + We can make these substitutions inline with our column mixing to + generate an updated set of equations to produce each word in the + state (note the columns have changed positions): + c0 c1 c2 c3 => c0 c1 c2 c3 + c0 c1 c2 c3 c1 c2 c3 c0 (cycled 1 byte) + c0 c1 c2 c3 c2 c3 c0 c1 (cycled 2 bytes) + c0 c1 c2 c3 c3 c0 c1 c2 (cycled 3 bytes) + Therefore: + c'0 = 2*r0,c0 + 3*r1,c1 + 1*r2,c2 + 1*r3,c3 + c'0 = 1*r0,c0 + 2*r1,c1 + 3*r2,c2 + 1*r3,c3 + c'0 = 1*r0,c0 + 1*r1,c1 + 2*r2,c2 + 3*r3,c3 + c'0 = 3*r0,c0 + 1*r1,c1 + 1*r2,c2 + 2*r3,c3 + c'1 = 2*r0,c1 + 3*r1,c2 + 1*r2,c3 + 1*r3,c0 + c'1 = 1*r0,c1 + 2*r1,c2 + 3*r2,c3 + 1*r3,c0 + c'1 = 1*r0,c1 + 1*r1,c2 + 2*r2,c3 + 3*r3,c0 + c'1 = 3*r0,c1 + 1*r1,c2 + 1*r2,c3 + 2*r3,c0 + ... and so forth for c'2 and c'3. The important distinction is + that the columns are cycling, with c0 being used with the m0 + map when calculating c0, but c1 being used with the m0 map when + calculating c1 ... and so forth. + When performing the inverse we transform the mirror image and + skip the bottom row, instead of the top one, and move upwards: + c3 c2 c1 c0 => c0 c3 c2 c1 (cycled 3 bytes) *same as encryption + c3 c2 c1 c0 c1 c0 c3 c2 (cycled 2 bytes) + c3 c2 c1 c0 c2 c1 c0 c3 (cycled 1 byte) *same as encryption + c3 c2 c1 c0 c3 c2 c1 c0 + If you compare the resulting matrices for ShiftRows()+MixColumns() + and for InvShiftRows()+InvMixColumns() the 2nd and 4th columns are + different (in encrypt mode vs. decrypt mode). So in order to use + the same code to handle both encryption and decryption, we will + need to do some mapping. + If in encryption mode we let a=c0, b=c1, c=c2, d=c3, and r be + a row number in the state, then the resulting matrix in encryption + mode for applying the above transformations would be: + r1: a b c d + r2: b c d a + r3: c d a b + r4: d a b c + If we did the same in decryption mode we would get: + r1: a d c b + r2: b a d c + r3: c b a d + r4: d c b a + If instead we swap d and b (set b=c3 and d=c1), then we get: + r1: a b c d + r2: d a b c + r3: c d a b + r4: b c d a + Now the 1st and 3rd rows are the same as the encryption matrix. All + we need to do then to make the mapping exactly the same is to swap + the 2nd and 4th rows when in decryption mode. To do this without + having to do it on each iteration, we swapped the 2nd and 4th rows + in the decryption key schedule. We also have to do the swap above + when we first pull in the input and when we set the final output. */ + a2 = m0[a >>> 24] ^ m1[b >>> 16 & 255] ^ m2[c >>> 8 & 255] ^ m3[d & 255] ^ w[++i]; + b2 = m0[b >>> 24] ^ m1[c >>> 16 & 255] ^ m2[d >>> 8 & 255] ^ m3[a & 255] ^ w[++i]; + c2 = m0[c >>> 24] ^ m1[d >>> 16 & 255] ^ m2[a >>> 8 & 255] ^ m3[b & 255] ^ w[++i]; + d = m0[d >>> 24] ^ m1[a >>> 16 & 255] ^ m2[b >>> 8 & 255] ^ m3[c & 255] ^ w[++i]; + a = a2; + b = b2; + c = c2; + } + /* + Encrypt: + SubBytes(state) + ShiftRows(state) + AddRoundKey(state, w[Nr*Nb, (Nr+1)*Nb-1]) + Decrypt: + InvShiftRows(state) + InvSubBytes(state) + AddRoundKey(state, w[0, Nb-1]) + */ + // Note: rows are shifted inline + + + output[0] = sub[a >>> 24] << 24 ^ sub[b >>> 16 & 255] << 16 ^ sub[c >>> 8 & 255] << 8 ^ sub[d & 255] ^ w[++i]; + output[decrypt ? 3 : 1] = sub[b >>> 24] << 24 ^ sub[c >>> 16 & 255] << 16 ^ sub[d >>> 8 & 255] << 8 ^ sub[a & 255] ^ w[++i]; + output[2] = sub[c >>> 24] << 24 ^ sub[d >>> 16 & 255] << 16 ^ sub[a >>> 8 & 255] << 8 ^ sub[b & 255] ^ w[++i]; + output[decrypt ? 1 : 3] = sub[d >>> 24] << 24 ^ sub[a >>> 16 & 255] << 16 ^ sub[b >>> 8 & 255] << 8 ^ sub[c & 255] ^ w[++i]; +} +/** + * Deprecated. Instead, use: + * + * forge.cipher.createCipher('AES-', key); + * forge.cipher.createDecipher('AES-', key); + * + * Creates a deprecated AES cipher object. This object's mode will default to + * CBC (cipher-block-chaining). + * + * The key and iv may be given as a string of bytes, an array of bytes, a + * byte buffer, or an array of 32-bit words. + * + * @param options the options to use. + * key the symmetric key to use. + * output the buffer to write to. + * decrypt true for decryption, false for encryption. + * mode the cipher mode to use (default: 'CBC'). + * + * @return the cipher. + */ + + +function _createCipher(options) { + options = options || {}; + var mode = (options.mode || 'CBC').toUpperCase(); + var algorithm = 'AES-' + mode; + var cipher; + + if (options.decrypt) { + cipher = forge.cipher.createDecipher(algorithm, options.key); + } else { + cipher = forge.cipher.createCipher(algorithm, options.key); + } // backwards compatible start API + + + var start = cipher.start; + + cipher.start = function (iv, options) { + // backwards compatibility: support second arg as output buffer + var output = null; + + if (options instanceof forge.util.ByteBuffer) { + output = options; + options = {}; + } + + options = options || {}; + options.output = output; + options.iv = iv; + start.call(cipher, options); + }; + + return cipher; +} + +/***/ }), +/* 109 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Cipher base API. + * + * @author Dave Longley + * + * Copyright (c) 2010-2014 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +__webpack_require__(9); + +module.exports = forge.cipher = forge.cipher || {}; // registered algorithms + +forge.cipher.algorithms = forge.cipher.algorithms || {}; +/** + * Creates a cipher object that can be used to encrypt data using the given + * algorithm and key. The algorithm may be provided as a string value for a + * previously registered algorithm or it may be given as a cipher algorithm + * API object. + * + * @param algorithm the algorithm to use, either a string or an algorithm API + * object. + * @param key the key to use, as a binary-encoded string of bytes or a + * byte buffer. + * + * @return the cipher. + */ + +forge.cipher.createCipher = function (algorithm, key) { + var api = algorithm; + + if (typeof api === 'string') { + api = forge.cipher.getAlgorithm(api); + + if (api) { + api = api(); + } + } + + if (!api) { + throw new Error('Unsupported algorithm: ' + algorithm); + } // assume block cipher + + + return new forge.cipher.BlockCipher({ + algorithm: api, + key: key, + decrypt: false + }); +}; +/** + * Creates a decipher object that can be used to decrypt data using the given + * algorithm and key. The algorithm may be provided as a string value for a + * previously registered algorithm or it may be given as a cipher algorithm + * API object. + * + * @param algorithm the algorithm to use, either a string or an algorithm API + * object. + * @param key the key to use, as a binary-encoded string of bytes or a + * byte buffer. + * + * @return the cipher. + */ + + +forge.cipher.createDecipher = function (algorithm, key) { + var api = algorithm; + + if (typeof api === 'string') { + api = forge.cipher.getAlgorithm(api); + + if (api) { + api = api(); + } + } + + if (!api) { + throw new Error('Unsupported algorithm: ' + algorithm); + } // assume block cipher + + + return new forge.cipher.BlockCipher({ + algorithm: api, + key: key, + decrypt: true + }); +}; +/** + * Registers an algorithm by name. If the name was already registered, the + * algorithm API object will be overwritten. + * + * @param name the name of the algorithm. + * @param algorithm the algorithm API object. + */ + + +forge.cipher.registerAlgorithm = function (name, algorithm) { + name = name.toUpperCase(); + forge.cipher.algorithms[name] = algorithm; +}; +/** + * Gets a registered algorithm by name. + * + * @param name the name of the algorithm. + * + * @return the algorithm, if found, null if not. + */ + + +forge.cipher.getAlgorithm = function (name) { + name = name.toUpperCase(); + + if (name in forge.cipher.algorithms) { + return forge.cipher.algorithms[name]; + } + + return null; +}; + +var BlockCipher = forge.cipher.BlockCipher = function (options) { + this.algorithm = options.algorithm; + this.mode = this.algorithm.mode; + this.blockSize = this.mode.blockSize; + this._finish = false; + this._input = null; + this.output = null; + this._op = options.decrypt ? this.mode.decrypt : this.mode.encrypt; + this._decrypt = options.decrypt; + this.algorithm.initialize(options); +}; +/** + * Starts or restarts the encryption or decryption process, whichever + * was previously configured. + * + * For non-GCM mode, the IV may be a binary-encoded string of bytes, an array + * of bytes, a byte buffer, or an array of 32-bit integers. If the IV is in + * bytes, then it must be Nb (16) bytes in length. If the IV is given in as + * 32-bit integers, then it must be 4 integers long. + * + * Note: an IV is not required or used in ECB mode. + * + * For GCM-mode, the IV must be given as a binary-encoded string of bytes or + * a byte buffer. The number of bytes should be 12 (96 bits) as recommended + * by NIST SP-800-38D but another length may be given. + * + * @param options the options to use: + * iv the initialization vector to use as a binary-encoded string of + * bytes, null to reuse the last ciphered block from a previous + * update() (this "residue" method is for legacy support only). + * additionalData additional authentication data as a binary-encoded + * string of bytes, for 'GCM' mode, (default: none). + * tagLength desired length of authentication tag, in bits, for + * 'GCM' mode (0-128, default: 128). + * tag the authentication tag to check if decrypting, as a + * binary-encoded string of bytes. + * output the output the buffer to write to, null to create one. + */ + + +BlockCipher.prototype.start = function (options) { + options = options || {}; + var opts = {}; + + for (var key in options) { + opts[key] = options[key]; + } + + opts.decrypt = this._decrypt; + this._finish = false; + this._input = forge.util.createBuffer(); + this.output = options.output || forge.util.createBuffer(); + this.mode.start(opts); +}; +/** + * Updates the next block according to the cipher mode. + * + * @param input the buffer to read from. + */ + + +BlockCipher.prototype.update = function (input) { + if (input) { + // input given, so empty it into the input buffer + this._input.putBuffer(input); + } // do cipher operation until it needs more input and not finished + + + while (!this._op.call(this.mode, this._input, this.output, this._finish) && !this._finish) {} // free consumed memory from input buffer + + + this._input.compact(); +}; +/** + * Finishes encrypting or decrypting. + * + * @param pad a padding function to use in CBC mode, null for default, + * signature(blockSize, buffer, decrypt). + * + * @return true if successful, false on error. + */ + + +BlockCipher.prototype.finish = function (pad) { + // backwards-compatibility w/deprecated padding API + // Note: will overwrite padding functions even after another start() call + if (pad && (this.mode.name === 'ECB' || this.mode.name === 'CBC')) { + this.mode.pad = function (input) { + return pad(this.blockSize, input, false); + }; + + this.mode.unpad = function (output) { + return pad(this.blockSize, output, true); + }; + } // build options for padding and afterFinish functions + + + var options = {}; + options.decrypt = this._decrypt; // get # of bytes that won't fill a block + + options.overflow = this._input.length() % this.blockSize; + + if (!this._decrypt && this.mode.pad) { + if (!this.mode.pad(this._input, options)) { + return false; + } + } // do final update + + + this._finish = true; + this.update(); + + if (this._decrypt && this.mode.unpad) { + if (!this.mode.unpad(this.output, options)) { + return false; + } + } + + if (this.mode.afterFinish) { + if (!this.mode.afterFinish(this.output, options)) { + return false; + } + } + + return true; +}; + +/***/ }), +/* 110 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Supported cipher modes. + * + * @author Dave Longley + * + * Copyright (c) 2010-2014 Digital Bazaar, Inc. + */ +var forge = __webpack_require__(8); + +__webpack_require__(9); + +forge.cipher = forge.cipher || {}; // supported cipher modes + +var modes = module.exports = forge.cipher.modes = forge.cipher.modes || {}; +/** Electronic codebook (ECB) (Don't use this; it's not secure) **/ + +modes.ecb = function (options) { + options = options || {}; + this.name = 'ECB'; + this.cipher = options.cipher; + this.blockSize = options.blockSize || 16; + this._ints = this.blockSize / 4; + this._inBlock = new Array(this._ints); + this._outBlock = new Array(this._ints); +}; + +modes.ecb.prototype.start = function (options) {}; + +modes.ecb.prototype.encrypt = function (input, output, finish) { + // not enough input to encrypt + if (input.length() < this.blockSize && !(finish && input.length() > 0)) { + return true; + } // get next block + + + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = input.getInt32(); + } // encrypt block + + + this.cipher.encrypt(this._inBlock, this._outBlock); // write output + + for (var i = 0; i < this._ints; ++i) { + output.putInt32(this._outBlock[i]); + } +}; + +modes.ecb.prototype.decrypt = function (input, output, finish) { + // not enough input to decrypt + if (input.length() < this.blockSize && !(finish && input.length() > 0)) { + return true; + } // get next block + + + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = input.getInt32(); + } // decrypt block + + + this.cipher.decrypt(this._inBlock, this._outBlock); // write output + + for (var i = 0; i < this._ints; ++i) { + output.putInt32(this._outBlock[i]); + } +}; + +modes.ecb.prototype.pad = function (input, options) { + // add PKCS#7 padding to block (each pad byte is the + // value of the number of pad bytes) + var padding = input.length() === this.blockSize ? this.blockSize : this.blockSize - input.length(); + input.fillWithByte(padding, padding); + return true; +}; + +modes.ecb.prototype.unpad = function (output, options) { + // check for error: input data not a multiple of blockSize + if (options.overflow > 0) { + return false; + } // ensure padding byte count is valid + + + var len = output.length(); + var count = output.at(len - 1); + + if (count > this.blockSize << 2) { + return false; + } // trim off padding bytes + + + output.truncate(count); + return true; +}; +/** Cipher-block Chaining (CBC) **/ + + +modes.cbc = function (options) { + options = options || {}; + this.name = 'CBC'; + this.cipher = options.cipher; + this.blockSize = options.blockSize || 16; + this._ints = this.blockSize / 4; + this._inBlock = new Array(this._ints); + this._outBlock = new Array(this._ints); +}; + +modes.cbc.prototype.start = function (options) { + // Note: legacy support for using IV residue (has security flaws) + // if IV is null, reuse block from previous processing + if (options.iv === null) { + // must have a previous block + if (!this._prev) { + throw new Error('Invalid IV parameter.'); + } + + this._iv = this._prev.slice(0); + } else if (!('iv' in options)) { + throw new Error('Invalid IV parameter.'); + } else { + // save IV as "previous" block + this._iv = transformIV(options.iv); + this._prev = this._iv.slice(0); + } +}; + +modes.cbc.prototype.encrypt = function (input, output, finish) { + // not enough input to encrypt + if (input.length() < this.blockSize && !(finish && input.length() > 0)) { + return true; + } // get next block + // CBC XOR's IV (or previous block) with plaintext + + + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = this._prev[i] ^ input.getInt32(); + } // encrypt block + + + this.cipher.encrypt(this._inBlock, this._outBlock); // write output, save previous block + + for (var i = 0; i < this._ints; ++i) { + output.putInt32(this._outBlock[i]); + } + + this._prev = this._outBlock; +}; + +modes.cbc.prototype.decrypt = function (input, output, finish) { + // not enough input to decrypt + if (input.length() < this.blockSize && !(finish && input.length() > 0)) { + return true; + } // get next block + + + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = input.getInt32(); + } // decrypt block + + + this.cipher.decrypt(this._inBlock, this._outBlock); // write output, save previous ciphered block + // CBC XOR's IV (or previous block) with ciphertext + + for (var i = 0; i < this._ints; ++i) { + output.putInt32(this._prev[i] ^ this._outBlock[i]); + } + + this._prev = this._inBlock.slice(0); +}; + +modes.cbc.prototype.pad = function (input, options) { + // add PKCS#7 padding to block (each pad byte is the + // value of the number of pad bytes) + var padding = input.length() === this.blockSize ? this.blockSize : this.blockSize - input.length(); + input.fillWithByte(padding, padding); + return true; +}; + +modes.cbc.prototype.unpad = function (output, options) { + // check for error: input data not a multiple of blockSize + if (options.overflow > 0) { + return false; + } // ensure padding byte count is valid + + + var len = output.length(); + var count = output.at(len - 1); + + if (count > this.blockSize << 2) { + return false; + } // trim off padding bytes + + + output.truncate(count); + return true; +}; +/** Cipher feedback (CFB) **/ + + +modes.cfb = function (options) { + options = options || {}; + this.name = 'CFB'; + this.cipher = options.cipher; + this.blockSize = options.blockSize || 16; + this._ints = this.blockSize / 4; + this._inBlock = null; + this._outBlock = new Array(this._ints); + this._partialBlock = new Array(this._ints); + this._partialOutput = forge.util.createBuffer(); + this._partialBytes = 0; +}; + +modes.cfb.prototype.start = function (options) { + if (!('iv' in options)) { + throw new Error('Invalid IV parameter.'); + } // use IV as first input + + + this._iv = transformIV(options.iv); + this._inBlock = this._iv.slice(0); + this._partialBytes = 0; +}; + +modes.cfb.prototype.encrypt = function (input, output, finish) { + // not enough input to encrypt + var inputLength = input.length(); + + if (inputLength === 0) { + return true; + } // encrypt block + + + this.cipher.encrypt(this._inBlock, this._outBlock); // handle full block + + if (this._partialBytes === 0 && inputLength >= this.blockSize) { + // XOR input with output, write input as output + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = input.getInt32() ^ this._outBlock[i]; + output.putInt32(this._inBlock[i]); + } + + return; + } // handle partial block + + + var partialBytes = (this.blockSize - inputLength) % this.blockSize; + + if (partialBytes > 0) { + partialBytes = this.blockSize - partialBytes; + } // XOR input with output, write input as partial output + + + this._partialOutput.clear(); + + for (var i = 0; i < this._ints; ++i) { + this._partialBlock[i] = input.getInt32() ^ this._outBlock[i]; + + this._partialOutput.putInt32(this._partialBlock[i]); + } + + if (partialBytes > 0) { + // block still incomplete, restore input buffer + input.read -= this.blockSize; + } else { + // block complete, update input block + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = this._partialBlock[i]; + } + } // skip any previous partial bytes + + + if (this._partialBytes > 0) { + this._partialOutput.getBytes(this._partialBytes); + } + + if (partialBytes > 0 && !finish) { + output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes)); + this._partialBytes = partialBytes; + return true; + } + + output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes)); + this._partialBytes = 0; +}; + +modes.cfb.prototype.decrypt = function (input, output, finish) { + // not enough input to decrypt + var inputLength = input.length(); + + if (inputLength === 0) { + return true; + } // encrypt block (CFB always uses encryption mode) + + + this.cipher.encrypt(this._inBlock, this._outBlock); // handle full block + + if (this._partialBytes === 0 && inputLength >= this.blockSize) { + // XOR input with output, write input as output + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = input.getInt32(); + output.putInt32(this._inBlock[i] ^ this._outBlock[i]); + } + + return; + } // handle partial block + + + var partialBytes = (this.blockSize - inputLength) % this.blockSize; + + if (partialBytes > 0) { + partialBytes = this.blockSize - partialBytes; + } // XOR input with output, write input as partial output + + + this._partialOutput.clear(); + + for (var i = 0; i < this._ints; ++i) { + this._partialBlock[i] = input.getInt32(); + + this._partialOutput.putInt32(this._partialBlock[i] ^ this._outBlock[i]); + } + + if (partialBytes > 0) { + // block still incomplete, restore input buffer + input.read -= this.blockSize; + } else { + // block complete, update input block + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = this._partialBlock[i]; + } + } // skip any previous partial bytes + + + if (this._partialBytes > 0) { + this._partialOutput.getBytes(this._partialBytes); + } + + if (partialBytes > 0 && !finish) { + output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes)); + this._partialBytes = partialBytes; + return true; + } + + output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes)); + this._partialBytes = 0; +}; +/** Output feedback (OFB) **/ + + +modes.ofb = function (options) { + options = options || {}; + this.name = 'OFB'; + this.cipher = options.cipher; + this.blockSize = options.blockSize || 16; + this._ints = this.blockSize / 4; + this._inBlock = null; + this._outBlock = new Array(this._ints); + this._partialOutput = forge.util.createBuffer(); + this._partialBytes = 0; +}; + +modes.ofb.prototype.start = function (options) { + if (!('iv' in options)) { + throw new Error('Invalid IV parameter.'); + } // use IV as first input + + + this._iv = transformIV(options.iv); + this._inBlock = this._iv.slice(0); + this._partialBytes = 0; +}; + +modes.ofb.prototype.encrypt = function (input, output, finish) { + // not enough input to encrypt + var inputLength = input.length(); + + if (input.length() === 0) { + return true; + } // encrypt block (OFB always uses encryption mode) + + + this.cipher.encrypt(this._inBlock, this._outBlock); // handle full block + + if (this._partialBytes === 0 && inputLength >= this.blockSize) { + // XOR input with output and update next input + for (var i = 0; i < this._ints; ++i) { + output.putInt32(input.getInt32() ^ this._outBlock[i]); + this._inBlock[i] = this._outBlock[i]; + } + + return; + } // handle partial block + + + var partialBytes = (this.blockSize - inputLength) % this.blockSize; + + if (partialBytes > 0) { + partialBytes = this.blockSize - partialBytes; + } // XOR input with output + + + this._partialOutput.clear(); + + for (var i = 0; i < this._ints; ++i) { + this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]); + } + + if (partialBytes > 0) { + // block still incomplete, restore input buffer + input.read -= this.blockSize; + } else { + // block complete, update input block + for (var i = 0; i < this._ints; ++i) { + this._inBlock[i] = this._outBlock[i]; + } + } // skip any previous partial bytes + + + if (this._partialBytes > 0) { + this._partialOutput.getBytes(this._partialBytes); + } + + if (partialBytes > 0 && !finish) { + output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes)); + this._partialBytes = partialBytes; + return true; + } + + output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes)); + this._partialBytes = 0; +}; + +modes.ofb.prototype.decrypt = modes.ofb.prototype.encrypt; +/** Counter (CTR) **/ + +modes.ctr = function (options) { + options = options || {}; + this.name = 'CTR'; + this.cipher = options.cipher; + this.blockSize = options.blockSize || 16; + this._ints = this.blockSize / 4; + this._inBlock = null; + this._outBlock = new Array(this._ints); + this._partialOutput = forge.util.createBuffer(); + this._partialBytes = 0; +}; + +modes.ctr.prototype.start = function (options) { + if (!('iv' in options)) { + throw new Error('Invalid IV parameter.'); + } // use IV as first input + + + this._iv = transformIV(options.iv); + this._inBlock = this._iv.slice(0); + this._partialBytes = 0; +}; + +modes.ctr.prototype.encrypt = function (input, output, finish) { + // not enough input to encrypt + var inputLength = input.length(); + + if (inputLength === 0) { + return true; + } // encrypt block (CTR always uses encryption mode) + + + this.cipher.encrypt(this._inBlock, this._outBlock); // handle full block + + if (this._partialBytes === 0 && inputLength >= this.blockSize) { + // XOR input with output + for (var i = 0; i < this._ints; ++i) { + output.putInt32(input.getInt32() ^ this._outBlock[i]); + } + } else { + // handle partial block + var partialBytes = (this.blockSize - inputLength) % this.blockSize; + + if (partialBytes > 0) { + partialBytes = this.blockSize - partialBytes; + } // XOR input with output + + + this._partialOutput.clear(); + + for (var i = 0; i < this._ints; ++i) { + this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]); + } + + if (partialBytes > 0) { + // block still incomplete, restore input buffer + input.read -= this.blockSize; + } // skip any previous partial bytes + + + if (this._partialBytes > 0) { + this._partialOutput.getBytes(this._partialBytes); + } + + if (partialBytes > 0 && !finish) { + output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes)); + this._partialBytes = partialBytes; + return true; + } + + output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes)); + this._partialBytes = 0; + } // block complete, increment counter (input block) + + + inc32(this._inBlock); +}; + +modes.ctr.prototype.decrypt = modes.ctr.prototype.encrypt; +/** Galois/Counter Mode (GCM) **/ + +modes.gcm = function (options) { + options = options || {}; + this.name = 'GCM'; + this.cipher = options.cipher; + this.blockSize = options.blockSize || 16; + this._ints = this.blockSize / 4; + this._inBlock = new Array(this._ints); + this._outBlock = new Array(this._ints); + this._partialOutput = forge.util.createBuffer(); + this._partialBytes = 0; // R is actually this value concatenated with 120 more zero bits, but + // we only XOR against R so the other zeros have no effect -- we just + // apply this value to the first integer in a block + + this._R = 0xE1000000; +}; + +modes.gcm.prototype.start = function (options) { + if (!('iv' in options)) { + throw new Error('Invalid IV parameter.'); + } // ensure IV is a byte buffer + + + var iv = forge.util.createBuffer(options.iv); // no ciphered data processed yet + + this._cipherLength = 0; // default additional data is none + + var additionalData; + + if ('additionalData' in options) { + additionalData = forge.util.createBuffer(options.additionalData); + } else { + additionalData = forge.util.createBuffer(); + } // default tag length is 128 bits + + + if ('tagLength' in options) { + this._tagLength = options.tagLength; + } else { + this._tagLength = 128; + } // if tag is given, ensure tag matches tag length + + + this._tag = null; + + if (options.decrypt) { + // save tag to check later + this._tag = forge.util.createBuffer(options.tag).getBytes(); + + if (this._tag.length !== this._tagLength / 8) { + throw new Error('Authentication tag does not match tag length.'); + } + } // create tmp storage for hash calculation + + + this._hashBlock = new Array(this._ints); // no tag generated yet + + this.tag = null; // generate hash subkey + // (apply block cipher to "zero" block) + + this._hashSubkey = new Array(this._ints); + this.cipher.encrypt([0, 0, 0, 0], this._hashSubkey); // generate table M + // use 4-bit tables (32 component decomposition of a 16 byte value) + // 8-bit tables take more space and are known to have security + // vulnerabilities (in native implementations) + + this.componentBits = 4; + this._m = this.generateHashTable(this._hashSubkey, this.componentBits); // Note: support IV length different from 96 bits? (only supporting + // 96 bits is recommended by NIST SP-800-38D) + // generate J_0 + + var ivLength = iv.length(); + + if (ivLength === 12) { + // 96-bit IV + this._j0 = [iv.getInt32(), iv.getInt32(), iv.getInt32(), 1]; + } else { + // IV is NOT 96-bits + this._j0 = [0, 0, 0, 0]; + + while (iv.length() > 0) { + this._j0 = this.ghash(this._hashSubkey, this._j0, [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]); + } + + this._j0 = this.ghash(this._hashSubkey, this._j0, [0, 0].concat(from64To32(ivLength * 8))); + } // generate ICB (initial counter block) + + + this._inBlock = this._j0.slice(0); + inc32(this._inBlock); + this._partialBytes = 0; // consume authentication data + + additionalData = forge.util.createBuffer(additionalData); // save additional data length as a BE 64-bit number + + this._aDataLength = from64To32(additionalData.length() * 8); // pad additional data to 128 bit (16 byte) block size + + var overflow = additionalData.length() % this.blockSize; + + if (overflow) { + additionalData.fillWithByte(0, this.blockSize - overflow); + } + + this._s = [0, 0, 0, 0]; + + while (additionalData.length() > 0) { + this._s = this.ghash(this._hashSubkey, this._s, [additionalData.getInt32(), additionalData.getInt32(), additionalData.getInt32(), additionalData.getInt32()]); + } +}; + +modes.gcm.prototype.encrypt = function (input, output, finish) { + // not enough input to encrypt + var inputLength = input.length(); + + if (inputLength === 0) { + return true; + } // encrypt block + + + this.cipher.encrypt(this._inBlock, this._outBlock); // handle full block + + if (this._partialBytes === 0 && inputLength >= this.blockSize) { + // XOR input with output + for (var i = 0; i < this._ints; ++i) { + output.putInt32(this._outBlock[i] ^= input.getInt32()); + } + + this._cipherLength += this.blockSize; + } else { + // handle partial block + var partialBytes = (this.blockSize - inputLength) % this.blockSize; + + if (partialBytes > 0) { + partialBytes = this.blockSize - partialBytes; + } // XOR input with output + + + this._partialOutput.clear(); + + for (var i = 0; i < this._ints; ++i) { + this._partialOutput.putInt32(input.getInt32() ^ this._outBlock[i]); + } + + if (partialBytes === 0 || finish) { + // handle overflow prior to hashing + if (finish) { + // get block overflow + var overflow = inputLength % this.blockSize; + this._cipherLength += overflow; // truncate for hash function + + this._partialOutput.truncate(this.blockSize - overflow); + } else { + this._cipherLength += this.blockSize; + } // get output block for hashing + + + for (var i = 0; i < this._ints; ++i) { + this._outBlock[i] = this._partialOutput.getInt32(); + } + + this._partialOutput.read -= this.blockSize; + } // skip any previous partial bytes + + + if (this._partialBytes > 0) { + this._partialOutput.getBytes(this._partialBytes); + } + + if (partialBytes > 0 && !finish) { + // block still incomplete, restore input buffer, get partial output, + // and return early + input.read -= this.blockSize; + output.putBytes(this._partialOutput.getBytes(partialBytes - this._partialBytes)); + this._partialBytes = partialBytes; + return true; + } + + output.putBytes(this._partialOutput.getBytes(inputLength - this._partialBytes)); + this._partialBytes = 0; + } // update hash block S + + + this._s = this.ghash(this._hashSubkey, this._s, this._outBlock); // increment counter (input block) + + inc32(this._inBlock); +}; + +modes.gcm.prototype.decrypt = function (input, output, finish) { + // not enough input to decrypt + var inputLength = input.length(); + + if (inputLength < this.blockSize && !(finish && inputLength > 0)) { + return true; + } // encrypt block (GCM always uses encryption mode) + + + this.cipher.encrypt(this._inBlock, this._outBlock); // increment counter (input block) + + inc32(this._inBlock); // update hash block S + + this._hashBlock[0] = input.getInt32(); + this._hashBlock[1] = input.getInt32(); + this._hashBlock[2] = input.getInt32(); + this._hashBlock[3] = input.getInt32(); + this._s = this.ghash(this._hashSubkey, this._s, this._hashBlock); // XOR hash input with output + + for (var i = 0; i < this._ints; ++i) { + output.putInt32(this._outBlock[i] ^ this._hashBlock[i]); + } // increment cipher data length + + + if (inputLength < this.blockSize) { + this._cipherLength += inputLength % this.blockSize; + } else { + this._cipherLength += this.blockSize; + } +}; + +modes.gcm.prototype.afterFinish = function (output, options) { + var rval = true; // handle overflow + + if (options.decrypt && options.overflow) { + output.truncate(this.blockSize - options.overflow); + } // handle authentication tag + + + this.tag = forge.util.createBuffer(); // concatenate additional data length with cipher length + + var lengths = this._aDataLength.concat(from64To32(this._cipherLength * 8)); // include lengths in hash + + + this._s = this.ghash(this._hashSubkey, this._s, lengths); // do GCTR(J_0, S) + + var tag = []; + this.cipher.encrypt(this._j0, tag); + + for (var i = 0; i < this._ints; ++i) { + this.tag.putInt32(this._s[i] ^ tag[i]); + } // trim tag to length + + + this.tag.truncate(this.tag.length() % (this._tagLength / 8)); // check authentication tag + + if (options.decrypt && this.tag.bytes() !== this._tag) { + rval = false; + } + + return rval; +}; +/** + * See NIST SP-800-38D 6.3 (Algorithm 1). This function performs Galois + * field multiplication. The field, GF(2^128), is defined by the polynomial: + * + * x^128 + x^7 + x^2 + x + 1 + * + * Which is represented in little-endian binary form as: 11100001 (0xe1). When + * the value of a coefficient is 1, a bit is set. The value R, is the + * concatenation of this value and 120 zero bits, yielding a 128-bit value + * which matches the block size. + * + * This function will multiply two elements (vectors of bytes), X and Y, in + * the field GF(2^128). The result is initialized to zero. For each bit of + * X (out of 128), x_i, if x_i is set, then the result is multiplied (XOR'd) + * by the current value of Y. For each bit, the value of Y will be raised by + * a power of x (multiplied by the polynomial x). This can be achieved by + * shifting Y once to the right. If the current value of Y, prior to being + * multiplied by x, has 0 as its LSB, then it is a 127th degree polynomial. + * Otherwise, we must divide by R after shifting to find the remainder. + * + * @param x the first block to multiply by the second. + * @param y the second block to multiply by the first. + * + * @return the block result of the multiplication. + */ + + +modes.gcm.prototype.multiply = function (x, y) { + var z_i = [0, 0, 0, 0]; + var v_i = y.slice(0); // calculate Z_128 (block has 128 bits) + + for (var i = 0; i < 128; ++i) { + // if x_i is 0, Z_{i+1} = Z_i (unchanged) + // else Z_{i+1} = Z_i ^ V_i + // get x_i by finding 32-bit int position, then left shift 1 by remainder + var x_i = x[i / 32 | 0] & 1 << 31 - i % 32; + + if (x_i) { + z_i[0] ^= v_i[0]; + z_i[1] ^= v_i[1]; + z_i[2] ^= v_i[2]; + z_i[3] ^= v_i[3]; + } // if LSB(V_i) is 1, V_i = V_i >> 1 + // else V_i = (V_i >> 1) ^ R + + + this.pow(v_i, v_i); + } + + return z_i; +}; + +modes.gcm.prototype.pow = function (x, out) { + // if LSB(x) is 1, x = x >>> 1 + // else x = (x >>> 1) ^ R + var lsb = x[3] & 1; // always do x >>> 1: + // starting with the rightmost integer, shift each integer to the right + // one bit, pulling in the bit from the integer to the left as its top + // most bit (do this for the last 3 integers) + + for (var i = 3; i > 0; --i) { + out[i] = x[i] >>> 1 | (x[i - 1] & 1) << 31; + } // shift the first integer normally + + + out[0] = x[0] >>> 1; // if lsb was not set, then polynomial had a degree of 127 and doesn't + // need to divided; otherwise, XOR with R to find the remainder; we only + // need to XOR the first integer since R technically ends w/120 zero bits + + if (lsb) { + out[0] ^= this._R; + } +}; + +modes.gcm.prototype.tableMultiply = function (x) { + // assumes 4-bit tables are used + var z = [0, 0, 0, 0]; + + for (var i = 0; i < 32; ++i) { + var idx = i / 8 | 0; + var x_i = x[idx] >>> (7 - i % 8) * 4 & 0xF; + var ah = this._m[i][x_i]; + z[0] ^= ah[0]; + z[1] ^= ah[1]; + z[2] ^= ah[2]; + z[3] ^= ah[3]; + } + + return z; +}; +/** + * A continuing version of the GHASH algorithm that operates on a single + * block. The hash block, last hash value (Ym) and the new block to hash + * are given. + * + * @param h the hash block. + * @param y the previous value for Ym, use [0, 0, 0, 0] for a new hash. + * @param x the block to hash. + * + * @return the hashed value (Ym). + */ + + +modes.gcm.prototype.ghash = function (h, y, x) { + y[0] ^= x[0]; + y[1] ^= x[1]; + y[2] ^= x[2]; + y[3] ^= x[3]; + return this.tableMultiply(y); //return this.multiply(y, h); +}; +/** + * Precomputes a table for multiplying against the hash subkey. This + * mechanism provides a substantial speed increase over multiplication + * performed without a table. The table-based multiplication this table is + * for solves X * H by multiplying each component of X by H and then + * composing the results together using XOR. + * + * This function can be used to generate tables with different bit sizes + * for the components, however, this implementation assumes there are + * 32 components of X (which is a 16 byte vector), therefore each component + * takes 4-bits (so the table is constructed with bits=4). + * + * @param h the hash subkey. + * @param bits the bit size for a component. + */ + + +modes.gcm.prototype.generateHashTable = function (h, bits) { + // TODO: There are further optimizations that would use only the + // first table M_0 (or some variant) along with a remainder table; + // this can be explored in the future + var multiplier = 8 / bits; + var perInt = 4 * multiplier; + var size = 16 * multiplier; + var m = new Array(size); + + for (var i = 0; i < size; ++i) { + var tmp = [0, 0, 0, 0]; + var idx = i / perInt | 0; + var shft = (perInt - 1 - i % perInt) * bits; + tmp[idx] = 1 << bits - 1 << shft; + m[i] = this.generateSubHashTable(this.multiply(tmp, h), bits); + } + + return m; +}; +/** + * Generates a table for multiplying against the hash subkey for one + * particular component (out of all possible component values). + * + * @param mid the pre-multiplied value for the middle key of the table. + * @param bits the bit size for a component. + */ + + +modes.gcm.prototype.generateSubHashTable = function (mid, bits) { + // compute the table quickly by minimizing the number of + // POW operations -- they only need to be performed for powers of 2, + // all other entries can be composed from those powers using XOR + var size = 1 << bits; + var half = size >>> 1; + var m = new Array(size); + m[half] = mid.slice(0); + var i = half >>> 1; + + while (i > 0) { + // raise m0[2 * i] and store in m0[i] + this.pow(m[2 * i], m[i] = []); + i >>= 1; + } + + i = 2; + + while (i < half) { + for (var j = 1; j < i; ++j) { + var m_i = m[i]; + var m_j = m[j]; + m[i + j] = [m_i[0] ^ m_j[0], m_i[1] ^ m_j[1], m_i[2] ^ m_j[2], m_i[3] ^ m_j[3]]; + } + + i *= 2; + } + + m[0] = [0, 0, 0, 0]; + /* Note: We could avoid storing these by doing composition during multiply + calculate top half using composition by speed is preferred. */ + + for (i = half + 1; i < size; ++i) { + var c = m[i ^ half]; + m[i] = [mid[0] ^ c[0], mid[1] ^ c[1], mid[2] ^ c[2], mid[3] ^ c[3]]; + } + + return m; +}; +/** Utility functions */ + + +function transformIV(iv) { + if (typeof iv === 'string') { + // convert iv string into byte buffer + iv = forge.util.createBuffer(iv); + } + + if (forge.util.isArray(iv) && iv.length > 4) { + // convert iv byte array into byte buffer + var tmp = iv; + iv = forge.util.createBuffer(); + + for (var i = 0; i < tmp.length; ++i) { + iv.putByte(tmp[i]); + } + } + + if (!forge.util.isArray(iv)) { + // convert iv byte buffer into 32-bit integer array + iv = [iv.getInt32(), iv.getInt32(), iv.getInt32(), iv.getInt32()]; + } + + return iv; +} + +function inc32(block) { + // increment last 32 bits of block only + block[block.length - 1] = block[block.length - 1] + 1 & 0xFFFFFFFF; +} + +function from64To32(num) { + // convert 64-bit number to two BE Int32s + return [num / 0x100000000 | 0, num & 0xFFFFFFFF]; +} + +/***/ }), +/* 111 */ +/***/ (function(module, exports) { + +/* (ignored) */ + +/***/ }), +/* 112 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Password-based encryption functions. + * + * @author Dave Longley + * @author Stefan Siegl + * + * Copyright (c) 2010-2013 Digital Bazaar, Inc. + * Copyright (c) 2012 Stefan Siegl + * + * An EncryptedPrivateKeyInfo: + * + * EncryptedPrivateKeyInfo ::= SEQUENCE { + * encryptionAlgorithm EncryptionAlgorithmIdentifier, + * encryptedData EncryptedData } + * + * EncryptionAlgorithmIdentifier ::= AlgorithmIdentifier + * + * EncryptedData ::= OCTET STRING + */ +var forge = __webpack_require__(8); + +__webpack_require__(108); + +__webpack_require__(71); + +__webpack_require__(234); + +__webpack_require__(28); + +__webpack_require__(72); + +__webpack_require__(235); + +__webpack_require__(237); + +__webpack_require__(52); + +__webpack_require__(238); + +__webpack_require__(106); + +__webpack_require__(9); + +if (typeof BigInteger === 'undefined') { + var BigInteger = forge.jsbn.BigInteger; +} // shortcut for asn.1 API + + +var asn1 = forge.asn1; +/* Password-based encryption implementation. */ + +var pki = forge.pki = forge.pki || {}; +module.exports = pki.pbe = forge.pbe = forge.pbe || {}; +var oids = pki.oids; // validator for an EncryptedPrivateKeyInfo structure +// Note: Currently only works w/algorithm params + +var encryptedPrivateKeyValidator = { + name: 'EncryptedPrivateKeyInfo', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'EncryptedPrivateKeyInfo.encryptionAlgorithm', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'AlgorithmIdentifier.algorithm', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OID, + constructed: false, + capture: 'encryptionOid' + }, { + name: 'AlgorithmIdentifier.parameters', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + captureAsn1: 'encryptionParams' + }] + }, { + // encryptedData + name: 'EncryptedPrivateKeyInfo.encryptedData', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OCTETSTRING, + constructed: false, + capture: 'encryptedData' + }] +}; // validator for a PBES2Algorithms structure +// Note: Currently only works w/PBKDF2 + AES encryption schemes + +var PBES2AlgorithmsValidator = { + name: 'PBES2Algorithms', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'PBES2Algorithms.keyDerivationFunc', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'PBES2Algorithms.keyDerivationFunc.oid', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OID, + constructed: false, + capture: 'kdfOid' + }, { + name: 'PBES2Algorithms.params', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'PBES2Algorithms.params.salt', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OCTETSTRING, + constructed: false, + capture: 'kdfSalt' + }, { + name: 'PBES2Algorithms.params.iterationCount', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'kdfIterationCount' + }, { + name: 'PBES2Algorithms.params.keyLength', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + optional: true, + capture: 'keyLength' + }, { + // prf + name: 'PBES2Algorithms.params.prf', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + optional: true, + value: [{ + name: 'PBES2Algorithms.params.prf.algorithm', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OID, + constructed: false, + capture: 'prfOid' + }] + }] + }] + }, { + name: 'PBES2Algorithms.encryptionScheme', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'PBES2Algorithms.encryptionScheme.oid', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OID, + constructed: false, + capture: 'encOid' + }, { + name: 'PBES2Algorithms.encryptionScheme.iv', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OCTETSTRING, + constructed: false, + capture: 'encIv' + }] + }] +}; +var pkcs12PbeParamsValidator = { + name: 'pkcs-12PbeParams', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.SEQUENCE, + constructed: true, + value: [{ + name: 'pkcs-12PbeParams.salt', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.OCTETSTRING, + constructed: false, + capture: 'salt' + }, { + name: 'pkcs-12PbeParams.iterations', + tagClass: asn1.Class.UNIVERSAL, + type: asn1.Type.INTEGER, + constructed: false, + capture: 'iterations' + }] +}; +/** + * Encrypts a ASN.1 PrivateKeyInfo object, producing an EncryptedPrivateKeyInfo. + * + * PBES2Algorithms ALGORITHM-IDENTIFIER ::= + * { {PBES2-params IDENTIFIED BY id-PBES2}, ...} + * + * id-PBES2 OBJECT IDENTIFIER ::= {pkcs-5 13} + * + * PBES2-params ::= SEQUENCE { + * keyDerivationFunc AlgorithmIdentifier {{PBES2-KDFs}}, + * encryptionScheme AlgorithmIdentifier {{PBES2-Encs}} + * } + * + * PBES2-KDFs ALGORITHM-IDENTIFIER ::= + * { {PBKDF2-params IDENTIFIED BY id-PBKDF2}, ... } + * + * PBES2-Encs ALGORITHM-IDENTIFIER ::= { ... } + * + * PBKDF2-params ::= SEQUENCE { + * salt CHOICE { + * specified OCTET STRING, + * otherSource AlgorithmIdentifier {{PBKDF2-SaltSources}} + * }, + * iterationCount INTEGER (1..MAX), + * keyLength INTEGER (1..MAX) OPTIONAL, + * prf AlgorithmIdentifier {{PBKDF2-PRFs}} DEFAULT algid-hmacWithSHA1 + * } + * + * @param obj the ASN.1 PrivateKeyInfo object. + * @param password the password to encrypt with. + * @param options: + * algorithm the encryption algorithm to use + * ('aes128', 'aes192', 'aes256', '3des'), defaults to 'aes128'. + * count the iteration count to use. + * saltSize the salt size to use. + * prfAlgorithm the PRF message digest algorithm to use + * ('sha1', 'sha224', 'sha256', 'sha384', 'sha512') + * + * @return the ASN.1 EncryptedPrivateKeyInfo. + */ + +pki.encryptPrivateKeyInfo = function (obj, password, options) { + // set default options + options = options || {}; + options.saltSize = options.saltSize || 8; + options.count = options.count || 2048; + options.algorithm = options.algorithm || 'aes128'; + options.prfAlgorithm = options.prfAlgorithm || 'sha1'; // generate PBE params + + var salt = forge.random.getBytesSync(options.saltSize); + var count = options.count; + var countBytes = asn1.integerToDer(count); + var dkLen; + var encryptionAlgorithm; + var encryptedData; + + if (options.algorithm.indexOf('aes') === 0 || options.algorithm === 'des') { + // do PBES2 + var ivLen, encOid, cipherFn; + + switch (options.algorithm) { + case 'aes128': + dkLen = 16; + ivLen = 16; + encOid = oids['aes128-CBC']; + cipherFn = forge.aes.createEncryptionCipher; + break; + + case 'aes192': + dkLen = 24; + ivLen = 16; + encOid = oids['aes192-CBC']; + cipherFn = forge.aes.createEncryptionCipher; + break; + + case 'aes256': + dkLen = 32; + ivLen = 16; + encOid = oids['aes256-CBC']; + cipherFn = forge.aes.createEncryptionCipher; + break; + + case 'des': + dkLen = 8; + ivLen = 8; + encOid = oids['desCBC']; + cipherFn = forge.des.createEncryptionCipher; + break; + + default: + var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.'); + error.algorithm = options.algorithm; + throw error; + } // get PRF message digest + + + var prfAlgorithm = 'hmacWith' + options.prfAlgorithm.toUpperCase(); + var md = prfAlgorithmToMessageDigest(prfAlgorithm); // encrypt private key using pbe SHA-1 and AES/DES + + var dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen, md); + var iv = forge.random.getBytesSync(ivLen); + var cipher = cipherFn(dk); + cipher.start(iv); + cipher.update(asn1.toDer(obj)); + cipher.finish(); + encryptedData = cipher.output.getBytes(); // get PBKDF2-params + + var params = createPbkdf2Params(salt, countBytes, dkLen, prfAlgorithm); + encryptionAlgorithm = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(oids['pkcs5PBES2']).getBytes()), asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// keyDerivationFunc + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(oids['pkcs5PBKDF2']).getBytes()), // PBKDF2-params + params]), // encryptionScheme + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(encOid).getBytes()), // iv + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, iv)])])]); + } else if (options.algorithm === '3des') { + // Do PKCS12 PBE + dkLen = 24; + var saltBytes = new forge.util.ByteBuffer(salt); + var dk = pki.pbe.generatePkcs12Key(password, saltBytes, 1, count, dkLen); + var iv = pki.pbe.generatePkcs12Key(password, saltBytes, 2, count, dkLen); + var cipher = forge.des.createEncryptionCipher(dk); + cipher.start(iv); + cipher.update(asn1.toDer(obj)); + cipher.finish(); + encryptedData = cipher.output.getBytes(); + encryptionAlgorithm = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(oids['pbeWithSHAAnd3-KeyTripleDES-CBC']).getBytes()), // pkcs-12PbeParams + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// salt + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt), // iteration count + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, countBytes.getBytes())])]); + } else { + var error = new Error('Cannot encrypt private key. Unknown encryption algorithm.'); + error.algorithm = options.algorithm; + throw error; + } // EncryptedPrivateKeyInfo + + + var rval = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// encryptionAlgorithm + encryptionAlgorithm, // encryptedData + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, encryptedData)]); + return rval; +}; +/** + * Decrypts a ASN.1 PrivateKeyInfo object. + * + * @param obj the ASN.1 EncryptedPrivateKeyInfo object. + * @param password the password to decrypt with. + * + * @return the ASN.1 PrivateKeyInfo on success, null on failure. + */ + + +pki.decryptPrivateKeyInfo = function (obj, password) { + var rval = null; // get PBE params + + var capture = {}; + var errors = []; + + if (!asn1.validate(obj, encryptedPrivateKeyValidator, capture, errors)) { + var error = new Error('Cannot read encrypted private key. ' + 'ASN.1 object is not a supported EncryptedPrivateKeyInfo.'); + error.errors = errors; + throw error; + } // get cipher + + + var oid = asn1.derToOid(capture.encryptionOid); + var cipher = pki.pbe.getCipher(oid, capture.encryptionParams, password); // get encrypted data + + var encrypted = forge.util.createBuffer(capture.encryptedData); + cipher.update(encrypted); + + if (cipher.finish()) { + rval = asn1.fromDer(cipher.output); + } + + return rval; +}; +/** + * Converts a EncryptedPrivateKeyInfo to PEM format. + * + * @param epki the EncryptedPrivateKeyInfo. + * @param maxline the maximum characters per line, defaults to 64. + * + * @return the PEM-formatted encrypted private key. + */ + + +pki.encryptedPrivateKeyToPem = function (epki, maxline) { + // convert to DER, then PEM-encode + var msg = { + type: 'ENCRYPTED PRIVATE KEY', + body: asn1.toDer(epki).getBytes() + }; + return forge.pem.encode(msg, { + maxline: maxline + }); +}; +/** + * Converts a PEM-encoded EncryptedPrivateKeyInfo to ASN.1 format. Decryption + * is not performed. + * + * @param pem the EncryptedPrivateKeyInfo in PEM-format. + * + * @return the ASN.1 EncryptedPrivateKeyInfo. + */ + + +pki.encryptedPrivateKeyFromPem = function (pem) { + var msg = forge.pem.decode(pem)[0]; + + if (msg.type !== 'ENCRYPTED PRIVATE KEY') { + var error = new Error('Could not convert encrypted private key from PEM; ' + 'PEM header type is "ENCRYPTED PRIVATE KEY".'); + error.headerType = msg.type; + throw error; + } + + if (msg.procType && msg.procType.type === 'ENCRYPTED') { + throw new Error('Could not convert encrypted private key from PEM; ' + 'PEM is encrypted.'); + } // convert DER to ASN.1 object + + + return asn1.fromDer(msg.body); +}; +/** + * Encrypts an RSA private key. By default, the key will be wrapped in + * a PrivateKeyInfo and encrypted to produce a PKCS#8 EncryptedPrivateKeyInfo. + * This is the standard, preferred way to encrypt a private key. + * + * To produce a non-standard PEM-encrypted private key that uses encapsulated + * headers to indicate the encryption algorithm (old-style non-PKCS#8 OpenSSL + * private key encryption), set the 'legacy' option to true. Note: Using this + * option will cause the iteration count to be forced to 1. + * + * Note: The 'des' algorithm is supported, but it is not considered to be + * secure because it only uses a single 56-bit key. If possible, it is highly + * recommended that a different algorithm be used. + * + * @param rsaKey the RSA key to encrypt. + * @param password the password to use. + * @param options: + * algorithm: the encryption algorithm to use + * ('aes128', 'aes192', 'aes256', '3des', 'des'). + * count: the iteration count to use. + * saltSize: the salt size to use. + * legacy: output an old non-PKCS#8 PEM-encrypted+encapsulated + * headers (DEK-Info) private key. + * + * @return the PEM-encoded ASN.1 EncryptedPrivateKeyInfo. + */ + + +pki.encryptRsaPrivateKey = function (rsaKey, password, options) { + // standard PKCS#8 + options = options || {}; + + if (!options.legacy) { + // encrypt PrivateKeyInfo + var rval = pki.wrapRsaPrivateKey(pki.privateKeyToAsn1(rsaKey)); + rval = pki.encryptPrivateKeyInfo(rval, password, options); + return pki.encryptedPrivateKeyToPem(rval); + } // legacy non-PKCS#8 + + + var algorithm; + var iv; + var dkLen; + var cipherFn; + + switch (options.algorithm) { + case 'aes128': + algorithm = 'AES-128-CBC'; + dkLen = 16; + iv = forge.random.getBytesSync(16); + cipherFn = forge.aes.createEncryptionCipher; + break; + + case 'aes192': + algorithm = 'AES-192-CBC'; + dkLen = 24; + iv = forge.random.getBytesSync(16); + cipherFn = forge.aes.createEncryptionCipher; + break; + + case 'aes256': + algorithm = 'AES-256-CBC'; + dkLen = 32; + iv = forge.random.getBytesSync(16); + cipherFn = forge.aes.createEncryptionCipher; + break; + + case '3des': + algorithm = 'DES-EDE3-CBC'; + dkLen = 24; + iv = forge.random.getBytesSync(8); + cipherFn = forge.des.createEncryptionCipher; + break; + + case 'des': + algorithm = 'DES-CBC'; + dkLen = 8; + iv = forge.random.getBytesSync(8); + cipherFn = forge.des.createEncryptionCipher; + break; + + default: + var error = new Error('Could not encrypt RSA private key; unsupported ' + 'encryption algorithm "' + options.algorithm + '".'); + error.algorithm = options.algorithm; + throw error; + } // encrypt private key using OpenSSL legacy key derivation + + + var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen); + var cipher = cipherFn(dk); + cipher.start(iv); + cipher.update(asn1.toDer(pki.privateKeyToAsn1(rsaKey))); + cipher.finish(); + var msg = { + type: 'RSA PRIVATE KEY', + procType: { + version: '4', + type: 'ENCRYPTED' + }, + dekInfo: { + algorithm: algorithm, + parameters: forge.util.bytesToHex(iv).toUpperCase() + }, + body: cipher.output.getBytes() + }; + return forge.pem.encode(msg); +}; +/** + * Decrypts an RSA private key. + * + * @param pem the PEM-formatted EncryptedPrivateKeyInfo to decrypt. + * @param password the password to use. + * + * @return the RSA key on success, null on failure. + */ + + +pki.decryptRsaPrivateKey = function (pem, password) { + var rval = null; + var msg = forge.pem.decode(pem)[0]; + + if (msg.type !== 'ENCRYPTED PRIVATE KEY' && msg.type !== 'PRIVATE KEY' && msg.type !== 'RSA PRIVATE KEY') { + var error = new Error('Could not convert private key from PEM; PEM header type ' + 'is not "ENCRYPTED PRIVATE KEY", "PRIVATE KEY", or "RSA PRIVATE KEY".'); + error.headerType = error; + throw error; + } + + if (msg.procType && msg.procType.type === 'ENCRYPTED') { + var dkLen; + var cipherFn; + + switch (msg.dekInfo.algorithm) { + case 'DES-CBC': + dkLen = 8; + cipherFn = forge.des.createDecryptionCipher; + break; + + case 'DES-EDE3-CBC': + dkLen = 24; + cipherFn = forge.des.createDecryptionCipher; + break; + + case 'AES-128-CBC': + dkLen = 16; + cipherFn = forge.aes.createDecryptionCipher; + break; + + case 'AES-192-CBC': + dkLen = 24; + cipherFn = forge.aes.createDecryptionCipher; + break; + + case 'AES-256-CBC': + dkLen = 32; + cipherFn = forge.aes.createDecryptionCipher; + break; + + case 'RC2-40-CBC': + dkLen = 5; + + cipherFn = function cipherFn(key) { + return forge.rc2.createDecryptionCipher(key, 40); + }; + + break; + + case 'RC2-64-CBC': + dkLen = 8; + + cipherFn = function cipherFn(key) { + return forge.rc2.createDecryptionCipher(key, 64); + }; + + break; + + case 'RC2-128-CBC': + dkLen = 16; + + cipherFn = function cipherFn(key) { + return forge.rc2.createDecryptionCipher(key, 128); + }; + + break; + + default: + var error = new Error('Could not decrypt private key; unsupported ' + 'encryption algorithm "' + msg.dekInfo.algorithm + '".'); + error.algorithm = msg.dekInfo.algorithm; + throw error; + } // use OpenSSL legacy key derivation + + + var iv = forge.util.hexToBytes(msg.dekInfo.parameters); + var dk = forge.pbe.opensslDeriveBytes(password, iv.substr(0, 8), dkLen); + var cipher = cipherFn(dk); + cipher.start(iv); + cipher.update(forge.util.createBuffer(msg.body)); + + if (cipher.finish()) { + rval = cipher.output.getBytes(); + } else { + return rval; + } + } else { + rval = msg.body; + } + + if (msg.type === 'ENCRYPTED PRIVATE KEY') { + rval = pki.decryptPrivateKeyInfo(asn1.fromDer(rval), password); + } else { + // decryption already performed above + rval = asn1.fromDer(rval); + } + + if (rval !== null) { + rval = pki.privateKeyFromAsn1(rval); + } + + return rval; +}; +/** + * Derives a PKCS#12 key. + * + * @param password the password to derive the key material from, null or + * undefined for none. + * @param salt the salt, as a ByteBuffer, to use. + * @param id the PKCS#12 ID byte (1 = key material, 2 = IV, 3 = MAC). + * @param iter the iteration count. + * @param n the number of bytes to derive from the password. + * @param md the message digest to use, defaults to SHA-1. + * + * @return a ByteBuffer with the bytes derived from the password. + */ + + +pki.pbe.generatePkcs12Key = function (password, salt, id, iter, n, md) { + var j, l; + + if (typeof md === 'undefined' || md === null) { + if (!('sha1' in forge.md)) { + throw new Error('"sha1" hash algorithm unavailable.'); + } + + md = forge.md.sha1.create(); + } + + var u = md.digestLength; + var v = md.blockLength; + var result = new forge.util.ByteBuffer(); + /* Convert password to Unicode byte buffer + trailing 0-byte. */ + + var passBuf = new forge.util.ByteBuffer(); + + if (password !== null && password !== undefined) { + for (l = 0; l < password.length; l++) { + passBuf.putInt16(password.charCodeAt(l)); + } + + passBuf.putInt16(0); + } + /* Length of salt and password in BYTES. */ + + + var p = passBuf.length(); + var s = salt.length(); + /* 1. Construct a string, D (the "diversifier"), by concatenating + v copies of ID. */ + + var D = new forge.util.ByteBuffer(); + D.fillWithByte(id, v); + /* 2. Concatenate copies of the salt together to create a string S of length + v * ceil(s / v) bytes (the final copy of the salt may be trunacted + to create S). + Note that if the salt is the empty string, then so is S. */ + + var Slen = v * Math.ceil(s / v); + var S = new forge.util.ByteBuffer(); + + for (l = 0; l < Slen; l++) { + S.putByte(salt.at(l % s)); + } + /* 3. Concatenate copies of the password together to create a string P of + length v * ceil(p / v) bytes (the final copy of the password may be + truncated to create P). + Note that if the password is the empty string, then so is P. */ + + + var Plen = v * Math.ceil(p / v); + var P = new forge.util.ByteBuffer(); + + for (l = 0; l < Plen; l++) { + P.putByte(passBuf.at(l % p)); + } + /* 4. Set I=S||P to be the concatenation of S and P. */ + + + var I = S; + I.putBuffer(P); + /* 5. Set c=ceil(n / u). */ + + var c = Math.ceil(n / u); + /* 6. For i=1, 2, ..., c, do the following: */ + + for (var i = 1; i <= c; i++) { + /* a) Set Ai=H^r(D||I). (l.e. the rth hash of D||I, H(H(H(...H(D||I)))) */ + var buf = new forge.util.ByteBuffer(); + buf.putBytes(D.bytes()); + buf.putBytes(I.bytes()); + + for (var round = 0; round < iter; round++) { + md.start(); + md.update(buf.getBytes()); + buf = md.digest(); + } + /* b) Concatenate copies of Ai to create a string B of length v bytes (the + final copy of Ai may be truncated to create B). */ + + + var B = new forge.util.ByteBuffer(); + + for (l = 0; l < v; l++) { + B.putByte(buf.at(l % u)); + } + /* c) Treating I as a concatenation I0, I1, ..., Ik-1 of v-byte blocks, + where k=ceil(s / v) + ceil(p / v), modify I by setting + Ij=(Ij+B+1) mod 2v for each j. */ + + + var k = Math.ceil(s / v) + Math.ceil(p / v); + var Inew = new forge.util.ByteBuffer(); + + for (j = 0; j < k; j++) { + var chunk = new forge.util.ByteBuffer(I.getBytes(v)); + var x = 0x1ff; + + for (l = B.length() - 1; l >= 0; l--) { + x = x >> 8; + x += B.at(l) + chunk.at(l); + chunk.setAt(l, x & 0xff); + } + + Inew.putBuffer(chunk); + } + + I = Inew; + /* Add Ai to A. */ + + result.putBuffer(buf); + } + + result.truncate(result.length() - n); + return result; +}; +/** + * Get new Forge cipher object instance. + * + * @param oid the OID (in string notation). + * @param params the ASN.1 params object. + * @param password the password to decrypt with. + * + * @return new cipher object instance. + */ + + +pki.pbe.getCipher = function (oid, params, password) { + switch (oid) { + case pki.oids['pkcs5PBES2']: + return pki.pbe.getCipherForPBES2(oid, params, password); + + case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']: + case pki.oids['pbewithSHAAnd40BitRC2-CBC']: + return pki.pbe.getCipherForPKCS12PBE(oid, params, password); + + default: + var error = new Error('Cannot read encrypted PBE data block. Unsupported OID.'); + error.oid = oid; + error.supportedOids = ['pkcs5PBES2', 'pbeWithSHAAnd3-KeyTripleDES-CBC', 'pbewithSHAAnd40BitRC2-CBC']; + throw error; + } +}; +/** + * Get new Forge cipher object instance according to PBES2 params block. + * + * The returned cipher instance is already started using the IV + * from PBES2 parameter block. + * + * @param oid the PKCS#5 PBKDF2 OID (in string notation). + * @param params the ASN.1 PBES2-params object. + * @param password the password to decrypt with. + * + * @return new cipher object instance. + */ + + +pki.pbe.getCipherForPBES2 = function (oid, params, password) { + // get PBE params + var capture = {}; + var errors = []; + + if (!asn1.validate(params, PBES2AlgorithmsValidator, capture, errors)) { + var error = new Error('Cannot read password-based-encryption algorithm ' + 'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.'); + error.errors = errors; + throw error; + } // check oids + + + oid = asn1.derToOid(capture.kdfOid); + + if (oid !== pki.oids['pkcs5PBKDF2']) { + var error = new Error('Cannot read encrypted private key. ' + 'Unsupported key derivation function OID.'); + error.oid = oid; + error.supportedOids = ['pkcs5PBKDF2']; + throw error; + } + + oid = asn1.derToOid(capture.encOid); + + if (oid !== pki.oids['aes128-CBC'] && oid !== pki.oids['aes192-CBC'] && oid !== pki.oids['aes256-CBC'] && oid !== pki.oids['des-EDE3-CBC'] && oid !== pki.oids['desCBC']) { + var error = new Error('Cannot read encrypted private key. ' + 'Unsupported encryption scheme OID.'); + error.oid = oid; + error.supportedOids = ['aes128-CBC', 'aes192-CBC', 'aes256-CBC', 'des-EDE3-CBC', 'desCBC']; + throw error; + } // set PBE params + + + var salt = capture.kdfSalt; + var count = forge.util.createBuffer(capture.kdfIterationCount); + count = count.getInt(count.length() << 3); + var dkLen; + var cipherFn; + + switch (pki.oids[oid]) { + case 'aes128-CBC': + dkLen = 16; + cipherFn = forge.aes.createDecryptionCipher; + break; + + case 'aes192-CBC': + dkLen = 24; + cipherFn = forge.aes.createDecryptionCipher; + break; + + case 'aes256-CBC': + dkLen = 32; + cipherFn = forge.aes.createDecryptionCipher; + break; + + case 'des-EDE3-CBC': + dkLen = 24; + cipherFn = forge.des.createDecryptionCipher; + break; + + case 'desCBC': + dkLen = 8; + cipherFn = forge.des.createDecryptionCipher; + break; + } // get PRF message digest + + + var md = prfOidToMessageDigest(capture.prfOid); // decrypt private key using pbe with chosen PRF and AES/DES + + var dk = forge.pkcs5.pbkdf2(password, salt, count, dkLen, md); + var iv = capture.encIv; + var cipher = cipherFn(dk); + cipher.start(iv); + return cipher; +}; +/** + * Get new Forge cipher object instance for PKCS#12 PBE. + * + * The returned cipher instance is already started using the key & IV + * derived from the provided password and PKCS#12 PBE salt. + * + * @param oid The PKCS#12 PBE OID (in string notation). + * @param params The ASN.1 PKCS#12 PBE-params object. + * @param password The password to decrypt with. + * + * @return the new cipher object instance. + */ + + +pki.pbe.getCipherForPKCS12PBE = function (oid, params, password) { + // get PBE params + var capture = {}; + var errors = []; + + if (!asn1.validate(params, pkcs12PbeParamsValidator, capture, errors)) { + var error = new Error('Cannot read password-based-encryption algorithm ' + 'parameters. ASN.1 object is not a supported EncryptedPrivateKeyInfo.'); + error.errors = errors; + throw error; + } + + var salt = forge.util.createBuffer(capture.salt); + var count = forge.util.createBuffer(capture.iterations); + count = count.getInt(count.length() << 3); + var dkLen, dIvLen, cipherFn; + + switch (oid) { + case pki.oids['pbeWithSHAAnd3-KeyTripleDES-CBC']: + dkLen = 24; + dIvLen = 8; + cipherFn = forge.des.startDecrypting; + break; + + case pki.oids['pbewithSHAAnd40BitRC2-CBC']: + dkLen = 5; + dIvLen = 8; + + cipherFn = function cipherFn(key, iv) { + var cipher = forge.rc2.createDecryptionCipher(key, 40); + cipher.start(iv, null); + return cipher; + }; + + break; + + default: + var error = new Error('Cannot read PKCS #12 PBE data block. Unsupported OID.'); + error.oid = oid; + throw error; + } // get PRF message digest + + + var md = prfOidToMessageDigest(capture.prfOid); + var key = pki.pbe.generatePkcs12Key(password, salt, 1, count, dkLen, md); + md.start(); + var iv = pki.pbe.generatePkcs12Key(password, salt, 2, count, dIvLen, md); + return cipherFn(key, iv); +}; +/** + * OpenSSL's legacy key derivation function. + * + * See: http://www.openssl.org/docs/crypto/EVP_BytesToKey.html + * + * @param password the password to derive the key from. + * @param salt the salt to use, null for none. + * @param dkLen the number of bytes needed for the derived key. + * @param [options] the options to use: + * [md] an optional message digest object to use. + */ + + +pki.pbe.opensslDeriveBytes = function (password, salt, dkLen, md) { + if (typeof md === 'undefined' || md === null) { + if (!('md5' in forge.md)) { + throw new Error('"md5" hash algorithm unavailable.'); + } + + md = forge.md.md5.create(); + } + + if (salt === null) { + salt = ''; + } + + var digests = [hash(md, password + salt)]; + + for (var length = 16, i = 1; length < dkLen; ++i, length += 16) { + digests.push(hash(md, digests[i - 1] + password + salt)); + } + + return digests.join('').substr(0, dkLen); +}; + +function hash(md, bytes) { + return md.start().update(bytes).digest().getBytes(); +} + +function prfOidToMessageDigest(prfOid) { + // get PRF algorithm, default to SHA-1 + var prfAlgorithm; + + if (!prfOid) { + prfAlgorithm = 'hmacWithSHA1'; + } else { + prfAlgorithm = pki.oids[asn1.derToOid(prfOid)]; + + if (!prfAlgorithm) { + var error = new Error('Unsupported PRF OID.'); + error.oid = prfOid; + error.supported = ['hmacWithSHA1', 'hmacWithSHA224', 'hmacWithSHA256', 'hmacWithSHA384', 'hmacWithSHA512']; + throw error; + } + } + + return prfAlgorithmToMessageDigest(prfAlgorithm); +} + +function prfAlgorithmToMessageDigest(prfAlgorithm) { + var factory = forge.md; + + switch (prfAlgorithm) { + case 'hmacWithSHA224': + factory = forge.md.sha512; + + case 'hmacWithSHA1': + case 'hmacWithSHA256': + case 'hmacWithSHA384': + case 'hmacWithSHA512': + prfAlgorithm = prfAlgorithm.substr(8).toLowerCase(); + break; + + default: + var error = new Error('Unsupported PRF algorithm.'); + error.algorithm = prfAlgorithm; + error.supported = ['hmacWithSHA1', 'hmacWithSHA224', 'hmacWithSHA256', 'hmacWithSHA384', 'hmacWithSHA512']; + throw error; + } + + if (!factory || !(prfAlgorithm in factory)) { + throw new Error('Unknown hash algorithm: ' + prfAlgorithm); + } + + return factory[prfAlgorithm].create(); +} + +function createPbkdf2Params(salt, countBytes, dkLen, prfAlgorithm) { + var params = asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// salt + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OCTETSTRING, false, salt), // iteration count + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, countBytes.getBytes())]); // when PRF algorithm is not SHA-1 default, add key length and PRF algorithm + + if (prfAlgorithm !== 'hmacWithSHA1') { + params.value.push( // key length + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.INTEGER, false, forge.util.hexToBytes(dkLen.toString(16))), // AlgorithmIdentifier + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.SEQUENCE, true, [// algorithm + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.OID, false, asn1.oidToDer(pki.oids[prfAlgorithm]).getBytes()), // parameters (null) + asn1.create(asn1.Class.UNIVERSAL, asn1.Type.NULL, false, '')])); + } + + return params; +} + +/***/ }), +/* 113 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var multihash = __webpack_require__(14); + +var crypto = __webpack_require__(240); + +module.exports = Multihashing; +/** + * Hash the given `buf` using the algorithm specified + * by `func`. + * + * @param {Buffer} buf - The value to hash. + * @param {number|string} func - The algorithm to use. + * @param {number} [length] - Optionally trim the result to this length. + * @param {function(Error, Buffer)} callback + * @returns {undefined} + */ + +function Multihashing(buf, func, length, callback) { + if (typeof length === 'function') { + callback = length; + length = undefined; + } + + if (!callback) { + throw new Error('Missing callback'); + } + + Multihashing.digest(buf, func, length, function (err, digest) { + if (err) { + return callback(err); + } + + callback(null, multihash.encode(digest, func, length)); + }); +} +/** + * The `buffer` module for easy use in the browser. + * + * @type {Buffer} + */ + + +Multihashing.Buffer = Buffer; // for browser things + +/** + * Expose multihash itself, to avoid silly double requires. + */ + +Multihashing.multihash = multihash; +/** + * @param {Buffer} buf - The value to hash. + * @param {number|string} func - The algorithm to use. + * @param {number} [length] - Optionally trim the result to this length. + * @param {function(Error, Buffer)} callback + * @returns {undefined} + */ + +Multihashing.digest = function (buf, func, length, callback) { + if (typeof length === 'function') { + callback = length; + length = undefined; + } + + if (!callback) { + throw new Error('Missing callback'); + } + + var cb = callback; + + if (length) { + cb = function cb(err, digest) { + if (err) { + return callback(err); + } + + callback(null, digest.slice(0, length)); + }; + } + + var hash; + + try { + hash = Multihashing.createHash(func); + } catch (err) { + return cb(err); + } + + hash(buf, cb); +}; +/** + * @param {string|number} func + * + * @returns {function} - The to `func` corresponding hash function. + */ + + +Multihashing.createHash = function (func) { + func = multihash.coerceCode(func); + + if (!Multihashing.functions[func]) { + throw new Error('multihash function ' + func + ' not yet supported'); + } + + return Multihashing.functions[func]; +}; +/** + * Mapping of multihash codes to their hashing functions. + * @type {Object} + */ + + +Multihashing.functions = { + // sha1 + 0x11: crypto.sha1, + // sha2-256 + 0x12: crypto.sha2256, + // sha2-512 + 0x13: crypto.sha2512, + // sha3-512 + 0x14: crypto.sha3512, + // sha3-384 + 0x15: crypto.sha3384, + // sha3-256 + 0x16: crypto.sha3256, + // sha3-224 + 0x17: crypto.sha3224, + // shake-128 + 0x18: crypto.shake128, + // shake-256 + 0x19: crypto.shake256, + // keccak-224 + 0x1A: crypto.keccak224, + // keccak-256 + 0x1B: crypto.keccak256, + // keccak-384 + 0x1C: crypto.keccak384, + // keccak-512 + 0x1D: crypto.keccak512, + // murmur3-128 + 0x22: crypto.murmur3128, + // murmur3-32 + 0x23: crypto.murmur332, + // dbl-sha2-256 + 0x56: crypto.dblSha2256 // add blake functions + +}; +crypto.addBlake(Multihashing.functions); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 114 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = __webpack_require__(242); + +/***/ }), +/* 115 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, Buffer) { + +exports.toCallback = function (doWork) { + return function (input, callback) { + var res; + + try { + res = doWork(input); + } catch (err) { + process.nextTick(callback, err); + return; + } + + process.nextTick(callback, null, res); + }; +}; + +exports.toBuf = function (doWork, other) { + return function (input) { + var result = doWork(input, other); + return Buffer.from(result, 'hex'); + }; +}; + +exports.fromString = function (doWork, other) { + return function (_input) { + var input = Buffer.isBuffer(_input) ? _input.toString() : _input; + return doWork(input, other); + }; +}; + +exports.fromNumberTo32BitBuf = function (doWork, other) { + return function (input) { + var number = doWork(input, other); + var bytes = new Array(4); + + for (var i = 0; i < 4; i++) { + bytes[i] = number & 0xff; + number = number >> 8; + } + + return Buffer.from(bytes); + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(0).Buffer)) + +/***/ }), +/* 116 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(setImmediate, process) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var Promise = __webpack_require__(244); + +var isPromise = __webpack_require__(117); + +var nextTick; +if (typeof setImmediate === 'function') nextTick = setImmediate;else if ((typeof process === "undefined" ? "undefined" : _typeof(process)) === 'object' && process && process.nextTick) nextTick = process.nextTick;else nextTick = function nextTick(cb) { + setTimeout(cb, 0); +}; +module.exports = nodeify; + +function nodeify(promise, cb) { + if (typeof cb !== 'function') return promise; + return promise.then(function (res) { + nextTick(function () { + cb(null, res); + }); + }, function (err) { + nextTick(function () { + cb(err); + }); + }); +} + +function nodeifyThis(cb) { + return nodeify(this, cb); +} + +nodeify.extend = extend; +nodeify.Promise = NodeifyPromise; + +function extend(prom) { + if (prom && isPromise(prom)) { + prom.nodeify = nodeifyThis; + var then = prom.then; + + prom.then = function () { + return extend(then.apply(this, arguments)); + }; + + return prom; + } else if (typeof prom === 'function') { + prom.prototype.nodeify = nodeifyThis; + } else { + Promise.prototype.nodeify = nodeifyThis; + } +} + +function NodeifyPromise(fn) { + if (!(this instanceof NodeifyPromise)) { + return new NodeifyPromise(fn); + } + + Promise.call(this, fn); + extend(this); +} + +NodeifyPromise.prototype = Object.create(Promise.prototype); +NodeifyPromise.prototype.constructor = NodeifyPromise; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(36).setImmediate, __webpack_require__(6))) + +/***/ }), +/* 117 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = isPromise; + +function isPromise(obj) { + return obj && typeof obj.then === 'function'; +} + +/***/ }), +/* 118 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var ERROR_MSG_INPUT = 'Input must be an string, Buffer or Uint8Array'; // For convenience, let people hash a string, not just a Uint8Array + +function normalizeInput(input) { + var ret; + + if (input instanceof Uint8Array) { + ret = input; + } else if (input instanceof Buffer) { + ret = new Uint8Array(input); + } else if (typeof input === 'string') { + ret = new Uint8Array(Buffer.from(input, 'utf8')); + } else { + throw new Error(ERROR_MSG_INPUT); + } + + return ret; +} // Converts a Uint8Array to a hexadecimal string +// For example, toHex([255, 0, 255]) returns "ff00ff" + + +function toHex(bytes) { + return Array.prototype.map.call(bytes, function (n) { + return (n < 16 ? '0' : '') + n.toString(16); + }).join(''); +} // Converts any value in [0...2^32-1] to an 8-character hex string + + +function uint32ToHex(val) { + return (0x100000000 + val).toString(16).substring(1); +} // For debugging: prints out hash state in the same format as the RFC +// sample computation exactly, so that you can diff + + +function debugPrint(label, arr, size) { + var msg = '\n' + label + ' = '; + + for (var i = 0; i < arr.length; i += 2) { + if (size === 32) { + msg += uint32ToHex(arr[i]).toUpperCase(); + msg += ' '; + msg += uint32ToHex(arr[i + 1]).toUpperCase(); + } else if (size === 64) { + msg += uint32ToHex(arr[i + 1]).toUpperCase(); + msg += uint32ToHex(arr[i]).toUpperCase(); + } else throw new Error('Invalid size ' + size); + + if (i % 6 === 4) { + msg += '\n' + new Array(label.length + 4).join(' '); + } else if (i < arr.length - 2) { + msg += ' '; + } + } + + console.log(msg); +} // For performance testing: generates N bytes of input, hashes M times +// Measures and prints MB/second hash performance each time + + +function testSpeed(hashFn, N, M) { + var startMs = new Date().getTime(); + var input = new Uint8Array(N); + + for (var i = 0; i < N; i++) { + input[i] = i % 256; + } + + var genMs = new Date().getTime(); + console.log('Generated random input in ' + (genMs - startMs) + 'ms'); + startMs = genMs; + + for (i = 0; i < M; i++) { + var hashHex = hashFn(input); + var hashMs = new Date().getTime(); + var ms = hashMs - startMs; + startMs = hashMs; + console.log('Hashed in ' + ms + 'ms: ' + hashHex.substring(0, 20) + '...'); + console.log(Math.round(N / (1 << 20) / (ms / 1000) * 100) / 100 + ' MB PER SECOND'); + } +} + +module.exports = { + normalizeInput: normalizeInput, + toHex: toHex, + debugPrint: debugPrint, + testSpeed: testSpeed +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 119 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, setImmediate) { + +Object.defineProperty(exports, "__esModule", { + value: true +}); + +var _setImmediate = __webpack_require__(75); +/** + * Calls `callback` on a later loop around the event loop. In Node.js this just + * calls `process.nextTick`. In the browser it will use `setImmediate` if + * available, otherwise `setTimeout(callback, 0)`, which means other higher + * priority events may precede the execution of `callback`. + * + * This is used internally for browser-compatibility purposes. + * + * @name nextTick + * @static + * @memberOf module:Utils + * @method + * @see [async.setImmediate]{@link module:Utils.setImmediate} + * @category Util + * @param {Function} callback - The function to call on a later loop around + * the event loop. Invoked with (args...). + * @param {...*} args... - any number of additional arguments to pass to the + * callback on the next tick. + * @example + * + * var call_order = []; + * async.nextTick(function() { + * call_order.push('two'); + * // call_order now equals ['one','two'] + * }); + * call_order.push('one'); + * + * async.setImmediate(function (a, b, c) { + * // a, b, and c equal 1, 2, and 3 + * }, 1, 2, 3); + */ + + +var _defer; + +if (_setImmediate.hasNextTick) { + _defer = process.nextTick; +} else if (_setImmediate.hasSetImmediate) { + _defer = setImmediate; +} else { + _defer = _setImmediate.fallback; +} + +exports["default"] = (0, _setImmediate.wrap)(_defer); +module.exports = exports['default']; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(36).setImmediate)) + +/***/ }), +/* 120 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var randomBytes = __webpack_require__(249); + +module.exports = function (number) { + if (!number || typeof number !== 'number') { + throw new Error('first argument must be a Number bigger than 0'); + } + + return randomBytes(number); +}; + +/***/ }), +/* 121 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var inherits = __webpack_require__(2); + +var Reporter = __webpack_require__(38).Reporter; + +var Buffer = __webpack_require__(0).Buffer; + +function DecoderBuffer(base, options) { + Reporter.call(this, options); + + if (!Buffer.isBuffer(base)) { + this.error('Input not Buffer'); + return; + } + + this.base = base; + this.offset = 0; + this.length = base.length; +} + +inherits(DecoderBuffer, Reporter); +exports.DecoderBuffer = DecoderBuffer; + +DecoderBuffer.prototype.save = function save() { + return { + offset: this.offset, + reporter: Reporter.prototype.save.call(this) + }; +}; + +DecoderBuffer.prototype.restore = function restore(save) { + // Return skipped data + var res = new DecoderBuffer(this.base); + res.offset = save.offset; + res.length = this.offset; + this.offset = save.offset; + Reporter.prototype.restore.call(this, save.reporter); + return res; +}; + +DecoderBuffer.prototype.isEmpty = function isEmpty() { + return this.offset === this.length; +}; + +DecoderBuffer.prototype.readUInt8 = function readUInt8(fail) { + if (this.offset + 1 <= this.length) return this.base.readUInt8(this.offset++, true);else return this.error(fail || 'DecoderBuffer overrun'); +}; + +DecoderBuffer.prototype.skip = function skip(bytes, fail) { + if (!(this.offset + bytes <= this.length)) return this.error(fail || 'DecoderBuffer overrun'); + var res = new DecoderBuffer(this.base); // Share reporter state + + res._reporterState = this._reporterState; + res.offset = this.offset; + res.length = this.offset + bytes; + this.offset += bytes; + return res; +}; + +DecoderBuffer.prototype.raw = function raw(save) { + return this.base.slice(save ? save.offset : this.offset, this.length); +}; + +function EncoderBuffer(value, reporter) { + if (Array.isArray(value)) { + this.length = 0; + this.value = value.map(function (item) { + if (!(item instanceof EncoderBuffer)) item = new EncoderBuffer(item, reporter); + this.length += item.length; + return item; + }, this); + } else if (typeof value === 'number') { + if (!(0 <= value && value <= 0xff)) return reporter.error('non-byte EncoderBuffer value'); + this.value = value; + this.length = 1; + } else if (typeof value === 'string') { + this.value = value; + this.length = Buffer.byteLength(value); + } else if (Buffer.isBuffer(value)) { + this.value = value; + this.length = value.length; + } else { + return reporter.error('Unsupported type: ' + _typeof(value)); + } +} + +exports.EncoderBuffer = EncoderBuffer; + +EncoderBuffer.prototype.join = function join(out, offset) { + if (!out) out = new Buffer(this.length); + if (!offset) offset = 0; + if (this.length === 0) return out; + + if (Array.isArray(this.value)) { + this.value.forEach(function (item) { + item.join(out, offset); + offset += item.length; + }); + } else { + if (typeof this.value === 'number') out[offset] = this.value;else if (typeof this.value === 'string') out.write(this.value, offset);else if (Buffer.isBuffer(this.value)) this.value.copy(out, offset); + offset += this.length; + } + + return out; +}; + +/***/ }), +/* 122 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var constants = exports; // Helper + +constants._reverse = function reverse(map) { + var res = {}; + Object.keys(map).forEach(function (key) { + // Convert key to integer if it is stringified + if ((key | 0) == key) key = key | 0; + var value = map[key]; + res[value] = key; + }); + return res; +}; + +constants.der = __webpack_require__(259); + +/***/ }), +/* 123 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var inherits = __webpack_require__(2); + +var asn1 = __webpack_require__(29); + +var base = asn1.base; +var bignum = asn1.bignum; // Import DER constants + +var der = asn1.constants.der; + +function DERDecoder(entity) { + this.enc = 'der'; + this.name = entity.name; + this.entity = entity; // Construct base tree + + this.tree = new DERNode(); + + this.tree._init(entity.body); +} + +module.exports = DERDecoder; + +DERDecoder.prototype.decode = function decode(data, options) { + if (!(data instanceof base.DecoderBuffer)) data = new base.DecoderBuffer(data, options); + return this.tree._decode(data, options); +}; // Tree methods + + +function DERNode(parent) { + base.Node.call(this, 'der', parent); +} + +inherits(DERNode, base.Node); + +DERNode.prototype._peekTag = function peekTag(buffer, tag, any) { + if (buffer.isEmpty()) return false; + var state = buffer.save(); + var decodedTag = derDecodeTag(buffer, 'Failed to peek tag: "' + tag + '"'); + if (buffer.isError(decodedTag)) return decodedTag; + buffer.restore(state); + return decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + 'of' === tag || any; +}; + +DERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) { + var decodedTag = derDecodeTag(buffer, 'Failed to decode tag of "' + tag + '"'); + if (buffer.isError(decodedTag)) return decodedTag; + var len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of "' + tag + '"'); // Failure + + if (buffer.isError(len)) return len; + + if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + 'of' !== tag) { + return buffer.error('Failed to match tag: "' + tag + '"'); + } + + if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: "' + tag + '"'); // Indefinite length... find END tag + + var state = buffer.save(); + + var res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: "' + this.tag + '"'); + + if (buffer.isError(res)) return res; + len = buffer.offset - state.offset; + buffer.restore(state); + return buffer.skip(len, 'Failed to match body of: "' + tag + '"'); +}; + +DERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) { + for (;;) { + var tag = derDecodeTag(buffer, fail); + if (buffer.isError(tag)) return tag; + var len = derDecodeLen(buffer, tag.primitive, fail); + if (buffer.isError(len)) return len; + var res = void 0; + if (tag.primitive || len !== null) res = buffer.skip(len);else res = this._skipUntilEnd(buffer, fail); // Failure + + if (buffer.isError(res)) return res; + if (tag.tagStr === 'end') break; + } +}; + +DERNode.prototype._decodeList = function decodeList(buffer, tag, decoder, options) { + var result = []; + + while (!buffer.isEmpty()) { + var possibleEnd = this._peekTag(buffer, 'end'); + + if (buffer.isError(possibleEnd)) return possibleEnd; + var res = decoder.decode(buffer, 'der', options); + if (buffer.isError(res) && possibleEnd) break; + result.push(res); + } + + return result; +}; + +DERNode.prototype._decodeStr = function decodeStr(buffer, tag) { + if (tag === 'bitstr') { + var unused = buffer.readUInt8(); + if (buffer.isError(unused)) return unused; + return { + unused: unused, + data: buffer.raw() + }; + } else if (tag === 'bmpstr') { + var raw = buffer.raw(); + if (raw.length % 2 === 1) return buffer.error('Decoding of string type: bmpstr length mismatch'); + var str = ''; + + for (var i = 0; i < raw.length / 2; i++) { + str += String.fromCharCode(raw.readUInt16BE(i * 2)); + } + + return str; + } else if (tag === 'numstr') { + var numstr = buffer.raw().toString('ascii'); + + if (!this._isNumstr(numstr)) { + return buffer.error('Decoding of string type: ' + 'numstr unsupported characters'); + } + + return numstr; + } else if (tag === 'octstr') { + return buffer.raw(); + } else if (tag === 'objDesc') { + return buffer.raw(); + } else if (tag === 'printstr') { + var printstr = buffer.raw().toString('ascii'); + + if (!this._isPrintstr(printstr)) { + return buffer.error('Decoding of string type: ' + 'printstr unsupported characters'); + } + + return printstr; + } else if (/str$/.test(tag)) { + return buffer.raw().toString(); + } else { + return buffer.error('Decoding of string type: ' + tag + ' unsupported'); + } +}; + +DERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) { + var result; + var identifiers = []; + var ident = 0; + var subident = 0; + + while (!buffer.isEmpty()) { + subident = buffer.readUInt8(); + ident <<= 7; + ident |= subident & 0x7f; + + if ((subident & 0x80) === 0) { + identifiers.push(ident); + ident = 0; + } + } + + if (subident & 0x80) identifiers.push(ident); + var first = identifiers[0] / 40 | 0; + var second = identifiers[0] % 40; + if (relative) result = identifiers;else result = [first, second].concat(identifiers.slice(1)); + + if (values) { + var tmp = values[result.join(' ')]; + if (tmp === undefined) tmp = values[result.join('.')]; + if (tmp !== undefined) result = tmp; + } + + return result; +}; + +DERNode.prototype._decodeTime = function decodeTime(buffer, tag) { + var str = buffer.raw().toString(); + var year; + var mon; + var day; + var hour; + var min; + var sec; + + if (tag === 'gentime') { + year = str.slice(0, 4) | 0; + mon = str.slice(4, 6) | 0; + day = str.slice(6, 8) | 0; + hour = str.slice(8, 10) | 0; + min = str.slice(10, 12) | 0; + sec = str.slice(12, 14) | 0; + } else if (tag === 'utctime') { + year = str.slice(0, 2) | 0; + mon = str.slice(2, 4) | 0; + day = str.slice(4, 6) | 0; + hour = str.slice(6, 8) | 0; + min = str.slice(8, 10) | 0; + sec = str.slice(10, 12) | 0; + if (year < 70) year = 2000 + year;else year = 1900 + year; + } else { + return buffer.error('Decoding ' + tag + ' time is not supported yet'); + } + + return Date.UTC(year, mon - 1, day, hour, min, sec, 0); +}; + +DERNode.prototype._decodeNull = function decodeNull() { + return null; +}; + +DERNode.prototype._decodeBool = function decodeBool(buffer) { + var res = buffer.readUInt8(); + if (buffer.isError(res)) return res;else return res !== 0; +}; + +DERNode.prototype._decodeInt = function decodeInt(buffer, values) { + // Bigint, return as it is (assume big endian) + var raw = buffer.raw(); + var res = new bignum(raw); + if (values) res = values[res.toString(10)] || res; + return res; +}; + +DERNode.prototype._use = function use(entity, obj) { + if (typeof entity === 'function') entity = entity(obj); + return entity._getDecoder('der').tree; +}; // Utility methods + + +function derDecodeTag(buf, fail) { + var tag = buf.readUInt8(fail); + if (buf.isError(tag)) return tag; + var cls = der.tagClass[tag >> 6]; + var primitive = (tag & 0x20) === 0; // Multi-octet tag - load + + if ((tag & 0x1f) === 0x1f) { + var oct = tag; + tag = 0; + + while ((oct & 0x80) === 0x80) { + oct = buf.readUInt8(fail); + if (buf.isError(oct)) return oct; + tag <<= 7; + tag |= oct & 0x7f; + } + } else { + tag &= 0x1f; + } + + var tagStr = der.tag[tag]; + return { + cls: cls, + primitive: primitive, + tag: tag, + tagStr: tagStr + }; +} + +function derDecodeLen(buf, primitive, fail) { + var len = buf.readUInt8(fail); + if (buf.isError(len)) return len; // Indefinite form + + if (!primitive && len === 0x80) return null; // Definite form + + if ((len & 0x80) === 0) { + // Short form + return len; + } // Long form + + + var num = len & 0x7f; + if (num > 4) return buf.error('length octect is too long'); + len = 0; + + for (var i = 0; i < num; i++) { + len <<= 8; + var j = buf.readUInt8(fail); + if (buf.isError(j)) return j; + len |= j; + } + + return len; +} + +/***/ }), +/* 124 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var inherits = __webpack_require__(2); + +var Buffer = __webpack_require__(0).Buffer; + +var asn1 = __webpack_require__(29); + +var base = asn1.base; // Import DER constants + +var der = asn1.constants.der; + +function DEREncoder(entity) { + this.enc = 'der'; + this.name = entity.name; + this.entity = entity; // Construct base tree + + this.tree = new DERNode(); + + this.tree._init(entity.body); +} + +module.exports = DEREncoder; + +DEREncoder.prototype.encode = function encode(data, reporter) { + return this.tree._encode(data, reporter).join(); +}; // Tree methods + + +function DERNode(parent) { + base.Node.call(this, 'der', parent); +} + +inherits(DERNode, base.Node); + +DERNode.prototype._encodeComposite = function encodeComposite(tag, primitive, cls, content) { + var encodedTag = encodeTag(tag, primitive, cls, this.reporter); // Short form + + if (content.length < 0x80) { + var _header = new Buffer(2); + + _header[0] = encodedTag; + _header[1] = content.length; + return this._createEncoderBuffer([_header, content]); + } // Long form + // Count octets required to store length + + + var lenOctets = 1; + + for (var i = content.length; i >= 0x100; i >>= 8) { + lenOctets++; + } + + var header = new Buffer(1 + 1 + lenOctets); + header[0] = encodedTag; + header[1] = 0x80 | lenOctets; + + for (var _i = 1 + lenOctets, j = content.length; j > 0; _i--, j >>= 8) { + header[_i] = j & 0xff; + } + + return this._createEncoderBuffer([header, content]); +}; + +DERNode.prototype._encodeStr = function encodeStr(str, tag) { + if (tag === 'bitstr') { + return this._createEncoderBuffer([str.unused | 0, str.data]); + } else if (tag === 'bmpstr') { + var buf = new Buffer(str.length * 2); + + for (var i = 0; i < str.length; i++) { + buf.writeUInt16BE(str.charCodeAt(i), i * 2); + } + + return this._createEncoderBuffer(buf); + } else if (tag === 'numstr') { + if (!this._isNumstr(str)) { + return this.reporter.error('Encoding of string type: numstr supports ' + 'only digits and space'); + } + + return this._createEncoderBuffer(str); + } else if (tag === 'printstr') { + if (!this._isPrintstr(str)) { + return this.reporter.error('Encoding of string type: printstr supports ' + 'only latin upper and lower case letters, ' + 'digits, space, apostrophe, left and rigth ' + 'parenthesis, plus sign, comma, hyphen, ' + 'dot, slash, colon, equal sign, ' + 'question mark'); + } + + return this._createEncoderBuffer(str); + } else if (/str$/.test(tag)) { + return this._createEncoderBuffer(str); + } else if (tag === 'objDesc') { + return this._createEncoderBuffer(str); + } else { + return this.reporter.error('Encoding of string type: ' + tag + ' unsupported'); + } +}; + +DERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) { + if (typeof id === 'string') { + if (!values) return this.reporter.error('string objid given, but no values map found'); + if (!values.hasOwnProperty(id)) return this.reporter.error('objid not found in values map'); + id = values[id].split(/[\s.]+/g); + + for (var i = 0; i < id.length; i++) { + id[i] |= 0; + } + } else if (Array.isArray(id)) { + id = id.slice(); + + for (var _i2 = 0; _i2 < id.length; _i2++) { + id[_i2] |= 0; + } + } + + if (!Array.isArray(id)) { + return this.reporter.error('objid() should be either array or string, ' + 'got: ' + JSON.stringify(id)); + } + + if (!relative) { + if (id[1] >= 40) return this.reporter.error('Second objid identifier OOB'); + id.splice(0, 2, id[0] * 40 + id[1]); + } // Count number of octets + + + var size = 0; + + for (var _i3 = 0; _i3 < id.length; _i3++) { + var ident = id[_i3]; + + for (size++; ident >= 0x80; ident >>= 7) { + size++; + } + } + + var objid = new Buffer(size); + var offset = objid.length - 1; + + for (var _i4 = id.length - 1; _i4 >= 0; _i4--) { + var _ident = id[_i4]; + objid[offset--] = _ident & 0x7f; + + while ((_ident >>= 7) > 0) { + objid[offset--] = 0x80 | _ident & 0x7f; + } + } + + return this._createEncoderBuffer(objid); +}; + +function two(num) { + if (num < 10) return '0' + num;else return num; +} + +DERNode.prototype._encodeTime = function encodeTime(time, tag) { + var str; + var date = new Date(time); + + if (tag === 'gentime') { + str = [two(date.getUTCFullYear()), two(date.getUTCMonth() + 1), two(date.getUTCDate()), two(date.getUTCHours()), two(date.getUTCMinutes()), two(date.getUTCSeconds()), 'Z'].join(''); + } else if (tag === 'utctime') { + str = [two(date.getUTCFullYear() % 100), two(date.getUTCMonth() + 1), two(date.getUTCDate()), two(date.getUTCHours()), two(date.getUTCMinutes()), two(date.getUTCSeconds()), 'Z'].join(''); + } else { + this.reporter.error('Encoding ' + tag + ' time is not supported yet'); + } + + return this._encodeStr(str, 'octstr'); +}; + +DERNode.prototype._encodeNull = function encodeNull() { + return this._createEncoderBuffer(''); +}; + +DERNode.prototype._encodeInt = function encodeInt(num, values) { + if (typeof num === 'string') { + if (!values) return this.reporter.error('String int or enum given, but no values map'); + + if (!values.hasOwnProperty(num)) { + return this.reporter.error('Values map doesn\'t contain: ' + JSON.stringify(num)); + } + + num = values[num]; + } // Bignum, assume big endian + + + if (typeof num !== 'number' && !Buffer.isBuffer(num)) { + var numArray = num.toArray(); + + if (!num.sign && numArray[0] & 0x80) { + numArray.unshift(0); + } + + num = new Buffer(numArray); + } + + if (Buffer.isBuffer(num)) { + var _size = num.length; + if (num.length === 0) _size++; + + var _out = new Buffer(_size); + + num.copy(_out); + if (num.length === 0) _out[0] = 0; + return this._createEncoderBuffer(_out); + } + + if (num < 0x80) return this._createEncoderBuffer(num); + if (num < 0x100) return this._createEncoderBuffer([0, num]); + var size = 1; + + for (var i = num; i >= 0x100; i >>= 8) { + size++; + } + + var out = new Array(size); + + for (var _i5 = out.length - 1; _i5 >= 0; _i5--) { + out[_i5] = num & 0xff; + num >>= 8; + } + + if (out[0] & 0x80) { + out.unshift(0); + } + + return this._createEncoderBuffer(new Buffer(out)); +}; + +DERNode.prototype._encodeBool = function encodeBool(value) { + return this._createEncoderBuffer(value ? 0xff : 0); +}; + +DERNode.prototype._use = function use(entity, obj) { + if (typeof entity === 'function') entity = entity(obj); + return entity._getEncoder('der').tree; +}; + +DERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) { + var state = this._baseState; + var i; + if (state['default'] === null) return false; + var data = dataBuffer.join(); + if (state.defaultBuffer === undefined) state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join(); + if (data.length !== state.defaultBuffer.length) return false; + + for (i = 0; i < data.length; i++) { + if (data[i] !== state.defaultBuffer[i]) return false; + } + + return true; +}; // Utility methods + + +function encodeTag(tag, primitive, cls, reporter) { + var res; + if (tag === 'seqof') tag = 'seq';else if (tag === 'setof') tag = 'set'; + if (der.tagByName.hasOwnProperty(tag)) res = der.tagByName[tag];else if (typeof tag === 'number' && (tag | 0) === tag) res = tag;else return reporter.error('Unknown tag: ' + tag); + if (res >= 0x1f) return reporter.error('Multi-octet tag encoding unsupported'); + if (!primitive) res |= 0x20; + res |= der.tagClassByName[cls || 'universal'] << 6; + return res; +} + +/***/ }), +/* 125 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var BN = __webpack_require__(29).bignum; // Convert a BN.js instance to a base64 encoded string without padding +// Adapted from https://tools.ietf.org/html/draft-ietf-jose-json-web-signature-41#appendix-C + + +exports.toBase64 = function toBase64(bn, len) { + // if len is defined then the bytes are leading-0 padded to the length + var s = bn.toArrayLike(Buffer, 'be', len).toString('base64'); + return s.replace(/(=*)$/, '') // Remove any trailing '='s + .replace(/\+/g, '-') // 62nd char of encoding + .replace(/\//g, '_'); // 63rd char of encoding +}; // Convert a base64 encoded string to a BN.js instance + + +exports.toBn = function toBn(str) { + return new BN(Buffer.from(str, 'base64')); +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 126 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var multihash = __webpack_require__(14); + +var crypto = __webpack_require__(270); + +module.exports = Multihashing; +/** + * Hash the given `buf` using the algorithm specified + * by `func`. + * + * @param {Buffer} buf - The value to hash. + * @param {number|string} func - The algorithm to use. + * @param {number} [length] - Optionally trim the result to this length. + * @param {function(Error, Buffer)} callback + * @returns {undefined} + */ + +function Multihashing(buf, func, length, callback) { + if (typeof length === 'function') { + callback = length; + length = undefined; + } + + if (!callback) { + throw new Error('Missing callback'); + } + + Multihashing.digest(buf, func, length, function (err, digest) { + if (err) { + return callback(err); + } + + callback(null, multihash.encode(digest, func, length)); + }); +} +/** + * The `buffer` module for easy use in the browser. + * + * @type {Buffer} + */ + + +Multihashing.Buffer = Buffer; // for browser things + +/** + * Expose multihash itself, to avoid silly double requires. + */ + +Multihashing.multihash = multihash; +/** + * @param {Buffer} buf - The value to hash. + * @param {number|string} func - The algorithm to use. + * @param {number} [length] - Optionally trim the result to this length. + * @param {function(Error, Buffer)} callback + * @returns {undefined} + */ + +Multihashing.digest = function (buf, func, length, callback) { + if (typeof length === 'function') { + callback = length; + length = undefined; + } + + if (!callback) { + throw new Error('Missing callback'); + } + + var cb = callback; + + if (length) { + cb = function cb(err, digest) { + if (err) { + return callback(err); + } + + callback(null, digest.slice(0, length)); + }; + } + + var hash; + + try { + hash = Multihashing.createHash(func); + } catch (err) { + return cb(err); + } + + hash(buf, cb); +}; +/** + * @param {string|number} func + * + * @returns {function} - The to `func` corresponding hash function. + */ + + +Multihashing.createHash = function (func) { + func = multihash.coerceCode(func); + + if (!Multihashing.functions[func]) { + throw new Error('multihash function ' + func + ' not yet supported'); + } + + return Multihashing.functions[func]; +}; +/** + * Mapping of multihash codes to their hashing functions. + * @type {Object} + */ + + +Multihashing.functions = { + // sha1 + 0x11: crypto.sha1, + // sha2-256 + 0x12: crypto.sha2256, + // sha2-512 + 0x13: crypto.sha2512, + // sha3-512 + 0x14: crypto.sha3512, + // sha3-384 + 0x15: crypto.sha3384, + // sha3-256 + 0x16: crypto.sha3256, + // sha3-224 + 0x17: crypto.sha3224, + // shake-128 + 0x18: crypto.shake128, + // shake-256 + 0x19: crypto.shake256, + // keccak-224 + 0x1A: crypto.keccak224, + // keccak-256 + 0x1B: crypto.keccak256, + // keccak-384 + 0x1C: crypto.keccak384, + // keccak-512 + 0x1D: crypto.keccak512, + // murmur3-128 + 0x22: crypto.murmur3128, + // murmur3-32 + 0x23: crypto.murmur332, + // dbl-sha2-256 + 0x56: crypto.dblSha2256 // add blake functions + +}; +crypto.addBlake(Multihashing.functions); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 127 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, Buffer) { + +exports.toCallback = function (doWork) { + return function (input, callback) { + var res; + + try { + res = doWork(input); + } catch (err) { + process.nextTick(callback, err); + return; + } + + process.nextTick(callback, null, res); + }; +}; + +exports.toBuf = function (doWork, other) { + return function (input) { + var result = doWork(input, other); + return Buffer.from(result, 'hex'); + }; +}; + +exports.fromString = function (doWork, other) { + return function (_input) { + var input = Buffer.isBuffer(_input) ? _input.toString() : _input; + return doWork(input, other); + }; +}; + +exports.fromNumberTo32BitBuf = function (doWork, other) { + return function (input) { + var number = doWork(input, other); + var bytes = new Array(4); + + for (var i = 0; i < 4; i++) { + bytes[i] = number & 0xff; + number = number >> 8; + } + + return Buffer.from(bytes); + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(0).Buffer)) + +/***/ }), +/* 128 */ +/***/ (function(module) { + +module.exports = {"COMPRESSED_TYPE_INVALID":"compressed should be a boolean","EC_PRIVATE_KEY_TYPE_INVALID":"private key should be a Buffer","EC_PRIVATE_KEY_LENGTH_INVALID":"private key length is invalid","EC_PRIVATE_KEY_RANGE_INVALID":"private key range is invalid","EC_PRIVATE_KEY_TWEAK_ADD_FAIL":"tweak out of range or resulting private key is invalid","EC_PRIVATE_KEY_TWEAK_MUL_FAIL":"tweak out of range","EC_PRIVATE_KEY_EXPORT_DER_FAIL":"couldn't export to DER format","EC_PRIVATE_KEY_IMPORT_DER_FAIL":"couldn't import from DER format","EC_PUBLIC_KEYS_TYPE_INVALID":"public keys should be an Array","EC_PUBLIC_KEYS_LENGTH_INVALID":"public keys Array should have at least 1 element","EC_PUBLIC_KEY_TYPE_INVALID":"public key should be a Buffer","EC_PUBLIC_KEY_LENGTH_INVALID":"public key length is invalid","EC_PUBLIC_KEY_PARSE_FAIL":"the public key could not be parsed or is invalid","EC_PUBLIC_KEY_CREATE_FAIL":"private was invalid, try again","EC_PUBLIC_KEY_TWEAK_ADD_FAIL":"tweak out of range or resulting public key is invalid","EC_PUBLIC_KEY_TWEAK_MUL_FAIL":"tweak out of range","EC_PUBLIC_KEY_COMBINE_FAIL":"the sum of the public keys is not valid","ECDH_FAIL":"scalar was invalid (zero or overflow)","ECDSA_SIGNATURE_TYPE_INVALID":"signature should be a Buffer","ECDSA_SIGNATURE_LENGTH_INVALID":"signature length is invalid","ECDSA_SIGNATURE_PARSE_FAIL":"couldn't parse signature","ECDSA_SIGNATURE_PARSE_DER_FAIL":"couldn't parse DER signature","ECDSA_SIGNATURE_SERIALIZE_DER_FAIL":"couldn't serialize signature to DER format","ECDSA_SIGN_FAIL":"nonce generation function failed or private key is invalid","ECDSA_RECOVER_FAIL":"couldn't recover public key from signature","MSG32_TYPE_INVALID":"message should be a Buffer","MSG32_LENGTH_INVALID":"message length is invalid","OPTIONS_TYPE_INVALID":"options should be an Object","OPTIONS_DATA_TYPE_INVALID":"options.data should be a Buffer","OPTIONS_DATA_LENGTH_INVALID":"options.data length is invalid","OPTIONS_NONCEFN_TYPE_INVALID":"options.noncefn should be a Function","RECOVERY_ID_TYPE_INVALID":"recovery should be a Number","RECOVERY_ID_VALUE_INVALID":"recovery should have value between -1 and 4","TWEAK_TYPE_INVALID":"tweak should be a Buffer","TWEAK_LENGTH_INVALID":"tweak length is invalid"}; + +/***/ }), +/* 129 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var inherits = __webpack_require__(2); + +var HashBase = __webpack_require__(130); + +var Buffer = __webpack_require__(7).Buffer; + +var ARRAY16 = new Array(16); + +function MD5() { + HashBase.call(this, 64); // state + + this._a = 0x67452301; + this._b = 0xefcdab89; + this._c = 0x98badcfe; + this._d = 0x10325476; +} + +inherits(MD5, HashBase); + +MD5.prototype._update = function () { + var M = ARRAY16; + + for (var i = 0; i < 16; ++i) { + M[i] = this._block.readInt32LE(i * 4); + } + + var a = this._a; + var b = this._b; + var c = this._c; + var d = this._d; + a = fnF(a, b, c, d, M[0], 0xd76aa478, 7); + d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12); + c = fnF(c, d, a, b, M[2], 0x242070db, 17); + b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22); + a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7); + d = fnF(d, a, b, c, M[5], 0x4787c62a, 12); + c = fnF(c, d, a, b, M[6], 0xa8304613, 17); + b = fnF(b, c, d, a, M[7], 0xfd469501, 22); + a = fnF(a, b, c, d, M[8], 0x698098d8, 7); + d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12); + c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17); + b = fnF(b, c, d, a, M[11], 0x895cd7be, 22); + a = fnF(a, b, c, d, M[12], 0x6b901122, 7); + d = fnF(d, a, b, c, M[13], 0xfd987193, 12); + c = fnF(c, d, a, b, M[14], 0xa679438e, 17); + b = fnF(b, c, d, a, M[15], 0x49b40821, 22); + a = fnG(a, b, c, d, M[1], 0xf61e2562, 5); + d = fnG(d, a, b, c, M[6], 0xc040b340, 9); + c = fnG(c, d, a, b, M[11], 0x265e5a51, 14); + b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20); + a = fnG(a, b, c, d, M[5], 0xd62f105d, 5); + d = fnG(d, a, b, c, M[10], 0x02441453, 9); + c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14); + b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20); + a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5); + d = fnG(d, a, b, c, M[14], 0xc33707d6, 9); + c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14); + b = fnG(b, c, d, a, M[8], 0x455a14ed, 20); + a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5); + d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9); + c = fnG(c, d, a, b, M[7], 0x676f02d9, 14); + b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20); + a = fnH(a, b, c, d, M[5], 0xfffa3942, 4); + d = fnH(d, a, b, c, M[8], 0x8771f681, 11); + c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16); + b = fnH(b, c, d, a, M[14], 0xfde5380c, 23); + a = fnH(a, b, c, d, M[1], 0xa4beea44, 4); + d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11); + c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16); + b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23); + a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4); + d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11); + c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16); + b = fnH(b, c, d, a, M[6], 0x04881d05, 23); + a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4); + d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11); + c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16); + b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23); + a = fnI(a, b, c, d, M[0], 0xf4292244, 6); + d = fnI(d, a, b, c, M[7], 0x432aff97, 10); + c = fnI(c, d, a, b, M[14], 0xab9423a7, 15); + b = fnI(b, c, d, a, M[5], 0xfc93a039, 21); + a = fnI(a, b, c, d, M[12], 0x655b59c3, 6); + d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10); + c = fnI(c, d, a, b, M[10], 0xffeff47d, 15); + b = fnI(b, c, d, a, M[1], 0x85845dd1, 21); + a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6); + d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10); + c = fnI(c, d, a, b, M[6], 0xa3014314, 15); + b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21); + a = fnI(a, b, c, d, M[4], 0xf7537e82, 6); + d = fnI(d, a, b, c, M[11], 0xbd3af235, 10); + c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15); + b = fnI(b, c, d, a, M[9], 0xeb86d391, 21); + this._a = this._a + a | 0; + this._b = this._b + b | 0; + this._c = this._c + c | 0; + this._d = this._d + d | 0; +}; + +MD5.prototype._digest = function () { + // create padding and handle blocks + this._block[this._blockOffset++] = 0x80; + + if (this._blockOffset > 56) { + this._block.fill(0, this._blockOffset, 64); + + this._update(); + + this._blockOffset = 0; + } + + this._block.fill(0, this._blockOffset, 56); + + this._block.writeUInt32LE(this._length[0], 56); + + this._block.writeUInt32LE(this._length[1], 60); + + this._update(); // produce result + + + var buffer = Buffer.allocUnsafe(16); + buffer.writeInt32LE(this._a, 0); + buffer.writeInt32LE(this._b, 4); + buffer.writeInt32LE(this._c, 8); + buffer.writeInt32LE(this._d, 12); + return buffer; +}; + +function rotl(x, n) { + return x << n | x >>> 32 - n; +} + +function fnF(a, b, c, d, m, k, s) { + return rotl(a + (b & c | ~b & d) + m + k | 0, s) + b | 0; +} + +function fnG(a, b, c, d, m, k, s) { + return rotl(a + (b & d | c & ~d) + m + k | 0, s) + b | 0; +} + +function fnH(a, b, c, d, m, k, s) { + return rotl(a + (b ^ c ^ d) + m + k | 0, s) + b | 0; +} + +function fnI(a, b, c, d, m, k, s) { + return rotl(a + (c ^ (b | ~d)) + m + k | 0, s) + b | 0; +} + +module.exports = MD5; + +/***/ }), +/* 130 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Buffer = __webpack_require__(7).Buffer; + +var Transform = __webpack_require__(131).Transform; + +var inherits = __webpack_require__(2); + +function throwIfNotStringOrBuffer(val, prefix) { + if (!Buffer.isBuffer(val) && typeof val !== 'string') { + throw new TypeError(prefix + ' must be a string or a buffer'); + } +} + +function HashBase(blockSize) { + Transform.call(this); + this._block = Buffer.allocUnsafe(blockSize); + this._blockSize = blockSize; + this._blockOffset = 0; + this._length = [0, 0, 0, 0]; + this._finalized = false; +} + +inherits(HashBase, Transform); + +HashBase.prototype._transform = function (chunk, encoding, callback) { + var error = null; + + try { + this.update(chunk, encoding); + } catch (err) { + error = err; + } + + callback(error); +}; + +HashBase.prototype._flush = function (callback) { + var error = null; + + try { + this.push(this.digest()); + } catch (err) { + error = err; + } + + callback(error); +}; + +HashBase.prototype.update = function (data, encoding) { + throwIfNotStringOrBuffer(data, 'Data'); + if (this._finalized) throw new Error('Digest already called'); + if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding); // consume data + + var block = this._block; + var offset = 0; + + while (this._blockOffset + data.length - offset >= this._blockSize) { + for (var i = this._blockOffset; i < this._blockSize;) { + block[i++] = data[offset++]; + } + + this._update(); + + this._blockOffset = 0; + } + + while (offset < data.length) { + block[this._blockOffset++] = data[offset++]; + } // update length + + + for (var j = 0, carry = data.length * 8; carry > 0; ++j) { + this._length[j] += carry; + carry = this._length[j] / 0x0100000000 | 0; + if (carry > 0) this._length[j] -= 0x0100000000 * carry; + } + + return this; +}; + +HashBase.prototype._update = function () { + throw new Error('_update is not implemented'); +}; + +HashBase.prototype.digest = function (encoding) { + if (this._finalized) throw new Error('Digest already called'); + this._finalized = true; + + var digest = this._digest(); + + if (encoding !== undefined) digest = digest.toString(encoding); // reset state + + this._block.fill(0); + + this._blockOffset = 0; + + for (var i = 0; i < 4; ++i) { + this._length[i] = 0; + } + + return digest; +}; + +HashBase.prototype._digest = function () { + throw new Error('_digest is not implemented'); +}; + +module.exports = HashBase; + +/***/ }), +/* 131 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +module.exports = Stream; + +var EE = __webpack_require__(30).EventEmitter; + +var inherits = __webpack_require__(2); + +inherits(Stream, EE); +Stream.Readable = __webpack_require__(78); +Stream.Writable = __webpack_require__(285); +Stream.Duplex = __webpack_require__(286); +Stream.Transform = __webpack_require__(287); +Stream.PassThrough = __webpack_require__(288); // Backwards-compat with node 0.4.x + +Stream.Stream = Stream; // old-style streams. Note that the pipe method (the only relevant +// part of this class) is overridden in the Readable class. + +function Stream() { + EE.call(this); +} + +Stream.prototype.pipe = function (dest, options) { + var source = this; + + function ondata(chunk) { + if (dest.writable) { + if (false === dest.write(chunk) && source.pause) { + source.pause(); + } + } + } + + source.on('data', ondata); + + function ondrain() { + if (source.readable && source.resume) { + source.resume(); + } + } + + dest.on('drain', ondrain); // If the 'end' option is not supplied, dest.end() will be called when + // source gets the 'end' or 'close' events. Only dest.end() once. + + if (!dest._isStdio && (!options || options.end !== false)) { + source.on('end', onend); + source.on('close', onclose); + } + + var didOnEnd = false; + + function onend() { + if (didOnEnd) return; + didOnEnd = true; + dest.end(); + } + + function onclose() { + if (didOnEnd) return; + didOnEnd = true; + if (typeof dest.destroy === 'function') dest.destroy(); + } // don't leave dangling pipes when there are errors. + + + function onerror(er) { + cleanup(); + + if (EE.listenerCount(this, 'error') === 0) { + throw er; // Unhandled stream error in pipe. + } + } + + source.on('error', onerror); + dest.on('error', onerror); // remove all the event listeners that were added. + + function cleanup() { + source.removeListener('data', ondata); + dest.removeListener('drain', ondrain); + source.removeListener('end', onend); + source.removeListener('close', onclose); + source.removeListener('error', onerror); + dest.removeListener('error', onerror); + source.removeListener('end', cleanup); + source.removeListener('close', cleanup); + dest.removeListener('close', cleanup); + } + + source.on('end', cleanup); + source.on('close', cleanup); + dest.on('close', cleanup); + dest.emit('pipe', source); // Allow for unix-like usage: A.pipe(B).pipe(C) + + return dest; +}; + +/***/ }), +/* 132 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global, process) {// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + +/**/ + +var pna = __webpack_require__(54); +/**/ + + +module.exports = Readable; +/**/ + +var isArray = __webpack_require__(103); +/**/ + +/**/ + + +var Duplex; +/**/ + +Readable.ReadableState = ReadableState; +/**/ + +var EE = __webpack_require__(30).EventEmitter; + +var EElistenerCount = function EElistenerCount(emitter, type) { + return emitter.listeners(type).length; +}; +/**/ + +/**/ + + +var Stream = __webpack_require__(133); +/**/ + +/**/ + + +var Buffer = __webpack_require__(7).Buffer; + +var OurUint8Array = global.Uint8Array || function () {}; + +function _uint8ArrayToBuffer(chunk) { + return Buffer.from(chunk); +} + +function _isUint8Array(obj) { + return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; +} +/**/ + +/**/ + + +var util = __webpack_require__(39); + +util.inherits = __webpack_require__(2); +/**/ + +/**/ + +var debugUtil = __webpack_require__(281); + +var debug = void 0; + +if (debugUtil && debugUtil.debuglog) { + debug = debugUtil.debuglog('stream'); +} else { + debug = function debug() {}; +} +/**/ + + +var BufferList = __webpack_require__(282); + +var destroyImpl = __webpack_require__(134); + +var StringDecoder; +util.inherits(Readable, Stream); +var kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume']; + +function prependListener(emitter, event, fn) { + // Sadly this is not cacheable as some libraries bundle their own + // event emitter implementation with them. + if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn); // This is a hack to make sure that our error handler is attached before any + // userland ones. NEVER DO THIS. This is here only because this code needs + // to continue to work with older versions of Node.js that do not include + // the prependListener() method. The goal is to eventually remove this hack. + + if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]]; +} + +function ReadableState(options, stream) { + Duplex = Duplex || __webpack_require__(24); + options = options || {}; // Duplex streams are both readable and writable, but share + // the same options object. + // However, some cases require setting options to different + // values for the readable and the writable sides of the duplex stream. + // These options can be provided separately as readableXXX and writableXXX. + + var isDuplex = stream instanceof Duplex; // object stream flag. Used to make read(n) ignore n and to + // make all the buffer merging and length checks go away + + this.objectMode = !!options.objectMode; + if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; // the point at which it stops calling _read() to fill the buffer + // Note: 0 is a valid value, means "don't call _read preemptively ever" + + var hwm = options.highWaterMark; + var readableHwm = options.readableHighWaterMark; + var defaultHwm = this.objectMode ? 16 : 16 * 1024; + if (hwm || hwm === 0) this.highWaterMark = hwm;else if (isDuplex && (readableHwm || readableHwm === 0)) this.highWaterMark = readableHwm;else this.highWaterMark = defaultHwm; // cast to ints. + + this.highWaterMark = Math.floor(this.highWaterMark); // A linked list is used to store data chunks instead of an array because the + // linked list can remove elements from the beginning faster than + // array.shift() + + this.buffer = new BufferList(); + this.length = 0; + this.pipes = null; + this.pipesCount = 0; + this.flowing = null; + this.ended = false; + this.endEmitted = false; + this.reading = false; // a flag to be able to tell if the event 'readable'/'data' is emitted + // immediately, or on a later tick. We set this to true at first, because + // any actions that shouldn't happen until "later" should generally also + // not happen before the first read call. + + this.sync = true; // whenever we return null, then we set a flag to say + // that we're awaiting a 'readable' event emission. + + this.needReadable = false; + this.emittedReadable = false; + this.readableListening = false; + this.resumeScheduled = false; // has it been destroyed + + this.destroyed = false; // Crypto is kind of old and crusty. Historically, its default string + // encoding is 'binary' so we have to make this configurable. + // Everything else in the universe uses 'utf8', though. + + this.defaultEncoding = options.defaultEncoding || 'utf8'; // the number of writers that are awaiting a drain event in .pipe()s + + this.awaitDrain = 0; // if true, a maybeReadMore has been scheduled + + this.readingMore = false; + this.decoder = null; + this.encoding = null; + + if (options.encoding) { + if (!StringDecoder) StringDecoder = __webpack_require__(25).StringDecoder; + this.decoder = new StringDecoder(options.encoding); + this.encoding = options.encoding; + } +} + +function Readable(options) { + Duplex = Duplex || __webpack_require__(24); + if (!(this instanceof Readable)) return new Readable(options); + this._readableState = new ReadableState(options, this); // legacy + + this.readable = true; + + if (options) { + if (typeof options.read === 'function') this._read = options.read; + if (typeof options.destroy === 'function') this._destroy = options.destroy; + } + + Stream.call(this); +} + +Object.defineProperty(Readable.prototype, 'destroyed', { + get: function get() { + if (this._readableState === undefined) { + return false; + } + + return this._readableState.destroyed; + }, + set: function set(value) { + // we ignore the value if the stream + // has not been initialized yet + if (!this._readableState) { + return; + } // backward compatibility, the user is explicitly + // managing destroyed + + + this._readableState.destroyed = value; + } +}); +Readable.prototype.destroy = destroyImpl.destroy; +Readable.prototype._undestroy = destroyImpl.undestroy; + +Readable.prototype._destroy = function (err, cb) { + this.push(null); + cb(err); +}; // Manually shove something into the read() buffer. +// This returns true if the highWaterMark has not been hit yet, +// similar to how Writable.write() returns true if you should +// write() some more. + + +Readable.prototype.push = function (chunk, encoding) { + var state = this._readableState; + var skipChunkCheck; + + if (!state.objectMode) { + if (typeof chunk === 'string') { + encoding = encoding || state.defaultEncoding; + + if (encoding !== state.encoding) { + chunk = Buffer.from(chunk, encoding); + encoding = ''; + } + + skipChunkCheck = true; + } + } else { + skipChunkCheck = true; + } + + return readableAddChunk(this, chunk, encoding, false, skipChunkCheck); +}; // Unshift should *always* be something directly out of read() + + +Readable.prototype.unshift = function (chunk) { + return readableAddChunk(this, chunk, null, true, false); +}; + +function readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) { + var state = stream._readableState; + + if (chunk === null) { + state.reading = false; + onEofChunk(stream, state); + } else { + var er; + if (!skipChunkCheck) er = chunkInvalid(state, chunk); + + if (er) { + stream.emit('error', er); + } else if (state.objectMode || chunk && chunk.length > 0) { + if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) { + chunk = _uint8ArrayToBuffer(chunk); + } + + if (addToFront) { + if (state.endEmitted) stream.emit('error', new Error('stream.unshift() after end event'));else addChunk(stream, state, chunk, true); + } else if (state.ended) { + stream.emit('error', new Error('stream.push() after EOF')); + } else { + state.reading = false; + + if (state.decoder && !encoding) { + chunk = state.decoder.write(chunk); + if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state); + } else { + addChunk(stream, state, chunk, false); + } + } + } else if (!addToFront) { + state.reading = false; + } + } + + return needMoreData(state); +} + +function addChunk(stream, state, chunk, addToFront) { + if (state.flowing && state.length === 0 && !state.sync) { + stream.emit('data', chunk); + stream.read(0); + } else { + // update the buffer info. + state.length += state.objectMode ? 1 : chunk.length; + if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk); + if (state.needReadable) emitReadable(stream); + } + + maybeReadMore(stream, state); +} + +function chunkInvalid(state, chunk) { + var er; + + if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) { + er = new TypeError('Invalid non-string/buffer chunk'); + } + + return er; +} // if it's past the high water mark, we can push in some more. +// Also, if we have no data yet, we can stand some +// more bytes. This is to work around cases where hwm=0, +// such as the repl. Also, if the push() triggered a +// readable event, and the user called read(largeNumber) such that +// needReadable was set, then we ought to push more, so that another +// 'readable' event will be triggered. + + +function needMoreData(state) { + return !state.ended && (state.needReadable || state.length < state.highWaterMark || state.length === 0); +} + +Readable.prototype.isPaused = function () { + return this._readableState.flowing === false; +}; // backwards compatibility. + + +Readable.prototype.setEncoding = function (enc) { + if (!StringDecoder) StringDecoder = __webpack_require__(25).StringDecoder; + this._readableState.decoder = new StringDecoder(enc); + this._readableState.encoding = enc; + return this; +}; // Don't raise the hwm > 8MB + + +var MAX_HWM = 0x800000; + +function computeNewHighWaterMark(n) { + if (n >= MAX_HWM) { + n = MAX_HWM; + } else { + // Get the next highest power of 2 to prevent increasing hwm excessively in + // tiny amounts + n--; + n |= n >>> 1; + n |= n >>> 2; + n |= n >>> 4; + n |= n >>> 8; + n |= n >>> 16; + n++; + } + + return n; +} // This function is designed to be inlinable, so please take care when making +// changes to the function body. + + +function howMuchToRead(n, state) { + if (n <= 0 || state.length === 0 && state.ended) return 0; + if (state.objectMode) return 1; + + if (n !== n) { + // Only flow one buffer at a time + if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length; + } // If we're asking for more than the current hwm, then raise the hwm. + + + if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n); + if (n <= state.length) return n; // Don't have enough + + if (!state.ended) { + state.needReadable = true; + return 0; + } + + return state.length; +} // you can override either this method, or the async _read(n) below. + + +Readable.prototype.read = function (n) { + debug('read', n); + n = parseInt(n, 10); + var state = this._readableState; + var nOrig = n; + if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event, but we + // already have a bunch of data in the buffer, then just trigger + // the 'readable' event and move on. + + if (n === 0 && state.needReadable && (state.length >= state.highWaterMark || state.ended)) { + debug('read: emitReadable', state.length, state.ended); + if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this); + return null; + } + + n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up. + + if (n === 0 && state.ended) { + if (state.length === 0) endReadable(this); + return null; + } // All the actual chunk generation logic needs to be + // *below* the call to _read. The reason is that in certain + // synthetic stream cases, such as passthrough streams, _read + // may be a completely synchronous operation which may change + // the state of the read buffer, providing enough data when + // before there was *not* enough. + // + // So, the steps are: + // 1. Figure out what the state of things will be after we do + // a read from the buffer. + // + // 2. If that resulting state will trigger a _read, then call _read. + // Note that this may be asynchronous, or synchronous. Yes, it is + // deeply ugly to write APIs this way, but that still doesn't mean + // that the Readable class should behave improperly, as streams are + // designed to be sync/async agnostic. + // Take note if the _read call is sync or async (ie, if the read call + // has returned yet), so that we know whether or not it's safe to emit + // 'readable' etc. + // + // 3. Actually pull the requested chunks out of the buffer and return. + // if we need a readable event, then we need to do some reading. + + + var doRead = state.needReadable; + debug('need readable', doRead); // if we currently have less than the highWaterMark, then also read some + + if (state.length === 0 || state.length - n < state.highWaterMark) { + doRead = true; + debug('length less than watermark', doRead); + } // however, if we've ended, then there's no point, and if we're already + // reading, then it's unnecessary. + + + if (state.ended || state.reading) { + doRead = false; + debug('reading or ended', doRead); + } else if (doRead) { + debug('do read'); + state.reading = true; + state.sync = true; // if the length is currently zero, then we *need* a readable event. + + if (state.length === 0) state.needReadable = true; // call internal read method + + this._read(state.highWaterMark); + + state.sync = false; // If _read pushed data synchronously, then `reading` will be false, + // and we need to re-evaluate how much data we can return to the user. + + if (!state.reading) n = howMuchToRead(nOrig, state); + } + + var ret; + if (n > 0) ret = fromList(n, state);else ret = null; + + if (ret === null) { + state.needReadable = true; + n = 0; + } else { + state.length -= n; + } + + if (state.length === 0) { + // If we have nothing in the buffer, then we want to know + // as soon as we *do* get something into the buffer. + if (!state.ended) state.needReadable = true; // If we tried to read() past the EOF, then emit end on the next tick. + + if (nOrig !== n && state.ended) endReadable(this); + } + + if (ret !== null) this.emit('data', ret); + return ret; +}; + +function onEofChunk(stream, state) { + if (state.ended) return; + + if (state.decoder) { + var chunk = state.decoder.end(); + + if (chunk && chunk.length) { + state.buffer.push(chunk); + state.length += state.objectMode ? 1 : chunk.length; + } + } + + state.ended = true; // emit 'readable' now to make sure it gets picked up. + + emitReadable(stream); +} // Don't emit readable right away in sync mode, because this can trigger +// another read() call => stack overflow. This way, it might trigger +// a nextTick recursion warning, but that's not so bad. + + +function emitReadable(stream) { + var state = stream._readableState; + state.needReadable = false; + + if (!state.emittedReadable) { + debug('emitReadable', state.flowing); + state.emittedReadable = true; + if (state.sync) pna.nextTick(emitReadable_, stream);else emitReadable_(stream); + } +} + +function emitReadable_(stream) { + debug('emit readable'); + stream.emit('readable'); + flow(stream); +} // at this point, the user has presumably seen the 'readable' event, +// and called read() to consume some data. that may have triggered +// in turn another _read(n) call, in which case reading = true if +// it's in progress. +// However, if we're not ended, or reading, and the length < hwm, +// then go ahead and try to read some more preemptively. + + +function maybeReadMore(stream, state) { + if (!state.readingMore) { + state.readingMore = true; + pna.nextTick(maybeReadMore_, stream, state); + } +} + +function maybeReadMore_(stream, state) { + var len = state.length; + + while (!state.reading && !state.flowing && !state.ended && state.length < state.highWaterMark) { + debug('maybeReadMore read 0'); + stream.read(0); + if (len === state.length) // didn't get any data, stop spinning. + break;else len = state.length; + } + + state.readingMore = false; +} // abstract method. to be overridden in specific implementation classes. +// call cb(er, data) where data is <= n in length. +// for virtual (non-string, non-buffer) streams, "length" is somewhat +// arbitrary, and perhaps not very meaningful. + + +Readable.prototype._read = function (n) { + this.emit('error', new Error('_read() is not implemented')); +}; + +Readable.prototype.pipe = function (dest, pipeOpts) { + var src = this; + var state = this._readableState; + + switch (state.pipesCount) { + case 0: + state.pipes = dest; + break; + + case 1: + state.pipes = [state.pipes, dest]; + break; + + default: + state.pipes.push(dest); + break; + } + + state.pipesCount += 1; + debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); + var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr; + var endFn = doEnd ? onend : unpipe; + if (state.endEmitted) pna.nextTick(endFn);else src.once('end', endFn); + dest.on('unpipe', onunpipe); + + function onunpipe(readable, unpipeInfo) { + debug('onunpipe'); + + if (readable === src) { + if (unpipeInfo && unpipeInfo.hasUnpiped === false) { + unpipeInfo.hasUnpiped = true; + cleanup(); + } + } + } + + function onend() { + debug('onend'); + dest.end(); + } // when the dest drains, it reduces the awaitDrain counter + // on the source. This would be more elegant with a .once() + // handler in flow(), but adding and removing repeatedly is + // too slow. + + + var ondrain = pipeOnDrain(src); + dest.on('drain', ondrain); + var cleanedUp = false; + + function cleanup() { + debug('cleanup'); // cleanup event handlers once the pipe is broken + + dest.removeListener('close', onclose); + dest.removeListener('finish', onfinish); + dest.removeListener('drain', ondrain); + dest.removeListener('error', onerror); + dest.removeListener('unpipe', onunpipe); + src.removeListener('end', onend); + src.removeListener('end', unpipe); + src.removeListener('data', ondata); + cleanedUp = true; // if the reader is waiting for a drain event from this + // specific writer, then it would cause it to never start + // flowing again. + // So, if this is awaiting a drain, then we just call it now. + // If we don't know, then assume that we are waiting for one. + + if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain(); + } // If the user pushes more data while we're writing to dest then we'll end up + // in ondata again. However, we only want to increase awaitDrain once because + // dest will only emit one 'drain' event for the multiple writes. + // => Introduce a guard on increasing awaitDrain. + + + var increasedAwaitDrain = false; + src.on('data', ondata); + + function ondata(chunk) { + debug('ondata'); + increasedAwaitDrain = false; + var ret = dest.write(chunk); + + if (false === ret && !increasedAwaitDrain) { + // If the user unpiped during `dest.write()`, it is possible + // to get stuck in a permanently paused state if that write + // also returned false. + // => Check whether `dest` is still a piping destination. + if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) { + debug('false write response, pause', src._readableState.awaitDrain); + src._readableState.awaitDrain++; + increasedAwaitDrain = true; + } + + src.pause(); + } + } // if the dest has an error, then stop piping into it. + // however, don't suppress the throwing behavior for this. + + + function onerror(er) { + debug('onerror', er); + unpipe(); + dest.removeListener('error', onerror); + if (EElistenerCount(dest, 'error') === 0) dest.emit('error', er); + } // Make sure our error handler is attached before userland ones. + + + prependListener(dest, 'error', onerror); // Both close and finish should trigger unpipe, but only once. + + function onclose() { + dest.removeListener('finish', onfinish); + unpipe(); + } + + dest.once('close', onclose); + + function onfinish() { + debug('onfinish'); + dest.removeListener('close', onclose); + unpipe(); + } + + dest.once('finish', onfinish); + + function unpipe() { + debug('unpipe'); + src.unpipe(dest); + } // tell the dest that it's being piped to + + + dest.emit('pipe', src); // start the flow if it hasn't been started already. + + if (!state.flowing) { + debug('pipe resume'); + src.resume(); + } + + return dest; +}; + +function pipeOnDrain(src) { + return function () { + var state = src._readableState; + debug('pipeOnDrain', state.awaitDrain); + if (state.awaitDrain) state.awaitDrain--; + + if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) { + state.flowing = true; + flow(src); + } + }; +} + +Readable.prototype.unpipe = function (dest) { + var state = this._readableState; + var unpipeInfo = { + hasUnpiped: false + }; // if we're not piping anywhere, then do nothing. + + if (state.pipesCount === 0) return this; // just one destination. most common case. + + if (state.pipesCount === 1) { + // passed in one, but it's not the right one. + if (dest && dest !== state.pipes) return this; + if (!dest) dest = state.pipes; // got a match. + + state.pipes = null; + state.pipesCount = 0; + state.flowing = false; + if (dest) dest.emit('unpipe', this, unpipeInfo); + return this; + } // slow case. multiple pipe destinations. + + + if (!dest) { + // remove all. + var dests = state.pipes; + var len = state.pipesCount; + state.pipes = null; + state.pipesCount = 0; + state.flowing = false; + + for (var i = 0; i < len; i++) { + dests[i].emit('unpipe', this, unpipeInfo); + } + + return this; + } // try to find the right one. + + + var index = indexOf(state.pipes, dest); + if (index === -1) return this; + state.pipes.splice(index, 1); + state.pipesCount -= 1; + if (state.pipesCount === 1) state.pipes = state.pipes[0]; + dest.emit('unpipe', this, unpipeInfo); + return this; +}; // set up data events if they are asked for +// Ensure readable listeners eventually get something + + +Readable.prototype.on = function (ev, fn) { + var res = Stream.prototype.on.call(this, ev, fn); + + if (ev === 'data') { + // Start flowing on next tick if stream isn't explicitly paused + if (this._readableState.flowing !== false) this.resume(); + } else if (ev === 'readable') { + var state = this._readableState; + + if (!state.endEmitted && !state.readableListening) { + state.readableListening = state.needReadable = true; + state.emittedReadable = false; + + if (!state.reading) { + pna.nextTick(nReadingNextTick, this); + } else if (state.length) { + emitReadable(this); + } + } + } + + return res; +}; + +Readable.prototype.addListener = Readable.prototype.on; + +function nReadingNextTick(self) { + debug('readable nexttick read 0'); + self.read(0); +} // pause() and resume() are remnants of the legacy readable stream API +// If the user uses them, then switch into old mode. + + +Readable.prototype.resume = function () { + var state = this._readableState; + + if (!state.flowing) { + debug('resume'); + state.flowing = true; + resume(this, state); + } + + return this; +}; + +function resume(stream, state) { + if (!state.resumeScheduled) { + state.resumeScheduled = true; + pna.nextTick(resume_, stream, state); + } +} + +function resume_(stream, state) { + if (!state.reading) { + debug('resume read 0'); + stream.read(0); + } + + state.resumeScheduled = false; + state.awaitDrain = 0; + stream.emit('resume'); + flow(stream); + if (state.flowing && !state.reading) stream.read(0); +} + +Readable.prototype.pause = function () { + debug('call pause flowing=%j', this._readableState.flowing); + + if (false !== this._readableState.flowing) { + debug('pause'); + this._readableState.flowing = false; + this.emit('pause'); + } + + return this; +}; + +function flow(stream) { + var state = stream._readableState; + debug('flow', state.flowing); + + while (state.flowing && stream.read() !== null) {} +} // wrap an old-style stream as the async data source. +// This is *not* part of the readable stream interface. +// It is an ugly unfortunate mess of history. + + +Readable.prototype.wrap = function (stream) { + var _this = this; + + var state = this._readableState; + var paused = false; + stream.on('end', function () { + debug('wrapped end'); + + if (state.decoder && !state.ended) { + var chunk = state.decoder.end(); + if (chunk && chunk.length) _this.push(chunk); + } + + _this.push(null); + }); + stream.on('data', function (chunk) { + debug('wrapped data'); + if (state.decoder) chunk = state.decoder.write(chunk); // don't skip over falsy values in objectMode + + if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return; + + var ret = _this.push(chunk); + + if (!ret) { + paused = true; + stream.pause(); + } + }); // proxy all the other methods. + // important when wrapping filters and duplexes. + + for (var i in stream) { + if (this[i] === undefined && typeof stream[i] === 'function') { + this[i] = function (method) { + return function () { + return stream[method].apply(stream, arguments); + }; + }(i); + } + } // proxy certain important events. + + + for (var n = 0; n < kProxyEvents.length; n++) { + stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n])); + } // when we try to consume some more bytes, simply unpause the + // underlying stream. + + + this._read = function (n) { + debug('wrapped _read', n); + + if (paused) { + paused = false; + stream.resume(); + } + }; + + return this; +}; + +Object.defineProperty(Readable.prototype, 'readableHighWaterMark', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._readableState.highWaterMark; + } +}); // exposed for testing purposes only. + +Readable._fromList = fromList; // Pluck off n bytes from an array of buffers. +// Length is the combined lengths of all the buffers in the list. +// This function is designed to be inlinable, so please take care when making +// changes to the function body. + +function fromList(n, state) { + // nothing buffered + if (state.length === 0) return null; + var ret; + if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) { + // read it all, truncate the list + if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.head.data;else ret = state.buffer.concat(state.length); + state.buffer.clear(); + } else { + // read part of list + ret = fromListPartial(n, state.buffer, state.decoder); + } + return ret; +} // Extracts only enough buffered data to satisfy the amount requested. +// This function is designed to be inlinable, so please take care when making +// changes to the function body. + + +function fromListPartial(n, list, hasStrings) { + var ret; + + if (n < list.head.data.length) { + // slice is the same for buffers and strings + ret = list.head.data.slice(0, n); + list.head.data = list.head.data.slice(n); + } else if (n === list.head.data.length) { + // first chunk is a perfect match + ret = list.shift(); + } else { + // result spans more than one buffer + ret = hasStrings ? copyFromBufferString(n, list) : copyFromBuffer(n, list); + } + + return ret; +} // Copies a specified amount of characters from the list of buffered data +// chunks. +// This function is designed to be inlinable, so please take care when making +// changes to the function body. + + +function copyFromBufferString(n, list) { + var p = list.head; + var c = 1; + var ret = p.data; + n -= ret.length; + + while (p = p.next) { + var str = p.data; + var nb = n > str.length ? str.length : n; + if (nb === str.length) ret += str;else ret += str.slice(0, n); + n -= nb; + + if (n === 0) { + if (nb === str.length) { + ++c; + if (p.next) list.head = p.next;else list.head = list.tail = null; + } else { + list.head = p; + p.data = str.slice(nb); + } + + break; + } + + ++c; + } + + list.length -= c; + return ret; +} // Copies a specified amount of bytes from the list of buffered data chunks. +// This function is designed to be inlinable, so please take care when making +// changes to the function body. + + +function copyFromBuffer(n, list) { + var ret = Buffer.allocUnsafe(n); + var p = list.head; + var c = 1; + p.data.copy(ret); + n -= p.data.length; + + while (p = p.next) { + var buf = p.data; + var nb = n > buf.length ? buf.length : n; + buf.copy(ret, ret.length - n, 0, nb); + n -= nb; + + if (n === 0) { + if (nb === buf.length) { + ++c; + if (p.next) list.head = p.next;else list.head = list.tail = null; + } else { + list.head = p; + p.data = buf.slice(nb); + } + + break; + } + + ++c; + } + + list.length -= c; + return ret; +} + +function endReadable(stream) { + var state = stream._readableState; // If we get here before consuming all the bytes, then that is a + // bug in node. Should never happen. + + if (state.length > 0) throw new Error('"endReadable()" called on non-empty stream'); + + if (!state.endEmitted) { + state.ended = true; + pna.nextTick(endReadableNT, state, stream); + } +} + +function endReadableNT(state, stream) { + // Check that we didn't get one last unshift. + if (!state.endEmitted && state.length === 0) { + state.endEmitted = true; + stream.readable = false; + stream.emit('end'); + } +} + +function indexOf(xs, x) { + for (var i = 0, l = xs.length; i < l; i++) { + if (xs[i] === x) return i; + } + + return -1; +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10), __webpack_require__(6))) + +/***/ }), +/* 133 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = __webpack_require__(30).EventEmitter; + +/***/ }), +/* 134 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + +/**/ + +var pna = __webpack_require__(54); +/**/ +// undocumented cb() API, needed for core, not for public API + + +function destroy(err, cb) { + var _this = this; + + var readableDestroyed = this._readableState && this._readableState.destroyed; + var writableDestroyed = this._writableState && this._writableState.destroyed; + + if (readableDestroyed || writableDestroyed) { + if (cb) { + cb(err); + } else if (err && (!this._writableState || !this._writableState.errorEmitted)) { + pna.nextTick(emitErrorNT, this, err); + } + + return this; + } // we set destroyed to true before firing error callbacks in order + // to make it re-entrance safe in case destroy() is called within callbacks + + + if (this._readableState) { + this._readableState.destroyed = true; + } // if this is a duplex stream mark the writable part as destroyed as well + + + if (this._writableState) { + this._writableState.destroyed = true; + } + + this._destroy(err || null, function (err) { + if (!cb && err) { + pna.nextTick(emitErrorNT, _this, err); + + if (_this._writableState) { + _this._writableState.errorEmitted = true; + } + } else if (cb) { + cb(err); + } + }); + + return this; +} + +function undestroy() { + if (this._readableState) { + this._readableState.destroyed = false; + this._readableState.reading = false; + this._readableState.ended = false; + this._readableState.endEmitted = false; + } + + if (this._writableState) { + this._writableState.destroyed = false; + this._writableState.ended = false; + this._writableState.ending = false; + this._writableState.finished = false; + this._writableState.errorEmitted = false; + } +} + +function emitErrorNT(self, err) { + self.emit('error', err); +} + +module.exports = { + destroy: destroy, + undestroy: undestroy +}; + +/***/ }), +/* 135 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global) { + +/** + * Module exports. + */ +module.exports = deprecate; +/** + * Mark that a method should not be used. + * Returns a modified function which warns once by default. + * + * If `localStorage.noDeprecation = true` is set, then it is a no-op. + * + * If `localStorage.throwDeprecation = true` is set, then deprecated functions + * will throw an Error when invoked. + * + * If `localStorage.traceDeprecation = true` is set, then deprecated functions + * will invoke `console.trace()` instead of `console.error()`. + * + * @param {Function} fn - the function to deprecate + * @param {String} msg - the string to print to the console when `fn` is invoked + * @returns {Function} a new "deprecated" version of `fn` + * @api public + */ + +function deprecate(fn, msg) { + if (config('noDeprecation')) { + return fn; + } + + var warned = false; + + function deprecated() { + if (!warned) { + if (config('throwDeprecation')) { + throw new Error(msg); + } else if (config('traceDeprecation')) { + console.trace(msg); + } else { + console.warn(msg); + } + + warned = true; + } + + return fn.apply(this, arguments); + } + + return deprecated; +} +/** + * Checks `localStorage` for boolean values for the given `name`. + * + * @param {String} name + * @returns {Boolean} + * @api private + */ + + +function config(name) { + // accessing global.localStorage can trigger a DOMException in sandboxed iframes + try { + if (!global.localStorage) return false; + } catch (_) { + return false; + } + + var val = global.localStorage[name]; + if (null == val) return false; + return String(val).toLowerCase() === 'true'; +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10))) + +/***/ }), +/* 136 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// a transform stream is a readable/writable stream where you do +// something with the data. Sometimes it's called a "filter", +// but that's not a great name for it, since that implies a thing where +// some bits pass through, and others are simply ignored. (That would +// be a valid example of a transform, of course.) +// +// While the output is causally related to the input, it's not a +// necessarily symmetric or synchronous transformation. For example, +// a zlib stream might take multiple plain-text writes(), and then +// emit a single compressed chunk some time in the future. +// +// Here's how this works: +// +// The Transform stream has all the aspects of the readable and writable +// stream classes. When you write(chunk), that calls _write(chunk,cb) +// internally, and returns false if there's a lot of pending writes +// buffered up. When you call read(), that calls _read(n) until +// there's enough pending readable data buffered up. +// +// In a transform stream, the written data is placed in a buffer. When +// _read(n) is called, it transforms the queued up data, calling the +// buffered _write cb's as it consumes chunks. If consuming a single +// written chunk would result in multiple output chunks, then the first +// outputted bit calls the readcb, and subsequent chunks just go into +// the read buffer, and will cause it to emit 'readable' if necessary. +// +// This way, back-pressure is actually determined by the reading side, +// since _read has to be called to start processing a new chunk. However, +// a pathological inflate type of transform can cause excessive buffering +// here. For example, imagine a stream where every byte of input is +// interpreted as an integer from 0-255, and then results in that many +// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in +// 1kb of data being output. In this case, you could write a very small +// amount of input, and end up with a very large amount of output. In +// such a pathological inflating mechanism, there'd be no way to tell +// the system to stop doing the transform. A single 4MB write could +// cause the system to run out of memory. +// +// However, even in such a pathological case, only a single written chunk +// would be consumed, and then the rest would wait (un-transformed) until +// the results of the previous transformed chunk were consumed. + + +module.exports = Transform; + +var Duplex = __webpack_require__(24); +/**/ + + +var util = __webpack_require__(39); + +util.inherits = __webpack_require__(2); +/**/ + +util.inherits(Transform, Duplex); + +function afterTransform(er, data) { + var ts = this._transformState; + ts.transforming = false; + var cb = ts.writecb; + + if (!cb) { + return this.emit('error', new Error('write callback called multiple times')); + } + + ts.writechunk = null; + ts.writecb = null; + if (data != null) // single equals check for both `null` and `undefined` + this.push(data); + cb(er); + var rs = this._readableState; + rs.reading = false; + + if (rs.needReadable || rs.length < rs.highWaterMark) { + this._read(rs.highWaterMark); + } +} + +function Transform(options) { + if (!(this instanceof Transform)) return new Transform(options); + Duplex.call(this, options); + this._transformState = { + afterTransform: afterTransform.bind(this), + needTransform: false, + transforming: false, + writecb: null, + writechunk: null, + writeencoding: null + }; // start out asking for a readable event once data is transformed. + + this._readableState.needReadable = true; // we have implemented the _read method, and done the other things + // that Readable wants before the first _read call, so unset the + // sync guard flag. + + this._readableState.sync = false; + + if (options) { + if (typeof options.transform === 'function') this._transform = options.transform; + if (typeof options.flush === 'function') this._flush = options.flush; + } // When the writable side finishes, then flush out anything remaining. + + + this.on('prefinish', prefinish); +} + +function prefinish() { + var _this = this; + + if (typeof this._flush === 'function') { + this._flush(function (er, data) { + done(_this, er, data); + }); + } else { + done(this, null, null); + } +} + +Transform.prototype.push = function (chunk, encoding) { + this._transformState.needTransform = false; + return Duplex.prototype.push.call(this, chunk, encoding); +}; // This is the part where you do stuff! +// override this function in implementation classes. +// 'chunk' is an input chunk. +// +// Call `push(newChunk)` to pass along transformed output +// to the readable side. You may call 'push' zero or more times. +// +// Call `cb(err)` when you are done with this chunk. If you pass +// an error, then that'll put the hurt on the whole operation. If you +// never call cb(), then you'll never get another chunk. + + +Transform.prototype._transform = function (chunk, encoding, cb) { + throw new Error('_transform() is not implemented'); +}; + +Transform.prototype._write = function (chunk, encoding, cb) { + var ts = this._transformState; + ts.writecb = cb; + ts.writechunk = chunk; + ts.writeencoding = encoding; + + if (!ts.transforming) { + var rs = this._readableState; + if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark); + } +}; // Doesn't matter what the args are here. +// _transform does all the work. +// That we got here means that the readable side wants more data. + + +Transform.prototype._read = function (n) { + var ts = this._transformState; + + if (ts.writechunk !== null && ts.writecb && !ts.transforming) { + ts.transforming = true; + + this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform); + } else { + // mark that we need a transform, so that any data that comes in + // will get processed, now that we've asked for it. + ts.needTransform = true; + } +}; + +Transform.prototype._destroy = function (err, cb) { + var _this2 = this; + + Duplex.prototype._destroy.call(this, err, function (err2) { + cb(err2); + + _this2.emit('close'); + }); +}; + +function done(stream, er, data) { + if (er) return stream.emit('error', er); + if (data != null) // single equals check for both `null` and `undefined` + stream.push(data); // if there's nothing in the write buffer, then that means + // that nothing more will ever be provided + + if (stream._writableState.length) throw new Error('Calling transform done when ws.length != 0'); + if (stream._transformState.transforming) throw new Error('Calling transform done when still transforming'); + return stream.push(null); +} + +/***/ }), +/* 137 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Buffer = __webpack_require__(0).Buffer; + +var inherits = __webpack_require__(2); + +var HashBase = __webpack_require__(130); + +var ARRAY16 = new Array(16); +var zl = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]; +var zr = [5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]; +var sl = [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12, 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6]; +var sr = [8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8, 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11]; +var hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]; +var hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]; + +function RIPEMD160() { + HashBase.call(this, 64); // state + + this._a = 0x67452301; + this._b = 0xefcdab89; + this._c = 0x98badcfe; + this._d = 0x10325476; + this._e = 0xc3d2e1f0; +} + +inherits(RIPEMD160, HashBase); + +RIPEMD160.prototype._update = function () { + var words = ARRAY16; + + for (var j = 0; j < 16; ++j) { + words[j] = this._block.readInt32LE(j * 4); + } + + var al = this._a | 0; + var bl = this._b | 0; + var cl = this._c | 0; + var dl = this._d | 0; + var el = this._e | 0; + var ar = this._a | 0; + var br = this._b | 0; + var cr = this._c | 0; + var dr = this._d | 0; + var er = this._e | 0; // computation + + for (var i = 0; i < 80; i += 1) { + var tl; + var tr; + + if (i < 16) { + tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i]); + tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i]); + } else if (i < 32) { + tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i]); + tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i]); + } else if (i < 48) { + tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i]); + tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i]); + } else if (i < 64) { + tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i]); + tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i]); + } else { + // if (i<80) { + tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i]); + tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]); + } + + al = el; + el = dl; + dl = rotl(cl, 10); + cl = bl; + bl = tl; + ar = er; + er = dr; + dr = rotl(cr, 10); + cr = br; + br = tr; + } // update state + + + var t = this._b + cl + dr | 0; + this._b = this._c + dl + er | 0; + this._c = this._d + el + ar | 0; + this._d = this._e + al + br | 0; + this._e = this._a + bl + cr | 0; + this._a = t; +}; + +RIPEMD160.prototype._digest = function () { + // create padding and handle blocks + this._block[this._blockOffset++] = 0x80; + + if (this._blockOffset > 56) { + this._block.fill(0, this._blockOffset, 64); + + this._update(); + + this._blockOffset = 0; + } + + this._block.fill(0, this._blockOffset, 56); + + this._block.writeUInt32LE(this._length[0], 56); + + this._block.writeUInt32LE(this._length[1], 60); + + this._update(); // produce result + + + var buffer = Buffer.alloc ? Buffer.alloc(20) : new Buffer(20); + buffer.writeInt32LE(this._a, 0); + buffer.writeInt32LE(this._b, 4); + buffer.writeInt32LE(this._c, 8); + buffer.writeInt32LE(this._d, 12); + buffer.writeInt32LE(this._e, 16); + return buffer; +}; + +function rotl(x, n) { + return x << n | x >>> 32 - n; +} + +function fn1(a, b, c, d, e, m, k, s) { + return rotl(a + (b ^ c ^ d) + m + k | 0, s) + e | 0; +} + +function fn2(a, b, c, d, e, m, k, s) { + return rotl(a + (b & c | ~b & d) + m + k | 0, s) + e | 0; +} + +function fn3(a, b, c, d, e, m, k, s) { + return rotl(a + ((b | ~c) ^ d) + m + k | 0, s) + e | 0; +} + +function fn4(a, b, c, d, e, m, k, s) { + return rotl(a + (b & d | c & ~d) + m + k | 0, s) + e | 0; +} + +function fn5(a, b, c, d, e, m, k, s) { + return rotl(a + (b ^ (c | ~d)) + m + k | 0, s) + e | 0; +} + +module.exports = RIPEMD160; + +/***/ }), +/* 138 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var _exports = module.exports = function SHA(algorithm) { + algorithm = algorithm.toLowerCase(); + var Algorithm = _exports[algorithm]; + if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)'); + return new Algorithm(); +}; + +_exports.sha = __webpack_require__(289); +_exports.sha1 = __webpack_require__(290); +_exports.sha224 = __webpack_require__(291); +_exports.sha256 = __webpack_require__(139); +_exports.sha384 = __webpack_require__(292); +_exports.sha512 = __webpack_require__(140); + +/***/ }), +/* 139 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined + * in FIPS 180-2 + * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009. + * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet + * + */ +var inherits = __webpack_require__(2); + +var Hash = __webpack_require__(31); + +var Buffer = __webpack_require__(7).Buffer; + +var K = [0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5, 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA, 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967, 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070, 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3, 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2]; +var W = new Array(64); + +function Sha256() { + this.init(); + this._w = W; // new Array(64) + + Hash.call(this, 64, 56); +} + +inherits(Sha256, Hash); + +Sha256.prototype.init = function () { + this._a = 0x6a09e667; + this._b = 0xbb67ae85; + this._c = 0x3c6ef372; + this._d = 0xa54ff53a; + this._e = 0x510e527f; + this._f = 0x9b05688c; + this._g = 0x1f83d9ab; + this._h = 0x5be0cd19; + return this; +}; + +function ch(x, y, z) { + return z ^ x & (y ^ z); +} + +function maj(x, y, z) { + return x & y | z & (x | y); +} + +function sigma0(x) { + return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10); +} + +function sigma1(x) { + return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7); +} + +function gamma0(x) { + return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ x >>> 3; +} + +function gamma1(x) { + return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ x >>> 10; +} + +Sha256.prototype._update = function (M) { + var W = this._w; + var a = this._a | 0; + var b = this._b | 0; + var c = this._c | 0; + var d = this._d | 0; + var e = this._e | 0; + var f = this._f | 0; + var g = this._g | 0; + var h = this._h | 0; + + for (var i = 0; i < 16; ++i) { + W[i] = M.readInt32BE(i * 4); + } + + for (; i < 64; ++i) { + W[i] = gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16] | 0; + } + + for (var j = 0; j < 64; ++j) { + var T1 = h + sigma1(e) + ch(e, f, g) + K[j] + W[j] | 0; + var T2 = sigma0(a) + maj(a, b, c) | 0; + h = g; + g = f; + f = e; + e = d + T1 | 0; + d = c; + c = b; + b = a; + a = T1 + T2 | 0; + } + + this._a = a + this._a | 0; + this._b = b + this._b | 0; + this._c = c + this._c | 0; + this._d = d + this._d | 0; + this._e = e + this._e | 0; + this._f = f + this._f | 0; + this._g = g + this._g | 0; + this._h = h + this._h | 0; +}; + +Sha256.prototype._hash = function () { + var H = Buffer.allocUnsafe(32); + H.writeInt32BE(this._a, 0); + H.writeInt32BE(this._b, 4); + H.writeInt32BE(this._c, 8); + H.writeInt32BE(this._d, 12); + H.writeInt32BE(this._e, 16); + H.writeInt32BE(this._f, 20); + H.writeInt32BE(this._g, 24); + H.writeInt32BE(this._h, 28); + return H; +}; + +module.exports = Sha256; + +/***/ }), +/* 140 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var inherits = __webpack_require__(2); + +var Hash = __webpack_require__(31); + +var Buffer = __webpack_require__(7).Buffer; + +var K = [0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc, 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118, 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2, 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694, 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65, 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5, 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4, 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70, 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df, 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b, 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30, 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8, 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8, 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3, 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec, 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b, 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178, 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b, 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c, 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817]; +var W = new Array(160); + +function Sha512() { + this.init(); + this._w = W; + Hash.call(this, 128, 112); +} + +inherits(Sha512, Hash); + +Sha512.prototype.init = function () { + this._ah = 0x6a09e667; + this._bh = 0xbb67ae85; + this._ch = 0x3c6ef372; + this._dh = 0xa54ff53a; + this._eh = 0x510e527f; + this._fh = 0x9b05688c; + this._gh = 0x1f83d9ab; + this._hh = 0x5be0cd19; + this._al = 0xf3bcc908; + this._bl = 0x84caa73b; + this._cl = 0xfe94f82b; + this._dl = 0x5f1d36f1; + this._el = 0xade682d1; + this._fl = 0x2b3e6c1f; + this._gl = 0xfb41bd6b; + this._hl = 0x137e2179; + return this; +}; + +function Ch(x, y, z) { + return z ^ x & (y ^ z); +} + +function maj(x, y, z) { + return x & y | z & (x | y); +} + +function sigma0(x, xl) { + return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25); +} + +function sigma1(x, xl) { + return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23); +} + +function Gamma0(x, xl) { + return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ x >>> 7; +} + +function Gamma0l(x, xl) { + return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25); +} + +function Gamma1(x, xl) { + return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ x >>> 6; +} + +function Gamma1l(x, xl) { + return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26); +} + +function getCarry(a, b) { + return a >>> 0 < b >>> 0 ? 1 : 0; +} + +Sha512.prototype._update = function (M) { + var W = this._w; + var ah = this._ah | 0; + var bh = this._bh | 0; + var ch = this._ch | 0; + var dh = this._dh | 0; + var eh = this._eh | 0; + var fh = this._fh | 0; + var gh = this._gh | 0; + var hh = this._hh | 0; + var al = this._al | 0; + var bl = this._bl | 0; + var cl = this._cl | 0; + var dl = this._dl | 0; + var el = this._el | 0; + var fl = this._fl | 0; + var gl = this._gl | 0; + var hl = this._hl | 0; + + for (var i = 0; i < 32; i += 2) { + W[i] = M.readInt32BE(i * 4); + W[i + 1] = M.readInt32BE(i * 4 + 4); + } + + for (; i < 160; i += 2) { + var xh = W[i - 15 * 2]; + var xl = W[i - 15 * 2 + 1]; + var gamma0 = Gamma0(xh, xl); + var gamma0l = Gamma0l(xl, xh); + xh = W[i - 2 * 2]; + xl = W[i - 2 * 2 + 1]; + var gamma1 = Gamma1(xh, xl); + var gamma1l = Gamma1l(xl, xh); // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16] + + var Wi7h = W[i - 7 * 2]; + var Wi7l = W[i - 7 * 2 + 1]; + var Wi16h = W[i - 16 * 2]; + var Wi16l = W[i - 16 * 2 + 1]; + var Wil = gamma0l + Wi7l | 0; + var Wih = gamma0 + Wi7h + getCarry(Wil, gamma0l) | 0; + Wil = Wil + gamma1l | 0; + Wih = Wih + gamma1 + getCarry(Wil, gamma1l) | 0; + Wil = Wil + Wi16l | 0; + Wih = Wih + Wi16h + getCarry(Wil, Wi16l) | 0; + W[i] = Wih; + W[i + 1] = Wil; + } + + for (var j = 0; j < 160; j += 2) { + Wih = W[j]; + Wil = W[j + 1]; + var majh = maj(ah, bh, ch); + var majl = maj(al, bl, cl); + var sigma0h = sigma0(ah, al); + var sigma0l = sigma0(al, ah); + var sigma1h = sigma1(eh, el); + var sigma1l = sigma1(el, eh); // t1 = h + sigma1 + ch + K[j] + W[j] + + var Kih = K[j]; + var Kil = K[j + 1]; + var chh = Ch(eh, fh, gh); + var chl = Ch(el, fl, gl); + var t1l = hl + sigma1l | 0; + var t1h = hh + sigma1h + getCarry(t1l, hl) | 0; + t1l = t1l + chl | 0; + t1h = t1h + chh + getCarry(t1l, chl) | 0; + t1l = t1l + Kil | 0; + t1h = t1h + Kih + getCarry(t1l, Kil) | 0; + t1l = t1l + Wil | 0; + t1h = t1h + Wih + getCarry(t1l, Wil) | 0; // t2 = sigma0 + maj + + var t2l = sigma0l + majl | 0; + var t2h = sigma0h + majh + getCarry(t2l, sigma0l) | 0; + hh = gh; + hl = gl; + gh = fh; + gl = fl; + fh = eh; + fl = el; + el = dl + t1l | 0; + eh = dh + t1h + getCarry(el, dl) | 0; + dh = ch; + dl = cl; + ch = bh; + cl = bl; + bh = ah; + bl = al; + al = t1l + t2l | 0; + ah = t1h + t2h + getCarry(al, t1l) | 0; + } + + this._al = this._al + al | 0; + this._bl = this._bl + bl | 0; + this._cl = this._cl + cl | 0; + this._dl = this._dl + dl | 0; + this._el = this._el + el | 0; + this._fl = this._fl + fl | 0; + this._gl = this._gl + gl | 0; + this._hl = this._hl + hl | 0; + this._ah = this._ah + ah + getCarry(this._al, al) | 0; + this._bh = this._bh + bh + getCarry(this._bl, bl) | 0; + this._ch = this._ch + ch + getCarry(this._cl, cl) | 0; + this._dh = this._dh + dh + getCarry(this._dl, dl) | 0; + this._eh = this._eh + eh + getCarry(this._el, el) | 0; + this._fh = this._fh + fh + getCarry(this._fl, fl) | 0; + this._gh = this._gh + gh + getCarry(this._gl, gl) | 0; + this._hh = this._hh + hh + getCarry(this._hl, hl) | 0; +}; + +Sha512.prototype._hash = function () { + var H = Buffer.allocUnsafe(64); + + function writeInt64BE(h, l, offset) { + H.writeInt32BE(h, offset); + H.writeInt32BE(l, offset + 4); + } + + writeInt64BE(this._ah, this._al, 0); + writeInt64BE(this._bh, this._bl, 8); + writeInt64BE(this._ch, this._cl, 16); + writeInt64BE(this._dh, this._dl, 24); + writeInt64BE(this._eh, this._el, 32); + writeInt64BE(this._fh, this._fl, 40); + writeInt64BE(this._gh, this._gl, 48); + writeInt64BE(this._hh, this._hl, 56); + return H; +}; + +module.exports = Sha512; + +/***/ }), +/* 141 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Buffer = __webpack_require__(7).Buffer; + +var BN = __webpack_require__(55); + +var ECJPoint = __webpack_require__(142); + +function ECPoint(x, y) { + if (x === null && y === null) { + this.x = this.y = null; + this.inf = true; + } else { + this.x = x; + this.y = y; + this.inf = false; + } +} + +ECPoint.fromPublicKey = function (publicKey) { + var first = publicKey[0]; + var x; + var y; + + if (publicKey.length === 33 && (first === 0x02 || first === 0x03)) { + x = BN.fromBuffer(publicKey.slice(1, 33)); // overflow + + if (x.ucmp(BN.p) >= 0) return null; // create from X + + y = x.redSqr().redMul(x).redIAdd7().redSqrt(); + if (y === null) return null; + if (first === 0x03 !== y.isOdd()) y = y.redNeg(); + return new ECPoint(x, y); + } + + if (publicKey.length === 65 && (first === 0x04 || first === 0x06 || first === 0x07)) { + x = BN.fromBuffer(publicKey.slice(1, 33)); + y = BN.fromBuffer(publicKey.slice(33, 65)); // overflow + + if (x.ucmp(BN.p) >= 0 || y.ucmp(BN.p) >= 0) return null; // is odd flag + + if ((first === 0x06 || first === 0x07) && y.isOdd() !== (first === 0x07)) return null; // x*x*x + 7 = y*y + + if (x.redSqr().redMul(x).redIAdd7().ucmp(y.redSqr()) !== 0) return null; + return new ECPoint(x, y); + } + + return null; +}; + +ECPoint.prototype.toPublicKey = function (compressed) { + var x = this.x; + var y = this.y; + var publicKey; + + if (compressed) { + publicKey = Buffer.alloc(33); + publicKey[0] = y.isOdd() ? 0x03 : 0x02; + x.toBuffer().copy(publicKey, 1); + } else { + publicKey = Buffer.alloc(65); + publicKey[0] = 0x04; + x.toBuffer().copy(publicKey, 1); + y.toBuffer().copy(publicKey, 33); + } + + return publicKey; +}; + +ECPoint.fromECJPoint = function (p) { + if (p.inf) return new ECPoint(null, null); + var zinv = p.z.redInvm(); + var zinv2 = zinv.redSqr(); + var ax = p.x.redMul(zinv2); + var ay = p.y.redMul(zinv2).redMul(zinv); + return new ECPoint(ax, ay); +}; + +ECPoint.prototype.toECJPoint = function () { + if (this.inf) return new ECJPoint(null, null, null); + return new ECJPoint(this.x, this.y, ECJPoint.one); +}; + +ECPoint.prototype.neg = function () { + if (this.inf) return this; + return new ECPoint(this.x, this.y.redNeg()); +}; + +ECPoint.prototype.add = function (p) { + // O + P = P + if (this.inf) return p; // P + O = P + + if (p.inf) return this; + + if (this.x.ucmp(p.x) === 0) { + // P + P = 2P + if (this.y.ucmp(p.y) === 0) return this.dbl(); // P + (-P) = O + + return new ECPoint(null, null); + } // s = (y - yp) / (x - xp) + // nx = s^2 - x - xp + // ny = s * (x - nx) - y + + + var s = this.y.redSub(p.y); + if (!s.isZero()) s = s.redMul(this.x.redSub(p.x).redInvm()); + var nx = s.redSqr().redISub(this.x).redISub(p.x); + var ny = s.redMul(this.x.redSub(nx)).redISub(this.y); + return new ECPoint(nx, ny); +}; + +ECPoint.prototype.dbl = function () { + if (this.inf) return this; // 2P = O + + var yy = this.y.redAdd(this.y); + if (yy.isZero()) return new ECPoint(null, null); // s = (3 * x^2) / (2 * y) + // nx = s^2 - 2*x + // ny = s * (x - nx) - y + + var x2 = this.x.redSqr(); + var s = x2.redAdd(x2).redIAdd(x2).redMul(yy.redInvm()); + var nx = s.redSqr().redISub(this.x.redAdd(this.x)); + var ny = s.redMul(this.x.redSub(nx)).redISub(this.y); + return new ECPoint(nx, ny); +}; + +ECPoint.prototype.mul = function (num) { + // Algorithm 3.36 Window NAF method for point multiplication + var nafPoints = this._getNAFPoints(4); + + var points = nafPoints.points; // Get NAF form + + var naf = num.getNAF(nafPoints.wnd); // Add `this`*(N+1) for every w-NAF index + + var acc = new ECJPoint(null, null, null); + + for (var i = naf.length - 1; i >= 0; i--) { + // Count zeroes + for (var k = 0; i >= 0 && naf[i] === 0; i--, ++k) { + ; + } + + if (i >= 0) k += 1; + acc = acc.dblp(k); + if (i < 0) break; // J +- P + + var z = naf[i]; + + if (z > 0) { + acc = acc.mixedAdd(points[z - 1 >> 1]); + } else { + acc = acc.mixedAdd(points[-z - 1 >> 1].neg()); + } + } + + return ECPoint.fromECJPoint(acc); +}; + +ECPoint.prototype._getNAFPoints1 = function () { + return { + wnd: 1, + points: [this] + }; +}; + +ECPoint.prototype._getNAFPoints = function (wnd) { + var points = new Array((1 << wnd) - 1); + points[0] = this; + var dbl = this.dbl(); + + for (var i = 1; i < points.length; ++i) { + points[i] = points[i - 1].add(dbl); + } + + return { + wnd: wnd, + points: points + }; +}; + +module.exports = ECPoint; + +/***/ }), +/* 142 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var BN = __webpack_require__(55); + +function ECJPoint(x, y, z) { + if (x === null && y === null && z === null) { + this.x = ECJPoint.one; + this.y = ECJPoint.one; + this.z = ECJPoint.zero; + } else { + this.x = x; + this.y = y; + this.z = z; + } + + this.zOne = this.z === ECJPoint.one; +} + +ECJPoint.zero = BN.fromNumber(0); +ECJPoint.one = BN.fromNumber(1); + +ECJPoint.prototype.neg = function () { + if (this.inf) return this; + return new ECJPoint(this.x, this.y.redNeg(), this.z); +}; + +ECJPoint.prototype.add = function (p) { + // O + P = P + if (this.inf) return p; // P + O = P + + if (p.inf) return this; // http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#addition-add-1998-cmo-2 + // 12M + 4S + 7A + + var pz2 = p.z.redSqr(); + var z2 = this.z.redSqr(); + var u1 = this.x.redMul(pz2); + var u2 = p.x.redMul(z2); + var s1 = this.y.redMul(pz2).redMul(p.z); + var s2 = p.y.redMul(z2).redMul(this.z); + var h = u1.redSub(u2); + var r = s1.redSub(s2); + + if (h.isZero()) { + if (r.isZero()) return this.dbl(); + return new ECJPoint(null, null, null); + } + + var h2 = h.redSqr(); + var v = u1.redMul(h2); + var h3 = h2.redMul(h); + var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); + var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); + var nz = this.z.redMul(p.z).redMul(h); + return new ECJPoint(nx, ny, nz); +}; + +ECJPoint.prototype.mixedAdd = function (p) { + // O + P = P + if (this.inf) return p.toECJPoint(); // P + O = P + + if (p.inf) return this; // http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#addition-add-1998-cmo-2 + // with p.z = 1 + // 8M + 3S + 7A + + var z2 = this.z.redSqr(); + var u1 = this.x; + var u2 = p.x.redMul(z2); + var s1 = this.y; + var s2 = p.y.redMul(z2).redMul(this.z); + var h = u1.redSub(u2); + var r = s1.redSub(s2); + + if (h.isZero()) { + if (r.isZero()) return this.dbl(); + return new ECJPoint(null, null, null); + } + + var h2 = h.redSqr(); + var v = u1.redMul(h2); + var h3 = h2.redMul(h); + var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); + var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); + var nz = this.z.redMul(h); + return new ECJPoint(nx, ny, nz); +}; + +ECJPoint.prototype.dbl = function () { + if (this.inf) return this; + var nx; + var ny; + var nz; // Z = 1 + + if (this.zOne) { + // http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#doubling-mdbl-2007-bl + // 1M + 5S + 6A + 3*2 + 1*3 + 1*8 + // XX = X1^2 + var xx = this.x.redSqr(); // YY = Y1^2 + + var yy = this.y.redSqr(); // YYYY = YY^2 + + var yyyy = yy.redSqr(); // S = 2 * ((X1 + YY)^2 - XX - YYYY) + + var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); + s = s.redIAdd(s); // M = 3 * XX + + var m = xx.redAdd(xx).redIAdd(xx); // T = M ^ 2 - 2*S + + var t = m.redSqr().redISub(s).redISub(s); // 8 * YYYY + + var yyyy8 = yyyy.redIAdd(yyyy).redIAdd(yyyy).redIAdd(yyyy); // X3 = T + + nx = t; // Y3 = M * (S - T) - 8 * YYYY + + ny = m.redMul(s.redISub(t)).redISub(yyyy8); // Z3 = 2*Y1 + + nz = this.y.redAdd(this.y); + } else { + // http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#doubling-dbl-2009-l + // 2M + 5S + 6A + 3*2 + 1*3 + 1*8 + // A = X1^2 + var a = this.x.redSqr(); // B = Y1^2 + + var b = this.y.redSqr(); // C = B^2 + + var c = b.redSqr(); // D = 2 * ((X1 + B)^2 - A - C) + + var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c); + d = d.redIAdd(d); // E = 3 * A + + var e = a.redAdd(a).redIAdd(a); // F = E^2 + + var f = e.redSqr(); // 8 * C + + var c8 = c.redIAdd(c).redIAdd(c).redIAdd(c); // X3 = F - 2 * D + + nx = f.redISub(d).redISub(d); // Y3 = E * (D - X3) - 8 * C + + ny = e.redMul(d.redISub(nx)).redISub(c8); // Z3 = 2 * Y1 * Z1 + + nz = this.y.redMul(this.z); + nz = nz.redIAdd(nz); + } + + return new ECJPoint(nx, ny, nz); +}; + +ECJPoint.prototype.dblp = function (pow) { + if (pow === 0 || this.inf) return this; + var point = this; + + for (var i = 0; i < pow; i++) { + point = point.dbl(); + } + + return point; +}; + +Object.defineProperty(ECJPoint.prototype, 'inf', { + enumerable: true, + get: function get() { + return this.z.isZero(); + } +}); +module.exports = ECJPoint; + +/***/ }), +/* 143 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +Object.defineProperty(exports, "__esModule", { + value: true +}); + +var _setImmediate = __webpack_require__(75); + +var _setImmediate2 = _interopRequireDefault(_setImmediate); + +function _interopRequireDefault(obj) { + return obj && obj.__esModule ? obj : { + "default": obj + }; +} +/** + * Calls `callback` on a later loop around the event loop. In Node.js this just + * calls `setImmediate`. In the browser it will use `setImmediate` if + * available, otherwise `setTimeout(callback, 0)`, which means other higher + * priority events may precede the execution of `callback`. + * + * This is used internally for browser-compatibility purposes. + * + * @name setImmediate + * @static + * @memberOf module:Utils + * @method + * @see [async.nextTick]{@link module:Utils.nextTick} + * @category Util + * @param {Function} callback - The function to call on a later loop around + * the event loop. Invoked with (args...). + * @param {...*} args... - any number of additional arguments to pass to the + * callback on the next tick. + * @example + * + * var call_order = []; + * async.nextTick(function() { + * call_order.push('two'); + * // call_order now equals ['one','two'] + * }); + * call_order.push('one'); + * + * async.setImmediate(function (a, b, c) { + * // a, b, and c equal 1, 2, and 3 + * }, 1, 2, 3); + */ + + +exports["default"] = _setImmediate2["default"]; +module.exports = exports['default']; + +/***/ }), +/* 144 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** + * Checks if `value` is the + * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types) + * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`) + * + * @static + * @memberOf _ + * @since 0.1.0 + * @category Lang + * @param {*} value The value to check. + * @returns {boolean} Returns `true` if `value` is an object, else `false`. + * @example + * + * _.isObject({}); + * // => true + * + * _.isObject([1, 2, 3]); + * // => true + * + * _.isObject(_.noop); + * // => true + * + * _.isObject(null); + * // => false + */ +function isObject(value) { + var type = _typeof(value); + + return value != null && (type == 'object' || type == 'function'); +} + +module.exports = isObject; + +/***/ }), +/* 145 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +Object.defineProperty(exports, "__esModule", { + value: true +}); + +exports["default"] = function (tasks, callback) { + callback = (0, _once2["default"])(callback || _noop2["default"]); + if (!(0, _isArray2["default"])(tasks)) return callback(new Error('First argument to waterfall must be an array of functions')); + if (!tasks.length) return callback(); + var taskIndex = 0; + + function nextTask(args) { + var task = (0, _wrapAsync2["default"])(tasks[taskIndex++]); + args.push((0, _onlyOnce2["default"])(next)); + task.apply(null, args); + } + + function next(err + /*, ...args*/ + ) { + if (err || taskIndex === tasks.length) { + return callback.apply(null, arguments); + } + + nextTask((0, _slice2["default"])(arguments, 1)); + } + + nextTask([]); +}; + +var _isArray = __webpack_require__(146); + +var _isArray2 = _interopRequireDefault(_isArray); + +var _noop = __webpack_require__(81); + +var _noop2 = _interopRequireDefault(_noop); + +var _once = __webpack_require__(147); + +var _once2 = _interopRequireDefault(_once); + +var _slice = __webpack_require__(53); + +var _slice2 = _interopRequireDefault(_slice); + +var _onlyOnce = __webpack_require__(82); + +var _onlyOnce2 = _interopRequireDefault(_onlyOnce); + +var _wrapAsync = __webpack_require__(83); + +var _wrapAsync2 = _interopRequireDefault(_wrapAsync); + +function _interopRequireDefault(obj) { + return obj && obj.__esModule ? obj : { + "default": obj + }; +} + +module.exports = exports['default']; +/** + * Runs the `tasks` array of functions in series, each passing their results to + * the next in the array. However, if any of the `tasks` pass an error to their + * own callback, the next function is not executed, and the main `callback` is + * immediately called with the error. + * + * @name waterfall + * @static + * @memberOf module:ControlFlow + * @method + * @category Control Flow + * @param {Array} tasks - An array of [async functions]{@link AsyncFunction} + * to run. + * Each function should complete with any number of `result` values. + * The `result` values will be passed as arguments, in order, to the next task. + * @param {Function} [callback] - An optional callback to run once all the + * functions have completed. This will be passed the results of the last task's + * callback. Invoked with (err, [results]). + * @returns undefined + * @example + * + * async.waterfall([ + * function(callback) { + * callback(null, 'one', 'two'); + * }, + * function(arg1, arg2, callback) { + * // arg1 now equals 'one' and arg2 now equals 'two' + * callback(null, 'three'); + * }, + * function(arg1, callback) { + * // arg1 now equals 'three' + * callback(null, 'done'); + * } + * ], function (err, result) { + * // result now equals 'done' + * }); + * + * // Or, with named functions: + * async.waterfall([ + * myFirstFunction, + * mySecondFunction, + * myLastFunction, + * ], function (err, result) { + * // result now equals 'done' + * }); + * function myFirstFunction(callback) { + * callback(null, 'one', 'two'); + * } + * function mySecondFunction(arg1, arg2, callback) { + * // arg1 now equals 'one' and arg2 now equals 'two' + * callback(null, 'three'); + * } + * function myLastFunction(arg1, callback) { + * // arg1 now equals 'three' + * callback(null, 'done'); + * } + */ + +/***/ }), +/* 146 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** + * Checks if `value` is classified as an `Array` object. + * + * @static + * @memberOf _ + * @since 0.1.0 + * @category Lang + * @param {*} value The value to check. + * @returns {boolean} Returns `true` if `value` is an array, else `false`. + * @example + * + * _.isArray([1, 2, 3]); + * // => true + * + * _.isArray(document.body.children); + * // => false + * + * _.isArray('abc'); + * // => false + * + * _.isArray(_.noop); + * // => false + */ +var isArray = Array.isArray; +module.exports = isArray; + +/***/ }), +/* 147 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +Object.defineProperty(exports, "__esModule", { + value: true +}); +exports["default"] = once; + +function once(fn) { + return function () { + if (fn === null) return; + var callFn = fn; + fn = null; + callFn.apply(this, arguments); + }; +} + +module.exports = exports["default"]; + +/***/ }), +/* 148 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var multiaddr = __webpack_require__(16); + +function ensureMultiaddr(ma) { + if (multiaddr.isMultiaddr(ma)) { + return ma; + } + + return multiaddr(ma); +} + +module.exports = { + ensureMultiaddr: ensureMultiaddr +}; + +/***/ }), +/* 149 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var promisify = __webpack_require__(1); + +var ConcatStream = __webpack_require__(41); + +var once = __webpack_require__(17); + +var _require = __webpack_require__(84), + isSource = _require.isSource; + +var FileResultStreamConverter = __webpack_require__(33); + +var SendFilesStream = __webpack_require__(43); + +var validateAddInput = __webpack_require__(356); + +module.exports = function (send) { + var createAddStream = SendFilesStream(send, 'add'); + var add = promisify(function (_files, options, _callback) { + if (typeof options === 'function') { + _callback = options; + options = null; + } + + var callback = once(_callback); + + if (!options) { + options = {}; + } + + options.converter = FileResultStreamConverter; + + try { + validateAddInput(_files); + } catch (err) { + return callback(err); + } + + var files = [].concat(_files); + var stream = createAddStream({ + qs: options + }); + var concat = ConcatStream(function (result) { + return callback(null, result); + }); + stream.once('error', callback); + stream.pipe(concat); + files.forEach(function (file) { + return stream.write(file); + }); + stream.end(); + }); + return function () { + var args = Array.from(arguments); // If we files.add(), then promisify thinks the pull stream is + // a callback! Add an empty options object in this case so that a promise + // is returned. + + if (args.length === 1 && isSource(args[0])) { + args.push({}); + } + + return add.apply(null, args); + }; +}; + +/***/ }), +/* 150 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global, process) {// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + + +module.exports = Readable; +/**/ + +var Duplex; +/**/ + +Readable.ReadableState = ReadableState; +/**/ + +var EE = __webpack_require__(30).EventEmitter; + +var EElistenerCount = function EElistenerCount(emitter, type) { + return emitter.listeners(type).length; +}; +/**/ + +/**/ + + +var Stream = __webpack_require__(151); +/**/ + + +var Buffer = __webpack_require__(0).Buffer; + +var OurUint8Array = global.Uint8Array || function () {}; + +function _uint8ArrayToBuffer(chunk) { + return Buffer.from(chunk); +} + +function _isUint8Array(obj) { + return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; +} +/**/ + + +var debugUtil = __webpack_require__(313); + +var debug; + +if (debugUtil && debugUtil.debuglog) { + debug = debugUtil.debuglog('stream'); +} else { + debug = function debug() {}; +} +/**/ + + +var BufferList = __webpack_require__(314); + +var destroyImpl = __webpack_require__(152); + +var _require = __webpack_require__(153), + getHighWaterMark = _require.getHighWaterMark; + +var _require$codes = __webpack_require__(42).codes, + ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, + ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF, + ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, + ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; + +var _require2 = __webpack_require__(316), + emitExperimentalWarning = _require2.emitExperimentalWarning; // Lazy loaded to improve the startup performance. + + +var StringDecoder; +var createReadableStreamAsyncIterator; + +__webpack_require__(2)(Readable, Stream); + +var kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume']; + +function prependListener(emitter, event, fn) { + // Sadly this is not cacheable as some libraries bundle their own + // event emitter implementation with them. + if (typeof emitter.prependListener === 'function') return emitter.prependListener(event, fn); // This is a hack to make sure that our error handler is attached before any + // userland ones. NEVER DO THIS. This is here only because this code needs + // to continue to work with older versions of Node.js that do not include + // the prependListener() method. The goal is to eventually remove this hack. + + if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]]; +} + +function ReadableState(options, stream, isDuplex) { + Duplex = Duplex || __webpack_require__(32); + options = options || {}; // Duplex streams are both readable and writable, but share + // the same options object. + // However, some cases require setting options to different + // values for the readable and the writable sides of the duplex stream. + // These options can be provided separately as readableXXX and writableXXX. + + if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag. Used to make read(n) ignore n and to + // make all the buffer merging and length checks go away + + this.objectMode = !!options.objectMode; + if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; // the point at which it stops calling _read() to fill the buffer + // Note: 0 is a valid value, means "don't call _read preemptively ever" + + this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); // A linked list is used to store data chunks instead of an array because the + // linked list can remove elements from the beginning faster than + // array.shift() + + this.buffer = new BufferList(); + this.length = 0; + this.pipes = null; + this.pipesCount = 0; + this.flowing = null; + this.ended = false; + this.endEmitted = false; + this.reading = false; // a flag to be able to tell if the event 'readable'/'data' is emitted + // immediately, or on a later tick. We set this to true at first, because + // any actions that shouldn't happen until "later" should generally also + // not happen before the first read call. + + this.sync = true; // whenever we return null, then we set a flag to say + // that we're awaiting a 'readable' event emission. + + this.needReadable = false; + this.emittedReadable = false; + this.readableListening = false; + this.resumeScheduled = false; + this.paused = true; // Should close be emitted on destroy. Defaults to true. + + this.emitClose = options.emitClose !== false; // has it been destroyed + + this.destroyed = false; // Crypto is kind of old and crusty. Historically, its default string + // encoding is 'binary' so we have to make this configurable. + // Everything else in the universe uses 'utf8', though. + + this.defaultEncoding = options.defaultEncoding || 'utf8'; // the number of writers that are awaiting a drain event in .pipe()s + + this.awaitDrain = 0; // if true, a maybeReadMore has been scheduled + + this.readingMore = false; + this.decoder = null; + this.encoding = null; + + if (options.encoding) { + if (!StringDecoder) StringDecoder = __webpack_require__(25).StringDecoder; + this.decoder = new StringDecoder(options.encoding); + this.encoding = options.encoding; + } +} + +function Readable(options) { + Duplex = Duplex || __webpack_require__(32); + if (!(this instanceof Readable)) return new Readable(options); // Checking for a Stream.Duplex instance is faster here instead of inside + // the ReadableState constructor, at least with V8 6.5 + + var isDuplex = this instanceof Duplex; + this._readableState = new ReadableState(options, this, isDuplex); // legacy + + this.readable = true; + + if (options) { + if (typeof options.read === 'function') this._read = options.read; + if (typeof options.destroy === 'function') this._destroy = options.destroy; + } + + Stream.call(this); +} + +Object.defineProperty(Readable.prototype, 'destroyed', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + if (this._readableState === undefined) { + return false; + } + + return this._readableState.destroyed; + }, + set: function set(value) { + // we ignore the value if the stream + // has not been initialized yet + if (!this._readableState) { + return; + } // backward compatibility, the user is explicitly + // managing destroyed + + + this._readableState.destroyed = value; + } +}); +Readable.prototype.destroy = destroyImpl.destroy; +Readable.prototype._undestroy = destroyImpl.undestroy; + +Readable.prototype._destroy = function (err, cb) { + cb(err); +}; // Manually shove something into the read() buffer. +// This returns true if the highWaterMark has not been hit yet, +// similar to how Writable.write() returns true if you should +// write() some more. + + +Readable.prototype.push = function (chunk, encoding) { + var state = this._readableState; + var skipChunkCheck; + + if (!state.objectMode) { + if (typeof chunk === 'string') { + encoding = encoding || state.defaultEncoding; + + if (encoding !== state.encoding) { + chunk = Buffer.from(chunk, encoding); + encoding = ''; + } + + skipChunkCheck = true; + } + } else { + skipChunkCheck = true; + } + + return readableAddChunk(this, chunk, encoding, false, skipChunkCheck); +}; // Unshift should *always* be something directly out of read() + + +Readable.prototype.unshift = function (chunk) { + return readableAddChunk(this, chunk, null, true, false); +}; + +function readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) { + debug('readableAddChunk', chunk); + var state = stream._readableState; + + if (chunk === null) { + state.reading = false; + onEofChunk(stream, state); + } else { + var er; + if (!skipChunkCheck) er = chunkInvalid(state, chunk); + + if (er) { + stream.emit('error', er); + } else if (state.objectMode || chunk && chunk.length > 0) { + if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) { + chunk = _uint8ArrayToBuffer(chunk); + } + + if (addToFront) { + if (state.endEmitted) stream.emit('error', new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true); + } else if (state.ended) { + stream.emit('error', new ERR_STREAM_PUSH_AFTER_EOF()); + } else if (state.destroyed) { + return false; + } else { + state.reading = false; + + if (state.decoder && !encoding) { + chunk = state.decoder.write(chunk); + if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state); + } else { + addChunk(stream, state, chunk, false); + } + } + } else if (!addToFront) { + state.reading = false; + maybeReadMore(stream, state); + } + } // We can push more data if we are below the highWaterMark. + // Also, if we have no data yet, we can stand some more bytes. + // This is to work around cases where hwm=0, such as the repl. + + + return !state.ended && (state.length < state.highWaterMark || state.length === 0); +} + +function addChunk(stream, state, chunk, addToFront) { + if (state.flowing && state.length === 0 && !state.sync) { + state.awaitDrain = 0; + stream.emit('data', chunk); + } else { + // update the buffer info. + state.length += state.objectMode ? 1 : chunk.length; + if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk); + if (state.needReadable) emitReadable(stream); + } + + maybeReadMore(stream, state); +} + +function chunkInvalid(state, chunk) { + var er; + + if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) { + er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk); + } + + return er; +} + +Readable.prototype.isPaused = function () { + return this._readableState.flowing === false; +}; // backwards compatibility. + + +Readable.prototype.setEncoding = function (enc) { + if (!StringDecoder) StringDecoder = __webpack_require__(25).StringDecoder; + this._readableState.decoder = new StringDecoder(enc); // if setEncoding(null), decoder.encoding equals utf8 + + this._readableState.encoding = this._readableState.decoder.encoding; + return this; +}; // Don't raise the hwm > 8MB + + +var MAX_HWM = 0x800000; + +function computeNewHighWaterMark(n) { + if (n >= MAX_HWM) { + n = MAX_HWM; + } else { + // Get the next highest power of 2 to prevent increasing hwm excessively in + // tiny amounts + n--; + n |= n >>> 1; + n |= n >>> 2; + n |= n >>> 4; + n |= n >>> 8; + n |= n >>> 16; + n++; + } + + return n; +} // This function is designed to be inlinable, so please take care when making +// changes to the function body. + + +function howMuchToRead(n, state) { + if (n <= 0 || state.length === 0 && state.ended) return 0; + if (state.objectMode) return 1; + + if (n !== n) { + // Only flow one buffer at a time + if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length; + } // If we're asking for more than the current hwm, then raise the hwm. + + + if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n); + if (n <= state.length) return n; // Don't have enough + + if (!state.ended) { + state.needReadable = true; + return 0; + } + + return state.length; +} // you can override either this method, or the async _read(n) below. + + +Readable.prototype.read = function (n) { + debug('read', n); + n = parseInt(n, 10); + var state = this._readableState; + var nOrig = n; + if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event, but we + // already have a bunch of data in the buffer, then just trigger + // the 'readable' event and move on. + + if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) { + debug('read: emitReadable', state.length, state.ended); + if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this); + return null; + } + + n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up. + + if (n === 0 && state.ended) { + if (state.length === 0) endReadable(this); + return null; + } // All the actual chunk generation logic needs to be + // *below* the call to _read. The reason is that in certain + // synthetic stream cases, such as passthrough streams, _read + // may be a completely synchronous operation which may change + // the state of the read buffer, providing enough data when + // before there was *not* enough. + // + // So, the steps are: + // 1. Figure out what the state of things will be after we do + // a read from the buffer. + // + // 2. If that resulting state will trigger a _read, then call _read. + // Note that this may be asynchronous, or synchronous. Yes, it is + // deeply ugly to write APIs this way, but that still doesn't mean + // that the Readable class should behave improperly, as streams are + // designed to be sync/async agnostic. + // Take note if the _read call is sync or async (ie, if the read call + // has returned yet), so that we know whether or not it's safe to emit + // 'readable' etc. + // + // 3. Actually pull the requested chunks out of the buffer and return. + // if we need a readable event, then we need to do some reading. + + + var doRead = state.needReadable; + debug('need readable', doRead); // if we currently have less than the highWaterMark, then also read some + + if (state.length === 0 || state.length - n < state.highWaterMark) { + doRead = true; + debug('length less than watermark', doRead); + } // however, if we've ended, then there's no point, and if we're already + // reading, then it's unnecessary. + + + if (state.ended || state.reading) { + doRead = false; + debug('reading or ended', doRead); + } else if (doRead) { + debug('do read'); + state.reading = true; + state.sync = true; // if the length is currently zero, then we *need* a readable event. + + if (state.length === 0) state.needReadable = true; // call internal read method + + this._read(state.highWaterMark); + + state.sync = false; // If _read pushed data synchronously, then `reading` will be false, + // and we need to re-evaluate how much data we can return to the user. + + if (!state.reading) n = howMuchToRead(nOrig, state); + } + + var ret; + if (n > 0) ret = fromList(n, state);else ret = null; + + if (ret === null) { + state.needReadable = true; + n = 0; + } else { + state.length -= n; + state.awaitDrain = 0; + } + + if (state.length === 0) { + // If we have nothing in the buffer, then we want to know + // as soon as we *do* get something into the buffer. + if (!state.ended) state.needReadable = true; // If we tried to read() past the EOF, then emit end on the next tick. + + if (nOrig !== n && state.ended) endReadable(this); + } + + if (ret !== null) this.emit('data', ret); + return ret; +}; + +function onEofChunk(stream, state) { + if (state.ended) return; + + if (state.decoder) { + var chunk = state.decoder.end(); + + if (chunk && chunk.length) { + state.buffer.push(chunk); + state.length += state.objectMode ? 1 : chunk.length; + } + } + + state.ended = true; + + if (state.sync) { + // if we are sync, wait until next tick to emit the data. + // Otherwise we risk emitting data in the flow() + // the readable code triggers during a read() call + emitReadable(stream); + } else { + // emit 'readable' now to make sure it gets picked up. + state.needReadable = false; + + if (!state.emittedReadable) { + state.emittedReadable = true; + emitReadable_(stream); + } + } +} // Don't emit readable right away in sync mode, because this can trigger +// another read() call => stack overflow. This way, it might trigger +// a nextTick recursion warning, but that's not so bad. + + +function emitReadable(stream) { + var state = stream._readableState; + state.needReadable = false; + + if (!state.emittedReadable) { + debug('emitReadable', state.flowing); + state.emittedReadable = true; + process.nextTick(emitReadable_, stream); + } +} + +function emitReadable_(stream) { + var state = stream._readableState; + debug('emitReadable_', state.destroyed, state.length, state.ended); + + if (!state.destroyed && (state.length || state.ended)) { + stream.emit('readable'); + } // The stream needs another readable event if + // 1. It is not flowing, as the flow mechanism will take + // care of it. + // 2. It is not ended. + // 3. It is below the highWaterMark, so we can schedule + // another readable later. + + + state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark; + flow(stream); +} // at this point, the user has presumably seen the 'readable' event, +// and called read() to consume some data. that may have triggered +// in turn another _read(n) call, in which case reading = true if +// it's in progress. +// However, if we're not ended, or reading, and the length < hwm, +// then go ahead and try to read some more preemptively. + + +function maybeReadMore(stream, state) { + if (!state.readingMore) { + state.readingMore = true; + process.nextTick(maybeReadMore_, stream, state); + } +} + +function maybeReadMore_(stream, state) { + // Attempt to read more data if we should. + // + // The conditions for reading more data are (one of): + // - Not enough data buffered (state.length < state.highWaterMark). The loop + // is responsible for filling the buffer with enough data if such data + // is available. If highWaterMark is 0 and we are not in the flowing mode + // we should _not_ attempt to buffer any extra data. We'll get more data + // when the stream consumer calls read() instead. + // - No data in the buffer, and the stream is in flowing mode. In this mode + // the loop below is responsible for ensuring read() is called. Failing to + // call read here would abort the flow and there's no other mechanism for + // continuing the flow if the stream consumer has just subscribed to the + // 'data' event. + // + // In addition to the above conditions to keep reading data, the following + // conditions prevent the data from being read: + // - The stream has ended (state.ended). + // - There is already a pending 'read' operation (state.reading). This is a + // case where the the stream has called the implementation defined _read() + // method, but they are processing the call asynchronously and have _not_ + // called push() with new data. In this case we skip performing more + // read()s. The execution ends in this method again after the _read() ends + // up calling push() with more data. + while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) { + var len = state.length; + debug('maybeReadMore read 0'); + stream.read(0); + if (len === state.length) // didn't get any data, stop spinning. + break; + } + + state.readingMore = false; +} // abstract method. to be overridden in specific implementation classes. +// call cb(er, data) where data is <= n in length. +// for virtual (non-string, non-buffer) streams, "length" is somewhat +// arbitrary, and perhaps not very meaningful. + + +Readable.prototype._read = function (n) { + this.emit('error', new ERR_METHOD_NOT_IMPLEMENTED('_read()')); +}; + +Readable.prototype.pipe = function (dest, pipeOpts) { + var src = this; + var state = this._readableState; + + switch (state.pipesCount) { + case 0: + state.pipes = dest; + break; + + case 1: + state.pipes = [state.pipes, dest]; + break; + + default: + state.pipes.push(dest); + break; + } + + state.pipesCount += 1; + debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); + var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr; + var endFn = doEnd ? onend : unpipe; + if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn); + dest.on('unpipe', onunpipe); + + function onunpipe(readable, unpipeInfo) { + debug('onunpipe'); + + if (readable === src) { + if (unpipeInfo && unpipeInfo.hasUnpiped === false) { + unpipeInfo.hasUnpiped = true; + cleanup(); + } + } + } + + function onend() { + debug('onend'); + dest.end(); + } // when the dest drains, it reduces the awaitDrain counter + // on the source. This would be more elegant with a .once() + // handler in flow(), but adding and removing repeatedly is + // too slow. + + + var ondrain = pipeOnDrain(src); + dest.on('drain', ondrain); + var cleanedUp = false; + + function cleanup() { + debug('cleanup'); // cleanup event handlers once the pipe is broken + + dest.removeListener('close', onclose); + dest.removeListener('finish', onfinish); + dest.removeListener('drain', ondrain); + dest.removeListener('error', onerror); + dest.removeListener('unpipe', onunpipe); + src.removeListener('end', onend); + src.removeListener('end', unpipe); + src.removeListener('data', ondata); + cleanedUp = true; // if the reader is waiting for a drain event from this + // specific writer, then it would cause it to never start + // flowing again. + // So, if this is awaiting a drain, then we just call it now. + // If we don't know, then assume that we are waiting for one. + + if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain(); + } + + src.on('data', ondata); + + function ondata(chunk) { + debug('ondata'); + var ret = dest.write(chunk); + debug('dest.write', ret); + + if (ret === false) { + // If the user unpiped during `dest.write()`, it is possible + // to get stuck in a permanently paused state if that write + // also returned false. + // => Check whether `dest` is still a piping destination. + if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) { + debug('false write response, pause', state.awaitDrain); + state.awaitDrain++; + } + + src.pause(); + } + } // if the dest has an error, then stop piping into it. + // however, don't suppress the throwing behavior for this. + + + function onerror(er) { + debug('onerror', er); + unpipe(); + dest.removeListener('error', onerror); + if (EElistenerCount(dest, 'error') === 0) dest.emit('error', er); + } // Make sure our error handler is attached before userland ones. + + + prependListener(dest, 'error', onerror); // Both close and finish should trigger unpipe, but only once. + + function onclose() { + dest.removeListener('finish', onfinish); + unpipe(); + } + + dest.once('close', onclose); + + function onfinish() { + debug('onfinish'); + dest.removeListener('close', onclose); + unpipe(); + } + + dest.once('finish', onfinish); + + function unpipe() { + debug('unpipe'); + src.unpipe(dest); + } // tell the dest that it's being piped to + + + dest.emit('pipe', src); // start the flow if it hasn't been started already. + + if (!state.flowing) { + debug('pipe resume'); + src.resume(); + } + + return dest; +}; + +function pipeOnDrain(src) { + return function pipeOnDrainFunctionResult() { + var state = src._readableState; + debug('pipeOnDrain', state.awaitDrain); + if (state.awaitDrain) state.awaitDrain--; + + if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) { + state.flowing = true; + flow(src); + } + }; +} + +Readable.prototype.unpipe = function (dest) { + var state = this._readableState; + var unpipeInfo = { + hasUnpiped: false + }; // if we're not piping anywhere, then do nothing. + + if (state.pipesCount === 0) return this; // just one destination. most common case. + + if (state.pipesCount === 1) { + // passed in one, but it's not the right one. + if (dest && dest !== state.pipes) return this; + if (!dest) dest = state.pipes; // got a match. + + state.pipes = null; + state.pipesCount = 0; + state.flowing = false; + if (dest) dest.emit('unpipe', this, unpipeInfo); + return this; + } // slow case. multiple pipe destinations. + + + if (!dest) { + // remove all. + var dests = state.pipes; + var len = state.pipesCount; + state.pipes = null; + state.pipesCount = 0; + state.flowing = false; + + for (var i = 0; i < len; i++) { + dests[i].emit('unpipe', this, { + hasUnpiped: false + }); + } + + return this; + } // try to find the right one. + + + var index = indexOf(state.pipes, dest); + if (index === -1) return this; + state.pipes.splice(index, 1); + state.pipesCount -= 1; + if (state.pipesCount === 1) state.pipes = state.pipes[0]; + dest.emit('unpipe', this, unpipeInfo); + return this; +}; // set up data events if they are asked for +// Ensure readable listeners eventually get something + + +Readable.prototype.on = function (ev, fn) { + var res = Stream.prototype.on.call(this, ev, fn); + var state = this._readableState; + + if (ev === 'data') { + // update readableListening so that resume() may be a no-op + // a few lines down. This is needed to support once('readable'). + state.readableListening = this.listenerCount('readable') > 0; // Try start flowing on next tick if stream isn't explicitly paused + + if (state.flowing !== false) this.resume(); + } else if (ev === 'readable') { + if (!state.endEmitted && !state.readableListening) { + state.readableListening = state.needReadable = true; + state.flowing = false; + state.emittedReadable = false; + debug('on readable', state.length, state.reading); + + if (state.length) { + emitReadable(this); + } else if (!state.reading) { + process.nextTick(nReadingNextTick, this); + } + } + } + + return res; +}; + +Readable.prototype.addListener = Readable.prototype.on; + +Readable.prototype.removeListener = function (ev, fn) { + var res = Stream.prototype.removeListener.call(this, ev, fn); + + if (ev === 'readable') { + // We need to check if there is someone still listening to + // readable and reset the state. However this needs to happen + // after readable has been emitted but before I/O (nextTick) to + // support once('readable', fn) cycles. This means that calling + // resume within the same tick will have no + // effect. + process.nextTick(updateReadableListening, this); + } + + return res; +}; + +Readable.prototype.removeAllListeners = function (ev) { + var res = Stream.prototype.removeAllListeners.apply(this, arguments); + + if (ev === 'readable' || ev === undefined) { + // We need to check if there is someone still listening to + // readable and reset the state. However this needs to happen + // after readable has been emitted but before I/O (nextTick) to + // support once('readable', fn) cycles. This means that calling + // resume within the same tick will have no + // effect. + process.nextTick(updateReadableListening, this); + } + + return res; +}; + +function updateReadableListening(self) { + var state = self._readableState; + state.readableListening = self.listenerCount('readable') > 0; + + if (state.resumeScheduled && !state.paused) { + // flowing needs to be set to true now, otherwise + // the upcoming resume will not flow. + state.flowing = true; // crude way to check if we should resume + } else if (self.listenerCount('data') > 0) { + self.resume(); + } +} + +function nReadingNextTick(self) { + debug('readable nexttick read 0'); + self.read(0); +} // pause() and resume() are remnants of the legacy readable stream API +// If the user uses them, then switch into old mode. + + +Readable.prototype.resume = function () { + var state = this._readableState; + + if (!state.flowing) { + debug('resume'); // we flow only if there is no one listening + // for readable, but we still have to call + // resume() + + state.flowing = !state.readableListening; + resume(this, state); + } + + state.paused = false; + return this; +}; + +function resume(stream, state) { + if (!state.resumeScheduled) { + state.resumeScheduled = true; + process.nextTick(resume_, stream, state); + } +} + +function resume_(stream, state) { + debug('resume', state.reading); + + if (!state.reading) { + stream.read(0); + } + + state.resumeScheduled = false; + stream.emit('resume'); + flow(stream); + if (state.flowing && !state.reading) stream.read(0); +} + +Readable.prototype.pause = function () { + debug('call pause flowing=%j', this._readableState.flowing); + + if (this._readableState.flowing !== false) { + debug('pause'); + this._readableState.flowing = false; + this.emit('pause'); + } + + this._readableState.paused = true; + return this; +}; + +function flow(stream) { + var state = stream._readableState; + debug('flow', state.flowing); + + while (state.flowing && stream.read() !== null) { + ; + } +} // wrap an old-style stream as the async data source. +// This is *not* part of the readable stream interface. +// It is an ugly unfortunate mess of history. + + +Readable.prototype.wrap = function (stream) { + var _this = this; + + var state = this._readableState; + var paused = false; + stream.on('end', function () { + debug('wrapped end'); + + if (state.decoder && !state.ended) { + var chunk = state.decoder.end(); + if (chunk && chunk.length) _this.push(chunk); + } + + _this.push(null); + }); + stream.on('data', function (chunk) { + debug('wrapped data'); + if (state.decoder) chunk = state.decoder.write(chunk); // don't skip over falsy values in objectMode + + if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return; + + var ret = _this.push(chunk); + + if (!ret) { + paused = true; + stream.pause(); + } + }); // proxy all the other methods. + // important when wrapping filters and duplexes. + + for (var i in stream) { + if (this[i] === undefined && typeof stream[i] === 'function') { + this[i] = function methodWrap(method) { + return function methodWrapReturnFunction() { + return stream[method].apply(stream, arguments); + }; + }(i); + } + } // proxy certain important events. + + + for (var n = 0; n < kProxyEvents.length; n++) { + stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n])); + } // when we try to consume some more bytes, simply unpause the + // underlying stream. + + + this._read = function (n) { + debug('wrapped _read', n); + + if (paused) { + paused = false; + stream.resume(); + } + }; + + return this; +}; + +if (typeof Symbol === 'function') { + Readable.prototype[Symbol.asyncIterator] = function () { + emitExperimentalWarning('Readable[Symbol.asyncIterator]'); + + if (createReadableStreamAsyncIterator === undefined) { + createReadableStreamAsyncIterator = __webpack_require__(317); + } + + return createReadableStreamAsyncIterator(this); + }; +} + +Object.defineProperty(Readable.prototype, 'readableHighWaterMark', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._readableState.highWaterMark; + } +}); +Object.defineProperty(Readable.prototype, 'readableBuffer', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._readableState && this._readableState.buffer; + } +}); +Object.defineProperty(Readable.prototype, 'readableFlowing', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._readableState.flowing; + }, + set: function set(state) { + if (this._readableState) { + this._readableState.flowing = state; + } + } +}); // exposed for testing purposes only. + +Readable._fromList = fromList; +Object.defineProperty(Readable.prototype, 'readableLength', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._readableState.length; + } +}); // Pluck off n bytes from an array of buffers. +// Length is the combined lengths of all the buffers in the list. +// This function is designed to be inlinable, so please take care when making +// changes to the function body. + +function fromList(n, state) { + // nothing buffered + if (state.length === 0) return null; + var ret; + if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) { + // read it all, truncate the list + if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length); + state.buffer.clear(); + } else { + // read part of list + ret = state.buffer.consume(n, state.decoder); + } + return ret; +} + +function endReadable(stream) { + var state = stream._readableState; + debug('endReadable', state.endEmitted); + + if (!state.endEmitted) { + state.ended = true; + process.nextTick(endReadableNT, state, stream); + } +} + +function endReadableNT(state, stream) { + debug('endReadableNT', state.endEmitted, state.length); // Check that we didn't get one last unshift. + + if (!state.endEmitted && state.length === 0) { + state.endEmitted = true; + stream.readable = false; + stream.emit('end'); + } +} + +function indexOf(xs, x) { + for (var i = 0, l = xs.length; i < l; i++) { + if (xs[i] === x) return i; + } + + return -1; +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10), __webpack_require__(6))) + +/***/ }), +/* 151 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = __webpack_require__(30).EventEmitter; + +/***/ }), +/* 152 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process) { // undocumented cb() API, needed for core, not for public API + +function destroy(err, cb) { + var _this = this; + + var readableDestroyed = this._readableState && this._readableState.destroyed; + var writableDestroyed = this._writableState && this._writableState.destroyed; + + if (readableDestroyed || writableDestroyed) { + if (cb) { + cb(err); + } else if (err && (!this._writableState || !this._writableState.errorEmitted)) { + process.nextTick(emitErrorNT, this, err); + } + + return this; + } // we set destroyed to true before firing error callbacks in order + // to make it re-entrance safe in case destroy() is called within callbacks + + + if (this._readableState) { + this._readableState.destroyed = true; + } // if this is a duplex stream mark the writable part as destroyed as well + + + if (this._writableState) { + this._writableState.destroyed = true; + } + + this._destroy(err || null, function (err) { + if (!cb && err) { + process.nextTick(emitErrorAndCloseNT, _this, err); + + if (_this._writableState) { + _this._writableState.errorEmitted = true; + } + } else if (cb) { + process.nextTick(emitCloseNT, _this); + cb(err); + } else { + process.nextTick(emitCloseNT, _this); + } + }); + + return this; +} + +function emitErrorAndCloseNT(self, err) { + emitErrorNT(self, err); + emitCloseNT(self); +} + +function emitCloseNT(self) { + if (self._writableState && !self._writableState.emitClose) return; + if (self._readableState && !self._readableState.emitClose) return; + self.emit('close'); +} + +function undestroy() { + if (this._readableState) { + this._readableState.destroyed = false; + this._readableState.reading = false; + this._readableState.ended = false; + this._readableState.endEmitted = false; + } + + if (this._writableState) { + this._writableState.destroyed = false; + this._writableState.ended = false; + this._writableState.ending = false; + this._writableState.finalCalled = false; + this._writableState.prefinished = false; + this._writableState.finished = false; + this._writableState.errorEmitted = false; + } +} + +function emitErrorNT(self, err) { + self.emit('error', err); +} + +module.exports = { + destroy: destroy, + undestroy: undestroy +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6))) + +/***/ }), +/* 153 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var ERR_INVALID_OPT_VALUE = __webpack_require__(42).codes.ERR_INVALID_OPT_VALUE; + +function highWaterMarkFrom(options, isDuplex, duplexKey) { + return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null; +} + +function getHighWaterMark(state, options, duplexKey, isDuplex) { + var hwm = highWaterMarkFrom(options, isDuplex, duplexKey); + + if (hwm != null) { + if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) { + var name = isDuplex ? duplexKey : 'highWaterMark'; + throw new ERR_INVALID_OPT_VALUE(name, hwm); + } + + return Math.floor(hwm); + } // Default value + + + return state.objectMode ? 16 : 16 * 1024; +} + +module.exports = { + getHighWaterMark: getHighWaterMark +}; + +/***/ }), +/* 154 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global, process) {// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// A bit simpler than readable streams. +// Implement an async ._write(chunk, encoding, cb), and it'll handle all +// the drain event emission and buffering. + + +module.exports = Writable; +/* */ + +function WriteReq(chunk, encoding, cb) { + this.chunk = chunk; + this.encoding = encoding; + this.callback = cb; + this.next = null; +} // It seems a linked list but it is not +// there will be only 2 of these for each stream + + +function CorkedRequest(state) { + var _this = this; + + this.next = null; + this.entry = null; + + this.finish = function () { + onCorkedFinish(_this, state); + }; +} +/* */ + +/**/ + + +var Duplex; +/**/ + +Writable.WritableState = WritableState; +/**/ + +var internalUtil = { + deprecate: __webpack_require__(135) +}; +/**/ + +/**/ + +var Stream = __webpack_require__(151); +/**/ + + +var Buffer = __webpack_require__(0).Buffer; + +var OurUint8Array = global.Uint8Array || function () {}; + +function _uint8ArrayToBuffer(chunk) { + return Buffer.from(chunk); +} + +function _isUint8Array(obj) { + return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; +} + +var destroyImpl = __webpack_require__(152); + +var _require = __webpack_require__(153), + getHighWaterMark = _require.getHighWaterMark; + +var _require$codes = __webpack_require__(42).codes, + ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, + ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, + ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK, + ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE, + ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED, + ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES, + ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END, + ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING; + +__webpack_require__(2)(Writable, Stream); + +function nop() {} + +function WritableState(options, stream, isDuplex) { + Duplex = Duplex || __webpack_require__(32); + options = options || {}; // Duplex streams are both readable and writable, but share + // the same options object. + // However, some cases require setting options to different + // values for the readable and the writable sides of the duplex stream, + // e.g. options.readableObjectMode vs. options.writableObjectMode, etc. + + if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag to indicate whether or not this stream + // contains buffers or objects. + + this.objectMode = !!options.objectMode; + if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; // the point at which write() starts returning false + // Note: 0 is a valid value, means that we always return false if + // the entire buffer is not flushed immediately on write() + + this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); // if _final has been called + + this.finalCalled = false; // drain event flag. + + this.needDrain = false; // at the start of calling end() + + this.ending = false; // when end() has been called, and returned + + this.ended = false; // when 'finish' is emitted + + this.finished = false; // has it been destroyed + + this.destroyed = false; // should we decode strings into buffers before passing to _write? + // this is here so that some node-core streams can optimize string + // handling at a lower level. + + var noDecode = options.decodeStrings === false; + this.decodeStrings = !noDecode; // Crypto is kind of old and crusty. Historically, its default string + // encoding is 'binary' so we have to make this configurable. + // Everything else in the universe uses 'utf8', though. + + this.defaultEncoding = options.defaultEncoding || 'utf8'; // not an actual buffer we keep track of, but a measurement + // of how much we're waiting to get pushed to some underlying + // socket or file. + + this.length = 0; // a flag to see when we're in the middle of a write. + + this.writing = false; // when true all writes will be buffered until .uncork() call + + this.corked = 0; // a flag to be able to tell if the onwrite cb is called immediately, + // or on a later tick. We set this to true at first, because any + // actions that shouldn't happen until "later" should generally also + // not happen before the first write call. + + this.sync = true; // a flag to know if we're processing previously buffered items, which + // may call the _write() callback in the same tick, so that we don't + // end up in an overlapped onwrite situation. + + this.bufferProcessing = false; // the callback that's passed to _write(chunk,cb) + + this.onwrite = function (er) { + onwrite(stream, er); + }; // the callback that the user supplies to write(chunk,encoding,cb) + + + this.writecb = null; // the amount that is being written when _write is called. + + this.writelen = 0; + this.bufferedRequest = null; + this.lastBufferedRequest = null; // number of pending user-supplied write callbacks + // this must be 0 before 'finish' can be emitted + + this.pendingcb = 0; // emit prefinish if the only thing we're waiting for is _write cbs + // This is relevant for synchronous Transform streams + + this.prefinished = false; // True if the error was already emitted and should not be thrown again + + this.errorEmitted = false; // Should close be emitted on destroy. Defaults to true. + + this.emitClose = options.emitClose !== false; // count buffered requests + + this.bufferedRequestCount = 0; // allocate the first CorkedRequest, there is always + // one allocated and free to use, and we maintain at most two + + this.corkedRequestsFree = new CorkedRequest(this); +} + +WritableState.prototype.getBuffer = function getBuffer() { + var current = this.bufferedRequest; + var out = []; + + while (current) { + out.push(current); + current = current.next; + } + + return out; +}; + +(function () { + try { + Object.defineProperty(WritableState.prototype, 'buffer', { + get: internalUtil.deprecate(function writableStateBufferGetter() { + return this.getBuffer(); + }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003') + }); + } catch (_) {} +})(); // Test _writableState for inheritance to account for Duplex streams, +// whose prototype chain only points to Readable. + + +var realHasInstance; + +if (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') { + realHasInstance = Function.prototype[Symbol.hasInstance]; + Object.defineProperty(Writable, Symbol.hasInstance, { + value: function value(object) { + if (realHasInstance.call(this, object)) return true; + if (this !== Writable) return false; + return object && object._writableState instanceof WritableState; + } + }); +} else { + realHasInstance = function realHasInstance(object) { + return object instanceof this; + }; +} + +function Writable(options) { + Duplex = Duplex || __webpack_require__(32); // Writable ctor is applied to Duplexes, too. + // `realHasInstance` is necessary because using plain `instanceof` + // would return false, as no `_writableState` property is attached. + // Trying to use the custom `instanceof` for Writable here will also break the + // Node.js LazyTransform implementation, which has a non-trivial getter for + // `_writableState` that would lead to infinite recursion. + // Checking for a Stream.Duplex instance is faster here instead of inside + // the WritableState constructor, at least with V8 6.5 + + var isDuplex = this instanceof Duplex; + if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options); + this._writableState = new WritableState(options, this, isDuplex); // legacy. + + this.writable = true; + + if (options) { + if (typeof options.write === 'function') this._write = options.write; + if (typeof options.writev === 'function') this._writev = options.writev; + if (typeof options.destroy === 'function') this._destroy = options.destroy; + if (typeof options["final"] === 'function') this._final = options["final"]; + } + + Stream.call(this); +} // Otherwise people can pipe Writable streams, which is just wrong. + + +Writable.prototype.pipe = function () { + this.emit('error', new ERR_STREAM_CANNOT_PIPE()); +}; + +function writeAfterEnd(stream, cb) { + var er = new ERR_STREAM_WRITE_AFTER_END(); // TODO: defer error events consistently everywhere, not just the cb + + stream.emit('error', er); + process.nextTick(cb, er); +} // Checks that a user-supplied chunk is valid, especially for the particular +// mode the stream is in. Currently this means that `null` is never accepted +// and undefined/non-string values are only allowed in object mode. + + +function validChunk(stream, state, chunk, cb) { + var er; + + if (chunk === null) { + er = new ERR_STREAM_NULL_VALUES(); + } else if (typeof chunk !== 'string' && !state.objectMode) { + er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk); + } + + if (er) { + stream.emit('error', er); + process.nextTick(cb, er); + return false; + } + + return true; +} + +Writable.prototype.write = function (chunk, encoding, cb) { + var state = this._writableState; + var ret = false; + + var isBuf = !state.objectMode && _isUint8Array(chunk); + + if (isBuf && !Buffer.isBuffer(chunk)) { + chunk = _uint8ArrayToBuffer(chunk); + } + + if (typeof encoding === 'function') { + cb = encoding; + encoding = null; + } + + if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding; + if (typeof cb !== 'function') cb = nop; + if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) { + state.pendingcb++; + ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb); + } + return ret; +}; + +Writable.prototype.cork = function () { + this._writableState.corked++; +}; + +Writable.prototype.uncork = function () { + var state = this._writableState; + + if (state.corked) { + state.corked--; + if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state); + } +}; + +Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) { + // node::ParseEncoding() requires lower case. + if (typeof encoding === 'string') encoding = encoding.toLowerCase(); + if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding); + this._writableState.defaultEncoding = encoding; + return this; +}; + +Object.defineProperty(Writable.prototype, 'writableBuffer', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState && this._writableState.getBuffer(); + } +}); + +function decodeChunk(state, chunk, encoding) { + if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') { + chunk = Buffer.from(chunk, encoding); + } + + return chunk; +} + +Object.defineProperty(Writable.prototype, 'writableHighWaterMark', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState.highWaterMark; + } +}); // if we're already writing something, then just put this +// in the queue, and wait our turn. Otherwise, call _write +// If we return false, then we need a drain event, so set that flag. + +function writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) { + if (!isBuf) { + var newChunk = decodeChunk(state, chunk, encoding); + + if (chunk !== newChunk) { + isBuf = true; + encoding = 'buffer'; + chunk = newChunk; + } + } + + var len = state.objectMode ? 1 : chunk.length; + state.length += len; + var ret = state.length < state.highWaterMark; // we must ensure that previous needDrain will not be reset to false. + + if (!ret) state.needDrain = true; + + if (state.writing || state.corked) { + var last = state.lastBufferedRequest; + state.lastBufferedRequest = { + chunk: chunk, + encoding: encoding, + isBuf: isBuf, + callback: cb, + next: null + }; + + if (last) { + last.next = state.lastBufferedRequest; + } else { + state.bufferedRequest = state.lastBufferedRequest; + } + + state.bufferedRequestCount += 1; + } else { + doWrite(stream, state, false, len, chunk, encoding, cb); + } + + return ret; +} + +function doWrite(stream, state, writev, len, chunk, encoding, cb) { + state.writelen = len; + state.writecb = cb; + state.writing = true; + state.sync = true; + if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite); + state.sync = false; +} + +function onwriteError(stream, state, sync, er, cb) { + --state.pendingcb; + + if (sync) { + // defer the callback if we are being called synchronously + // to avoid piling up things on the stack + process.nextTick(cb, er); // this can emit finish, and it will always happen + // after error + + process.nextTick(finishMaybe, stream, state); + stream._writableState.errorEmitted = true; + stream.emit('error', er); + } else { + // the caller expect this to happen before if + // it is async + cb(er); + stream._writableState.errorEmitted = true; + stream.emit('error', er); // this can emit finish, but finish must + // always follow error + + finishMaybe(stream, state); + } +} + +function onwriteStateUpdate(state) { + state.writing = false; + state.writecb = null; + state.length -= state.writelen; + state.writelen = 0; +} + +function onwrite(stream, er) { + var state = stream._writableState; + var sync = state.sync; + var cb = state.writecb; + if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK(); + onwriteStateUpdate(state); + if (er) onwriteError(stream, state, sync, er, cb);else { + // Check if we're actually ready to finish, but don't emit yet + var finished = needFinish(state) || stream.destroyed; + + if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) { + clearBuffer(stream, state); + } + + if (sync) { + process.nextTick(afterWrite, stream, state, finished, cb); + } else { + afterWrite(stream, state, finished, cb); + } + } +} + +function afterWrite(stream, state, finished, cb) { + if (!finished) onwriteDrain(stream, state); + state.pendingcb--; + cb(); + finishMaybe(stream, state); +} // Must force callback to be called on nextTick, so that we don't +// emit 'drain' before the write() consumer gets the 'false' return +// value, and has a chance to attach a 'drain' listener. + + +function onwriteDrain(stream, state) { + if (state.length === 0 && state.needDrain) { + state.needDrain = false; + stream.emit('drain'); + } +} // if there's something in the buffer waiting, then process it + + +function clearBuffer(stream, state) { + state.bufferProcessing = true; + var entry = state.bufferedRequest; + + if (stream._writev && entry && entry.next) { + // Fast case, write everything using _writev() + var l = state.bufferedRequestCount; + var buffer = new Array(l); + var holder = state.corkedRequestsFree; + holder.entry = entry; + var count = 0; + var allBuffers = true; + + while (entry) { + buffer[count] = entry; + if (!entry.isBuf) allBuffers = false; + entry = entry.next; + count += 1; + } + + buffer.allBuffers = allBuffers; + doWrite(stream, state, true, state.length, buffer, '', holder.finish); // doWrite is almost always async, defer these to save a bit of time + // as the hot path ends with doWrite + + state.pendingcb++; + state.lastBufferedRequest = null; + + if (holder.next) { + state.corkedRequestsFree = holder.next; + holder.next = null; + } else { + state.corkedRequestsFree = new CorkedRequest(state); + } + + state.bufferedRequestCount = 0; + } else { + // Slow case, write chunks one-by-one + while (entry) { + var chunk = entry.chunk; + var encoding = entry.encoding; + var cb = entry.callback; + var len = state.objectMode ? 1 : chunk.length; + doWrite(stream, state, false, len, chunk, encoding, cb); + entry = entry.next; + state.bufferedRequestCount--; // if we didn't call the onwrite immediately, then + // it means that we need to wait until it does. + // also, that means that the chunk and cb are currently + // being processed, so move the buffer counter past them. + + if (state.writing) { + break; + } + } + + if (entry === null) state.lastBufferedRequest = null; + } + + state.bufferedRequest = entry; + state.bufferProcessing = false; +} + +Writable.prototype._write = function (chunk, encoding, cb) { + cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()')); +}; + +Writable.prototype._writev = null; + +Writable.prototype.end = function (chunk, encoding, cb) { + var state = this._writableState; + + if (typeof chunk === 'function') { + cb = chunk; + chunk = null; + encoding = null; + } else if (typeof encoding === 'function') { + cb = encoding; + encoding = null; + } + + if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); // .end() fully uncorks + + if (state.corked) { + state.corked = 1; + this.uncork(); + } // ignore unnecessary end() calls. + + + if (!state.ending) endWritable(this, state, cb); + return this; +}; + +Object.defineProperty(Writable.prototype, 'writableLength', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + return this._writableState.length; + } +}); + +function needFinish(state) { + return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing; +} + +function callFinal(stream, state) { + stream._final(function (err) { + state.pendingcb--; + + if (err) { + stream.emit('error', err); + } + + state.prefinished = true; + stream.emit('prefinish'); + finishMaybe(stream, state); + }); +} + +function prefinish(stream, state) { + if (!state.prefinished && !state.finalCalled) { + if (typeof stream._final === 'function' && !state.destroyed) { + state.pendingcb++; + state.finalCalled = true; + process.nextTick(callFinal, stream, state); + } else { + state.prefinished = true; + stream.emit('prefinish'); + } + } +} + +function finishMaybe(stream, state) { + var need = needFinish(state); + + if (need) { + prefinish(stream, state); + + if (state.pendingcb === 0) { + state.finished = true; + stream.emit('finish'); + } + } + + return need; +} + +function endWritable(stream, state, cb) { + state.ending = true; + finishMaybe(stream, state); + + if (cb) { + if (state.finished) process.nextTick(cb);else stream.once('finish', cb); + } + + state.ended = true; + stream.writable = false; +} + +function onCorkedFinish(corkReq, state, err) { + var entry = corkReq.entry; + corkReq.entry = null; + + while (entry) { + var cb = entry.callback; + state.pendingcb--; + cb(err); + entry = entry.next; + } // reuse the free corkReq. + + + state.corkedRequestsFree.next = corkReq; +} + +Object.defineProperty(Writable.prototype, 'destroyed', { + // making it explicit this property is not enumerable + // because otherwise some prototype manipulation in + // userland will fail + enumerable: false, + get: function get() { + if (this._writableState === undefined) { + return false; + } + + return this._writableState.destroyed; + }, + set: function set(value) { + // we ignore the value if the stream + // has not been initialized yet + if (!this._writableState) { + return; + } // backward compatibility, the user is explicitly + // managing destroyed + + + this._writableState.destroyed = value; + } +}); +Writable.prototype.destroy = destroyImpl.destroy; +Writable.prototype._undestroy = destroyImpl.undestroy; + +Writable.prototype._destroy = function (err, cb) { + cb(err); +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10), __webpack_require__(6))) + +/***/ }), +/* 155 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. +// a transform stream is a readable/writable stream where you do +// something with the data. Sometimes it's called a "filter", +// but that's not a great name for it, since that implies a thing where +// some bits pass through, and others are simply ignored. (That would +// be a valid example of a transform, of course.) +// +// While the output is causally related to the input, it's not a +// necessarily symmetric or synchronous transformation. For example, +// a zlib stream might take multiple plain-text writes(), and then +// emit a single compressed chunk some time in the future. +// +// Here's how this works: +// +// The Transform stream has all the aspects of the readable and writable +// stream classes. When you write(chunk), that calls _write(chunk,cb) +// internally, and returns false if there's a lot of pending writes +// buffered up. When you call read(), that calls _read(n) until +// there's enough pending readable data buffered up. +// +// In a transform stream, the written data is placed in a buffer. When +// _read(n) is called, it transforms the queued up data, calling the +// buffered _write cb's as it consumes chunks. If consuming a single +// written chunk would result in multiple output chunks, then the first +// outputted bit calls the readcb, and subsequent chunks just go into +// the read buffer, and will cause it to emit 'readable' if necessary. +// +// This way, back-pressure is actually determined by the reading side, +// since _read has to be called to start processing a new chunk. However, +// a pathological inflate type of transform can cause excessive buffering +// here. For example, imagine a stream where every byte of input is +// interpreted as an integer from 0-255, and then results in that many +// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in +// 1kb of data being output. In this case, you could write a very small +// amount of input, and end up with a very large amount of output. In +// such a pathological inflating mechanism, there'd be no way to tell +// the system to stop doing the transform. A single 4MB write could +// cause the system to run out of memory. +// +// However, even in such a pathological case, only a single written chunk +// would be consumed, and then the rest would wait (un-transformed) until +// the results of the previous transformed chunk were consumed. + + +module.exports = Transform; + +var _require$codes = __webpack_require__(42).codes, + ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, + ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK, + ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING, + ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0; + +var Duplex = __webpack_require__(32); + +__webpack_require__(2)(Transform, Duplex); + +function afterTransform(er, data) { + var ts = this._transformState; + ts.transforming = false; + var cb = ts.writecb; + + if (cb === null) { + return this.emit('error', new ERR_MULTIPLE_CALLBACK()); + } + + ts.writechunk = null; + ts.writecb = null; + if (data != null) // single equals check for both `null` and `undefined` + this.push(data); + cb(er); + var rs = this._readableState; + rs.reading = false; + + if (rs.needReadable || rs.length < rs.highWaterMark) { + this._read(rs.highWaterMark); + } +} + +function Transform(options) { + if (!(this instanceof Transform)) return new Transform(options); + Duplex.call(this, options); + this._transformState = { + afterTransform: afterTransform.bind(this), + needTransform: false, + transforming: false, + writecb: null, + writechunk: null, + writeencoding: null + }; // start out asking for a readable event once data is transformed. + + this._readableState.needReadable = true; // we have implemented the _read method, and done the other things + // that Readable wants before the first _read call, so unset the + // sync guard flag. + + this._readableState.sync = false; + + if (options) { + if (typeof options.transform === 'function') this._transform = options.transform; + if (typeof options.flush === 'function') this._flush = options.flush; + } // When the writable side finishes, then flush out anything remaining. + + + this.on('prefinish', prefinish); +} + +function prefinish() { + var _this = this; + + if (typeof this._flush === 'function' && !this._readableState.destroyed) { + this._flush(function (er, data) { + done(_this, er, data); + }); + } else { + done(this, null, null); + } +} + +Transform.prototype.push = function (chunk, encoding) { + this._transformState.needTransform = false; + return Duplex.prototype.push.call(this, chunk, encoding); +}; // This is the part where you do stuff! +// override this function in implementation classes. +// 'chunk' is an input chunk. +// +// Call `push(newChunk)` to pass along transformed output +// to the readable side. You may call 'push' zero or more times. +// +// Call `cb(err)` when you are done with this chunk. If you pass +// an error, then that'll put the hurt on the whole operation. If you +// never call cb(), then you'll never get another chunk. + + +Transform.prototype._transform = function (chunk, encoding, cb) { + cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()')); +}; + +Transform.prototype._write = function (chunk, encoding, cb) { + var ts = this._transformState; + ts.writecb = cb; + ts.writechunk = chunk; + ts.writeencoding = encoding; + + if (!ts.transforming) { + var rs = this._readableState; + if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark); + } +}; // Doesn't matter what the args are here. +// _transform does all the work. +// That we got here means that the readable side wants more data. + + +Transform.prototype._read = function (n) { + var ts = this._transformState; + + if (ts.writechunk !== null && !ts.transforming) { + ts.transforming = true; + + this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform); + } else { + // mark that we need a transform, so that any data that comes in + // will get processed, now that we've asked for it. + ts.needTransform = true; + } +}; + +Transform.prototype._destroy = function (err, cb) { + Duplex.prototype._destroy.call(this, err, function (err2) { + cb(err2); + }); +}; + +function done(stream, er, data) { + if (er) return stream.emit('error', er); + if (data != null) // single equals check for both `null` and `undefined` + stream.push(data); // TODO(BridgeAR): Write a test for these two error cases + // if there's nothing in the write buffer, then that means + // that nothing more will ever be provided + + if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0(); + if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING(); + return stream.push(null); +} + +/***/ }), +/* 156 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var isFunction = __webpack_require__(325), + isLength = __webpack_require__(160); +/** + * Checks if `value` is array-like. A value is considered array-like if it's + * not a function and has a `value.length` that's an integer greater than or + * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`. + * + * @static + * @memberOf _ + * @since 4.0.0 + * @category Lang + * @param {*} value The value to check. + * @returns {boolean} Returns `true` if `value` is array-like, else `false`. + * @example + * + * _.isArrayLike([1, 2, 3]); + * // => true + * + * _.isArrayLike(document.body.children); + * // => true + * + * _.isArrayLike('abc'); + * // => true + * + * _.isArrayLike(_.noop); + * // => false + */ + + +function isArrayLike(value) { + return value != null && isLength(value.length) && !isFunction(value); +} + +module.exports = isArrayLike; + +/***/ }), +/* 157 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var root = __webpack_require__(158); +/** Built-in value references. */ + + +var _Symbol = root.Symbol; +module.exports = _Symbol; + +/***/ }), +/* 158 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var freeGlobal = __webpack_require__(159); +/** Detect free variable `self`. */ + + +var freeSelf = (typeof self === "undefined" ? "undefined" : _typeof(self)) == 'object' && self && self.Object === Object && self; +/** Used as a reference to the global object. */ + +var root = freeGlobal || freeSelf || Function('return this')(); +module.exports = root; + +/***/ }), +/* 159 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +/** Detect free variable `global` from Node.js. */ +var freeGlobal = (typeof global === "undefined" ? "undefined" : _typeof(global)) == 'object' && global && global.Object === Object && global; +module.exports = freeGlobal; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(10))) + +/***/ }), +/* 160 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +/** Used as references for various `Number` constants. */ +var MAX_SAFE_INTEGER = 9007199254740991; +/** + * Checks if `value` is a valid array-like length. + * + * **Note:** This method is loosely based on + * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength). + * + * @static + * @memberOf _ + * @since 4.0.0 + * @category Lang + * @param {*} value The value to check. + * @returns {boolean} Returns `true` if `value` is a valid length, else `false`. + * @example + * + * _.isLength(3); + * // => true + * + * _.isLength(Number.MIN_VALUE); + * // => false + * + * _.isLength(Infinity); + * // => false + * + * _.isLength('3'); + * // => false + */ + +function isLength(value) { + return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER; +} + +module.exports = isLength; + +/***/ }), +/* 161 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var toString = Object.prototype.toString; + +module.exports = function kindOf(val) { + if (val === void 0) return 'undefined'; + if (val === null) return 'null'; + + var type = _typeof(val); + + if (type === 'boolean') return 'boolean'; + if (type === 'string') return 'string'; + if (type === 'number') return 'number'; + if (type === 'symbol') return 'symbol'; + + if (type === 'function') { + return isGeneratorFn(val) ? 'generatorfunction' : 'function'; + } + + if (isArray(val)) return 'array'; + if (isBuffer(val)) return 'buffer'; + if (isArguments(val)) return 'arguments'; + if (isDate(val)) return 'date'; + if (isError(val)) return 'error'; + if (isRegexp(val)) return 'regexp'; + + switch (ctorName(val)) { + case 'Symbol': + return 'symbol'; + + case 'Promise': + return 'promise'; + // Set, Map, WeakSet, WeakMap + + case 'WeakMap': + return 'weakmap'; + + case 'WeakSet': + return 'weakset'; + + case 'Map': + return 'map'; + + case 'Set': + return 'set'; + // 8-bit typed arrays + + case 'Int8Array': + return 'int8array'; + + case 'Uint8Array': + return 'uint8array'; + + case 'Uint8ClampedArray': + return 'uint8clampedarray'; + // 16-bit typed arrays + + case 'Int16Array': + return 'int16array'; + + case 'Uint16Array': + return 'uint16array'; + // 32-bit typed arrays + + case 'Int32Array': + return 'int32array'; + + case 'Uint32Array': + return 'uint32array'; + + case 'Float32Array': + return 'float32array'; + + case 'Float64Array': + return 'float64array'; + } + + if (isGeneratorObj(val)) { + return 'generator'; + } // Non-plain objects + + + type = toString.call(val); + + switch (type) { + case '[object Object]': + return 'object'; + // iterators + + case '[object Map Iterator]': + return 'mapiterator'; + + case '[object Set Iterator]': + return 'setiterator'; + + case '[object String Iterator]': + return 'stringiterator'; + + case '[object Array Iterator]': + return 'arrayiterator'; + } // other + + + return type.slice(8, -1).toLowerCase().replace(/\s/g, ''); +}; + +function ctorName(val) { + return val.constructor ? val.constructor.name : null; +} + +function isArray(val) { + if (Array.isArray) return Array.isArray(val); + return val instanceof Array; +} + +function isError(val) { + return val instanceof Error || typeof val.message === 'string' && val.constructor && typeof val.constructor.stackTraceLimit === 'number'; +} + +function isDate(val) { + if (val instanceof Date) return true; + return typeof val.toDateString === 'function' && typeof val.getDate === 'function' && typeof val.setDate === 'function'; +} + +function isRegexp(val) { + if (val instanceof RegExp) return true; + return typeof val.flags === 'string' && typeof val.ignoreCase === 'boolean' && typeof val.multiline === 'boolean' && typeof val.global === 'boolean'; +} + +function isGeneratorFn(name, val) { + return ctorName(name) === 'GeneratorFunction'; +} + +function isGeneratorObj(val) { + return typeof val["throw"] === 'function' && typeof val["return"] === 'function' && typeof val.next === 'function'; +} + +function isArguments(val) { + try { + if (typeof val.length === 'number' && typeof val.callee === 'function') { + return true; + } + } catch (err) { + if (err.message.indexOf('callee') !== -1) { + return true; + } + } + + return false; +} +/** + * If you need to support Safari 5-7 (8-10 yr-old browser), + * take a look at https://github.com/feross/is-buffer + */ + + +function isBuffer(val) { + if (val.constructor && typeof val.constructor.isBuffer === 'function') { + return val.constructor.isBuffer(val); + } + + return false; +} + +/***/ }), +/* 162 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = { + supportsFileReader: typeof self !== 'undefined' && 'FileReader' in self +}; + +/***/ }), +/* 163 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var defaultBase = self.location ? self.location.protocol + '//' + self.location.host : ''; +var URL = self.URL; + +var URLWithLegacySupport = +/*#__PURE__*/ +function () { + function URLWithLegacySupport(url) { + var base = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultBase; + + _classCallCheck(this, URLWithLegacySupport); + + this["super"] = new URL(url, base); + this.path = this.pathname + this.search; + this.auth = this.username && this.password ? this.username + ':' + this.password : null; + this.query = this.search && this.search.startsWith('?') ? this.search.slice(1) : null; + } + + _createClass(URLWithLegacySupport, [{ + key: "createObjectURL", + value: function createObjectURL(o) { + return this["super"].createObjectURL(o); + } + }, { + key: "revokeObjectURL", + value: function revokeObjectURL(o) { + this["super"].revokeObjectURL(o); + } + }, { + key: "toJSON", + value: function toJSON() { + return this["super"].toJSON(); + } + }, { + key: "toString", + value: function toString() { + return this["super"].toString(); + } + }, { + key: "format", + value: function format() { + return this.toString(); + } + }, { + key: "hash", + get: function get() { + return this["super"].hash; + }, + set: function set(hash) { + this["super"].hash = hash; + } + }, { + key: "host", + get: function get() { + return this["super"].host; + }, + set: function set(host) { + this["super"].host = host; + } + }, { + key: "hostname", + get: function get() { + return this["super"].hostname; + }, + set: function set(hostname) { + this["super"].hostname = hostname; + } + }, { + key: "href", + get: function get() { + return this["super"].href; + }, + set: function set(href) { + this["super"].href = href; + } + }, { + key: "origin", + get: function get() { + return this["super"].origin; + }, + set: function set(origin) { + this["super"].origin = origin; + } + }, { + key: "password", + get: function get() { + return this["super"].password; + }, + set: function set(password) { + this["super"].password = password; + } + }, { + key: "pathname", + get: function get() { + return this["super"].pathname; + }, + set: function set(pathname) { + this["super"].pathname = pathname; + } + }, { + key: "port", + get: function get() { + return this["super"].port; + }, + set: function set(port) { + this["super"].port = port; + } + }, { + key: "protocol", + get: function get() { + return this["super"].protocol; + }, + set: function set(protocol) { + this["super"].protocol = protocol; + } + }, { + key: "search", + get: function get() { + return this["super"].search; + }, + set: function set(search) { + this["super"].search = search; + } + }, { + key: "searchParams", + get: function get() { + return this["super"].searchParams; + }, + set: function set(searchParams) { + this["super"].searchParams = searchParams; + } + }, { + key: "username", + get: function get() { + return this["super"].username; + }, + set: function set(username) { + this["super"].username = username; + } + }]); + + return URLWithLegacySupport; +}(); + +function format(obj) { + if (typeof obj === 'string') { + var url = new URL(obj); + return url.toString(); + } + + if (!(obj instanceof URL)) { + var userPass = obj.username && obj.password ? "".concat(obj.username, ":").concat(obj.password, "@") : ''; + var auth = obj.auth ? obj.auth + '@' : ''; + var port = obj.port ? ':' + obj.port : ''; + var protocol = obj.protocol ? obj.protocol + '//' : ''; + var host = obj.host || ''; + var hostname = obj.hostname || ''; + var search = obj.search || (obj.query ? '?' + obj.query : ''); + var hash = obj.hash || ''; + var pathname = obj.pathname || ''; + var path = obj.path || pathname + search; + return "".concat(protocol).concat(userPass || auth).concat(host || hostname + port).concat(path).concat(hash); + } +} + +module.exports = { + URLWithLegacySupport: URLWithLegacySupport, + URLSearchParams: self.URLSearchParams, + defaultBase: defaultBase, + format: format +}; + +/***/ }), +/* 164 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var http = __webpack_require__(364); + +var https = http; +var URL = self.URL; +module.exports = { + http: http, + https: https, + getRequest: function getRequest(options, cb) { + var protocol = 'http:'; + + if (typeof options === 'string') { + var url = new URL(options); + protocol = url.protocol; + } else if (options.protocol) { + protocol = options.protocol; + } + + return protocol === 'http:' ? http.request(options, cb) : https.request(options, cb); + } +}; + +/***/ }), +/* 165 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function isFunction(value) { + return typeof value === 'function'; +} + +module.exports = { + fetch: 'fetch' in self && isFunction(self.fecth), + writableStream: 'WritableStream' in self && isFunction(self.WritableStream), + abortController: 'AbortController' in self && isFunction(self.AbortController), + arrayBuffer: 'ArrayBuffer' in self +}; + +/***/ }), +/* 166 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(process, Buffer) { + +var capability = __webpack_require__(165); + +var inherits = __webpack_require__(2); + +var stream = __webpack_require__(5); + +var IncomingMessage = function IncomingMessage(response, mode, fetchTimer) { + var _this = this; + + stream.Readable.call(this); + this._mode = mode; + this.headers = {}; + this.rawHeaders = []; + this.trailers = {}; + this.rawTrailers = []; // Fake the 'close' event, but only once 'end' fires + + this.on('end', function () { + // The nextTick is necessary to prevent the 'request' module from causing an infinite loop + process.nextTick(function () { + return _this.emit('close'); + }); + }); + this._fetchResponse = response; + this.url = response.url; + this.statusCode = response.status; + this.statusMessage = response.statusText; + response.headers.forEach(function (header, key) { + _this.headers[key.toLowerCase()] = header; + + _this.rawHeaders.push(key, header); + }); + + if (capability.writableStream) { + var writable = new WritableStream({ + write: function write(chunk) { + return new Promise(function (resolve, reject) { + if (_this._destroyed) { + reject(); + } else if (_this.push(Buffer.from(chunk))) { + resolve(); + } else { + _this._resumeFetch = resolve; + } + }); + }, + close: function close() { + clearTimeout(fetchTimer); + + if (!_this._destroyed) { + _this.push(null); + } + }, + abort: function abort(err) { + if (!_this._destroyed) { + _this.emit('error', err); + } + } + }); + + try { + response.body.pipeTo(writable)["catch"](function (err) { + console.log(err); + self.clearTimeout(fetchTimer); + + if (!_this._destroyed) { + _this.emit('error', err); + } + }); + return; + } catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this + + } // fallback for when writableStream or pipeTo aren't available + + + var reader = response.body.getReader(); + + function read(context) { + reader.read().then(function (result) { + if (context._destroyed) { + return; + } + + if (result.done) { + clearTimeout(fetchTimer); + context.push(null); + return; + } + + context.push(Buffer.from(result.value)); + read(context); + })["catch"](function (err) { + clearTimeout(fetchTimer); + + if (!context._destroyed) { + context.emit('error', err); + } + }); + } + + read(this); +}; + +inherits(IncomingMessage, stream.Readable); + +IncomingMessage.prototype._read = function () { + var resolve = this._resumeFetch; + + if (resolve) { + this._resumeFetch = null; + resolve(); + } +}; + +module.exports = IncomingMessage; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(6), __webpack_require__(0).Buffer)) + +/***/ }), +/* 167 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var DuplexStream = __webpack_require__(5).Duplex, + util = __webpack_require__(57); + +function BufferList(callback) { + if (!(this instanceof BufferList)) return new BufferList(callback); + this._bufs = []; + this.length = 0; + + if (typeof callback == 'function') { + this._callback = callback; + + var piper = function piper(err) { + if (this._callback) { + this._callback(err); + + this._callback = null; + } + }.bind(this); + + this.on('pipe', function onPipe(src) { + src.on('error', piper); + }); + this.on('unpipe', function onUnpipe(src) { + src.removeListener('error', piper); + }); + } else { + this.append(callback); + } + + DuplexStream.call(this); +} + +util.inherits(BufferList, DuplexStream); + +BufferList.prototype._offset = function _offset(offset) { + var tot = 0, + i = 0, + _t; + + if (offset === 0) return [0, 0]; + + for (; i < this._bufs.length; i++) { + _t = tot + this._bufs[i].length; + + if (offset < _t || i == this._bufs.length - 1) { + return [i, offset - tot]; + } + + tot = _t; + } +}; + +BufferList.prototype._reverseOffset = function (blOffset) { + var bufferId = blOffset[0]; + var offset = blOffset[1]; + + for (var i = 0; i < bufferId; i++) { + offset += this._bufs[i].length; + } + + return offset; +}; + +BufferList.prototype.append = function append(buf) { + var i = 0; + + if (Buffer.isBuffer(buf)) { + this._appendBuffer(buf); + } else if (Array.isArray(buf)) { + for (; i < buf.length; i++) { + this.append(buf[i]); + } + } else if (buf instanceof BufferList) { + // unwrap argument into individual BufferLists + for (; i < buf._bufs.length; i++) { + this.append(buf._bufs[i]); + } + } else if (buf != null) { + // coerce number arguments to strings, since Buffer(number) does + // uninitialized memory allocation + if (typeof buf == 'number') buf = buf.toString(); + + this._appendBuffer(Buffer.from(buf)); + } + + return this; +}; + +BufferList.prototype._appendBuffer = function appendBuffer(buf) { + this._bufs.push(buf); + + this.length += buf.length; +}; + +BufferList.prototype._write = function _write(buf, encoding, callback) { + this._appendBuffer(buf); + + if (typeof callback == 'function') callback(); +}; + +BufferList.prototype._read = function _read(size) { + if (!this.length) return this.push(null); + size = Math.min(size, this.length); + this.push(this.slice(0, size)); + this.consume(size); +}; + +BufferList.prototype.end = function end(chunk) { + DuplexStream.prototype.end.call(this, chunk); + + if (this._callback) { + this._callback(null, this.slice()); + + this._callback = null; + } +}; + +BufferList.prototype.get = function get(index) { + if (index > this.length || index < 0) { + return undefined; + } + + var offset = this._offset(index); + + return this._bufs[offset[0]][offset[1]]; +}; + +BufferList.prototype.slice = function slice(start, end) { + if (typeof start == 'number' && start < 0) start += this.length; + if (typeof end == 'number' && end < 0) end += this.length; + return this.copy(null, 0, start, end); +}; + +BufferList.prototype.copy = function copy(dst, dstStart, srcStart, srcEnd) { + if (typeof srcStart != 'number' || srcStart < 0) srcStart = 0; + if (typeof srcEnd != 'number' || srcEnd > this.length) srcEnd = this.length; + if (srcStart >= this.length) return dst || Buffer.alloc(0); + if (srcEnd <= 0) return dst || Buffer.alloc(0); + + var copy = !!dst, + off = this._offset(srcStart), + len = srcEnd - srcStart, + bytes = len, + bufoff = copy && dstStart || 0, + start = off[1], + l, + i; // copy/slice everything + + + if (srcStart === 0 && srcEnd == this.length) { + if (!copy) { + // slice, but full concat if multiple buffers + return this._bufs.length === 1 ? this._bufs[0] : Buffer.concat(this._bufs, this.length); + } // copy, need to copy individual buffers + + + for (i = 0; i < this._bufs.length; i++) { + this._bufs[i].copy(dst, bufoff); + + bufoff += this._bufs[i].length; + } + + return dst; + } // easy, cheap case where it's a subset of one of the buffers + + + if (bytes <= this._bufs[off[0]].length - start) { + return copy ? this._bufs[off[0]].copy(dst, dstStart, start, start + bytes) : this._bufs[off[0]].slice(start, start + bytes); + } + + if (!copy) // a slice, we need something to copy in to + dst = Buffer.allocUnsafe(len); + + for (i = off[0]; i < this._bufs.length; i++) { + l = this._bufs[i].length - start; + + if (bytes > l) { + this._bufs[i].copy(dst, bufoff, start); + } else { + this._bufs[i].copy(dst, bufoff, start, start + bytes); + + break; + } + + bufoff += l; + bytes -= l; + if (start) start = 0; + } + + return dst; +}; + +BufferList.prototype.shallowSlice = function shallowSlice(start, end) { + start = start || 0; + end = typeof end !== 'number' ? this.length : end; + if (start < 0) start += this.length; + if (end < 0) end += this.length; + + if (start === end) { + return new BufferList(); + } + + var startOffset = this._offset(start), + endOffset = this._offset(end), + buffers = this._bufs.slice(startOffset[0], endOffset[0] + 1); + + if (endOffset[1] == 0) buffers.pop();else buffers[buffers.length - 1] = buffers[buffers.length - 1].slice(0, endOffset[1]); + if (startOffset[1] != 0) buffers[0] = buffers[0].slice(startOffset[1]); + return new BufferList(buffers); +}; + +BufferList.prototype.toString = function toString(encoding, start, end) { + return this.slice(start, end).toString(encoding); +}; + +BufferList.prototype.consume = function consume(bytes) { + while (this._bufs.length) { + if (bytes >= this._bufs[0].length) { + bytes -= this._bufs[0].length; + this.length -= this._bufs[0].length; + + this._bufs.shift(); + } else { + this._bufs[0] = this._bufs[0].slice(bytes); + this.length -= bytes; + break; + } + } + + return this; +}; + +BufferList.prototype.duplicate = function duplicate() { + var i = 0, + copy = new BufferList(); + + for (; i < this._bufs.length; i++) { + copy.append(this._bufs[i]); + } + + return copy; +}; + +BufferList.prototype._destroy = function _destroy(err, cb) { + this._bufs.length = 0; + this.length = 0; + cb(err); +}; + +BufferList.prototype.indexOf = function (search, offset, encoding) { + if (encoding === undefined && typeof offset === 'string') { + encoding = offset; + offset = undefined; + } + + if (typeof search === 'function' || Array.isArray(search)) { + throw new TypeError('The "value" argument must be one of type string, Buffer, BufferList, or Uint8Array.'); + } else if (typeof search === 'number') { + search = Buffer.from([search]); + } else if (typeof search === 'string') { + search = Buffer.from(search, encoding); + } else if (search instanceof BufferList) { + search = search.slice(); + } else if (!Buffer.isBuffer(search)) { + search = Buffer.from(search); + } + + offset = Number(offset || 0); + + if (isNaN(offset)) { + offset = 0; + } + + if (offset < 0) { + offset = this.length + offset; + } + + if (offset < 0) { + offset = 0; + } + + if (search.length === 0) { + return offset > this.length ? this.length : offset; + } + + var blOffset = this._offset(offset); + + var blIndex = blOffset[0]; // index of which internal buffer we're working on + + var buffOffset = blOffset[1]; // offset of the internal buffer we're working on + // scan over each buffer + + for (blIndex; blIndex < this._bufs.length; blIndex++) { + var buff = this._bufs[blIndex]; + + while (buffOffset < buff.length) { + var availableWindow = buff.length - buffOffset; + + if (availableWindow >= search.length) { + var nativeSearchResult = buff.indexOf(search, buffOffset); + + if (nativeSearchResult !== -1) { + return this._reverseOffset([blIndex, nativeSearchResult]); + } + + buffOffset = buff.length - search.length + 1; // end of native search window + } else { + var revOffset = this._reverseOffset([blIndex, buffOffset]); + + if (this._match(revOffset, search)) { + return revOffset; + } + + buffOffset++; + } + } + + buffOffset = 0; + } + + return -1; +}; + +BufferList.prototype._match = function (offset, search) { + if (this.length - offset < search.length) { + return false; + } + + for (var searchOffset = 0; searchOffset < search.length; searchOffset++) { + if (this.get(offset + searchOffset) !== search[searchOffset]) { + return false; + } + } + + return true; +}; + +(function () { + var methods = { + 'readDoubleBE': 8, + 'readDoubleLE': 8, + 'readFloatBE': 4, + 'readFloatLE': 4, + 'readInt32BE': 4, + 'readInt32LE': 4, + 'readUInt32BE': 4, + 'readUInt32LE': 4, + 'readInt16BE': 2, + 'readInt16LE': 2, + 'readUInt16BE': 2, + 'readUInt16LE': 2, + 'readInt8': 1, + 'readUInt8': 1, + 'readIntBE': null, + 'readIntLE': null, + 'readUIntBE': null, + 'readUIntLE': null + }; + + for (var m in methods) { + (function (m) { + if (methods[m] === null) { + BufferList.prototype[m] = function (offset, byteLength) { + return this.slice(offset, offset + byteLength)[m](0, byteLength); + }; + } else { + BufferList.prototype[m] = function (offset) { + return this.slice(offset, offset + methods[m])[m](0); + }; + } + })(m); + } +})(); + +module.exports = BufferList; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 168 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = function () { + var _read, _cb, abortCb, _end; + + var read = function read(end, cb) { + if (!_read) { + if (end) { + _end = end; + abortCb = cb; + } else _cb = cb; + } else _read(end, cb); + }; + + read.resolve = function (read) { + if (_read) throw new Error('already resolved'); + _read = read; + if (!_read) throw new Error('no read cannot resolve!' + _read); + if (_cb) read(null, _cb); + if (abortCb) read(_end, abortCb); + }; + + read.abort = function (err) { + read.resolve(function (_, cb) { + cb(err || true); + }); + }; + + return read; +}; + +/***/ }), +/* 169 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = function (stream) { + var read, + started = false; + + function consume(_read) { + if (!_read) throw new Error('must be passed a readable'); + read = _read; + if (started) stream(read); + } + + consume.resolve = consume.ready = consume.start = function (_stream) { + started = true; + stream = _stream || stream; + if (read) stream(read); + return consume; + }; + + return consume; +}; + +/***/ }), +/* 170 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var alloc = Buffer.alloc; +var ZEROS = '0000000000000000000'; +var SEVENS = '7777777777777777777'; +var ZERO_OFFSET = '0'.charCodeAt(0); +var USTAR = 'ustar\x0000'; +var MASK = parseInt('7777', 8); + +var clamp = function clamp(index, len, defaultValue) { + if (typeof index !== 'number') return defaultValue; + index = ~~index; // Coerce to integer. + + if (index >= len) return len; + if (index >= 0) return index; + index += len; + if (index >= 0) return index; + return 0; +}; + +var toType = function toType(flag) { + switch (flag) { + case 0: + return 'file'; + + case 1: + return 'link'; + + case 2: + return 'symlink'; + + case 3: + return 'character-device'; + + case 4: + return 'block-device'; + + case 5: + return 'directory'; + + case 6: + return 'fifo'; + + case 7: + return 'contiguous-file'; + + case 72: + return 'pax-header'; + + case 55: + return 'pax-global-header'; + + case 27: + return 'gnu-long-link-path'; + + case 28: + case 30: + return 'gnu-long-path'; + } + + return null; +}; + +var toTypeflag = function toTypeflag(flag) { + switch (flag) { + case 'file': + return 0; + + case 'link': + return 1; + + case 'symlink': + return 2; + + case 'character-device': + return 3; + + case 'block-device': + return 4; + + case 'directory': + return 5; + + case 'fifo': + return 6; + + case 'contiguous-file': + return 7; + + case 'pax-header': + return 72; + } + + return 0; +}; + +var indexOf = function indexOf(block, num, offset, end) { + for (; offset < end; offset++) { + if (block[offset] === num) return offset; + } + + return end; +}; + +var cksum = function cksum(block) { + var sum = 8 * 32; + + for (var i = 0; i < 148; i++) { + sum += block[i]; + } + + for (var j = 156; j < 512; j++) { + sum += block[j]; + } + + return sum; +}; + +var encodeOct = function encodeOct(val, n) { + val = val.toString(8); + if (val.length > n) return SEVENS.slice(0, n) + ' ';else return ZEROS.slice(0, n - val.length) + val + ' '; +}; +/* Copied from the node-tar repo and modified to meet + * tar-stream coding standard. + * + * Source: https://github.com/npm/node-tar/blob/51b6627a1f357d2eb433e7378e5f05e83b7aa6cd/lib/header.js#L349 + */ + + +function parse256(buf) { + // first byte MUST be either 80 or FF + // 80 for positive, FF for 2's comp + var positive; + if (buf[0] === 0x80) positive = true;else if (buf[0] === 0xFF) positive = false;else return null; // build up a base-256 tuple from the least sig to the highest + + var zero = false; + var tuple = []; + + for (var i = buf.length - 1; i > 0; i--) { + var _byte = buf[i]; + if (positive) tuple.push(_byte);else if (zero && _byte === 0) tuple.push(0);else if (zero) { + zero = false; + tuple.push(0x100 - _byte); + } else tuple.push(0xFF - _byte); + } + + var sum = 0; + var l = tuple.length; + + for (i = 0; i < l; i++) { + sum += tuple[i] * Math.pow(256, i); + } + + return positive ? sum : -1 * sum; +} + +var decodeOct = function decodeOct(val, offset, length) { + val = val.slice(offset, offset + length); + offset = 0; // If prefixed with 0x80 then parse as a base-256 integer + + if (val[offset] & 0x80) { + return parse256(val); + } else { + // Older versions of tar can prefix with spaces + while (offset < val.length && val[offset] === 32) { + offset++; + } + + var end = clamp(indexOf(val, 32, offset, val.length), val.length, val.length); + + while (offset < end && val[offset] === 0) { + offset++; + } + + if (end === offset) return 0; + return parseInt(val.slice(offset, end).toString(), 8); + } +}; + +var decodeStr = function decodeStr(val, offset, length, encoding) { + return val.slice(offset, indexOf(val, 0, offset, offset + length)).toString(encoding); +}; + +var addLength = function addLength(str) { + var len = Buffer.byteLength(str); + var digits = Math.floor(Math.log(len) / Math.log(10)) + 1; + if (len + digits >= Math.pow(10, digits)) digits++; + return len + digits + str; +}; + +exports.decodeLongPath = function (buf, encoding) { + return decodeStr(buf, 0, buf.length, encoding); +}; + +exports.encodePax = function (opts) { + // TODO: encode more stuff in pax + var result = ''; + if (opts.name) result += addLength(' path=' + opts.name + '\n'); + if (opts.linkname) result += addLength(' linkpath=' + opts.linkname + '\n'); + var pax = opts.pax; + + if (pax) { + for (var key in pax) { + result += addLength(' ' + key + '=' + pax[key] + '\n'); + } + } + + return Buffer.from(result); +}; + +exports.decodePax = function (buf) { + var result = {}; + + while (buf.length) { + var i = 0; + + while (i < buf.length && buf[i] !== 32) { + i++; + } + + var len = parseInt(buf.slice(0, i).toString(), 10); + if (!len) return result; + var b = buf.slice(i + 1, len - 1).toString(); + var keyIndex = b.indexOf('='); + if (keyIndex === -1) return result; + result[b.slice(0, keyIndex)] = b.slice(keyIndex + 1); + buf = buf.slice(len); + } + + return result; +}; + +exports.encode = function (opts) { + var buf = alloc(512); + var name = opts.name; + var prefix = ''; + if (opts.typeflag === 5 && name[name.length - 1] !== '/') name += '/'; + if (Buffer.byteLength(name) !== name.length) return null; // utf-8 + + while (Buffer.byteLength(name) > 100) { + var i = name.indexOf('/'); + if (i === -1) return null; + prefix += prefix ? '/' + name.slice(0, i) : name.slice(0, i); + name = name.slice(i + 1); + } + + if (Buffer.byteLength(name) > 100 || Buffer.byteLength(prefix) > 155) return null; + if (opts.linkname && Buffer.byteLength(opts.linkname) > 100) return null; + buf.write(name); + buf.write(encodeOct(opts.mode & MASK, 6), 100); + buf.write(encodeOct(opts.uid, 6), 108); + buf.write(encodeOct(opts.gid, 6), 116); + buf.write(encodeOct(opts.size, 11), 124); + buf.write(encodeOct(opts.mtime.getTime() / 1000 | 0, 11), 136); + buf[156] = ZERO_OFFSET + toTypeflag(opts.type); + if (opts.linkname) buf.write(opts.linkname, 157); + buf.write(USTAR, 257); + if (opts.uname) buf.write(opts.uname, 265); + if (opts.gname) buf.write(opts.gname, 297); + buf.write(encodeOct(opts.devmajor || 0, 6), 329); + buf.write(encodeOct(opts.devminor || 0, 6), 337); + if (prefix) buf.write(prefix, 345); + buf.write(encodeOct(cksum(buf), 6), 148); + return buf; +}; + +exports.decode = function (buf, filenameEncoding) { + var typeflag = buf[156] === 0 ? 0 : buf[156] - ZERO_OFFSET; + var name = decodeStr(buf, 0, 100, filenameEncoding); + var mode = decodeOct(buf, 100, 8); + var uid = decodeOct(buf, 108, 8); + var gid = decodeOct(buf, 116, 8); + var size = decodeOct(buf, 124, 12); + var mtime = decodeOct(buf, 136, 12); + var type = toType(typeflag); + var linkname = buf[157] === 0 ? null : decodeStr(buf, 157, 100, filenameEncoding); + var uname = decodeStr(buf, 265, 32); + var gname = decodeStr(buf, 297, 32); + var devmajor = decodeOct(buf, 329, 8); + var devminor = decodeOct(buf, 337, 8); + if (buf[345]) name = decodeStr(buf, 345, 155, filenameEncoding) + '/' + name; // to support old tar versions that use trailing / to indicate dirs + + if (typeflag === 0 && name && name[name.length - 1] === '/') typeflag = 5; + var c = cksum(buf); // checksum is still initial value if header was null. + + if (c === 8 * 32) return null; // valid checksum + + if (c !== decodeOct(buf, 148, 8)) throw new Error('Invalid tar header. Maybe the tar is corrupted or it needs to be gunzipped?'); + return { + name: name, + mode: mode, + uid: uid, + gid: gid, + size: size, + mtime: new Date(1000 * mtime), + type: type, + linkname: linkname, + uname: uname, + gname: gname, + devmajor: devmajor, + devminor: devminor + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 171 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var pkg = __webpack_require__(382); + +exports = module.exports = function () { + return { + 'api-path': '/api/v0/', + 'user-agent': "/node-".concat(pkg.name, "/").concat(pkg.version, "/"), + host: 'localhost', + port: '5001', + protocol: 'http' + }; +}; + +/***/ }), +/* 172 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var Qs = __webpack_require__(383); + +var qsDefaultEncoder = __webpack_require__(92).encode; + +var isNode = __webpack_require__(44); + +var ndjson = __webpack_require__(93); + +var pump = __webpack_require__(11); + +var once = __webpack_require__(17); + +var _require = __webpack_require__(164), + getRequest = _require.getRequest; + +var streamToValue = __webpack_require__(26); + +var streamToJsonValue = __webpack_require__(388); + +var log = __webpack_require__(389)('ipfs-http-client:request'); // -- Internal + + +function hasJSONHeaders(res) { + return res.headers['content-type'] && res.headers['content-type'].indexOf('application/json') === 0; +} + +function parseError(res, cb) { + var error = new Error("Server responded with ".concat(res.statusCode)); + error.statusCode = res.statusCode; + + if (!hasJSONHeaders(res)) { + return streamToValue(res, function (err, data) { + // eslint-disable-line handle-callback-err + // the `err` here refers to errors in stream processing, which + // we ignore here, since we already have a valid `error` response + // from the server above that we have to report to the caller. + if (data && data.length) { + error.message = data.toString(); + } + + cb(error); + }); + } + + streamToJsonValue(res, function (err, payload) { + if (err) { + return cb(err); + } + + if (payload) { + error.code = payload.Code; + error.message = payload.Message || payload.toString(); + error.type = payload.Type; + } + + cb(error); + }); +} + +function onRes(buffer, cb) { + return function (res) { + var stream = Boolean(res.headers['x-stream-output']); + var chunkedObjects = Boolean(res.headers['x-chunked-output']); + var isJson = hasJSONHeaders(res); + + if (res.req) { + log(res.req.method, "".concat(res.req.getHeaders().host).concat(res.req.path), res.statusCode, res.statusMessage); + } else { + log(res.url, res.statusCode, res.statusMessage); + } + + if (res.statusCode >= 400 || !res.statusCode) { + return parseError(res, cb); + } // Return the response stream directly + + + if (stream && !buffer) { + return cb(null, res); + } // Return a stream of JSON objects + + + if (chunkedObjects && isJson) { + var outputStream = ndjson.parse(); + pump(res, outputStream); + res.on('end', function () { + var err = res.trailers['x-stream-error']; + + if (err) { + // Not all errors are JSON + try { + err = JSON.parse(err); + } catch (e) { + err = { + Message: err + }; + } + + outputStream.emit('error', new Error(err.Message)); + } + }); + return cb(null, outputStream); + } // Return a JSON object + + + if (isJson) { + return streamToJsonValue(res, cb); + } // Return a value + + + return streamToValue(res, cb); + }; +} + +function requestAPI(config, options, callback) { + callback = once(callback); + options.qs = options.qs || {}; + + if (Array.isArray(options.path)) { + options.path = options.path.join('/'); + } + + if (options.args && !Array.isArray(options.args)) { + options.args = [options.args]; + } + + if (options.args) { + options.qs.arg = options.args; + } + + if (options.progress) { + options.qs.progress = true; + } + + if (options.qs.r) { + options.qs.recursive = options.qs.r; // From IPFS 0.4.0, it throws an error when both r and recursive are passed + + delete options.qs.r; + } + + options.qs['stream-channels'] = true; + + if (options.stream) { + options.buffer = false; + } // this option is only used internally, not passed to daemon + + + delete options.qs.followSymlinks; + var method = 'POST'; + var headers = Object.assign({}, config.headers); + + if (isNode) { + // Browsers do not allow you to modify the user agent + headers['User-Agent'] = config['user-agent']; + } + + if (options.multipart) { + if (!options.multipartBoundary) { + return callback(new Error('No multipartBoundary')); + } + + headers['Content-Type'] = "multipart/form-data; boundary=".concat(options.multipartBoundary); + } + + var qs = Qs.stringify(options.qs, { + arrayFormat: 'repeat', + encoder: function encoder(data) { + // TODO: future releases of qs will provide the default + // encoder as a 2nd argument to this function; it will + // no longer be necessary to import qsDefaultEncoder + if (Buffer.isBuffer(data)) { + var uriEncoded = ''; + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = data[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var _byte = _step.value; + + // https://tools.ietf.org/html/rfc3986#page-14 + // ALPHA (%41-%5A and %61-%7A), DIGIT (%30-%39), hyphen (%2D), period (%2E), underscore (%5F), or tilde (%7E) + if (_byte >= 0x41 && _byte <= 0x5A || _byte >= 0x61 && _byte <= 0x7A || _byte >= 0x30 && _byte <= 0x39 || _byte === 0x2D || _byte === 0x2E || _byte === 0x5F || _byte === 0x7E) { + uriEncoded += String.fromCharCode(_byte); + } else { + var hex = _byte.toString(16); // String.prototype.padStart() not widely supported yet + + + var padded = hex.length === 1 ? "0".concat(hex) : hex; + uriEncoded += "%".concat(padded); + } + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator["return"] != null) { + _iterator["return"](); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } + + return uriEncoded; + } + + return qsDefaultEncoder(data); + } + }); + var reqOptions = { + hostname: config.host, + path: "".concat(config['api-path']).concat(options.path, "?").concat(qs), + port: config.port, + method: method, + headers: headers, + protocol: "".concat(config.protocol, ":") + }; + var req = getRequest(reqOptions, onRes(options.buffer, callback)); + req.on('error', function (err) { + callback(err); + }); + + if (!options.stream) { + req.end(); + } + + return req; +} // +// -- Module Interface + + +exports = module.exports = function (config) { + /* + * options: { + * path: // API path (like /add or /config) - type: string + * args: // Arguments to the command - type: object + * qs: // Opts as query string opts to the command --something - type: object + * files: // files to be sent - type: string, buffer or array of strings or buffers + * buffer: // buffer the request before sending it - type: bool + * } + */ + var send = function send(options, callback) { + if (_typeof(options) !== 'object') { + return callback(new Error('no options were passed')); + } + + return requestAPI(config, options, callback); + }; // Send a HTTP request and pass via a transform function + // to convert the response data to wanted format before + // returning it to the callback. + // Eg. send.andTransform({}, (e) => JSON.parse(e), (err, res) => ...) + + + send.andTransform = function (options, transform, callback) { + return send(options, function (err, res) { + if (err) { + return callback(err); + } + + transform(res, callback); + }); + }; + + return send; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 173 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var replace = String.prototype.replace; +var percentTwenties = /%20/g; +module.exports = { + 'default': 'RFC3986', + formatters: { + RFC1738: function RFC1738(value) { + return replace.call(value, percentTwenties, '+'); + }, + RFC3986: function RFC3986(value) { + return value; + } + }, + RFC1738: 'RFC1738', + RFC3986: 'RFC3986' +}; + +/***/ }), +/* 174 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = function abortCb(cb, abort, onAbort) { + cb(abort); + onAbort && onAbort(abort === true ? null : abort); + return; +}; + +/***/ }), +/* 175 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var sources = __webpack_require__(397); + +var sinks = __webpack_require__(403); + +var throughs = __webpack_require__(409); + +exports = module.exports = __webpack_require__(59); +exports.pull = exports; + +for (var k in sources) { + exports[k] = sources[k]; +} + +for (var k in throughs) { + exports[k] = throughs[k]; +} + +for (var k in sinks) { + exports[k] = sinks[k]; +} + +/***/ }), +/* 176 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var abortCb = __webpack_require__(174); + +module.exports = function once(value, onAbort) { + return function (abort, cb) { + if (abort) return abortCb(cb, abort, onAbort); + + if (value != null) { + var _value = value; + value = null; + cb(null, _value); + } else cb(true); + }; +}; + +/***/ }), +/* 177 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var prop = __webpack_require__(45); + +function id(e) { + return e; +} + +module.exports = function tester(test) { + return 'object' === _typeof(test) && 'function' === typeof test.test //regexp + ? function (data) { + return test.test(data); + } : prop(test) || id; +}; + +/***/ }), +/* 178 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function id(e) { + return e; +} + +var prop = __webpack_require__(45); + +var filter = __webpack_require__(96); //drop items you have already seen. + + +module.exports = function unique(field, invert) { + field = prop(field) || id; + var seen = {}; + return filter(function (data) { + var key = field(data); + if (seen[key]) return !!invert; //false, by default + else seen[key] = true; + return !invert; //true by default + }); +}; + +/***/ }), +/* 179 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +module.exports = function (args) { + var callback = args.pop(); + var opts = {}; + var sources = []; + + if (!Array.isArray(args[args.length - 1]) && _typeof(args[args.length - 1]) === 'object') { + opts = args.pop(); + } + + if (args.length === 1 && Array.isArray(args[0])) { + // support ipfs.file.cp([src, dest], opts, cb) + sources = args[0]; + } else { + // support ipfs.file.cp(src, dest, opts, cb) and ipfs.file.cp(src1, src2, dest, opts, cb) + sources = args; + } + + return { + callback: callback, + sources: sources, + opts: opts + }; +}; + +/***/ }), +/* 180 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var _require = __webpack_require__(5), + Transform = _require.Transform, + PassThrough = _require.PassThrough; + +var pump = __webpack_require__(11); + +var ndjson = __webpack_require__(93); + +var isStream = __webpack_require__(58); + +var toEntry = function toEntry(entry) { + return { + name: entry.Name, + type: entry.Type, + size: entry.Size, + hash: entry.Hash + }; +}; + +module.exports = function (send) { + return function (args, opts) { + opts = opts || {}; + var transform = new Transform({ + objectMode: true, + transform: function transform(entry, encoding, callback) { + callback(null, toEntry(entry)); + } + }); + var output = new PassThrough({ + objectMode: true + }); + send({ + path: 'files/ls', + args: args, + qs: Object.assign({}, opts, { + stream: true + }) + }, function (err, res) { + if (err) { + return output.destroy(err); + } + + if (isStream(res)) { + var parse = ndjson.parse(); + pump(res, parse, transform, output); + } else { + var entries = res.Entries || []; + entries.forEach(function (entry) { + output.write(toEntry(entry)); + }); + output.end(); + } + }); + return output; + }; +}; + +/***/ }), +/* 181 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var moduleConfig = __webpack_require__(3); + +module.exports = function (arg) { + var send = moduleConfig(arg); + return { + get: __webpack_require__(433)(send), + stat: __webpack_require__(434)(send), + put: __webpack_require__(435)(send) + }; +}; + +/***/ }), +/* 182 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var CID = __webpack_require__(4); + +var withIs = __webpack_require__(27); +/** + * Represents an immutable block of data that is uniquely referenced with a cid. + * + * @constructor + * @param {Buffer} data - The data to be stored in the block as a buffer. + * @param {CID} cid - The cid of the data + * + * @example + * const block = new Block(new Buffer('a012d83b20f9371...')) + */ + + +var Block = +/*#__PURE__*/ +function () { + function Block(data, cid) { + _classCallCheck(this, Block); + + if (!data || !Buffer.isBuffer(data)) { + throw new Error('first argument must be a buffer'); + } + + if (!cid || !CID.isCID(cid)) { + throw new Error('second argument must be a CID'); + } + + this._data = data; + this._cid = cid; + } + /** + * The data of this block. + * + * @type {Buffer} + */ + + + _createClass(Block, [{ + key: "data", + get: function get() { + return this._data; + }, + set: function set(val) { + throw new Error('Tried to change an immutable block'); + } + /** + * The cid of the data this block represents. + * + * @type {CID} + */ + + }, { + key: "cid", + get: function get() { + return this._cid; + }, + set: function set(val) { + throw new Error('Tried to change an immutable block'); + } + }]); + + return Block; +}(); + +module.exports = withIs(Block, { + className: 'Block', + symbolName: '@ipfs/js-ipfs-block/block' +}); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 183 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + +/** + * Make certain getters enumnerable + * + * This can be used to add additional getters that are enumerable and hence + * show up on an `Object.keys()` call. + * + * @param {Object} object - The object it should be applied to + * @param {Array.} fields - The fields that should be made enumnerable + */ + +var addEnumerableGetters = function addEnumerableGetters(object, fields) { + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = fields[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var field = _step.value; + var prop = void 0; + var proto = object; // Walk up the proottype chain until a property with the given name is + // found + + while (prop === undefined) { + proto = Object.getPrototypeOf(proto); + + if (proto === null) { + throw new Error("no getter named '".concat(field, "' found")); + } + + prop = Object.getOwnPropertyDescriptor(proto, field); + } // There is a property with the correct name, but it's not a getter + + + if (prop.get === undefined) { + throw new Error("no getter named '".concat(field, "' found")); + } + + Object.defineProperty(object, field, { + enumerable: true, + get: prop.get + }); + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator["return"] != null) { + _iterator["return"](); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } +}; +/** + * Makes all properties with a leading underscore non-enumerable. + * + * @param {Object} object - The object it should be applied to + */ + + +var hidePrivateFields = function hidePrivateFields(object) { + for (var key in object) { + if (key[0] === '_') { + Object.defineProperty(object, key, { + enumerable: false + }); + } + } +}; + +module.exports = { + addEnumerableGetters: addEnumerableGetters, + hidePrivateFields: hidePrivateFields +}; + +/***/ }), +/* 184 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var _regenerator = _interopRequireDefault(__webpack_require__(15)); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } + +function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } } + +function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; } + +var _require = __webpack_require__(0), + Buffer = _require.Buffer; + +var errcode = __webpack_require__(97); + +var multihash = __webpack_require__(14); + +var crypto = __webpack_require__(447); +/** + * Hash the given `buf` using the algorithm specified by `alg`. + * @param {Buffer} buf - The value to hash. + * @param {number|string} alg - The algorithm to use eg 'sha1' + * @param {number} [length] - Optionally trim the result to this length. + * @returns {Promise} + */ + + +function Multihashing(_x, _x2, _x3) { + return _Multihashing.apply(this, arguments); +} +/** + * The `buffer` module for easy use in the browser. + * + * @type {Buffer} + */ + + +function _Multihashing() { + _Multihashing = _asyncToGenerator( + /*#__PURE__*/ + _regenerator["default"].mark(function _callee3(buf, alg, length) { + var digest; + return _regenerator["default"].wrap(function _callee3$(_context3) { + while (1) { + switch (_context3.prev = _context3.next) { + case 0: + _context3.next = 2; + return Multihashing.digest(buf, alg, length); + + case 2: + digest = _context3.sent; + return _context3.abrupt("return", multihash.encode(digest, alg, length)); + + case 4: + case "end": + return _context3.stop(); + } + } + }, _callee3); + })); + return _Multihashing.apply(this, arguments); +} + +Multihashing.Buffer = Buffer; // for browser things + +/** + * Expose multihash itself, to avoid silly double requires. + */ + +Multihashing.multihash = multihash; +/** + * @param {Buffer} buf - The value to hash. + * @param {number|string} alg - The algorithm to use eg 'sha1' + * @param {number} [length] - Optionally trim the result to this length. + * @returns {Promise} + */ + +Multihashing.digest = +/*#__PURE__*/ +function () { + var _ref = _asyncToGenerator( + /*#__PURE__*/ + _regenerator["default"].mark(function _callee(buf, alg, length) { + var hash, digest; + return _regenerator["default"].wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + hash = Multihashing.createHash(alg); + _context.next = 3; + return hash(buf); + + case 3: + digest = _context.sent; + return _context.abrupt("return", length ? digest.slice(0, length) : digest); + + case 5: + case "end": + return _context.stop(); + } + } + }, _callee); + })); + + return function (_x4, _x5, _x6) { + return _ref.apply(this, arguments); + }; +}(); +/** + * Creates a function that hashes with the given algorithm + * + * @param {string|number} alg - The algorithm to use eg 'sha1' + * + * @returns {function} - The hash function corresponding to `alg` + */ + + +Multihashing.createHash = function (alg) { + if (!alg) { + throw errcode('hash algorithm must be specified', 'ERR_HASH_ALGORITHM_NOT_SPECIFIED'); + } + + alg = multihash.coerceCode(alg); + + if (!Multihashing.functions[alg]) { + throw errcode("multihash function '".concat(alg, "' not yet supported"), 'ERR_HASH_ALGORITHM_NOT_SUPPORTED'); + } + + return Multihashing.functions[alg]; +}; +/** + * Mapping of multihash codes to their hashing functions. + * @type {Object} + */ + + +Multihashing.functions = { + // sha1 + 0x11: crypto.sha1, + // sha2-256 + 0x12: crypto.sha2256, + // sha2-512 + 0x13: crypto.sha2512, + // sha3-512 + 0x14: crypto.sha3512, + // sha3-384 + 0x15: crypto.sha3384, + // sha3-256 + 0x16: crypto.sha3256, + // sha3-224 + 0x17: crypto.sha3224, + // shake-128 + 0x18: crypto.shake128, + // shake-256 + 0x19: crypto.shake256, + // keccak-224 + 0x1A: crypto.keccak224, + // keccak-256 + 0x1B: crypto.keccak256, + // keccak-384 + 0x1C: crypto.keccak384, + // keccak-512 + 0x1D: crypto.keccak512, + // murmur3-128 + 0x22: crypto.murmur3128, + // murmur3-32 + 0x23: crypto.murmur332, + // dbl-sha2-256 + 0x56: crypto.dblSha2256 // add blake functions + +}; +crypto.addBlake(Multihashing.functions); + +Multihashing.validate = +/*#__PURE__*/ +function () { + var _ref2 = _asyncToGenerator( + /*#__PURE__*/ + _regenerator["default"].mark(function _callee2(buf, hash) { + var newHash; + return _regenerator["default"].wrap(function _callee2$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + _context2.next = 2; + return Multihashing(buf, multihash.decode(hash).name); + + case 2: + newHash = _context2.sent; + return _context2.abrupt("return", Buffer.compare(hash, newHash) === 0); + + case 4: + case "end": + return _context2.stop(); + } + } + }, _callee2); + })); + + return function (_x7, _x8) { + return _ref2.apply(this, arguments); + }; +}(); + +module.exports = Multihashing; + +/***/ }), +/* 185 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.util = __webpack_require__(186); +exports.resolver = __webpack_require__(463); +exports.codec = exports.util.codec; +exports.defaultHashAlg = exports.util.defaultHashAlg; + +/***/ }), +/* 186 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var _regenerator = _interopRequireDefault(__webpack_require__(15)); + +function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; } + +function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } } + +function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; } + +function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var cbor = __webpack_require__(457); + +var multicodec = __webpack_require__(50); + +var multihashing = __webpack_require__(184); + +var CID = __webpack_require__(4); + +var isCircular = __webpack_require__(461); // https://github.com/ipfs/go-ipfs/issues/3570#issuecomment-273931692 + + +var CID_CBOR_TAG = 42; + +function tagCID(cid) { + if (typeof cid === 'string') { + cid = new CID(cid).buffer; + } else if (CID.isCID(cid)) { + cid = cid.buffer; + } + + return new cbor.Tagged(CID_CBOR_TAG, Buffer.concat([Buffer.from('00', 'hex'), // thanks jdag + cid])); +} + +function replaceCIDbyTAG(dagNode) { + var circular; + + try { + circular = isCircular(dagNode); + } catch (e) { + circular = false; + } + + if (circular) { + throw new Error('The object passed has circular references'); + } + + function transform(obj) { + if (!obj || Buffer.isBuffer(obj) || typeof obj === 'string') { + return obj; + } + + if (Array.isArray(obj)) { + return obj.map(transform); + } + + if (CID.isCID(obj)) { + return tagCID(obj); + } + + var keys = Object.keys(obj); + + if (keys.length > 0) { + // Recursive transform + var out = {}; + keys.forEach(function (key) { + if (_typeof(obj[key]) === 'object') { + out[key] = transform(obj[key]); + } else { + out[key] = obj[key]; + } + }); + return out; + } else { + return obj; + } + } + + return transform(dagNode); +} + +exports = module.exports; +exports.codec = multicodec.DAG_CBOR; +exports.defaultHashAlg = multicodec.SHA2_256; + +var defaultTags = _defineProperty({}, CID_CBOR_TAG, function (val) { + // remove that 0 + val = val.slice(1); + return new CID(val); +}); + +var defaultSize = 64 * 1024; // current decoder heap size, 64 Kb + +var currentSize = defaultSize; +var defaultMaxSize = 64 * 1024 * 1024; // max heap size when auto-growing, 64 Mb + +var maxSize = defaultMaxSize; +var decoder = null; +/** + * Configure the underlying CBOR decoder. + * + * @param {Object} [options] - The options the decoder takes. The decoder will reset to the defaul values if no options are given. + * @param {number} [options.size=65536] - The current heap size used in CBOR parsing, this may grow automatically as larger blocks are encountered up to `maxSize` + * @param {number} [options.maxSize=67108864] - The maximum size the CBOR parsing heap is allowed to grow to before `dagCBOR.util.deserialize()` returns an error + * @param {Object} [options.tags] - An object whose keys are CBOR tag numbers and values are transform functions that accept a `value` and return a decoded representation of that `value` + */ + +exports.configureDecoder = function (options) { + var tags = defaultTags; + + if (options) { + if (typeof options.size === 'number') { + currentSize = options.size; + } + + if (typeof options.maxSize === 'number') { + maxSize = options.maxSize; + } + + if (options.tags) { + tags = Object.assign({}, defaultTags, options && options.tags); + } + } else { + // no options, reset to defaults + currentSize = defaultSize; + maxSize = defaultMaxSize; + } + + var decoderOptions = { + tags: tags, + size: currentSize + }; + decoder = new cbor.Decoder(decoderOptions); // borc edits opts.size in-place so we can capture _actual_ size + + currentSize = decoderOptions.size; +}; + +exports.configureDecoder(); // Setup default cbor.Decoder + +/** + * Serialize internal representation into a binary CBOR block. + * + * @param {Object} node - Internal representation of a CBOR block + * @returns {Buffer} - The encoded binary representation + */ + +exports.serialize = function (node) { + var nodeTagged = replaceCIDbyTAG(node); + var serialized = cbor.encode(nodeTagged); + return serialized; +}; +/** + * Deserialize CBOR block into the internal representation. + * + * @param {Buffer} data - Binary representation of a CBOR block + * @returns {Object} - An object that conforms to the IPLD Data Model + */ + + +exports.deserialize = function (data) { + if (data.length > currentSize && data.length <= maxSize) { + exports.configureDecoder({ + size: data.length + }); + } + + if (data.length > currentSize) { + throw new Error('Data is too large to deserialize with current decoder'); + } + + var deserialized = decoder.decodeFirst(data); + return deserialized; +}; +/** + * Calculate the CID of the binary blob. + * + * @param {Object} binaryBlob - Encoded IPLD Node + * @param {Object} [userOptions] - Options to create the CID + * @param {number} [userOptions.cidVersion=1] - CID version number + * @param {string} [UserOptions.hashAlg] - Defaults to the defaultHashAlg of the format + * @returns {Promise.} + */ + + +exports.cid = +/*#__PURE__*/ +function () { + var _ref = _asyncToGenerator( + /*#__PURE__*/ + _regenerator["default"].mark(function _callee(binaryBlob, userOptions) { + var defaultOptions, options, multihash, codecName, cid; + return _regenerator["default"].wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + defaultOptions = { + cidVersion: 1, + hashAlg: exports.defaultHashAlg + }; + options = Object.assign(defaultOptions, userOptions); + _context.next = 4; + return multihashing(binaryBlob, options.hashAlg); + + case 4: + multihash = _context.sent; + codecName = multicodec.print[exports.codec]; + cid = new CID(options.cidVersion, codecName, multihash); + return _context.abrupt("return", cid); + + case 8: + case "end": + return _context.stop(); + } + } + }, _callee); + })); + + return function (_x, _x2) { + return _ref.apply(this, arguments); + }; +}(); +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 187 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer, global) { + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var ieee754 = __webpack_require__(102); + +var Bignumber = __webpack_require__(20); + +var parser = __webpack_require__(459); + +var utils = __webpack_require__(98); + +var c = __webpack_require__(66); + +var Simple = __webpack_require__(188); + +var Tagged = __webpack_require__(189); + +var _require = __webpack_require__(88), + URL = _require.URL; +/** + * Transform binary cbor data into JavaScript objects. + */ + + +var Decoder = +/*#__PURE__*/ +function () { + /** + * @param {Object} [opts={}] + * @param {number} [opts.size=65536] - Size of the allocated heap. + */ + function Decoder(opts) { + _classCallCheck(this, Decoder); + + opts = opts || {}; + + if (!opts.size || opts.size < 0x10000) { + opts.size = 0x10000; + } else { + // Ensure the size is a power of 2 + opts.size = utils.nextPowerOf2(opts.size); + } // Heap use to share the input with the parser + + + this._heap = new ArrayBuffer(opts.size); + this._heap8 = new Uint8Array(this._heap); + this._buffer = Buffer.from(this._heap); + + this._reset(); // Known tags + + + this._knownTags = Object.assign({ + 0: function _(val) { + return new Date(val); + }, + 1: function _(val) { + return new Date(val * 1000); + }, + 2: function _(val) { + return utils.arrayBufferToBignumber(val); + }, + 3: function _(val) { + return c.NEG_ONE.minus(utils.arrayBufferToBignumber(val)); + }, + 4: function _(v) { + // const v = new Uint8Array(val) + return c.TEN.pow(v[0]).times(v[1]); + }, + 5: function _(v) { + // const v = new Uint8Array(val) + return c.TWO.pow(v[0]).times(v[1]); + }, + 32: function _(val) { + return new URL(val); + }, + 35: function _(val) { + return new RegExp(val); + } + }, opts.tags); // Initialize asm based parser + + this.parser = parser(global, { + log: console.log.bind(console), + pushInt: this.pushInt.bind(this), + pushInt32: this.pushInt32.bind(this), + pushInt32Neg: this.pushInt32Neg.bind(this), + pushInt64: this.pushInt64.bind(this), + pushInt64Neg: this.pushInt64Neg.bind(this), + pushFloat: this.pushFloat.bind(this), + pushFloatSingle: this.pushFloatSingle.bind(this), + pushFloatDouble: this.pushFloatDouble.bind(this), + pushTrue: this.pushTrue.bind(this), + pushFalse: this.pushFalse.bind(this), + pushUndefined: this.pushUndefined.bind(this), + pushNull: this.pushNull.bind(this), + pushInfinity: this.pushInfinity.bind(this), + pushInfinityNeg: this.pushInfinityNeg.bind(this), + pushNaN: this.pushNaN.bind(this), + pushNaNNeg: this.pushNaNNeg.bind(this), + pushArrayStart: this.pushArrayStart.bind(this), + pushArrayStartFixed: this.pushArrayStartFixed.bind(this), + pushArrayStartFixed32: this.pushArrayStartFixed32.bind(this), + pushArrayStartFixed64: this.pushArrayStartFixed64.bind(this), + pushObjectStart: this.pushObjectStart.bind(this), + pushObjectStartFixed: this.pushObjectStartFixed.bind(this), + pushObjectStartFixed32: this.pushObjectStartFixed32.bind(this), + pushObjectStartFixed64: this.pushObjectStartFixed64.bind(this), + pushByteString: this.pushByteString.bind(this), + pushByteStringStart: this.pushByteStringStart.bind(this), + pushUtf8String: this.pushUtf8String.bind(this), + pushUtf8StringStart: this.pushUtf8StringStart.bind(this), + pushSimpleUnassigned: this.pushSimpleUnassigned.bind(this), + pushTagUnassigned: this.pushTagUnassigned.bind(this), + pushTagStart: this.pushTagStart.bind(this), + pushTagStart4: this.pushTagStart4.bind(this), + pushTagStart8: this.pushTagStart8.bind(this), + pushBreak: this.pushBreak.bind(this) + }, this._heap); + } + + _createClass(Decoder, [{ + key: "_closeParent", + // Finish the current parent + value: function _closeParent() { + var p = this._parents.pop(); + + if (p.length > 0) { + throw new Error("Missing ".concat(p.length, " elements")); + } + + switch (p.type) { + case c.PARENT.TAG: + this._push(this.createTag(p.ref[0], p.ref[1])); + + break; + + case c.PARENT.BYTE_STRING: + this._push(this.createByteString(p.ref, p.length)); + + break; + + case c.PARENT.UTF8_STRING: + this._push(this.createUtf8String(p.ref, p.length)); + + break; + + case c.PARENT.MAP: + if (p.values % 2 > 0) { + throw new Error('Odd number of elements in the map'); + } + + this._push(this.createMap(p.ref, p.length)); + + break; + + case c.PARENT.OBJECT: + if (p.values % 2 > 0) { + throw new Error('Odd number of elements in the map'); + } + + this._push(this.createObject(p.ref, p.length)); + + break; + + case c.PARENT.ARRAY: + this._push(this.createArray(p.ref, p.length)); + + break; + + default: + break; + } + + if (this._currentParent && this._currentParent.type === c.PARENT.TAG) { + this._dec(); + } + } // Reduce the expected length of the current parent by one + + }, { + key: "_dec", + value: function _dec() { + var p = this._currentParent; // The current parent does not know the epxected child length + + if (p.length < 0) { + return; + } + + p.length--; // All children were seen, we can close the current parent + + if (p.length === 0) { + this._closeParent(); + } + } // Push any value to the current parent + + }, { + key: "_push", + value: function _push(val, hasChildren) { + var p = this._currentParent; + p.values++; + + switch (p.type) { + case c.PARENT.ARRAY: + case c.PARENT.BYTE_STRING: + case c.PARENT.UTF8_STRING: + if (p.length > -1) { + this._ref[this._ref.length - p.length] = val; + } else { + this._ref.push(val); + } + + this._dec(); + + break; + + case c.PARENT.OBJECT: + if (p.tmpKey != null) { + this._ref[p.tmpKey] = val; + p.tmpKey = null; + + this._dec(); + } else { + p.tmpKey = val; + + if (typeof p.tmpKey !== 'string') { + // too bad, convert to a Map + p.type = c.PARENT.MAP; + p.ref = utils.buildMap(p.ref); + } + } + + break; + + case c.PARENT.MAP: + if (p.tmpKey != null) { + this._ref.set(p.tmpKey, val); + + p.tmpKey = null; + + this._dec(); + } else { + p.tmpKey = val; + } + + break; + + case c.PARENT.TAG: + this._ref.push(val); + + if (!hasChildren) { + this._dec(); + } + + break; + + default: + throw new Error('Unknown parent type'); + } + } // Create a new parent in the parents list + + }, { + key: "_createParent", + value: function _createParent(obj, type, len) { + this._parents[this._depth] = { + type: type, + length: len, + ref: obj, + values: 0, + tmpKey: null + }; + } // Reset all state back to the beginning, also used for initiatlization + + }, { + key: "_reset", + value: function _reset() { + this._res = []; + this._parents = [{ + type: c.PARENT.ARRAY, + length: -1, + ref: this._res, + values: 0, + tmpKey: null + }]; + } // -- Interface to customize deoding behaviour + + }, { + key: "createTag", + value: function createTag(tagNumber, value) { + var typ = this._knownTags[tagNumber]; + + if (!typ) { + return new Tagged(tagNumber, value); + } + + return typ(value); + } + }, { + key: "createMap", + value: function createMap(obj, len) { + return obj; + } + }, { + key: "createObject", + value: function createObject(obj, len) { + return obj; + } + }, { + key: "createArray", + value: function createArray(arr, len) { + return arr; + } + }, { + key: "createByteString", + value: function createByteString(raw, len) { + return Buffer.concat(raw); + } + }, { + key: "createByteStringFromHeap", + value: function createByteStringFromHeap(start, end) { + if (start === end) { + return Buffer.alloc(0); + } + + return Buffer.from(this._heap.slice(start, end)); + } + }, { + key: "createInt", + value: function createInt(val) { + return val; + } + }, { + key: "createInt32", + value: function createInt32(f, g) { + return utils.buildInt32(f, g); + } + }, { + key: "createInt64", + value: function createInt64(f1, f2, g1, g2) { + return utils.buildInt64(f1, f2, g1, g2); + } + }, { + key: "createFloat", + value: function createFloat(val) { + return val; + } + }, { + key: "createFloatSingle", + value: function createFloatSingle(a, b, c, d) { + return ieee754.read([a, b, c, d], 0, false, 23, 4); + } + }, { + key: "createFloatDouble", + value: function createFloatDouble(a, b, c, d, e, f, g, h) { + return ieee754.read([a, b, c, d, e, f, g, h], 0, false, 52, 8); + } + }, { + key: "createInt32Neg", + value: function createInt32Neg(f, g) { + return -1 - utils.buildInt32(f, g); + } + }, { + key: "createInt64Neg", + value: function createInt64Neg(f1, f2, g1, g2) { + var f = utils.buildInt32(f1, f2); + var g = utils.buildInt32(g1, g2); + + if (f > c.MAX_SAFE_HIGH) { + return c.NEG_ONE.minus(new Bignumber(f).times(c.SHIFT32).plus(g)); + } + + return -1 - (f * c.SHIFT32 + g); + } + }, { + key: "createTrue", + value: function createTrue() { + return true; + } + }, { + key: "createFalse", + value: function createFalse() { + return false; + } + }, { + key: "createNull", + value: function createNull() { + return null; + } + }, { + key: "createUndefined", + value: function createUndefined() { + return void 0; + } + }, { + key: "createInfinity", + value: function createInfinity() { + return Infinity; + } + }, { + key: "createInfinityNeg", + value: function createInfinityNeg() { + return -Infinity; + } + }, { + key: "createNaN", + value: function createNaN() { + return NaN; + } + }, { + key: "createNaNNeg", + value: function createNaNNeg() { + return -NaN; + } + }, { + key: "createUtf8String", + value: function createUtf8String(raw, len) { + return raw.join(''); + } + }, { + key: "createUtf8StringFromHeap", + value: function createUtf8StringFromHeap(start, end) { + if (start === end) { + return ''; + } + + return this._buffer.toString('utf8', start, end); + } + }, { + key: "createSimpleUnassigned", + value: function createSimpleUnassigned(val) { + return new Simple(val); + } // -- Interface for decoder.asm.js + + }, { + key: "pushInt", + value: function pushInt(val) { + this._push(this.createInt(val)); + } + }, { + key: "pushInt32", + value: function pushInt32(f, g) { + this._push(this.createInt32(f, g)); + } + }, { + key: "pushInt64", + value: function pushInt64(f1, f2, g1, g2) { + this._push(this.createInt64(f1, f2, g1, g2)); + } + }, { + key: "pushFloat", + value: function pushFloat(val) { + this._push(this.createFloat(val)); + } + }, { + key: "pushFloatSingle", + value: function pushFloatSingle(a, b, c, d) { + this._push(this.createFloatSingle(a, b, c, d)); + } + }, { + key: "pushFloatDouble", + value: function pushFloatDouble(a, b, c, d, e, f, g, h) { + this._push(this.createFloatDouble(a, b, c, d, e, f, g, h)); + } + }, { + key: "pushInt32Neg", + value: function pushInt32Neg(f, g) { + this._push(this.createInt32Neg(f, g)); + } + }, { + key: "pushInt64Neg", + value: function pushInt64Neg(f1, f2, g1, g2) { + this._push(this.createInt64Neg(f1, f2, g1, g2)); + } + }, { + key: "pushTrue", + value: function pushTrue() { + this._push(this.createTrue()); + } + }, { + key: "pushFalse", + value: function pushFalse() { + this._push(this.createFalse()); + } + }, { + key: "pushNull", + value: function pushNull() { + this._push(this.createNull()); + } + }, { + key: "pushUndefined", + value: function pushUndefined() { + this._push(this.createUndefined()); + } + }, { + key: "pushInfinity", + value: function pushInfinity() { + this._push(this.createInfinity()); + } + }, { + key: "pushInfinityNeg", + value: function pushInfinityNeg() { + this._push(this.createInfinityNeg()); + } + }, { + key: "pushNaN", + value: function pushNaN() { + this._push(this.createNaN()); + } + }, { + key: "pushNaNNeg", + value: function pushNaNNeg() { + this._push(this.createNaNNeg()); + } + }, { + key: "pushArrayStart", + value: function pushArrayStart() { + this._createParent([], c.PARENT.ARRAY, -1); + } + }, { + key: "pushArrayStartFixed", + value: function pushArrayStartFixed(len) { + this._createArrayStartFixed(len); + } + }, { + key: "pushArrayStartFixed32", + value: function pushArrayStartFixed32(len1, len2) { + var len = utils.buildInt32(len1, len2); + + this._createArrayStartFixed(len); + } + }, { + key: "pushArrayStartFixed64", + value: function pushArrayStartFixed64(len1, len2, len3, len4) { + var len = utils.buildInt64(len1, len2, len3, len4); + + this._createArrayStartFixed(len); + } + }, { + key: "pushObjectStart", + value: function pushObjectStart() { + this._createObjectStartFixed(-1); + } + }, { + key: "pushObjectStartFixed", + value: function pushObjectStartFixed(len) { + this._createObjectStartFixed(len); + } + }, { + key: "pushObjectStartFixed32", + value: function pushObjectStartFixed32(len1, len2) { + var len = utils.buildInt32(len1, len2); + + this._createObjectStartFixed(len); + } + }, { + key: "pushObjectStartFixed64", + value: function pushObjectStartFixed64(len1, len2, len3, len4) { + var len = utils.buildInt64(len1, len2, len3, len4); + + this._createObjectStartFixed(len); + } + }, { + key: "pushByteStringStart", + value: function pushByteStringStart() { + this._parents[this._depth] = { + type: c.PARENT.BYTE_STRING, + length: -1, + ref: [], + values: 0, + tmpKey: null + }; + } + }, { + key: "pushByteString", + value: function pushByteString(start, end) { + this._push(this.createByteStringFromHeap(start, end)); + } + }, { + key: "pushUtf8StringStart", + value: function pushUtf8StringStart() { + this._parents[this._depth] = { + type: c.PARENT.UTF8_STRING, + length: -1, + ref: [], + values: 0, + tmpKey: null + }; + } + }, { + key: "pushUtf8String", + value: function pushUtf8String(start, end) { + this._push(this.createUtf8StringFromHeap(start, end)); + } + }, { + key: "pushSimpleUnassigned", + value: function pushSimpleUnassigned(val) { + this._push(this.createSimpleUnassigned(val)); + } + }, { + key: "pushTagStart", + value: function pushTagStart(tag) { + this._parents[this._depth] = { + type: c.PARENT.TAG, + length: 1, + ref: [tag] + }; + } + }, { + key: "pushTagStart4", + value: function pushTagStart4(f, g) { + this.pushTagStart(utils.buildInt32(f, g)); + } + }, { + key: "pushTagStart8", + value: function pushTagStart8(f1, f2, g1, g2) { + this.pushTagStart(utils.buildInt64(f1, f2, g1, g2)); + } + }, { + key: "pushTagUnassigned", + value: function pushTagUnassigned(tagNumber) { + this._push(this.createTag(tagNumber)); + } + }, { + key: "pushBreak", + value: function pushBreak() { + if (this._currentParent.length > -1) { + throw new Error('Unexpected break'); + } + + this._closeParent(); + } + }, { + key: "_createObjectStartFixed", + value: function _createObjectStartFixed(len) { + if (len === 0) { + this._push(this.createObject({})); + + return; + } + + this._createParent({}, c.PARENT.OBJECT, len); + } + }, { + key: "_createArrayStartFixed", + value: function _createArrayStartFixed(len) { + if (len === 0) { + this._push(this.createArray([])); + + return; + } + + this._createParent(new Array(len), c.PARENT.ARRAY, len); + } + }, { + key: "_decode", + value: function _decode(input) { + if (input.byteLength === 0) { + throw new Error('Input too short'); + } + + this._reset(); + + this._heap8.set(input); + + var code = this.parser.parse(input.byteLength); + + if (this._depth > 1) { + while (this._currentParent.length === 0) { + this._closeParent(); + } + + if (this._depth > 1) { + throw new Error('Undeterminated nesting'); + } + } + + if (code > 0) { + throw new Error('Failed to parse'); + } + + if (this._res.length === 0) { + throw new Error('No valid result'); + } + } // -- Public Interface + + }, { + key: "decodeFirst", + value: function decodeFirst(input) { + this._decode(input); + + return this._res[0]; + } + }, { + key: "decodeAll", + value: function decodeAll(input) { + this._decode(input); + + return this._res; + } + /** + * Decode the first cbor object. + * + * @param {Buffer|string} input + * @param {string} [enc='hex'] - Encoding used if a string is passed. + * @returns {*} + */ + + }, { + key: "_depth", + get: function get() { + return this._parents.length; + } + }, { + key: "_currentParent", + get: function get() { + return this._parents[this._depth - 1]; + } + }, { + key: "_ref", + get: function get() { + return this._currentParent.ref; + } + }], [{ + key: "decode", + value: function decode(input, enc) { + if (typeof input === 'string') { + input = Buffer.from(input, enc || 'hex'); + } + + var dec = new Decoder({ + size: input.length + }); + return dec.decodeFirst(input); + } + /** + * Decode all cbor objects. + * + * @param {Buffer|string} input + * @param {string} [enc='hex'] - Encoding used if a string is passed. + * @returns {Array<*>} + */ + + }, { + key: "decodeAll", + value: function decodeAll(input, enc) { + if (typeof input === 'string') { + input = Buffer.from(input, enc || 'hex'); + } + + var dec = new Decoder({ + size: input.length + }); + return dec.decodeAll(input); + } + }]); + + return Decoder; +}(); + +Decoder.decodeFirst = Decoder.decode; +module.exports = Decoder; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer, __webpack_require__(10))) + +/***/ }), +/* 188 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var constants = __webpack_require__(66); + +var MT = constants.MT; +var SIMPLE = constants.SIMPLE; +var SYMS = constants.SYMS; +/** + * A CBOR Simple Value that does not map onto a known constant. + */ + +var Simple = +/*#__PURE__*/ +function () { + /** + * Creates an instance of Simple. + * + * @param {integer} value - the simple value's integer value + */ + function Simple(value) { + _classCallCheck(this, Simple); + + if (typeof value !== 'number') { + throw new Error('Invalid Simple type: ' + _typeof(value)); + } + + if (value < 0 || value > 255 || (value | 0) !== value) { + throw new Error('value must be a small positive integer: ' + value); + } + + this.value = value; + } + /** + * Debug string for simple value + * + * @returns {string} simple(value) + */ + + + _createClass(Simple, [{ + key: "toString", + value: function toString() { + return 'simple(' + this.value + ')'; + } + /** + * Debug string for simple value + * + * @returns {string} simple(value) + */ + + }, { + key: "inspect", + value: function inspect() { + return 'simple(' + this.value + ')'; + } + /** + * Push the simple value onto the CBOR stream + * + * @param {cbor.Encoder} gen The generator to push onto + * @returns {number} + */ + + }, { + key: "encodeCBOR", + value: function encodeCBOR(gen) { + return gen._pushInt(this.value, MT.SIMPLE_FLOAT); + } + /** + * Is the given object a Simple? + * + * @param {any} obj - object to test + * @returns {bool} - is it Simple? + */ + + }], [{ + key: "isSimple", + value: function isSimple(obj) { + return obj instanceof Simple; + } + /** + * Decode from the CBOR additional information into a JavaScript value. + * If the CBOR item has no parent, return a "safe" symbol instead of + * `null` or `undefined`, so that the value can be passed through a + * stream in object mode. + * + * @param {Number} val - the CBOR additional info to convert + * @param {bool} hasParent - Does the CBOR item have a parent? + * @returns {(null|undefined|Boolean|Symbol)} - the decoded value + */ + + }, { + key: "decode", + value: function decode(val, hasParent) { + if (hasParent == null) { + hasParent = true; + } + + switch (val) { + case SIMPLE.FALSE: + return false; + + case SIMPLE.TRUE: + return true; + + case SIMPLE.NULL: + if (hasParent) { + return null; + } else { + return SYMS.NULL; + } + + case SIMPLE.UNDEFINED: + if (hasParent) { + return void 0; + } else { + return SYMS.UNDEFINED; + } + + case -1: + if (!hasParent) { + throw new Error('Invalid BREAK'); + } + + return SYMS.BREAK; + + default: + return new Simple(val); + } + } + }]); + + return Simple; +}(); + +module.exports = Simple; + +/***/ }), +/* 189 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + +/** + * A CBOR tagged item, where the tag does not have semantics specified at the + * moment, or those semantics threw an error during parsing. Typically this will + * be an extension point you're not yet expecting. + */ + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var Tagged = +/*#__PURE__*/ +function () { + /** + * Creates an instance of Tagged. + * + * @param {Number} tag - the number of the tag + * @param {any} value - the value inside the tag + * @param {Error} err - the error that was thrown parsing the tag, or null + */ + function Tagged(tag, value, err) { + _classCallCheck(this, Tagged); + + this.tag = tag; + this.value = value; + this.err = err; + + if (typeof this.tag !== 'number') { + throw new Error('Invalid tag type (' + _typeof(this.tag) + ')'); + } + + if (this.tag < 0 || (this.tag | 0) !== this.tag) { + throw new Error('Tag must be a positive integer: ' + this.tag); + } + } + /** + * Convert to a String + * + * @returns {String} string of the form '1(2)' + */ + + + _createClass(Tagged, [{ + key: "toString", + value: function toString() { + return "".concat(this.tag, "(").concat(JSON.stringify(this.value), ")"); + } + /** + * Push the simple value onto the CBOR stream + * + * @param {cbor.Encoder} gen The generator to push onto + * @returns {number} + */ + + }, { + key: "encodeCBOR", + value: function encodeCBOR(gen) { + gen._pushTag(this.tag); + + return gen.pushAny(this.value); + } + /** + * If we have a converter for this type, do the conversion. Some converters + * are built-in. Additional ones can be passed in. If you want to remove + * a built-in converter, pass a converter in whose value is 'null' instead + * of a function. + * + * @param {Object} converters - keys in the object are a tag number, the value + * is a function that takes the decoded CBOR and returns a JavaScript value + * of the appropriate type. Throw an exception in the function on errors. + * @returns {any} - the converted item + */ + + }, { + key: "convert", + value: function convert(converters) { + var er, f; + f = converters != null ? converters[this.tag] : void 0; + + if (typeof f !== 'function') { + f = Tagged['_tag' + this.tag]; + + if (typeof f !== 'function') { + return this; + } + } + + try { + return f.call(Tagged, this.value); + } catch (error) { + er = error; + this.err = er; + return this; + } + } + }]); + + return Tagged; +}(); + +module.exports = Tagged; + +/***/ }), +/* 190 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var promisify = __webpack_require__(1); + +var moduleConfig = __webpack_require__(3); + +module.exports = function (arg) { + var send = moduleConfig(arg); + return promisify(function (callback) { + send({ + path: 'shutdown' + }, callback); + }); +}; + +/***/ }), +/* 191 */ +/***/ (function(module, exports, __webpack_require__) { + +module.exports = __webpack_require__(192); + + +/***/ }), +/* 192 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + +/* global self */ + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var isIPFS = __webpack_require__(13); + +var _require = __webpack_require__(0), + Buffer = _require.Buffer; + +var CID = __webpack_require__(4); + +var multiaddr = __webpack_require__(16); + +var multibase = __webpack_require__(49); + +var multicodec = __webpack_require__(50); + +var multihash = __webpack_require__(14); + +var PeerId = __webpack_require__(23); + +var PeerInfo = __webpack_require__(40); + +var loadCommands = __webpack_require__(312); + +var getConfig = __webpack_require__(171); + +var sendRequest = __webpack_require__(172); + +function ipfsClient(hostOrMultiaddr, port, userOptions) { + // convert all three params to objects that we can merge. + var options = {}; + + if (!hostOrMultiaddr) { + // autoconfigure host and port in browser + if (typeof self !== 'undefined') { + options = urlToOptions(self.location); + } + } else if (multiaddr.isMultiaddr(hostOrMultiaddr)) { + options = maToOptions(hostOrMultiaddr); + } else if (_typeof(hostOrMultiaddr) === 'object') { + options = hostOrMultiaddr; + } else if (typeof hostOrMultiaddr === 'string') { + if (hostOrMultiaddr[0] === '/') { + // throws if multiaddr is malformed or can't be converted to a nodeAddress + options = maToOptions(multiaddr(hostOrMultiaddr)); + } else { + // hostOrMultiaddr is domain or ip address as a string + options.host = hostOrMultiaddr; + } + } + + if (port && _typeof(port) !== 'object') { + port = { + port: port + }; + } + + var config = Object.assign(getConfig(), options, port, userOptions); + var requestAPI = sendRequest(config); + var cmds = loadCommands(requestAPI, config); + cmds.send = requestAPI; + return cmds; +} + +function maToOptions(multiaddr) { + // ma.nodeAddress() throws if multiaddr can't be converted to a nodeAddress + var nodeAddr = multiaddr.nodeAddress(); + var protos = multiaddr.protos(); // only http and https are allowed as protocol, + // anything else will be replaced with http + + var exitProtocol = protos[protos.length - 1].name; + return { + host: nodeAddr.address, + port: nodeAddr.port, + protocol: exitProtocol.startsWith('http') ? exitProtocol : 'http' + }; +} + +function urlToOptions(url) { + return { + host: url.hostname, + port: url.port || (url.protocol.startsWith('https') ? 443 : 80), + protocol: url.protocol.startsWith('http') ? url.protocol.split(':')[0] : 'http' + }; +} + +module.exports = ipfsClient; +Object.assign(module.exports, { + isIPFS: isIPFS, + Buffer: Buffer, + CID: CID, + multiaddr: multiaddr, + multibase: multibase, + multicodec: multicodec, + multihash: multihash, + PeerId: PeerId, + PeerInfo: PeerInfo +}); + +/***/ }), +/* 193 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +exports.byteLength = byteLength; +exports.toByteArray = toByteArray; +exports.fromByteArray = fromByteArray; +var lookup = []; +var revLookup = []; +var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array; +var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'; + +for (var i = 0, len = code.length; i < len; ++i) { + lookup[i] = code[i]; + revLookup[code.charCodeAt(i)] = i; +} // Support decoding URL-safe base64 strings, as Node.js does. +// See: https://en.wikipedia.org/wiki/Base64#URL_applications + + +revLookup['-'.charCodeAt(0)] = 62; +revLookup['_'.charCodeAt(0)] = 63; + +function getLens(b64) { + var len = b64.length; + + if (len % 4 > 0) { + throw new Error('Invalid string. Length must be a multiple of 4'); + } // Trim off extra bytes after placeholder bytes are found + // See: https://github.com/beatgammit/base64-js/issues/42 + + + var validLen = b64.indexOf('='); + if (validLen === -1) validLen = len; + var placeHoldersLen = validLen === len ? 0 : 4 - validLen % 4; + return [validLen, placeHoldersLen]; +} // base64 is 4/3 + up to two characters of the original data + + +function byteLength(b64) { + var lens = getLens(b64); + var validLen = lens[0]; + var placeHoldersLen = lens[1]; + return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen; +} + +function _byteLength(b64, validLen, placeHoldersLen) { + return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen; +} + +function toByteArray(b64) { + var tmp; + var lens = getLens(b64); + var validLen = lens[0]; + var placeHoldersLen = lens[1]; + var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen)); + var curByte = 0; // if there are placeholders, only get up to the last complete 4 chars + + var len = placeHoldersLen > 0 ? validLen - 4 : validLen; + + for (var i = 0; i < len; i += 4) { + tmp = revLookup[b64.charCodeAt(i)] << 18 | revLookup[b64.charCodeAt(i + 1)] << 12 | revLookup[b64.charCodeAt(i + 2)] << 6 | revLookup[b64.charCodeAt(i + 3)]; + arr[curByte++] = tmp >> 16 & 0xFF; + arr[curByte++] = tmp >> 8 & 0xFF; + arr[curByte++] = tmp & 0xFF; + } + + if (placeHoldersLen === 2) { + tmp = revLookup[b64.charCodeAt(i)] << 2 | revLookup[b64.charCodeAt(i + 1)] >> 4; + arr[curByte++] = tmp & 0xFF; + } + + if (placeHoldersLen === 1) { + tmp = revLookup[b64.charCodeAt(i)] << 10 | revLookup[b64.charCodeAt(i + 1)] << 4 | revLookup[b64.charCodeAt(i + 2)] >> 2; + arr[curByte++] = tmp >> 8 & 0xFF; + arr[curByte++] = tmp & 0xFF; + } + + return arr; +} + +function tripletToBase64(num) { + return lookup[num >> 18 & 0x3F] + lookup[num >> 12 & 0x3F] + lookup[num >> 6 & 0x3F] + lookup[num & 0x3F]; +} + +function encodeChunk(uint8, start, end) { + var tmp; + var output = []; + + for (var i = start; i < end; i += 3) { + tmp = (uint8[i] << 16 & 0xFF0000) + (uint8[i + 1] << 8 & 0xFF00) + (uint8[i + 2] & 0xFF); + output.push(tripletToBase64(tmp)); + } + + return output.join(''); +} + +function fromByteArray(uint8) { + var tmp; + var len = uint8.length; + var extraBytes = len % 3; // if we have 1 byte left, pad 2 bytes + + var parts = []; + var maxChunkLength = 16383; // must be multiple of 3 + // go through the array every three bytes, we'll deal with trailing stuff later + + for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) { + parts.push(encodeChunk(uint8, i, i + maxChunkLength > len2 ? len2 : i + maxChunkLength)); + } // pad the end with zeros, but make sure to not forget the extra bytes + + + if (extraBytes === 1) { + tmp = uint8[len - 1]; + parts.push(lookup[tmp >> 2] + lookup[tmp << 4 & 0x3F] + '=='); + } else if (extraBytes === 2) { + tmp = (uint8[len - 2] << 8) + uint8[len - 1]; + parts.push(lookup[tmp >> 10] + lookup[tmp >> 4 & 0x3F] + lookup[tmp << 2 & 0x3F] + '='); + } + + return parts.join(''); +} + +/***/ }), +/* 194 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +// base-x encoding / decoding +// Copyright (c) 2018 base-x contributors +// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp) +// Distributed under the MIT software license, see the accompanying +// file LICENSE or http://www.opensource.org/licenses/mit-license.php. +var Buffer = __webpack_require__(7).Buffer; + +module.exports = function base(ALPHABET) { + if (ALPHABET.length >= 255) throw new TypeError('Alphabet too long'); + var BASE_MAP = new Uint8Array(256); + BASE_MAP.fill(255); + + for (var i = 0; i < ALPHABET.length; i++) { + var x = ALPHABET.charAt(i); + var xc = x.charCodeAt(0); + if (BASE_MAP[xc] !== 255) throw new TypeError(x + ' is ambiguous'); + BASE_MAP[xc] = i; + } + + var BASE = ALPHABET.length; + var LEADER = ALPHABET.charAt(0); + var FACTOR = Math.log(BASE) / Math.log(256); // log(BASE) / log(256), rounded up + + var iFACTOR = Math.log(256) / Math.log(BASE); // log(256) / log(BASE), rounded up + + function encode(source) { + if (!Buffer.isBuffer(source)) throw new TypeError('Expected Buffer'); + if (source.length === 0) return ''; // Skip & count leading zeroes. + + var zeroes = 0; + var length = 0; + var pbegin = 0; + var pend = source.length; + + while (pbegin !== pend && source[pbegin] === 0) { + pbegin++; + zeroes++; + } // Allocate enough space in big-endian base58 representation. + + + var size = (pend - pbegin) * iFACTOR + 1 >>> 0; + var b58 = new Uint8Array(size); // Process the bytes. + + while (pbegin !== pend) { + var carry = source[pbegin]; // Apply "b58 = b58 * 256 + ch". + + var _i = 0; + + for (var _it = size - 1; (carry !== 0 || _i < length) && _it !== -1; _it--, _i++) { + carry += 256 * b58[_it] >>> 0; + b58[_it] = carry % BASE >>> 0; + carry = carry / BASE >>> 0; + } + + if (carry !== 0) throw new Error('Non-zero carry'); + length = _i; + pbegin++; + } // Skip leading zeroes in base58 result. + + + var it = size - length; + + while (it !== size && b58[it] === 0) { + it++; + } // Translate the result into a string. + + + var str = LEADER.repeat(zeroes); + + for (; it < size; ++it) { + str += ALPHABET.charAt(b58[it]); + } + + return str; + } + + function decodeUnsafe(source) { + if (typeof source !== 'string') throw new TypeError('Expected String'); + if (source.length === 0) return Buffer.alloc(0); + var psz = 0; // Skip leading spaces. + + if (source[psz] === ' ') return; // Skip and count leading '1's. + + var zeroes = 0; + var length = 0; + + while (source[psz] === LEADER) { + zeroes++; + psz++; + } // Allocate enough space in big-endian base256 representation. + + + var size = (source.length - psz) * FACTOR + 1 >>> 0; // log(58) / log(256), rounded up. + + var b256 = new Uint8Array(size); // Process the characters. + + while (source[psz]) { + // Decode character + var carry = BASE_MAP[source.charCodeAt(psz)]; // Invalid character + + if (carry === 255) return; + var _i2 = 0; + + for (var _it2 = size - 1; (carry !== 0 || _i2 < length) && _it2 !== -1; _it2--, _i2++) { + carry += BASE * b256[_it2] >>> 0; + b256[_it2] = carry % 256 >>> 0; + carry = carry / 256 >>> 0; + } + + if (carry !== 0) throw new Error('Non-zero carry'); + length = _i2; + psz++; + } // Skip trailing spaces. + + + if (source[psz] === ' ') return; // Skip leading zeroes in b256. + + var it = size - length; + + while (it !== size && b256[it] === 0) { + it++; + } + + var vch = Buffer.allocUnsafe(zeroes + (size - it)); + vch.fill(0x00, 0, zeroes); + var j = zeroes; + + while (it !== size) { + vch[j++] = b256[it++]; + } + + return vch; + } + + function decode(string) { + var buffer = decodeUnsafe(string); + if (buffer) return buffer; + throw new Error('Non-base' + BASE + ' character'); + } + + return { + encode: encode, + decodeUnsafe: decodeUnsafe, + decode: decode + }; +}; + +/***/ }), +/* 195 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* eslint quote-props: off */ + +/* eslint key-spacing: off */ + + +exports.names = Object.freeze({ + 'id': 0x0, + 'sha1': 0x11, + 'sha2-256': 0x12, + 'sha2-512': 0x13, + 'dbl-sha2-256': 0x56, + 'sha3-224': 0x17, + 'sha3-256': 0x16, + 'sha3-384': 0x15, + 'sha3-512': 0x14, + 'shake-128': 0x18, + 'shake-256': 0x19, + 'keccak-224': 0x1A, + 'keccak-256': 0x1B, + 'keccak-384': 0x1C, + 'keccak-512': 0x1D, + 'murmur3-128': 0x22, + 'murmur3-32': 0x23, + 'blake2b-8': 0xb201, + 'blake2b-16': 0xb202, + 'blake2b-24': 0xb203, + 'blake2b-32': 0xb204, + 'blake2b-40': 0xb205, + 'blake2b-48': 0xb206, + 'blake2b-56': 0xb207, + 'blake2b-64': 0xb208, + 'blake2b-72': 0xb209, + 'blake2b-80': 0xb20a, + 'blake2b-88': 0xb20b, + 'blake2b-96': 0xb20c, + 'blake2b-104': 0xb20d, + 'blake2b-112': 0xb20e, + 'blake2b-120': 0xb20f, + 'blake2b-128': 0xb210, + 'blake2b-136': 0xb211, + 'blake2b-144': 0xb212, + 'blake2b-152': 0xb213, + 'blake2b-160': 0xb214, + 'blake2b-168': 0xb215, + 'blake2b-176': 0xb216, + 'blake2b-184': 0xb217, + 'blake2b-192': 0xb218, + 'blake2b-200': 0xb219, + 'blake2b-208': 0xb21a, + 'blake2b-216': 0xb21b, + 'blake2b-224': 0xb21c, + 'blake2b-232': 0xb21d, + 'blake2b-240': 0xb21e, + 'blake2b-248': 0xb21f, + 'blake2b-256': 0xb220, + 'blake2b-264': 0xb221, + 'blake2b-272': 0xb222, + 'blake2b-280': 0xb223, + 'blake2b-288': 0xb224, + 'blake2b-296': 0xb225, + 'blake2b-304': 0xb226, + 'blake2b-312': 0xb227, + 'blake2b-320': 0xb228, + 'blake2b-328': 0xb229, + 'blake2b-336': 0xb22a, + 'blake2b-344': 0xb22b, + 'blake2b-352': 0xb22c, + 'blake2b-360': 0xb22d, + 'blake2b-368': 0xb22e, + 'blake2b-376': 0xb22f, + 'blake2b-384': 0xb230, + 'blake2b-392': 0xb231, + 'blake2b-400': 0xb232, + 'blake2b-408': 0xb233, + 'blake2b-416': 0xb234, + 'blake2b-424': 0xb235, + 'blake2b-432': 0xb236, + 'blake2b-440': 0xb237, + 'blake2b-448': 0xb238, + 'blake2b-456': 0xb239, + 'blake2b-464': 0xb23a, + 'blake2b-472': 0xb23b, + 'blake2b-480': 0xb23c, + 'blake2b-488': 0xb23d, + 'blake2b-496': 0xb23e, + 'blake2b-504': 0xb23f, + 'blake2b-512': 0xb240, + 'blake2s-8': 0xb241, + 'blake2s-16': 0xb242, + 'blake2s-24': 0xb243, + 'blake2s-32': 0xb244, + 'blake2s-40': 0xb245, + 'blake2s-48': 0xb246, + 'blake2s-56': 0xb247, + 'blake2s-64': 0xb248, + 'blake2s-72': 0xb249, + 'blake2s-80': 0xb24a, + 'blake2s-88': 0xb24b, + 'blake2s-96': 0xb24c, + 'blake2s-104': 0xb24d, + 'blake2s-112': 0xb24e, + 'blake2s-120': 0xb24f, + 'blake2s-128': 0xb250, + 'blake2s-136': 0xb251, + 'blake2s-144': 0xb252, + 'blake2s-152': 0xb253, + 'blake2s-160': 0xb254, + 'blake2s-168': 0xb255, + 'blake2s-176': 0xb256, + 'blake2s-184': 0xb257, + 'blake2s-192': 0xb258, + 'blake2s-200': 0xb259, + 'blake2s-208': 0xb25a, + 'blake2s-216': 0xb25b, + 'blake2s-224': 0xb25c, + 'blake2s-232': 0xb25d, + 'blake2s-240': 0xb25e, + 'blake2s-248': 0xb25f, + 'blake2s-256': 0xb260, + 'Skein256-8': 0xb301, + 'Skein256-16': 0xb302, + 'Skein256-24': 0xb303, + 'Skein256-32': 0xb304, + 'Skein256-40': 0xb305, + 'Skein256-48': 0xb306, + 'Skein256-56': 0xb307, + 'Skein256-64': 0xb308, + 'Skein256-72': 0xb309, + 'Skein256-80': 0xb30a, + 'Skein256-88': 0xb30b, + 'Skein256-96': 0xb30c, + 'Skein256-104': 0xb30d, + 'Skein256-112': 0xb30e, + 'Skein256-120': 0xb30f, + 'Skein256-128': 0xb310, + 'Skein256-136': 0xb311, + 'Skein256-144': 0xb312, + 'Skein256-152': 0xb313, + 'Skein256-160': 0xb314, + 'Skein256-168': 0xb315, + 'Skein256-176': 0xb316, + 'Skein256-184': 0xb317, + 'Skein256-192': 0xb318, + 'Skein256-200': 0xb319, + 'Skein256-208': 0xb31a, + 'Skein256-216': 0xb31b, + 'Skein256-224': 0xb31c, + 'Skein256-232': 0xb31d, + 'Skein256-240': 0xb31e, + 'Skein256-248': 0xb31f, + 'Skein256-256': 0xb320, + 'Skein512-8': 0xb321, + 'Skein512-16': 0xb322, + 'Skein512-24': 0xb323, + 'Skein512-32': 0xb324, + 'Skein512-40': 0xb325, + 'Skein512-48': 0xb326, + 'Skein512-56': 0xb327, + 'Skein512-64': 0xb328, + 'Skein512-72': 0xb329, + 'Skein512-80': 0xb32a, + 'Skein512-88': 0xb32b, + 'Skein512-96': 0xb32c, + 'Skein512-104': 0xb32d, + 'Skein512-112': 0xb32e, + 'Skein512-120': 0xb32f, + 'Skein512-128': 0xb330, + 'Skein512-136': 0xb331, + 'Skein512-144': 0xb332, + 'Skein512-152': 0xb333, + 'Skein512-160': 0xb334, + 'Skein512-168': 0xb335, + 'Skein512-176': 0xb336, + 'Skein512-184': 0xb337, + 'Skein512-192': 0xb338, + 'Skein512-200': 0xb339, + 'Skein512-208': 0xb33a, + 'Skein512-216': 0xb33b, + 'Skein512-224': 0xb33c, + 'Skein512-232': 0xb33d, + 'Skein512-240': 0xb33e, + 'Skein512-248': 0xb33f, + 'Skein512-256': 0xb340, + 'Skein512-264': 0xb341, + 'Skein512-272': 0xb342, + 'Skein512-280': 0xb343, + 'Skein512-288': 0xb344, + 'Skein512-296': 0xb345, + 'Skein512-304': 0xb346, + 'Skein512-312': 0xb347, + 'Skein512-320': 0xb348, + 'Skein512-328': 0xb349, + 'Skein512-336': 0xb34a, + 'Skein512-344': 0xb34b, + 'Skein512-352': 0xb34c, + 'Skein512-360': 0xb34d, + 'Skein512-368': 0xb34e, + 'Skein512-376': 0xb34f, + 'Skein512-384': 0xb350, + 'Skein512-392': 0xb351, + 'Skein512-400': 0xb352, + 'Skein512-408': 0xb353, + 'Skein512-416': 0xb354, + 'Skein512-424': 0xb355, + 'Skein512-432': 0xb356, + 'Skein512-440': 0xb357, + 'Skein512-448': 0xb358, + 'Skein512-456': 0xb359, + 'Skein512-464': 0xb35a, + 'Skein512-472': 0xb35b, + 'Skein512-480': 0xb35c, + 'Skein512-488': 0xb35d, + 'Skein512-496': 0xb35e, + 'Skein512-504': 0xb35f, + 'Skein512-512': 0xb360, + 'Skein1024-8': 0xb361, + 'Skein1024-16': 0xb362, + 'Skein1024-24': 0xb363, + 'Skein1024-32': 0xb364, + 'Skein1024-40': 0xb365, + 'Skein1024-48': 0xb366, + 'Skein1024-56': 0xb367, + 'Skein1024-64': 0xb368, + 'Skein1024-72': 0xb369, + 'Skein1024-80': 0xb36a, + 'Skein1024-88': 0xb36b, + 'Skein1024-96': 0xb36c, + 'Skein1024-104': 0xb36d, + 'Skein1024-112': 0xb36e, + 'Skein1024-120': 0xb36f, + 'Skein1024-128': 0xb370, + 'Skein1024-136': 0xb371, + 'Skein1024-144': 0xb372, + 'Skein1024-152': 0xb373, + 'Skein1024-160': 0xb374, + 'Skein1024-168': 0xb375, + 'Skein1024-176': 0xb376, + 'Skein1024-184': 0xb377, + 'Skein1024-192': 0xb378, + 'Skein1024-200': 0xb379, + 'Skein1024-208': 0xb37a, + 'Skein1024-216': 0xb37b, + 'Skein1024-224': 0xb37c, + 'Skein1024-232': 0xb37d, + 'Skein1024-240': 0xb37e, + 'Skein1024-248': 0xb37f, + 'Skein1024-256': 0xb380, + 'Skein1024-264': 0xb381, + 'Skein1024-272': 0xb382, + 'Skein1024-280': 0xb383, + 'Skein1024-288': 0xb384, + 'Skein1024-296': 0xb385, + 'Skein1024-304': 0xb386, + 'Skein1024-312': 0xb387, + 'Skein1024-320': 0xb388, + 'Skein1024-328': 0xb389, + 'Skein1024-336': 0xb38a, + 'Skein1024-344': 0xb38b, + 'Skein1024-352': 0xb38c, + 'Skein1024-360': 0xb38d, + 'Skein1024-368': 0xb38e, + 'Skein1024-376': 0xb38f, + 'Skein1024-384': 0xb390, + 'Skein1024-392': 0xb391, + 'Skein1024-400': 0xb392, + 'Skein1024-408': 0xb393, + 'Skein1024-416': 0xb394, + 'Skein1024-424': 0xb395, + 'Skein1024-432': 0xb396, + 'Skein1024-440': 0xb397, + 'Skein1024-448': 0xb398, + 'Skein1024-456': 0xb399, + 'Skein1024-464': 0xb39a, + 'Skein1024-472': 0xb39b, + 'Skein1024-480': 0xb39c, + 'Skein1024-488': 0xb39d, + 'Skein1024-496': 0xb39e, + 'Skein1024-504': 0xb39f, + 'Skein1024-512': 0xb3a0, + 'Skein1024-520': 0xb3a1, + 'Skein1024-528': 0xb3a2, + 'Skein1024-536': 0xb3a3, + 'Skein1024-544': 0xb3a4, + 'Skein1024-552': 0xb3a5, + 'Skein1024-560': 0xb3a6, + 'Skein1024-568': 0xb3a7, + 'Skein1024-576': 0xb3a8, + 'Skein1024-584': 0xb3a9, + 'Skein1024-592': 0xb3aa, + 'Skein1024-600': 0xb3ab, + 'Skein1024-608': 0xb3ac, + 'Skein1024-616': 0xb3ad, + 'Skein1024-624': 0xb3ae, + 'Skein1024-632': 0xb3af, + 'Skein1024-640': 0xb3b0, + 'Skein1024-648': 0xb3b1, + 'Skein1024-656': 0xb3b2, + 'Skein1024-664': 0xb3b3, + 'Skein1024-672': 0xb3b4, + 'Skein1024-680': 0xb3b5, + 'Skein1024-688': 0xb3b6, + 'Skein1024-696': 0xb3b7, + 'Skein1024-704': 0xb3b8, + 'Skein1024-712': 0xb3b9, + 'Skein1024-720': 0xb3ba, + 'Skein1024-728': 0xb3bb, + 'Skein1024-736': 0xb3bc, + 'Skein1024-744': 0xb3bd, + 'Skein1024-752': 0xb3be, + 'Skein1024-760': 0xb3bf, + 'Skein1024-768': 0xb3c0, + 'Skein1024-776': 0xb3c1, + 'Skein1024-784': 0xb3c2, + 'Skein1024-792': 0xb3c3, + 'Skein1024-800': 0xb3c4, + 'Skein1024-808': 0xb3c5, + 'Skein1024-816': 0xb3c6, + 'Skein1024-824': 0xb3c7, + 'Skein1024-832': 0xb3c8, + 'Skein1024-840': 0xb3c9, + 'Skein1024-848': 0xb3ca, + 'Skein1024-856': 0xb3cb, + 'Skein1024-864': 0xb3cc, + 'Skein1024-872': 0xb3cd, + 'Skein1024-880': 0xb3ce, + 'Skein1024-888': 0xb3cf, + 'Skein1024-896': 0xb3d0, + 'Skein1024-904': 0xb3d1, + 'Skein1024-912': 0xb3d2, + 'Skein1024-920': 0xb3d3, + 'Skein1024-928': 0xb3d4, + 'Skein1024-936': 0xb3d5, + 'Skein1024-944': 0xb3d6, + 'Skein1024-952': 0xb3d7, + 'Skein1024-960': 0xb3d8, + 'Skein1024-968': 0xb3d9, + 'Skein1024-976': 0xb3da, + 'Skein1024-984': 0xb3db, + 'Skein1024-992': 0xb3dc, + 'Skein1024-1000': 0xb3dd, + 'Skein1024-1008': 0xb3de, + 'Skein1024-1016': 0xb3df, + 'Skein1024-1024': 0xb3e0 +}); +exports.codes = Object.freeze({ + 0x11: 'sha1', + 0x12: 'sha2-256', + 0x13: 'sha2-512', + 0x56: 'dbl-sha2-256', + 0x17: 'sha3-224', + 0x16: 'sha3-256', + 0x15: 'sha3-384', + 0x14: 'sha3-512', + 0x18: 'shake-128', + 0x19: 'shake-256', + 0x1A: 'keccak-224', + 0x1B: 'keccak-256', + 0x1C: 'keccak-384', + 0x1D: 'keccak-512', + 0x22: 'murmur3-128', + 0x23: 'murmur3-32', + // blake2 + 0xb201: 'blake2b-8', + 0xb202: 'blake2b-16', + 0xb203: 'blake2b-24', + 0xb204: 'blake2b-32', + 0xb205: 'blake2b-40', + 0xb206: 'blake2b-48', + 0xb207: 'blake2b-56', + 0xb208: 'blake2b-64', + 0xb209: 'blake2b-72', + 0xb20a: 'blake2b-80', + 0xb20b: 'blake2b-88', + 0xb20c: 'blake2b-96', + 0xb20d: 'blake2b-104', + 0xb20e: 'blake2b-112', + 0xb20f: 'blake2b-120', + 0xb210: 'blake2b-128', + 0xb211: 'blake2b-136', + 0xb212: 'blake2b-144', + 0xb213: 'blake2b-152', + 0xb214: 'blake2b-160', + 0xb215: 'blake2b-168', + 0xb216: 'blake2b-176', + 0xb217: 'blake2b-184', + 0xb218: 'blake2b-192', + 0xb219: 'blake2b-200', + 0xb21a: 'blake2b-208', + 0xb21b: 'blake2b-216', + 0xb21c: 'blake2b-224', + 0xb21d: 'blake2b-232', + 0xb21e: 'blake2b-240', + 0xb21f: 'blake2b-248', + 0xb220: 'blake2b-256', + 0xb221: 'blake2b-264', + 0xb222: 'blake2b-272', + 0xb223: 'blake2b-280', + 0xb224: 'blake2b-288', + 0xb225: 'blake2b-296', + 0xb226: 'blake2b-304', + 0xb227: 'blake2b-312', + 0xb228: 'blake2b-320', + 0xb229: 'blake2b-328', + 0xb22a: 'blake2b-336', + 0xb22b: 'blake2b-344', + 0xb22c: 'blake2b-352', + 0xb22d: 'blake2b-360', + 0xb22e: 'blake2b-368', + 0xb22f: 'blake2b-376', + 0xb230: 'blake2b-384', + 0xb231: 'blake2b-392', + 0xb232: 'blake2b-400', + 0xb233: 'blake2b-408', + 0xb234: 'blake2b-416', + 0xb235: 'blake2b-424', + 0xb236: 'blake2b-432', + 0xb237: 'blake2b-440', + 0xb238: 'blake2b-448', + 0xb239: 'blake2b-456', + 0xb23a: 'blake2b-464', + 0xb23b: 'blake2b-472', + 0xb23c: 'blake2b-480', + 0xb23d: 'blake2b-488', + 0xb23e: 'blake2b-496', + 0xb23f: 'blake2b-504', + 0xb240: 'blake2b-512', + 0xb241: 'blake2s-8', + 0xb242: 'blake2s-16', + 0xb243: 'blake2s-24', + 0xb244: 'blake2s-32', + 0xb245: 'blake2s-40', + 0xb246: 'blake2s-48', + 0xb247: 'blake2s-56', + 0xb248: 'blake2s-64', + 0xb249: 'blake2s-72', + 0xb24a: 'blake2s-80', + 0xb24b: 'blake2s-88', + 0xb24c: 'blake2s-96', + 0xb24d: 'blake2s-104', + 0xb24e: 'blake2s-112', + 0xb24f: 'blake2s-120', + 0xb250: 'blake2s-128', + 0xb251: 'blake2s-136', + 0xb252: 'blake2s-144', + 0xb253: 'blake2s-152', + 0xb254: 'blake2s-160', + 0xb255: 'blake2s-168', + 0xb256: 'blake2s-176', + 0xb257: 'blake2s-184', + 0xb258: 'blake2s-192', + 0xb259: 'blake2s-200', + 0xb25a: 'blake2s-208', + 0xb25b: 'blake2s-216', + 0xb25c: 'blake2s-224', + 0xb25d: 'blake2s-232', + 0xb25e: 'blake2s-240', + 0xb25f: 'blake2s-248', + 0xb260: 'blake2s-256', + // skein + 0xb301: 'Skein256-8', + 0xb302: 'Skein256-16', + 0xb303: 'Skein256-24', + 0xb304: 'Skein256-32', + 0xb305: 'Skein256-40', + 0xb306: 'Skein256-48', + 0xb307: 'Skein256-56', + 0xb308: 'Skein256-64', + 0xb309: 'Skein256-72', + 0xb30a: 'Skein256-80', + 0xb30b: 'Skein256-88', + 0xb30c: 'Skein256-96', + 0xb30d: 'Skein256-104', + 0xb30e: 'Skein256-112', + 0xb30f: 'Skein256-120', + 0xb310: 'Skein256-128', + 0xb311: 'Skein256-136', + 0xb312: 'Skein256-144', + 0xb313: 'Skein256-152', + 0xb314: 'Skein256-160', + 0xb315: 'Skein256-168', + 0xb316: 'Skein256-176', + 0xb317: 'Skein256-184', + 0xb318: 'Skein256-192', + 0xb319: 'Skein256-200', + 0xb31a: 'Skein256-208', + 0xb31b: 'Skein256-216', + 0xb31c: 'Skein256-224', + 0xb31d: 'Skein256-232', + 0xb31e: 'Skein256-240', + 0xb31f: 'Skein256-248', + 0xb320: 'Skein256-256', + 0xb321: 'Skein512-8', + 0xb322: 'Skein512-16', + 0xb323: 'Skein512-24', + 0xb324: 'Skein512-32', + 0xb325: 'Skein512-40', + 0xb326: 'Skein512-48', + 0xb327: 'Skein512-56', + 0xb328: 'Skein512-64', + 0xb329: 'Skein512-72', + 0xb32a: 'Skein512-80', + 0xb32b: 'Skein512-88', + 0xb32c: 'Skein512-96', + 0xb32d: 'Skein512-104', + 0xb32e: 'Skein512-112', + 0xb32f: 'Skein512-120', + 0xb330: 'Skein512-128', + 0xb331: 'Skein512-136', + 0xb332: 'Skein512-144', + 0xb333: 'Skein512-152', + 0xb334: 'Skein512-160', + 0xb335: 'Skein512-168', + 0xb336: 'Skein512-176', + 0xb337: 'Skein512-184', + 0xb338: 'Skein512-192', + 0xb339: 'Skein512-200', + 0xb33a: 'Skein512-208', + 0xb33b: 'Skein512-216', + 0xb33c: 'Skein512-224', + 0xb33d: 'Skein512-232', + 0xb33e: 'Skein512-240', + 0xb33f: 'Skein512-248', + 0xb340: 'Skein512-256', + 0xb341: 'Skein512-264', + 0xb342: 'Skein512-272', + 0xb343: 'Skein512-280', + 0xb344: 'Skein512-288', + 0xb345: 'Skein512-296', + 0xb346: 'Skein512-304', + 0xb347: 'Skein512-312', + 0xb348: 'Skein512-320', + 0xb349: 'Skein512-328', + 0xb34a: 'Skein512-336', + 0xb34b: 'Skein512-344', + 0xb34c: 'Skein512-352', + 0xb34d: 'Skein512-360', + 0xb34e: 'Skein512-368', + 0xb34f: 'Skein512-376', + 0xb350: 'Skein512-384', + 0xb351: 'Skein512-392', + 0xb352: 'Skein512-400', + 0xb353: 'Skein512-408', + 0xb354: 'Skein512-416', + 0xb355: 'Skein512-424', + 0xb356: 'Skein512-432', + 0xb357: 'Skein512-440', + 0xb358: 'Skein512-448', + 0xb359: 'Skein512-456', + 0xb35a: 'Skein512-464', + 0xb35b: 'Skein512-472', + 0xb35c: 'Skein512-480', + 0xb35d: 'Skein512-488', + 0xb35e: 'Skein512-496', + 0xb35f: 'Skein512-504', + 0xb360: 'Skein512-512', + 0xb361: 'Skein1024-8', + 0xb362: 'Skein1024-16', + 0xb363: 'Skein1024-24', + 0xb364: 'Skein1024-32', + 0xb365: 'Skein1024-40', + 0xb366: 'Skein1024-48', + 0xb367: 'Skein1024-56', + 0xb368: 'Skein1024-64', + 0xb369: 'Skein1024-72', + 0xb36a: 'Skein1024-80', + 0xb36b: 'Skein1024-88', + 0xb36c: 'Skein1024-96', + 0xb36d: 'Skein1024-104', + 0xb36e: 'Skein1024-112', + 0xb36f: 'Skein1024-120', + 0xb370: 'Skein1024-128', + 0xb371: 'Skein1024-136', + 0xb372: 'Skein1024-144', + 0xb373: 'Skein1024-152', + 0xb374: 'Skein1024-160', + 0xb375: 'Skein1024-168', + 0xb376: 'Skein1024-176', + 0xb377: 'Skein1024-184', + 0xb378: 'Skein1024-192', + 0xb379: 'Skein1024-200', + 0xb37a: 'Skein1024-208', + 0xb37b: 'Skein1024-216', + 0xb37c: 'Skein1024-224', + 0xb37d: 'Skein1024-232', + 0xb37e: 'Skein1024-240', + 0xb37f: 'Skein1024-248', + 0xb380: 'Skein1024-256', + 0xb381: 'Skein1024-264', + 0xb382: 'Skein1024-272', + 0xb383: 'Skein1024-280', + 0xb384: 'Skein1024-288', + 0xb385: 'Skein1024-296', + 0xb386: 'Skein1024-304', + 0xb387: 'Skein1024-312', + 0xb388: 'Skein1024-320', + 0xb389: 'Skein1024-328', + 0xb38a: 'Skein1024-336', + 0xb38b: 'Skein1024-344', + 0xb38c: 'Skein1024-352', + 0xb38d: 'Skein1024-360', + 0xb38e: 'Skein1024-368', + 0xb38f: 'Skein1024-376', + 0xb390: 'Skein1024-384', + 0xb391: 'Skein1024-392', + 0xb392: 'Skein1024-400', + 0xb393: 'Skein1024-408', + 0xb394: 'Skein1024-416', + 0xb395: 'Skein1024-424', + 0xb396: 'Skein1024-432', + 0xb397: 'Skein1024-440', + 0xb398: 'Skein1024-448', + 0xb399: 'Skein1024-456', + 0xb39a: 'Skein1024-464', + 0xb39b: 'Skein1024-472', + 0xb39c: 'Skein1024-480', + 0xb39d: 'Skein1024-488', + 0xb39e: 'Skein1024-496', + 0xb39f: 'Skein1024-504', + 0xb3a0: 'Skein1024-512', + 0xb3a1: 'Skein1024-520', + 0xb3a2: 'Skein1024-528', + 0xb3a3: 'Skein1024-536', + 0xb3a4: 'Skein1024-544', + 0xb3a5: 'Skein1024-552', + 0xb3a6: 'Skein1024-560', + 0xb3a7: 'Skein1024-568', + 0xb3a8: 'Skein1024-576', + 0xb3a9: 'Skein1024-584', + 0xb3aa: 'Skein1024-592', + 0xb3ab: 'Skein1024-600', + 0xb3ac: 'Skein1024-608', + 0xb3ad: 'Skein1024-616', + 0xb3ae: 'Skein1024-624', + 0xb3af: 'Skein1024-632', + 0xb3b0: 'Skein1024-640', + 0xb3b1: 'Skein1024-648', + 0xb3b2: 'Skein1024-656', + 0xb3b3: 'Skein1024-664', + 0xb3b4: 'Skein1024-672', + 0xb3b5: 'Skein1024-680', + 0xb3b6: 'Skein1024-688', + 0xb3b7: 'Skein1024-696', + 0xb3b8: 'Skein1024-704', + 0xb3b9: 'Skein1024-712', + 0xb3ba: 'Skein1024-720', + 0xb3bb: 'Skein1024-728', + 0xb3bc: 'Skein1024-736', + 0xb3bd: 'Skein1024-744', + 0xb3be: 'Skein1024-752', + 0xb3bf: 'Skein1024-760', + 0xb3c0: 'Skein1024-768', + 0xb3c1: 'Skein1024-776', + 0xb3c2: 'Skein1024-784', + 0xb3c3: 'Skein1024-792', + 0xb3c4: 'Skein1024-800', + 0xb3c5: 'Skein1024-808', + 0xb3c6: 'Skein1024-816', + 0xb3c7: 'Skein1024-824', + 0xb3c8: 'Skein1024-832', + 0xb3c9: 'Skein1024-840', + 0xb3ca: 'Skein1024-848', + 0xb3cb: 'Skein1024-856', + 0xb3cc: 'Skein1024-864', + 0xb3cd: 'Skein1024-872', + 0xb3ce: 'Skein1024-880', + 0xb3cf: 'Skein1024-888', + 0xb3d0: 'Skein1024-896', + 0xb3d1: 'Skein1024-904', + 0xb3d2: 'Skein1024-912', + 0xb3d3: 'Skein1024-920', + 0xb3d4: 'Skein1024-928', + 0xb3d5: 'Skein1024-936', + 0xb3d6: 'Skein1024-944', + 0xb3d7: 'Skein1024-952', + 0xb3d8: 'Skein1024-960', + 0xb3d9: 'Skein1024-968', + 0xb3da: 'Skein1024-976', + 0xb3db: 'Skein1024-984', + 0xb3dc: 'Skein1024-992', + 0xb3dd: 'Skein1024-1000', + 0xb3de: 'Skein1024-1008', + 0xb3df: 'Skein1024-1016', + 0xb3e0: 'Skein1024-1024' +}); +exports.defaultLengths = Object.freeze({ + 0x11: 20, + 0x12: 32, + 0x13: 64, + 0x56: 32, + 0x17: 28, + 0x16: 32, + 0x15: 48, + 0x14: 64, + 0x18: 32, + 0x19: 64, + 0x1A: 28, + 0x1B: 32, + 0x1C: 48, + 0x1D: 64, + 0x22: 32, + 0xb201: 0x01, + 0xb202: 0x02, + 0xb203: 0x03, + 0xb204: 0x04, + 0xb205: 0x05, + 0xb206: 0x06, + 0xb207: 0x07, + 0xb208: 0x08, + 0xb209: 0x09, + 0xb20a: 0x0a, + 0xb20b: 0x0b, + 0xb20c: 0x0c, + 0xb20d: 0x0d, + 0xb20e: 0x0e, + 0xb20f: 0x0f, + 0xb210: 0x10, + 0xb211: 0x11, + 0xb212: 0x12, + 0xb213: 0x13, + 0xb214: 0x14, + 0xb215: 0x15, + 0xb216: 0x16, + 0xb217: 0x17, + 0xb218: 0x18, + 0xb219: 0x19, + 0xb21a: 0x1a, + 0xb21b: 0x1b, + 0xb21c: 0x1c, + 0xb21d: 0x1d, + 0xb21e: 0x1e, + 0xb21f: 0x1f, + 0xb220: 0x20, + 0xb221: 0x21, + 0xb222: 0x22, + 0xb223: 0x23, + 0xb224: 0x24, + 0xb225: 0x25, + 0xb226: 0x26, + 0xb227: 0x27, + 0xb228: 0x28, + 0xb229: 0x29, + 0xb22a: 0x2a, + 0xb22b: 0x2b, + 0xb22c: 0x2c, + 0xb22d: 0x2d, + 0xb22e: 0x2e, + 0xb22f: 0x2f, + 0xb230: 0x30, + 0xb231: 0x31, + 0xb232: 0x32, + 0xb233: 0x33, + 0xb234: 0x34, + 0xb235: 0x35, + 0xb236: 0x36, + 0xb237: 0x37, + 0xb238: 0x38, + 0xb239: 0x39, + 0xb23a: 0x3a, + 0xb23b: 0x3b, + 0xb23c: 0x3c, + 0xb23d: 0x3d, + 0xb23e: 0x3e, + 0xb23f: 0x3f, + 0xb240: 0x40, + 0xb241: 0x01, + 0xb242: 0x02, + 0xb243: 0x03, + 0xb244: 0x04, + 0xb245: 0x05, + 0xb246: 0x06, + 0xb247: 0x07, + 0xb248: 0x08, + 0xb249: 0x09, + 0xb24a: 0x0a, + 0xb24b: 0x0b, + 0xb24c: 0x0c, + 0xb24d: 0x0d, + 0xb24e: 0x0e, + 0xb24f: 0x0f, + 0xb250: 0x10, + 0xb251: 0x11, + 0xb252: 0x12, + 0xb253: 0x13, + 0xb254: 0x14, + 0xb255: 0x15, + 0xb256: 0x16, + 0xb257: 0x17, + 0xb258: 0x18, + 0xb259: 0x19, + 0xb25a: 0x1a, + 0xb25b: 0x1b, + 0xb25c: 0x1c, + 0xb25d: 0x1d, + 0xb25e: 0x1e, + 0xb25f: 0x1f, + 0xb260: 0x20, + 0xb301: 0x01, + 0xb302: 0x02, + 0xb303: 0x03, + 0xb304: 0x04, + 0xb305: 0x05, + 0xb306: 0x06, + 0xb307: 0x07, + 0xb308: 0x08, + 0xb309: 0x09, + 0xb30a: 0x0a, + 0xb30b: 0x0b, + 0xb30c: 0x0c, + 0xb30d: 0x0d, + 0xb30e: 0x0e, + 0xb30f: 0x0f, + 0xb310: 0x10, + 0xb311: 0x11, + 0xb312: 0x12, + 0xb313: 0x13, + 0xb314: 0x14, + 0xb315: 0x15, + 0xb316: 0x16, + 0xb317: 0x17, + 0xb318: 0x18, + 0xb319: 0x19, + 0xb31a: 0x1a, + 0xb31b: 0x1b, + 0xb31c: 0x1c, + 0xb31d: 0x1d, + 0xb31e: 0x1e, + 0xb31f: 0x1f, + 0xb320: 0x20, + 0xb321: 0x01, + 0xb322: 0x02, + 0xb323: 0x03, + 0xb324: 0x04, + 0xb325: 0x05, + 0xb326: 0x06, + 0xb327: 0x07, + 0xb328: 0x08, + 0xb329: 0x09, + 0xb32a: 0x0a, + 0xb32b: 0x0b, + 0xb32c: 0x0c, + 0xb32d: 0x0d, + 0xb32e: 0x0e, + 0xb32f: 0x0f, + 0xb330: 0x10, + 0xb331: 0x11, + 0xb332: 0x12, + 0xb333: 0x13, + 0xb334: 0x14, + 0xb335: 0x15, + 0xb336: 0x16, + 0xb337: 0x17, + 0xb338: 0x18, + 0xb339: 0x19, + 0xb33a: 0x1a, + 0xb33b: 0x1b, + 0xb33c: 0x1c, + 0xb33d: 0x1d, + 0xb33e: 0x1e, + 0xb33f: 0x1f, + 0xb340: 0x20, + 0xb341: 0x21, + 0xb342: 0x22, + 0xb343: 0x23, + 0xb344: 0x24, + 0xb345: 0x25, + 0xb346: 0x26, + 0xb347: 0x27, + 0xb348: 0x28, + 0xb349: 0x29, + 0xb34a: 0x2a, + 0xb34b: 0x2b, + 0xb34c: 0x2c, + 0xb34d: 0x2d, + 0xb34e: 0x2e, + 0xb34f: 0x2f, + 0xb350: 0x30, + 0xb351: 0x31, + 0xb352: 0x32, + 0xb353: 0x33, + 0xb354: 0x34, + 0xb355: 0x35, + 0xb356: 0x36, + 0xb357: 0x37, + 0xb358: 0x38, + 0xb359: 0x39, + 0xb35a: 0x3a, + 0xb35b: 0x3b, + 0xb35c: 0x3c, + 0xb35d: 0x3d, + 0xb35e: 0x3e, + 0xb35f: 0x3f, + 0xb360: 0x40, + 0xb361: 0x01, + 0xb362: 0x02, + 0xb363: 0x03, + 0xb364: 0x04, + 0xb365: 0x05, + 0xb366: 0x06, + 0xb367: 0x07, + 0xb368: 0x08, + 0xb369: 0x09, + 0xb36a: 0x0a, + 0xb36b: 0x0b, + 0xb36c: 0x0c, + 0xb36d: 0x0d, + 0xb36e: 0x0e, + 0xb36f: 0x0f, + 0xb370: 0x10, + 0xb371: 0x11, + 0xb372: 0x12, + 0xb373: 0x13, + 0xb374: 0x14, + 0xb375: 0x15, + 0xb376: 0x16, + 0xb377: 0x17, + 0xb378: 0x18, + 0xb379: 0x19, + 0xb37a: 0x1a, + 0xb37b: 0x1b, + 0xb37c: 0x1c, + 0xb37d: 0x1d, + 0xb37e: 0x1e, + 0xb37f: 0x1f, + 0xb380: 0x20, + 0xb381: 0x21, + 0xb382: 0x22, + 0xb383: 0x23, + 0xb384: 0x24, + 0xb385: 0x25, + 0xb386: 0x26, + 0xb387: 0x27, + 0xb388: 0x28, + 0xb389: 0x29, + 0xb38a: 0x2a, + 0xb38b: 0x2b, + 0xb38c: 0x2c, + 0xb38d: 0x2d, + 0xb38e: 0x2e, + 0xb38f: 0x2f, + 0xb390: 0x30, + 0xb391: 0x31, + 0xb392: 0x32, + 0xb393: 0x33, + 0xb394: 0x34, + 0xb395: 0x35, + 0xb396: 0x36, + 0xb397: 0x37, + 0xb398: 0x38, + 0xb399: 0x39, + 0xb39a: 0x3a, + 0xb39b: 0x3b, + 0xb39c: 0x3c, + 0xb39d: 0x3d, + 0xb39e: 0x3e, + 0xb39f: 0x3f, + 0xb3a0: 0x40, + 0xb3a1: 0x41, + 0xb3a2: 0x42, + 0xb3a3: 0x43, + 0xb3a4: 0x44, + 0xb3a5: 0x45, + 0xb3a6: 0x46, + 0xb3a7: 0x47, + 0xb3a8: 0x48, + 0xb3a9: 0x49, + 0xb3aa: 0x4a, + 0xb3ab: 0x4b, + 0xb3ac: 0x4c, + 0xb3ad: 0x4d, + 0xb3ae: 0x4e, + 0xb3af: 0x4f, + 0xb3b0: 0x50, + 0xb3b1: 0x51, + 0xb3b2: 0x52, + 0xb3b3: 0x53, + 0xb3b4: 0x54, + 0xb3b5: 0x55, + 0xb3b6: 0x56, + 0xb3b7: 0x57, + 0xb3b8: 0x58, + 0xb3b9: 0x59, + 0xb3ba: 0x5a, + 0xb3bb: 0x5b, + 0xb3bc: 0x5c, + 0xb3bd: 0x5d, + 0xb3be: 0x5e, + 0xb3bf: 0x5f, + 0xb3c0: 0x60, + 0xb3c1: 0x61, + 0xb3c2: 0x62, + 0xb3c3: 0x63, + 0xb3c4: 0x64, + 0xb3c5: 0x65, + 0xb3c6: 0x66, + 0xb3c7: 0x67, + 0xb3c8: 0x68, + 0xb3c9: 0x69, + 0xb3ca: 0x6a, + 0xb3cb: 0x6b, + 0xb3cc: 0x6c, + 0xb3cd: 0x6d, + 0xb3ce: 0x6e, + 0xb3cf: 0x6f, + 0xb3d0: 0x70, + 0xb3d1: 0x71, + 0xb3d2: 0x72, + 0xb3d3: 0x73, + 0xb3d4: 0x74, + 0xb3d5: 0x75, + 0xb3d6: 0x76, + 0xb3d7: 0x77, + 0xb3d8: 0x78, + 0xb3d9: 0x79, + 0xb3da: 0x7a, + 0xb3db: 0x7b, + 0xb3dc: 0x7c, + 0xb3dd: 0x7d, + 0xb3de: 0x7e, + 0xb3df: 0x7f, + 0xb3e0: 0x80 +}); + +/***/ }), +/* 196 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = encode; +var MSB = 0x80, + REST = 0x7F, + MSBALL = ~REST, + INT = Math.pow(2, 31); + +function encode(num, out, offset) { + out = out || []; + offset = offset || 0; + var oldOffset = offset; + + while (num >= INT) { + out[offset++] = num & 0xFF | MSB; + num /= 128; + } + + while (num & MSBALL) { + out[offset++] = num & 0xFF | MSB; + num >>>= 7; + } + + out[offset] = num | 0; + encode.bytes = offset - oldOffset + 1; + return out; +} + +/***/ }), +/* 197 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = read; +var MSB = 0x80, + REST = 0x7F; + +function read(buf, offset) { + var res = 0, + offset = offset || 0, + shift = 0, + counter = offset, + b, + l = buf.length; + + do { + if (counter >= l) { + read.bytes = 0; + throw new RangeError('Could not decode varint'); + } + + b = buf[counter++]; + res += shift < 28 ? (b & REST) << shift : (b & REST) * Math.pow(2, shift); + shift += 7; + } while (b >= MSB); + + read.bytes = counter - offset; + return res; +} + +/***/ }), +/* 198 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var N1 = Math.pow(2, 7); +var N2 = Math.pow(2, 14); +var N3 = Math.pow(2, 21); +var N4 = Math.pow(2, 28); +var N5 = Math.pow(2, 35); +var N6 = Math.pow(2, 42); +var N7 = Math.pow(2, 49); +var N8 = Math.pow(2, 56); +var N9 = Math.pow(2, 63); + +module.exports = function (value) { + return value < N1 ? 1 : value < N2 ? 2 : value < N3 ? 3 : value < N4 ? 4 : value < N5 ? 5 : value < N6 ? 6 : value < N7 ? 7 : value < N8 ? 8 : value < N9 ? 9 : 10; +}; + +/***/ }), +/* 199 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var Base = __webpack_require__(200); + +var baseX = __webpack_require__(201); + +var base16 = __webpack_require__(202); + +var base32 = __webpack_require__(203); + +var base64 = __webpack_require__(204); // name, code, implementation, alphabet + + +var constants = [['base1', '1', '', '1'], ['base2', '0', baseX, '01'], ['base8', '7', baseX, '01234567'], ['base10', '9', baseX, '0123456789'], ['base16', 'f', base16, '0123456789abcdef'], ['base32', 'b', base32, 'abcdefghijklmnopqrstuvwxyz234567'], ['base32pad', 'c', base32, 'abcdefghijklmnopqrstuvwxyz234567='], ['base32hex', 'v', base32, '0123456789abcdefghijklmnopqrstuv'], ['base32hexpad', 't', base32, '0123456789abcdefghijklmnopqrstuv='], ['base32z', 'h', base32, 'ybndrfg8ejkmcpqxot1uwisza345h769'], ['base58flickr', 'Z', baseX, '123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ'], ['base58btc', 'z', baseX, '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'], ['base64', 'm', base64, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'], ['base64pad', 'M', base64, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='], ['base64url', 'u', base64, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_'], ['base64urlpad', 'U', base64, 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=']]; +var names = constants.reduce(function (prev, tupple) { + prev[tupple[0]] = new Base(tupple[0], tupple[1], tupple[2], tupple[3]); + return prev; +}, {}); +var codes = constants.reduce(function (prev, tupple) { + prev[tupple[1]] = names[tupple[0]]; + return prev; +}, {}); +module.exports = { + names: names, + codes: codes +}; + +/***/ }), +/* 200 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } + +function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } + +var Base = +/*#__PURE__*/ +function () { + function Base(name, code, implementation, alphabet) { + _classCallCheck(this, Base); + + this.name = name; + this.code = code; + this.alphabet = alphabet; + + if (implementation && alphabet) { + this.engine = implementation(alphabet); + } + } + + _createClass(Base, [{ + key: "encode", + value: function encode(stringOrBuffer) { + return this.engine.encode(stringOrBuffer); + } + }, { + key: "decode", + value: function decode(stringOrBuffer) { + return this.engine.decode(stringOrBuffer); + } + }, { + key: "isImplemented", + value: function isImplemented() { + return this.engine; + } + }]); + + return Base; +}(); + +module.exports = Base; + +/***/ }), +/* 201 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +// base-x encoding +// Forked from https://github.com/cryptocoinjs/bs58 +// Originally written by Mike Hearn for BitcoinJ +// Copyright (c) 2011 Google Inc +// Ported to JavaScript by Stefan Thomas +// Merged Buffer refactorings from base58-native by Stephen Pair +// Copyright (c) 2013 BitPay Inc +var Buffer = __webpack_require__(7).Buffer; + +module.exports = function base(ALPHABET) { + var ALPHABET_MAP = {}; + var BASE = ALPHABET.length; + var LEADER = ALPHABET.charAt(0); // pre-compute lookup table + + for (var z = 0; z < ALPHABET.length; z++) { + var x = ALPHABET.charAt(z); + if (ALPHABET_MAP[x] !== undefined) throw new TypeError(x + ' is ambiguous'); + ALPHABET_MAP[x] = z; + } + + function encode(source) { + if (source.length === 0) return ''; + var digits = [0]; + + for (var i = 0; i < source.length; ++i) { + for (var j = 0, carry = source[i]; j < digits.length; ++j) { + carry += digits[j] << 8; + digits[j] = carry % BASE; + carry = carry / BASE | 0; + } + + while (carry > 0) { + digits.push(carry % BASE); + carry = carry / BASE | 0; + } + } + + var string = ''; // deal with leading zeros + + for (var k = 0; source[k] === 0 && k < source.length - 1; ++k) { + string += LEADER; + } // convert digits to a string + + + for (var q = digits.length - 1; q >= 0; --q) { + string += ALPHABET[digits[q]]; + } + + return string; + } + + function decodeUnsafe(string) { + if (typeof string !== 'string') throw new TypeError('Expected String'); + if (string.length === 0) return Buffer.allocUnsafe(0); + var bytes = [0]; + + for (var i = 0; i < string.length; i++) { + var value = ALPHABET_MAP[string[i]]; + if (value === undefined) return; + + for (var j = 0, carry = value; j < bytes.length; ++j) { + carry += bytes[j] * BASE; + bytes[j] = carry & 0xff; + carry >>= 8; + } + + while (carry > 0) { + bytes.push(carry & 0xff); + carry >>= 8; + } + } // deal with leading zeros + + + for (var k = 0; string[k] === LEADER && k < string.length - 1; ++k) { + bytes.push(0); + } + + return Buffer.from(bytes.reverse()); + } + + function decode(string) { + var buffer = decodeUnsafe(string); + if (buffer) return buffer; + throw new Error('Non-base' + BASE + ' character'); + } + + return { + encode: encode, + decodeUnsafe: decodeUnsafe, + decode: decode + }; +}; + +/***/ }), +/* 202 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +module.exports = function base16(alphabet) { + return { + encode: function encode(input) { + if (typeof input === 'string') { + return Buffer.from(input).toString('hex'); + } + + return input.toString('hex'); + }, + decode: function decode(input) { + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = input[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var _char = _step.value; + + if (alphabet.indexOf(_char) < 0) { + throw new Error('invalid base16 character'); + } + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator["return"] != null) { + _iterator["return"](); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } + + return Buffer.from(input, 'hex'); + } + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 203 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +function _decode(input, alphabet) { + input = input.replace(new RegExp('=', 'g'), ''); + var length = input.length; + var bits = 0; + var value = 0; + var index = 0; + var output = new Uint8Array(length * 5 / 8 | 0); + + for (var i = 0; i < length; i++) { + value = value << 5 | alphabet.indexOf(input[i]); + bits += 5; + + if (bits >= 8) { + output[index++] = value >>> bits - 8 & 255; + bits -= 8; + } + } + + return output.buffer; +} + +function _encode(buffer, alphabet) { + var length = buffer.byteLength; + var view = new Uint8Array(buffer); + var padding = alphabet.indexOf('=') === alphabet.length - 1; + + if (padding) { + alphabet = alphabet.substring(0, alphabet.length - 2); + } + + var bits = 0; + var value = 0; + var output = ''; + + for (var i = 0; i < length; i++) { + value = value << 8 | view[i]; + bits += 8; + + while (bits >= 5) { + output += alphabet[value >>> bits - 5 & 31]; + bits -= 5; + } + } + + if (bits > 0) { + output += alphabet[value << 5 - bits & 31]; + } + + if (padding) { + while (output.length % 8 !== 0) { + output += '='; + } + } + + return output; +} + +module.exports = function base32(alphabet) { + return { + encode: function encode(input) { + if (typeof input === 'string') { + return _encode(Buffer.from(input), alphabet); + } + + return _encode(input, alphabet); + }, + decode: function decode(input) { + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = input[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var _char = _step.value; + + if (alphabet.indexOf(_char) < 0) { + throw new Error('invalid base32 character'); + } + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator["return"] != null) { + _iterator["return"](); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } + + return _decode(input, alphabet); + } + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 204 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +module.exports = function base64(alphabet) { + // The alphabet is only used to know: + // 1. If padding is enabled (must contain '=') + // 2. If the output must be url-safe (must contain '-' and '_') + // 3. If the input of the output function is valid + // The alphabets from RFC 4648 are always used. + var padding = alphabet.indexOf('=') > -1; + var url = alphabet.indexOf('-') > -1 && alphabet.indexOf('_') > -1; + return { + encode: function encode(input) { + var output = ''; + + if (typeof input === 'string') { + output = Buffer.from(input).toString('base64'); + } else { + output = input.toString('base64'); + } + + if (url) { + output = output.replace(/\+/g, '-').replace(/\//g, '_'); + } + + var pad = output.indexOf('='); + + if (pad > 0 && !padding) { + output = output.substring(0, pad); + } + + return output; + }, + decode: function decode(input) { + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = input[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var _char = _step.value; + + if (alphabet.indexOf(_char) < 0) { + throw new Error('invalid base64 character'); + } + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator["return"] != null) { + _iterator["return"](); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } + + return Buffer.from(input, 'base64'); + } + }; +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 205 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var convert = __webpack_require__(206); + +var protocols = __webpack_require__(67); + +var varint = __webpack_require__(12); // export codec + + +module.exports = { + stringToStringTuples: stringToStringTuples, + stringTuplesToString: stringTuplesToString, + tuplesToStringTuples: tuplesToStringTuples, + stringTuplesToTuples: stringTuplesToTuples, + bufferToTuples: bufferToTuples, + tuplesToBuffer: tuplesToBuffer, + bufferToString: bufferToString, + stringToBuffer: stringToBuffer, + fromString: fromString, + fromBuffer: fromBuffer, + validateBuffer: validateBuffer, + isValidBuffer: isValidBuffer, + cleanPath: cleanPath, + ParseError: ParseError, + protoFromTuple: protoFromTuple, + sizeForAddr: sizeForAddr // string -> [[str name, str addr]... ] + +}; + +function stringToStringTuples(str) { + var tuples = []; + var parts = str.split('/').slice(1); // skip first empty elem + + if (parts.length === 1 && parts[0] === '') { + return []; + } + + for (var p = 0; p < parts.length; p++) { + var part = parts[p]; + var proto = protocols(part); + + if (proto.size === 0) { + tuples.push([part]); + continue; + } + + p++; // advance addr part + + if (p >= parts.length) { + throw ParseError('invalid address: ' + str); + } // if it's a path proto, take the rest + + + if (proto.path) { + tuples.push([part, // TODO: should we need to check each path part to see if it's a proto? + // This would allow for other protocols to be added after a unix path, + // however it would have issues if the path had a protocol name in the path + cleanPath(parts.slice(p).join('/'))]); + break; + } + + tuples.push([part, parts[p]]); + } + + return tuples; +} // [[str name, str addr]... ] -> string + + +function stringTuplesToString(tuples) { + var parts = []; + tuples.map(function (tup) { + var proto = protoFromTuple(tup); + parts.push(proto.name); + + if (tup.length > 1) { + parts.push(tup[1]); + } + }); + return cleanPath(parts.join('/')); +} // [[str name, str addr]... ] -> [[int code, Buffer]... ] + + +function stringTuplesToTuples(tuples) { + return tuples.map(function (tup) { + if (!Array.isArray(tup)) { + tup = [tup]; + } + + var proto = protoFromTuple(tup); + + if (tup.length > 1) { + return [proto.code, convert.toBuffer(proto.code, tup[1])]; + } + + return [proto.code]; + }); +} // [[int code, Buffer]... ] -> [[str name, str addr]... ] + + +function tuplesToStringTuples(tuples) { + return tuples.map(function (tup) { + var proto = protoFromTuple(tup); + + if (tup.length > 1) { + return [proto.code, convert.toString(proto.code, tup[1])]; + } + + return [proto.code]; + }); +} // [[int code, Buffer ]... ] -> Buffer + + +function tuplesToBuffer(tuples) { + return fromBuffer(Buffer.concat(tuples.map(function (tup) { + var proto = protoFromTuple(tup); + var buf = Buffer.from(varint.encode(proto.code)); + + if (tup.length > 1) { + buf = Buffer.concat([buf, tup[1]]); // add address buffer + } + + return buf; + }))); +} + +function sizeForAddr(p, addr) { + if (p.size > 0) { + return p.size / 8; + } else if (p.size === 0) { + return 0; + } else { + var size = varint.decode(addr); + return size + varint.decode.bytes; + } +} // Buffer -> [[int code, Buffer ]... ] + + +function bufferToTuples(buf) { + var tuples = []; + var i = 0; + + while (i < buf.length) { + var code = varint.decode(buf, i); + var n = varint.decode.bytes; + var p = protocols(code); + var size = sizeForAddr(p, buf.slice(i + n)); + + if (size === 0) { + tuples.push([code]); + i += n; + continue; + } + + var addr = buf.slice(i + n, i + n + size); + i += size + n; + + if (i > buf.length) { + // did not end _exactly_ at buffer.length + throw ParseError('Invalid address buffer: ' + buf.toString('hex')); + } // ok, tuple seems good. + + + tuples.push([code, addr]); + } + + return tuples; +} // Buffer -> String + + +function bufferToString(buf) { + var a = bufferToTuples(buf); + var b = tuplesToStringTuples(a); + return stringTuplesToString(b); +} // String -> Buffer + + +function stringToBuffer(str) { + str = cleanPath(str); + var a = stringToStringTuples(str); + var b = stringTuplesToTuples(a); + return tuplesToBuffer(b); +} // String -> Buffer + + +function fromString(str) { + return stringToBuffer(str); +} // Buffer -> Buffer + + +function fromBuffer(buf) { + var err = validateBuffer(buf); + if (err) throw err; + return Buffer.from(buf); // copy +} + +function validateBuffer(buf) { + try { + bufferToTuples(buf); // try to parse. will throw if breaks + } catch (err) { + return err; + } +} + +function isValidBuffer(buf) { + return validateBuffer(buf) === undefined; +} + +function cleanPath(str) { + return '/' + str.trim().split('/').filter(function (a) { + return a; + }).join('/'); +} + +function ParseError(str) { + return new Error('Error parsing address: ' + str); +} + +function protoFromTuple(tup) { + var proto = protocols(tup[0]); + return proto; +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 206 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var ip = __webpack_require__(207); + +var isIp = __webpack_require__(208); + +var protocols = __webpack_require__(67); + +var bs58 = __webpack_require__(21); + +var varint = __webpack_require__(12); + +module.exports = Convert; // converts (serializes) addresses + +function Convert(proto, a) { + if (a instanceof Buffer) { + return Convert.toString(proto, a); + } else { + return Convert.toBuffer(proto, a); + } +} + +Convert.toString = function convertToString(proto, buf) { + proto = protocols(proto); + + switch (proto.code) { + case 4: // ipv4 + + case 41: + // ipv6 + return buf2ip(buf); + + case 6: // tcp + + case 273: // udp + + case 33: // dccp + + case 132: + // sctp + return buf2port(buf); + + case 53: // dns + + case 54: // dns4 + + case 55: // dns6 + + case 56: // dnsaddr + + case 400: + // unix + return buf2str(buf); + + case 421: + // ipfs + return buf2mh(buf); + + default: + return buf.toString('hex'); + // no clue. convert to hex + } +}; + +Convert.toBuffer = function convertToBuffer(proto, str) { + proto = protocols(proto); + + switch (proto.code) { + case 4: + // ipv4 + return ip2buf(str); + + case 41: + // ipv6 + return ip2buf(str); + + case 6: // tcp + + case 273: // udp + + case 33: // dccp + + case 132: + // sctp + return port2buf(parseInt(str, 10)); + + case 53: // dns + + case 54: // dns4 + + case 55: // dns6 + + case 56: // dnsaddr + + case 400: + // unix + return str2buf(str); + + case 421: + // ipfs + return mh2buf(str); + + default: + return Buffer.from(str, 'hex'); + // no clue. convert from hex + } +}; + +function ip2buf(ipString) { + if (!isIp(ipString)) { + throw new Error('invalid ip address'); + } + + return ip.toBuffer(ipString); +} + +function buf2ip(ipBuff) { + var ipString = ip.toString(ipBuff); + + if (!isIp(ipString)) { + throw new Error('invalid ip address'); + } + + return ipString; +} + +function port2buf(port) { + var buf = Buffer.alloc(2); + buf.writeUInt16BE(port, 0); + return buf; +} + +function buf2port(buf) { + return buf.readUInt16BE(0); +} + +function str2buf(str) { + var buf = Buffer.from(str); + var size = Buffer.from(varint.encode(buf.length)); + return Buffer.concat([size, buf]); +} + +function buf2str(buf) { + var size = varint.decode(buf); + buf = buf.slice(varint.decode.bytes); + + if (buf.length !== size) { + throw new Error('inconsistent lengths'); + } + + return buf.toString(); +} + +function mh2buf(hash) { + // the address is a varint prefixed multihash string representation + var mh = Buffer.from(bs58.decode(hash)); + var size = Buffer.from(varint.encode(mh.length)); + return Buffer.concat([size, mh]); +} + +function buf2mh(buf) { + var size = varint.decode(buf); + var address = buf.slice(varint.decode.bytes); + + if (address.length !== size) { + throw new Error('inconsistent lengths'); + } + + return bs58.encode(address); +} +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 207 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var ip = exports; + +var Buffer = __webpack_require__(0).Buffer; + +var os = __webpack_require__(104); + +ip.toBuffer = function (ip, buff, offset) { + offset = ~~offset; + var result; + + if (this.isV4Format(ip)) { + result = buff || new Buffer(offset + 4); + ip.split(/\./g).map(function (_byte) { + result[offset++] = parseInt(_byte, 10) & 0xff; + }); + } else if (this.isV6Format(ip)) { + var sections = ip.split(':', 8); + var i; + + for (i = 0; i < sections.length; i++) { + var isv4 = this.isV4Format(sections[i]); + var v4Buffer; + + if (isv4) { + v4Buffer = this.toBuffer(sections[i]); + sections[i] = v4Buffer.slice(0, 2).toString('hex'); + } + + if (v4Buffer && ++i < 8) { + sections.splice(i, 0, v4Buffer.slice(2, 4).toString('hex')); + } + } + + if (sections[0] === '') { + while (sections.length < 8) { + sections.unshift('0'); + } + } else if (sections[sections.length - 1] === '') { + while (sections.length < 8) { + sections.push('0'); + } + } else if (sections.length < 8) { + for (i = 0; i < sections.length && sections[i] !== ''; i++) { + ; + } + + var argv = [i, 1]; + + for (i = 9 - sections.length; i > 0; i--) { + argv.push('0'); + } + + sections.splice.apply(sections, argv); + } + + result = buff || new Buffer(offset + 16); + + for (i = 0; i < sections.length; i++) { + var word = parseInt(sections[i], 16); + result[offset++] = word >> 8 & 0xff; + result[offset++] = word & 0xff; + } + } + + if (!result) { + throw Error('Invalid ip address: ' + ip); + } + + return result; +}; + +ip.toString = function (buff, offset, length) { + offset = ~~offset; + length = length || buff.length - offset; + var result = []; + + if (length === 4) { + // IPv4 + for (var i = 0; i < length; i++) { + result.push(buff[offset + i]); + } + + result = result.join('.'); + } else if (length === 16) { + // IPv6 + for (var i = 0; i < length; i += 2) { + result.push(buff.readUInt16BE(offset + i).toString(16)); + } + + result = result.join(':'); + result = result.replace(/(^|:)0(:0)*:0(:|$)/, '$1::$3'); + result = result.replace(/:{3,4}/, '::'); + } + + return result; +}; + +var ipv4Regex = /^(\d{1,3}\.){3,3}\d{1,3}$/; +var ipv6Regex = /^(::)?(((\d{1,3}\.){3}(\d{1,3}){1})?([0-9a-f]){0,4}:{0,2}){1,8}(::)?$/i; + +ip.isV4Format = function (ip) { + return ipv4Regex.test(ip); +}; + +ip.isV6Format = function (ip) { + return ipv6Regex.test(ip); +}; + +function _normalizeFamily(family) { + return family ? family.toLowerCase() : 'ipv4'; +} + +ip.fromPrefixLen = function (prefixlen, family) { + if (prefixlen > 32) { + family = 'ipv6'; + } else { + family = _normalizeFamily(family); + } + + var len = 4; + + if (family === 'ipv6') { + len = 16; + } + + var buff = new Buffer(len); + + for (var i = 0, n = buff.length; i < n; ++i) { + var bits = 8; + + if (prefixlen < 8) { + bits = prefixlen; + } + + prefixlen -= bits; + buff[i] = ~(0xff >> bits) & 0xff; + } + + return ip.toString(buff); +}; + +ip.mask = function (addr, mask) { + addr = ip.toBuffer(addr); + mask = ip.toBuffer(mask); + var result = new Buffer(Math.max(addr.length, mask.length)); + var i = 0; // Same protocol - do bitwise and + + if (addr.length === mask.length) { + for (i = 0; i < addr.length; i++) { + result[i] = addr[i] & mask[i]; + } + } else if (mask.length === 4) { + // IPv6 address and IPv4 mask + // (Mask low bits) + for (i = 0; i < mask.length; i++) { + result[i] = addr[addr.length - 4 + i] & mask[i]; + } + } else { + // IPv6 mask and IPv4 addr + for (var i = 0; i < result.length - 6; i++) { + result[i] = 0; + } // ::ffff:ipv4 + + + result[10] = 0xff; + result[11] = 0xff; + + for (i = 0; i < addr.length; i++) { + result[i + 12] = addr[i] & mask[i + 12]; + } + + i = i + 12; + } + + for (; i < result.length; i++) { + result[i] = 0; + } + + return ip.toString(result); +}; + +ip.cidr = function (cidrString) { + var cidrParts = cidrString.split('/'); + var addr = cidrParts[0]; + if (cidrParts.length !== 2) throw new Error('invalid CIDR subnet: ' + addr); + var mask = ip.fromPrefixLen(parseInt(cidrParts[1], 10)); + return ip.mask(addr, mask); +}; + +ip.subnet = function (addr, mask) { + var networkAddress = ip.toLong(ip.mask(addr, mask)); // Calculate the mask's length. + + var maskBuffer = ip.toBuffer(mask); + var maskLength = 0; + + for (var i = 0; i < maskBuffer.length; i++) { + if (maskBuffer[i] === 0xff) { + maskLength += 8; + } else { + var octet = maskBuffer[i] & 0xff; + + while (octet) { + octet = octet << 1 & 0xff; + maskLength++; + } + } + } + + var numberOfAddresses = Math.pow(2, 32 - maskLength); + return { + networkAddress: ip.fromLong(networkAddress), + firstAddress: numberOfAddresses <= 2 ? ip.fromLong(networkAddress) : ip.fromLong(networkAddress + 1), + lastAddress: numberOfAddresses <= 2 ? ip.fromLong(networkAddress + numberOfAddresses - 1) : ip.fromLong(networkAddress + numberOfAddresses - 2), + broadcastAddress: ip.fromLong(networkAddress + numberOfAddresses - 1), + subnetMask: mask, + subnetMaskLength: maskLength, + numHosts: numberOfAddresses <= 2 ? numberOfAddresses : numberOfAddresses - 2, + length: numberOfAddresses, + contains: function contains(other) { + return networkAddress === ip.toLong(ip.mask(other, mask)); + } + }; +}; + +ip.cidrSubnet = function (cidrString) { + var cidrParts = cidrString.split('/'); + var addr = cidrParts[0]; + if (cidrParts.length !== 2) throw new Error('invalid CIDR subnet: ' + addr); + var mask = ip.fromPrefixLen(parseInt(cidrParts[1], 10)); + return ip.subnet(addr, mask); +}; + +ip.not = function (addr) { + var buff = ip.toBuffer(addr); + + for (var i = 0; i < buff.length; i++) { + buff[i] = 0xff ^ buff[i]; + } + + return ip.toString(buff); +}; + +ip.or = function (a, b) { + a = ip.toBuffer(a); + b = ip.toBuffer(b); // same protocol + + if (a.length === b.length) { + for (var i = 0; i < a.length; ++i) { + a[i] |= b[i]; + } + + return ip.toString(a); // mixed protocols + } else { + var buff = a; + var other = b; + + if (b.length > a.length) { + buff = b; + other = a; + } + + var offset = buff.length - other.length; + + for (var i = offset; i < buff.length; ++i) { + buff[i] |= other[i - offset]; + } + + return ip.toString(buff); + } +}; + +ip.isEqual = function (a, b) { + a = ip.toBuffer(a); + b = ip.toBuffer(b); // Same protocol + + if (a.length === b.length) { + for (var i = 0; i < a.length; i++) { + if (a[i] !== b[i]) return false; + } + + return true; + } // Swap + + + if (b.length === 4) { + var t = b; + b = a; + a = t; + } // a - IPv4, b - IPv6 + + + for (var i = 0; i < 10; i++) { + if (b[i] !== 0) return false; + } + + var word = b.readUInt16BE(10); + if (word !== 0 && word !== 0xffff) return false; + + for (var i = 0; i < 4; i++) { + if (a[i] !== b[i + 12]) return false; + } + + return true; +}; + +ip.isPrivate = function (addr) { + return /^(::f{4}:)?10\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) || /^(::f{4}:)?192\.168\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) || /^(::f{4}:)?172\.(1[6-9]|2\d|30|31)\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) || /^(::f{4}:)?127\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) || /^(::f{4}:)?169\.254\.([0-9]{1,3})\.([0-9]{1,3})$/i.test(addr) || /^f[cd][0-9a-f]{2}:/i.test(addr) || /^fe80:/i.test(addr) || /^::1$/.test(addr) || /^::$/.test(addr); +}; + +ip.isPublic = function (addr) { + return !ip.isPrivate(addr); +}; + +ip.isLoopback = function (addr) { + return /^(::f{4}:)?127\.([0-9]{1,3})\.([0-9]{1,3})\.([0-9]{1,3})/.test(addr) || /^fe80::1$/.test(addr) || /^::1$/.test(addr) || /^::$/.test(addr); +}; + +ip.loopback = function (family) { + // + // Default to `ipv4` + // + family = _normalizeFamily(family); + + if (family !== 'ipv4' && family !== 'ipv6') { + throw new Error('family must be ipv4 or ipv6'); + } + + return family === 'ipv4' ? '127.0.0.1' : 'fe80::1'; +}; // +// ### function address (name, family) +// #### @name {string|'public'|'private'} **Optional** Name or security +// of the network interface. +// #### @family {ipv4|ipv6} **Optional** IP family of the address (defaults +// to ipv4). +// +// Returns the address for the network interface on the current system with +// the specified `name`: +// * String: First `family` address of the interface. +// If not found see `undefined`. +// * 'public': the first public ip address of family. +// * 'private': the first private ip address of family. +// * undefined: First address with `ipv4` or loopback address `127.0.0.1`. +// + + +ip.address = function (name, family) { + var interfaces = os.networkInterfaces(); + var all; // + // Default to `ipv4` + // + + family = _normalizeFamily(family); // + // If a specific network interface has been named, + // return the address. + // + + if (name && name !== 'private' && name !== 'public') { + var res = interfaces[name].filter(function (details) { + var itemFamily = details.family.toLowerCase(); + return itemFamily === family; + }); + if (res.length === 0) return undefined; + return res[0].address; + } + + var all = Object.keys(interfaces).map(function (nic) { + // + // Note: name will only be `public` or `private` + // when this is called. + // + var addresses = interfaces[nic].filter(function (details) { + details.family = details.family.toLowerCase(); + + if (details.family !== family || ip.isLoopback(details.address)) { + return false; + } else if (!name) { + return true; + } + + return name === 'public' ? ip.isPrivate(details.address) : ip.isPublic(details.address); + }); + return addresses.length ? addresses[0].address : undefined; + }).filter(Boolean); + return !all.length ? ip.loopback(family) : all[0]; +}; + +ip.toLong = function (ip) { + var ipl = 0; + ip.split('.').forEach(function (octet) { + ipl <<= 8; + ipl += parseInt(octet); + }); + return ipl >>> 0; +}; + +ip.fromLong = function (ipl) { + return (ipl >>> 24) + '.' + (ipl >> 16 & 255) + '.' + (ipl >> 8 & 255) + '.' + (ipl & 255); +}; + +/***/ }), +/* 208 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var ipRegex = __webpack_require__(209); + +var isIp = module.exports = function (x) { + return ipRegex({ + exact: true + }).test(x); +}; + +isIp.v4 = function (x) { + return ipRegex.v4({ + exact: true + }).test(x); +}; + +isIp.v6 = function (x) { + return ipRegex.v6({ + exact: true + }).test(x); +}; + +/***/ }), +/* 209 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var v4 = '(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])(?:\\.(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])){3}'; +var v6seg = '[0-9a-fA-F]{1,4}'; +var v6 = "\n(\n(?:".concat(v6seg, ":){7}(?:").concat(v6seg, "|:)| // 1:2:3:4:5:6:7:: 1:2:3:4:5:6:7:8\n(?:").concat(v6seg, ":){6}(?:").concat(v4, "|:").concat(v6seg, "|:)| // 1:2:3:4:5:6:: 1:2:3:4:5:6::8 1:2:3:4:5:6::8 1:2:3:4:5:6::1.2.3.4\n(?:").concat(v6seg, ":){5}(?::").concat(v4, "|(:").concat(v6seg, "){1,2}|:)| // 1:2:3:4:5:: 1:2:3:4:5::7:8 1:2:3:4:5::8 1:2:3:4:5::7:1.2.3.4\n(?:").concat(v6seg, ":){4}(?:(:").concat(v6seg, "){0,1}:").concat(v4, "|(:").concat(v6seg, "){1,3}|:)| // 1:2:3:4:: 1:2:3:4::6:7:8 1:2:3:4::8 1:2:3:4::6:7:1.2.3.4\n(?:").concat(v6seg, ":){3}(?:(:").concat(v6seg, "){0,2}:").concat(v4, "|(:").concat(v6seg, "){1,4}|:)| // 1:2:3:: 1:2:3::5:6:7:8 1:2:3::8 1:2:3::5:6:7:1.2.3.4\n(?:").concat(v6seg, ":){2}(?:(:").concat(v6seg, "){0,3}:").concat(v4, "|(:").concat(v6seg, "){1,5}|:)| // 1:2:: 1:2::4:5:6:7:8 1:2::8 1:2::4:5:6:7:1.2.3.4\n(?:").concat(v6seg, ":){1}(?:(:").concat(v6seg, "){0,4}:").concat(v4, "|(:").concat(v6seg, "){1,6}|:)| // 1:: 1::3:4:5:6:7:8 1::8 1::3:4:5:6:7:1.2.3.4\n(?::((?::").concat(v6seg, "){0,5}:").concat(v4, "|(?::").concat(v6seg, "){1,7}|:)) // ::2:3:4:5:6:7:8 ::2:3:4:5:6:7:8 ::8 ::1.2.3.4\n)(%[0-9a-zA-Z]{1,})? // %eth0 %1\n").replace(/\s*\/\/.*$/gm, '').replace(/\n/g, '').trim(); + +var ip = module.exports = function (opts) { + return opts && opts.exact ? new RegExp("(?:^".concat(v4, "$)|(?:^").concat(v6, "$)")) : new RegExp("(?:".concat(v4, ")|(?:").concat(v6, ")"), 'g'); +}; + +ip.v4 = function (opts) { + return opts && opts.exact ? new RegExp("^".concat(v4, "$")) : new RegExp(v4, 'g'); +}; + +ip.v6 = function (opts) { + return opts && opts.exact ? new RegExp("^".concat(v6, "$")) : new RegExp(v6, 'g'); +}; + +/***/ }), +/* 210 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var multiaddr = __webpack_require__(16); +/* + * Valid combinations + */ + + +var DNS4 = base('dns4'); +var DNS6 = base('dns6'); + +var _DNS = or(base('dnsaddr'), DNS4, DNS6); + +var IP = or(base('ip4'), base('ip6')); +var TCP = or(and(IP, base('tcp')), and(_DNS, base('tcp'))); +var UDP = and(IP, base('udp')); +var UTP = and(UDP, base('utp')); +var DNS = or(and(_DNS, base('tcp')), _DNS); +var WebSockets = or(and(TCP, base('ws')), and(DNS, base('ws'))); +var WebSocketsSecure = or(and(TCP, base('wss')), and(DNS, base('wss'))); +var HTTP = or(and(TCP, base('http')), and(IP, base('http')), and(DNS, base('http')), and(DNS)); +var HTTPS = or(and(TCP, base('https')), and(IP, base('https')), and(DNS, base('https'))); +var WebRTCStar = or(and(WebSockets, base('p2p-webrtc-star'), base('ipfs')), and(WebSocketsSecure, base('p2p-webrtc-star'), base('ipfs'))); +var WebSocketStar = or(and(WebSockets, base('p2p-websocket-star'), base('ipfs')), and(WebSocketsSecure, base('p2p-websocket-star'), base('ipfs')), and(WebSockets, base('p2p-websocket-star')), and(WebSocketsSecure, base('p2p-websocket-star'))); +var WebRTCDirect = or(and(HTTP, base('p2p-webrtc-direct')), and(HTTPS, base('p2p-webrtc-direct'))); +var Reliable = or(WebSockets, WebSocketsSecure, HTTP, HTTPS, WebRTCStar, WebRTCDirect, TCP, UTP); // Unlike ws-star, stardust can run over any transport thus removing the requirement for websockets (but don't even think about running a stardust server over webrtc-star ;) ) + +var Stardust = or(and(Reliable, base('p2p-stardust'), base('ipfs')), and(Reliable, base('p2p-stardust'))); + +var _IPFS = or(and(Reliable, base('ipfs')), WebRTCStar, base('ipfs')); + +var _Circuit = or(and(_IPFS, base('p2p-circuit'), _IPFS), and(_IPFS, base('p2p-circuit')), and(base('p2p-circuit'), _IPFS), and(Reliable, base('p2p-circuit')), and(base('p2p-circuit'), Reliable), base('p2p-circuit')); + +var CircuitRecursive = function CircuitRecursive() { + return or(and(_Circuit, CircuitRecursive), _Circuit); +}; + +var Circuit = CircuitRecursive(); +var IPFS = or(and(Circuit, _IPFS, Circuit), and(_IPFS, Circuit), and(Circuit, _IPFS), Circuit, _IPFS); +exports.DNS = DNS; +exports.DNS4 = DNS4; +exports.DNS6 = DNS6; +exports.IP = IP; +exports.TCP = TCP; +exports.UDP = UDP; +exports.UTP = UTP; +exports.HTTP = HTTP; +exports.HTTPS = HTTPS; +exports.WebSockets = WebSockets; +exports.WebSocketsSecure = WebSocketsSecure; +exports.WebSocketStar = WebSocketStar; +exports.WebRTCStar = WebRTCStar; +exports.WebRTCDirect = WebRTCDirect; +exports.Reliable = Reliable; +exports.Stardust = Stardust; +exports.Circuit = Circuit; +exports.IPFS = IPFS; +/* + * Validation funcs + */ + +function makeMatchesFunction(partialMatch) { + return function matches(a) { + if (!multiaddr.isMultiaddr(a)) { + try { + a = multiaddr(a); + } catch (err) { + // catch error + return false; // also if it's invalid it's propably not matching as well so return false + } + } + + var out = partialMatch(a.protoNames()); + + if (out === null) { + return false; + } + + return out.length === 0; + }; +} + +function and() { + var args = Array.from(arguments); + + function partialMatch(a) { + if (a.length < args.length) { + return null; + } + + args.some(function (arg) { + a = typeof arg === 'function' ? arg().partialMatch(a) : arg.partialMatch(a); + + if (a === null) { + return true; + } + }); + return a; + } + + return { + toString: function toString() { + return '{ ' + args.join(' ') + ' }'; + }, + input: args, + matches: makeMatchesFunction(partialMatch), + partialMatch: partialMatch + }; +} + +function or() { + var args = Array.from(arguments); + + function partialMatch(a) { + var out = null; + args.some(function (arg) { + var res = typeof arg === 'function' ? arg().partialMatch(a) : arg.partialMatch(a); + + if (res) { + out = res; + return true; + } + }); + return out; + } + + var result = { + toString: function toString() { + return '{ ' + args.join(' ') + ' }'; + }, + input: args, + matches: makeMatchesFunction(partialMatch), + partialMatch: partialMatch + }; + return result; +} + +function base(n) { + var name = n; + + function matches(a) { + if (typeof a === 'string') { + try { + a = multiaddr(a); + } catch (err) { + // catch error + return false; // also if it's invalid it's propably not matching as well so return false + } + } + + var pnames = a.protoNames(); + + if (pnames.length === 1 && pnames[0] === name) { + return true; + } + + return false; + } + + function partialMatch(protos) { + if (protos.length === 0) { + return null; + } + + if (protos[0] === name) { + return protos.slice(1); + } + + return null; + } + + return { + toString: function toString() { + return name; + }, + matches: matches, + partialMatch: partialMatch + }; +} + +/***/ }), +/* 211 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var baseTable = __webpack_require__(68); + +var varintBufferEncode = __webpack_require__(105).varintBufferEncode; // this creates a map for codecName -> codeVarintBuffer + + +var varintTable = {}; +module.exports = varintTable; + +for (var encodingName in baseTable) { + var code = baseTable[encodingName]; + varintTable[encodingName] = varintBufferEncode(code); +} + +/***/ }), +/* 212 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var baseTable = __webpack_require__(68); // this creates a map for code as hexString -> codecName + + +var nameTable = {}; +module.exports = nameTable; + +for (var encodingName in baseTable) { + var code = baseTable[encodingName]; + nameTable[code.toString('hex')] = encodingName; +} + +/***/ }), +/* 213 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// THIS FILE IS GENERATED, DO NO EDIT MANUALLY +// For more information see the README.md + +/* eslint-disable dot-notation */ + + +module.exports = Object.freeze({ + // serialization + PROTOBUF: 0x50, + CBOR: 0x51, + RLP: 0x60, + BENCODE: 0x63, + // multiformat + MULTICODEC: 0x30, + MULTIHASH: 0x31, + MULTIADDR: 0x32, + MULTIBASE: 0x33, + // multihash + IDENTITY: 0x00, + SHA1: 0x11, + SHA2_256: 0x12, + SHA2_512: 0x13, + SHA3_512: 0x14, + SHA3_384: 0x15, + SHA3_256: 0x16, + SHA3_224: 0x17, + SHAKE_128: 0x18, + SHAKE_256: 0x19, + KECCAK_224: 0x1a, + KECCAK_256: 0x1b, + KECCAK_384: 0x1c, + KECCAK_512: 0x1d, + MURMUR3_128: 0x22, + MURMUR3_32: 0x23, + DBL_SHA2_256: 0x56, + MD4: 0xd4, + MD5: 0xd5, + BMT: 0xd6, + X11: 0x1100, + BLAKE2B_8: 0xb201, + BLAKE2B_16: 0xb202, + BLAKE2B_24: 0xb203, + BLAKE2B_32: 0xb204, + BLAKE2B_40: 0xb205, + BLAKE2B_48: 0xb206, + BLAKE2B_56: 0xb207, + BLAKE2B_64: 0xb208, + BLAKE2B_72: 0xb209, + BLAKE2B_80: 0xb20a, + BLAKE2B_88: 0xb20b, + BLAKE2B_96: 0xb20c, + BLAKE2B_104: 0xb20d, + BLAKE2B_112: 0xb20e, + BLAKE2B_120: 0xb20f, + BLAKE2B_128: 0xb210, + BLAKE2B_136: 0xb211, + BLAKE2B_144: 0xb212, + BLAKE2B_152: 0xb213, + BLAKE2B_160: 0xb214, + BLAKE2B_168: 0xb215, + BLAKE2B_176: 0xb216, + BLAKE2B_184: 0xb217, + BLAKE2B_192: 0xb218, + BLAKE2B_200: 0xb219, + BLAKE2B_208: 0xb21a, + BLAKE2B_216: 0xb21b, + BLAKE2B_224: 0xb21c, + BLAKE2B_232: 0xb21d, + BLAKE2B_240: 0xb21e, + BLAKE2B_248: 0xb21f, + BLAKE2B_256: 0xb220, + BLAKE2B_264: 0xb221, + BLAKE2B_272: 0xb222, + BLAKE2B_280: 0xb223, + BLAKE2B_288: 0xb224, + BLAKE2B_296: 0xb225, + BLAKE2B_304: 0xb226, + BLAKE2B_312: 0xb227, + BLAKE2B_320: 0xb228, + BLAKE2B_328: 0xb229, + BLAKE2B_336: 0xb22a, + BLAKE2B_344: 0xb22b, + BLAKE2B_352: 0xb22c, + BLAKE2B_360: 0xb22d, + BLAKE2B_368: 0xb22e, + BLAKE2B_376: 0xb22f, + BLAKE2B_384: 0xb230, + BLAKE2B_392: 0xb231, + BLAKE2B_400: 0xb232, + BLAKE2B_408: 0xb233, + BLAKE2B_416: 0xb234, + BLAKE2B_424: 0xb235, + BLAKE2B_432: 0xb236, + BLAKE2B_440: 0xb237, + BLAKE2B_448: 0xb238, + BLAKE2B_456: 0xb239, + BLAKE2B_464: 0xb23a, + BLAKE2B_472: 0xb23b, + BLAKE2B_480: 0xb23c, + BLAKE2B_488: 0xb23d, + BLAKE2B_496: 0xb23e, + BLAKE2B_504: 0xb23f, + BLAKE2B_512: 0xb240, + BLAKE2S_8: 0xb241, + BLAKE2S_16: 0xb242, + BLAKE2S_24: 0xb243, + BLAKE2S_32: 0xb244, + BLAKE2S_40: 0xb245, + BLAKE2S_48: 0xb246, + BLAKE2S_56: 0xb247, + BLAKE2S_64: 0xb248, + BLAKE2S_72: 0xb249, + BLAKE2S_80: 0xb24a, + BLAKE2S_88: 0xb24b, + BLAKE2S_96: 0xb24c, + BLAKE2S_104: 0xb24d, + BLAKE2S_112: 0xb24e, + BLAKE2S_120: 0xb24f, + BLAKE2S_128: 0xb250, + BLAKE2S_136: 0xb251, + BLAKE2S_144: 0xb252, + BLAKE2S_152: 0xb253, + BLAKE2S_160: 0xb254, + BLAKE2S_168: 0xb255, + BLAKE2S_176: 0xb256, + BLAKE2S_184: 0xb257, + BLAKE2S_192: 0xb258, + BLAKE2S_200: 0xb259, + BLAKE2S_208: 0xb25a, + BLAKE2S_216: 0xb25b, + BLAKE2S_224: 0xb25c, + BLAKE2S_232: 0xb25d, + BLAKE2S_240: 0xb25e, + BLAKE2S_248: 0xb25f, + BLAKE2S_256: 0xb260, + SKEIN256_8: 0xb301, + SKEIN256_16: 0xb302, + SKEIN256_24: 0xb303, + SKEIN256_32: 0xb304, + SKEIN256_40: 0xb305, + SKEIN256_48: 0xb306, + SKEIN256_56: 0xb307, + SKEIN256_64: 0xb308, + SKEIN256_72: 0xb309, + SKEIN256_80: 0xb30a, + SKEIN256_88: 0xb30b, + SKEIN256_96: 0xb30c, + SKEIN256_104: 0xb30d, + SKEIN256_112: 0xb30e, + SKEIN256_120: 0xb30f, + SKEIN256_128: 0xb310, + SKEIN256_136: 0xb311, + SKEIN256_144: 0xb312, + SKEIN256_152: 0xb313, + SKEIN256_160: 0xb314, + SKEIN256_168: 0xb315, + SKEIN256_176: 0xb316, + SKEIN256_184: 0xb317, + SKEIN256_192: 0xb318, + SKEIN256_200: 0xb319, + SKEIN256_208: 0xb31a, + SKEIN256_216: 0xb31b, + SKEIN256_224: 0xb31c, + SKEIN256_232: 0xb31d, + SKEIN256_240: 0xb31e, + SKEIN256_248: 0xb31f, + SKEIN256_256: 0xb320, + SKEIN512_8: 0xb321, + SKEIN512_16: 0xb322, + SKEIN512_24: 0xb323, + SKEIN512_32: 0xb324, + SKEIN512_40: 0xb325, + SKEIN512_48: 0xb326, + SKEIN512_56: 0xb327, + SKEIN512_64: 0xb328, + SKEIN512_72: 0xb329, + SKEIN512_80: 0xb32a, + SKEIN512_88: 0xb32b, + SKEIN512_96: 0xb32c, + SKEIN512_104: 0xb32d, + SKEIN512_112: 0xb32e, + SKEIN512_120: 0xb32f, + SKEIN512_128: 0xb330, + SKEIN512_136: 0xb331, + SKEIN512_144: 0xb332, + SKEIN512_152: 0xb333, + SKEIN512_160: 0xb334, + SKEIN512_168: 0xb335, + SKEIN512_176: 0xb336, + SKEIN512_184: 0xb337, + SKEIN512_192: 0xb338, + SKEIN512_200: 0xb339, + SKEIN512_208: 0xb33a, + SKEIN512_216: 0xb33b, + SKEIN512_224: 0xb33c, + SKEIN512_232: 0xb33d, + SKEIN512_240: 0xb33e, + SKEIN512_248: 0xb33f, + SKEIN512_256: 0xb340, + SKEIN512_264: 0xb341, + SKEIN512_272: 0xb342, + SKEIN512_280: 0xb343, + SKEIN512_288: 0xb344, + SKEIN512_296: 0xb345, + SKEIN512_304: 0xb346, + SKEIN512_312: 0xb347, + SKEIN512_320: 0xb348, + SKEIN512_328: 0xb349, + SKEIN512_336: 0xb34a, + SKEIN512_344: 0xb34b, + SKEIN512_352: 0xb34c, + SKEIN512_360: 0xb34d, + SKEIN512_368: 0xb34e, + SKEIN512_376: 0xb34f, + SKEIN512_384: 0xb350, + SKEIN512_392: 0xb351, + SKEIN512_400: 0xb352, + SKEIN512_408: 0xb353, + SKEIN512_416: 0xb354, + SKEIN512_424: 0xb355, + SKEIN512_432: 0xb356, + SKEIN512_440: 0xb357, + SKEIN512_448: 0xb358, + SKEIN512_456: 0xb359, + SKEIN512_464: 0xb35a, + SKEIN512_472: 0xb35b, + SKEIN512_480: 0xb35c, + SKEIN512_488: 0xb35d, + SKEIN512_496: 0xb35e, + SKEIN512_504: 0xb35f, + SKEIN512_512: 0xb360, + SKEIN1024_8: 0xb361, + SKEIN1024_16: 0xb362, + SKEIN1024_24: 0xb363, + SKEIN1024_32: 0xb364, + SKEIN1024_40: 0xb365, + SKEIN1024_48: 0xb366, + SKEIN1024_56: 0xb367, + SKEIN1024_64: 0xb368, + SKEIN1024_72: 0xb369, + SKEIN1024_80: 0xb36a, + SKEIN1024_88: 0xb36b, + SKEIN1024_96: 0xb36c, + SKEIN1024_104: 0xb36d, + SKEIN1024_112: 0xb36e, + SKEIN1024_120: 0xb36f, + SKEIN1024_128: 0xb370, + SKEIN1024_136: 0xb371, + SKEIN1024_144: 0xb372, + SKEIN1024_152: 0xb373, + SKEIN1024_160: 0xb374, + SKEIN1024_168: 0xb375, + SKEIN1024_176: 0xb376, + SKEIN1024_184: 0xb377, + SKEIN1024_192: 0xb378, + SKEIN1024_200: 0xb379, + SKEIN1024_208: 0xb37a, + SKEIN1024_216: 0xb37b, + SKEIN1024_224: 0xb37c, + SKEIN1024_232: 0xb37d, + SKEIN1024_240: 0xb37e, + SKEIN1024_248: 0xb37f, + SKEIN1024_256: 0xb380, + SKEIN1024_264: 0xb381, + SKEIN1024_272: 0xb382, + SKEIN1024_280: 0xb383, + SKEIN1024_288: 0xb384, + SKEIN1024_296: 0xb385, + SKEIN1024_304: 0xb386, + SKEIN1024_312: 0xb387, + SKEIN1024_320: 0xb388, + SKEIN1024_328: 0xb389, + SKEIN1024_336: 0xb38a, + SKEIN1024_344: 0xb38b, + SKEIN1024_352: 0xb38c, + SKEIN1024_360: 0xb38d, + SKEIN1024_368: 0xb38e, + SKEIN1024_376: 0xb38f, + SKEIN1024_384: 0xb390, + SKEIN1024_392: 0xb391, + SKEIN1024_400: 0xb392, + SKEIN1024_408: 0xb393, + SKEIN1024_416: 0xb394, + SKEIN1024_424: 0xb395, + SKEIN1024_432: 0xb396, + SKEIN1024_440: 0xb397, + SKEIN1024_448: 0xb398, + SKEIN1024_456: 0xb399, + SKEIN1024_464: 0xb39a, + SKEIN1024_472: 0xb39b, + SKEIN1024_480: 0xb39c, + SKEIN1024_488: 0xb39d, + SKEIN1024_496: 0xb39e, + SKEIN1024_504: 0xb39f, + SKEIN1024_512: 0xb3a0, + SKEIN1024_520: 0xb3a1, + SKEIN1024_528: 0xb3a2, + SKEIN1024_536: 0xb3a3, + SKEIN1024_544: 0xb3a4, + SKEIN1024_552: 0xb3a5, + SKEIN1024_560: 0xb3a6, + SKEIN1024_568: 0xb3a7, + SKEIN1024_576: 0xb3a8, + SKEIN1024_584: 0xb3a9, + SKEIN1024_592: 0xb3aa, + SKEIN1024_600: 0xb3ab, + SKEIN1024_608: 0xb3ac, + SKEIN1024_616: 0xb3ad, + SKEIN1024_624: 0xb3ae, + SKEIN1024_632: 0xb3af, + SKEIN1024_640: 0xb3b0, + SKEIN1024_648: 0xb3b1, + SKEIN1024_656: 0xb3b2, + SKEIN1024_664: 0xb3b3, + SKEIN1024_672: 0xb3b4, + SKEIN1024_680: 0xb3b5, + SKEIN1024_688: 0xb3b6, + SKEIN1024_696: 0xb3b7, + SKEIN1024_704: 0xb3b8, + SKEIN1024_712: 0xb3b9, + SKEIN1024_720: 0xb3ba, + SKEIN1024_728: 0xb3bb, + SKEIN1024_736: 0xb3bc, + SKEIN1024_744: 0xb3bd, + SKEIN1024_752: 0xb3be, + SKEIN1024_760: 0xb3bf, + SKEIN1024_768: 0xb3c0, + SKEIN1024_776: 0xb3c1, + SKEIN1024_784: 0xb3c2, + SKEIN1024_792: 0xb3c3, + SKEIN1024_800: 0xb3c4, + SKEIN1024_808: 0xb3c5, + SKEIN1024_816: 0xb3c6, + SKEIN1024_824: 0xb3c7, + SKEIN1024_832: 0xb3c8, + SKEIN1024_840: 0xb3c9, + SKEIN1024_848: 0xb3ca, + SKEIN1024_856: 0xb3cb, + SKEIN1024_864: 0xb3cc, + SKEIN1024_872: 0xb3cd, + SKEIN1024_880: 0xb3ce, + SKEIN1024_888: 0xb3cf, + SKEIN1024_896: 0xb3d0, + SKEIN1024_904: 0xb3d1, + SKEIN1024_912: 0xb3d2, + SKEIN1024_920: 0xb3d3, + SKEIN1024_928: 0xb3d4, + SKEIN1024_936: 0xb3d5, + SKEIN1024_944: 0xb3d6, + SKEIN1024_952: 0xb3d7, + SKEIN1024_960: 0xb3d8, + SKEIN1024_968: 0xb3d9, + SKEIN1024_976: 0xb3da, + SKEIN1024_984: 0xb3db, + SKEIN1024_992: 0xb3dc, + SKEIN1024_1000: 0xb3dd, + SKEIN1024_1008: 0xb3de, + SKEIN1024_1016: 0xb3df, + SKEIN1024_1024: 0xb3e0, + // multiaddr + IP4: 0x04, + TCP: 0x06, + DCCP: 0x21, + IP6: 0x29, + IP6ZONE: 0x2a, + DNS: 0x35, + DNS4: 0x36, + DNS6: 0x37, + DNSADDR: 0x38, + SCTP: 0x84, + UDP: 0x0111, + P2P_WEBRTC_STAR: 0x0113, + P2P_WEBRTC_DIRECT: 0x0114, + P2P_STARDUST: 0x0115, + P2P_CIRCUIT: 0x0122, + UDT: 0x012d, + UTP: 0x012e, + UNIX: 0x0190, + P2P: 0x01a5, + IPFS: 0x01a5, + HTTPS: 0x01bb, + ONION: 0x01bc, + ONION3: 0x01bd, + GARLIC64: 0x01be, + QUIC: 0x01cc, + WS: 0x01dd, + WSS: 0x01de, + P2P_WEBSOCKET_STAR: 0x01df, + HTTP: 0x01e0, + // ipld + RAW: 0x55, + DAG_PB: 0x70, + DAG_CBOR: 0x71, + GIT_RAW: 0x78, + TORRENT_INFO: 0x7b, + TORRENT_FILE: 0x7c, + LEOFCOIN_BLOCK: 0x81, + LEOFCOIN_TX: 0x82, + LEOFCOIN_PR: 0x83, + ETH_BLOCK: 0x90, + ETH_BLOCK_LIST: 0x91, + ETH_TX_TRIE: 0x92, + ETH_TX: 0x93, + ETH_TX_RECEIPT_TRIE: 0x94, + ETH_TX_RECEIPT: 0x95, + ETH_STATE_TRIE: 0x96, + ETH_ACCOUNT_SNAPSHOT: 0x97, + ETH_STORAGE_TRIE: 0x98, + BITCOIN_BLOCK: 0xb0, + BITCOIN_TX: 0xb1, + ZCASH_BLOCK: 0xc0, + ZCASH_TX: 0xc1, + STELLAR_BLOCK: 0xd0, + STELLAR_TX: 0xd1, + DECRED_BLOCK: 0xe0, + DECRED_TX: 0xe1, + DASH_BLOCK: 0xf0, + DASH_TX: 0xf1, + SWARM_MANIFEST: 0xfa, + SWARM_FEED: 0xfb, + DAG_JSON: 0x0129, + // namespace + PATH: 0x2f, + IPLD_NS: 0xe2, + IPFS_NS: 0xe3, + SWARM_NS: 0xe4, + // key + ED25519_PUB: 0xed, + // holochain + HOLOCHAIN_ADR_V0: 0x807124, + HOLOCHAIN_ADR_V1: 0x817124, + HOLOCHAIN_KEY_V0: 0x947124, + HOLOCHAIN_KEY_V1: 0x957124, + HOLOCHAIN_SIG_V0: 0xa27124, + HOLOCHAIN_SIG_V1: 0xa37124 +}); + +/***/ }), +/* 214 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +// THIS FILE IS GENERATED, DO NO EDIT MANUALLY +// For more information see the README.md + +/* eslint-disable dot-notation */ + + +module.exports = Object.freeze({ + // serialization + 0x50: 'protobuf', + 0x51: 'cbor', + 0x60: 'rlp', + 0x63: 'bencode', + // multiformat + 0x30: 'multicodec', + 0x31: 'multihash', + 0x32: 'multiaddr', + 0x33: 'multibase', + // multihash + 0x00: 'identity', + 0x11: 'sha1', + 0x12: 'sha2-256', + 0x13: 'sha2-512', + 0x14: 'sha3-512', + 0x15: 'sha3-384', + 0x16: 'sha3-256', + 0x17: 'sha3-224', + 0x18: 'shake-128', + 0x19: 'shake-256', + 0x1a: 'keccak-224', + 0x1b: 'keccak-256', + 0x1c: 'keccak-384', + 0x1d: 'keccak-512', + 0x22: 'murmur3-128', + 0x23: 'murmur3-32', + 0x56: 'dbl-sha2-256', + 0xd4: 'md4', + 0xd5: 'md5', + 0xd6: 'bmt', + 0x1100: 'x11', + 0xb201: 'blake2b-8', + 0xb202: 'blake2b-16', + 0xb203: 'blake2b-24', + 0xb204: 'blake2b-32', + 0xb205: 'blake2b-40', + 0xb206: 'blake2b-48', + 0xb207: 'blake2b-56', + 0xb208: 'blake2b-64', + 0xb209: 'blake2b-72', + 0xb20a: 'blake2b-80', + 0xb20b: 'blake2b-88', + 0xb20c: 'blake2b-96', + 0xb20d: 'blake2b-104', + 0xb20e: 'blake2b-112', + 0xb20f: 'blake2b-120', + 0xb210: 'blake2b-128', + 0xb211: 'blake2b-136', + 0xb212: 'blake2b-144', + 0xb213: 'blake2b-152', + 0xb214: 'blake2b-160', + 0xb215: 'blake2b-168', + 0xb216: 'blake2b-176', + 0xb217: 'blake2b-184', + 0xb218: 'blake2b-192', + 0xb219: 'blake2b-200', + 0xb21a: 'blake2b-208', + 0xb21b: 'blake2b-216', + 0xb21c: 'blake2b-224', + 0xb21d: 'blake2b-232', + 0xb21e: 'blake2b-240', + 0xb21f: 'blake2b-248', + 0xb220: 'blake2b-256', + 0xb221: 'blake2b-264', + 0xb222: 'blake2b-272', + 0xb223: 'blake2b-280', + 0xb224: 'blake2b-288', + 0xb225: 'blake2b-296', + 0xb226: 'blake2b-304', + 0xb227: 'blake2b-312', + 0xb228: 'blake2b-320', + 0xb229: 'blake2b-328', + 0xb22a: 'blake2b-336', + 0xb22b: 'blake2b-344', + 0xb22c: 'blake2b-352', + 0xb22d: 'blake2b-360', + 0xb22e: 'blake2b-368', + 0xb22f: 'blake2b-376', + 0xb230: 'blake2b-384', + 0xb231: 'blake2b-392', + 0xb232: 'blake2b-400', + 0xb233: 'blake2b-408', + 0xb234: 'blake2b-416', + 0xb235: 'blake2b-424', + 0xb236: 'blake2b-432', + 0xb237: 'blake2b-440', + 0xb238: 'blake2b-448', + 0xb239: 'blake2b-456', + 0xb23a: 'blake2b-464', + 0xb23b: 'blake2b-472', + 0xb23c: 'blake2b-480', + 0xb23d: 'blake2b-488', + 0xb23e: 'blake2b-496', + 0xb23f: 'blake2b-504', + 0xb240: 'blake2b-512', + 0xb241: 'blake2s-8', + 0xb242: 'blake2s-16', + 0xb243: 'blake2s-24', + 0xb244: 'blake2s-32', + 0xb245: 'blake2s-40', + 0xb246: 'blake2s-48', + 0xb247: 'blake2s-56', + 0xb248: 'blake2s-64', + 0xb249: 'blake2s-72', + 0xb24a: 'blake2s-80', + 0xb24b: 'blake2s-88', + 0xb24c: 'blake2s-96', + 0xb24d: 'blake2s-104', + 0xb24e: 'blake2s-112', + 0xb24f: 'blake2s-120', + 0xb250: 'blake2s-128', + 0xb251: 'blake2s-136', + 0xb252: 'blake2s-144', + 0xb253: 'blake2s-152', + 0xb254: 'blake2s-160', + 0xb255: 'blake2s-168', + 0xb256: 'blake2s-176', + 0xb257: 'blake2s-184', + 0xb258: 'blake2s-192', + 0xb259: 'blake2s-200', + 0xb25a: 'blake2s-208', + 0xb25b: 'blake2s-216', + 0xb25c: 'blake2s-224', + 0xb25d: 'blake2s-232', + 0xb25e: 'blake2s-240', + 0xb25f: 'blake2s-248', + 0xb260: 'blake2s-256', + 0xb301: 'skein256-8', + 0xb302: 'skein256-16', + 0xb303: 'skein256-24', + 0xb304: 'skein256-32', + 0xb305: 'skein256-40', + 0xb306: 'skein256-48', + 0xb307: 'skein256-56', + 0xb308: 'skein256-64', + 0xb309: 'skein256-72', + 0xb30a: 'skein256-80', + 0xb30b: 'skein256-88', + 0xb30c: 'skein256-96', + 0xb30d: 'skein256-104', + 0xb30e: 'skein256-112', + 0xb30f: 'skein256-120', + 0xb310: 'skein256-128', + 0xb311: 'skein256-136', + 0xb312: 'skein256-144', + 0xb313: 'skein256-152', + 0xb314: 'skein256-160', + 0xb315: 'skein256-168', + 0xb316: 'skein256-176', + 0xb317: 'skein256-184', + 0xb318: 'skein256-192', + 0xb319: 'skein256-200', + 0xb31a: 'skein256-208', + 0xb31b: 'skein256-216', + 0xb31c: 'skein256-224', + 0xb31d: 'skein256-232', + 0xb31e: 'skein256-240', + 0xb31f: 'skein256-248', + 0xb320: 'skein256-256', + 0xb321: 'skein512-8', + 0xb322: 'skein512-16', + 0xb323: 'skein512-24', + 0xb324: 'skein512-32', + 0xb325: 'skein512-40', + 0xb326: 'skein512-48', + 0xb327: 'skein512-56', + 0xb328: 'skein512-64', + 0xb329: 'skein512-72', + 0xb32a: 'skein512-80', + 0xb32b: 'skein512-88', + 0xb32c: 'skein512-96', + 0xb32d: 'skein512-104', + 0xb32e: 'skein512-112', + 0xb32f: 'skein512-120', + 0xb330: 'skein512-128', + 0xb331: 'skein512-136', + 0xb332: 'skein512-144', + 0xb333: 'skein512-152', + 0xb334: 'skein512-160', + 0xb335: 'skein512-168', + 0xb336: 'skein512-176', + 0xb337: 'skein512-184', + 0xb338: 'skein512-192', + 0xb339: 'skein512-200', + 0xb33a: 'skein512-208', + 0xb33b: 'skein512-216', + 0xb33c: 'skein512-224', + 0xb33d: 'skein512-232', + 0xb33e: 'skein512-240', + 0xb33f: 'skein512-248', + 0xb340: 'skein512-256', + 0xb341: 'skein512-264', + 0xb342: 'skein512-272', + 0xb343: 'skein512-280', + 0xb344: 'skein512-288', + 0xb345: 'skein512-296', + 0xb346: 'skein512-304', + 0xb347: 'skein512-312', + 0xb348: 'skein512-320', + 0xb349: 'skein512-328', + 0xb34a: 'skein512-336', + 0xb34b: 'skein512-344', + 0xb34c: 'skein512-352', + 0xb34d: 'skein512-360', + 0xb34e: 'skein512-368', + 0xb34f: 'skein512-376', + 0xb350: 'skein512-384', + 0xb351: 'skein512-392', + 0xb352: 'skein512-400', + 0xb353: 'skein512-408', + 0xb354: 'skein512-416', + 0xb355: 'skein512-424', + 0xb356: 'skein512-432', + 0xb357: 'skein512-440', + 0xb358: 'skein512-448', + 0xb359: 'skein512-456', + 0xb35a: 'skein512-464', + 0xb35b: 'skein512-472', + 0xb35c: 'skein512-480', + 0xb35d: 'skein512-488', + 0xb35e: 'skein512-496', + 0xb35f: 'skein512-504', + 0xb360: 'skein512-512', + 0xb361: 'skein1024-8', + 0xb362: 'skein1024-16', + 0xb363: 'skein1024-24', + 0xb364: 'skein1024-32', + 0xb365: 'skein1024-40', + 0xb366: 'skein1024-48', + 0xb367: 'skein1024-56', + 0xb368: 'skein1024-64', + 0xb369: 'skein1024-72', + 0xb36a: 'skein1024-80', + 0xb36b: 'skein1024-88', + 0xb36c: 'skein1024-96', + 0xb36d: 'skein1024-104', + 0xb36e: 'skein1024-112', + 0xb36f: 'skein1024-120', + 0xb370: 'skein1024-128', + 0xb371: 'skein1024-136', + 0xb372: 'skein1024-144', + 0xb373: 'skein1024-152', + 0xb374: 'skein1024-160', + 0xb375: 'skein1024-168', + 0xb376: 'skein1024-176', + 0xb377: 'skein1024-184', + 0xb378: 'skein1024-192', + 0xb379: 'skein1024-200', + 0xb37a: 'skein1024-208', + 0xb37b: 'skein1024-216', + 0xb37c: 'skein1024-224', + 0xb37d: 'skein1024-232', + 0xb37e: 'skein1024-240', + 0xb37f: 'skein1024-248', + 0xb380: 'skein1024-256', + 0xb381: 'skein1024-264', + 0xb382: 'skein1024-272', + 0xb383: 'skein1024-280', + 0xb384: 'skein1024-288', + 0xb385: 'skein1024-296', + 0xb386: 'skein1024-304', + 0xb387: 'skein1024-312', + 0xb388: 'skein1024-320', + 0xb389: 'skein1024-328', + 0xb38a: 'skein1024-336', + 0xb38b: 'skein1024-344', + 0xb38c: 'skein1024-352', + 0xb38d: 'skein1024-360', + 0xb38e: 'skein1024-368', + 0xb38f: 'skein1024-376', + 0xb390: 'skein1024-384', + 0xb391: 'skein1024-392', + 0xb392: 'skein1024-400', + 0xb393: 'skein1024-408', + 0xb394: 'skein1024-416', + 0xb395: 'skein1024-424', + 0xb396: 'skein1024-432', + 0xb397: 'skein1024-440', + 0xb398: 'skein1024-448', + 0xb399: 'skein1024-456', + 0xb39a: 'skein1024-464', + 0xb39b: 'skein1024-472', + 0xb39c: 'skein1024-480', + 0xb39d: 'skein1024-488', + 0xb39e: 'skein1024-496', + 0xb39f: 'skein1024-504', + 0xb3a0: 'skein1024-512', + 0xb3a1: 'skein1024-520', + 0xb3a2: 'skein1024-528', + 0xb3a3: 'skein1024-536', + 0xb3a4: 'skein1024-544', + 0xb3a5: 'skein1024-552', + 0xb3a6: 'skein1024-560', + 0xb3a7: 'skein1024-568', + 0xb3a8: 'skein1024-576', + 0xb3a9: 'skein1024-584', + 0xb3aa: 'skein1024-592', + 0xb3ab: 'skein1024-600', + 0xb3ac: 'skein1024-608', + 0xb3ad: 'skein1024-616', + 0xb3ae: 'skein1024-624', + 0xb3af: 'skein1024-632', + 0xb3b0: 'skein1024-640', + 0xb3b1: 'skein1024-648', + 0xb3b2: 'skein1024-656', + 0xb3b3: 'skein1024-664', + 0xb3b4: 'skein1024-672', + 0xb3b5: 'skein1024-680', + 0xb3b6: 'skein1024-688', + 0xb3b7: 'skein1024-696', + 0xb3b8: 'skein1024-704', + 0xb3b9: 'skein1024-712', + 0xb3ba: 'skein1024-720', + 0xb3bb: 'skein1024-728', + 0xb3bc: 'skein1024-736', + 0xb3bd: 'skein1024-744', + 0xb3be: 'skein1024-752', + 0xb3bf: 'skein1024-760', + 0xb3c0: 'skein1024-768', + 0xb3c1: 'skein1024-776', + 0xb3c2: 'skein1024-784', + 0xb3c3: 'skein1024-792', + 0xb3c4: 'skein1024-800', + 0xb3c5: 'skein1024-808', + 0xb3c6: 'skein1024-816', + 0xb3c7: 'skein1024-824', + 0xb3c8: 'skein1024-832', + 0xb3c9: 'skein1024-840', + 0xb3ca: 'skein1024-848', + 0xb3cb: 'skein1024-856', + 0xb3cc: 'skein1024-864', + 0xb3cd: 'skein1024-872', + 0xb3ce: 'skein1024-880', + 0xb3cf: 'skein1024-888', + 0xb3d0: 'skein1024-896', + 0xb3d1: 'skein1024-904', + 0xb3d2: 'skein1024-912', + 0xb3d3: 'skein1024-920', + 0xb3d4: 'skein1024-928', + 0xb3d5: 'skein1024-936', + 0xb3d6: 'skein1024-944', + 0xb3d7: 'skein1024-952', + 0xb3d8: 'skein1024-960', + 0xb3d9: 'skein1024-968', + 0xb3da: 'skein1024-976', + 0xb3db: 'skein1024-984', + 0xb3dc: 'skein1024-992', + 0xb3dd: 'skein1024-1000', + 0xb3de: 'skein1024-1008', + 0xb3df: 'skein1024-1016', + 0xb3e0: 'skein1024-1024', + // multiaddr + 0x04: 'ip4', + 0x06: 'tcp', + 0x21: 'dccp', + 0x29: 'ip6', + 0x2a: 'ip6zone', + 0x35: 'dns', + 0x36: 'dns4', + 0x37: 'dns6', + 0x38: 'dnsaddr', + 0x84: 'sctp', + 0x0111: 'udp', + 0x0113: 'p2p-webrtc-star', + 0x0114: 'p2p-webrtc-direct', + 0x0115: 'p2p-stardust', + 0x0122: 'p2p-circuit', + 0x012d: 'udt', + 0x012e: 'utp', + 0x0190: 'unix', + 0x01a5: 'p2p', + 0x01bb: 'https', + 0x01bc: 'onion', + 0x01bd: 'onion3', + 0x01be: 'garlic64', + 0x01cc: 'quic', + 0x01dd: 'ws', + 0x01de: 'wss', + 0x01df: 'p2p-websocket-star', + 0x01e0: 'http', + // ipld + 0x55: 'raw', + 0x70: 'dag-pb', + 0x71: 'dag-cbor', + 0x78: 'git-raw', + 0x7b: 'torrent-info', + 0x7c: 'torrent-file', + 0x81: 'leofcoin-block', + 0x82: 'leofcoin-tx', + 0x83: 'leofcoin-pr', + 0x90: 'eth-block', + 0x91: 'eth-block-list', + 0x92: 'eth-tx-trie', + 0x93: 'eth-tx', + 0x94: 'eth-tx-receipt-trie', + 0x95: 'eth-tx-receipt', + 0x96: 'eth-state-trie', + 0x97: 'eth-account-snapshot', + 0x98: 'eth-storage-trie', + 0xb0: 'bitcoin-block', + 0xb1: 'bitcoin-tx', + 0xc0: 'zcash-block', + 0xc1: 'zcash-tx', + 0xd0: 'stellar-block', + 0xd1: 'stellar-tx', + 0xe0: 'decred-block', + 0xe1: 'decred-tx', + 0xf0: 'dash-block', + 0xf1: 'dash-tx', + 0xfa: 'swarm-manifest', + 0xfb: 'swarm-feed', + 0x0129: 'dag-json', + // namespace + 0x2f: 'path', + 0xe2: 'ipld-ns', + 0xe3: 'ipfs-ns', + 0xe4: 'swarm-ns', + // key + 0xed: 'ed25519-pub', + // holochain + 0x807124: 'holochain-adr-v0', + 0x817124: 'holochain-adr-v1', + 0x947124: 'holochain-key-v0', + 0x957124: 'holochain-key-v1', + 0xa27124: 'holochain-sig-v0', + 0xa37124: 'holochain-sig-v1' +}); + +/***/ }), +/* 215 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var mh = __webpack_require__(14); + +var CIDUtil = { + /** + * Test if the given input is a valid CID object. + * Returns an error message if it is not. + * Returns undefined if it is a valid CID. + * + * @param {any} other + * @returns {string} + */ + checkCIDComponents: function checkCIDComponents(other) { + if (other == null) { + return 'null values are not valid CIDs'; + } + + if (!(other.version === 0 || other.version === 1)) { + return 'Invalid version, must be a number equal to 1 or 0'; + } + + if (typeof other.codec !== 'string') { + return 'codec must be string'; + } + + if (other.version === 0) { + if (other.codec !== 'dag-pb') { + return "codec must be 'dag-pb' for CIDv0"; + } + + if (other.multibaseName !== 'base58btc') { + return "multibaseName must be 'base58btc' for CIDv0"; + } + } + + if (!Buffer.isBuffer(other.multihash)) { + return 'multihash must be a Buffer'; + } + + try { + mh.validate(other.multihash); + } catch (err) { + var errorMsg = err.message; + + if (!errorMsg) { + // Just in case mh.validate() throws an error with empty error message + errorMsg = 'Multihash validation failed'; + } + + return errorMsg; + } + } +}; +module.exports = CIDUtil; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 216 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var protobuf = __webpack_require__(51); + +var keysPBM = protobuf(__webpack_require__(70)); + +__webpack_require__(71); + +__webpack_require__(106); + +__webpack_require__(112); + +var forge = __webpack_require__(8); + +exports = module.exports; +var supportedKeys = { + rsa: __webpack_require__(239), + ed25519: __webpack_require__(265), + secp256k1: __webpack_require__(269)(keysPBM, __webpack_require__(120)) +}; +exports.supportedKeys = supportedKeys; +exports.keysPBM = keysPBM; + +function isValidKeyType(keyType) { + var key = supportedKeys[keyType.toLowerCase()]; + return key !== undefined; +} + +exports.keyStretcher = __webpack_require__(300); +exports.generateEphemeralKeyPair = __webpack_require__(306); // Generates a keypair of the given type and bitsize + +exports.generateKeyPair = function (type, bits, cb) { + var key = supportedKeys[type.toLowerCase()]; + + if (!key) { + return cb(new Error('invalid or unsupported key type')); + } + + key.generateKeyPair(bits, cb); +}; // Generates a keypair of the given type and bitsize +// seed is a 32 byte uint8array + + +exports.generateKeyPairFromSeed = function (type, seed, bits, cb) { + var key = supportedKeys[type.toLowerCase()]; + + if (!key) { + return cb(new Error('invalid or unsupported key type')); + } + + if (type.toLowerCase() !== 'ed25519') { + return cb(new Error('Seed key derivation is unimplemented for RSA or secp256k1')); + } + + key.generateKeyPairFromSeed(seed, bits, cb); +}; // Converts a protobuf serialized public key into its +// representative object + + +exports.unmarshalPublicKey = function (buf) { + var decoded = keysPBM.PublicKey.decode(buf); + var data = decoded.Data; + + switch (decoded.Type) { + case keysPBM.KeyType.RSA: + return supportedKeys.rsa.unmarshalRsaPublicKey(data); + + case keysPBM.KeyType.Ed25519: + return supportedKeys.ed25519.unmarshalEd25519PublicKey(data); + + case keysPBM.KeyType.Secp256k1: + if (supportedKeys.secp256k1) { + return supportedKeys.secp256k1.unmarshalSecp256k1PublicKey(data); + } else { + throw new Error('secp256k1 support requires libp2p-crypto-secp256k1 package'); + } + + default: + throw new Error('invalid or unsupported key type'); + } +}; // Converts a public key object into a protobuf serialized public key + + +exports.marshalPublicKey = function (key, type) { + type = (type || 'rsa').toLowerCase(); + + if (!isValidKeyType(type)) { + throw new Error('invalid or unsupported key type'); + } + + return key.bytes; +}; // Converts a protobuf serialized private key into its +// representative object + + +exports.unmarshalPrivateKey = function (buf, callback) { + var decoded; + + try { + decoded = keysPBM.PrivateKey.decode(buf); + } catch (err) { + return callback(err); + } + + var data = decoded.Data; + + switch (decoded.Type) { + case keysPBM.KeyType.RSA: + return supportedKeys.rsa.unmarshalRsaPrivateKey(data, callback); + + case keysPBM.KeyType.Ed25519: + return supportedKeys.ed25519.unmarshalEd25519PrivateKey(data, callback); + + case keysPBM.KeyType.Secp256k1: + if (supportedKeys.secp256k1) { + return supportedKeys.secp256k1.unmarshalSecp256k1PrivateKey(data, callback); + } else { + return callback(new Error('secp256k1 support requires libp2p-crypto-secp256k1 package')); + } + + default: + callback(new Error('invalid or unsupported key type')); + } +}; // Converts a private key object into a protobuf serialized private key + + +exports.marshalPrivateKey = function (key, type) { + type = (type || 'rsa').toLowerCase(); + + if (!isValidKeyType(type)) { + throw new Error('invalid or unsupported key type'); + } + + return key.bytes; +}; + +exports["import"] = function (pem, password, callback) { + try { + var key = forge.pki.decryptRsaPrivateKey(pem, password); + + if (key === null) { + throw new Error('Cannot read the key, most likely the password is wrong or not a RSA key'); + } + + var der = forge.asn1.toDer(forge.pki.privateKeyToAsn1(key)); + der = Buffer.from(der.getBytes(), 'binary'); + return supportedKeys.rsa.unmarshalRsaPrivateKey(der, callback); + } catch (err) { + callback(err); + } +}; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 217 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var parse = __webpack_require__(218); + +var stringify = __webpack_require__(220); + +module.exports = parse; +module.exports.parse = parse; +module.exports.stringify = stringify; + +/***/ }), +/* 218 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var tokenize = __webpack_require__(219); + +var MAX_RANGE = 0x1FFFFFFF; // "Only repeated fields of primitive numeric types (types which use the varint, 32-bit, or 64-bit wire types) can be declared "packed"." +// https://developers.google.com/protocol-buffers/docs/encoding#optional + +var PACKABLE_TYPES = [// varint wire types +'int32', 'int64', 'uint32', 'uint64', 'sint32', 'sint64', 'bool', // + ENUMS +// 64-bit wire types +'fixed64', 'sfixed64', 'double', // 32-bit wire types +'fixed32', 'sfixed32', 'float']; + +var onfieldoptions = function onfieldoptions(tokens) { + var opts = {}; + + while (tokens.length) { + switch (tokens[0]) { + case '[': + case ',': + tokens.shift(); + var name = tokens.shift(); + + if (name === '(') { + // handling [(A) = B] + name = tokens.shift(); + tokens.shift(); // remove the end of bracket + } + + if (tokens[0] !== '=') throw new Error('Unexpected token in field options: ' + tokens[0]); + tokens.shift(); + if (tokens[0] === ']') throw new Error('Unexpected ] in field option'); + opts[name] = tokens.shift(); + break; + + case ']': + tokens.shift(); + return opts; + + default: + throw new Error('Unexpected token in field options: ' + tokens[0]); + } + } + + throw new Error('No closing tag for field options'); +}; + +var onfield = function onfield(tokens) { + var field = { + name: null, + type: null, + tag: -1, + map: null, + oneof: null, + required: false, + repeated: false, + options: {} + }; + + while (tokens.length) { + switch (tokens[0]) { + case '=': + tokens.shift(); + field.tag = Number(tokens.shift()); + break; + + case 'map': + field.type = 'map'; + field.map = { + from: null, + to: null + }; + tokens.shift(); + if (tokens[0] !== '<') throw new Error('Unexpected token in map type: ' + tokens[0]); + tokens.shift(); + field.map.from = tokens.shift(); + if (tokens[0] !== ',') throw new Error('Unexpected token in map type: ' + tokens[0]); + tokens.shift(); + field.map.to = tokens.shift(); + if (tokens[0] !== '>') throw new Error('Unexpected token in map type: ' + tokens[0]); + tokens.shift(); + field.name = tokens.shift(); + break; + + case 'repeated': + case 'required': + case 'optional': + var t = tokens.shift(); + field.required = t === 'required'; + field.repeated = t === 'repeated'; + field.type = tokens.shift(); + field.name = tokens.shift(); + break; + + case '[': + field.options = onfieldoptions(tokens); + break; + + case ';': + if (field.name === null) throw new Error('Missing field name'); + if (field.type === null) throw new Error('Missing type in message field: ' + field.name); + if (field.tag === -1) throw new Error('Missing tag number in message field: ' + field.name); + tokens.shift(); + return field; + + default: + throw new Error('Unexpected token in message field: ' + tokens[0]); + } + } + + throw new Error('No ; found for message field'); +}; + +var onmessagebody = function onmessagebody(tokens) { + var body = { + enums: [], + messages: [], + fields: [], + "extends": [], + extensions: null + }; + + while (tokens.length) { + switch (tokens[0]) { + case 'map': + case 'repeated': + case 'optional': + case 'required': + body.fields.push(onfield(tokens)); + break; + + case 'enum': + body.enums.push(onenum(tokens)); + break; + + case 'message': + body.messages.push(onmessage(tokens)); + break; + + case 'extensions': + body.extensions = onextensions(tokens); + break; + + case 'oneof': + tokens.shift(); + var name = tokens.shift(); + if (tokens[0] !== '{') throw new Error('Unexpected token in oneof: ' + tokens[0]); + tokens.shift(); + + while (tokens[0] !== '}') { + tokens.unshift('optional'); + var field = onfield(tokens); + field.oneof = name; + body.fields.push(field); + } + + tokens.shift(); + break; + + case 'extend': + body["extends"].push(onextend(tokens)); + break; + + case ';': + tokens.shift(); + break; + + case 'reserved': + case 'option': + tokens.shift(); + + while (tokens[0] !== ';') { + tokens.shift(); + } + + break; + + default: + // proto3 does not require the use of optional/required, assumed as optional + // "singular: a well-formed message can have zero or one of this field (but not more than one)." + // https://developers.google.com/protocol-buffers/docs/proto3#specifying-field-rules + tokens.unshift('optional'); + body.fields.push(onfield(tokens)); + } + } + + return body; +}; + +var onextend = function onextend(tokens) { + var out = { + name: tokens[1], + message: onmessage(tokens) + }; + return out; +}; + +var onextensions = function onextensions(tokens) { + tokens.shift(); + var from = Number(tokens.shift()); + if (isNaN(from)) throw new Error('Invalid from in extensions definition'); + if (tokens.shift() !== 'to') throw new Error("Expected keyword 'to' in extensions definition"); + var to = tokens.shift(); + if (to === 'max') to = MAX_RANGE; + to = Number(to); + if (isNaN(to)) throw new Error('Invalid to in extensions definition'); + if (tokens.shift() !== ';') throw new Error('Missing ; in extensions definition'); + return { + from: from, + to: to + }; +}; + +var onmessage = function onmessage(tokens) { + tokens.shift(); + var lvl = 1; + var body = []; + var msg = { + name: tokens.shift(), + enums: [], + "extends": [], + messages: [], + fields: [] + }; + if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0]); + tokens.shift(); + + while (tokens.length) { + if (tokens[0] === '{') lvl++;else if (tokens[0] === '}') lvl--; + + if (!lvl) { + tokens.shift(); + body = onmessagebody(body); + msg.enums = body.enums; + msg.messages = body.messages; + msg.fields = body.fields; + msg["extends"] = body["extends"]; + msg.extensions = body.extensions; + return msg; + } + + body.push(tokens.shift()); + } + + if (lvl) throw new Error('No closing tag for message'); +}; + +var onpackagename = function onpackagename(tokens) { + tokens.shift(); + var name = tokens.shift(); + if (tokens[0] !== ';') throw new Error('Expected ; but found ' + tokens[0]); + tokens.shift(); + return name; +}; + +var onsyntaxversion = function onsyntaxversion(tokens) { + tokens.shift(); + if (tokens[0] !== '=') throw new Error('Expected = but found ' + tokens[0]); + tokens.shift(); + var version = tokens.shift(); + + switch (version) { + case '"proto2"': + version = 2; + break; + + case '"proto3"': + version = 3; + break; + + default: + throw new Error('Expected protobuf syntax version but found ' + version); + } + + if (tokens[0] !== ';') throw new Error('Expected ; but found ' + tokens[0]); + tokens.shift(); + return version; +}; + +var onenumvalue = function onenumvalue(tokens) { + if (tokens.length < 4) throw new Error('Invalid enum value: ' + tokens.slice(0, 3).join(' ')); + if (tokens[1] !== '=') throw new Error('Expected = but found ' + tokens[1]); + if (tokens[3] !== ';' && tokens[3] !== '[') throw new Error('Expected ; or [ but found ' + tokens[1]); + var name = tokens.shift(); + tokens.shift(); + var val = { + value: null, + options: {} + }; + val.value = Number(tokens.shift()); + + if (tokens[0] === '[') { + val.options = onfieldoptions(tokens); + } + + tokens.shift(); // expecting the semicolon here + + return { + name: name, + val: val + }; +}; + +var onenum = function onenum(tokens) { + tokens.shift(); + var options = {}; + var e = { + name: tokens.shift(), + values: {}, + options: {} + }; + if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0]); + tokens.shift(); + + while (tokens.length) { + if (tokens[0] === '}') { + tokens.shift(); // there goes optional semicolon after the enclosing "}" + + if (tokens[0] === ';') tokens.shift(); + return e; + } + + if (tokens[0] === 'option') { + options = onoption(tokens); + e.options[options.name] = options.value; + continue; + } + + var val = onenumvalue(tokens); + e.values[val.name] = val.val; + } + + throw new Error('No closing tag for enum'); +}; + +var onoption = function onoption(tokens) { + var name = null; + var value = null; + + var parse = function parse(value) { + if (value === 'true') return true; + if (value === 'false') return false; + return value.replace(/^"+|"+$/gm, ''); + }; + + while (tokens.length) { + if (tokens[0] === ';') { + tokens.shift(); + return { + name: name, + value: value + }; + } + + switch (tokens[0]) { + case 'option': + tokens.shift(); + var hasBracket = tokens[0] === '('; + if (hasBracket) tokens.shift(); + name = tokens.shift(); + + if (hasBracket) { + if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0]); + tokens.shift(); + } + + if (tokens[0][0] === '.') { + name += tokens.shift(); + } + + break; + + case '=': + tokens.shift(); + if (name === null) throw new Error('Expected key for option with value: ' + tokens[0]); + value = parse(tokens.shift()); + + if (name === 'optimize_for' && !/^(SPEED|CODE_SIZE|LITE_RUNTIME)$/.test(value)) { + throw new Error('Unexpected value for option optimize_for: ' + value); + } else if (value === '{') { + // option foo = {bar: baz} + value = onoptionMap(tokens); + } + + break; + + default: + throw new Error('Unexpected token in option: ' + tokens[0]); + } + } +}; + +var onoptionMap = function onoptionMap(tokens) { + var parse = function parse(value) { + if (value === 'true') return true; + if (value === 'false') return false; + return value.replace(/^"+|"+$/gm, ''); + }; + + var map = {}; + + while (tokens.length) { + if (tokens[0] === '}') { + tokens.shift(); + return map; + } + + var hasBracket = tokens[0] === '('; + if (hasBracket) tokens.shift(); + var key = tokens.shift(); + + if (hasBracket) { + if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0]); + tokens.shift(); + } + + var value = null; + + switch (tokens[0]) { + case ':': + if (map[key] !== undefined) throw new Error('Duplicate option map key ' + key); + tokens.shift(); + value = parse(tokens.shift()); + + if (value === '{') { + // option foo = {bar: baz} + value = onoptionMap(tokens); + } + + map[key] = value; + + if (tokens[0] === ';') { + tokens.shift(); + } + + break; + + case '{': + tokens.shift(); + value = onoptionMap(tokens); + if (map[key] === undefined) map[key] = []; + if (!Array.isArray(map[key])) throw new Error('Duplicate option map key ' + key); + map[key].push(value); + break; + + default: + throw new Error('Unexpected token in option map: ' + tokens[0]); + } + } + + throw new Error('No closing tag for option map'); +}; + +var onimport = function onimport(tokens) { + tokens.shift(); + var file = tokens.shift().replace(/^"+|"+$/gm, ''); + if (tokens[0] !== ';') throw new Error('Unexpected token: ' + tokens[0] + '. Expected ";"'); + tokens.shift(); + return file; +}; + +var onservice = function onservice(tokens) { + tokens.shift(); + var service = { + name: tokens.shift(), + methods: [], + options: {} + }; + if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0]); + tokens.shift(); + + while (tokens.length) { + if (tokens[0] === '}') { + tokens.shift(); // there goes optional semicolon after the enclosing "}" + + if (tokens[0] === ';') tokens.shift(); + return service; + } + + switch (tokens[0]) { + case 'option': + var opt = onoption(tokens); + if (service.options[opt.name] !== undefined) throw new Error('Duplicate option ' + opt.name); + service.options[opt.name] = opt.value; + break; + + case 'rpc': + service.methods.push(onrpc(tokens)); + break; + + default: + throw new Error('Unexpected token in service: ' + tokens[0]); + } + } + + throw new Error('No closing tag for service'); +}; + +var onrpc = function onrpc(tokens) { + tokens.shift(); + var rpc = { + name: tokens.shift(), + input_type: null, + output_type: null, + client_streaming: false, + server_streaming: false, + options: {} + }; + if (tokens[0] !== '(') throw new Error('Expected ( but found ' + tokens[0]); + tokens.shift(); + + if (tokens[0] === 'stream') { + tokens.shift(); + rpc.client_streaming = true; + } + + rpc.input_type = tokens.shift(); + if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0]); + tokens.shift(); + if (tokens[0] !== 'returns') throw new Error('Expected returns but found ' + tokens[0]); + tokens.shift(); + if (tokens[0] !== '(') throw new Error('Expected ( but found ' + tokens[0]); + tokens.shift(); + + if (tokens[0] === 'stream') { + tokens.shift(); + rpc.server_streaming = true; + } + + rpc.output_type = tokens.shift(); + if (tokens[0] !== ')') throw new Error('Expected ) but found ' + tokens[0]); + tokens.shift(); + + if (tokens[0] === ';') { + tokens.shift(); + return rpc; + } + + if (tokens[0] !== '{') throw new Error('Expected { but found ' + tokens[0]); + tokens.shift(); + + while (tokens.length) { + if (tokens[0] === '}') { + tokens.shift(); // there goes optional semicolon after the enclosing "}" + + if (tokens[0] === ';') tokens.shift(); + return rpc; + } + + if (tokens[0] === 'option') { + var opt = onoption(tokens); + if (rpc.options[opt.name] !== undefined) throw new Error('Duplicate option ' + opt.name); + rpc.options[opt.name] = opt.value; + } else { + throw new Error('Unexpected token in rpc options: ' + tokens[0]); + } + } + + throw new Error('No closing tag for rpc'); +}; + +var parse = function parse(buf) { + var tokens = tokenize(buf.toString()); // check for isolated strings in tokens by looking for opening quote + + for (var i = 0; i < tokens.length; i++) { + if (/^("|')([^'"]*)$/.test(tokens[i])) { + var j; + + if (tokens[i].length === 1) { + j = i + 1; + } else { + j = i; + } // look ahead for the closing quote and collapse all + // in-between tokens into a single token + + + for (j; j < tokens.length; j++) { + if (/^([^'"]*)("|')$/.test(tokens[j])) { + tokens = tokens.slice(0, i).concat(tokens.slice(i, j + 1).join('')).concat(tokens.slice(j + 1)); + break; + } + } + } + } + + var schema = { + syntax: 3, + "package": null, + imports: [], + enums: [], + messages: [], + options: {}, + "extends": [] + }; + var firstline = true; + + while (tokens.length) { + switch (tokens[0]) { + case 'package': + schema["package"] = onpackagename(tokens); + break; + + case 'syntax': + if (!firstline) throw new Error('Protobuf syntax version should be first thing in file'); + schema.syntax = onsyntaxversion(tokens); + break; + + case 'message': + schema.messages.push(onmessage(tokens)); + break; + + case 'enum': + schema.enums.push(onenum(tokens)); + break; + + case 'option': + var opt = onoption(tokens); + if (schema.options[opt.name]) throw new Error('Duplicate option ' + opt.name); + schema.options[opt.name] = opt.value; + break; + + case 'import': + schema.imports.push(onimport(tokens)); + break; + + case 'extend': + schema["extends"].push(onextend(tokens)); + break; + + case 'service': + if (!schema.services) schema.services = []; + schema.services.push(onservice(tokens)); + break; + + default: + throw new Error('Unexpected token: ' + tokens[0]); + } + + firstline = false; + } // now iterate over messages and propagate extends + + + schema["extends"].forEach(function (ext) { + schema.messages.forEach(function (msg) { + if (msg.name === ext.name) { + ext.message.fields.forEach(function (field) { + if (!msg.extensions || field.tag < msg.extensions.from || field.tag > msg.extensions.to) { + throw new Error(msg.name + ' does not declare ' + field.tag + ' as an extension number'); + } + + msg.fields.push(field); + }); + } + }); + }); + schema.messages.forEach(function (msg) { + msg.fields.forEach(function (field) { + var fieldSplit; + var messageName; + var nestedEnumName; + var message; + + function enumNameIsFieldType(en) { + return en.name === field.type; + } + + function enumNameIsNestedEnumName(en) { + return en.name === nestedEnumName; + } + + if (field.options && field.options.packed === 'true') { + if (PACKABLE_TYPES.indexOf(field.type) === -1) { + // let's see if it's an enum + if (field.type.indexOf('.') === -1) { + if (msg.enums && msg.enums.some(enumNameIsFieldType)) { + return; + } + } else { + fieldSplit = field.type.split('.'); + + if (fieldSplit.length > 2) { + throw new Error('what is this?'); + } + + messageName = fieldSplit[0]; + nestedEnumName = fieldSplit[1]; + schema.messages.some(function (msg) { + if (msg.name === messageName) { + message = msg; + return msg; + } + }); + + if (message && message.enums && message.enums.some(enumNameIsNestedEnumName)) { + return; + } + } + + throw new Error('Fields of type ' + field.type + ' cannot be declared [packed=true]. ' + 'Only repeated fields of primitive numeric types (types which use ' + 'the varint, 32-bit, or 64-bit wire types) can be declared "packed". ' + 'See https://developers.google.com/protocol-buffers/docs/encoding#optional'); + } + } + }); + }); + return schema; +}; + +module.exports = parse; + +/***/ }), +/* 219 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +module.exports = function (sch) { + var noComments = function noComments(line) { + var i = line.indexOf('//'); + return i > -1 ? line.slice(0, i) : line; + }; + + var noMultilineComments = function noMultilineComments() { + var inside = false; + return function (token) { + if (token === '/*') { + inside = true; + return false; + } + + if (token === '*/') { + inside = false; + return false; + } + + return !inside; + }; + }; + + var trim = function trim(line) { + return line.trim(); + }; + + return sch.replace(/([;,{}()=:[\]<>]|\/\*|\*\/)/g, ' $1 ').split(/\n/).map(trim).filter(Boolean).map(noComments).map(trim).filter(Boolean).join('\n').split(/\s+|\n+/gm).filter(noMultilineComments()); +}; + +/***/ }), +/* 220 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } + +var onfield = function onfield(f, result) { + var prefix = f.repeated ? 'repeated' : f.required ? 'required' : 'optional'; + if (f.type === 'map') prefix = 'map<' + f.map.from + ',' + f.map.to + '>'; + if (f.oneof) prefix = ''; + var opts = Object.keys(f.options || {}).map(function (key) { + return key + ' = ' + f.options[key]; + }).join(','); + if (opts) opts = ' [' + opts + ']'; + result.push((prefix ? prefix + ' ' : '') + (f.map === 'map' ? '' : f.type + ' ') + f.name + ' = ' + f.tag + opts + ';'); + return result; +}; + +var onmessage = function onmessage(m, result) { + result.push('message ' + m.name + ' {'); + if (!m.enums) m.enums = []; + m.enums.forEach(function (e) { + result.push(onenum(e, [])); + }); + if (!m.messages) m.messages = []; + m.messages.forEach(function (m) { + result.push(onmessage(m, [])); + }); + var oneofs = {}; + if (!m.fields) m.fields = []; + m.fields.forEach(function (f) { + if (f.oneof) { + if (!oneofs[f.oneof]) oneofs[f.oneof] = []; + oneofs[f.oneof].push(onfield(f, [])); + } else { + result.push(onfield(f, [])); + } + }); + Object.keys(oneofs).forEach(function (n) { + oneofs[n].unshift('oneof ' + n + ' {'); + oneofs[n].push('}'); + result.push(oneofs[n]); + }); + result.push('}', ''); + return result; +}; + +var onenum = function onenum(e, result) { + result.push('enum ' + e.name + ' {'); + if (!e.options) e.options = {}; + var options = onoption(e.options, []); + + if (options.length > 1) { + result.push(options.slice(0, -1)); + } + + Object.keys(e.values).map(function (v) { + var val = onenumvalue(e.values[v]); + result.push([v + ' = ' + val + ';']); + }); + result.push('}', ''); + return result; +}; + +var onenumvalue = function onenumvalue(v, result) { + var opts = Object.keys(v.options || {}).map(function (key) { + return key + ' = ' + v.options[key]; + }).join(','); + if (opts) opts = ' [' + opts + ']'; + var val = v.value + opts; + return val; +}; + +var onoption = function onoption(o, result) { + var keys = Object.keys(o); + keys.forEach(function (option) { + var v = o[option]; + if (~option.indexOf('.')) option = '(' + option + ')'; + + var type = _typeof(v); + + if (type === 'object') { + v = onoptionMap(v, []); + if (v.length) result.push('option ' + option + ' = {', v, '};'); + } else { + if (type === 'string' && option !== 'optimize_for') v = '"' + v + '"'; + result.push('option ' + option + ' = ' + v + ';'); + } + }); + + if (keys.length > 0) { + result.push(''); + } + + return result; +}; + +var onoptionMap = function onoptionMap(o, result) { + var keys = Object.keys(o); + keys.forEach(function (k) { + var v = o[k]; + + var type = _typeof(v); + + if (type === 'object') { + if (Array.isArray(v)) { + v.forEach(function (v) { + v = onoptionMap(v, []); + if (v.length) result.push(k + ' {', v, '}'); + }); + } else { + v = onoptionMap(v, []); + if (v.length) result.push(k + ' {', v, '}'); + } + } else { + if (type === 'string') v = '"' + v + '"'; + result.push(k + ': ' + v); + } + }); + return result; +}; + +var onservices = function onservices(s, result) { + result.push('service ' + s.name + ' {'); + if (!s.options) s.options = {}; + onoption(s.options, result); + if (!s.methods) s.methods = []; + s.methods.forEach(function (m) { + result.push(onrpc(m, [])); + }); + result.push('}', ''); + return result; +}; + +var onrpc = function onrpc(rpc, result) { + var def = 'rpc ' + rpc.name + '('; + if (rpc.client_streaming) def += 'stream '; + def += rpc.input_type + ') returns ('; + if (rpc.server_streaming) def += 'stream '; + def += rpc.output_type + ')'; + if (!rpc.options) rpc.options = {}; + var options = onoption(rpc.options, []); + + if (options.length > 1) { + result.push(def + ' {', options.slice(0, -1), '}'); + } else { + result.push(def + ';'); + } + + return result; +}; + +var indent = function indent(lvl) { + return function (line) { + if (Array.isArray(line)) return line.map(indent(lvl + ' ')).join('\n'); + return lvl + line; + }; +}; + +module.exports = function (schema) { + var result = []; + result.push('syntax = "proto' + schema.syntax + '";', ''); + if (schema["package"]) result.push('package ' + schema["package"] + ';', ''); + if (!schema.options) schema.options = {}; + onoption(schema.options, result); + if (!schema.enums) schema.enums = []; + schema.enums.forEach(function (e) { + onenum(e, result); + }); + if (!schema.messages) schema.messages = []; + schema.messages.forEach(function (m) { + onmessage(m, result); + }); + + if (schema.services) { + schema.services.forEach(function (s) { + onservices(s, result); + }); + } + + return result.map(indent('')).join('\n'); +}; + +/***/ }), +/* 221 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var encodings = __webpack_require__(222); + +var compileDecode = __webpack_require__(224); + +var compileEncode = __webpack_require__(225); + +var compileEncodingLength = __webpack_require__(226); + +var varint = __webpack_require__(12); + +var flatten = function flatten(values) { + if (!values) return null; + var result = {}; + Object.keys(values).forEach(function (k) { + result[k] = values[k].value; + }); + return result; +}; + +module.exports = function (schema, extraEncodings) { + var messages = {}; + var enums = {}; + var cache = {}; + + var visit = function visit(schema, prefix) { + if (schema.enums) { + schema.enums.forEach(function (e) { + e.id = prefix + (prefix ? '.' : '') + e.name; + enums[e.id] = e; + visit(e, e.id); + }); + } + + if (schema.messages) { + schema.messages.forEach(function (m) { + m.id = prefix + (prefix ? '.' : '') + m.name; + messages[m.id] = m; + m.fields.forEach(function (f) { + if (!f.map) return; + var name = 'Map_' + f.map.from + '_' + f.map.to; + var map = { + name: name, + enums: [], + messages: [], + fields: [{ + name: 'key', + type: f.map.from, + tag: 1, + repeated: false, + required: true + }, { + name: 'value', + type: f.map.to, + tag: 2, + repeated: false, + required: false + }], + extensions: null, + id: prefix + (prefix ? '.' : '') + name + }; + + if (!messages[map.id]) { + messages[map.id] = map; + schema.messages.push(map); + } + + f.type = name; + f.repeated = true; + }); + visit(m, m.id); + }); + } + }; + + visit(schema, ''); + + var compileEnum = function compileEnum(e) { + var values = Object.keys(e.values || []).map(function (k) { + return parseInt(e.values[k].value, 10); + }); + + var encode = function encode(val, buf, offset) { + if (!values.length || values.indexOf(val) === -1) { + throw new Error('Invalid enum value: ' + val); + } + + varint.encode(val, buf, offset); + encode.bytes = varint.encode.bytes; + return buf; + }; + + var decode = function decode(buf, offset) { + var val = varint.decode(buf, offset); + + if (!values.length || values.indexOf(val) === -1) { + throw new Error('Invalid enum value: ' + val); + } + + decode.bytes = varint.decode.bytes; + return val; + }; + + return encodings.make(0, encode, decode, varint.encodingLength); + }; + + var compileMessage = function compileMessage(m, exports) { + m.messages.forEach(function (nested) { + exports[nested.name] = resolve(nested.name, m.id); + }); + m.enums.forEach(function (val) { + exports[val.name] = flatten(val.values); + }); + exports.type = 2; + exports.message = true; + exports.name = m.name; + var oneofs = {}; + m.fields.forEach(function (f) { + if (!f.oneof) return; + if (!oneofs[f.oneof]) oneofs[f.oneof] = []; + oneofs[f.oneof].push(f.name); + }); + var enc = m.fields.map(function (f) { + return resolve(f.type, m.id); + }); + var encodingLength = compileEncodingLength(m, enc, oneofs); + var encode = compileEncode(m, resolve, enc, oneofs, encodingLength); + var decode = compileDecode(m, resolve, enc); // end of compilation - return all the things + + encode.bytes = decode.bytes = 0; + exports.buffer = true; + exports.encode = encode; + exports.decode = decode; + exports.encodingLength = encodingLength; + return exports; + }; + + var resolve = function resolve(name, from, compile) { + if (extraEncodings && extraEncodings[name]) return extraEncodings[name]; + if (encodings[name]) return encodings[name]; + var m = (from ? from + '.' + name : name).split('.').map(function (part, i, list) { + return list.slice(0, i).concat(name).join('.'); + }).reverse().reduce(function (result, id) { + return result || messages[id] || enums[id]; + }, null); + if (compile === false) return m; + if (!m) throw new Error('Could not resolve ' + name); + if (m.values) return compileEnum(m); + var res = cache[m.id] || compileMessage(m, cache[m.id] = {}); + return res; + }; + + return (schema.enums || []).concat((schema.messages || []).map(function (message) { + return resolve(message.id); + })); +}; + +/***/ }), +/* 222 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var varint = __webpack_require__(12); + +var svarint = __webpack_require__(223); + +var Buffer = __webpack_require__(7).Buffer; + +var encoder = function encoder(type, encode, decode, encodingLength) { + encode.bytes = decode.bytes = 0; + return { + type: type, + encode: encode, + decode: decode, + encodingLength: encodingLength + }; +}; + +exports.make = encoder; + +exports.bytes = function (tag) { + var bufferLength = function bufferLength(val) { + return Buffer.isBuffer(val) ? val.length : Buffer.byteLength(val); + }; + + var encodingLength = function encodingLength(val) { + var len = bufferLength(val); + return varint.encodingLength(len) + len; + }; + + var encode = function encode(val, buffer, offset) { + var oldOffset = offset; + var len = bufferLength(val); + varint.encode(len, buffer, offset); + offset += varint.encode.bytes; + if (Buffer.isBuffer(val)) val.copy(buffer, offset);else buffer.write(val, offset, len); + offset += len; + encode.bytes = offset - oldOffset; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var oldOffset = offset; + var len = varint.decode(buffer, offset); + offset += varint.decode.bytes; + var val = buffer.slice(offset, offset + len); + offset += val.length; + decode.bytes = offset - oldOffset; + return val; + }; + + return encoder(2, encode, decode, encodingLength); +}(); + +exports.string = function () { + var encodingLength = function encodingLength(val) { + var len = Buffer.byteLength(val); + return varint.encodingLength(len) + len; + }; + + var encode = function encode(val, buffer, offset) { + var oldOffset = offset; + var len = Buffer.byteLength(val); + varint.encode(len, buffer, offset, 'utf-8'); + offset += varint.encode.bytes; + buffer.write(val, offset, len); + offset += len; + encode.bytes = offset - oldOffset; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var oldOffset = offset; + var len = varint.decode(buffer, offset); + offset += varint.decode.bytes; + var val = buffer.toString('utf-8', offset, offset + len); + offset += len; + decode.bytes = offset - oldOffset; + return val; + }; + + return encoder(2, encode, decode, encodingLength); +}(); + +exports.bool = function () { + var encodingLength = function encodingLength(val) { + return 1; + }; + + var encode = function encode(val, buffer, offset) { + buffer[offset] = val ? 1 : 0; + encode.bytes = 1; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var bool = buffer[offset] > 0; + decode.bytes = 1; + return bool; + }; + + return encoder(0, encode, decode, encodingLength); +}(); + +exports.int32 = function () { + var decode = function decode(buffer, offset) { + var val = varint.decode(buffer, offset); + decode.bytes = varint.decode.bytes; + return val > 2147483647 ? val - 4294967296 : val; + }; + + var encode = function encode(val, buffer, offset) { + varint.encode(val < 0 ? val + 4294967296 : val, buffer, offset); + encode.bytes = varint.encode.bytes; + return buffer; + }; + + var encodingLength = function encodingLength(val) { + return varint.encodingLength(val < 0 ? val + 4294967296 : val); + }; + + return encoder(0, varint.encode, decode, encodingLength); +}(); + +exports.int64 = function () { + var decode = function decode(buffer, offset) { + var val = varint.decode(buffer, offset); + + if (val >= Math.pow(2, 63)) { + var limit = 9; + + while (buffer[offset + limit - 1] === 0xff) { + limit--; + } + + limit = limit || 9; + var subset = Buffer.allocUnsafe(limit); + buffer.copy(subset, 0, offset, offset + limit); + subset[limit - 1] = subset[limit - 1] & 0x7f; + val = -1 * varint.decode(subset, 0); + decode.bytes = 10; + } else { + decode.bytes = varint.decode.bytes; + } + + return val; + }; + + var encode = function encode(val, buffer, offset) { + if (val < 0) { + var last = offset + 9; + varint.encode(val * -1, buffer, offset); + offset += varint.encode.bytes - 1; + buffer[offset] = buffer[offset] | 0x80; + + while (offset < last - 1) { + offset++; + buffer[offset] = 0xff; + } + + buffer[last] = 0x01; + encode.bytes = 10; + } else { + varint.encode(val, buffer, offset); + encode.bytes = varint.encode.bytes; + } + + return buffer; + }; + + var encodingLength = function encodingLength(val) { + return val < 0 ? 10 : varint.encodingLength(val); + }; + + return encoder(0, encode, decode, encodingLength); +}(); + +exports.sint32 = exports.sint64 = function () { + return encoder(0, svarint.encode, svarint.decode, svarint.encodingLength); +}(); + +exports.uint32 = exports.uint64 = exports["enum"] = exports.varint = function () { + return encoder(0, varint.encode, varint.decode, varint.encodingLength); +}(); // we cannot represent these in javascript so we just use buffers + + +exports.fixed64 = exports.sfixed64 = function () { + var encodingLength = function encodingLength(val) { + return 8; + }; + + var encode = function encode(val, buffer, offset) { + val.copy(buffer, offset); + encode.bytes = 8; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var val = buffer.slice(offset, offset + 8); + decode.bytes = 8; + return val; + }; + + return encoder(1, encode, decode, encodingLength); +}(); + +exports["double"] = function () { + var encodingLength = function encodingLength(val) { + return 8; + }; + + var encode = function encode(val, buffer, offset) { + buffer.writeDoubleLE(val, offset); + encode.bytes = 8; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var val = buffer.readDoubleLE(offset); + decode.bytes = 8; + return val; + }; + + return encoder(1, encode, decode, encodingLength); +}(); + +exports.fixed32 = function () { + var encodingLength = function encodingLength(val) { + return 4; + }; + + var encode = function encode(val, buffer, offset) { + buffer.writeUInt32LE(val, offset); + encode.bytes = 4; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var val = buffer.readUInt32LE(offset); + decode.bytes = 4; + return val; + }; + + return encoder(5, encode, decode, encodingLength); +}(); + +exports.sfixed32 = function () { + var encodingLength = function encodingLength(val) { + return 4; + }; + + var encode = function encode(val, buffer, offset) { + buffer.writeInt32LE(val, offset); + encode.bytes = 4; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var val = buffer.readInt32LE(offset); + decode.bytes = 4; + return val; + }; + + return encoder(5, encode, decode, encodingLength); +}(); + +exports["float"] = function () { + var encodingLength = function encodingLength(val) { + return 4; + }; + + var encode = function encode(val, buffer, offset) { + buffer.writeFloatLE(val, offset); + encode.bytes = 4; + return buffer; + }; + + var decode = function decode(buffer, offset) { + var val = buffer.readFloatLE(offset); + decode.bytes = 4; + return val; + }; + + return encoder(5, encode, decode, encodingLength); +}(); + +/***/ }), +/* 223 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var varint = __webpack_require__(12); + +exports.encode = function encode(v, b, o) { + v = v >= 0 ? v * 2 : v * -2 - 1; + var r = varint.encode(v, b, o); + encode.bytes = varint.encode.bytes; + return r; +}; + +exports.decode = function decode(b, o) { + var v = varint.decode(b, o); + decode.bytes = varint.decode.bytes; + return v & 1 ? (v + 1) / -2 : v / 2; +}; + +exports.encodingLength = function (v) { + return varint.encodingLength(v >= 0 ? v * 2 : v * -2 - 1); +}; + +/***/ }), +/* 224 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* eslint max-depth: 1 */ + + +var varint = __webpack_require__(12); + +var defined = __webpack_require__(69).defined; + +function compileDecode(m, resolve, enc) { + var requiredFields = []; + var fields = {}; + var oneofFields = []; + var vals = []; + + for (var i = 0; i < enc.length; i++) { + var field = m.fields[i]; + fields[field.tag] = i; + var def = field.options && field.options["default"]; + var resolved = resolve(field.type, m.id, false); + vals[i] = [def, resolved && resolved.values]; + m.fields[i].packed = field.repeated && field.options && field.options.packed && field.options.packed !== 'false'; + + if (field.required) { + requiredFields.push(field.name); + } + + if (field.oneof) { + oneofFields.push(field.name); + } + } + + function decodeField(e, field, obj, buf, offset, i) { + var name = field.name; + + if (field.oneof) { + // clear already defined oneof fields + var props = Object.keys(obj); + + for (var j = 0; j < props.length; j++) { + if (oneofFields.indexOf(props[j]) > -1) { + delete obj[props[j]]; + } + } + } + + if (e.message) { + var len = varint.decode(buf, offset); + offset += varint.decode.bytes; + var decoded = e.decode(buf, offset, offset + len); + + if (field.map) { + obj[name] = obj[name] || {}; + obj[name][decoded.key] = decoded.value; + } else if (field.repeated) { + obj[name] = obj[name] || []; + obj[name].push(decoded); + } else { + obj[name] = decoded; + } + } else { + if (field.repeated) { + obj[name] = obj[name] || []; + obj[name].push(e.decode(buf, offset)); + } else { + obj[name] = e.decode(buf, offset); + } + } + + offset += e.decode.bytes; + return offset; + } + + return function decode(buf, offset, end) { + if (offset == null) { + offset = 0; + } + + if (end == null) { + end = buf.length; + } + + if (!(end <= buf.length && offset <= buf.length)) { + throw new Error('Decoded message is not valid'); + } + + var oldOffset = offset; + var obj = {}; + var field; + + while (true) { + if (end <= offset) { + // finished + // check required methods + var name = ''; + var j = 0; + + for (j = 0; j < requiredFields.length; j++) { + name = requiredFields[j]; + + if (!defined(obj[name])) { + throw new Error('Decoded message is not valid, missing required field: ' + name); + } + } // fill out missing defaults + + + var val; + var def; + + for (j = 0; j < enc.length; j++) { + field = m.fields[j]; + def = vals[j][0]; + val = vals[j][1]; + name = field.name; + + if (defined(obj[name])) { + continue; + } + + var done = false; + + if (field.oneof) { + var props = Object.keys(obj); + + for (var k = 0; k < props.length; k++) { + if (oneofFields.indexOf(props[k]) > -1) { + done = true; + break; + } + } + } + + if (done) { + continue; + } + + if (val) { + // is enum + if (field.repeated) { + obj[name] = []; + } else { + def = def && val[def] ? val[def].value : val[Object.keys(val)[0]].value; + obj[name] = parseInt(def || 0, 10); + } + } else { + obj[name] = defaultValue(field, def); + } + } + + decode.bytes = offset - oldOffset; + return obj; + } + + var prefix = varint.decode(buf, offset); + offset += varint.decode.bytes; + var tag = prefix >> 3; + var i = fields[tag]; + + if (i == null) { + offset = skip(prefix & 7, buf, offset); + continue; + } + + var e = enc[i]; + field = m.fields[i]; + + if (field.packed) { + var packedEnd = varint.decode(buf, offset); + offset += varint.decode.bytes; + packedEnd += offset; + + while (offset < packedEnd) { + offset = decodeField(e, field, obj, buf, offset, i); + } + } else { + offset = decodeField(e, field, obj, buf, offset, i); + } + } + }; +} + +var skip = function skip(type, buffer, offset) { + switch (type) { + case 0: + varint.decode(buffer, offset); + return offset + varint.decode.bytes; + + case 1: + return offset + 8; + + case 2: + var len = varint.decode(buffer, offset); + return offset + varint.decode.bytes + len; + + case 3: + case 4: + throw new Error('Groups are not supported'); + + case 5: + return offset + 4; + + default: + throw new Error('Unknown wire type: ' + type); + } +}; + +var defaultValue = function defaultValue(f, def) { + if (f.map) return {}; + if (f.repeated) return []; + + switch (f.type) { + case 'string': + return def != null ? def : ''; + + case 'bool': + return def === 'true'; + + case 'float': + case 'double': + case 'sfixed32': + case 'fixed32': + case 'varint': + case 'enum': + case 'uint64': + case 'uint32': + case 'int64': + case 'int32': + case 'sint64': + case 'sint32': + return parseInt(def || 0, 10); + + default: + return null; + } +}; + +module.exports = compileDecode; + +/***/ }), +/* 225 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(Buffer) { + +var defined = __webpack_require__(69).defined; + +var varint = __webpack_require__(12); + +function compileEncode(m, resolve, enc, oneofs, encodingLength) { + var oneofsKeys = Object.keys(oneofs); + var encLength = enc.length; + var ints = {}; + + for (var i = 0; i < encLength; i++) { + ints[i] = { + p: varint.encode(m.fields[i].tag << 3 | 2), + h: varint.encode(m.fields[i].tag << 3 | enc[i].type) + }; + var field = m.fields[i]; + m.fields[i].packed = field.repeated && field.options && field.options.packed && field.options.packed !== 'false'; + } + + function encodeField(buf, offset, h, e, packed, innerVal) { + var j = 0; + + if (!packed) { + for (j = 0; j < h.length; j++) { + buf[offset++] = h[j]; + } + } + + if (e.message) { + varint.encode(e.encodingLength(innerVal), buf, offset); + offset += varint.encode.bytes; + } + + e.encode(innerVal, buf, offset); + return offset + e.encode.bytes; + } + + return function encode(obj, buf, offset) { + if (offset == null) { + offset = 0; + } + + if (buf == null) { + buf = Buffer.allocUnsafe(encodingLength(obj)); + } + + var oldOffset = offset; + var objKeys = Object.keys(obj); + var i = 0; // oneof checks + + var match = false; + + for (i = 0; i < oneofsKeys.length; i++) { + var name = oneofsKeys[i]; + var prop = oneofs[i]; + + if (objKeys.indexOf(prop) > -1) { + if (match) { + throw new Error('only one of the properties defined in oneof ' + name + ' can be set'); + } + + match = true; + } + } + + for (i = 0; i < encLength; i++) { + var e = enc[i]; + var field = m.fields[i]; // was f + + var val = obj[field.name]; + var j = 0; + + if (!defined(val)) { + if (field.required) { + throw new Error(field.name + ' is required'); + } + + continue; + } + + var p = ints[i].p; + var h = ints[i].h; + var packed = field.packed; + + if (field.map) { + var tmp = Object.keys(val); + + for (j = 0; j < tmp.length; j++) { + tmp[j] = { + key: tmp[j], + value: val[tmp[j]] + }; + } + + val = tmp; + } + + if (packed) { + var packedLen = 0; + + for (j = 0; j < val.length; j++) { + if (!defined(val[j])) { + continue; + } + + packedLen += e.encodingLength(val[j]); + } + + if (packedLen) { + for (j = 0; j < h.length; j++) { + buf[offset++] = p[j]; + } + + varint.encode(packedLen, buf, offset); + offset += varint.encode.bytes; + } + } + + if (field.repeated) { + var innerVal; + + for (j = 0; j < val.length; j++) { + innerVal = val[j]; + + if (!defined(innerVal)) { + continue; + } + + offset = encodeField(buf, offset, h, e, packed, innerVal); + } + } else { + offset = encodeField(buf, offset, h, e, packed, val); + } + } + + encode.bytes = offset - oldOffset; + return buf; + }; +} + +module.exports = compileEncode; +/* WEBPACK VAR INJECTION */}.call(this, __webpack_require__(0).Buffer)) + +/***/ }), +/* 226 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; + + +var defined = __webpack_require__(69).defined; + +var varint = __webpack_require__(12); + +function compileEncodingLength(m, enc, oneofs) { + var oneofsKeys = Object.keys(oneofs); + var encLength = enc.length; + var hls = new Array(encLength); + + for (var i = 0; i < m.fields.length; i++) { + hls[i] = varint.encodingLength(m.fields[i].tag << 3 | enc[i].type); + var field = m.fields[i]; + m.fields[i].packed = field.repeated && field.options && field.options.packed && field.options.packed !== 'false'; + } + + return function encodingLength(obj) { + var length = 0; + var i = 0; + var j = 0; + + for (i = 0; i < oneofsKeys.length; i++) { + var name = oneofsKeys[i]; + var props = oneofs[name]; + var match = false; + + for (j = 0; j < props.length; j++) { + if (defined(obj[props[j]])) { + if (match) { + throw new Error('only one of the properties defined in oneof ' + name + ' can be set'); + } + + match = true; + } + } + } + + for (i = 0; i < encLength; i++) { + var e = enc[i]; + var field = m.fields[i]; + var val = obj[field.name]; + var hl = hls[i]; + var len; + + if (!defined(val)) { + if (field.required) { + throw new Error(field.name + ' is required'); + } + + continue; + } + + if (field.map) { + var tmp = Object.keys(val); + + for (j = 0; j < tmp.length; j++) { + tmp[j] = { + key: tmp[j], + value: val[tmp[j]] + }; + } + + val = tmp; + } + + if (field.packed) { + var packedLen = 0; + + for (j = 0; j < val.length; j++) { + if (!defined(val[j])) { + continue; + } + + len = e.encodingLength(val[j]); + packedLen += len; + + if (e.message) { + packedLen += varint.encodingLength(len); + } + } + + if (packedLen) { + length += hl + packedLen + varint.encodingLength(packedLen); + } + } else if (field.repeated) { + for (j = 0; j < val.length; j++) { + if (!defined(val[j])) { + continue; + } + + len = e.encodingLength(val[j]); + length += hl + len + (e.message ? varint.encodingLength(len) : 0); + } + } else { + len = e.encodingLength(val); + length += hl + len + (e.message ? varint.encodingLength(len) : 0); + } + } + + return length; + }; +} + +module.exports = compileEncodingLength; + +/***/ }), +/* 227 */ +/***/ (function(module, exports, __webpack_require__) { + +"use strict"; +/* WEBPACK VAR INJECTION */(function(global, process) { + +(function (global, undefined) { + "use strict"; + + if (global.setImmediate) { + return; + } + + var nextHandle = 1; // Spec says greater than zero + + var tasksByHandle = {}; + var currentlyRunningATask = false; + var doc = global.document; + var registerImmediate; + + function setImmediate(callback) { + // Callback can either be a function or a string + if (typeof callback !== "function") { + callback = new Function("" + callback); + } // Copy function arguments + + + var args = new Array(arguments.length - 1); + + for (var i = 0; i < args.length; i++) { + args[i] = arguments[i + 1]; + } // Store and register the task + + + var task = { + callback: callback, + args: args + }; + tasksByHandle[nextHandle] = task; + registerImmediate(nextHandle); + return nextHandle++; + } + + function clearImmediate(handle) { + delete tasksByHandle[handle]; + } + + function run(task) { + var callback = task.callback; + var args = task.args; + + switch (args.length) { + case 0: + callback(); + break; + + case 1: + callback(args[0]); + break; + + case 2: + callback(args[0], args[1]); + break; + + case 3: + callback(args[0], args[1], args[2]); + break; + + default: + callback.apply(undefined, args); + break; + } + } + + function runIfPresent(handle) { + // From the spec: "Wait until any invocations of this algorithm started before this one have completed." + // So if we're currently running a task, we'll need to delay this invocation. + if (currentlyRunningATask) { + // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a + // "too much recursion" error. + setTimeout(runIfPresent, 0, handle); + } else { + var task = tasksByHandle[handle]; + + if (task) { + currentlyRunningATask = true; + + try { + run(task); + } finally { + clearImmediate(handle); + currentlyRunningATask = false; + } + } + } + } + + function installNextTickImplementation() { + registerImmediate = function registerImmediate(handle) { + process.nextTick(function () { + runIfPresent(handle); + }); + }; + } + + function canUsePostMessage() { + // The test against `importScripts` prevents this implementation from being installed inside a web worker, + // where `global.postMessage` means something completely different and can't be used for this purpose. + if (global.postMessage && !global.importScripts) { + var postMessageIsAsynchronous = true; + var oldOnMessage = global.onmessage; + + global.onmessage = function () { + postMessageIsAsynchronous = false; + }; + + global.postMessage("", "*"); + global.onmessage = oldOnMessage; + return postMessageIsAsynchronous; + } + } + + function installPostMessageImplementation() { + // Installs an event handler on `global` for the `message` event: see + // * https://developer.mozilla.org/en/DOM/window.postMessage + // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages + var messagePrefix = "setImmediate$" + Math.random() + "$"; + + var onGlobalMessage = function onGlobalMessage(event) { + if (event.source === global && typeof event.data === "string" && event.data.indexOf(messagePrefix) === 0) { + runIfPresent(+event.data.slice(messagePrefix.length)); + } + }; + + if (global.addEventListener) { + global.addEventListener("message", onGlobalMessage, false); + } else { + global.attachEvent("onmessage", onGlobalMessage); + } + + registerImmediate = function registerImmediate(handle) { + global.postMessage(messagePrefix + handle, "*"); + }; + } + + function installMessageChannelImplementation() { + var channel = new MessageChannel(); + + channel.port1.onmessage = function (event) { + var handle = event.data; + runIfPresent(handle); + }; + + registerImmediate = function registerImmediate(handle) { + channel.port2.postMessage(handle); + }; + } + + function installReadyStateChangeImplementation() { + var html = doc.documentElement; + + registerImmediate = function registerImmediate(handle) { + // Create a