údržba
This commit is contained in:
		
							
								
								
									
										21
									
								
								CyLukTs/lukan/node_modules/base64-js/LICENSE
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										21
									
								
								CyLukTs/lukan/node_modules/base64-js/LICENSE
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@@ -0,0 +1,21 @@
 | 
			
		||||
The MIT License (MIT)
 | 
			
		||||
 | 
			
		||||
Copyright (c) 2014 Jameson Little
 | 
			
		||||
 | 
			
		||||
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.
 | 
			
		||||
							
								
								
									
										34
									
								
								CyLukTs/lukan/node_modules/base64-js/README.md
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										34
									
								
								CyLukTs/lukan/node_modules/base64-js/README.md
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@@ -0,0 +1,34 @@
 | 
			
		||||
base64-js
 | 
			
		||||
=========
 | 
			
		||||
 | 
			
		||||
`base64-js` does basic base64 encoding/decoding in pure JS.
 | 
			
		||||
 | 
			
		||||
[](http://travis-ci.org/beatgammit/base64-js)
 | 
			
		||||
 | 
			
		||||
Many browsers already have base64 encoding/decoding functionality, but it is for text data, not all-purpose binary data.
 | 
			
		||||
 | 
			
		||||
Sometimes encoding/decoding binary data in the browser is useful, and that is what this module does.
 | 
			
		||||
 | 
			
		||||
## install
 | 
			
		||||
 | 
			
		||||
With [npm](https://npmjs.org) do:
 | 
			
		||||
 | 
			
		||||
`npm install base64-js` and `var base64js = require('base64-js')`
 | 
			
		||||
 | 
			
		||||
For use in web browsers do:
 | 
			
		||||
 | 
			
		||||
`<script src="base64js.min.js"></script>`
 | 
			
		||||
 | 
			
		||||
[Get supported base64-js with the Tidelift Subscription](https://tidelift.com/subscription/pkg/npm-base64-js?utm_source=npm-base64-js&utm_medium=referral&utm_campaign=readme)
 | 
			
		||||
 | 
			
		||||
## methods
 | 
			
		||||
 | 
			
		||||
`base64js` has three exposed functions, `byteLength`, `toByteArray` and `fromByteArray`, which both take a single argument.
 | 
			
		||||
 | 
			
		||||
* `byteLength` - Takes a base64 string and returns length of byte array
 | 
			
		||||
* `toByteArray` - Takes a base64 string and returns a byte array
 | 
			
		||||
* `fromByteArray` - Takes a byte array and returns a base64 string
 | 
			
		||||
 | 
			
		||||
## license
 | 
			
		||||
 | 
			
		||||
MIT
 | 
			
		||||
							
								
								
									
										1
									
								
								CyLukTs/lukan/node_modules/base64-js/base64js.min.js
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										1
									
								
								CyLukTs/lukan/node_modules/base64-js/base64js.min.js
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@@ -0,0 +1 @@
 | 
			
		||||
(function(a){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=a();else if("function"==typeof define&&define.amd)define([],a);else{var b;b="undefined"==typeof window?"undefined"==typeof global?"undefined"==typeof self?this:self:global:window,b.base64js=a()}})(function(){return function(){function b(d,e,g){function a(j,i){if(!e[j]){if(!d[j]){var f="function"==typeof require&&require;if(!i&&f)return f(j,!0);if(h)return h(j,!0);var c=new Error("Cannot find module '"+j+"'");throw c.code="MODULE_NOT_FOUND",c}var k=e[j]={exports:{}};d[j][0].call(k.exports,function(b){var c=d[j][1][b];return a(c||b)},k,k.exports,b,d,e,g)}return e[j].exports}for(var h="function"==typeof require&&require,c=0;c<g.length;c++)a(g[c]);return a}return b}()({"/":[function(a,b,c){'use strict';function d(a){var b=a.length;if(0<b%4)throw new Error("Invalid string. Length must be a multiple of 4");var c=a.indexOf("=");-1===c&&(c=b);var d=c===b?0:4-c%4;return[c,d]}function e(a,b,c){return 3*(b+c)/4-c}function f(a){var b,c,f=d(a),g=f[0],h=f[1],j=new m(e(a,g,h)),k=0,n=0<h?g-4:g;for(c=0;c<n;c+=4)b=l[a.charCodeAt(c)]<<18|l[a.charCodeAt(c+1)]<<12|l[a.charCodeAt(c+2)]<<6|l[a.charCodeAt(c+3)],j[k++]=255&b>>16,j[k++]=255&b>>8,j[k++]=255&b;return 2===h&&(b=l[a.charCodeAt(c)]<<2|l[a.charCodeAt(c+1)]>>4,j[k++]=255&b),1===h&&(b=l[a.charCodeAt(c)]<<10|l[a.charCodeAt(c+1)]<<4|l[a.charCodeAt(c+2)]>>2,j[k++]=255&b>>8,j[k++]=255&b),j}function g(a){return k[63&a>>18]+k[63&a>>12]+k[63&a>>6]+k[63&a]}function h(a,b,c){for(var d,e=[],f=b;f<c;f+=3)d=(16711680&a[f]<<16)+(65280&a[f+1]<<8)+(255&a[f+2]),e.push(g(d));return e.join("")}function j(a){for(var b,c=a.length,d=c%3,e=[],f=16383,g=0,j=c-d;g<j;g+=f)e.push(h(a,g,g+f>j?j:g+f));return 1===d?(b=a[c-1],e.push(k[b>>2]+k[63&b<<4]+"==")):2===d&&(b=(a[c-2]<<8)+a[c-1],e.push(k[b>>10]+k[63&b>>4]+k[63&b<<2]+"=")),e.join("")}c.byteLength=function(a){var b=d(a),c=b[0],e=b[1];return 3*(c+e)/4-e},c.toByteArray=f,c.fromByteArray=j;for(var k=[],l=[],m="undefined"==typeof Uint8Array?Array:Uint8Array,n="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",o=0,p=n.length;o<p;++o)k[o]=n[o],l[n.charCodeAt(o)]=o;l[45]=62,l[95]=63},{}]},{},[])("/")});
 | 
			
		||||
							
								
								
									
										3
									
								
								CyLukTs/lukan/node_modules/base64-js/index.d.ts
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										3
									
								
								CyLukTs/lukan/node_modules/base64-js/index.d.ts
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@@ -0,0 +1,3 @@
 | 
			
		||||
export function byteLength(b64: string): number;
 | 
			
		||||
export function toByteArray(b64: string): Uint8Array;
 | 
			
		||||
export function fromByteArray(uint8: Uint8Array): string;
 | 
			
		||||
							
								
								
									
										150
									
								
								CyLukTs/lukan/node_modules/base64-js/index.js
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										150
									
								
								CyLukTs/lukan/node_modules/base64-js/index.js
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@@ -0,0 +1,150 @@
 | 
			
		||||
'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
 | 
			
		||||
 | 
			
		||||
  var i
 | 
			
		||||
  for (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('')
 | 
			
		||||
}
 | 
			
		||||
							
								
								
									
										47
									
								
								CyLukTs/lukan/node_modules/base64-js/package.json
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							
							
						
						
									
										47
									
								
								CyLukTs/lukan/node_modules/base64-js/package.json
									
									
									
										generated
									
									
										vendored
									
									
										Normal file
									
								
							@@ -0,0 +1,47 @@
 | 
			
		||||
{
 | 
			
		||||
  "name": "base64-js",
 | 
			
		||||
  "description": "Base64 encoding/decoding in pure JS",
 | 
			
		||||
  "version": "1.5.1",
 | 
			
		||||
  "author": "T. Jameson Little <t.jameson.little@gmail.com>",
 | 
			
		||||
  "typings": "index.d.ts",
 | 
			
		||||
  "bugs": {
 | 
			
		||||
    "url": "https://github.com/beatgammit/base64-js/issues"
 | 
			
		||||
  },
 | 
			
		||||
  "devDependencies": {
 | 
			
		||||
    "babel-minify": "^0.5.1",
 | 
			
		||||
    "benchmark": "^2.1.4",
 | 
			
		||||
    "browserify": "^16.3.0",
 | 
			
		||||
    "standard": "*",
 | 
			
		||||
    "tape": "4.x"
 | 
			
		||||
  },
 | 
			
		||||
  "homepage": "https://github.com/beatgammit/base64-js",
 | 
			
		||||
  "keywords": [
 | 
			
		||||
    "base64"
 | 
			
		||||
  ],
 | 
			
		||||
  "license": "MIT",
 | 
			
		||||
  "main": "index.js",
 | 
			
		||||
  "repository": {
 | 
			
		||||
    "type": "git",
 | 
			
		||||
    "url": "git://github.com/beatgammit/base64-js.git"
 | 
			
		||||
  },
 | 
			
		||||
  "scripts": {
 | 
			
		||||
    "build": "browserify -s base64js -r ./ | minify > base64js.min.js",
 | 
			
		||||
    "lint": "standard",
 | 
			
		||||
    "test": "npm run lint && npm run unit",
 | 
			
		||||
    "unit": "tape test/*.js"
 | 
			
		||||
  },
 | 
			
		||||
  "funding": [
 | 
			
		||||
    {
 | 
			
		||||
      "type": "github",
 | 
			
		||||
      "url": "https://github.com/sponsors/feross"
 | 
			
		||||
    },
 | 
			
		||||
    {
 | 
			
		||||
      "type": "patreon",
 | 
			
		||||
      "url": "https://www.patreon.com/feross"
 | 
			
		||||
    },
 | 
			
		||||
    {
 | 
			
		||||
      "type": "consulting",
 | 
			
		||||
      "url": "https://feross.org/support"
 | 
			
		||||
    }
 | 
			
		||||
  ]
 | 
			
		||||
}
 | 
			
		||||
		Reference in New Issue
	
	Block a user