diff --git a/uds-auth/.gitignore b/uds-auth/.gitignore
new file mode 100644
index 00000000..ccd96f90
--- /dev/null
+++ b/uds-auth/.gitignore
@@ -0,0 +1,8 @@
+node_modules/
+lib/qrcode-lib/node_modules/
+pnpm-lock.yaml
+roles.json
+config.runtime.json
+*.log
+.DS_Store
+Thumbs.db
diff --git a/uds-auth/README.md b/uds-auth/README.md
index bd82d5fd..6326e6dc 100644
--- a/uds-auth/README.md
+++ b/uds-auth/README.md
@@ -1,254 +1,34 @@
# uds-auth
-UDS (Unified Authentication Service) authentication plugin for DeepSeek Harness. Provides automatic SSO authentication using existing UDS credentials and multi-tenant session isolation.
+UDS authentication plugin for DeepSeek Harness: fixed sidebar login badge + host session/role APIs.
-## Features
-
-- **Automatic SSO**: Users already logged into UDS can access the system without scanning QR codes again
-- **Multi-tenant isolation**: Each user gets an independent server-side session with complete data isolation
-- **Flexible session storage**: Choose between in-memory (development) or Redis (production)
-- **Sliding expiration**: Sessions automatically extend on activity for better UX
-- **Standard API**: Easy integration with business components via `getUserContext()`
-
-## Installation
+## Install
```bash
-dsh plugin --profile web add -w "github:your-org/uds-auth"
+dsh plugin --profile web add -w "D:/project/chatgpt/oclaw/uds-auth"
```
-Or for local development:
+Restart Harness after install. The badge mounts on `sidebar.footer.action` (root scope).
-```bash
-dsh plugin --profile web add -w "D:/code/gpt/uds-auth"
-```
-
-Then restart DeepSeek Harness.
-
-## Configuration
-
-Copy `config.default.yaml` to your config directory and customize:
+## Config
```yaml
-udsAuth:
- baseUrl: https://uac.zte.com.cn
- systemCode: '100000456663'
- empNoHeader: X-Emp-No
- authValueHeader: X-Auth-Value
- langIdHeader: X-Lang-Id
- timeout: 5000
-
-session:
- storeType: memory # or 'redis' for production
- redisUrl: redis://localhost:6379
- cookieName: UDS_SESSION
- cookieMaxAge: 1800000 # 30 minutes
- cookieSecure: true
- cookieHttpOnly: true
- cookieSameSite: strict
- slidingExpiration: true
- slidingInterval: 300000 # 5 minutes
-
-loginPageUrl: https://uac.zte.com.cn/portal/login.html
+uacBaseUrl: https://uac.zte.com.cn
+userSearchUrl: https://icenterapi.zte.com.cn/zte-km-icenter-addresearch/user/plain/docs/search
+loginSystemCode: '100000455558'
+originSystemCode: ''
```
-## Usage
+## Layout
-### As Middleware
+| Piece | Path | Role |
+|-------|------|------|
+| Host | `lib/index.js` | Cordis `apply`: settings, RPC, `/uds-auth/*` |
+| Client | `lib/client.js` | ModuleLoader + React footer login card |
+| Bundle | `cordis.patch.yml` | layer `insert` only |
+| Meta | `package.json` `dsh.client` | `./client` + slots inject |
-The plugin provides middleware that can be integrated into your HTTP server:
-
-```javascript
-import udsAuthPlugin from 'uds-auth'
-import { createServer } from 'http'
-
-const config = {
- udsAuth: {
- baseUrl: 'https://uac.zte.com.cn',
- systemCode: '100000456663',
- },
- session: {
- storeType: 'memory',
- cookieMaxAge: 1800000,
- },
- loginPageUrl: 'https://uac.zte.com.cn/portal/login.html',
-}
-
-// Initialize plugin
-const ctx = {} // Your Cordis context
-const plugin = await udsAuthPlugin(ctx, config)
-
-// Access services
-const { authMiddleware, apiHandlers } = plugin.services
-
-// Use in your HTTP server
-const server = createServer(async (req, res) => {
- const ctx = { req, res }
-
- // Apply auth middleware
- await authMiddleware(ctx, async () => {
- // User is authenticated if ctx.userContext exists
- if (ctx.userContext) {
- res.writeHead(200, { 'Content-Type': 'application/json' })
- res.end(JSON.stringify({
- message: 'Hello ' + ctx.userContext.username,
- user: ctx.userContext,
- }))
- } else {
- res.writeHead(401)
- res.end('Unauthorized')
- }
- })
-})
-
-server.listen(3000)
-```
-
-### Getting Current User
-
-Business components can access the current user context:
-
-```javascript
-import { getUserContext, withUserContext } from 'uds-auth'
-
-async function myBusinessLogic() {
- // Using AsyncLocalStorage for request isolation
- await withUserContext(userContext, async () => {
- const user = getUserContext()
-
- if (!user) {
- throw new Error('Not authenticated')
- }
-
- console.log('Current user:', user.username)
- console.log('User ID:', user.userId)
- console.log('Department:', user.department)
-
- // Proceed with business logic...
- })
-}
-```
-
-### API Endpoints
-
-The plugin exposes these endpoints:
-
-- `POST /api/uds-auth/logout` - Logout and destroy session
-- `GET /api/uds-auth/me` - Get current user info
-
-Example integration:
-
-```javascript
-import { createApiHandlers } from 'uds-auth'
-
-const apiHandlers = createApiHandlers(config, sessionStore)
-
-// In your router
-app.post('/api/logout', (req, res) => {
- apiHandlers.logout({ req, res })
-})
-
-app.get('/api/me', (req, res) => {
- apiHandlers.getCurrentUser({ req, res })
-})
-```
-
-## Session Storage
-
-### Memory Store (Development)
-
-```javascript
-const config = {
- session: {
- storeType: 'memory',
- },
-}
-```
-
-Sessions are stored in process memory and lost on restart. Suitable for development only.
-
-### Redis Store (Production)
-
-```javascript
-const config = {
- session: {
- storeType: 'redis',
- redisUrl: 'redis://your-redis-host:6379',
- },
-}
-```
-
-Requires the `redis` package:
-
-```bash
-npm install redis
-```
-
-Sessions persist across restarts and support distributed deployments.
-
-## Security Considerations
-
-- Session cookies are set with `HttpOnly`, `Secure`, and `SameSite=strict` attributes
-- Token values are never logged
-- Session IDs are generated using `crypto.randomUUID()`
-- Different users' sessions are completely isolated
-
-## Testing
-
-Run tests:
-
-```bash
-cd uds-auth
-node --test test/**/*.test.js
-```
-
-Or use the manual test runner:
-
-```bash
-node test/config.test.js
-node test/session/memory-store.test.js
-node test/uds/client.test.js
-node test/uds/validator.test.js
-node test/middleware/auth-middleware.test.js
-node test/context.test.js
-node test/api.test.js
-```
-
-## Project Structure
-
-```
-uds-auth/
-├── lib/
-│ ├── config.js # Configuration loading and validation
-│ ├── index.js # Plugin entry point
-│ ├── context.js # AsyncLocalStorage user context
-│ ├── api.js # API handlers (logout, getCurrentUser)
-│ ├── session/
-│ │ ├── store.js # Abstract session store base class
-│ │ ├── memory-store.js # In-memory session store
-│ │ ├── redis-store.js # Redis-backed session store
-│ │ └── factory.js # Session store factory
-│ ├── uds/
-│ │ ├── client.js # UDS verification client
-│ │ └── validator.js # Credential extraction and validation
-│ └── middleware/
-│ ├── auth-middleware.js # Main authentication middleware
-│ └── session-middleware.js # Session management middleware
-├── test/
-│ ├── config.test.js
-│ ├── context.test.js
-│ ├── api.test.js
-│ ├── session/
-│ ├── uds/
-│ ├── middleware/
-│ └── integration/
-├── docs/
-│ └── frontend-auth-analysis.md # Frontend authentication analysis
-├── config.default.yaml # Default configuration
-├── cordis.patch.yml # DeepSeekHarness plugin configuration
-├── package.json
-├── README.md
-└── README.zh.md
-```
+The login panel uses `position: fixed` with a measured trigger anchor (same pattern as CordisPanel) so the sidebar overflow clip cannot hide it.
## License
diff --git a/uds-auth/README.zh.md b/uds-auth/README.zh.md
index 86343fdd..85b63647 100644
--- a/uds-auth/README.zh.md
+++ b/uds-auth/README.zh.md
@@ -1,254 +1,43 @@
# uds-auth
-DeepSeek Harness 的UDS统一认证服务插件。利用现有UDS凭据实现自动单点登录(SSO),并提供多租户会话隔离。
-
-## 特性
-
-- **自动单点登录**: 已登录UDS的用户无需再次扫码即可访问系统
-- **多租户隔离**: 每个用户拥有独立的服务端会话,数据完全隔离
-- **灵活的会话存储**: 支持内存(开发环境)和Redis(生产环境)两种存储方式
-- **滑动过期**: 会话在活跃时自动延长,提升用户体验
-- **标准API**: 业务组件可通过 `getUserContext()` 轻松获取当前用户
+DeepSeek Harness 的 UDS 统一认证插件:右上角登录徽章 + 设置页用户管理。
## 安装
```bash
-dsh plugin --profile web add -w "github:your-org/uds-auth"
+dsh plugin --profile web add -w "D:/project/chatgpt/oclaw/uds-auth"
```
-本地开发安装:
-
-```bash
-dsh plugin --profile web add -w "D:/code/gpt/uds-auth"
-```
-
-然后重启DeepSeek Harness。
+安装后重启 Harness。登录徽章在 `shell.overlay`(右上角);用户管理/部署配置在 **设置 → UDS 认证**(`settings.section`)。
## 配置
-复制 `config.default.yaml` 到配置目录并自定义:
+在 **设置 → UDS 认证** 或 `cordis.patch.yml` 中修改:
```yaml
-udsAuth:
- baseUrl: https://uac.zte.com.cn
- systemCode: '100000456663'
- empNoHeader: X-Emp-No
- authValueHeader: X-Auth-Value
- langIdHeader: X-Lang-Id
- timeout: 5000
-
-session:
- storeType: memory # 或 'redis'(生产环境)
- redisUrl: redis://localhost:6379
- cookieName: UDS_SESSION
- cookieMaxAge: 1800000 # 30分钟
- cookieSecure: true
- cookieHttpOnly: true
- cookieSameSite: strict
- slidingExpiration: true
- slidingInterval: 300000 # 5分钟
-
-loginPageUrl: https://uac.zte.com.cn/portal/login.html
+uacBaseUrl: https://uac.zte.com.cn
+userSearchUrl: https://icenterapi.zte.com.cn/zte-km-icenter-addresearch/user/plain/docs/search
+loginSystemCode: '100000455558'
+originSystemCode: ''
```
-## 使用方法
+## 标准 DSH 插件结构
-### 作为中间件
+| 部分 | 路径 | 说明 |
+|------|------|------|
+| Host | `lib/index.js` | Cordis `apply`:HTTP `/uds-auth/*`、可选 schema 设置 |
+| Client | `lib/client.js` | 右上角登录 + 设置页用户管理 |
+| Bundle | `cordis.patch.yml` | `insert` 插件层(不含 client.entry) |
+| Meta | `package.json` → `dsh.client` | `exports["./client"]` + slots inject |
-插件提供可集成到HTTP服务器的中间件:
+## API
-```javascript
-import udsAuthPlugin from 'uds-auth'
-import { createServer } from 'http'
-
-const config = {
- udsAuth: {
- baseUrl: 'https://uac.zte.com.cn',
- systemCode: '100000456663',
- },
- session: {
- storeType: 'memory',
- cookieMaxAge: 1800000,
- },
- loginPageUrl: 'https://uac.zte.com.cn/portal/login.html',
-}
-
-// 初始化插件
-const ctx = {} // Cordis上下文
-const plugin = await udsAuthPlugin(ctx, config)
-
-// 获取服务
-const { authMiddleware, apiHandlers } = plugin.services
-
-// 在HTTP服务器中使用
-const server = createServer(async (req, res) => {
- const ctx = { req, res }
-
- // 应用认证中间件
- await authMiddleware(ctx, async () => {
- // 如果ctx.userContext存在则用户已认证
- if (ctx.userContext) {
- res.writeHead(200, { 'Content-Type': 'application/json' })
- res.end(JSON.stringify({
- message: '你好 ' + ctx.userContext.username,
- user: ctx.userContext,
- }))
- } else {
- res.writeHead(401)
- res.end('未授权')
- }
- })
-})
-
-server.listen(3000)
-```
-
-### 获取当前用户
-
-业务组件可以访问当前用户上下文:
-
-```javascript
-import { getUserContext, withUserContext } from 'uds-auth'
-
-async function myBusinessLogic() {
- // 使用AsyncLocalStorage确保请求隔离
- await withUserContext(userContext, async () => {
- const user = getUserContext()
-
- if (!user) {
- throw new Error('未认证')
- }
-
- console.log('当前用户:', user.username)
- console.log('用户ID:', user.userId)
- console.log('部门:', user.department)
-
- // 继续业务逻辑...
- })
-}
-```
-
-### API端点
-
-插件暴露以下端点:
-
-- `POST /api/uds-auth/logout` - 登出并销毁会话
-- `GET /api/uds-auth/me` - 获取当前用户信息
-
-集成示例:
-
-```javascript
-import { createApiHandlers } from 'uds-auth'
-
-const apiHandlers = createApiHandlers(config, sessionStore)
-
-// 在路由中
-app.post('/api/logout', (req, res) => {
- apiHandlers.logout({ req, res })
-})
-
-app.get('/api/me', (req, res) => {
- apiHandlers.getCurrentUser({ req, res })
-})
-```
-
-## 会话存储
-
-### 内存存储(开发)
-
-```javascript
-const config = {
- session: {
- storeType: 'memory',
- },
-}
-```
-
-会话存储在进程内存中,重启后丢失。仅适用于开发环境。
-
-### Redis存储(生产)
-
-```javascript
-const config = {
- session: {
- storeType: 'redis',
- redisUrl: 'redis://your-redis-host:6379',
- },
-}
-```
-
-需要安装 `redis` 包:
-
-```bash
-npm install redis
-```
-
-会话跨重启持久化,支持分布式部署。
-
-## 安全考虑
-
-- Session Cookie设置了`HttpOnly`、`Secure`和`SameSite=strict`属性
-- Token值永远不会被记录到日志
-- Session ID使用`crypto.randomUUID()`生成
-- 不同用户的会话完全隔离
-
-## 测试
-
-运行测试:
-
-```bash
-cd uds-auth
-node --test test/**/*.test.js
-```
-
-或使用手动测试运行器:
-
-```bash
-node test/config.test.js
-node test/session/memory-store.test.js
-node test/uds/client.test.js
-node test/uds/validator.test.js
-node test/middleware/auth-middleware.test.js
-node test/context.test.js
-node test/api.test.js
-```
-
-## 项目结构
-
-```
-uds-auth/
-├── lib/
-│ ├── config.js # 配置加载和验证
-│ ├── index.js # 插件入口
-│ ├── context.js # AsyncLocalStorage用户上下文
-│ ├── api.js # API处理器(登出、获取当前用户)
-│ ├── session/
-│ │ ├── store.js # 抽象会话存储基类
-│ │ ├── memory-store.js # 内存会话存储
-│ │ ├── redis-store.js # Redis会话存储
-│ │ └── factory.js # 会话存储工厂
-│ ├── uds/
-│ │ ├── client.js # UDS验证客户端
-│ │ └── validator.js # 凭据提取和验证
-│ └── middleware/
-│ ├── auth-middleware.js # 主认证中间件
-│ └── session-middleware.js # 会话管理中间件
-├── test/
-│ ├── config.test.js
-│ ├── context.test.js
-│ ├── api.test.js
-│ ├── session/
-│ ├── uds/
-│ ├── middleware/
-│ └── integration/
-├── docs/
-│ └── frontend-auth-analysis.md # 前端认证分析文档
-├── config.default.yaml # 默认配置
-├── cordis.patch.yml # DeepSeekHarness插件配置
-├── package.json
-├── README.md
-└── README.zh.md
-```
+- `POST /uds-auth/qr-start` — 服务端生成扫码挑战
+- `GET /uds-auth/qr?data=` — 二维码 SVG
+- `POST /uds-auth/qr-proxy` — 代理 UAC 扫码校验
+- `GET /uds-auth/api/me` — 当前用户
+- `POST /uds-auth/api/logout` — 登出
+- 用户管理 / 兜底管理员:见 `/uds-auth/api/users*`、`/uds-auth/api/fallback/*`
## License
diff --git a/uds-auth/_find.mjs b/uds-auth/_find.mjs
deleted file mode 100644
index 6cf2db03..00000000
--- a/uds-auth/_find.mjs
+++ /dev/null
@@ -1,15 +0,0 @@
-import { join } from 'node:path';
-import { readdirSync, existsSync } from 'node:fs';
-
-const searchPaths = [
- join(process.cwd(), 'node_modules', '@deepseek-ai'),
- 'C:/Users/10329667/AppData/Local/npm-cache/_npx/1e7f6d9597241db0/node_modules/@deepseek-ai'
-];
-
-for (const p of searchPaths) {
- if (existsSync(p)) {
- console.log('Found:', p);
- const items = readdirSync(p);
- items.forEach(i => console.log(' ', i));
- }
-}
diff --git a/uds-auth/cordis.patch.yml b/uds-auth/cordis.patch.yml
index 8bf42d35..9136744a 100644
--- a/uds-auth/cordis.patch.yml
+++ b/uds-auth/cordis.patch.yml
@@ -1,13 +1,10 @@
-# uds-auth Cordis 插件配置
-# Host: 服务端 API + 路由(在 uds-auth/lib/index.js 中)
-# Client: 登录徽章 UI(通过本插件的 client.js 注册到 sidebar.footer.action)
+# Insert uds-auth into a profile's layer stack.
+# Client entry comes from package.json `exports["./client"]` + `dsh.client`.
- insert:
- id: uds-auth
name: uds-auth
config:
uacBaseUrl: https://uac.zte.com.cn
- userSearchUrl: https://icenterapi.zte.com.cn/v2/user/search
+ userSearchUrl: https://icenterapi.zte.com.cn/zte-km-icenter-addresearch/user/plain/docs/search
loginSystemCode: '100000455558'
originSystemCode: ''
- client:
- entry: ./lib/client-cordis.js
diff --git a/uds-auth/lib/api.js b/uds-auth/lib/api.js
index b902d176..616bca9e 100644
--- a/uds-auth/lib/api.js
+++ b/uds-auth/lib/api.js
@@ -24,6 +24,15 @@ export function createApiHandlers(config, sessionStore, rolesStore) {
async function logout(ctx) {
const empNo = ctx.empNo
if (empNo) await sessionStore.delete(empNo)
+ // 清掉兜底 / 提示客户端清 UDS cookie(UDS cookie 多为非 HttpOnly,服务端再清一遍兜底)
+ const clear = [
+ 'UDS_FALLBACK_USER=; Max-Age=0; Path=/; HttpOnly; SameSite=Lax',
+ 'PORTALSSOUser=; Max-Age=0; Path=/; SameSite=Lax',
+ 'PORTALSSOCookie=; Max-Age=0; Path=/; SameSite=Lax',
+ 'ZTEDPGSSOUser=; Max-Age=0; Path=/; SameSite=Lax',
+ 'ZTEDPGSSOCookie=; Max-Age=0; Path=/; SameSite=Lax',
+ ]
+ ctx.res.setHeader('Set-Cookie', clear)
await sendRes(ctx.res, 200, { message: 'Logged out' })
}
@@ -45,10 +54,12 @@ export function createApiHandlers(config, sessionStore, rolesStore) {
if (!requirePermission(ctx, 'super_admin')) {
return sendRes(ctx.res, 403, { error: '只有超级管理员可以查看用户列表' })
}
- const users = rolesStore.getAll().map(({ empNo, role }) => ({
- empNo, role, roleLabel: ROLE_LABELS[role] || role,
- }))
- await sendRes(ctx.res, 200, { users, total: users.length })
+ const url = new URL(ctx.req.url, 'http://localhost')
+ const page = url.searchParams.get('page')
+ const pageSize = url.searchParams.get('pageSize')
+ const q = url.searchParams.get('q') || ''
+ const result = rolesStore.listPage({ page, pageSize, q })
+ await sendRes(ctx.res, 200, result)
}
async function setUserRole(ctx) {
diff --git a/uds-auth/lib/client-cordis.js b/uds-auth/lib/client-cordis.js
deleted file mode 100644
index 273f2745..00000000
--- a/uds-auth/lib/client-cordis.js
+++ /dev/null
@@ -1,439 +0,0 @@
-/**
- * uds-auth Cordis Client Plugin
- * DSH 标准写法 - 注册到 sidebar.footer.action (scope: root, 所有页面都显示)
- */
-const CSS = `
-.uds-auth-badge{display:flex;align-items:center;gap:6px;padding:4px 10px;border-radius:4px;background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));border:1px solid var(--dsw-alias-border-l2,#dfe1e5);color:var(--dsw-alias-label-primary,#1f2329);font-size:13px;cursor:pointer;font-weight:500;transition:all .15s}.uds-auth-badge:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}.uds-auth-badge-unauth{color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-badge-unauth:hover{color:var(--dsw-alias-label-secondary,#646a73)}.uds-auth-avatar{width:22px;height:22px;border-radius:50%;background:linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162));display:flex;align-items:center;justify-content:center;font-size:10px;font-weight:700;color:#fff;flex-shrink:0}.uds-auth-badge-unauth .uds-auth-avatar{background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-role-badge{font-size:10px;padding:1px 6px;border-radius:10px;font-weight:600}.uds-auth-role-super_admin{background:rgba(213,73,65,.12);color:var(--dsw-alias-state-error-primary,#d54941)}.uds-auth-role-admin{background:rgba(217,119,6,.12);color:var(--dsw-alias-state-warn-primary,#d97706)}.uds-auth-role-fallback_admin{background:rgba(51,112,255,.12);color:var(--dsw-alias-state-business-primary,#3370ff)}.uds-auth-dropdown{position:absolute;bottom:100%;left:0;margin-bottom:8px;background:var(--dsw-alias-bg-layer-1,#fff);border-radius:8px;border:1px solid var(--dsw-alias-border-l2,#dee0e3);box-shadow:0 8px 28px rgba(0,0,0,.08);min-width:220px;z-index:1000;overflow:hidden}.uds-auth-info{padding:14px 16px;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-info-name{font-weight:600;margin-bottom:4px;color:var(--dsw-alias-label-primary,#1f2329);font-size:14px}.uds-auth-info-detail{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:2px;display:flex;justify-content:space-between}.uds-auth-info-detail-label{color:var(--dsw-alias-label-tertiary,#8f959e);margin-right:8px}.uds-auth-qr-container{padding:16px;text-align:center}.uds-auth-qr-img{display:block;margin:0 auto;width:160px;height:160px}.uds-auth-qr-status{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:8px;text-align:center}.uds-auth-qr-refresh{margin-top:8px;padding:6px 12px;background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border:none;border-radius:4px;cursor:pointer;font-size:12px}.uds-auth-qr-refresh:hover{opacity:.9}.uds-auth-settings-btn{width:calc(100% - 32px);margin:8px 16px 0;padding:8px 12px;background:var(--dsw-alias-bg-module-platform,#f4f5f7);color:var(--dsw-alias-label-primary,#1f2329);border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;cursor:pointer;font-size:13px;text-align:left}.uds-auth-settings-btn:hover{background:var(--dsw-alias-interactive-bg-hover,#f7f8fa)}.uds-auth-logout{width:calc(100% - 32px);margin:8px 16px 16px;padding:8px 12px;background:rgba(213,73,65,.08);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:4px;cursor:pointer;font-size:13px}.uds-auth-logout:hover{background:rgba(213,73,65,.15)}.uds-auth-user-mgmt{padding:16px}.uds-auth-user-mgmt h4{font-size:14px;margin-bottom:12px}.uds-auth-user-table{width:100%;border-collapse:collapse;font-size:12px}.uds-auth-user-table th,.uds-auth-user-table td{padding:6px 8px;text-align:left;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-user-table th{color:var(--dsw-alias-label-tertiary,#8f959e);font-weight:500}.uds-auth-add-user{display:flex;gap:8px;margin-top:12px}.uds-auth-add-user input{flex:1;padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}.uds-auth-add-user select{padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}.uds-auth-add-user button{padding:6px 12px;background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border:none;border-radius:4px;cursor:pointer;font-size:12px}.uds-auth-del-btn{padding:3px 8px;background:rgba(213,73,65,.1);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:3px;cursor:pointer;font-size:11px}.uds-auth-modal{position:fixed;top:0;left:0;right:0;bottom:0;background:rgba(0,0,0,.4);z-index:9999;display:flex;align-items:center;justify-content:center}.uds-auth-modal-content{background:#fff;border-radius:8px;max-width:500px;width:90%;max-height:80vh;overflow-y:auto;box-shadow:0 12px 40px rgba(0,0,0,.15)}
-`
-
-// 工具函数
-function getCookie(name) {
- const c = name + '=', arr = document.cookie.split(';')
- for (let i = 0; i < arr.length; i++) {
- const v = arr[i].trim()
- if (v.indexOf(c) === 0) return decodeURIComponent(v.substring(c.length))
- }
- return null
-}
-
-function setCookie(name, value, days) {
- const d = new Date()
- d.setTime(d.getTime() + days * 86400000)
- document.cookie = name + '=' + encodeURIComponent(value) + ';expires=' + d.toUTCString() + ';path=/'
-}
-
-function getEmpNo() {
- return getCookie('PORTALSSOUser') || getCookie('ZTEDPGSSOUser') || null
-}
-
-function getAuthToken() {
- return getCookie('PORTALSSOCookie') || getCookie('ZTEDPGSSOCookie') || null
-}
-
-function getRoleLabel(role) {
- return { super_admin: '超管', admin: '管理员', fallback_admin: '兜底', user: '' }[role] || ''
-}
-
-// MD5 本地实现
-function md5Local(str) {
- function md5cycle(x, k) {
- let a = x[0], b = x[1], c = x[2], d = x[3]
- a = ff(a, b, c, d, k[0], 7, -680876936); d = ff(d, a, b, c, k[1], 12, -389564586)
- c = ff(c, d, a, b, k[2], 17, 606105819); b = ff(b, c, d, a, k[3], 22, -1044525330)
- a = ff(a, b, c, d, k[4], 7, -176418897); d = ff(d, a, b, c, k[5], 12, 1200080426)
- c = ff(c, d, a, b, k[6], 17, -1473231341); b = ff(b, c, d, a, k[7], 22, -45705983)
- a = ff(a, b, c, d, k[8], 7, 1770035416); d = ff(d, a, b, c, k[9], 12, -1958414417)
- c = ff(c, d, a, b, k[10], 17, -42063); b = ff(b, c, d, a, k[11], 22, -1990404162)
- a = ff(a, b, c, d, k[12], 7, 1804603682); d = ff(d, a, b, c, k[13], 12, -40341101)
- c = ff(c, d, a, b, k[14], 17, -1502002290); b = ff(b, c, d, a, k[15], 22, 1236535329)
- a = gg(a, b, c, d, k[1], 5, -165796510); d = gg(d, a, b, c, k[6], 9, -1069501632)
- c = gg(c, d, a, b, k[11], 14, 643717713); b = gg(b, c, d, a, k[0], 20, -373897302)
- a = gg(a, b, c, d, k[5], 5, -701558691); d = gg(d, a, b, c, k[10], 9, 38016083)
- c = gg(c, d, a, b, k[15], 14, -660478335); b = gg(b, c, d, a, k[4], 20, -405537848)
- a = gg(a, b, c, d, k[9], 5, 568446438); d = gg(d, a, b, c, k[14], 9, -1019803690)
- c = gg(c, d, a, b, k[3], 14, -187363961); b = gg(b, c, d, a, k[8], 20, 1163531501)
- a = gg(a, b, c, d, k[13], 5, -1444681467); d = gg(d, a, b, c, k[2], 9, -51403784)
- c = gg(c, d, a, b, k[7], 14, 1735328473); b = gg(b, c, d, a, k[12], 20, -1926607734)
- a = hh(a, b, c, d, k[5], 4, -378558); d = hh(d, a, b, c, k[8], 11, -2022574463)
- c = hh(c, d, a, b, k[11], 16, 1839030562); b = hh(b, c, d, a, k[14], 23, -35309556)
- a = hh(a, b, c, d, k[1], 4, -1530992060); d = hh(d, a, b, c, k[4], 11, 1272893353)
- c = hh(c, d, a, b, k[7], 16, -155497632); b = hh(b, c, d, a, k[10], 23, -1094730640)
- a = hh(a, b, c, d, k[13], 4, 681279174); d = hh(d, a, b, c, k[0], 11, -358537222)
- c = hh(c, d, a, b, k[3], 16, -722521979); b = hh(b, c, d, a, k[6], 23, 76029189)
- a = hh(a, b, c, d, k[9], 4, -640364487); d = hh(d, a, b, c, k[12], 11, -421815835)
- c = hh(c, d, a, b, k[15], 16, 530742520); b = hh(b, c, d, a, k[2], 23, -995338651)
- a = ii(a, b, c, d, k[0], 6, -198630844); d = ii(d, a, b, c, k[7], 10, 1126891415)
- c = ii(c, d, a, b, k[14], 15, -1416354905); b = ii(b, c, d, a, k[3], 21, -57434055)
- a = ii(a, b, c, d, k[10], 6, 1700485571); d = ii(d, a, b, c, k[1], 10, -1894986606)
- c = ii(c, d, a, b, k[8], 15, -1051523); b = ii(b, c, d, a, k[15], 21, -2054922799)
- a = ii(a, b, c, d, k[6], 6, 1873313359); d = ii(d, a, b, c, k[13], 10, -30611744)
- c = ii(c, d, a, b, k[4], 15, -1560198380); b = ii(b, c, d, a, k[11], 21, 1309151649)
- a = ii(a, b, c, d, k[2], 6, -145523070); d = ii(d, a, b, c, k[9], 10, -1120210379)
- c = ii(c, d, a, b, k[0], 15, 718787259); b = ii(b, c, d, a, k[7], 21, -343485551)
- x[0] = add32(a, x[0]); x[1] = add32(b, x[1]); x[2] = add32(c, x[2]); x[3] = add32(d, x[3])
- }
- function cmn(q, a, b, x, s, t) { a = add32(add32(a, q), add32(x, t)); return add32((a << s) | (a >>> (32 - s)), b) }
- function ff(a, b, c, d, x, s, t) { return cmn((b & c) | ((~b) & d), a, b, x, s, t) }
- function gg(a, b, c, d, x, s, t) { return cmn((b & d) | (c & (~d)), a, b, x, s, t) }
- function hh(a, b, c, d, x, s, t) { return cmn(b ^ c ^ d, a, b, x, s, t) }
- function ii(a, b, c, d, x, s, t) { return cmn(c ^ (b | (~d)), a, b, x, s, t) }
- function md51(s) {
- const n = s.length, state = [1732584193, -271733879, -1732584194, 271733878]
- for (let i = 64; i <= s.length; i += 64) md5cycle(state, md5blk(s.substring(i - 64, i)))
- s = s.substring(i - 64)
- const tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
- for (let i = 0; i < s.length; i++) tail[i >> 2] |= s.charCodeAt(i) << ((i % 4) << 3)
- tail[i >> 2] |= 0x80 << ((i % 4) << 3)
- if (i > 55) { md5cycle(state, tail); tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] }
- tail[14] = n * 8; md5cycle(state, tail)
- return state
- }
- function md5blk(s) {
- const md5blks = []
- for (let i = 0; i < 64; i += 4) md5blks[i >> 2] = s.charCodeAt(i) + (s.charCodeAt(i + 1) << 8) + (s.charCodeAt(i + 2) << 16) + (s.charCodeAt(i + 3) << 24)
- return md5blks
- }
- const hex_chr = '0123456789abcdef'.split('')
- function rhex(n) { let s = '', j = 0; for (; j < 4; j++) s += hex_chr[(n >> (j * 8 + 4)) & 0x0F] + hex_chr[(n >> (j * 8)) & 0x0F]; return s }
- function hex(x) { for (let i = 0; i < x.length; i++) x[i] = rhex(x[i]); return x.join('') }
- function add32(a, b) { return (a + b) & 0xFFFFFFFF }
- return hex(md51(str))
-}
-
-// DSH Cordis Client 插件
-export const name = 'uds-auth-ui'
-export const inject = ['slots']
-
-export function apply(ctx) {
- const slots = ctx.slots
- if (!slots) {
- console.warn('[uds-auth-ui] slots not available')
- return
- }
-
- // 注入 CSS
- if (!document.getElementById('uds-auth-cordis-css')) {
- const style = document.createElement('style')
- style.id = 'uds-auth-cordis-css'
- style.textContent = CSS
- document.head.appendChild(style)
- }
-
- // 状态
- let currentUser = null
- let dropdownVisible = false
- let qrPollingTimer = null
- let currentQRKey = null
- let currentQRValue = null
- const LOGIN_SYSTEM_CODE = '100000455558'
-
- // 更新徽章显示
- function updateBadge(user) {
- currentUser = user
- const badge = document.getElementById('uds-auth-badge-el')
- if (!badge) return
- if (!user) {
- badge.innerHTML = '?未登录'
- badge.className = 'uds-auth-badge uds-auth-badge-unauth'
- } else {
- const name = user.userName || user.name || '用户' + user.empNo
- const initials = name.slice(0, 2).toUpperCase()
- const roleLabel = getRoleLabel(user.role)
- const roleBadge = roleLabel ? '' + roleLabel + '' : ''
- badge.innerHTML = '' + initials + '' + name + '' + roleBadge
- badge.className = 'uds-auth-badge'
- }
- }
-
- function toggleDropdown() {
- dropdownVisible = !dropdownVisible
- const el = document.getElementById('uds-auth-dropdown-el')
- if (el) el.style.display = dropdownVisible ? 'block' : 'none'
- if (dropdownVisible) renderDropdown()
- }
-
- function closeDropdown() {
- dropdownVisible = false
- const el = document.getElementById('uds-auth-dropdown-el')
- if (el) el.style.display = 'none'
- }
-
- function renderDropdown() {
- const container = document.getElementById('uds-auth-dropdown-el')
- if (!container) return
-
- if (!currentUser) {
- container.innerHTML = `
-
-
- `
- document.getElementById('uds-qr-refresh').onclick = startQRLogin
- startQRLogin()
- } else {
- const name = currentUser.userName || currentUser.name || '用户' + currentUser.empNo
- const roleLabel = getRoleLabel(currentUser.role)
- const perms = currentUser.permissions || {}
- let html = '' + name + '
'
- html += '
工号' + (currentUser.empNo || '-') + '
'
- html += '
角色' + roleLabel + '
'
- if (currentUser.department) html += '
部门' + currentUser.department + '
'
- if (currentUser.email) html += '
邮箱' + currentUser.email + '
'
- if (currentUser.phone) html += '
手机' + currentUser.phone + '
'
- html += '
'
- if (perms.canManageUsers) html += ''
- if (perms.canAccessSettings) html += ''
- html += ''
- container.innerHTML = html
-
- const sBtn = document.getElementById('uds-settings-btn')
- if (sBtn) sBtn.onclick = () => { window.location.href = '/settings' }
- const uBtn = document.getElementById('uds-user-mgmt-btn')
- if (uBtn) uBtn.onclick = openUserManagement
- const lBtn = document.getElementById('uds-logout-btn')
- if (lBtn) lBtn.onclick = () => {
- setCookie('PORTALSSOUser', '', -1); setCookie('PORTALSSOCookie', '', -1)
- setCookie('ZTEDPGSSOUser', '', -1); setCookie('ZTEDPGSSOCookie', '', -1)
- setCookie('UDS_FALLBACK_USER', '', -1)
- location.reload()
- }
- }
- }
-
- function startQRLogin() {
- if (qrPollingTimer) { clearInterval(qrPollingTimer); qrPollingTimer = null }
- const status = document.getElementById('uds-qr-status')
- const wrap = document.getElementById('uds-qr-wrap')
- if (!status) return
- status.textContent = '正在生成二维码...'
-
- loadUACMd5Plugin().then(() => {
- if (typeof window.jQuery.md5QrCode !== 'function') {
- status.textContent = '加密插件加载失败'
- return
- }
- const qrCodeStr = window.jQuery.md5QrCode('TwoDIMAuth')
- const parts = qrCodeStr.split(':')
- currentQRKey = parts[1]
- currentQRValue = parts[2]
- status.textContent = '请使用iCenter扫码登录...'
- if (wrap) wrap.innerHTML = '
'
- qrPollingTimer = setInterval(pollQRStatus, 2000)
- }).catch(() => { status.textContent = '加载加密插件失败' })
- }
-
- function loadUACMd5Plugin() {
- return new Promise((resolve, reject) => {
- if (window.jQuery && window.jQuery.md5QrCode) { resolve(); return }
- function loadScript(src) {
- return new Promise((res, rej) => {
- const s = document.createElement('script')
- s.src = src; s.onload = res; s.onerror = rej
- document.head.appendChild(s)
- })
- }
- loadScript('/uds-auth/vendor/jquery.min.js')
- .then(() => loadScript('/uds-auth/vendor/jquery.md5.min.js'))
- .then(resolve).catch(reject)
- })
- }
-
- function pollQRStatus() {
- if (!currentQRKey) return
- const source = currentQRKey + currentQRValue + '127.0.0.1' + LOGIN_SYSTEM_CODE + ''
- const verifyCode = window.jQuery ? window.jQuery.verfiyCode(source) : md5Local(source)
- const body = JSON.stringify({
- qrCodeKey: currentQRKey, qrCodeValue: currentQRValue,
- loginClientIp: '127.0.0.1', originSystemCode: '',
- loginSystemCode: LOGIN_SYSTEM_CODE, verifyCode
- })
- fetch('/uds-auth/qr-proxy', { method: 'POST', headers: { 'Content-Type': 'application/json' }, body })
- .then(r => r.json()).then(handleQRResult)
- .catch(() => {
- const s = document.getElementById('uds-qr-status')
- if (s) s.textContent = '网络错误...'
- })
- }
-
- function handleQRResult(result) {
- const code = result.code || {}, bo = result.bo || {}
- const codeCode = code.code || '', boCode = bo.code || ''
- const status = document.getElementById('uds-qr-status')
-
- if (codeCode === '0000' && boCode === '0000') {
- clearInterval(qrPollingTimer); qrPollingTimer = null
- currentQRKey = null; currentQRValue = null
- const other = result.other || {}
- const empNo = other.account || other.empNo || ''
- const token = other.token || other.authValue || ''
- if (empNo) {
- setCookie('PORTALSSOUser', empNo, 7)
- if (token) setCookie('PORTALSSOCookie', token, 7)
- if (status) status.textContent = '登录成功!'
- setTimeout(() => { closeDropdown(); fetchUserAndPermissions() }, 500)
- }
- return
- }
- if (codeCode === '0000' && boCode === '4002') { if (status) status.textContent = '等待扫码...'; return }
- if (codeCode === '0000' && boCode === '1002') {
- clearInterval(qrPollingTimer); qrPollingTimer = null
- if (status) status.textContent = '二维码已过期,请刷新'
- currentQRKey = null; currentQRValue = null
- return
- }
- clearInterval(qrPollingTimer); qrPollingTimer = null
- if (status) status.textContent = '⚠️ ' + (bo.msg || boCode || '登录失败')
- }
-
- function fetchUserAndPermissions() {
- const empNo = getEmpNo()
- if (!empNo) { updateBadge(null); return }
- fetch('/uds-auth/api/me')
- .then(r => r.json())
- .then(me => {
- const permissions = me?.data?.permissions || {}
- const role = me?.data?.role || 'user'
- updateBadge({ empNo, userName: null, role, permissions })
- fetchUserInfo(user => {
- updateBadge(Object.assign({ role, permissions }, user))
- })
- })
- .catch(() => fetchUserInfo(cb => updateBadge(cb)))
- }
-
- function fetchUserInfo(cb) {
- const empNo = getEmpNo()
- if (!empNo) { cb({ empNo, userName: '用户' + empNo }); return }
- const token = getAuthToken()
- let url = '/uds-auth/user-info?empNo=' + encodeURIComponent(empNo)
- if (token) url += '&token=' + encodeURIComponent(token)
- fetch(url)
- .then(r => r.json())
- .then(result => {
- if (result.code && result.code.code === '0000' && result.bo && result.bo.length > 0) {
- const emp = result.bo[0]
- const dept = emp.deptName || emp.deptShortName || emp.orgName || emp.department || ''
- const name = emp.name || emp.empName || emp.userName || '用户' + empNo
- cb({ empNo: emp.employeeShortId || emp.employeeNO || empNo, userName: name, department: dept, email: emp.email || emp.mail || '', phone: emp.mobile || emp.phone || '' })
- } else cb({ empNo, userName: '用户' + empNo })
- })
- .catch(() => cb({ empNo, userName: '用户' + empNo }))
- }
-
- function openUserManagement() {
- fetch('/uds-auth/api/users')
- .then(r => r.json())
- .then(data => {
- const users = data.users || []
- let html = '用户管理
'
- html += '
| 工号 | 角色 | 操作 |
'
- users.forEach(u => {
- const roleOpts = '' +
- '' +
- ''
- html += '| ' + u.empNo + ' | ' + u.role + ' | ' +
- ' ' +
- ' |
'
- })
- html += '
'
- html += '
'
- const panel = document.createElement('div')
- panel.className = 'uds-auth-modal'
- panel.innerHTML = '' + html + '
'
- document.body.appendChild(panel)
- panel.onclick = e => { if (e.target === panel) panel.remove() }
- })
- }
-
- window.__udsChgRole = (empNo, role) => {
- fetch('/uds-auth/api/users/role', { method: 'POST', headers: { 'Content-Type': 'application/json' }, body: JSON.stringify({ empNo, role }) })
- .then(r => r.json()).then(d => { if (d.error) alert(d.error); openUserManagement() })
- }
- window.__udsDelUser = (empNo) => {
- if (!confirm('确认删除 ' + empNo + '?')) return
- fetch('/uds-auth/api/users/delete', { method: 'POST', headers: { 'Content-Type': 'application/json' }, body: JSON.stringify({ empNo }) })
- .then(r => r.json()).then(d => { if (d.error) alert(d.error); openUserManagement() })
- }
- window.__udsAddUser = () => {
- const empNo = document.getElementById('uds-new-empno').value.trim()
- const role = document.getElementById('uds-new-role').value
- if (!empNo) return
- fetch('/uds-auth/api/users', { method: 'POST', headers: { 'Content-Type': 'application/json' }, body: JSON.stringify({ empNo, role }) })
- .then(r => r.json()).then(d => { if (d.error) alert(d.error); openUserManagement() })
- }
-
- // 注册 React 组件 - 徽章按钮
- function BadgeButton({ isAuth, name, initials, roleBadge }) {
- return React.createElement('button', {
- id: 'uds-auth-badge-el',
- className: 'uds-auth-badge ' + (isAuth ? '' : 'uds-auth-badge-unauth'),
- onClick: toggleDropdown,
- style: {
- display: 'flex', alignItems: 'center', gap: '6px', padding: '4px 10px', borderRadius: '4px',
- background: 'var(--dsw-alias-bg-module-platform,rgba(242,243,245,1))',
- border: '1px solid var(--dsw-alias-border-l2,#dfe1e5)',
- color: isAuth ? 'var(--dsw-alias-label-primary,#1f2329)' : 'var(--dsw-alias-label-tertiary,#8f959e)',
- fontSize: '13px', cursor: 'pointer', fontWeight: '500'
- }
- },
- React.createElement('span', {
- className: 'uds-auth-avatar',
- style: {
- width: '22px', height: '22px', borderRadius: '50%',
- background: isAuth
- ? 'linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162))'
- : 'var(--dsw-alias-bg-module-platform,rgba(242,243,245,1))',
- color: isAuth ? '#fff' : 'var(--dsw-alias-label-tertiary,#8f959e)',
- display: 'flex', alignItems: 'center', justifyContent: 'center', fontSize: '10px', fontWeight: '700'
- }
- }, initials),
- React.createElement('span', null, name),
- roleBadge
- )
- }
-
- // 注册到 sidebar.footer.action slot (scope: root, 所有页面都显示)
- slots.inject('sidebar.footer.action', () => {
- slots.register(
- { name: 'sidebar.footer.action', id: 'uds-auth-login', order: 100 },
- (props) => {
- const isAuth = !!currentUser
- const name = currentUser ? (currentUser.userName || currentUser.name || '用户' + currentUser.empNo) : '未登录'
- const initials = name.slice(0, 2).toUpperCase()
- const roleLabel = currentUser ? getRoleLabel(currentUser.role) : ''
- const roleBadge = roleLabel
- ? React.createElement('span', { className: 'uds-auth-role-badge uds-auth-role-' + currentUser.role }, roleLabel)
- : null
-
- return React.createElement('div', { style: { position: 'relative', display: 'flex', alignItems: 'center' } },
- BadgeButton({ isAuth, name, initials, roleBadge }),
- React.createElement('div', {
- id: 'uds-auth-dropdown-el',
- className: 'uds-auth-dropdown',
- style: {
- display: 'none', position: 'absolute', bottom: '100%', left: '0', marginBottom: '8px',
- background: 'var(--dsw-alias-bg-layer-1,#fff)', borderRadius: '8px',
- border: '1px solid var(--dsw-alias-border-l2,#dee0e3)',
- boxShadow: '0 8px 28px rgba(0,0,0,.08)', minWidth: '220px', zIndex: 1000, overflow: 'hidden'
- }
- })
- )
- }
- )
- })
-
- // 点击外部关闭下拉
- document.addEventListener('click', (e) => {
- const badge = document.getElementById('uds-auth-badge-el')
- const dropdown = document.getElementById('uds-auth-dropdown-el')
- if (dropdownVisible && badge && !badge.contains(e.target) && dropdown && !dropdown.contains(e.target)) {
- closeDropdown()
- }
- })
-
- // 初始加载用户信息
- fetchUserAndPermissions()
-}
diff --git a/uds-auth/lib/client-slot.cjs b/uds-auth/lib/client-slot.cjs
deleted file mode 100644
index 3a5c5445..00000000
--- a/uds-auth/lib/client-slot.cjs
+++ /dev/null
@@ -1,413 +0,0 @@
-/**
- * uds-auth Cordis Client Plugin
- * 登录徽章 - 注册到 sidebar.footer.action (scope: root, 所有页面都显示)
- */
-const CSS = `
-.uds-auth-badge{display:flex;align-items:center;gap:6px;padding:4px 10px;border-radius:4px;background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));border:1px solid var(--dsw-alias-border-l2,#dfe1e5);color:var(--dsw-alias-label-primary,#1f2329);font-size:13px;cursor:pointer;font-weight:500;transition:all .15s}.uds-auth-badge:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}.uds-auth-badge-unauth{color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-badge-unauth:hover{color:var(--dsw-alias-label-secondary,#646a73)}.uds-auth-avatar{width:22px;height:22px;border-radius:50%;background:linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162));display:flex;align-items:center;justify-content:center;font-size:10px;font-weight:700;color:#fff;flex-shrink:0}.uds-auth-badge-unauth .uds-auth-avatar{background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-role-badge{font-size:10px;padding:1px 6px;border-radius:10px;font-weight:600}.uds-auth-role-super_admin{background:rgba(213,73,65,.12);color:var(--dsw-alias-state-error-primary,#d54941)}.uds-auth-role-admin{background:rgba(217,119,6,.12);color:var(--dsw-alias-state-warn-primary,#d97706)}.uds-auth-role-fallback_admin{background:rgba(51,112,255,.12);color:var(--dsw-alias-state-business-primary,#3370ff)}.uds-auth-dropdown{position:absolute;bottom:100%;left:0;margin-bottom:8px;background:var(--dsw-alias-bg-layer-1,#fff);border-radius:8px;border:1px solid var(--dsw-alias-border-l2,#dee0e3);box-shadow:0 8px 28px rgba(0,0,0,.08);min-width:220px;z-index:1000;overflow:hidden}.uds-auth-info{padding:14px 16px;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-info-name{font-weight:600;margin-bottom:4px;color:var(--dsw-alias-label-primary,#1f2329);font-size:14px}.uds-auth-info-detail{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:2px;display:flex;justify-content:space-between}.uds-auth-info-detail-label{color:var(--dsw-alias-label-tertiary,#8f959e);margin-right:8px}.uds-auth-qr-container{padding:16px;text-align:center}.uds-auth-qr-canvas{display:block;margin:0 auto;width:160px;height:160px}.uds-auth-qr-img{display:block;margin:0 auto;width:160px;height:160px}.uds-auth-qr-status{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:8px;text-align:center}.uds-auth-qr-refresh{margin-top:8px;padding:6px 12px;background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border:none;border-radius:4px;cursor:pointer;font-size:12px}.uds-auth-qr-refresh:hover{opacity:.9}.uds-auth-settings-btn{width:calc(100% - 32px);margin:8px 16px 0;padding:8px 12px;background:var(--dsw-alias-bg-module-platform,#f4f5f7);color:var(--dsw-alias-label-primary,#1f2329);border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;cursor:pointer;font-size:13px;text-align:left}.uds-auth-settings-btn:hover{background:var(--dsw-alias-interactive-bg-hover,#f7f8fa)}.uds-auth-logout{width:calc(100% - 32px);margin:8px 16px 16px;padding:8px 12px;background:rgba(213,73,65,.08);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:4px;cursor:pointer;font-size:13px}.uds-auth-logout:hover{background:rgba(213,73,65,.15)}.uds-auth-user-mgmt{padding:16px}.uds-auth-user-mgmt h4{font-size:14px;margin-bottom:12px}.uds-auth-user-table{width:100%;border-collapse:collapse;font-size:12px}.uds-auth-user-table th,.uds-auth-user-table td{padding:6px 8px;text-align:left;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-user-table th{color:var(--dsw-alias-label-tertiary,#8f959e);font-weight:500}.uds-auth-add-user{display:flex;gap:8px;margin-top:12px}.uds-auth-add-user input{flex:1;padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}.uds-auth-add-user select{padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}.uds-auth-add-user button{padding:6px 12px;background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border:none;border-radius:4px;cursor:pointer;font-size:12px}.uds-auth-del-btn{padding:3px 8px;background:rgba(213,73,65,.1);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:3px;cursor:pointer;font-size:11px}.uds-auth-modal{position:fixed;top:0;left:0;right:0;bottom:0;background:rgba(0,0,0,.4);z-index:9999;display:flex;align-items:center;justify-content:center}.uds-auth-modal-content{background:#fff;border-radius:8px;max-width:500px;width:90%;max-height:80vh;overflow-y:auto;box-shadow:0 12px 40px rgba(0,0,0,.15)}
-`
-
-// MD5 实现
-function md5(str) {
- function md5cycle(x, k) {
- var a = x[0], b = x[1], c = x[2], d = x[3]
- a=ff(a,b,c,d,k[0],7,-680876936);d=ff(d,a,b,c,k[1],12,-389564586)
- c=ff(c,d,a,b,k[2],17,606105819);b=ff(b,c,d,a,k[3],22,-1044525330)
- a=ff(a,b,c,d,k[4],7,-176418897);d=ff(d,a,b,c,k[5],12,1200080426)
- c=ff(c,d,a,b,k[6],17,-1473231341);b=ff(b,c,d,a,k[7],22,-45705983)
- a=ff(a,b,c,d,k[8],7,1770035416);d=ff(d,a,b,c,k[9],12,-1958414417)
- c=ff(c,d,a,b,k[10],17,-42063);b=ff(b,c,d,a,k[11],22,-1990404162)
- a=ff(a,b,c,d,k[12],7,1804603682);d=ff(d,a,b,c,k[13],12,-40341101)
- c=ff(c,d,a,b,k[14],17,-1502002290);b=ff(b,c,d,a,k[15],22,1236535329)
- a=gg(a,b,c,d,k[1],5,-165796510);d=gg(d,a,b,c,k[6],9,-1069501632)
- c=gg(c,d,a,b,k[11],14,643717713);b=gg(b,c,d,a,k[0],20,-373897302)
- a=gg(a,b,c,d,k[5],5,-701558691);d=gg(d,a,b,c,k[10],9,38016083)
- c=gg(c,d,a,b,k[15],14,-660478335);b=gg(b,c,d,a,k[4],20,-405537848)
- a=gg(a,b,c,d,k[9],5,568446438);d=gg(d,a,b,c,k[14],9,-1019803690)
- c=gg(c,d,a,b,k[3],14,-187363961);b=gg(b,c,d,a,k[8],20,1163531501)
- a=gg(a,b,c,d,k[13],5,-1444681467);d=gg(d,a,b,c,k[2],9,-51403784)
- c=gg(c,d,a,b,k[7],14,1735328473);b=gg(b,c,d,a,k[12],20,-1926607734)
- a=hh(a,b,c,d,k[5],4,-378558);d=hh(d,a,b,c,k[8],11,-2022574463)
- c=hh(c,d,a,b,k[11],16,1839030562);b=hh(b,c,d,a,k[14],23,-35309556)
- a=hh(a,b,c,d,k[1],4,-1530992060);d=hh(d,a,b,c,k[4],11,1272893353)
- c=hh(c,d,a,b,k[7],16,-155497632);b=hh(b,c,d,a,k[10],23,-1094730640)
- a=hh(a,b,c,d,k[13],4,681279174);d=hh(d,a,b,c,k[0],11,-358537222)
- c=hh(c,d,a,b,k[3],16,-722521979);b=hh(b,c,d,a,k[6],23,76029189)
- a=hh(a,b,c,d,k[9],4,-640364487);d=hh(d,a,b,c,k[12],11,-421815835)
- c=hh(c,d,a,b,k[15],16,530742520);b=hh(b,c,d,a,k[2],23,-995338651)
- a=ii(a,b,c,d,k[0],6,-198630844);d=ii(d,a,b,c,k[7],10,1126891415)
- c=ii(c,d,a,b,k[14],15,-1416354905);b=ii(b,c,d,a,k[3],21,-57434055)
- a=ii(a,b,c,d,k[10],6,1700485571);d=ii(d,a,b,c,k[1],10,-1894986606)
- c=ii(c,d,a,b,k[8],15,-1051523);b=ii(b,c,d,a,k[15],21,-2054922799)
- a=ii(a,b,c,d,k[6],6,1873313359);d=ii(d,a,b,c,k[13],10,-30611744)
- c=ii(c,d,a,b,k[4],15,-1560198380);b=ii(b,c,d,a,k[11],21,1309151649)
- a=ii(a,b,c,d,k[2],6,-145523070);d=ii(d,a,b,c,k[9],10,-1120210379)
- c=ii(c,d,a,b,k[0],15,718787259);b=ii(b,c,d,a,k[7],21,-343485551)
- x[0]=add32(a,x[0]);x[1]=add32(b,x[1]);x[2]=add32(c,x[2]);x[3]=add32(d,x[3])
- }
- function cmn(q,a,b,x,s,t){a=add32(add32(a,q),add32(x,t));return add32((a<>>(32-s)),b)}
- function ff(a,b,c,d,x,s,t){return cmn((b&c)|((~b)&d),a,b,x,s,t)}
- function gg(a,b,c,d,x,s,t){return cmn((b&d)|(c&(~d)),a,b,x,s,t)}
- function hh(a,b,c,d,x,s,t){return cmn(b^c^d,a,b,x,s,t)}
- function ii(a,b,c,d,x,s,t){return cmn(c^(b|(~d)),a,b,x,s,t)}
- function md51(s){
- var n=s.length,state=[1732584193,-271733879,-1732584194,271733878],i
- for(i=64;i<=s.length;i+=64)md5cycle(state,md5blk(s.substring(i-64,i)))
- s=s.substring(i-64)
- var tail=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
- for(i=0;i>2]|=s.charCodeAt(i)<<((i%4)<<3)
- tail[i>>2]|=0x80<<((i%4)<<3)
- if(i>55){md5cycle(state,tail);tail=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]}
- tail[14]=n*8;md5cycle(state,tail)
- return state
- }
- function md5blk(s){
- var md5blks=[],i
- for(i=0;i<64;i+=4)md5blks[i>>2]=s.charCodeAt(i)+(s.charCodeAt(i+1)<<8)+(s.charCodeAt(i+2)<<16)+(s.charCodeAt(i+3)<<24)
- return md5blks
- }
- var hex_chr='0123456789abcdef'.split('')
- function rhex(n){var s='',j=0;for(;j<4;j++)s+=hex_chr[(n>>(j*8+4))&0x0F]+hex_chr[(n>>(j*8))&0x0F];return s}
- function hex(x){for(var i=0;i' + roleLabel + '' : ''
- badge.innerHTML = '' + initials + '' + name + '' + roleBadge
- badge.className = 'uds-auth-badge'
- }
- }
-
- function renderDropdown() {
- const container = document.getElementById('uds-auth-dropdown-el')
- if (!container) return
-
- if (!currentUser) {
- container.innerHTML = `
-
-
- `
- document.getElementById('uds-qr-refresh').onclick = startQRLogin
- startQRLogin()
- } else {
- const name = currentUser.userName || currentUser.name || '用户' + currentUser.empNo
- const roleLabel = getRoleLabel(currentUser.role)
- const perms = currentUser.permissions || {}
- let html = '' + name + '
'
- html += '
工号' + (currentUser.empNo||'-') + '
'
- html += '
角色' + roleLabel + '
'
- if(currentUser.department) html += '
部门' + currentUser.department + '
'
- if(currentUser.email) html += '
邮箱' + currentUser.email + '
'
- if(currentUser.phone) html += '
手机' + currentUser.phone + '
'
- html += '
'
- if(perms.canManageUsers) html += ''
- if(perms.canAccessSettings) html += ''
- html += ''
- container.innerHTML = html
-
- const sBtn = document.getElementById('uds-settings-btn')
- if (sBtn) sBtn.onclick = () => { window.location.href = '/settings' }
- const uBtn = document.getElementById('uds-user-mgmt-btn')
- if (uBtn) uBtn.onclick = openUserManagement
- const lBtn = document.getElementById('uds-logout-btn')
- if (lBtn) lBtn.onclick = () => {
- setCookie('PORTALSSOUser','',-1);setCookie('PORTALSSOCookie','',-1)
- setCookie('ZTEDPGSSOUser','',-1);setCookie('ZTEDPGSSOCookie','',-1)
- setCookie('UDS_FALLBACK_USER','',-1)
- location.reload()
- }
- }
- }
-
- function startQRLogin() {
- if (qrPollingTimer) { clearInterval(qrPollingTimer); qrPollingTimer = null }
- const status = document.getElementById('uds-qr-status')
- const wrap = document.getElementById('uds-qr-wrap')
- if (!status) return
- status.textContent = '正在生成二维码...'
-
- loadUACMd5Plugin().then(() => {
- if (typeof window.jQuery.md5QrCode !== 'function') {
- status.textContent = '加密插件加载失败'
- return
- }
- const qrCodeStr = window.jQuery.md5QrCode('TwoDIMAuth')
- const parts = qrCodeStr.split(':')
- currentQRKey = parts[1]
- currentQRValue = parts[2]
- status.textContent = '请使用iCenter扫码登录...'
- if (wrap) wrap.innerHTML = '
'
- qrPollingTimer = setInterval(pollQRStatus, 2000)
- }).catch(() => { status.textContent = '加载加密插件失败' })
- }
-
- function loadUACMd5Plugin() {
- return new Promise((resolve, reject) => {
- if (window.jQuery && window.jQuery.md5QrCode) { resolve(); return }
- function loadScript(src) {
- return new Promise((res, rej) => {
- const s = document.createElement('script')
- s.src = src; s.onload = res; s.onerror = rej
- document.head.appendChild(s)
- })
- }
- loadScript('/uds-auth/vendor/jquery.min.js')
- .then(() => loadScript('/uds-auth/vendor/jquery.md5.min.js'))
- .then(resolve).catch(reject)
- })
- }
-
- function pollQRStatus() {
- if (!currentQRKey) return
- const source = currentQRKey + currentQRValue + '127.0.0.1' + LOGIN_SYSTEM_CODE + ''
- const verifyCode = window.jQuery ? window.jQuery.verfiyCode(source) : md5(source)
- const body = JSON.stringify({
- qrCodeKey: currentQRKey, qrCodeValue: currentQRValue,
- loginClientIp: '127.0.0.1', originSystemCode: '',
- loginSystemCode: LOGIN_SYSTEM_CODE, verifyCode
- })
- fetch('/uds-auth/qr-proxy', {method:'POST',headers:{'Content-Type':'application/json'},body})
- .then(r=>r.json()).then(handleQRResult)
- .catch(() => {
- const s = document.getElementById('uds-qr-status')
- if (s) s.textContent = '网络错误...'
- })
- }
-
- function handleQRResult(result) {
- const code = result.code || {}
- const bo = result.bo || {}
- const codeCode = code.code || ''
- const boCode = bo.code || ''
- const status = document.getElementById('uds-qr-status')
-
- if (codeCode === '0000' && boCode === '0000') {
- clearInterval(qrPollingTimer); qrPollingTimer = null
- currentQRKey = null; currentQRValue = null
- const other = result.other || {}
- const empNo = other.account || other.empNo || ''
- const token = other.token || other.authValue || ''
- if (empNo) {
- setCookie('PORTALSSOUser', empNo, 7)
- if (token) setCookie('PORTALSSOCookie', token, 7)
- if (status) status.textContent = '登录成功!'
- setTimeout(() => { closeDropdown(); fetchUserAndPermissions() }, 500)
- }
- return
- }
- if (codeCode === '0000' && boCode === '4002') { if (status) status.textContent = '等待扫码...'; return }
- if (codeCode === '0000' && boCode === '1002') {
- clearInterval(qrPollingTimer); qrPollingTimer = null
- if (status) status.textContent = '二维码已过期,请刷新'
- currentQRKey = null; currentQRValue = null
- return
- }
- clearInterval(qrPollingTimer); qrPollingTimer = null
- if (status) status.textContent = '⚠️ ' + (bo.msg || boCode || '登录失败')
- }
-
- function fetchUserAndPermissions() {
- const empNo = getEmpNo()
- if (!empNo) { updateBadge(null); return }
- fetch('/uds-auth/api/me')
- .then(r=>r.json())
- .then(me => {
- const permissions = me?.data?.permissions || {}
- const role = me?.data?.role || 'user'
- updateBadge({ empNo, userName: null, role, permissions })
- fetchUserInfo(user => {
- updateBadge(Object.assign({ role, permissions }, user))
- })
- })
- .catch(() => fetchUserInfo(cb => updateBadge(cb)))
- }
-
- function fetchUserInfo(cb) {
- const empNo = getEmpNo()
- if (!empNo) { cb({ empNo, userName: '用户' + empNo }); return }
- const token = getAuthToken()
- let url = '/uds-auth/user-info?empNo=' + encodeURIComponent(empNo)
- if (token) url += '&token=' + encodeURIComponent(token)
- fetch(url)
- .then(r=>r.json())
- .then(result => {
- if (result.code && result.code.code === '0000' && result.bo && result.bo.length > 0) {
- const emp = result.bo[0]
- const dept = emp.deptName || emp.deptShortName || emp.orgName || emp.department || ''
- const name = emp.name || emp.empName || emp.userName || '用户' + empNo
- cb({ empNo: emp.employeeShortId || emp.employeeNO || empNo, userName: name, department: dept, email: emp.email || emp.mail || '', phone: emp.mobile || emp.phone || '' })
- } else cb({ empNo, userName: '用户' + empNo })
- })
- .catch(() => cb({ empNo, userName: '用户' + empNo }))
- }
-
- function openUserManagement() {
- fetch('/uds-auth/api/users')
- .then(r=>r.json())
- .then(data => {
- const users = data.users || []
- let html = '用户管理
'
- html += '
| 工号 | 角色 | 操作 |
'
- users.forEach(u => {
- const roleOpts = '' +
- '' +
- ''
- html += '| '+u.empNo+' | '+u.role+' | ' +
- ' ' +
- ' |
'
- })
- html += '
'
- html += '
'
-
- const panel = document.createElement('div')
- panel.className = 'uds-auth-modal'
- panel.innerHTML = '' + html + '
'
- document.body.appendChild(panel)
- panel.onclick = e => { if (e.target === panel) panel.remove() }
- })
- }
-
- window.__udsChgRole = (empNo, role) => {
- fetch('/uds-auth/api/users/role',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({empNo,role})})
- .then(r=>r.json()).then(d=>{if(d.error)alert(d.error);openUserManagement()})
- }
- window.__udsDelUser = (empNo) => {
- if(!confirm('确认删除 '+empNo+'?'))return
- fetch('/uds-auth/api/users/delete',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({empNo})})
- .then(r=>r.json()).then(d=>{if(d.error)alert(d.error);openUserManagement()})
- }
- window.__udsAddUser = () => {
- const empNo=document.getElementById('uds-new-empno').value.trim()
- const role=document.getElementById('uds-new-role').value
- if(!empNo)return
- fetch('/uds-auth/api/users',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({empNo,role})})
- .then(r=>r.json()).then(d=>{if(d.error)alert(d.error);openUserManagement()})
- }
-
- // 注册 sidebar.footer.action slot
- slots.inject('sidebar.footer.action', () => {
- slots.register({ name: 'sidebar.footer.action', id: 'uds-auth-login', order: 100 }, (props) => {
- const h = React.createElement
- const isAuth = !!currentUser
- const name = currentUser ? (currentUser.userName || currentUser.name || '用户' + currentUser.empNo) : '未登录'
- const initials = name.slice(0, 2).toUpperCase()
- const roleLabel = currentUser ? getRoleLabel(currentUser.role) : ''
- const roleBadge = roleLabel ? h('span', {className:'uds-auth-role-badge uds-auth-role-'+currentUser.role}, roleLabel) : null
-
- return h('div', {style:{position:'relative',display:'flex',alignItems:'center'}},
- h('button', {
- id: 'uds-auth-badge-el',
- className: 'uds-auth-badge ' + (isAuth ? '' : 'uds-auth-badge-unauth'),
- onClick: toggleDropdown,
- style: {display:'flex',alignItems:'center',gap:'6px',padding:'4px 10px',borderRadius:'4px',
- background:'var(--dsw-alias-bg-module-platform,rgba(242,243,245,1))',
- border:'1px solid var(--dsw-alias-border-l2,#dfe1e5)',
- color: isAuth ? 'var(--dsw-alias-label-primary,#1f2329)' : 'var(--dsw-alias-label-tertiary,#8f959e)',
- fontSize:'13px',cursor:'pointer',fontWeight:'500'}
- },
- h('span', {className:'uds-auth-avatar',style:{width:'22px',height:'22px',borderRadius:'50%',
- background: isAuth ? 'linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162))' : 'var(--dsw-alias-bg-module-platform,rgba(242,243,245,1))',
- color: isAuth ? '#fff' : 'var(--dsw-alias-label-tertiary,#8f959e)',
- display:'flex',alignItems:'center',justifyContent:'center',fontSize:'10px',fontWeight:'700'}}, initials),
- h('span', null, name),
- roleBadge
- ),
- h('div', {
- id: 'uds-auth-dropdown-el',
- className: 'uds-auth-dropdown',
- style: {display:'none',position:'absolute',bottom:'100%',left:'0',marginBottom:'8px',
- background:'var(--dsw-alias-bg-layer-1,#fff)',borderRadius:'8px',
- border:'1px solid var(--dsw-alias-border-l2,#dee0e3)',
- boxShadow:'0 8px 28px rgba(0,0,0,.08)',minWidth:'220px',zIndex:1000,overflow:'hidden'}
- })
- )
- })
- })
-
- // 点击外部关闭
- document.addEventListener('click', e => {
- const badge = document.getElementById('uds-auth-badge-el')
- const dropdown = document.getElementById('uds-auth-dropdown-el')
- if (dropdownVisible && badge && !badge.contains(e.target) && dropdown && !dropdown.contains(e.target)) {
- closeDropdown()
- }
- })
-
- // 初始加载
- fetchUserAndPermissions()
- }
-}
diff --git a/uds-auth/lib/client-slot.js b/uds-auth/lib/client-slot.js
deleted file mode 100644
index 3ca76c2b..00000000
--- a/uds-auth/lib/client-slot.js
+++ /dev/null
@@ -1,443 +0,0 @@
-/**
- * uds-auth Cordis Client Plugin
- * 登录徽章 - 注册到 sidebar.brand.name (scope: root, 所有页面都显示)
- */
-const CSS = `
-.uds-auth-badge{display:flex;align-items:center;gap:6px;padding:4px 10px;border-radius:4px;background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));border:1px solid var(--dsw-alias-border-l2,#dfe1e5);color:var(--dsw-alias-label-primary,#1f2329);font-size:13px;cursor:pointer;font-weight:500;transition:all .15s}.uds-auth-badge:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}.uds-auth-badge-unauth{color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-badge-unauth:hover{color:var(--dsw-alias-label-secondary,#646a73)}.uds-auth-avatar{width:22px;height:22px;border-radius:50%;background:linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162));display:flex;align-items:center;justify-content:center;font-size:10px;font-weight:700;color:#fff;flex-shrink:0}.uds-auth-badge-unauth .uds-auth-avatar{background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-role-badge{font-size:10px;padding:1px 6px;border-radius:10px;font-weight:600}.uds-auth-role-super_admin{background:rgba(213,73,65,.12);color:var(--dsw-alias-state-error-primary,#d54941)}.uds-auth-role-admin{background:rgba(217,119,6,.12);color:var(--dsw-alias-state-warn-primary,#d97706)}.uds-auth-role-fallback_admin{background:rgba(51,112,255,.12);color:var(--dsw-alias-state-business-primary,#3370ff)}.uds-auth-dropdown{position:absolute;top:100%;right:0;margin-top:8px;background:var(--dsw-alias-bg-layer-1,#fff);border-radius:8px;border:1px solid var(--dsw-alias-border-l2,#dee0e3);box-shadow:0 8px 28px rgba(0,0,0,.08);min-width:220px;z-index:1000;overflow:hidden}.uds-auth-info{padding:14px 16px;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-info-name{font-weight:600;margin-bottom:4px;color:var(--dsw-alias-label-primary,#1f2329);font-size:14px}.uds-auth-info-detail{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:2px;display:flex;justify-content:space-between}.uds-auth-info-detail-label{color:var(--dsw-alias-label-tertiary,#8f959e);margin-right:8px}.uds-auth-qr-container{padding:16px;text-align:center}.uds-auth-qr-canvas{display:block;margin:0 auto;width:160px;height:160px}.uds-auth-qr-img{display:block;margin:0 auto;width:160px;height:160px}.uds-auth-qr-status{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:8px;text-align:center}.uds-auth-qr-refresh{margin-top:8px;padding:6px 12px;background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border:none;border-radius:4px;cursor:pointer;font-size:12px}.uds-auth-qr-refresh:hover{opacity:.9}.uds-auth-settings-btn{width:calc(100% - 32px);margin:8px 16px 0;padding:8px 12px;background:var(--dsw-alias-bg-module-platform,#f4f5f7);color:var(--dsw-alias-label-primary,#1f2329);border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;cursor:pointer;font-size:13px;text-align:left}.uds-auth-settings-btn:hover{background:var(--dsw-alias-interactive-bg-hover,#f7f8fa)}.uds-auth-logout{width:calc(100% - 32px);margin:8px 16px 16px;padding:8px 12px;background:rgba(213,73,65,.08);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:4px;cursor:pointer;font-size:13px}.uds-auth-logout:hover{background:rgba(213,73,65,.15)}.uds-auth-user-mgmt{padding:16px}.uds-auth-user-mgmt h4{font-size:14px;margin-bottom:12px}.uds-auth-user-table{width:100%;border-collapse:collapse;font-size:12px}.uds-auth-user-table th,.uds-auth-user-table td{padding:6px 8px;text-align:left;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-user-table th{color:var(--dsw-alias-label-tertiary,#8f959e);font-weight:500}.uds-auth-add-user{display:flex;gap:8px;margin-top:12px}.uds-auth-add-user input{flex:1;padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}.uds-auth-add-user select{padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}.uds-auth-add-user button{padding:6px 12px;background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border:none;border-radius:4px;cursor:pointer;font-size:12px}.uds-auth-del-btn{padding:3px 8px;background:rgba(213,73,65,.1);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:3px;cursor:pointer;font-size:11px}.uds-auth-modal{position:fixed;top:0;left:0;right:0;bottom:0;background:rgba(0,0,0,.4);z-index:9999;display:flex;align-items:center;justify-content:center}.uds-auth-modal-content{background:#fff;border-radius:8px;max-width:500px;width:90%;max-height:80vh;overflow-y:auto;box-shadow:0 12px 40px rgba(0,0,0,.15)}
-`
-
-// 内联 MD5 实现(jQuery.md5 兼容)
-function md5(str) {
- function md5cycle(x, k) {
- var a = x[0], b = x[1], c = x[2], d = x[3]
- a = ff(a,b,c,d,k[0],7,-680876936); d = ff(d,a,b,c,k[1],12,-389564586)
- c = ff(c,d,a,b,k[2],17,606105819); b = ff(b,c,d,a,k[3],22,-1044525330)
- a = ff(a,b,c,d,k[4],7,-176418897); d = ff(d,a,b,c,k[5],12,1200080426)
- c = ff(c,d,a,b,k[6],17,-1473231341); b = ff(b,c,d,a,k[7],22,-45705983)
- a = ff(a,b,c,d,k[8],7,1770035416); d = ff(d,a,b,c,k[9],12,-1958414417)
- c = ff(c,d,a,b,k[10],17,-42063); b = ff(b,c,d,a,k[11],22,-1990404162)
- a = ff(a,b,c,d,k[12],7,1804603682); d = ff(d,a,b,c,k[13],12,-40341101)
- c = ff(c,d,a,b,k[14],17,-1502002290); b = ff(b,c,d,a,k[15],22,1236535329)
- a = gg(a,b,c,d,k[1],5,-165796510); d = gg(d,a,b,c,k[6],9,-1069501632)
- c = gg(c,d,a,b,k[11],14,643717713); b = gg(b,c,d,a,k[0],20,-373897302)
- a = gg(a,b,c,d,k[5],5,-701558691); d = gg(d,a,b,c,k[10],9,38016083)
- c = gg(c,d,a,b,k[15],14,-660478335); b = gg(b,c,d,a,k[4],20,-405537848)
- a = gg(a,b,c,d,k[9],5,568446438); d = gg(d,a,b,c,k[14],9,-1019803690)
- c = gg(c,d,a,b,k[3],14,-187363961); b = gg(b,c,d,a,k[8],20,1163531501)
- a = gg(a,b,c,d,k[13],5,-1444681467); d = gg(d,a,b,c,k[2],9,-51403784)
- c = gg(c,d,a,b,k[7],14,1735328473); b = gg(b,c,d,a,k[12],20,-1926607734)
- a = hh(a,b,c,d,k[5],4,-378558); d = hh(d,a,b,c,k[8],11,-2022574463)
- c = hh(c,d,a,b,k[11],16,1839030562); b = hh(b,c,d,a,k[14],23,-35309556)
- a = hh(a,b,c,d,k[1],4,-1530992060); d = hh(d,a,b,c,k[4],11,1272893353)
- c = hh(c,d,a,b,k[7],16,-155497632); b = hh(b,c,d,a,k[10],23,-1094730640)
- a = hh(a,b,c,d,k[13],4,681279174); d = hh(d,a,b,c,k[0],11,-358537222)
- c = hh(c,d,a,b,k[3],16,-722521979); b = hh(b,c,d,a,k[6],23,76029189)
- a = hh(a,b,c,d,k[9],4,-640364487); d = hh(d,a,b,c,k[12],11,-421815835)
- c = hh(c,d,a,b,k[15],16,530742520); b = hh(b,c,d,a,k[2],23,-995338651)
- a = ii(a,b,c,d,k[0],6,-198630844); d = ii(d,a,b,c,k[7],10,1126891415)
- c = ii(c,d,a,b,k[14],15,-1416354905); b = ii(b,c,d,a,k[3],21,-57434055)
- a = ii(a,b,c,d,k[10],6,1700485571); d = ii(d,a,b,c,k[1],10,-1894986606)
- c = ii(c,d,a,b,k[8],15,-1051523); b = ii(b,c,d,a,k[15],21,-2054922799)
- a = ii(a,b,c,d,k[6],6,1873313359); d = ii(d,a,b,c,k[13],10,-30611744)
- c = ii(c,d,a,b,k[4],15,-1560198380); b = ii(b,c,d,a,k[11],21,1309151649)
- a = ii(a,b,c,d,k[2],6,-145523070); d = ii(d,a,b,c,k[9],10,-1120210379)
- c = ii(c,d,a,b,k[0],15,718787259); b = ii(b,c,d,a,k[7],21,-343485551)
- x[0]=add32(a,x[0]);x[1]=add32(b,x[1]);x[2]=add32(c,x[2]);x[3]=add32(d,x[3])
- }
- function cmn(q,a,b,x,s,t){a=add32(add32(a,q),add32(x,t));return add32((a<>>(32-s)),b)}
- function ff(a,b,c,d,x,s,t){return cmn((b&c)|((~b)&d),a,b,x,s,t)}
- function gg(a,b,c,d,x,s,t){return cmn((b&d)|(c&(~d)),a,b,x,s,t)}
- function hh(a,b,c,d,x,s,t){return cmn(b^c^d,a,b,x,s,t)}
- function ii(a,b,c,d,x,s,t){return cmn(c^(b|(~d)),a,b,x,s,t)}
- function md51(s){
- var n=s.length,state=[1732584193,-271733879,-1732584194,271733878],i
- for(i=64;i<=s.length;i+=64)md5cycle(state,md5blk(s.substring(i-64,i)))
- s=s.substring(i-64)
- var tail=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
- for(i=0;i>2]|=s.charCodeAt(i)<<((i%4)<<3)
- tail[i>>2]|=0x80<<((i%4)<<3)
- if(i>55){md5cycle(state,tail);tail=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]}
- tail[14]=n*8;md5cycle(state,tail)
- return state
- }
- function md5blk(s){
- var md5blks=[],i
- for(i=0;i<64;i+=4)md5blks[i>>2]=s.charCodeAt(i)+(s.charCodeAt(i+1)<<8)+(s.charCodeAt(i+2)<<16)+(s.charCodeAt(i+3)<<24)
- return md5blks
- }
- var hex_chr='0123456789abcdef'.split('')
- function rhex(n){var s='',j=0;for(;j<4;j++)s+=hex_chr[(n>>(j*8+4))&0x0F]+hex_chr[(n>>(j*8))&0x0F];return s}
- function hex(x){for(var i=0;i' + roleLabel + '' : ''
- el.innerHTML = '' + initials + '' + name + '' + roleBadge
- el.className = 'uds-auth-badge'
- }
- }
-
- function renderDropdown() {
- const container = document.getElementById('uds-auth-dropdown-el')
- if (!container) return
-
- if (!currentUser) {
- container.innerHTML = `
-
-
- `
- document.getElementById('uds-qr-refresh').onclick = startQRLogin
- startQRLogin()
- } else {
- const name = currentUser.userName || currentUser.name || '用户' + currentUser.empNo
- const roleLabel = getRoleLabel(currentUser.role)
- const perms = currentUser.permissions || {}
- let html = '' + name + '
'
- html += '
工号' + (currentUser.empNo||'-') + '
'
- html += '
角色' + roleLabel + '
'
- if(currentUser.department) html += '
部门' + currentUser.department + '
'
- if(currentUser.email) html += '
邮箱' + currentUser.email + '
'
- if(currentUser.phone) html += '
手机' + currentUser.phone + '
'
- html += '
'
- if(perms.canManageUsers) html += ''
- if(perms.canAccessSettings) html += ''
- html += ''
- container.innerHTML = html
-
- document.getElementById('uds-settings-btn').onclick = () => { window.open('/settings', '_self') }
- document.getElementById('uds-user-mgmt-btn').onclick = openUserManagement
- document.getElementById('uds-logout-btn').onclick = () => {
- setCookie('PORTALSSOUser','',-1);setCookie('PORTALSSOCookie','',-1)
- setCookie('ZTEDPGSSOUser','',-1);setCookie('ZTEDPGSSOCookie','',-1)
- setCookie('UDS_FALLBACK_USER','',-1)
- location.reload()
- }
- }
- }
-
- function toggleDropdown() {
- const container = document.getElementById('uds-auth-dropdown-el')
- if (!container) return
- dropdownVisible = !dropdownVisible
- container.style.display = dropdownVisible ? 'block' : 'none'
- if (dropdownVisible) renderDropdown()
- }
-
- // 关闭下拉
- function closeDropdown() {
- const container = document.getElementById('uds-auth-dropdown-el')
- if (container) container.style.display = 'none'
- dropdownVisible = false
- }
-
- // QR 登录
- function startQRLogin() {
- if (qrPollingTimer) { clearInterval(qrPollingTimer); qrPollingTimer = null }
- const status = document.getElementById('uds-qr-status')
- const wrap = document.getElementById('uds-qr-img-wrap')
- if (!status) return
- status.textContent = '正在生成二维码...'
-
- // 加载 md5 插件
- loadUACMd5Plugin().then(() => {
- if (typeof window.jQuery.md5QrCode !== 'function') {
- status.textContent = '加密插件加载失败'
- return
- }
- const qrCodeStr = window.jQuery.md5QrCode('TwoDIMAuth')
- const parts = qrCodeStr.split(':')
- currentQRKey = parts[1]
- currentQRValue = parts[2]
- status.textContent = '请使用iCenter扫码登录...'
- if (wrap) wrap.innerHTML = '
'
- qrPollingTimer = setInterval(pollQRStatus, 2000)
- }).catch(() => {
- status.textContent = '加载加密插件失败'
- })
- }
-
- function loadUACMd5Plugin() {
- return new Promise((resolve, reject) => {
- if (window.jQuery && window.jQuery.md5QrCode) { resolve(); return }
- function loadScript(src) {
- return new Promise((res, rej) => {
- const s = document.createElement('script')
- s.src = src
- s.onload = res
- s.onerror = rej
- document.head.appendChild(s)
- })
- }
- loadScript('/uds-auth/vendor/jquery.min.js')
- .then(() => loadScript('/uds-auth/vendor/jquery.md5.min.js'))
- .then(resolve).catch(reject)
- })
- }
-
- function pollQRStatus() {
- if (!currentQRKey) return
- const source = currentQRKey + currentQRValue + '127.0.0.1' + LOGIN_SYSTEM_CODE + ''
- const verifyCode = window.jQuery ? window.jQuery.verfiyCode(source) : md5(source)
-
- const body = JSON.stringify({
- qrCodeKey: currentQRKey,
- qrCodeValue: currentQRValue,
- loginClientIp: '127.0.0.1',
- originSystemCode: '',
- loginSystemCode: LOGIN_SYSTEM_CODE,
- verifyCode: verifyCode
- })
-
- fetch('/uds-auth/qr-proxy', { method:'POST', headers:{'Content-Type':'application/json'}, body })
- .then(r => r.json())
- .then(handleQRResult)
- .catch(() => {
- const s = document.getElementById('uds-qr-status')
- if (s) s.textContent = '网络错误...'
- })
- }
-
- function handleQRResult(result) {
- const code = result.code || {}
- const bo = result.bo || {}
- const codeCode = code.code || ''
- const boCode = bo.code || ''
- const status = document.getElementById('uds-qr-status')
-
- if (codeCode === '0000' && boCode === '0000') {
- clearInterval(qrPollingTimer); qrPollingTimer = null
- currentQRKey = null; currentQRValue = null
- const other = result.other || {}
- const empNo = other.account || other.empNo || ''
- const token = other.token || other.authValue || ''
- if (empNo) {
- setCookie('PORTALSSOUser', empNo, 7)
- if (token) setCookie('PORTALSSOCookie', token, 7)
- if (status) status.textContent = '登录成功!'
- fetchUserInfo(() => {
- closeDropdown()
- fetchUserAndPermissions()
- })
- }
- return
- }
- if (codeCode === '0000' && boCode === '4002') {
- if (status) status.textContent = '等待扫码...'
- return
- }
- if (codeCode === '0000' && boCode === '1002') {
- clearInterval(qrPollingTimer); qrPollingTimer = null
- if (status) status.textContent = '二维码已过期,请刷新'
- currentQRKey = null; currentQRValue = null
- return
- }
- clearInterval(qrPollingTimer); qrPollingTimer = null
- if (status) status.textContent = '⚠️ ' + (bo.msg || boCode || '登录失败')
- }
-
- function fetchUserAndPermissions() {
- const empNo = getEmpNo()
- if (!empNo) { updateBadge(null); return }
- fetch('/uds-auth/api/me')
- .then(r => r.json())
- .then(me => {
- const permissions = me?.data?.permissions || {}
- const role = me?.data?.role || 'user'
- updateBadge({ empNo, userName: null, role, permissions })
- fetchUserInfo(user => {
- updateBadge(Object.assign({ role, permissions }, user))
- })
- })
- .catch(() => fetchUserInfo(cb => updateBadge(cb)))
- }
-
- function fetchUserInfo(cb) {
- const empNo = getEmpNo()
- if (!empNo) { cb({ empNo, userName: '用户' + empNo }); return }
- const token = getAuthToken()
- let url = '/uds-auth/user-info?empNo=' + encodeURIComponent(empNo)
- if (token) url += '&token=' + encodeURIComponent(token)
- fetch(url)
- .then(r => r.json())
- .then(result => {
- if (result.code && result.code.code === '0000' && result.bo && result.bo.length > 0) {
- const emp = result.bo[0]
- const dept = emp.deptName || emp.deptShortName || emp.deptFullName || emp.orgName || emp.department || ''
- const name = emp.name || emp.empName || emp.userName || '用户' + empNo
- cb({
- empNo: emp.employeeShortId || emp.employeeNO || empNo,
- userName: name,
- department: dept,
- email: emp.email || emp.mail || '',
- phone: emp.mobile || emp.phone || ''
- })
- } else {
- cb({ empNo, userName: '用户' + empNo })
- }
- })
- .catch(() => cb({ empNo, userName: '用户' + empNo }))
- }
-
- // 用户管理
- function openUserManagement() {
- fetch('/uds-auth/api/users')
- .then(r => r.json())
- .then(data => {
- const users = data.users || []
- let html = '用户管理
'
- html += '
| 工号 | 角色 | 操作 |
'
- users.forEach(u => {
- const roleOpts = '' +
- '' +
- ''
- html += '| '+u.empNo+' | '+u.role+' | ' +
- ' ' +
- ' |
'
- })
- html += '
'
- html += '
'
- html += '
'
-
- const panel = document.createElement('div')
- panel.className = 'uds-auth-modal'
- panel.innerHTML = '' + html + '
'
- document.body.appendChild(panel)
- panel.onclick = e => { if (e.target === panel) panel.remove() }
- })
- }
-
- window.__udsChangeRole = (empNo, role) => {
- fetch('/uds-auth/api/users/role', {method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({empNo,role})})
- .then(r=>r.json()).then(d=>{if(d.error)alert(d.error);openUserManagement()})
- }
- window.__udsDeleteUser = (empNo) => {
- if(!confirm('确认删除 '+empNo+'?'))return
- fetch('/uds-auth/api/users/delete',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({empNo})})
- .then(r=>r.json()).then(d=>{if(d.error)alert(d.error);openUserManagement()})
- }
- window.__udsAddUser = () => {
- const empNo=document.getElementById('uds-new-empno').value.trim()
- const role=document.getElementById('uds-new-role').value
- if(!empNo)return
- fetch('/uds-auth/api/users',{method:'POST',headers:{'Content-Type':'application/json'},body:JSON.stringify({empNo,role})})
- .then(r=>r.json()).then(d=>{if(d.error)alert(d.error);openUserManagement()})
- }
-
- // 注册 sidebar.footer.action slot(显示在设置按钮旁边,所有页面都可见)
- slots.inject('sidebar.footer.action', () => {
- slots.register({ name: 'sidebar.footer.action', id: 'uds-auth-login', order: 100 }, (props) => {
- // React.createElement wrapper
- const h = React.createElement
- return h('div', { style: { position:'relative', display:'flex', alignItems:'center' } },
- h('button', {
- id: 'uds-auth-badge-el',
- className: 'uds-auth-badge uds-auth-badge-unauth',
- onClick: toggleDropdown,
- style: { display:'flex', alignItems:'center', gap:'6px', padding:'4px 10px', borderRadius:'4px',
- background:'var(--dsw-alias-bg-module-platform,rgba(242,243,245,1))',
- border:'1px solid var(--dsw-alias-border-l2,#dfe1e5)',
- color:'var(--dsw-alias-label-tertiary,#8f959e)', fontSize:'13px', cursor:'pointer', fontWeight:'500' }
- },
- h('span', { className:'uds-auth-avatar', style:{ width:'22px',height:'22px',borderRadius:'50%',
- background:'var(--dsw-alias-bg-module-platform,rgba(242,243,245,1))',
- color:'var(--dsw-alias-label-tertiary,#8f959e)', display:'flex',alignItems:'center',
- justifyContent:'center',fontSize:'10px',fontWeight:'700' } }, '?'),
- h('span', null, '未登录')
- ),
- h('div', {
- id: 'uds-auth-dropdown-el',
- className: 'uds-auth-dropdown',
- style: { display:'none', position:'absolute', bottom:'100%', left:'0', marginBottom:'8px',
- background:'var(--dsw-alias-bg-layer-1,#fff)', borderRadius:'8px',
- border:'1px solid var(--dsw-alias-border-l2,#dee0e3)',
- boxShadow:'0 8px 28px rgba(0,0,0,.08)', minWidth:'220px', zIndex:1000, overflow:'hidden' }
- })
- )
- })
- })
-
- // 点击外部关闭
- document.addEventListener('click', e => {
- const badge = document.getElementById('uds-auth-badge-el')
- const dropdown = document.getElementById('uds-auth-dropdown-el')
- if (dropdownVisible && badge && !badge.contains(e.target) && !dropdown.contains(e.target)) {
- closeDropdown()
- }
- })
-
- // 初始加载用户信息
- fetchUserAndPermissions()
- }
-}
diff --git a/uds-auth/lib/client.js b/uds-auth/lib/client.js
new file mode 100644
index 00000000..608e41fb
--- /dev/null
+++ b/uds-auth/lib/client.js
@@ -0,0 +1,739 @@
+/**
+ * uds-auth browser half — shell.overlay (top-right) + settings.section.
+ * Auth: empNo cookie + token verified server-side via user-info.
+ * Fallback: username/password when UAC/QR unavailable.
+ */
+window.__ModuleLoader__.load({
+ id: 'uds-auth',
+ factory: (require) => {
+ const module = { exports: {} }
+ const exports = module.exports
+ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' })
+
+ const React = require('react')
+ const h = React.createElement
+ const { useCallback, useEffect, useLayoutEffect, useRef, useState } = React
+
+ const name = 'uds-auth'
+ const inject = ['slots']
+ const PAGE_SIZE = 50
+
+ const CSS = [
+ '.uds-auth-host{position:fixed;top:calc(6px + env(safe-area-inset-top, 0px));right:12px;z-index:46;display:flex;align-items:center;pointer-events:auto}',
+ '.uds-auth-host.has-better-sidebar{right:88px}',
+ '.uds-auth-badge{display:inline-flex;align-items:center;gap:6px;max-width:min(220px,40vw);height:28px;padding:0 10px;border-radius:999px;background:var(--dsw-alias-bg-layer-1,rgba(255,255,255,.92));border:1px solid var(--dsw-alias-border-l2,#dfe1e5);color:var(--dsw-alias-label-primary,#1f2329);font-size:12px;cursor:pointer;font-weight:500;line-height:1;box-shadow:0 1px 4px rgba(0,0,0,.06);backdrop-filter:blur(8px)}',
+ '.uds-auth-badge:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}',
+ '.uds-auth-badge-unauth{color:var(--dsw-alias-label-tertiary,#8f959e)}',
+ '.uds-auth-avatar{width:18px;height:18px;border-radius:50%;background:linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162));display:inline-flex;align-items:center;justify-content:center;font-size:9px;font-weight:700;color:#fff;flex-shrink:0}',
+ '.uds-auth-badge-unauth .uds-auth-avatar{background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));color:var(--dsw-alias-label-tertiary,#8f959e)}',
+ '.uds-auth-badge-label{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}',
+ '.uds-auth-role{font-size:10px;padding:1px 6px;border-radius:10px;font-weight:600;flex-shrink:0}',
+ '.uds-auth-role-super_admin{background:rgba(213,73,65,.12);color:var(--dsw-alias-state-error-primary,#d54941)}',
+ '.uds-auth-role-admin{background:rgba(217,119,6,.12);color:var(--dsw-alias-state-warn-primary,#d97706)}',
+ '.uds-auth-role-fallback_admin{background:rgba(51,112,255,.12);color:var(--dsw-alias-state-business-primary,#3370ff)}',
+ '.uds-auth-panel{position:fixed;z-index:1200;width:min(300px,calc(100vw - 24px));max-height:min(70vh,560px);overflow:auto;background:var(--dsw-alias-bg-layer-1,#fff);border-radius:8px;border:1px solid var(--dsw-alias-border-l2,#dee0e3);box-shadow:0 8px 28px rgba(0,0,0,.12)}',
+ '.uds-auth-info{padding:14px 16px;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}',
+ '.uds-auth-info-name{font-weight:600;margin-bottom:4px;color:var(--dsw-alias-label-primary,#1f2329);font-size:14px}',
+ '.uds-auth-info-detail{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:2px;display:flex;justify-content:space-between;gap:8px}',
+ '.uds-auth-info-detail-label{color:var(--dsw-alias-label-tertiary,#8f959e)}',
+ '.uds-auth-qr{padding:16px;text-align:center}',
+ '.uds-auth-qr img{display:block;margin:0 auto;width:160px;height:160px}',
+ '.uds-auth-qr-status{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:8px}',
+ '.uds-auth-btn{display:block;width:calc(100% - 32px);margin:8px 16px 0;padding:8px 12px;border-radius:4px;cursor:pointer;font-size:13px;text-align:left;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);background:var(--dsw-alias-bg-module-platform,#f4f5f7);color:var(--dsw-alias-label-primary,#1f2329)}',
+ '.uds-auth-btn:hover{background:var(--dsw-alias-interactive-bg-hover,#f7f8fa)}',
+ '.uds-auth-btn-primary{background:var(--dsw-alias-state-business-primary,#3370ff);color:#fff;border-color:transparent;text-align:center}',
+ '.uds-auth-btn-primary:hover{opacity:.9}',
+ '.uds-auth-btn-danger{margin-bottom:16px;background:rgba(213,73,65,.08);color:var(--dsw-alias-state-error-primary,#d54941);border-color:rgba(213,73,65,.2)}',
+ '.uds-auth-btn-link{background:transparent;border:none;color:var(--dsw-alias-state-business-primary,#3370ff);text-align:center;padding:4px 12px;margin:4px 16px 12px;width:calc(100% - 32px);font-size:12px;cursor:pointer}',
+ '.uds-auth-fallback{padding:12px 16px 16px}',
+ '.uds-auth-fallback label{display:block;font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin:8px 0 4px}',
+ '.uds-auth-fallback input{width:100%;box-sizing:border-box;padding:8px 10px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:6px;font-size:13px}',
+ '.uds-auth-fallback-hint{font-size:11px;color:var(--dsw-alias-label-tertiary,#8f959e);margin:8px 0 0;line-height:1.4}',
+ '.uds-auth-table{width:100%;border-collapse:collapse;font-size:12px}',
+ '.uds-auth-table th,.uds-auth-table td{padding:6px 8px;text-align:left;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}',
+ '.uds-auth-add{display:flex;gap:8px;margin-top:12px;flex-wrap:wrap}',
+ '.uds-auth-add input,.uds-auth-add select{padding:6px 8px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;font-size:12px}',
+ '.uds-auth-add input{flex:1;min-width:120px}',
+ '.uds-auth-del{padding:3px 8px;background:rgba(213,73,65,.1);color:var(--dsw-alias-state-error-primary,#d54941);border:1px solid rgba(213,73,65,.2);border-radius:3px;cursor:pointer;font-size:11px}',
+ '.uds-auth-pager{display:flex;align-items:center;justify-content:space-between;gap:8px;margin-top:12px;font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);flex-wrap:wrap}',
+ '.uds-auth-pager button{padding:4px 10px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:4px;background:var(--dsw-alias-bg-module-platform,#f4f5f7);cursor:pointer;font-size:12px}',
+ '.uds-auth-pager button:disabled{opacity:.4;cursor:not-allowed}',
+ '.uds-auth-search{display:flex;gap:8px;margin-bottom:12px}',
+ '.uds-auth-search input{flex:1;padding:8px 10px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:6px;font-size:13px}',
+ '.uds-auth-settings{box-sizing:border-box;display:flex;flex-direction:column;gap:20px;min-height:0;padding:4px 4px 24px;color:var(--dsw-alias-label-primary,#1f2329)}',
+ '.uds-auth-settings h2{margin:0;font-size:20px;font-weight:600;line-height:28px}',
+ '.uds-auth-settings-intro{margin:4px 0 0;font-size:13px;color:var(--dsw-alias-label-secondary,#646a73)}',
+ '.uds-auth-settings-card{border:1px solid var(--dsw-alias-border-l2,#dee0e3);border-radius:12px;padding:16px;background:var(--dsw-alias-bg-layer-1,transparent)}',
+ '.uds-auth-settings-card h3{margin:0 0 12px;font-size:15px;font-weight:600}',
+ '.uds-auth-settings-field{display:flex;flex-direction:column;gap:4px;margin-bottom:12px}',
+ '.uds-auth-settings-field label{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73)}',
+ '.uds-auth-settings-field input{padding:8px 10px;border:1px solid var(--dsw-alias-border-l2,#dfe1e5);border-radius:6px;font-size:13px;background:var(--dsw-alias-bg-module-platform,#f4f5f7);color:inherit}',
+ '.uds-auth-settings-actions{display:flex;gap:8px;align-items:center;flex-wrap:wrap}',
+ '.uds-auth-settings-msg{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73)}',
+ '.uds-auth-settings-msg.ok{color:var(--dsw-alias-state-success-primary,#20a162)}',
+ '.uds-auth-settings-msg.err{color:var(--dsw-alias-state-error-primary,#d54941)}',
+ '.uds-auth-settings-empty{padding:24px;text-align:center;color:var(--dsw-alias-label-tertiary,#8f959e);font-size:13px}',
+ ].join('')
+
+ function getCookie(cookieName) {
+ const prefix = cookieName + '='
+ const parts = String(document.cookie || '').split(';')
+ for (const part of parts) {
+ const v = part.trim()
+ if (v.startsWith(prefix)) return decodeURIComponent(v.slice(prefix.length))
+ }
+ return null
+ }
+
+ function setCookie(cookieName, value, days) {
+ const d = new Date()
+ d.setTime(d.getTime() + days * 86400000)
+ document.cookie = encodeURIComponent(cookieName) + '=' + encodeURIComponent(value) + ';expires=' + d.toUTCString() + ';path=/'
+ }
+
+ function clearAuthCookies() {
+ for (const key of ['PORTALSSOUser', 'PORTALSSOCookie', 'ZTEDPGSSOUser', 'ZTEDPGSSOCookie', 'UDS_FALLBACK_USER']) {
+ setCookie(key, '', -1)
+ }
+ }
+
+ function getEmpNo() {
+ return getCookie('PORTALSSOUser') || getCookie('ZTEDPGSSOUser') || getCookie('UDS_FALLBACK_USER') || null
+ }
+
+ function getAuthToken() {
+ return getCookie('PORTALSSOCookie') || getCookie('ZTEDPGSSOCookie') || null
+ }
+
+ function roleLabel(role) {
+ return ({ super_admin: '\u8d85\u7ba1', admin: '\u7ba1\u7406\u5458', fallback_admin: '\u5e94\u6025', user: '' })[role] || ''
+ }
+
+ async function fetchJson(url, options) {
+ const res = await fetch(url, options)
+ const data = await res.json().catch(() => ({}))
+ if (!res.ok) {
+ const err = new Error(data.error || res.statusText || 'request failed')
+ err.status = res.status
+ err.data = data
+ throw err
+ }
+ return data
+ }
+
+ function useOutsideClose(ref, open, setOpen) {
+ useEffect(() => {
+ if (!open) return undefined
+ const onPointer = (event) => {
+ if (ref.current && !ref.current.contains(event.target)) setOpen(false)
+ }
+ document.addEventListener('pointerdown', onPointer, true)
+ return () => document.removeEventListener('pointerdown', onPointer, true)
+ }, [open, ref, setOpen])
+ }
+
+ function UserManagementPanel() {
+ const [users, setUsers] = useState([])
+ const [total, setTotal] = useState(0)
+ const [page, setPage] = useState(1)
+ const [totalPages, setTotalPages] = useState(1)
+ const [q, setQ] = useState('')
+ const [qDraft, setQDraft] = useState('')
+ const [newEmpNo, setNewEmpNo] = useState('')
+ const [newRole, setNewRole] = useState('user')
+ const [error, setError] = useState('')
+ const [loading, setLoading] = useState(true)
+
+ const reload = useCallback(async () => {
+ setLoading(true)
+ setError('')
+ try {
+ const qs = new URLSearchParams({
+ page: String(page),
+ pageSize: String(PAGE_SIZE),
+ })
+ if (q) qs.set('q', q)
+ const data = await fetchJson('/uds-auth/api/users?' + qs.toString())
+ setUsers(data.users || [])
+ setTotal(data.total || 0)
+ setTotalPages(data.totalPages || 1)
+ } catch (err) {
+ setError(err.data?.error || err.message || '\u52a0\u8f7d\u5931\u8d25')
+ setUsers([])
+ } finally {
+ setLoading(false)
+ }
+ }, [page, q])
+
+ useEffect(() => { reload() }, [reload])
+
+ return h('div', { className: 'uds-auth-settings-card' },
+ h('h3', null, '\u7528\u6237\u7ba1\u7406'),
+ h('div', { className: 'uds-auth-search' },
+ h('input', {
+ value: qDraft,
+ placeholder: '\u641c\u7d22\u5de5\u53f7',
+ onChange: (e) => setQDraft(e.target.value),
+ onKeyDown: (e) => {
+ if (e.key === 'Enter') { setPage(1); setQ(qDraft.trim()) }
+ },
+ }),
+ h('button', {
+ type: 'button',
+ className: 'uds-auth-btn uds-auth-btn-primary',
+ style: { width: 'auto', margin: 0 },
+ onClick: () => { setPage(1); setQ(qDraft.trim()) },
+ }, '\u641c\u7d22'),
+ ),
+ error && h('div', { className: 'uds-auth-settings-msg err', role: 'alert' }, error),
+ loading
+ ? h('div', { className: 'uds-auth-settings-empty' }, '\u52a0\u8f7d\u4e2d...')
+ : h('table', { className: 'uds-auth-table' },
+ h('thead', null, h('tr', null, h('th', null, '\u5de5\u53f7'), h('th', null, '\u89d2\u8272'), h('th', null, '\u64cd\u4f5c'))),
+ h('tbody', null, users.length === 0
+ ? h('tr', null, h('td', { colSpan: 3 }, '\u6682\u65e0\u7528\u6237'))
+ : users.map((u) => h('tr', { key: u.empNo },
+ h('td', null, u.empNo),
+ h('td', null,
+ h('select', {
+ value: u.role,
+ onChange: async (e) => {
+ try {
+ await fetchJson('/uds-auth/api/users/role', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify({ empNo: u.empNo, role: e.target.value }),
+ })
+ reload()
+ } catch (err) { window.alert(err.data?.error || err.message) }
+ },
+ },
+ h('option', { value: 'user' }, '\u666e\u901a\u7528\u6237'),
+ h('option', { value: 'admin' }, '\u7ba1\u7406\u5458'),
+ h('option', { value: 'super_admin' }, '\u8d85\u7ea7\u7ba1\u7406\u5458'),
+ ),
+ ),
+ h('td', null,
+ h('button', {
+ type: 'button', className: 'uds-auth-del',
+ onClick: async () => {
+ if (!window.confirm('\u786e\u8ba4\u5220\u9664 ' + u.empNo + '?')) return
+ try {
+ await fetchJson('/uds-auth/api/users/delete', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify({ empNo: u.empNo }),
+ })
+ reload()
+ } catch (err) { window.alert(err.data?.error || err.message) }
+ },
+ }, '\u5220\u9664'),
+ ),
+ )),
+ ),
+ ),
+ h('div', { className: 'uds-auth-pager' },
+ h('span', null, '\u5171 ' + total + ' \u4eba\uff0c\u7b2c ' + page + ' / ' + totalPages + ' \u9875'),
+ h('span', null,
+ h('button', {
+ type: 'button', disabled: page <= 1 || loading,
+ onClick: () => setPage((p) => Math.max(1, p - 1)),
+ }, '\u4e0a\u4e00\u9875'),
+ ' ',
+ h('button', {
+ type: 'button', disabled: page >= totalPages || loading,
+ onClick: () => setPage((p) => p + 1),
+ }, '\u4e0b\u4e00\u9875'),
+ ),
+ ),
+ h('div', { className: 'uds-auth-add' },
+ h('input', { value: newEmpNo, placeholder: '\u5de5\u53f7', onChange: (e) => setNewEmpNo(e.target.value) }),
+ h('select', { value: newRole, onChange: (e) => setNewRole(e.target.value) },
+ h('option', { value: 'user' }, '\u666e\u901a\u7528\u6237'),
+ h('option', { value: 'admin' }, '\u7ba1\u7406\u5458'),
+ h('option', { value: 'super_admin' }, '\u8d85\u7ea7\u7ba1\u7406\u5458'),
+ ),
+ h('button', {
+ type: 'button', className: 'uds-auth-btn uds-auth-btn-primary', style: { width: 'auto', margin: 0 },
+ onClick: async () => {
+ const empNo = newEmpNo.trim()
+ if (!empNo) return
+ try {
+ await fetchJson('/uds-auth/api/users', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify({ empNo, role: newRole }),
+ })
+ setNewEmpNo('')
+ reload()
+ } catch (err) { window.alert(err.data?.error || err.message) }
+ },
+ }, '\u6dfb\u52a0'),
+ ),
+ )
+ }
+
+ function AuthSettingsSection() {
+ const [me, setMe] = useState(null)
+ const [form, setForm] = useState({
+ uacBaseUrl: '',
+ userSearchUrl: '',
+ loginSystemCode: '',
+ originSystemCode: '',
+ })
+ const [fallbackEnabled, setFallbackEnabled] = useState(false)
+ const [fallbackPwd, setFallbackPwd] = useState('')
+ const [msg, setMsg] = useState('')
+ const [msgKind, setMsgKind] = useState('')
+ const [busy, setBusy] = useState(false)
+
+ useEffect(() => {
+ let cancelled = false
+ ;(async () => {
+ try {
+ const data = await fetchJson('/uds-auth/api/me')
+ if (!cancelled) setMe(data?.data || null)
+ } catch {
+ if (!cancelled) setMe(null)
+ }
+ try {
+ const cfg = await fetchJson('/uds-auth/config.get')
+ if (!cancelled && cfg?.value) setForm((prev) => ({ ...prev, ...cfg.value }))
+ } catch { /* ignore */ }
+ try {
+ const st = await fetchJson('/uds-auth/api/fallback/status')
+ if (!cancelled) setFallbackEnabled(!!st.enabled)
+ } catch { /* ignore */ }
+ })()
+ return () => { cancelled = true }
+ }, [])
+
+ const perms = me?.permissions || {}
+ const canManage = !!perms.canManageUsers
+ const canSettings = !!perms.canAccessSettings
+
+ const saveConfig = async () => {
+ setBusy(true)
+ setMsg('')
+ try {
+ await fetchJson('/uds-auth/api/config', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify(form),
+ })
+ setMsgKind('ok')
+ setMsg('\u914d\u7f6e\u5df2\u4fdd\u5b58')
+ } catch (err) {
+ setMsgKind('err')
+ setMsg(err.data?.error || err.message || '\u4fdd\u5b58\u5931\u8d25')
+ } finally {
+ setBusy(false)
+ }
+ }
+
+ const field = (key, label) => h('div', { className: 'uds-auth-settings-field' },
+ h('label', { htmlFor: 'uds-auth-' + key }, label),
+ h('input', {
+ id: 'uds-auth-' + key,
+ value: form[key] || '',
+ disabled: !canSettings || busy,
+ onChange: (e) => setForm((prev) => ({ ...prev, [key]: e.target.value })),
+ }),
+ )
+
+ return h('section', { className: 'uds-auth-settings', 'aria-label': 'UDS Auth' },
+ h('header', null,
+ h('h2', null, 'UDS \u8ba4\u8bc1'),
+ h('p', { className: 'uds-auth-settings-intro' },
+ '\u5de5\u53f7+token \u53cc\u6821\u9a8c\uff1bUAC \u6302\u6b7b\u65f6\u7528\u5e94\u6025\u8d26\u53f7 administrator \u5bc6\u7801\u767b\u5f55\u3002'),
+ ),
+ !me && h('div', { className: 'uds-auth-settings-empty' }, '\u8bf7\u5148\u767b\u5f55\u540e\u67e5\u770b\u6b64\u9875'),
+ me && !canSettings && !canManage && h('div', { className: 'uds-auth-settings-empty' }, '\u5f53\u524d\u8d26\u53f7\u65e0\u8bbe\u7f6e\u6743\u9650'),
+ canSettings && h('div', { className: 'uds-auth-settings-card' },
+ h('h3', null, '\u90e8\u7f72\u914d\u7f6e'),
+ field('uacBaseUrl', 'UAC Base URL'),
+ field('userSearchUrl', '\u7528\u6237\u641c\u7d22 URL\uff08token \u6821\u9a8c\uff09'),
+ field('loginSystemCode', 'loginSystemCode'),
+ field('originSystemCode', 'originSystemCode'),
+ h('div', { className: 'uds-auth-settings-actions' },
+ h('button', {
+ type: 'button',
+ className: 'uds-auth-btn uds-auth-btn-primary',
+ style: { width: 'auto', margin: 0 },
+ disabled: busy,
+ onClick: saveConfig,
+ }, busy ? '\u4fdd\u5b58\u4e2d...' : '\u4fdd\u5b58\u914d\u7f6e'),
+ msg && h('span', { className: 'uds-auth-settings-msg ' + msgKind }, msg),
+ ),
+ ),
+ canManage && h('div', { className: 'uds-auth-settings-card' },
+ h('h3', null, '\u5e94\u6025\u767b\u5f55\uff08UAC \u4e0d\u53ef\u7528\uff09'),
+ h('p', { className: 'uds-auth-settings-intro' },
+ '\u72b6\u6001\uff1a' + (fallbackEnabled ? '\u5df2\u542f\u7528' : '\u672a\u8bbe\u7f6e\u5bc6\u7801\uff08\u672a\u542f\u7528\uff09')
+ + '\u3002\u7528\u6237\u540d\u56fa\u5b9a\u4e3a administrator\uff0c\u4ec5\u5728\u626b\u7801\u4e0d\u53ef\u7528\u65f6\u4ece\u767b\u5f55\u9762\u677f\u5207\u6362\u3002'),
+ h('div', { className: 'uds-auth-settings-field' },
+ h('label', { htmlFor: 'uds-auth-fallback-pwd' }, '\u5e94\u6025\u5bc6\u7801\uff08\u81f3\u5c11 6 \u4f4d\uff09'),
+ h('input', {
+ id: 'uds-auth-fallback-pwd',
+ type: 'password',
+ value: fallbackPwd,
+ onChange: (e) => setFallbackPwd(e.target.value),
+ autoComplete: 'new-password',
+ }),
+ ),
+ h('div', { className: 'uds-auth-settings-actions' },
+ h('button', {
+ type: 'button',
+ className: 'uds-auth-btn uds-auth-btn-primary',
+ style: { width: 'auto', margin: 0 },
+ onClick: async () => {
+ try {
+ await fetchJson('/uds-auth/api/fallback/password', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify({ password: fallbackPwd }),
+ })
+ setFallbackPwd('')
+ setFallbackEnabled(true)
+ window.alert('\u5e94\u6025\u5bc6\u7801\u5df2\u8bbe\u7f6e')
+ } catch (err) { window.alert(err.data?.error || err.message) }
+ },
+ }, '\u4fdd\u5b58\u5e94\u6025\u5bc6\u7801'),
+ fallbackEnabled && h('button', {
+ type: 'button',
+ className: 'uds-auth-btn uds-auth-btn-danger',
+ style: { width: 'auto', margin: 0 },
+ onClick: async () => {
+ if (!window.confirm('\u786e\u8ba4\u6e05\u9664\u5e94\u6025\u5bc6\u7801\uff1f')) return
+ try {
+ await fetchJson('/uds-auth/api/fallback/clear', { method: 'POST' })
+ setFallbackEnabled(false)
+ } catch (err) { window.alert(err.data?.error || err.message) }
+ },
+ }, '\u6e05\u9664'),
+ ),
+ ),
+ canManage && h(UserManagementPanel, null),
+ )
+ }
+
+ function AuthBadge() {
+ const rootRef = useRef(null)
+ const [open, setOpen] = useState(false)
+ const [anchor, setAnchor] = useState(null)
+ const [besideBetterSidebar, setBesideBetterSidebar] = useState(() => !!document.querySelector('[data-dsh-toggle-cluster]'))
+ const [user, setUser] = useState(null)
+ const [loading, setLoading] = useState(true)
+ const [config, setConfig] = useState({ loginSystemCode: '100000455558', originSystemCode: '' })
+ const [qrStatus, setQrStatus] = useState('')
+ const [qrImg, setQrImg] = useState('')
+ const [loginMode, setLoginMode] = useState('qr')
+ const [fallbackEnabled, setFallbackEnabled] = useState(false)
+ const [fbUser, setFbUser] = useState('administrator')
+ const [fbPass, setFbPass] = useState('')
+ const [fbBusy, setFbBusy] = useState(false)
+ const [fbErr, setFbErr] = useState('')
+ const qrRef = useRef({ key: null, value: null, timer: null })
+
+ const stopQr = useCallback(() => {
+ if (qrRef.current.timer) { clearInterval(qrRef.current.timer); qrRef.current.timer = null }
+ qrRef.current.key = null
+ qrRef.current.value = null
+ }, [])
+
+ const refreshUser = useCallback(async () => {
+ try {
+ const me = await fetchJson('/uds-auth/api/me')
+ if (!me?.authenticated || !me?.data) {
+ setUser(null)
+ return
+ }
+ const d = me.data
+ setUser({
+ empNo: d.empNo || d.userId,
+ userName: d.displayName || d.username || d.userName || d.empNo,
+ department: d.department || '',
+ email: d.email || '',
+ phone: d.phone || '',
+ role: d.role || 'user',
+ permissions: d.permissions || {},
+ })
+ } catch {
+ setUser(null)
+ } finally {
+ setLoading(false)
+ }
+ }, [])
+
+ const startQr = useCallback(async () => {
+ stopQr()
+ setQrStatus('\u6b63\u5728\u751f\u6210\u4e8c\u7ef4\u7801...')
+ setQrImg('')
+ try {
+ const started = await fetchJson('/uds-auth/qr-start')
+ const { qrCodeStr, qrCodeKey, qrCodeValue, loginSystemCode, originSystemCode } = started
+ qrRef.current.key = qrCodeKey
+ qrRef.current.value = qrCodeValue
+ setQrImg('/uds-auth/qr?data=' + encodeURIComponent(qrCodeStr))
+ setQrStatus('\u8bf7\u4f7f\u7528 iCenter \u626b\u7801\u767b\u5f55...')
+ qrRef.current.timer = setInterval(async () => {
+ if (!qrRef.current.key) return
+ try {
+ const verify = await fetchJson(
+ '/uds-auth/verify-code?qrCodeKey=' + encodeURIComponent(qrRef.current.key)
+ + '&qrCodeValue=' + encodeURIComponent(qrRef.current.value)
+ + '&loginClientIp=' + encodeURIComponent('127.0.0.1')
+ + '&loginSystemCode=' + encodeURIComponent(loginSystemCode || config.loginSystemCode)
+ + '&originSystemCode=' + encodeURIComponent(originSystemCode || config.originSystemCode || ''),
+ )
+ const result = await fetchJson('/uds-auth/qr-proxy', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify({
+ qrCodeKey: qrRef.current.key,
+ qrCodeValue: qrRef.current.value,
+ loginClientIp: '127.0.0.1',
+ originSystemCode: originSystemCode || config.originSystemCode || '',
+ loginSystemCode: loginSystemCode || config.loginSystemCode,
+ verifyCode: verify.verifyCode,
+ }),
+ })
+ const codeCode = result.code?.code || ''
+ const boCode = result.bo?.code || ''
+ if (codeCode === '0000' && boCode === '0000') {
+ stopQr()
+ const other = result.other || {}
+ const empNo = other.account || other.empNo || ''
+ const token = other.token || other.authValue || ''
+ if (empNo && token) {
+ setCookie('PORTALSSOUser', empNo, 7)
+ setCookie('PORTALSSOCookie', token, 7)
+ setQrStatus('\u767b\u5f55\u6210\u529f\uff01')
+ await refreshUser()
+ setOpen(false)
+ } else {
+ setQrStatus('\u7f3a\u5c11 token\uff0c\u65e0\u6cd5\u5b8c\u6210\u6821\u9a8c')
+ }
+ return
+ }
+ if (codeCode === '0000' && boCode === '4002') {
+ setQrStatus('\u7b49\u5f85\u626b\u7801...')
+ return
+ }
+ if (codeCode === '0000' && boCode === '1002') {
+ stopQr()
+ setQrStatus('\u4e8c\u7ef4\u7801\u5df2\u8fc7\u671f\uff0c\u8bf7\u5237\u65b0')
+ return
+ }
+ stopQr()
+ setQrStatus(result.bo?.msg || boCode || '\u767b\u5f55\u5931\u8d25')
+ } catch {
+ setQrStatus('\u7f51\u7edc\u9519\u8bef...')
+ }
+ }, 2000)
+ } catch (err) {
+ setQrStatus(err.message || '\u751f\u6210\u4e8c\u7ef4\u7801\u5931\u8d25')
+ }
+ }, [config.loginSystemCode, config.originSystemCode, refreshUser, stopQr])
+
+ const submitFallback = useCallback(async () => {
+ setFbBusy(true)
+ setFbErr('')
+ try {
+ await fetchJson('/uds-auth/api/fallback/login', {
+ method: 'POST',
+ headers: { 'Content-Type': 'application/json' },
+ body: JSON.stringify({ username: fbUser.trim(), password: fbPass }),
+ })
+ setFbPass('')
+ await refreshUser()
+ setOpen(false)
+ } catch (err) {
+ setFbErr(err.data?.error || err.message || '\u767b\u5f55\u5931\u8d25')
+ } finally {
+ setFbBusy(false)
+ }
+ }, [fbUser, fbPass, refreshUser])
+
+ useEffect(() => {
+ refreshUser()
+ fetchJson('/uds-auth/config.get')
+ .then((data) => { if (data?.value) setConfig((prev) => ({ ...prev, ...data.value })) })
+ .catch(() => {})
+ fetchJson('/uds-auth/api/fallback/status')
+ .then((st) => setFallbackEnabled(!!st.enabled))
+ .catch(() => {})
+ const obs = new MutationObserver(() => {
+ setBesideBetterSidebar(!!document.querySelector('[data-dsh-toggle-cluster]'))
+ })
+ obs.observe(document.documentElement, { childList: true, subtree: true })
+ return () => { stopQr(); obs.disconnect() }
+ }, [refreshUser, stopQr])
+
+ useEffect(() => {
+ if (open && !user && loginMode === 'qr') startQr()
+ if (!open || loginMode !== 'qr') stopQr()
+ }, [open, user, loginMode, startQr, stopQr])
+
+ useLayoutEffect(() => {
+ if (!open) { setAnchor(null); return undefined }
+ const place = () => {
+ const rect = rootRef.current?.getBoundingClientRect()
+ if (!rect) return
+ setAnchor({
+ left: Math.max(8, Math.min(rect.right - 300, window.innerWidth - 308)),
+ top: Math.min(rect.bottom + 8, window.innerHeight - 80),
+ })
+ }
+ place()
+ window.addEventListener('resize', place)
+ window.addEventListener('scroll', place, true)
+ return () => {
+ window.removeEventListener('resize', place)
+ window.removeEventListener('scroll', place, true)
+ }
+ }, [open])
+
+ useOutsideClose(rootRef, open, setOpen)
+
+ const displayName = user
+ ? (user.userName || user.name || ('\u7528\u6237' + user.empNo))
+ : (loading ? '...' : '\u672a\u767b\u5f55')
+ const initials = String(displayName).slice(0, 2).toUpperCase()
+ const label = roleLabel(user?.role)
+ const perms = user?.permissions || {}
+
+ return h('div', {
+ ref: rootRef,
+ className: besideBetterSidebar ? 'uds-auth-host has-better-sidebar' : 'uds-auth-host',
+ 'data-uds-auth-host': 'top-right',
+ },
+ open && anchor && h('section', {
+ className: 'uds-auth-panel',
+ style: { left: anchor.left, top: anchor.top },
+ 'aria-label': 'UDS',
+ },
+ !user
+ ? (loginMode === 'qr'
+ ? h(React.Fragment, null,
+ h('div', { className: 'uds-auth-info' },
+ h('div', { className: 'uds-auth-info-name' }, '\u672a\u767b\u5f55'),
+ h('div', { className: 'uds-auth-info-detail' }, '\u8bf7\u626b\u7801\u767b\u5f55'),
+ ),
+ h('div', { className: 'uds-auth-qr' },
+ qrImg ? h('img', { src: qrImg, alt: 'QR' }) : null,
+ h('div', { className: 'uds-auth-qr-status' }, qrStatus || '\u52a0\u8f7d\u4e2d...'),
+ h('button', { type: 'button', className: 'uds-auth-btn uds-auth-btn-primary', onClick: startQr }, '\u5237\u65b0\u4e8c\u7ef4\u7801'),
+ ),
+ fallbackEnabled && h('button', {
+ type: 'button',
+ className: 'uds-auth-btn-link',
+ onClick: () => { stopQr(); setLoginMode('fallback'); setFbErr('') },
+ }, 'UAC \u4e0d\u53ef\u7528\uff1f\u5e94\u6025\u8d26\u53f7\u767b\u5f55'),
+ )
+ : h(React.Fragment, null,
+ h('div', { className: 'uds-auth-info' },
+ h('div', { className: 'uds-auth-info-name' }, '\u5e94\u6025\u767b\u5f55'),
+ h('div', { className: 'uds-auth-info-detail' }, 'UAC / \u626b\u7801\u4e0d\u53ef\u7528\u65f6\u4f7f\u7528'),
+ ),
+ h('div', { className: 'uds-auth-fallback' },
+ h('label', { htmlFor: 'uds-fb-user' }, '\u7528\u6237\u540d'),
+ h('input', {
+ id: 'uds-fb-user',
+ value: fbUser,
+ onChange: (e) => setFbUser(e.target.value),
+ autoComplete: 'username',
+ }),
+ h('label', { htmlFor: 'uds-fb-pass' }, '\u5bc6\u7801'),
+ h('input', {
+ id: 'uds-fb-pass',
+ type: 'password',
+ value: fbPass,
+ onChange: (e) => setFbPass(e.target.value),
+ autoComplete: 'current-password',
+ onKeyDown: (e) => { if (e.key === 'Enter') submitFallback() },
+ }),
+ fbErr && h('div', { className: 'uds-auth-settings-msg err' }, fbErr),
+ h('p', { className: 'uds-auth-fallback-hint' },
+ '\u9ed8\u8ba4\u7528\u6237\u540d administrator\uff1b\u5bc6\u7801\u5728\u300c\u8bbe\u7f6e \u2192 UDS \u8ba4\u8bc1\u300d\u7531\u8d85\u7ba1\u9884\u5148\u914d\u7f6e\u3002'),
+ h('button', {
+ type: 'button',
+ className: 'uds-auth-btn uds-auth-btn-primary',
+ style: { width: '100%', margin: '12px 0 0' },
+ disabled: fbBusy,
+ onClick: submitFallback,
+ }, fbBusy ? '\u767b\u5f55\u4e2d...' : '\u767b\u5f55'),
+ ),
+ h('button', {
+ type: 'button',
+ className: 'uds-auth-btn-link',
+ onClick: () => setLoginMode('qr'),
+ }, '\u8fd4\u56de\u626b\u7801\u767b\u5f55'),
+ ))
+ : h(React.Fragment, null,
+ h('div', { className: 'uds-auth-info' },
+ h('div', { className: 'uds-auth-info-name' }, displayName),
+ h('div', { className: 'uds-auth-info-detail' }, h('span', { className: 'uds-auth-info-detail-label' }, '\u5de5\u53f7'), user.empNo || '-'),
+ h('div', { className: 'uds-auth-info-detail' }, h('span', { className: 'uds-auth-info-detail-label' }, '\u89d2\u8272'), label || user.role || '-'),
+ user.department && h('div', { className: 'uds-auth-info-detail' }, h('span', { className: 'uds-auth-info-detail-label' }, '\u90e8\u95e8'), user.department),
+ ),
+ (perms.canManageUsers || perms.canAccessSettings) && h('button', {
+ type: 'button', className: 'uds-auth-btn',
+ onClick: () => { window.location.href = '/settings' },
+ }, '\u8bbe\u7f6e / \u7528\u6237\u7ba1\u7406'),
+ h('button', {
+ type: 'button', className: 'uds-auth-btn uds-auth-btn-danger',
+ onClick: async () => {
+ try { await fetchJson('/uds-auth/api/logout', { method: 'POST' }) } catch { /* ignore */ }
+ clearAuthCookies()
+ window.location.reload()
+ },
+ }, '\u9000\u51fa\u767b\u5f55'),
+ ),
+ ),
+ h('button', {
+ type: 'button',
+ className: 'uds-auth-badge' + (user ? '' : ' uds-auth-badge-unauth'),
+ 'aria-expanded': open,
+ 'aria-label': 'UDS',
+ onClick: () => setOpen((v) => !v),
+ },
+ h('span', { className: 'uds-auth-avatar' }, user ? initials : '?'),
+ h('span', { className: 'uds-auth-badge-label' }, displayName),
+ label ? h('span', { className: 'uds-auth-role uds-auth-role-' + user.role }, label) : null,
+ ),
+ )
+ }
+
+ function apply(ctx) {
+ ctx.effect(() => {
+ const tag = document.createElement('style')
+ tag.id = 'uds-auth-client-css'
+ tag.setAttribute('data-plugin', name)
+ tag.textContent = CSS
+ document.head.appendChild(tag)
+ return () => tag.remove()
+ }, 'uds-auth: styles')
+
+ ctx.slots.inject('shell.overlay', () => ctx.slots.register({
+ name: 'shell.overlay',
+ id: 'uds-auth-login',
+ order: 50,
+ label: 'UDS',
+ }, AuthBadge))
+
+ ctx.slots.inject('settings.section', () => ctx.slots.register({
+ name: 'settings.section',
+ id: 'uds-auth',
+ order: 22,
+ label: 'UDS \u8ba4\u8bc1',
+ icon: 'users',
+ }, AuthSettingsSection))
+ }
+
+ exports.name = name
+ exports.inject = inject
+ exports.apply = apply
+ return module.exports
+ },
+})
diff --git a/uds-auth/lib/client.js.bak b/uds-auth/lib/client.js.bak
deleted file mode 100644
index 40ac7c70..00000000
--- a/uds-auth/lib/client.js.bak
+++ /dev/null
@@ -1,904 +0,0 @@
-/**
- * uds-auth Client Plugin - User info display + QR code login
- * Includes embedded QR code library
- */
-(function() {
- // QR Code Library - Minimal but functional implementation
- var QRCodeLib = (function() {
- var ALPHANUMERIC = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:';
-
- function QRCode(data) {
- this.data = data;
- this.modules = null;
- this.moduleCount = 0;
- this.version = 1;
- }
-
- QRCode.prototype.getMinimumVersion = function() {
- var len = this.data.length;
- if (len <= 25) return 1;
- if (len <= 47) return 2;
- if (len <= 77) return 3;
- if (len <= 114) return 4;
- if (len <= 154) return 5;
- if (len <= 195) return 6;
- if (len <= 224) return 7;
- return 8;
- };
-
- QRCode.prototype.make = function() {
- this.version = this.getMinimumVersion();
- this.moduleCount = this.version * 4 + 17;
- this.modules = [];
-
- for (var r = 0; r < this.moduleCount; r++) {
- this.modules[r] = new Array(this.moduleCount);
- for (var c = 0; c < this.moduleCount; c++) {
- this.modules[r][c] = null;
- }
- }
-
- // Add finder patterns with separator
- this.addFinderPatternWithSeparator(0, 0);
- this.addFinderPatternWithSeparator(this.moduleCount - 7, 0);
- this.addFinderPatternWithSeparator(0, this.moduleCount - 7);
-
- // Timing patterns
- for (var i = 8; i < this.moduleCount - 8; i++) {
- if (this.modules[6][i] === null) this.modules[6][i] = (i % 2 === 0);
- if (this.modules[i][6] === null) this.modules[i][6] = (i % 2 === 0);
- }
-
- // Alignment patterns
- var alignPos = this.getAlignmentPositions();
- for (var ai = 0; ai < alignPos.length; ai++) {
- for (var aj = 0; aj < alignPos.length; aj++) {
- var row = alignPos[ai], col = alignPos[aj];
- if (this.modules[row][col] === null) {
- this.addAlignmentPattern(row, col);
- }
- }
- }
-
- // Dark module
- this.modules[this.moduleCount - 8][8] = true;
-
- // Reserve format info areas
- this.reserveFormatAreas();
-
- // Place data
- var bits = this.createData();
- this.placeData(bits, 0);
- };
-
- QRCode.prototype.addFinderPatternWithSeparator = function(row, col) {
- for (var r = -1; r <= 8; r++) {
- for (var c = -1; c <= 8; c++) {
- var tr = row + r, tc = col + c;
- if (tr < 0 || tr >= this.moduleCount || tc < 0 || tc >= this.moduleCount) continue;
- if (r === -1 || r === 8 || c === -1 || c === 8) {
- this.modules[tr][tc] = false; // separator
- } else if (r >= 0 && r < 7 && c >= 0 && c < 7) {
- var inside = (r >= 1 && r <= 5 && (c === 1 || c === 5)) ||
- (c >= 1 && c <= 5 && (r === 1 || r === 5)) ||
- (r >= 2 && r <= 4 && c >= 2 && c <= 4);
- this.modules[tr][tc] = inside;
- } else {
- this.modules[tr][tc] = true;
- }
- }
- }
- };
-
- QRCode.prototype.addAlignmentPattern = function(row, col) {
- for (var r = -2; r <= 2; r++) {
- for (var c = -2; c <= 2; c++) {
- var tr = row + r, tc = col + c;
- if (tr < 0 || tr >= this.moduleCount || tc < 0 || tc >= this.moduleCount) continue;
- if (r === -2 || r === 2 || c === -2 || c === 2) {
- this.modules[tr][tc] = true;
- } else if (r === 0 && c === 0) {
- this.modules[tr][tc] = true;
- } else {
- this.modules[tr][tc] = false;
- }
- }
- }
- };
-
- QRCode.prototype.getAlignmentPositions = function() {
- if (this.version === 1) return [];
- var positions = [];
- var step = Math.ceil((this.version * 4 + 10) / (Math.floor(this.version / 7) + 1));
- step = Math.ceil(step / 2) * 2;
- var last = this.moduleCount - 7;
- for (var pos = last; pos >= 0; pos -= step) {
- positions.unshift(pos);
- }
- if (positions[0] !== 6) positions.unshift(6);
- return positions;
- };
-
- QRCode.prototype.reserveFormatAreas = function() {
- // Reserve format info around finder patterns
- for (var i = 0; i < 9; i++) {
- if (this.modules[8][i] === null) this.modules[8][i] = null; // reserved
- if (this.modules[i][8] === null) this.modules[i][8] = null; // reserved
- }
- for (var i = 0; i < 8; i++) {
- if (this.modules[this.moduleCount - 1 - i][8] === null) this.modules[this.moduleCount - 1 - i][8] = null;
- if (this.modules[8][this.moduleCount - 1 - i] === null) this.modules[8][this.moduleCount - 1 - i] = null;
- }
- };
-
- QRCode.prototype.createData = function() {
- var bits = [];
- // Mode: alphanumeric
- bits.push(0, 0, 0, 1, 0);
- // Length
- var len = this.data.length;
- var lenBits = this.version <= 9 ? 8 : 16;
- for (var i = lenBits - 1; i >= 0; i--) {
- bits.push((len >> i) & 1);
- }
- // Data
- for (var i = 0; i < this.data.length; i += 2) {
- var c1 = this.data.charAt(i);
- var c2 = this.data.charAt(i + 1) || '';
- var v1 = ALPHANUMERIC.indexOf(c1);
- if (v1 < 0) v1 = 0;
- var v2 = ALPHANUMERIC.indexOf(c2);
- if (v2 < 0) v2 = 0;
- var val = v1 * 45 + v2;
- var bin = val.toString(2);
- while (bin.length < 11) bin = '0' + bin;
- for (var j = 0; j < 11; j++) {
- bits.push(bin.charAt(j) === '1' ? 1 : 0);
- }
- }
- // Terminator
- var capacity = this.getDataCapacity();
- bits.push(0, 0, 0, 0);
- // Pad to byte boundary
- while (bits.length % 8 !== 0) bits.push(0);
- // Pad codewords
- var pad1 = [1, 1, 0, 0, 0, 1, 0, 0];
- var pad2 = [0, 0, 0, 1, 0, 0, 0, 1];
- while (bits.length < capacity) {
- for (var i = 0; i < 8 && bits.length < capacity; i++) bits.push(pad1[i]);
- for (var i = 0; i < 8 && bits.length < capacity; i++) bits.push(pad2[i]);
- }
- return bits.slice(0, capacity);
- };
-
- QRCode.prototype.getDataCapacity = function() {
- var capacities = [0, 152, 272, 440, 640, 864, 1088, 1248, 1552, 1856, 2192];
- return capacities[this.version] || 272;
- };
-
- QRCode.prototype.placeData = function(bits, maskPattern) {
- var upward = true;
- var col = this.moduleCount - 1;
- var bitIndex = 0;
-
- while (col > 0) {
- if (col === 6) col = 5; // skip timing column
-
- for (var row = upward ? this.moduleCount - 1 : 0;
- upward ? row >= 0 : row < this.moduleCount;
- row += upward ? -1 : 1) {
- for (var c = 0; c < 2; c++) {
- var currentCol = col - c;
- if (this.modules[row][currentCol] === null) {
- var dark = bitIndex < bits.length ? bits[bitIndex++] === 1 : false;
- if (this.getMask(maskPattern, row, currentCol)) dark = !dark;
- this.modules[row][currentCol] = dark;
- }
- }
- }
- col -= 2;
- upward = !upward;
- }
- };
-
- QRCode.prototype.getMask = function(pattern, row, col) {
- switch (pattern) {
- case 0: return (row + col) % 2 === 0;
- case 1: return row % 2 === 0;
- case 2: return col % 3 === 0;
- case 3: return (row + col) % 3 === 0;
- case 4: return (Math.floor(row / 2) + Math.floor(col / 3)) % 2 === 0;
- case 5: return ((row * col) % 2 + (row * col) % 3) === 0;
- case 6: return (((row * col) % 2 + (row * col) % 3) % 2) === 0;
- case 7: return (((row * col) % 3 + (row + col) % 2) % 2) === 0;
- default: return false;
- }
- };
-
- QRCode.prototype.isDark = function(row, col) {
- if (row < 0 || row >= this.moduleCount || col < 0 || col >= this.moduleCount) return false;
- return this.modules[row][col] === true;
- };
-
- QRCode.prototype.getModuleCount = function() {
- return this.moduleCount;
- };
-
- return function(data) {
- return new QRCode(data);
- };
- })();
-
- function createQR(data, canvas, size) {
- size = size || 160;
- var qr = QRCodeLib(data);
- qr.make();
- var ctx = canvas.getContext('2d');
- var count = qr.getModuleCount();
- var tileSize = size / count;
- canvas.width = size;
- canvas.height = size;
- ctx.fillStyle = '#ffffff';
- ctx.fillRect(0, 0, size, size);
- ctx.fillStyle = '#000000';
- for (var row = 0; row < count; row++) {
- for (var col = 0; col < count; col++) {
- if (qr.isDark(row, col)) {
- ctx.fillRect(Math.floor(col * tileSize), Math.floor(row * tileSize), Math.ceil(tileSize), Math.ceil(tileSize));
- }
- }
- }
- return true;
- }
-
- window.__ModuleLoader__.load({
- id: 'uds-auth',
- factory: function(require) {
- var module = { exports: {} };
- var exports = module.exports;
- Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-
- var name = 'uds-auth';
- var COOKIE_EMP_NO = 'PORTALSSOUser';
- var COOKIE_AUTH_VALUE = 'PORTALSSOCookie';
- var ALT_COOKIE_EMP_NO = 'ZTEDPGSSOUser';
- var ALT_COOKIE_AUTH_VALUE = 'ZTEDPGSSOCookie';
- var UAC_VERIFY_URL = 'https://uac.zte.com.cn/uacqr/auth/qrcode/verify.serv';
- var LOGIN_SYSTEM_CODE = '100000455558';
-
- var CSS = '.uds-auth-badge{display:flex;align-items:center;gap:6px;padding:4px 10px;border-radius:4px;background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));border:1px solid var(--dsw-alias-border-l2,#dfe1e5);color:var(--dsw-alias-label-primary,#1f2329);font-size:13px;cursor:pointer;font-weight:500;transition:all .15s}.uds-auth-badge:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}.uds-auth-badge-unauth{color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-badge-unauth:hover{color:var(--dsw-alias-label-secondary,#646a73)}.uds-auth-avatar{width:22px;height:22px;border-radius:50%;background:linear-gradient(135deg,var(--dsw-alias-state-business-primary,#3370ff),var(--dsw-alias-state-success-primary,#20a162));display:flex;align-items:center;justify-content:center;font-size:10px;font-weight:700;color:#fff}.uds-auth-badge-unauth .uds-auth-avatar{background:var(--dsw-alias-bg-module-platform,rgba(242,243,245,1));color:var(--dsw-alias-label-tertiary,#8f959e)}.uds-auth-role-badge{font-size:10px;padding:1px 6px;border-radius:10px;font-weight:600}.uds-auth-role-super_admin{background:rgba(213,73,65,.12);color:var(--dsw-alias-state-error-primary,#d54941)}.uds-auth-role-admin{background:rgba(217,119,6,.12);color:var(--dsw-alias-state-warn-primary,#d97706)}.uds-auth-role-fallback_admin{background:rgba(51,112,255,.12);color:var(--dsw-alias-state-business-primary,#3370ff)}.uds-auth-dropdown{position:absolute;top:100%;right:0;margin-top:8px;background:var(--dsw-alias-bg-layer-1,#fff);border-radius:8px;border:1px solid var(--dsw-alias-border-l2,#dee0e3);box-shadow:0 8px 28px rgba(0,0,0,.08);min-width:220px;z-index:1000;overflow:hidden}.uds-auth-info{padding:14px 16px;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3)}.uds-auth-info-name{font-weight:600;margin-bottom:4px;color:var(--dsw-alias-label-primary,#1f2329);font-size:14px}.uds-auth-info-detail{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:2px}.uds-auth-info-detail-label{color:var(--dsw-alias-label-tertiary,#8f959e);margin-right:4px}.uds-auth-settings-btn{width:100%;padding:8px 16px;border:none;background:transparent;color:var(--dsw-alias-state-business-primary,#3370ff);font-size:13px;cursor:pointer;transition:background .15s;text-align:left}.uds-auth-settings-btn:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}.uds-auth-logout{width:100%;padding:10px 16px;border:none;background:transparent;color:var(--dsw-alias-state-error-primary,#d54941);font-size:13px;cursor:pointer;transition:background .15s}.uds-auth-logout:hover{background:rgba(213,73,65,.08)}.uds-auth-qr-container{text-align:center;padding:16px}.uds-auth-qr-canvas{margin:0 auto 12px;display:block}.uds-auth-qr-status{font-size:12px;color:var(--dsw-alias-label-secondary,#646a73);margin-top:8px}.uds-auth-qr-refresh{background:none;border:none;color:var(--dsw-alias-state-business-primary,#3370ff);cursor:pointer;font-size:12px;margin-top:8px;padding:4px 8px}.uds-auth-qr-refresh:hover{text-decoration:underline}.uds-auth-modal{position:fixed;top:0;left:0;right:0;bottom:0;background:rgba(0,0,0,.4);z-index:9999;display:flex;align-items:center;justify-content:center}.uds-auth-modal-content{background:var(--dsw-alias-bg-layer-1,#fff);border:1px solid var(--dsw-alias-border-l2,#dee0e3);border-radius:8px;padding:20px;max-width:600px;width:90%;max-height:80vh;overflow:auto}.uds-auth-user-table{width:100%;border-collapse:collapse;font-size:13px}.uds-auth-user-table th,.uds-auth-user-table td{padding:8px;border-bottom:1px solid var(--dsw-alias-border-l1,#eef0f3);text-align:left}.uds-auth-user-table th{color:var(--dsw-alias-label-tertiary,#8f959e);font-weight:500}.uds-auth-del-btn{background:rgba(213,73,65,.1);color:var(--dsw-alias-state-error-primary,#d54941);border:none;padding:4px 10px;border-radius:4px;cursor:pointer;font-size:12px;margin-left:8px}.uds-auth-del-btn:hover{background:rgba(213,73,65,.18)}.uds-auth-add-user{margin-top:16px;display:flex;gap:8px}.uds-auth-add-user input,.uds-auth-add-user select{background:var(--dsw-alias-bg-layer-1,#fff);border:1px solid var(--dsw-alias-border-l2,#dfe1e5);color:var(--dsw-alias-label-primary,#1f2329);padding:6px 10px;border-radius:4px;font-size:13px}.uds-auth-add-user button{background:var(--dsw-alias-bg-layer-1,#fff);color:var(--dsw-alias-state-business-primary,#3370ff);border:1px solid var(--dsw-alias-border-l2,#dfe1e5);padding:6px 14px;border-radius:4px;cursor:pointer;font-size:13px}.uds-auth-add-user button:hover{background:var(--dsw-alias-interactive-bg-hover,rgba(247,248,250,1))}';
-
- function getCookie(name) {
- var cookieName = encodeURIComponent(name) + '=';
- var cookieStart = document.cookie.indexOf(cookieName);
- if (cookieStart === -1) return null;
- var cookieEnd = document.cookie.indexOf(';', cookieStart);
- if (cookieEnd === -1) cookieEnd = document.cookie.length;
- return decodeURIComponent(document.cookie.substring(cookieStart + cookieName.length, cookieEnd));
- }
-
- function setCookie(name, value, days) {
- var expires = '';
- if (days) {
- var date = new Date();
- date.setTime(date.getTime() + (days * 24 * 60 * 60 * 1000));
- expires = '; expires=' + date.toUTCString();
- }
- document.cookie = encodeURIComponent(name) + '=' + encodeURIComponent(value) + expires + '; path=/';
- }
-
- function getEmpNo() {
- return getCookie(COOKIE_EMP_NO) || getCookie(ALT_COOKIE_EMP_NO) || null;
- }
-
- function injectCss() {
- if (!document.getElementById('uds-auth-styles')) {
- var style = document.createElement('style');
- style.id = 'uds-auth-styles';
- style.textContent = CSS;
- document.head.appendChild(style);
- }
- }
-
- function findHeaderArea() {
- var selectors = ['[class*="headerUtilities"]', '[class*="header-actions"]', '[class*="sessionHeader"]'];
- for (var i = 0; i < selectors.length; i++) {
- var el = document.querySelector(selectors[i]);
- if (el) return el;
- }
- return null;
- }
-
- function updateBadge(user) {
- var badge = document.querySelector('#uds-auth-badge .uds-auth-badge');
- var dropdown = document.getElementById('uds-auth-dropdown');
- if (!badge || !dropdown) return;
-
- if (!user) {
- badge.innerHTML = '?未登录';
- badge.className = 'uds-auth-badge uds-auth-badge-unauth';
- dropdown.innerHTML = '' +
- '';
- initQRLogin();
- return;
- }
-
- var displayName = user.userName || user.name || '用户' + user.empNo;
- var initials = displayName.slice(0, 2).toUpperCase();
- var role = user.role || 'user';
- var perms = user.permissions || {};
-
- // 角色标签
- var roleLabel = { super_admin: '超管', admin: '管理员', fallback_admin: '兜底', user: '' }[role] || '';
- var roleBadge = roleLabel ? '' + roleLabel + '' : '';
-
- badge.innerHTML = '' + initials + '' + displayName + '' + roleBadge;
- badge.className = 'uds-auth-badge';
-
- var info = '' + displayName + '
';
- info += '
工号' + (user.empNo || '-') + '
';
- info += '
角色' + roleLabel + '
';
- if (user.department) info += '
部门' + user.department + '
';
- if (user.email) info += '
邮箱' + user.email + '
';
- if (user.phone) info += '
手机' + user.phone + '
';
- info += '
';
-
- // 用户管理入口 (super_admin only)
- if (perms.canManageUsers) {
- info += '';
- }
- // 设置入口 (admin+ only)
- if (perms.canAccessSettings) {
- info += '';
- }
- info += '';
- dropdown.innerHTML = info;
-
- var settingsBtn = document.getElementById('uds-goto-settings-btn');
- if (settingsBtn) settingsBtn.onclick = function() { window.open('/settings', '_self'); };
-
- var mgmtBtn = document.getElementById('uds-user-mgmt-btn');
- if (mgmtBtn) mgmtBtn.onclick = function() { openUserManagement(); };
-
- var logoutBtn = document.getElementById('uds-logout-btn');
- if (logoutBtn) {
- logoutBtn.onclick = function() {
- setCookie(COOKIE_EMP_NO, '', -1);
- setCookie(COOKIE_AUTH_VALUE, '', -1);
- setCookie(ALT_COOKIE_EMP_NO, '', -1);
- setCookie(ALT_COOKIE_AUTH_VALUE, '', -1);
- setCookie('UDS_FALLBACK_USER', '', -1);
- location.reload();
- };
- }
- }
-
- function openUserManagement() {
- fetch('/uds-auth/api/users')
- .then(function(r) { return r.json(); })
- .then(function(data) {
- var users = data.users || [];
- var html = '用户管理
';
- html += '
| 工号 | 角色 | 操作 |
';
- users.forEach(function(u) {
- var roleLabel = { super_admin: '超级管理员', admin: '管理员', user: '普通用户', fallback_admin: '兜底管理员' }[u.role] || u.role;
- var rolesOpts = '' +
- '' +
- '';
- html += '| ' + u.empNo + ' | ' + roleLabel + ' | ' +
- ' ' +
- ' |
';
- });
- html += '
';
- html += '
';
- html += '
';
-
- var panel = document.createElement('div');
- panel.className = 'uds-auth-modal';
- panel.innerHTML = '' + html + '
';
- document.body.appendChild(panel);
- panel.onclick = function(e) { if (e.target === panel) panel.remove(); };
- })
- .catch(function(err) { alert('加载用户列表失败: ' + err.message); });
- }
-
- // 全局 API 供 onclick 用
- window.udsChangeRole = function(empNo, role) {
- fetch('/uds-auth/api/users/role', {
- method: 'POST',
- headers: { 'Content-Type': 'application/json' },
- body: JSON.stringify({ empNo: empNo, role: role })
- }).then(function(r) { return r.json(); })
- .then(function(d) { if (d.error) alert(d.error); else alert(d.message); openUserManagement(); })
- .catch(function(err) { alert('操作失败: ' + err.message); });
- };
- window.udsDeleteUser = function(empNo) {
- if (!confirm('确认删除用户 ' + empNo + '?')) return;
- fetch('/uds-auth/api/users/delete', {
- method: 'POST',
- headers: { 'Content-Type': 'application/json' },
- body: JSON.stringify({ empNo: empNo })
- }).then(function(r) { return r.json(); })
- .then(function(d) { if (d.error) alert(d.error); else alert(d.message); openUserManagement(); })
- .catch(function(err) { alert('操作失败: ' + err.message); });
- };
- window.udsAddUser = function() {
- var empNo = document.getElementById('uds-new-empno').value.trim();
- var role = document.getElementById('uds-new-role').value;
- if (!empNo) return;
- fetch('/uds-auth/api/users', {
- method: 'POST',
- headers: { 'Content-Type': 'application/json' },
- body: JSON.stringify({ empNo: empNo, role: role })
- }).then(function(r) { return r.json(); })
- .then(function(d) { if (d.error) alert(d.error); else openUserManagement(); })
- .catch(function(err) { alert('操作失败: ' + err.message); });
- };
-
- var currentQRKey = null;
- var currentQRValue = null;
- var qrPollingTimer = null;
-
- function generateUUID() {
- return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, function(c) {
- var r = Math.random() * 16 | 0;
- var v = c === 'x' ? r : (r & 0x3 | 0x8);
- return v.toString(16);
- });
- }
-
- function md5(str) {
- function md5cycle(x, k) {
- var a = x[0], b = x[1], c = x[2], d = x[3];
- a = ff(a, b, c, d, k[0], 7, -680876936); d = ff(d, a, b, c, k[1], 12, -389564586);
- c = ff(c, d, a, b, k[2], 17, 606105819); b = ff(b, c, d, a, k[3], 22, -1044525330);
- a = ff(a, b, c, d, k[4], 7, -176418897); d = ff(d, a, b, c, k[5], 12, 1200080426);
- c = ff(c, d, a, b, k[6], 17, -1473231341); b = ff(b, c, d, a, k[7], 22, -45705983);
- a = ff(a, b, c, d, k[8], 7, 1770035416); d = ff(d, a, b, c, k[9], 12, -1958414417);
- c = ff(c, d, a, b, k[10], 17, -42063); b = ff(b, c, d, a, k[11], 22, -1990404162);
- a = ff(a, b, c, d, k[12], 7, 1804603682); d = ff(d, a, b, c, k[13], 12, -40341101);
- c = ff(c, d, a, b, k[14], 17, -1502002290); b = ff(b, c, d, a, k[15], 22, 1236535329);
- a = gg(a, b, c, d, k[1], 5, -165796510); d = gg(d, a, b, c, k[6], 9, -1069501632);
- c = gg(c, d, a, b, k[11], 14, 643717713); b = gg(b, c, d, a, k[0], 20, -373897302);
- a = gg(a, b, c, d, k[5], 5, -701558691); d = gg(d, a, b, c, k[10], 9, 38016083);
- c = gg(c, d, a, b, k[15], 14, -660478335); b = gg(b, c, d, a, k[4], 20, -405537848);
- a = gg(a, b, c, d, k[9], 5, 568446438); d = gg(d, a, b, c, k[14], 9, -1019803690);
- c = gg(c, d, a, b, k[3], 14, -187363961); b = gg(b, c, d, a, k[8], 20, 1163531501);
- a = gg(a, b, c, d, k[13], 5, -1444681467); d = gg(d, a, b, c, k[2], 9, -51403784);
- c = gg(c, d, a, b, k[7], 14, 1735328473); b = gg(b, c, d, a, k[12], 20, -1926607734);
- a = hh(a, b, c, d, k[5], 4, -378558); d = hh(d, a, b, c, k[8], 11, -2022574463);
- c = hh(c, d, a, b, k[11], 16, 1839030562); b = hh(b, c, d, a, k[14], 23, -35309556);
- a = hh(a, b, c, d, k[1], 4, -1530992060); d = hh(d, a, b, c, k[4], 11, 1272893353);
- c = hh(c, d, a, b, k[7], 16, -155497632); b = hh(b, c, d, a, k[10], 23, -1094730640);
- a = hh(a, b, c, d, k[13], 4, 681279174); d = hh(d, a, b, c, k[0], 11, -358537222);
- c = hh(c, d, a, b, k[3], 16, -722521979); b = hh(b, c, d, a, k[6], 23, 76029189);
- a = hh(a, b, c, d, k[9], 4, -640364487); d = hh(d, a, b, c, k[12], 11, -421815835);
- c = hh(c, d, a, b, k[15], 16, 530742520); b = hh(b, c, d, a, k[2], 23, -995338651);
- a = ii(a, b, c, d, k[0], 6, -198630844); d = ii(d, a, b, c, k[7], 10, 1126891415);
- c = ii(c, d, a, b, k[14], 15, -1416354905); b = ii(b, c, d, a, k[3], 21, -57434055);
- a = ii(a, b, c, d, k[10], 6, 1700485571); d = ii(d, a, b, c, k[1], 10, -1894986606);
- c = ii(c, d, a, b, k[8], 15, -1051523); b = ii(b, c, d, a, k[15], 21, -2054922799);
- a = ii(a, b, c, d, k[6], 6, 1873313359); d = ii(d, a, b, c, k[13], 10, -30611744);
- c = ii(c, d, a, b, k[4], 15, -1560198380); b = ii(b, c, d, a, k[11], 21, 1309151649);
- a = ii(a, b, c, d, k[2], 6, -145523070); d = ii(d, a, b, c, k[9], 10, -1120210379);
- c = ii(c, d, a, b, k[0], 15, 718787259); b = ii(b, c, d, a, k[7], 21, -343485551);
- x[0] = add32(a, x[0]); x[1] = add32(b, x[1]); x[2] = add32(c, x[2]); x[3] = add32(d, x[3]);
- }
- function cmn(q, a, b, x, s, t) { a = add32(add32(a, q), add32(x, t)); return add32((a << s) | (a >>> (32 - s)), b); }
- function ff(a, b, c, d, x, s, t) { return cmn((b & c) | ((~b) & d), a, b, x, s, t); }
- function gg(a, b, c, d, x, s, t) { return cmn((b & d) | (c & (~d)), a, b, x, s, t); }
- function hh(a, b, c, d, x, s, t) { return cmn(b ^ c ^ d, a, b, x, s, t); }
- function ii(a, b, c, d, x, s, t) { return cmn(c ^ (b | (~d)), a, b, x, s, t); }
- function md51(s) {
- var n = s.length, state = [1732584193, -271733879, -1732584194, 271733878], i;
- for (i = 64; i <= s.length; i += 64) md5cycle(state, md5blk(s.substring(i - 64, i)));
- s = s.substring(i - 64);
- var tail = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];
- for (i = 0; i < s.length; i++) tail[i >> 2] |= s.charCodeAt(i) << ((i % 4) << 3);
- tail[i >> 2] |= 0x80 << ((i % 4) << 3);
- if (i > 55) { md5cycle(state, tail); tail = [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]; }
- tail[14] = n * 8; md5cycle(state, tail);
- return state;
- }
- function md5blk(s) {
- var md5blks = [], i;
- for (i = 0; i < 64; i += 4) md5blks[i >> 2] = s.charCodeAt(i) + (s.charCodeAt(i + 1) << 8) + (s.charCodeAt(i + 2) << 16) + (s.charCodeAt(i + 3) << 24);
- return md5blks;
- }
- var hex_chr = '0123456789abcdef'.split('');
- function rhex(n) { var s = '', j = 0; for (; j < 4; j++) s += hex_chr[(n >> (j * 8 + 4)) & 0x0F] + hex_chr[(n >> (j * 8)) & 0x0F]; return s; }
- function hex(x) { for (var i = 0; i < x.length; i++) x[i] = rhex(x[i]); return x.join(''); }
- function add32(a, b) { return (a + b) & 0xFFFFFFFF; }
- return hex(md51(str));
- }
-
- // SHA256 implementation for verifyCode
- function sha256(str) {
- function rotl(n, s) { return (n << s) | (n >>> (32 - s)); }
- function sha256_0(x, y, z) { return (x & y) ^ (~x & z); }
- function sha256_1(x, y, z) { return (x & y) ^ (x & z) ^ (y & z); }
- function sha256_2(x) { return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10); }
- function sha256_3(x) { return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7); }
- function sha256_4(x) { return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10); }
- function sha256_5(x) { return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7); }
- function sha256_6(x) { return (x >>> 2 | x << 30) ^ (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13); }
- function sha256_7(x) { return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3); }
-
- 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 h = [0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19];
-
- var msg = [];
- for (var i = 0; i < str.length; i++) {
- msg.push(str.charCodeAt(i));
- }
- var msgLen = msg.length;
- var bitLen = msgLen * 8;
-
- msg.push(0x80);
- while ((msg.length % 64) !== 56) msg.push(0);
- for (var i = 7; i >= 0; i--) msg.push((bitLen >>> (i * 8)) & 0xff);
-
- for (var i = 0; i < msg.length; i += 64) {
- var w = [];
- for (var j = 0; j < 16; j++) {
- w[j] = (msg[i + j * 4] << 24) | (msg[i + j * 4 + 1] << 16) | (msg[i + j * 4 + 2] << 8) | msg[i + j * 4 + 3];
- }
- for (var j = 16; j < 64; j++) {
- var s0 = sha256_7(w[j - 15]);
- var s1 = sha256_6(w[j - 2]);
- w[j] = (w[j - 16] + s0 + w[j - 7] + s1) & 0xffffffff;
- }
-
- var a = h[0], b = h[1], c = h[2], d = h[3], e = h[4], f = h[5], g = h[6], hh = h[7];
-
- for (var j = 0; j < 64; j++) {
- var s1 = sha256_3(e);
- var ch = sha256_0(e, f, g);
- var temp1 = (hh + s1 + ch + K[j] + w[j]) & 0xffffffff;
- var s0 = sha256_2(a);
- var maj = sha256_1(a, b, c);
- var temp2 = (s0 + maj) & 0xffffffff;
-
- hh = g; g = f; f = e; e = (d + temp1) & 0xffffffff;
- d = c; c = b; b = a; a = (temp1 + temp2) & 0xffffffff;
- }
-
- h[0] = (h[0] + a) & 0xffffffff;
- h[1] = (h[1] + b) & 0xffffffff;
- h[2] = (h[2] + c) & 0xffffffff;
- h[3] = (h[3] + d) & 0xffffffff;
- h[4] = (h[4] + e) & 0xffffffff;
- h[5] = (h[5] + f) & 0xffffffff;
- h[6] = (h[6] + g) & 0xffffffff;
- h[7] = (h[7] + hh) & 0xffffffff;
- }
-
- var hex = '0123456789abcdef';
- var result = '';
- for (var i = 0; i < 8; i++) {
- result += hex[(h[i] >>> 28) & 0xf];
- result += hex[(h[i] >>> 24) & 0xf];
- result += hex[(h[i] >>> 20) & 0xf];
- result += hex[(h[i] >>> 16) & 0xf];
- result += hex[(h[i] >>> 12) & 0xf];
- result += hex[(h[i] >>> 8) & 0xf];
- result += hex[(h[i] >>> 4) & 0xf];
- result += hex[h[i] & 0xf];
- }
- return result;
- }
-
- function initQRLogin() {
- var canvas = document.getElementById('qr-canvas');
- var qrStatus = document.getElementById('qr-status');
- var refreshBtn = document.getElementById('qr-refresh');
- if (!canvas || !qrStatus) { setTimeout(initQRLogin, 500); return; }
- if (refreshBtn) refreshBtn.onclick = startQRLogin;
- startQRLogin();
- }
-
- // 从本地 vendor 加载 jQuery 和 UAC md5 插件
- function loadUACMd5Plugin() {
- return new Promise(function(resolve, reject) {
- function ensureJQuery(callback) {
- if (window.jQuery) { callback(window.jQuery); return; }
- var script = document.createElement('script');
- script.src = '/uds-auth/vendor/jquery.min.js';
- script.onload = function() { callback(window.jQuery); };
- script.onerror = function() { reject(new Error('Failed to load jQuery')); };
- document.head.appendChild(script);
- }
-
- ensureJQuery(function($) {
- if ($.md5QrCode) { resolve($); return; }
- var script = document.createElement('script');
- script.src = '/uds-auth/vendor/jquery.md5.min.js';
- script.onload = function() { resolve($); };
- script.onerror = function() { reject(new Error('Failed to load UAC md5 plugin')); };
- document.head.appendChild(script);
- });
- });
- }
-
- function startQRLogin() {
- var canvas = document.getElementById('qr-canvas');
- var qrStatus = document.getElementById('qr-status');
- if (!canvas || !qrStatus) return;
- if (qrPollingTimer) { clearInterval(qrPollingTimer); qrPollingTimer = null; }
-
- qrStatus.textContent = '正在生成二维码...';
-
- loadUACMd5Plugin()
- .then(function($) {
- var qrCodeStr = $.md5QrCode('TwoDIMAuth');
- var parts = qrCodeStr.split(':');
- currentQRKey = parts[1];
- currentQRValue = parts[2];
-
- qrStatus.textContent = '请使用iCenter扫码登录...';
-
- var container = canvas.parentElement;
- if (container) {
- canvas.style.display = 'none';
- var img = container.querySelector('.uds-auth-qr-img');
- if (!img) {
- img = document.createElement('img');
- img.className = 'uds-auth-qr-img';
- img.style.width = '160px';
- img.style.height = '160px';
- img.style.margin = '0 auto';
- img.style.display = 'block';
- container.insertBefore(img, qrStatus);
- }
- img.src = '/uds-auth/qr?data=' + encodeURIComponent(qrCodeStr);
-
- qrPollingTimer = setInterval(pollQRStatus, 2000);
- }
- })
- .catch(function(err) {
- qrStatus.textContent = '加载加密插件失败';
- });
- }
-
- function pollQRStatus() {
- var qrStatus = document.getElementById('qr-status');
- if (!qrStatus || !currentQRKey) return;
-
- var source = currentQRKey + currentQRValue + '127.0.0.1' + LOGIN_SYSTEM_CODE + '';
- var verifyCode = window.jQuery ? window.jQuery.verfiyCode(source) : null;
-
- var bodyPromise;
- if (verifyCode) {
- bodyPromise = Promise.resolve(JSON.stringify({
- qrCodeKey: currentQRKey,
- qrCodeValue: currentQRValue,
- loginClientIp: '127.0.0.1',
- originSystemCode: '',
- loginSystemCode: LOGIN_SYSTEM_CODE,
- verifyCode: verifyCode
- }));
- } else {
- var verifyUrl = '/uds-auth/verify-code?qrCodeKey=' + encodeURIComponent(currentQRKey) + '&qrCodeValue=' + encodeURIComponent(currentQRValue) + '&loginClientIp=127.0.0.1&loginSystemCode=' + LOGIN_SYSTEM_CODE;
- bodyPromise = fetch(verifyUrl)
- .then(function(r) { return r.json(); })
- .then(function(data) {
- return JSON.stringify({
- qrCodeKey: currentQRKey,
- qrCodeValue: currentQRValue,
- loginClientIp: '127.0.0.1',
- originSystemCode: '',
- loginSystemCode: LOGIN_SYSTEM_CODE,
- verifyCode: data.verifyCode
- });
- });
- }
-
- bodyPromise.then(function(body) {
- return fetch('/uds-auth/qr-proxy', { method: 'POST', headers: { 'Content-Type': 'application/json' }, body: body });
- })
- .then(function(r) { return r.json(); })
- .then(handleQRResult)
- .catch(function(err) {
- if (qrStatus) qrStatus.textContent = '网络错误,重试中...';
- });
- }
-
- function handleQRResult(result) {
- var qrStatus = document.getElementById('qr-status');
- if (!qrStatus) return;
-
- var code = result.code || {};
- var codeCode = code.code || '';
- var bo = result.bo || {};
- var boCode = bo.code || '';
- var boMsg = bo.msg || '';
-
- // 成功
- if (codeCode === '0000' && boCode === '0000') {
- clearInterval(qrPollingTimer); qrPollingTimer = null;
- currentQRKey = null; currentQRValue = null;
- var other = result.other || {};
- var empNo = other.account || other.empNo || '';
- var token = other.token || other.authValue || '';
- if (empNo) {
- setCookie(COOKIE_EMP_NO, empNo, 7);
- if (token) setCookie(COOKIE_AUTH_VALUE, token, 7);
- qrStatus.textContent = '登录成功!';
- fetchUserAndPermissions(function(user) { updateBadge(user); });
- }
- return;
- }
-
- // 等待扫码
- if (codeCode === '0000' && boCode === '4002') {
- qrStatus.textContent = '等待扫码...';
- return;
- }
-
- // 二维码已过期
- if (codeCode === '0000' && boCode === '1002') {
- clearInterval(qrPollingTimer); qrPollingTimer = null;
- qrStatus.textContent = '二维码已过期,请点击刷新';
- currentQRKey = null; currentQRValue = null;
- return;
- }
-
- // 其他可恢复错误:继续轮询
- if (codeCode !== '0000') {
- return;
- }
-
- // 其他 bo.code 错误:停止轮询
- clearInterval(qrPollingTimer); qrPollingTimer = null;
- qrStatus.textContent = '⚠️ ' + (boMsg || boCode || '登录失败') + ',请刷新重试';
- }
-
- function getAuthToken() {
- return getCookie(COOKIE_AUTH_VALUE) || getCookie(ALT_COOKIE_AUTH_VALUE) || null;
- }
-
- function fetchUserAndPermissions(cb) {
- var empNo = getEmpNo();
- if (!empNo) { updateBadge(null); return; }
- // 先拉 /api/me 拿 role/permissions
- fetch('/uds-auth/api/me')
- .then(function(r) { return r.json(); })
- .then(function(me) {
- var permissions = me?.data?.permissions || {};
- var role = me?.data?.role || 'user';
- cb({ empNo: empNo, userName: null, role: role, permissions: permissions });
- // 再拉详细用户信息
- fetchUserInfo(function(user) {
- cb(Object.assign({ role: role, permissions: permissions }, user));
- });
- })
- .catch(function() { fetchUserInfo(cb); });
- }
-
- function fetchUserInfo(cb) {
- var empNo = getEmpNo();
- if (!empNo) { updateBadge(null); return; }
- var token = getAuthToken();
- var url = '/uds-auth/user-info?empNo=' + encodeURIComponent(empNo);
- if (token) url += '&token=' + encodeURIComponent(token);
- fetch(url)
- .then(function(r) { return r.json(); })
- .then(function(result) {
- if (result.code && result.code.code === '0000' && result.bo && result.bo.length > 0) {
- var emp = result.bo[0];
- // icenterapi 返回字段名可能不一致,兼容多种常见命名
- var dept = emp.deptName || emp.deptShortName || emp.deptFullName
- || emp.orgName || emp.orgShortName || emp.orgNamePath || emp.deptNamePath
- || emp.departmentName || emp.department || '';
- var name = emp.name || emp.empName || emp.userName || emp.displayName || '用户' + empNo;
- var user = {
- empNo: emp.employeeShortId || emp.employeeNO || emp.employeeId || empNo,
- userName: name,
- department: dept,
- email: emp.email || emp.mail || '',
- phone: emp.mobile || emp.phone || emp.telephone || ''
- };
- if (cb) cb(user); else updateBadge(user);
- } else {
- var fallback = { empNo: empNo, userName: '用户' + empNo };
- if (cb) cb(fallback); else updateBadge(fallback);
- }
- })
- .catch(function() {
- var fallback = { empNo: empNo, userName: '用户' + empNo };
- if (cb) cb(fallback); else updateBadge(fallback);
- });
- }
-
- function injectBadge() {
- if (document.getElementById('uds-auth-badge')) return true;
- var headerArea = findHeaderArea();
- if (!headerArea) return false;
- var container = document.createElement('div');
- container.id = 'uds-auth-badge';
- container.style.cssText = 'position:relative;display:flex;align-items:center;margin-left:8px';
- var badge = document.createElement('button');
- badge.className = 'uds-auth-badge uds-auth-badge-unauth';
- badge.innerHTML = '...加载中';
- var dropdown = document.createElement('div');
- dropdown.id = 'uds-auth-dropdown';
- dropdown.className = 'uds-auth-dropdown';
- dropdown.style.display = 'none';
- dropdown.innerHTML = '';
- badge.onclick = function() { dropdown.style.display = dropdown.style.display === 'none' ? 'block' : 'none'; };
- container.appendChild(badge);
- container.appendChild(dropdown);
- headerArea.appendChild(container);
- fetchUserAndPermissions(function(user) { updateBadge(user); });
- return true;
- }
-
- function init() {
- injectCss();
- var timer = setInterval(function() { if (injectBadge()) clearInterval(timer); }, 500);
- }
-
- function apply(ctx) {
- // 兜底:无论 ctx.inject / connection 是否可用,都保证 init 被调用
- var inited = false;
- function safeInit() {
- if (inited) return;
- inited = true;
- try { init(); } catch (e) { console.error('[uds-auth] init error:', e); }
- }
- // 立即兜底:如果 connection 注入迟迟不到,3 秒后自行初始化
- var fallbackTimer = setTimeout(safeInit, 3000);
-
- try {
- if (ctx && typeof ctx.inject === 'function') {
- ctx.inject(['connection'], function(connCtx) {
- clearTimeout(fallbackTimer);
- try {
- var call = connCtx && connCtx.connection && connCtx.connection.rpc && connCtx.connection.rpc.call;
- function loadConfigAndInit() {
- if (typeof call !== 'function') { safeInit(); return; }
- call('/uds-auth', 'config.get').then(function(resp) {
- if (resp && resp.ok && resp.value) {
- var c = resp.value;
- if (c.loginSystemCode) LOGIN_SYSTEM_CODE = c.loginSystemCode;
- if (c.uacBaseUrl) UAC_VERIFY_URL = c.uacBaseUrl.replace(/\/$/, '') + '/uacqr/auth/qrcode/verify.serv';
- }
- safeInit();
- }).catch(function() { safeInit(); });
- }
- if (document.readyState === 'loading') document.addEventListener('DOMContentLoaded', loadConfigAndInit);
- else loadConfigAndInit();
- if (connCtx && typeof connCtx.effect === 'function') {
- connCtx.effect(function() {}, 'uds-auth client: rpc effect');
- }
- } catch (e) {
- console.error('[uds-auth] apply inject error:', e);
- safeInit();
- }
- });
- } else {
- clearTimeout(fallbackTimer);
- safeInit();
- }
- } catch (e) {
- console.error('[uds-auth] apply error:', e);
- clearTimeout(fallbackTimer);
- safeInit();
- }
- }
-
- exports.name = 'uds-auth';
- exports.inject = ['connection'];
- exports.apply = apply;
- return module.exports;
- }
- });
-})();
diff --git a/uds-auth/lib/index.js b/uds-auth/lib/index.js
index f1d5a091..97587b9b 100644
--- a/uds-auth/lib/index.js
+++ b/uds-auth/lib/index.js
@@ -21,6 +21,7 @@ function tryGet(ctx, name) {
try { return ctx.get(name) } catch { return undefined }
}
+/** Register /uds-auth once; caller must wrap in ctx.effect so reload disposes. */
function registerWebRoute(ctx) {
const register = (server) => {
const dispose = server.register({
@@ -114,25 +115,55 @@ let _apiHandlers = null
let _rolesStore = null
let _currentConfig = null
let _qrcodeLib = null
+let _logger = console
function buildVerifyUrl(uacBaseUrl, uacQrVerifyPath) {
if (/^https?:\/\//.test(uacQrVerifyPath)) return uacQrVerifyPath
return (uacBaseUrl.replace(/\/$/, '') + '/' + uacQrVerifyPath.replace(/^\//, ''))
}
-// Load qrcode library
+// Prefer npm `qrcode`; fall back to vendored copy if present.
async function loadQRCodeLib() {
if (_qrcodeLib) return _qrcodeLib
try {
- const libPath = resolve(__dirname, 'qrcode-lib', 'lib', 'browser.js')
- _qrcodeLib = require(libPath)
+ _qrcodeLib = require('qrcode')
return _qrcodeLib
- } catch (e) {
- console.error('[uds-auth] Failed to load qrcode library:', e)
- return null
+ } catch {
+ try {
+ const libPath = resolve(__dirname, 'qrcode-lib', 'lib', 'browser.js')
+ _qrcodeLib = require(libPath)
+ return _qrcodeLib
+ } catch (e) {
+ _logger.error?.('[uds-auth] Failed to load qrcode library:', e)
+ return null
+ }
}
}
+/** Start a UAC TwoDIMAuth QR challenge (no browser jQuery plugins required). */
+function createQrChallenge(config = _currentConfig || {}) {
+ const loginSystemCode = String(config.loginSystemCode || CONFIG_DEFAULTS.loginSystemCode)
+ const originSystemCode = String(config.originSystemCode || '')
+ const qrCodeKey = crypto.randomBytes(16).toString('hex')
+ const qrCodeValue = crypto.randomBytes(16).toString('hex')
+ const qrCodeStr = `TwoDIMAuth:${qrCodeKey}:${qrCodeValue}`
+ return { qrCodeStr, qrCodeKey, qrCodeValue, loginSystemCode, originSystemCode }
+}
+
+async function handleQrStart(req, res) {
+ if (req.method !== 'POST' && req.method !== 'GET') {
+ res.writeHead(405, { 'Content-Type': 'application/json' })
+ res.end(JSON.stringify({ error: 'Method not allowed' }))
+ return
+ }
+ const challenge = createQrChallenge(_currentConfig)
+ res.writeHead(200, {
+ 'Content-Type': 'application/json; charset=utf-8',
+ 'Cache-Control': 'no-store',
+ })
+ res.end(JSON.stringify(challenge))
+}
+
// CORS proxy for UAC API
async function handleQRProxy(req, res) {
if (req.method !== 'POST') {
@@ -410,33 +441,38 @@ async function handleFallbackLogin(req, res) {
return sendJSON(res, 401, { error: '用户名或密码错误' })
}
- // 登录成功:创建 session,角色 = fallback_admin (等同 super_admin)
+ // 登录成功:服务端会话 + HttpOnly cookie(禁止仅伪造 Cookie 提权)
const empNo = 'administrator'
const userContext = {
empNo,
username: 'Fallback Administrator',
+ displayName: '应急管理员',
isAuthenticated: true,
role: 'fallback_admin',
+ authMode: 'fallback',
authenticatedAt: new Date().toISOString(),
lastActiveAt: new Date().toISOString(),
}
await _sessionStore.setex(empNo, Math.floor(INTERNAL.session.cookieMaxAge / 1000), userContext)
- // 给浏览器设 cookie,让后续请求 auth-middleware 能识别
- res.setHeader('Set-Cookie', [
+ const maxAge = Math.floor(INTERNAL.session.cookieMaxAge / 1000)
+ const proto = String(req.headers['x-forwarded-proto'] || '')
+ const secure = proto === 'https' || req.socket?.encrypted === true
+ const parts = [
'UDS_FALLBACK_USER=administrator',
- `Max-Age=${Math.floor(INTERNAL.session.cookieMaxAge / 1000)}`,
+ `Max-Age=${maxAge}`,
'Path=/',
- 'Secure',
'HttpOnly',
'SameSite=Lax',
- ].join('; '))
+ ]
+ if (secure) parts.push('Secure')
+ res.setHeader('Set-Cookie', parts.join('; '))
sendJSON(res, 200, {
success: true,
empNo,
role: 'fallback_admin',
- message: '兜底管理员登录成功',
+ message: '应急管理员登录成功(UAC 不可用时使用)',
})
}
@@ -522,13 +558,13 @@ async function handleAllRoutes(req, res) {
function handleRequest(req, res) {
const ctx2 = { req, res }
_authMiddleware(ctx2, async () => {
- // 首次部署 bootstrap: 第一个有 UDS 凭证的用户 = super_admin
- if (ctx2.empNo && !ctx2.role) {
+ // 空表首位 = super_admin;其余首次登录写入 user
+ if (ctx2.empNo && ctx2.empNo !== 'administrator') {
const { role, bootstrapped } = await _rolesStore.bootstrapFirstUser(ctx2.empNo)
ctx2.role = role
ctx2.permissions = computePermissions(role)
if (bootstrapped) {
- ctx.logger?.info?.(`[uds-auth] BOOTSTRAP: ${ctx2.empNo} is now super_admin`)
+ _logger?.info?.(`[uds-auth] BOOTSTRAP: ${ctx2.empNo} is now super_admin`)
}
}
@@ -650,9 +686,9 @@ export async function apply(ctx, config = {}) {
let source = () => mergeConfig(config)
_currentConfig = source()
+ _logger = ctx.logger || console
ctx.logger?.info?.('[uds-auth] Loading...')
- // Settings 注册 + RPC 注册:不依赖 webServer
installSettingsSection(ctx, source(), {
setSource: (current) => {
source = typeof current === 'function' ? current : () => current
@@ -664,38 +700,20 @@ export async function apply(ctx, config = {}) {
}
})
- ctx.inject(['connection'], (connCtx) => {
- const rpc = connCtx.connection?.rpc
- if (!rpc || typeof rpc.handle !== 'function') {
- ctx.logger?.warn?.('[uds-auth] connection.rpc.handle unavailable — client config UI disabled')
- return
- }
- connCtx.effect(() => {
- const dispose = rpc.handle(UDS_AUTH_RPC_CHANNEL, async (endpoint) => {
- if (endpoint === 'config.get') {
- const c = source()
- return {
- ok: true,
- value: {
- uacBaseUrl: c.uacBaseUrl,
- userSearchUrl: c.userSearchUrl,
- loginSystemCode: c.loginSystemCode,
- originSystemCode: c.originSystemCode,
- }
- }
- }
- return { ok: false, error: 'unknown_endpoint' }
- })
- return () => dispose?.()
- }, 'uds-auth: rpc')
- })
-
- // 初始化内部服务(session store, roles, auth middleware 等)
+ // 勿在 connection.rpc 注册 /uds-auth(与 webServer prefix 冲突)
await initServices(ctx, source())
- // 注册 webServer 路由(可能 webServer 已就绪,也可能需要等待)
- registerWebRoute(ctx)
-
+ ctx.inject(['webServer'], (wctx) => {
+ wctx.effect(
+ () => wctx.webServer.register({
+ kind: 'prefix',
+ path: '/uds-auth',
+ handler: handleAllRoutes,
+ }),
+ 'uds-auth: web route',
+ )
+ })
+
ctx.logger?.info?.('[uds-auth] Host ready')
}
@@ -732,7 +750,9 @@ async function initServices(ctx, config) {
systemCode: config.loginSystemCode,
empNoHeader: INTERNAL.empNoHeader,
authValueHeader: INTERNAL.authValueHeader,
+ authMode: 'token+profile',
},
+ userSearchUrl: config.userSearchUrl,
session: INTERNAL.session,
}, _sessionStore, _rolesStore)
_apiHandlers = createApiHandlers({ session: INTERNAL.session }, _sessionStore, _rolesStore)
diff --git a/uds-auth/lib/middleware/auth-middleware.js b/uds-auth/lib/middleware/auth-middleware.js
index bae6efc0..d84144be 100644
--- a/uds-auth/lib/middleware/auth-middleware.js
+++ b/uds-auth/lib/middleware/auth-middleware.js
@@ -3,76 +3,186 @@ import { UdsValidator } from '../uds/validator.js'
import { ROLES, computePermissions } from '../roles.js'
/**
- * auth-middleware: 从 PORTALSSOUser (empNo) 取用户,注入 role/permissions
- *
- * 三条路径:
- * 1. 有 empNo + 有 session → 续期,注入
- * 2. 有 empNo + 无 session → 创建 session + bootstrap role
- * 3. 无 empNo → 未登录,交给下游
+ * auth-middleware
+ *
+ * 正常登录:Cookie 中必须同时有 empNo + token,并用 userSearchUrl
+ * (带 X-Emp-No / X-Auth-Value)拉用户详情;两者都成功才建会话。
+ *
+ * 兜底登录:仅认可已由 /api/fallback/login 写好的 administrator 会话;
+ * 禁止仅靠伪造 UDS_FALLBACK_USER Cookie 提权。
*/
export function createAuthMiddleware(config, sessionStore, rolesStore) {
const udsClient = new UdsClient(config.udsAuth)
const validatorConfig = {
...config.udsAuth,
- authMode: config.udsAuth?.authMode || 'trust',
+ authMode: config.udsAuth?.authMode || 'token+profile',
}
const udsValidator = new UdsValidator(validatorConfig)
- const { cookieMaxAge, slidingExpiration, slidingInterval } = config.session
+ const { cookieMaxAge, slidingExpiration } = config.session
+ const userSearchUrl = config.userSearchUrl || config.udsAuth?.userSearchUrl
+ const uacBaseUrl = config.udsAuth?.baseUrl || ''
function extractEmpNo(cookieHeader) {
- // 优先取 UDS 的 empNo,其次取 fallback administrator
const udsMatch = cookieHeader?.match(/(?:PORTALSSOUser|ZTEDPGSSOUser)=([^;]+)/)
- if (udsMatch) return decodeURIComponent(udsMatch[1].trim())
+ if (udsMatch) return { empNo: decodeURIComponent(udsMatch[1].trim()), kind: 'uds' }
const fbMatch = cookieHeader?.match(/UDS_FALLBACK_USER=([^;]+)/)
- if (fbMatch) return decodeURIComponent(fbMatch[1].trim())
+ if (fbMatch) return { empNo: decodeURIComponent(fbMatch[1].trim()), kind: 'fallback' }
return null
}
+ /**
+ * empNo + token → 调用户搜索接口;返回解析后的 profile 或 null
+ */
+ async function verifyEmpNoAndToken(empNo, token) {
+ if (!userSearchUrl || !empNo || !token) return null
+ try {
+ const targetUrl = new URL(userSearchUrl)
+ const body = JSON.stringify({
+ employeeShortId: empNo,
+ enableLabel: true,
+ keyword: empNo,
+ })
+ const headers = {
+ 'Content-Type': 'application/json;charset=UTF-8',
+ 'Content-Length': Buffer.byteLength(body),
+ [config.udsAuth?.empNoHeader || 'X-Emp-No']: empNo,
+ [config.udsAuth?.authValueHeader || 'X-Auth-Value']: token,
+ }
+ if (uacBaseUrl) {
+ headers.Origin = uacBaseUrl
+ headers.Referer = uacBaseUrl.replace(/\/?$/, '/')
+ }
+
+ const isHttps = targetUrl.protocol === 'https:'
+ const mod = await import(isHttps ? 'node:https' : 'node:http')
+ const result = await new Promise((resolve, reject) => {
+ const req = mod.request({
+ hostname: targetUrl.hostname,
+ port: targetUrl.port || (isHttps ? 443 : 80),
+ path: targetUrl.pathname + targetUrl.search,
+ method: 'POST',
+ headers,
+ timeout: 8000,
+ }, (res) => {
+ let data = ''
+ res.on('data', (c) => { data += c })
+ res.on('end', () => {
+ try { resolve(JSON.parse(data)) } catch { resolve(null) }
+ })
+ })
+ req.on('error', reject)
+ req.on('timeout', () => { req.destroy(); reject(new Error('user-info timeout')) })
+ req.write(body)
+ req.end()
+ })
+
+ const code = result?.code?.code || result?.code
+ if (code !== '0000' && code !== 0 && code !== '0') return null
+ const list = Array.isArray(result?.bo) ? result.bo
+ : Array.isArray(result?.bo?.rows) ? result.bo.rows
+ : []
+ if (!list.length) return null
+ const emp = list[0]
+ const resolvedEmpNo = String(
+ emp.employeeShortId || emp.employeeNO || emp.empUIID || emp.empNo || empNo,
+ ).trim()
+ // 工号必须对得上(防 token 有效但查了别人)
+ if (resolvedEmpNo && resolvedEmpNo !== String(empNo).trim()
+ && !String(empNo).includes(resolvedEmpNo)
+ && !resolvedEmpNo.includes(String(empNo).trim())) {
+ // 宽松:短工号/长工号互含即通过;完全无关则拒绝
+ const a = String(empNo).replace(/\D/g, '')
+ const b = resolvedEmpNo.replace(/\D/g, '')
+ if (!a || !b || !(a.includes(b) || b.includes(a))) return null
+ }
+ return {
+ empNo: String(empNo).trim(),
+ username: emp.name || emp.empName || emp.userName || empNo,
+ department: emp.deptName || emp.deptShortName || emp.orgName || emp.department || '',
+ email: emp.email || emp.mail || '',
+ phone: emp.mobile || emp.phone || '',
+ token,
+ }
+ } catch (err) {
+ console.warn('[uds-auth] verifyEmpNoAndToken failed:', err.message)
+ return null
+ }
+ }
+
async function authMiddleware(ctx, next) {
const { req } = ctx
const cookieHeader = req.headers.cookie || ''
- const empNo = extractEmpNo(cookieHeader)
+ const extracted = extractEmpNo(cookieHeader)
- if (!empNo) return next()
+ if (!extracted) return next()
- // 1. 有 session → 续期
- let userContext = await sessionStore.get(empNo)
+ // 1. 已有会话 → 滑动续期
+ let userContext = await sessionStore.get(extracted.empNo)
if (userContext) {
- if (slidingExpiration && userContext.lastActiveAt) {
- const lastActive = new Date(userContext.lastActiveAt).getTime()
- if (Date.now() - lastActive >= slidingInterval) {
- userContext.lastActiveAt = new Date().toISOString()
- await sessionStore.setex(empNo, Math.floor(cookieMaxAge / 1000), userContext)
- }
- }
- } else {
- // 2. 无 session → 创建
- // 信任模式下,empNo 来自我们自己的 QR 登录流程设置的 cookie,
- // 即使没有完整的 header 凭据也应建立会话。
- const credentials = udsValidator.extractCredentials(req)
- if (udsValidator.authMode === 'trust') {
- // trust 模式:只要有 empNo 就建立会话;token 可选
- userContext = udsValidator.buildUserContext(
- credentials || { empNo, token: '', lang: 'zh-CN' },
- false,
+ if (slidingExpiration) {
+ userContext.lastActiveAt = new Date().toISOString()
+ await sessionStore.setex(
+ extracted.empNo,
+ Math.floor(cookieMaxAge / 1000),
+ userContext,
)
- } else {
- // verify 模式:必须有有效凭据
- if (!credentials || !udsValidator.validateCredentials(credentials)) {
- return next()
- }
- userContext = udsValidator.buildUserContext(credentials, false)
}
- userContext.authenticatedAt = new Date().toISOString()
- userContext.lastActiveAt = new Date().toISOString()
- userContext.isAuthenticated = true
- await sessionStore.setex(empNo, Math.floor(cookieMaxAge / 1000), userContext)
+ const role = rolesStore.getRole(extracted.empNo)
+ ctx.userContext = userContext
+ ctx.empNo = extracted.empNo
+ ctx.role = role
+ ctx.permissions = computePermissions(role)
+ return next()
}
- // 注入 role + permissions
- const role = rolesStore.getRole(empNo)
+ // 2. 无会话
+ // 兜底 Cookie:绝不在这里建会话(必须走密码登录)
+ if (extracted.kind === 'fallback') {
+ return next()
+ }
+
+ // UDS:必须 empNo + token,且用户详情接口校验通过
+ const credentials = udsValidator.extractCredentials(req)
+ if (!credentials || !udsValidator.validateCredentials(credentials)) {
+ return next()
+ }
+ if (credentials.empNo !== extracted.empNo) {
+ return next()
+ }
+
+ const profile = await verifyEmpNoAndToken(credentials.empNo, credentials.token)
+ if (!profile) {
+ return next()
+ }
+
+ userContext = udsValidator.buildUserContext({
+ empNo: profile.empNo,
+ token: credentials.token,
+ lang: credentials.lang,
+ username: profile.username,
+ department: profile.department,
+ email: profile.email,
+ phone: profile.phone,
+ }, false)
+ userContext.username = profile.username
+ userContext.displayName = profile.username
+ userContext.department = profile.department
+ userContext.email = profile.email
+ userContext.phone = profile.phone
+ userContext.authenticatedAt = new Date().toISOString()
+ userContext.lastActiveAt = new Date().toISOString()
+ userContext.isAuthenticated = true
+ userContext.authMode = 'token+profile'
+
+ await sessionStore.setex(
+ profile.empNo,
+ Math.floor(cookieMaxAge / 1000),
+ userContext,
+ )
+
+ const role = rolesStore.getRole(profile.empNo)
ctx.userContext = userContext
- ctx.empNo = empNo
+ ctx.empNo = profile.empNo
ctx.role = role
ctx.permissions = computePermissions(role)
return next()
@@ -80,15 +190,14 @@ export function createAuthMiddleware(config, sessionStore, rolesStore) {
authMiddleware.udsClient = udsClient
authMiddleware.udsValidator = udsValidator
+ authMiddleware.verifyEmpNoAndToken = verifyEmpNoAndToken
return authMiddleware
}
-/**
- * 权限守卫 — 拦截非 super_admin 的管理 API
- * 用法: 在路由里 call guard(req, res, ctx, 'canManageUsers') → true 表示通过
- */
export function requirePermission(ctx, permission) {
if (!ctx?.permissions) return false
- if (permission === 'super_admin') return ctx.role === ROLES.SUPER_ADMIN || ctx.role === ROLES.FALLBACK_ADMIN
+ if (permission === 'super_admin') {
+ return ctx.role === ROLES.SUPER_ADMIN || ctx.role === ROLES.FALLBACK_ADMIN
+ }
return !!ctx.permissions[permission]
}
diff --git a/uds-auth/lib/qrcode-lib/README.md b/uds-auth/lib/qrcode-lib/README.md
deleted file mode 100644
index 510e6b9f..00000000
--- a/uds-auth/lib/qrcode-lib/README.md
+++ /dev/null
@@ -1,770 +0,0 @@
-# node-qrcode
-> QR code/2d barcode generator.
-
-[](http://travis-ci.org/soldair/node-qrcode)
-[](https://www.npmjs.com/package/qrcode)
-[](https://www.npmjs.com/package/qrcode)
-[](https://github.com/soldair/node-qrcode/blob/master/license)
-
-- [Highlights](#highlights)
-- [Installation](#installation)
-- [Usage](#usage)
-- [Error correction level](#error-correction-level)
-- [QR Code capacity](#qr-code-capacity)
-- [Encoding Modes](#encoding-modes)
-- [Binary data](#binary-data)
-- [Multibyte characters](#multibyte-characters)
-- [API](#api)
-- [GS1 QR Codes](#gs1-qr-codes)
-- [Credits](#credits)
-- [License](#license)
-
-## Highlights
-- Works on server and client (and react native with svg)
-- CLI utility
-- Save QR code as image
-- Support for Numeric, Alphanumeric, Kanji and Byte mode
-- Support for mixed modes
-- Support for chinese, cyrillic, greek and japanese characters
-- Support for multibyte characters (like emojis :smile:)
-- Auto generates optimized segments for best data compression and smallest QR Code size
-- App agnostic readability, QR Codes by definition are app agnostic
-
-## Installation
-Inside your project folder do:
-
-```shell
-npm install --save qrcode
-```
-
-or, install it globally to use `qrcode` from the command line to save qrcode images or generate ones you can view in your terminal.
-
-```shell
-npm install -g qrcode
-```
-
-## Usage
-### CLI
-
-```
-Usage: qrcode [options]
-
-QR Code options:
- -v, --qversion QR Code symbol version (1 - 40) [number]
- -e, --error Error correction level [choices: "L", "M", "Q", "H"]
- -m, --mask Mask pattern (0 - 7) [number]
-
-Renderer options:
- -t, --type Output type [choices: "png", "svg", "utf8"]
- -w, --width Image width (px) [number]
- -s, --scale Scale factor [number]
- -q, --qzone Quiet zone size [number]
- -l, --lightcolor Light RGBA hex color
- -d, --darkcolor Dark RGBA hex color
- --small Output smaller QR code to terminal [boolean]
-
-Options:
- -o, --output Output file
- -h, --help Show help [boolean]
- --version Show version number [boolean]
-
-Examples:
- qrcode "some text" Draw in terminal window
- qrcode -o out.png "some text" Save as png image
- qrcode -d F00 -o out.png "some text" Use red as foreground color
-```
-If not specified, output type is guessed from file extension.
-Recognized extensions are `png`, `svg` and `txt`.
-
-### Browser
-`node-qrcode` can be used in browser through module bundlers like [Browserify](https://github.com/substack/node-browserify) and [Webpack](https://github.com/webpack/webpack) or by including the precompiled bundle present in `build/` folder.
-
-#### Module bundlers
-```html
-
-
-
-
-
-
-
-```
-
-```javascript
-// index.js -> bundle.js
-var QRCode = require('qrcode')
-var canvas = document.getElementById('canvas')
-
-QRCode.toCanvas(canvas, 'sample text', function (error) {
- if (error) console.error(error)
- console.log('success!');
-})
-```
-
-#### Precompiled bundle
-```html
-
-
-
-
-```
-
-If you install through `npm`, precompiled files will be available in `node_modules/qrcode/build/` folder.
-
-The precompiled bundle have support for [Internet Explorer 10+, Safari 5.1+, and all evergreen browsers](https://browserl.ist/?q=defaults%2C+IE+%3E%3D+10%2C+Safari+%3E%3D+5.1).
-
-### NodeJS
-Require the module `qrcode`
-
-```javascript
-var QRCode = require('qrcode')
-
-QRCode.toDataURL('I am a pony!', function (err, url) {
- console.log(url)
-})
-```
-
-render a qrcode for the terminal
-```js
-var QRCode = require('qrcode')
-
-QRCode.toString('I am a pony!',{type:'terminal'}, function (err, url) {
- console.log(url)
-})
-```
-
-### ES6/ES7
-Promises and Async/Await can be used in place of callback function.
-
-```javascript
-import QRCode from 'qrcode'
-
-// With promises
-QRCode.toDataURL('I am a pony!')
- .then(url => {
- console.log(url)
- })
- .catch(err => {
- console.error(err)
- })
-
-// With async/await
-const generateQR = async text => {
- try {
- console.log(await QRCode.toDataURL(text))
- } catch (err) {
- console.error(err)
- }
-}
-```
-
-## Error correction level
-Error correction capability allows to successfully scan a QR Code even if the symbol is dirty or damaged.
-Four levels are available to choose according to the operating environment.
-
-Higher levels offer a better error resistance but reduce the symbol's capacity.
-If the chances that the QR Code symbol may be corrupted are low (for example if it is showed through a monitor)
-is possible to safely use a low error level such as `Low` or `Medium`.
-
-Possible levels are shown below:
-
-| Level | Error resistance |
-|------------------|:----------------:|
-| **L** (Low) | **~7%** |
-| **M** (Medium) | **~15%** |
-| **Q** (Quartile) | **~25%** |
-| **H** (High) | **~30%** |
-
-The percentage indicates the maximum amount of damaged surface after which the symbol becomes unreadable.
-
-Error level can be set through `options.errorCorrectionLevel` property.
-If not specified, the default value is `M`.
-
-```javascript
-QRCode.toDataURL('some text', { errorCorrectionLevel: 'H' }, function (err, url) {
- console.log(url)
-})
-```
-
-## QR Code capacity
-Capacity depends on symbol version and error correction level. Also encoding modes may influence the amount of storable data.
-
-The QR Code versions range from version **1** to version **40**.
-Each version has a different number of modules (black and white dots), which define the symbol's size.
-For version 1 they are `21x21`, for version 2 `25x25` e so on.
-Higher is the version, more are the storable data, and of course bigger will be the QR Code symbol.
-
-The table below shows the maximum number of storable characters in each encoding mode and for each error correction level.
-
-| Mode | L | M | Q | H |
-|--------------|------|------|------|------|
-| Numeric | 7089 | 5596 | 3993 | 3057 |
-| Alphanumeric | 4296 | 3391 | 2420 | 1852 |
-| Byte | 2953 | 2331 | 1663 | 1273 |
-| Kanji | 1817 | 1435 | 1024 | 784 |
-
-**Note:** Maximum characters number can be different when using [Mixed modes](#mixed-modes).
-
-QR Code version can be set through `options.version` property.
-If no version is specified, the more suitable value will be used. Unless a specific version is required, this option is not needed.
-
-```javascript
-QRCode.toDataURL('some text', { version: 2 }, function (err, url) {
- console.log(url)
-})
-```
-
-## Encoding modes
-Modes can be used to encode a string in a more efficient way.
-A mode may be more suitable than others depending on the string content.
-A list of supported modes are shown in the table below:
-
-| Mode | Characters | Compression |
-|--------------|-----------------------------------------------------------|-------------------------------------------|
-| Numeric | 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 | 3 characters are represented by 10 bits |
-| Alphanumeric | 0–9, A–Z (upper-case only), space, $, %, *, +, -, ., /, : | 2 characters are represented by 11 bits |
-| Kanji | Characters from the Shift JIS system based on JIS X 0208 | 2 kanji are represented by 13 bits |
-| Byte | Characters from the ISO/IEC 8859-1 character set | Each characters are represented by 8 bits |
-
-Choose the right mode may be tricky if the input text is unknown.
-In these cases **Byte** mode is the best choice since all characters can be encoded with it. (See [Multibyte characters](#multibyte-characters))
-However, if the QR Code reader supports mixed modes, using [Auto mode](#auto-mode) may produce better results.
-
-### Mixed modes
-Mixed modes are also possible. A QR code can be generated from a series of segments having different encoding modes to optimize the data compression.
-However, switching from a mode to another has a cost which may lead to a worst result if it's not taken into account.
-See [Manual mode](#manual-mode) for an example of how to specify segments with different encoding modes.
-
-### Auto mode
-By **default**, automatic mode selection is used.
-The input string is automatically splitted in various segments optimized to produce the shortest possible bitstream using mixed modes.
-This is the preferred way to generate the QR Code.
-
-For example, the string **ABCDE12345678?A1A** will be splitted in 3 segments with the following modes:
-
-| Segment | Mode |
-|----------|--------------|
-| ABCDE | Alphanumeric |
-| 12345678 | Numeric |
-| ?A1A | Byte |
-
-Any other combinations of segments and modes will result in a longer bitstream.
-If you need to keep the QR Code size small, this mode will produce the best results.
-
-### Manual mode
-If auto mode doesn't work for you or you have specific needs, is also possible to manually specify each segment with the relative mode.
-In this way no segment optimizations will be applied under the hood.
-Segments list can be passed as an array of object:
-
-```javascript
- var QRCode = require('qrcode')
-
- var segs = [
- { data: 'ABCDEFG', mode: 'alphanumeric' },
- { data: '0123456', mode: 'numeric' }
- ]
-
- QRCode.toDataURL(segs, function (err, url) {
- console.log(url)
- })
-```
-
-### Kanji mode
-With kanji mode is possible to encode characters from the Shift JIS system in an optimized way.
-Unfortunately, there isn't a way to calculate a Shifted JIS values from, for example, a character encoded in UTF-8, for this reason a conversion table from the input characters to the SJIS values is needed.
-This table is not included by default in the bundle to keep the size as small as possible.
-
-If your application requires kanji support, you will need to pass a function that will take care of converting the input characters to appropriate values.
-
-An helper method is provided by the lib through an optional file that you can include as shown in the example below.
-
-**Note:** Support for Kanji mode is only needed if you want to benefit of the data compression, otherwise is still possible to encode kanji using Byte mode (See [Multibyte characters](#multibyte-characters)).
-
-```javascript
- var QRCode = require('qrcode')
- var toSJIS = require('qrcode/helper/to-sjis')
-
- QRCode.toDataURL(kanjiString, { toSJISFunc: toSJIS }, function (err, url) {
- console.log(url)
- })
-```
-
-With precompiled bundle:
-
-```html
-
-
-
-
-
-```
-
-## Binary data
-QR Codes can hold arbitrary byte-based binary data. If you attempt to create a binary QR Code by first converting the data to a JavaScript string, it will fail to encode propery because string encoding adds additional bytes. Instead, you must pass a [`Uint8ClampedArray`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Uint8ClampedArray) or compatible array, or a Node [Buffer](https://nodejs.org/api/buffer.html), as follows:
-
-```javascript
-// Regular array example
-// WARNING: Element values will be clamped to 0-255 even if your data contains higher values.
-const QRCode = require('qrcode')
-QRCode.toFile(
- 'foo.png',
- [{ data: [253,254,255], mode: 'byte' }],
- ...options...,
- ...callback...
-)
-```
-
-```javascript
-// Uint8ClampedArray example
-const QRCode = require('qrcode')
-
-QRCode.toFile(
- 'foo.png',
- [{ data: new Uint8ClampedArray([253,254,255]), mode: 'byte' }],
- ...options...,
- ...callback...
-)
-```
-
-```javascript
-// Node Buffer example
-// WARNING: Element values will be clamped to 0-255 even if your data contains higher values.
-const QRCode = require('qrcode')
-
-QRCode.toFile(
- 'foo.png',
- [{ data: Buffer.from([253,254,255]), mode: 'byte' }],
- ...options...,
- ...callback...
-)
-```
-
-TypeScript users: if you are using [@types/qrcode](https://www.npmjs.com/package/@types/qrcode), you will need to add a `// @ts-ignore` above the data segment because it expects `data: string`.
-
-## Multibyte characters
-Support for multibyte characters isn't present in the initial QR Code standard, but is possible to encode UTF-8 characters in Byte mode.
-
-QR Codes provide a way to specify a different type of character set through ECI (Extended Channel Interpretation), but it's not fully implemented in this lib yet.
-
-Most QR Code readers, however, are able to recognize multibyte characters even without ECI.
-
-Note that a single Kanji/Kana or Emoji can take up to 4 bytes.
-
-## API
-Browser:
-- [create()](#createtext-options)
-- [toCanvas()](#tocanvascanvaselement-text-options-cberror)
-- [toDataURL()](#todataurltext-options-cberror-url)
-- [toString()](#tostringtext-options-cberror-string)
-
-Server:
-- [create()](#createtext-options)
-- [toCanvas()](#tocanvascanvas-text-options-cberror)
-- [toDataURL()](#todataurltext-options-cberror-url-1)
-- [toString()](#tostringtext-options-cberror-string-1)
-- [toFile()](#tofilepath-text-options-cberror)
-- [toFileStream()](#tofilestreamstream-text-options)
-
-### Browser API
-#### `create(text, [options])`
-Creates QR Code symbol and returns a qrcode object.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-See [QR Code options](#qr-code-options).
-
-##### `returns`
-Type: `Object`
-
-```javascript
-// QRCode object
-{
- modules, // Bitmatrix class with modules data
- version, // Calculated QR Code version
- errorCorrectionLevel, // Error Correction Level
- maskPattern, // Calculated Mask pattern
- segments // Generated segments
-}
-```
-
-
-
-#### `toCanvas(canvasElement, text, [options], [cb(error)])`
-#### `toCanvas(text, [options], [cb(error, canvas)])`
-Draws qr code symbol to canvas.
-If `canvasElement` is omitted a new canvas is returned.
-
-##### `canvasElement`
-Type: `DOMElement`
-
-Canvas where to draw QR Code.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-See [Options](#options).
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-##### Example
-```javascript
-QRCode.toCanvas('text', { errorCorrectionLevel: 'H' }, function (err, canvas) {
- if (err) throw err
-
- var container = document.getElementById('container')
- container.appendChild(canvas)
-})
-```
-
-
-
-#### `toDataURL(text, [options], [cb(error, url)])`
-#### `toDataURL(canvasElement, text, [options], [cb(error, url)])`
-Returns a Data URI containing a representation of the QR Code image.
-If provided, `canvasElement` will be used as canvas to generate the data URI.
-
-##### `canvasElement`
-Type: `DOMElement`
-
-Canvas where to draw QR Code.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-- ###### `type`
- Type: `String`
- Default: `image/png`
-
- Data URI format.
- Possible values are: `image/png`, `image/jpeg`, `image/webp`.
-
-- ###### `rendererOpts.quality`
- Type: `Number`
- Default: `0.92`
-
- A Number between `0` and `1` indicating image quality if the requested type is `image/jpeg` or `image/webp`.
-
-See [Options](#options) for other settings.
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-##### Example
-```javascript
-var opts = {
- errorCorrectionLevel: 'H',
- type: 'image/jpeg',
- quality: 0.3,
- margin: 1,
- color: {
- dark:"#010599FF",
- light:"#FFBF60FF"
- }
-}
-
-QRCode.toDataURL('text', opts, function (err, url) {
- if (err) throw err
-
- var img = document.getElementById('image')
- img.src = url
-})
-```
-
-
-#### `toString(text, [options], [cb(error, string)])`
-
-Returns a string representation of the QR Code.
-
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-- ###### `type`
- Type: `String`
- Default: `utf8`
-
- Output format.
- Possible values are: `terminal`,`utf8`, and `svg`.
-
-See [Options](#options) for other settings.
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-##### Example
-```javascript
-QRCode.toString('http://www.google.com', function (err, string) {
- if (err) throw err
- console.log(string)
-})
-```
-
-
-
-
-### Server API
-#### `create(text, [options])`
-See [create](#createtext-options).
-
-
-
-#### `toCanvas(canvas, text, [options], [cb(error)])`
-Draws qr code symbol to [node canvas](https://github.com/Automattic/node-canvas).
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-See [Options](#options).
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-
-
-#### `toDataURL(text, [options], [cb(error, url)])`
-Returns a Data URI containing a representation of the QR Code image.
-Only works with `image/png` type for now.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-See [Options](#options) for other settings.
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-
-
-#### `toString(text, [options], [cb(error, string)])`
-Returns a string representation of the QR Code.
-If choosen output format is `svg` it will returns a string containing xml code.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-- ###### `type`
- Type: `String`
- Default: `utf8`
-
- Output format.
- Possible values are: `utf8`, `svg`, `terminal`.
-
-See [Options](#options) for other settings.
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-##### Example
-```javascript
-QRCode.toString('http://www.google.com', function (err, string) {
- if (err) throw err
- console.log(string)
-})
-```
-
-
-
-#### `toFile(path, text, [options], [cb(error)])`
-Saves QR Code to image file.
-If `options.type` is not specified, the format will be guessed from file extension.
-Recognized extensions are `png`, `svg`, `txt`.
-
-##### `path`
-Type: `String`
-
-Path where to save the file.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-- ###### `type`
- Type: `String`
- Default: `png`
-
- Output format.
- Possible values are: `png`, `svg`, `utf8`.
-
-- ###### `rendererOpts.deflateLevel` **(png only)**
- Type: `Number`
- Default: `9`
-
- Compression level for deflate.
-
-- ###### `rendererOpts.deflateStrategy` **(png only)**
- Type: `Number`
- Default: `3`
-
- Compression strategy for deflate.
-
-See [Options](#options) for other settings.
-
-##### `cb`
-Type: `Function`
-
-Callback function called on finish.
-
-##### Example
-```javascript
-QRCode.toFile('path/to/filename.png', 'Some text', {
- color: {
- dark: '#00F', // Blue dots
- light: '#0000' // Transparent background
- }
-}, function (err) {
- if (err) throw err
- console.log('done')
-})
-```
-
-
-
-#### `toFileStream(stream, text, [options])`
-Writes QR Code image to stream. Only works with `png` format for now.
-
-##### `stream`
-Type: `stream.Writable`
-
-Node stream.
-
-##### `text`
-Type: `String|Array`
-
-Text to encode or a list of objects describing segments.
-
-##### `options`
-See [Options](#options).
-
-
-
-### Options
-
-#### QR Code options
-##### `version`
- Type: `Number`
-
- QR Code version. If not specified the more suitable value will be calculated.
-
-##### `errorCorrectionLevel`
- Type: `String`
- Default: `M`
-
- Error correction level.
- Possible values are `low, medium, quartile, high` or `L, M, Q, H`.
-
-##### `maskPattern`
- Type: `Number`
-
- Mask pattern used to mask the symbol.
- Possible values are `0`, `1`, `2`, `3`, `4`, `5`, `6`, `7`.
- If not specified the more suitable value will be calculated.
-
-##### `toSJISFunc`
- Type: `Function`
-
- Helper function used internally to convert a kanji to its Shift JIS value.
- Provide this function if you need support for Kanji mode.
-
-#### Renderers options
-##### `margin`
- Type: `Number`
- Default: `4`
-
- Define how much wide the quiet zone should be.
-
-##### `scale`
- Type: `Number`
- Default: `4`
-
- Scale factor. A value of `1` means 1px per modules (black dots).
-
-##### `small`
- Type: `Boolean`
- Default: `false`
-
- Relevant only for terminal renderer. Outputs smaller QR code.
-
-##### `width`
- Type: `Number`
-
- Forces a specific width for the output image.
- If width is too small to contain the qr symbol, this option will be ignored.
- Takes precedence over `scale`.
-
-##### `color.dark`
-Type: `String`
-Default: `#000000ff`
-
-Color of dark module. Value must be in hex format (RGBA).
-Note: dark color should always be darker than `color.light`.
-
-##### `color.light`
-Type: `String`
-Default: `#ffffffff`
-
-Color of light module. Value must be in hex format (RGBA).
-
-
-
-## GS1 QR Codes
-There was a real good discussion here about them. but in short any qrcode generator will make gs1 compatible qrcodes, but what defines a gs1 qrcode is a header with metadata that describes your gs1 information.
-
-https://github.com/soldair/node-qrcode/issues/45
-
-
-## Credits
-This lib is based on "QRCode for JavaScript" which Kazuhiko Arase thankfully MIT licensed.
-
-## License
-[MIT](https://github.com/soldair/node-qrcode/blob/master/license)
-
-The word "QR Code" is registered trademark of:
-DENSO WAVE INCORPORATED
diff --git a/uds-auth/lib/qrcode-lib/bin/qrcode b/uds-auth/lib/qrcode-lib/bin/qrcode
deleted file mode 100644
index dd990b63..00000000
--- a/uds-auth/lib/qrcode-lib/bin/qrcode
+++ /dev/null
@@ -1,159 +0,0 @@
-#!/usr/bin/env node
-var yargs = require('yargs')
-var qr = require('../lib')
-
-function save (file, text, options) {
- qr.toFile(file, text, options, function (err, data) {
- if (err) {
- console.error('Error:', err.message)
- process.exit(1)
- }
-
- console.log('saved qrcode to: ' + file + '\n')
- })
-}
-
-function print (text, options) {
- options.type = 'terminal'
- qr.toString(text, options, function (err, text) {
- if (err) {
- console.error('Error:', err.message)
- process.exit(1)
- }
-
- console.log(text)
- })
-}
-
-function parseOptions (args) {
- return {
- version: args.qversion,
- errorCorrectionLevel: args.error,
- type: args.type,
- small: !!args.small,
- inverse: !!args.inverse,
- maskPattern: args.mask,
- margin: args.qzone,
- width: args.width,
- scale: args.scale,
- color: {
- light: args.lightcolor,
- dark: args.darkcolor
- }
- }
-}
-
-function processInputs (text, opts) {
- if (!text.length) {
- yargs.showHelp()
- process.exit(1)
- }
-
- if (opts.output) {
- save(opts.output, text, parseOptions(opts))
- } else {
- print(text, parseOptions(opts))
- }
-}
-
-var argv = yargs
- .detectLocale(false)
- .usage('Usage: $0 [options] ')
- .option('v', {
- alias: 'qversion',
- description: 'QR Code symbol version (1 - 40)',
- group: 'QR Code options:',
- type: 'number'
- })
- .option('e', {
- alias: 'error',
- description: 'Error correction level',
- choices: ['L', 'M', 'Q', 'H'],
- group: 'QR Code options:'
- })
- .option('m', {
- alias: 'mask',
- description: 'Mask pattern (0 - 7)',
- group: 'QR Code options:',
- type: 'number'
- })
- .option('t', {
- alias: 'type',
- description: 'Output type',
- choices: ['png', 'svg', 'utf8'],
- implies: 'output',
- group: 'Renderer options:'
- })
- .option('i', {
- alias: 'inverse',
- type: 'boolean',
- description: 'Invert colors',
- group: 'Renderer options:'
- })
- .option('w', {
- alias: 'width',
- description: 'Image width (px)',
- conflicts: 'scale',
- group: 'Renderer options:',
- type: 'number'
- })
- .option('s', {
- alias: 'scale',
- description: 'Scale factor',
- conflicts: 'width',
- group: 'Renderer options:',
- type: 'number'
- })
- .option('q', {
- alias: 'qzone',
- description: 'Quiet zone size',
- group: 'Renderer options:',
- type: 'number'
- })
- .option('l', {
- alias: 'lightcolor',
- description: 'Light RGBA hex color',
- group: 'Renderer options:'
- })
- .option('d', {
- alias: 'darkcolor',
- description: 'Dark RGBA hex color',
- group: 'Renderer options:'
- })
- .option('small', {
- type: 'boolean',
- description: 'Output smaller QR code to terminal',
- conflicts: 'type',
- group: 'Renderer options:'
- })
- .option('o', {
- alias: 'output',
- description: 'Output file'
- })
- .help('h')
- .alias('h', 'help')
- .version()
- .example('$0 "some text"', 'Draw in terminal window')
- .example('$0 -o out.png "some text"', 'Save as png image')
- .example('$0 -d F00 -o out.png "some text"', 'Use red as foreground color')
- .parserConfiguration({'parse-numbers': false})
- .argv
-
-if (process.stdin.isTTY) {
- processInputs(argv._.join(' '), argv)
-} else {
- var text = ''
- process.stdin.setEncoding('utf8')
- process.stdin.on('readable', function () {
- var chunk = process.stdin.read()
- if (chunk !== null) {
- text += chunk
- }
- })
-
- process.stdin.on('end', function () {
- // this process can be run as a command outside of a tty so if there was no
- // data on stdin read from argv
- processInputs(text.length?text:argv._.join(' '), argv)
- })
-}
diff --git a/uds-auth/lib/qrcode-lib/helper/to-sjis-browser.js b/uds-auth/lib/qrcode-lib/helper/to-sjis-browser.js
deleted file mode 100644
index 1c9b3aa7..00000000
--- a/uds-auth/lib/qrcode-lib/helper/to-sjis-browser.js
+++ /dev/null
@@ -1,2 +0,0 @@
-/* global QRCode */
-QRCode.toSJIS = require('./to-sjis')
diff --git a/uds-auth/lib/qrcode-lib/helper/to-sjis.js b/uds-auth/lib/qrcode-lib/helper/to-sjis.js
deleted file mode 100644
index 594c6f7c..00000000
--- a/uds-auth/lib/qrcode-lib/helper/to-sjis.js
+++ /dev/null
@@ -1,105 +0,0 @@
-const SJIS_UTF8 = [
- [0x8140, ' 、。,.・:;?!゛゜´`¨^ ̄_ヽヾゝゞ〃仝々〆〇ー―‐/\~∥|…‥‘’“”()〔〕[]{}〈〉《》「」『』【】+-±×'],
- [0x8180, '÷=≠<>≦≧∞∴♂♀°′″℃'],
- [0x818f, '¥$¢£%#&*@§☆★○●◎◇◆□■△▲▽▼'],
- [0x81a6, '※〒→←↑↓〓'],
- [0x81b8, '∈∋⊆⊇⊂⊃∪∩'],
- [0x81c8, '∧∨¬⇒⇔∀∃'],
- [0x81da, '∠⊥⌒∂∇≡≒≪≫√∽∝∵∫∬'],
- [0x81f0, 'ʼn♯♭♪†‡¶'],
- [0x824f, '0123456789'],
- [0x8260, 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'],
- [0x8281, 'abcdefghijklmnopqrstuvwxyz'],
- [0x829f, 'ぁあぃいぅうぇえぉおかがきぎくぐけげこごさざしじすずせぜそぞただちぢっつづてでとどなにぬねのはばぱひびぴふぶぷへべぺほぼぽまみむめもゃやゅゆょよらりるれろゎわゐゑをん'],
- [0x8340, 'ァアィイゥウェエォオカガキギクグケゲコゴサザシジスズセゼソゾタダチヂッツヅテデトドナニヌネノハバパヒビピフブプヘベペホボポマミ'],
- [0x8380, 'ムメモャヤュユョヨラリルレロヮワヰヱヲンヴヵヶ'],
- [0x839f, 'ΑΒΓΔΕΖΗΘΙΚΛΜΝΞΟΠΡΣΤΥΦΧΨΩ'],
- [0x83bf, 'αβγδεζηθικλμνξοπρστυφχψω'],
- [0x8440, 'АБВГДЕЁЖЗИЙКЛМНОПРСТУФХЦЧШЩЪЫЬЭЮЯ'],
- [0x8470, 'абвгдеёжзийклмн'],
- [0x8480, 'опрстуфхцчшщъыьэюя'],
- [0x8780, '〝〟'],
- [0x889f, '亜唖娃阿哀愛挨姶逢葵茜穐悪握渥旭葦芦鯵梓圧斡扱宛姐虻飴絢綾鮎或粟袷安庵按暗案闇鞍杏以伊位依偉囲夷委威尉惟意慰易椅為畏異移維緯胃萎衣'],
- [0x88e0, '謂違遺医井亥域育郁磯一壱溢逸稲茨芋鰯允印咽員因姻引飲淫胤蔭'],
- [0x8940, '院陰隠韻吋右宇烏羽迂雨卯鵜窺丑碓臼渦嘘唄欝蔚鰻姥厩浦瓜閏噂云運雲荏餌叡営嬰影映曳栄永泳洩瑛盈穎頴英衛詠鋭液疫益駅悦謁越閲榎厭円'],
- [0x8980, '園堰奄宴延怨掩援沿演炎焔煙燕猿縁艶苑薗遠鉛鴛塩於汚甥凹央奥往応押旺横欧殴王翁襖鴬鴎黄岡沖荻億屋憶臆桶牡乙俺卸恩温穏音下化仮何伽価佳加可嘉夏嫁家寡科暇果架歌河火珂禍禾稼箇花苛茄荷華菓蝦課嘩貨迦過霞蚊俄峨我牙画臥芽蛾賀雅餓駕介会解回塊壊廻快怪悔恢懐戒拐改'],
- [0x8a40, '魁晦械海灰界皆絵芥蟹開階貝凱劾外咳害崖慨概涯碍蓋街該鎧骸浬馨蛙垣柿蛎鈎劃嚇各廓拡撹格核殻獲確穫覚角赫較郭閣隔革学岳楽額顎掛笠樫'],
- [0x8a80, '橿梶鰍潟割喝恰括活渇滑葛褐轄且鰹叶椛樺鞄株兜竃蒲釜鎌噛鴨栢茅萱粥刈苅瓦乾侃冠寒刊勘勧巻喚堪姦完官寛干幹患感慣憾換敢柑桓棺款歓汗漢澗潅環甘監看竿管簡緩缶翰肝艦莞観諌貫還鑑間閑関陥韓館舘丸含岸巌玩癌眼岩翫贋雁頑顔願企伎危喜器基奇嬉寄岐希幾忌揮机旗既期棋棄'],
- [0x8b40, '機帰毅気汽畿祈季稀紀徽規記貴起軌輝飢騎鬼亀偽儀妓宜戯技擬欺犠疑祇義蟻誼議掬菊鞠吉吃喫桔橘詰砧杵黍却客脚虐逆丘久仇休及吸宮弓急救'],
- [0x8b80, '朽求汲泣灸球究窮笈級糾給旧牛去居巨拒拠挙渠虚許距鋸漁禦魚亨享京供侠僑兇競共凶協匡卿叫喬境峡強彊怯恐恭挟教橋況狂狭矯胸脅興蕎郷鏡響饗驚仰凝尭暁業局曲極玉桐粁僅勤均巾錦斤欣欽琴禁禽筋緊芹菌衿襟謹近金吟銀九倶句区狗玖矩苦躯駆駈駒具愚虞喰空偶寓遇隅串櫛釧屑屈'],
- [0x8c40, '掘窟沓靴轡窪熊隈粂栗繰桑鍬勲君薫訓群軍郡卦袈祁係傾刑兄啓圭珪型契形径恵慶慧憩掲携敬景桂渓畦稽系経継繋罫茎荊蛍計詣警軽頚鶏芸迎鯨'],
- [0x8c80, '劇戟撃激隙桁傑欠決潔穴結血訣月件倹倦健兼券剣喧圏堅嫌建憲懸拳捲検権牽犬献研硯絹県肩見謙賢軒遣鍵険顕験鹸元原厳幻弦減源玄現絃舷言諺限乎個古呼固姑孤己庫弧戸故枯湖狐糊袴股胡菰虎誇跨鈷雇顧鼓五互伍午呉吾娯後御悟梧檎瑚碁語誤護醐乞鯉交佼侯候倖光公功効勾厚口向'],
- [0x8d40, '后喉坑垢好孔孝宏工巧巷幸広庚康弘恒慌抗拘控攻昂晃更杭校梗構江洪浩港溝甲皇硬稿糠紅紘絞綱耕考肯肱腔膏航荒行衡講貢購郊酵鉱砿鋼閤降'],
- [0x8d80, '項香高鴻剛劫号合壕拷濠豪轟麹克刻告国穀酷鵠黒獄漉腰甑忽惚骨狛込此頃今困坤墾婚恨懇昏昆根梱混痕紺艮魂些佐叉唆嵯左差査沙瑳砂詐鎖裟坐座挫債催再最哉塞妻宰彩才採栽歳済災采犀砕砦祭斎細菜裁載際剤在材罪財冴坂阪堺榊肴咲崎埼碕鷺作削咋搾昨朔柵窄策索錯桜鮭笹匙冊刷'],
- [0x8e40, '察拶撮擦札殺薩雑皐鯖捌錆鮫皿晒三傘参山惨撒散桟燦珊産算纂蚕讃賛酸餐斬暫残仕仔伺使刺司史嗣四士始姉姿子屍市師志思指支孜斯施旨枝止'],
- [0x8e80, '死氏獅祉私糸紙紫肢脂至視詞詩試誌諮資賜雌飼歯事似侍児字寺慈持時次滋治爾璽痔磁示而耳自蒔辞汐鹿式識鴫竺軸宍雫七叱執失嫉室悉湿漆疾質実蔀篠偲柴芝屡蕊縞舎写射捨赦斜煮社紗者謝車遮蛇邪借勺尺杓灼爵酌釈錫若寂弱惹主取守手朱殊狩珠種腫趣酒首儒受呪寿授樹綬需囚収周'],
- [0x8f40, '宗就州修愁拾洲秀秋終繍習臭舟蒐衆襲讐蹴輯週酋酬集醜什住充十従戎柔汁渋獣縦重銃叔夙宿淑祝縮粛塾熟出術述俊峻春瞬竣舜駿准循旬楯殉淳'],
- [0x8f80, '準潤盾純巡遵醇順処初所暑曙渚庶緒署書薯藷諸助叙女序徐恕鋤除傷償勝匠升召哨商唱嘗奨妾娼宵将小少尚庄床廠彰承抄招掌捷昇昌昭晶松梢樟樵沼消渉湘焼焦照症省硝礁祥称章笑粧紹肖菖蒋蕉衝裳訟証詔詳象賞醤鉦鍾鐘障鞘上丈丞乗冗剰城場壌嬢常情擾条杖浄状畳穣蒸譲醸錠嘱埴飾'],
- [0x9040, '拭植殖燭織職色触食蝕辱尻伸信侵唇娠寝審心慎振新晋森榛浸深申疹真神秦紳臣芯薪親診身辛進針震人仁刃塵壬尋甚尽腎訊迅陣靭笥諏須酢図厨'],
- [0x9080, '逗吹垂帥推水炊睡粋翠衰遂酔錐錘随瑞髄崇嵩数枢趨雛据杉椙菅頗雀裾澄摺寸世瀬畝是凄制勢姓征性成政整星晴棲栖正清牲生盛精聖声製西誠誓請逝醒青静斉税脆隻席惜戚斥昔析石積籍績脊責赤跡蹟碩切拙接摂折設窃節説雪絶舌蝉仙先千占宣専尖川戦扇撰栓栴泉浅洗染潜煎煽旋穿箭線'],
- [0x9140, '繊羨腺舛船薦詮賎践選遷銭銑閃鮮前善漸然全禅繕膳糎噌塑岨措曾曽楚狙疏疎礎祖租粗素組蘇訴阻遡鼠僧創双叢倉喪壮奏爽宋層匝惣想捜掃挿掻'],
- [0x9180, '操早曹巣槍槽漕燥争痩相窓糟総綜聡草荘葬蒼藻装走送遭鎗霜騒像増憎臓蔵贈造促側則即息捉束測足速俗属賊族続卒袖其揃存孫尊損村遜他多太汰詑唾堕妥惰打柁舵楕陀駄騨体堆対耐岱帯待怠態戴替泰滞胎腿苔袋貸退逮隊黛鯛代台大第醍題鷹滝瀧卓啄宅托択拓沢濯琢託鐸濁諾茸凧蛸只'],
- [0x9240, '叩但達辰奪脱巽竪辿棚谷狸鱈樽誰丹単嘆坦担探旦歎淡湛炭短端箪綻耽胆蛋誕鍛団壇弾断暖檀段男談値知地弛恥智池痴稚置致蜘遅馳築畜竹筑蓄'],
- [0x9280, '逐秩窒茶嫡着中仲宙忠抽昼柱注虫衷註酎鋳駐樗瀦猪苧著貯丁兆凋喋寵帖帳庁弔張彫徴懲挑暢朝潮牒町眺聴脹腸蝶調諜超跳銚長頂鳥勅捗直朕沈珍賃鎮陳津墜椎槌追鎚痛通塚栂掴槻佃漬柘辻蔦綴鍔椿潰坪壷嬬紬爪吊釣鶴亭低停偵剃貞呈堤定帝底庭廷弟悌抵挺提梯汀碇禎程締艇訂諦蹄逓'],
- [0x9340, '邸鄭釘鼎泥摘擢敵滴的笛適鏑溺哲徹撤轍迭鉄典填天展店添纏甜貼転顛点伝殿澱田電兎吐堵塗妬屠徒斗杜渡登菟賭途都鍍砥砺努度土奴怒倒党冬'],
- [0x9380, '凍刀唐塔塘套宕島嶋悼投搭東桃梼棟盗淘湯涛灯燈当痘祷等答筒糖統到董蕩藤討謄豆踏逃透鐙陶頭騰闘働動同堂導憧撞洞瞳童胴萄道銅峠鴇匿得徳涜特督禿篤毒独読栃橡凸突椴届鳶苫寅酉瀞噸屯惇敦沌豚遁頓呑曇鈍奈那内乍凪薙謎灘捺鍋楢馴縄畷南楠軟難汝二尼弐迩匂賑肉虹廿日乳入'],
- [0x9440, '如尿韮任妊忍認濡禰祢寧葱猫熱年念捻撚燃粘乃廼之埜嚢悩濃納能脳膿農覗蚤巴把播覇杷波派琶破婆罵芭馬俳廃拝排敗杯盃牌背肺輩配倍培媒梅'],
- [0x9480, '楳煤狽買売賠陪這蝿秤矧萩伯剥博拍柏泊白箔粕舶薄迫曝漠爆縛莫駁麦函箱硲箸肇筈櫨幡肌畑畠八鉢溌発醗髪伐罰抜筏閥鳩噺塙蛤隼伴判半反叛帆搬斑板氾汎版犯班畔繁般藩販範釆煩頒飯挽晩番盤磐蕃蛮匪卑否妃庇彼悲扉批披斐比泌疲皮碑秘緋罷肥被誹費避非飛樋簸備尾微枇毘琵眉美'],
- [0x9540, '鼻柊稗匹疋髭彦膝菱肘弼必畢筆逼桧姫媛紐百謬俵彪標氷漂瓢票表評豹廟描病秒苗錨鋲蒜蛭鰭品彬斌浜瀕貧賓頻敏瓶不付埠夫婦富冨布府怖扶敷'],
- [0x9580, '斧普浮父符腐膚芙譜負賦赴阜附侮撫武舞葡蕪部封楓風葺蕗伏副復幅服福腹複覆淵弗払沸仏物鮒分吻噴墳憤扮焚奮粉糞紛雰文聞丙併兵塀幣平弊柄並蔽閉陛米頁僻壁癖碧別瞥蔑箆偏変片篇編辺返遍便勉娩弁鞭保舗鋪圃捕歩甫補輔穂募墓慕戊暮母簿菩倣俸包呆報奉宝峰峯崩庖抱捧放方朋'],
- [0x9640, '法泡烹砲縫胞芳萌蓬蜂褒訪豊邦鋒飽鳳鵬乏亡傍剖坊妨帽忘忙房暴望某棒冒紡肪膨謀貌貿鉾防吠頬北僕卜墨撲朴牧睦穆釦勃没殆堀幌奔本翻凡盆'],
- [0x9680, '摩磨魔麻埋妹昧枚毎哩槙幕膜枕鮪柾鱒桝亦俣又抹末沫迄侭繭麿万慢満漫蔓味未魅巳箕岬密蜜湊蓑稔脈妙粍民眠務夢無牟矛霧鵡椋婿娘冥名命明盟迷銘鳴姪牝滅免棉綿緬面麺摸模茂妄孟毛猛盲網耗蒙儲木黙目杢勿餅尤戻籾貰問悶紋門匁也冶夜爺耶野弥矢厄役約薬訳躍靖柳薮鑓愉愈油癒'],
- [0x9740, '諭輸唯佑優勇友宥幽悠憂揖有柚湧涌猶猷由祐裕誘遊邑郵雄融夕予余与誉輿預傭幼妖容庸揚揺擁曜楊様洋溶熔用窯羊耀葉蓉要謡踊遥陽養慾抑欲'],
- [0x9780, '沃浴翌翼淀羅螺裸来莱頼雷洛絡落酪乱卵嵐欄濫藍蘭覧利吏履李梨理璃痢裏裡里離陸律率立葎掠略劉流溜琉留硫粒隆竜龍侶慮旅虜了亮僚両凌寮料梁涼猟療瞭稜糧良諒遼量陵領力緑倫厘林淋燐琳臨輪隣鱗麟瑠塁涙累類令伶例冷励嶺怜玲礼苓鈴隷零霊麗齢暦歴列劣烈裂廉恋憐漣煉簾練聯'],
- [0x9840, '蓮連錬呂魯櫓炉賂路露労婁廊弄朗楼榔浪漏牢狼篭老聾蝋郎六麓禄肋録論倭和話歪賄脇惑枠鷲亙亘鰐詫藁蕨椀湾碗腕'],
- [0x989f, '弌丐丕个丱丶丼丿乂乖乘亂亅豫亊舒弍于亞亟亠亢亰亳亶从仍仄仆仂仗仞仭仟价伉佚估佛佝佗佇佶侈侏侘佻佩佰侑佯來侖儘俔俟俎俘俛俑俚俐俤俥倚倨倔倪倥倅伜俶倡倩倬俾俯們倆偃假會偕偐偈做偖偬偸傀傚傅傴傲'],
- [0x9940, '僉僊傳僂僖僞僥僭僣僮價僵儉儁儂儖儕儔儚儡儺儷儼儻儿兀兒兌兔兢竸兩兪兮冀冂囘册冉冏冑冓冕冖冤冦冢冩冪冫决冱冲冰况冽凅凉凛几處凩凭'],
- [0x9980, '凰凵凾刄刋刔刎刧刪刮刳刹剏剄剋剌剞剔剪剴剩剳剿剽劍劔劒剱劈劑辨辧劬劭劼劵勁勍勗勞勣勦飭勠勳勵勸勹匆匈甸匍匐匏匕匚匣匯匱匳匸區卆卅丗卉卍凖卞卩卮夘卻卷厂厖厠厦厥厮厰厶參簒雙叟曼燮叮叨叭叺吁吽呀听吭吼吮吶吩吝呎咏呵咎呟呱呷呰咒呻咀呶咄咐咆哇咢咸咥咬哄哈咨'],
- [0x9a40, '咫哂咤咾咼哘哥哦唏唔哽哮哭哺哢唹啀啣啌售啜啅啖啗唸唳啝喙喀咯喊喟啻啾喘喞單啼喃喩喇喨嗚嗅嗟嗄嗜嗤嗔嘔嗷嘖嗾嗽嘛嗹噎噐營嘴嘶嘲嘸'],
- [0x9a80, '噫噤嘯噬噪嚆嚀嚊嚠嚔嚏嚥嚮嚶嚴囂嚼囁囃囀囈囎囑囓囗囮囹圀囿圄圉圈國圍圓團圖嗇圜圦圷圸坎圻址坏坩埀垈坡坿垉垓垠垳垤垪垰埃埆埔埒埓堊埖埣堋堙堝塲堡塢塋塰毀塒堽塹墅墹墟墫墺壞墻墸墮壅壓壑壗壙壘壥壜壤壟壯壺壹壻壼壽夂夊夐夛梦夥夬夭夲夸夾竒奕奐奎奚奘奢奠奧奬奩'],
- [0x9b40, '奸妁妝佞侫妣妲姆姨姜妍姙姚娥娟娑娜娉娚婀婬婉娵娶婢婪媚媼媾嫋嫂媽嫣嫗嫦嫩嫖嫺嫻嬌嬋嬖嬲嫐嬪嬶嬾孃孅孀孑孕孚孛孥孩孰孳孵學斈孺宀'],
- [0x9b80, '它宦宸寃寇寉寔寐寤實寢寞寥寫寰寶寳尅將專對尓尠尢尨尸尹屁屆屎屓屐屏孱屬屮乢屶屹岌岑岔妛岫岻岶岼岷峅岾峇峙峩峽峺峭嶌峪崋崕崗嵜崟崛崑崔崢崚崙崘嵌嵒嵎嵋嵬嵳嵶嶇嶄嶂嶢嶝嶬嶮嶽嶐嶷嶼巉巍巓巒巖巛巫已巵帋帚帙帑帛帶帷幄幃幀幎幗幔幟幢幤幇幵并幺麼广庠廁廂廈廐廏'],
- [0x9c40, '廖廣廝廚廛廢廡廨廩廬廱廳廰廴廸廾弃弉彝彜弋弑弖弩弭弸彁彈彌彎弯彑彖彗彙彡彭彳彷徃徂彿徊很徑徇從徙徘徠徨徭徼忖忻忤忸忱忝悳忿怡恠'],
- [0x9c80, '怙怐怩怎怱怛怕怫怦怏怺恚恁恪恷恟恊恆恍恣恃恤恂恬恫恙悁悍惧悃悚悄悛悖悗悒悧悋惡悸惠惓悴忰悽惆悵惘慍愕愆惶惷愀惴惺愃愡惻惱愍愎慇愾愨愧慊愿愼愬愴愽慂慄慳慷慘慙慚慫慴慯慥慱慟慝慓慵憙憖憇憬憔憚憊憑憫憮懌懊應懷懈懃懆憺懋罹懍懦懣懶懺懴懿懽懼懾戀戈戉戍戌戔戛'],
- [0x9d40, '戞戡截戮戰戲戳扁扎扞扣扛扠扨扼抂抉找抒抓抖拔抃抔拗拑抻拏拿拆擔拈拜拌拊拂拇抛拉挌拮拱挧挂挈拯拵捐挾捍搜捏掖掎掀掫捶掣掏掉掟掵捫'],
- [0x9d80, '捩掾揩揀揆揣揉插揶揄搖搴搆搓搦搶攝搗搨搏摧摯摶摎攪撕撓撥撩撈撼據擒擅擇撻擘擂擱擧舉擠擡抬擣擯攬擶擴擲擺攀擽攘攜攅攤攣攫攴攵攷收攸畋效敖敕敍敘敞敝敲數斂斃變斛斟斫斷旃旆旁旄旌旒旛旙无旡旱杲昊昃旻杳昵昶昴昜晏晄晉晁晞晝晤晧晨晟晢晰暃暈暎暉暄暘暝曁暹曉暾暼'],
- [0x9e40, '曄暸曖曚曠昿曦曩曰曵曷朏朖朞朦朧霸朮朿朶杁朸朷杆杞杠杙杣杤枉杰枩杼杪枌枋枦枡枅枷柯枴柬枳柩枸柤柞柝柢柮枹柎柆柧檜栞框栩桀桍栲桎'],
- [0x9e80, '梳栫桙档桷桿梟梏梭梔條梛梃檮梹桴梵梠梺椏梍桾椁棊椈棘椢椦棡椌棍棔棧棕椶椒椄棗棣椥棹棠棯椨椪椚椣椡棆楹楷楜楸楫楔楾楮椹楴椽楙椰楡楞楝榁楪榲榮槐榿槁槓榾槎寨槊槝榻槃榧樮榑榠榜榕榴槞槨樂樛槿權槹槲槧樅榱樞槭樔槫樊樒櫁樣樓橄樌橲樶橸橇橢橙橦橈樸樢檐檍檠檄檢檣'],
- [0x9f40, '檗蘗檻櫃櫂檸檳檬櫞櫑櫟檪櫚櫪櫻欅蘖櫺欒欖鬱欟欸欷盜欹飮歇歃歉歐歙歔歛歟歡歸歹歿殀殄殃殍殘殕殞殤殪殫殯殲殱殳殷殼毆毋毓毟毬毫毳毯'],
- [0x9f80, '麾氈氓气氛氤氣汞汕汢汪沂沍沚沁沛汾汨汳沒沐泄泱泓沽泗泅泝沮沱沾沺泛泯泙泪洟衍洶洫洽洸洙洵洳洒洌浣涓浤浚浹浙涎涕濤涅淹渕渊涵淇淦涸淆淬淞淌淨淒淅淺淙淤淕淪淮渭湮渮渙湲湟渾渣湫渫湶湍渟湃渺湎渤滿渝游溂溪溘滉溷滓溽溯滄溲滔滕溏溥滂溟潁漑灌滬滸滾漿滲漱滯漲滌'],
- [0xe040, '漾漓滷澆潺潸澁澀潯潛濳潭澂潼潘澎澑濂潦澳澣澡澤澹濆澪濟濕濬濔濘濱濮濛瀉瀋濺瀑瀁瀏濾瀛瀚潴瀝瀘瀟瀰瀾瀲灑灣炙炒炯烱炬炸炳炮烟烋烝'],
- [0xe080, '烙焉烽焜焙煥煕熈煦煢煌煖煬熏燻熄熕熨熬燗熹熾燒燉燔燎燠燬燧燵燼燹燿爍爐爛爨爭爬爰爲爻爼爿牀牆牋牘牴牾犂犁犇犒犖犢犧犹犲狃狆狄狎狒狢狠狡狹狷倏猗猊猜猖猝猴猯猩猥猾獎獏默獗獪獨獰獸獵獻獺珈玳珎玻珀珥珮珞璢琅瑯琥珸琲琺瑕琿瑟瑙瑁瑜瑩瑰瑣瑪瑶瑾璋璞璧瓊瓏瓔珱'],
- [0xe140, '瓠瓣瓧瓩瓮瓲瓰瓱瓸瓷甄甃甅甌甎甍甕甓甞甦甬甼畄畍畊畉畛畆畚畩畤畧畫畭畸當疆疇畴疊疉疂疔疚疝疥疣痂疳痃疵疽疸疼疱痍痊痒痙痣痞痾痿'],
- [0xe180, '痼瘁痰痺痲痳瘋瘍瘉瘟瘧瘠瘡瘢瘤瘴瘰瘻癇癈癆癜癘癡癢癨癩癪癧癬癰癲癶癸發皀皃皈皋皎皖皓皙皚皰皴皸皹皺盂盍盖盒盞盡盥盧盪蘯盻眈眇眄眩眤眞眥眦眛眷眸睇睚睨睫睛睥睿睾睹瞎瞋瞑瞠瞞瞰瞶瞹瞿瞼瞽瞻矇矍矗矚矜矣矮矼砌砒礦砠礪硅碎硴碆硼碚碌碣碵碪碯磑磆磋磔碾碼磅磊磬'],
- [0xe240, '磧磚磽磴礇礒礑礙礬礫祀祠祗祟祚祕祓祺祿禊禝禧齋禪禮禳禹禺秉秕秧秬秡秣稈稍稘稙稠稟禀稱稻稾稷穃穗穉穡穢穩龝穰穹穽窈窗窕窘窖窩竈窰'],
- [0xe280, '窶竅竄窿邃竇竊竍竏竕竓站竚竝竡竢竦竭竰笂笏笊笆笳笘笙笞笵笨笶筐筺笄筍笋筌筅筵筥筴筧筰筱筬筮箝箘箟箍箜箚箋箒箏筝箙篋篁篌篏箴篆篝篩簑簔篦篥籠簀簇簓篳篷簗簍篶簣簧簪簟簷簫簽籌籃籔籏籀籐籘籟籤籖籥籬籵粃粐粤粭粢粫粡粨粳粲粱粮粹粽糀糅糂糘糒糜糢鬻糯糲糴糶糺紆'],
- [0xe340, '紂紜紕紊絅絋紮紲紿紵絆絳絖絎絲絨絮絏絣經綉絛綏絽綛綺綮綣綵緇綽綫總綢綯緜綸綟綰緘緝緤緞緻緲緡縅縊縣縡縒縱縟縉縋縢繆繦縻縵縹繃縷'],
- [0xe380, '縲縺繧繝繖繞繙繚繹繪繩繼繻纃緕繽辮繿纈纉續纒纐纓纔纖纎纛纜缸缺罅罌罍罎罐网罕罔罘罟罠罨罩罧罸羂羆羃羈羇羌羔羞羝羚羣羯羲羹羮羶羸譱翅翆翊翕翔翡翦翩翳翹飜耆耄耋耒耘耙耜耡耨耿耻聊聆聒聘聚聟聢聨聳聲聰聶聹聽聿肄肆肅肛肓肚肭冐肬胛胥胙胝胄胚胖脉胯胱脛脩脣脯腋'],
- [0xe440, '隋腆脾腓腑胼腱腮腥腦腴膃膈膊膀膂膠膕膤膣腟膓膩膰膵膾膸膽臀臂膺臉臍臑臙臘臈臚臟臠臧臺臻臾舁舂舅與舊舍舐舖舩舫舸舳艀艙艘艝艚艟艤'],
- [0xe480, '艢艨艪艫舮艱艷艸艾芍芒芫芟芻芬苡苣苟苒苴苳苺莓范苻苹苞茆苜茉苙茵茴茖茲茱荀茹荐荅茯茫茗茘莅莚莪莟莢莖茣莎莇莊荼莵荳荵莠莉莨菴萓菫菎菽萃菘萋菁菷萇菠菲萍萢萠莽萸蔆菻葭萪萼蕚蒄葷葫蒭葮蒂葩葆萬葯葹萵蓊葢蒹蒿蒟蓙蓍蒻蓚蓐蓁蓆蓖蒡蔡蓿蓴蔗蔘蔬蔟蔕蔔蓼蕀蕣蕘蕈'],
- [0xe540, '蕁蘂蕋蕕薀薤薈薑薊薨蕭薔薛藪薇薜蕷蕾薐藉薺藏薹藐藕藝藥藜藹蘊蘓蘋藾藺蘆蘢蘚蘰蘿虍乕虔號虧虱蚓蚣蚩蚪蚋蚌蚶蚯蛄蛆蚰蛉蠣蚫蛔蛞蛩蛬'],
- [0xe580, '蛟蛛蛯蜒蜆蜈蜀蜃蛻蜑蜉蜍蛹蜊蜴蜿蜷蜻蜥蜩蜚蝠蝟蝸蝌蝎蝴蝗蝨蝮蝙蝓蝣蝪蠅螢螟螂螯蟋螽蟀蟐雖螫蟄螳蟇蟆螻蟯蟲蟠蠏蠍蟾蟶蟷蠎蟒蠑蠖蠕蠢蠡蠱蠶蠹蠧蠻衄衂衒衙衞衢衫袁衾袞衵衽袵衲袂袗袒袮袙袢袍袤袰袿袱裃裄裔裘裙裝裹褂裼裴裨裲褄褌褊褓襃褞褥褪褫襁襄褻褶褸襌褝襠襞'],
- [0xe640, '襦襤襭襪襯襴襷襾覃覈覊覓覘覡覩覦覬覯覲覺覽覿觀觚觜觝觧觴觸訃訖訐訌訛訝訥訶詁詛詒詆詈詼詭詬詢誅誂誄誨誡誑誥誦誚誣諄諍諂諚諫諳諧'],
- [0xe680, '諤諱謔諠諢諷諞諛謌謇謚諡謖謐謗謠謳鞫謦謫謾謨譁譌譏譎證譖譛譚譫譟譬譯譴譽讀讌讎讒讓讖讙讚谺豁谿豈豌豎豐豕豢豬豸豺貂貉貅貊貍貎貔豼貘戝貭貪貽貲貳貮貶賈賁賤賣賚賽賺賻贄贅贊贇贏贍贐齎贓賍贔贖赧赭赱赳趁趙跂趾趺跏跚跖跌跛跋跪跫跟跣跼踈踉跿踝踞踐踟蹂踵踰踴蹊'],
- [0xe740, '蹇蹉蹌蹐蹈蹙蹤蹠踪蹣蹕蹶蹲蹼躁躇躅躄躋躊躓躑躔躙躪躡躬躰軆躱躾軅軈軋軛軣軼軻軫軾輊輅輕輒輙輓輜輟輛輌輦輳輻輹轅轂輾轌轉轆轎轗轜'],
- [0xe780, '轢轣轤辜辟辣辭辯辷迚迥迢迪迯邇迴逅迹迺逑逕逡逍逞逖逋逧逶逵逹迸遏遐遑遒逎遉逾遖遘遞遨遯遶隨遲邂遽邁邀邊邉邏邨邯邱邵郢郤扈郛鄂鄒鄙鄲鄰酊酖酘酣酥酩酳酲醋醉醂醢醫醯醪醵醴醺釀釁釉釋釐釖釟釡釛釼釵釶鈞釿鈔鈬鈕鈑鉞鉗鉅鉉鉤鉈銕鈿鉋鉐銜銖銓銛鉚鋏銹銷鋩錏鋺鍄錮'],
- [0xe840, '錙錢錚錣錺錵錻鍜鍠鍼鍮鍖鎰鎬鎭鎔鎹鏖鏗鏨鏥鏘鏃鏝鏐鏈鏤鐚鐔鐓鐃鐇鐐鐶鐫鐵鐡鐺鑁鑒鑄鑛鑠鑢鑞鑪鈩鑰鑵鑷鑽鑚鑼鑾钁鑿閂閇閊閔閖閘閙'],
- [0xe880, '閠閨閧閭閼閻閹閾闊濶闃闍闌闕闔闖關闡闥闢阡阨阮阯陂陌陏陋陷陜陞陝陟陦陲陬隍隘隕隗險隧隱隲隰隴隶隸隹雎雋雉雍襍雜霍雕雹霄霆霈霓霎霑霏霖霙霤霪霰霹霽霾靄靆靈靂靉靜靠靤靦靨勒靫靱靹鞅靼鞁靺鞆鞋鞏鞐鞜鞨鞦鞣鞳鞴韃韆韈韋韜韭齏韲竟韶韵頏頌頸頤頡頷頽顆顏顋顫顯顰'],
- [0xe940, '顱顴顳颪颯颱颶飄飃飆飩飫餃餉餒餔餘餡餝餞餤餠餬餮餽餾饂饉饅饐饋饑饒饌饕馗馘馥馭馮馼駟駛駝駘駑駭駮駱駲駻駸騁騏騅駢騙騫騷驅驂驀驃'],
- [0xe980, '騾驕驍驛驗驟驢驥驤驩驫驪骭骰骼髀髏髑髓體髞髟髢髣髦髯髫髮髴髱髷髻鬆鬘鬚鬟鬢鬣鬥鬧鬨鬩鬪鬮鬯鬲魄魃魏魍魎魑魘魴鮓鮃鮑鮖鮗鮟鮠鮨鮴鯀鯊鮹鯆鯏鯑鯒鯣鯢鯤鯔鯡鰺鯲鯱鯰鰕鰔鰉鰓鰌鰆鰈鰒鰊鰄鰮鰛鰥鰤鰡鰰鱇鰲鱆鰾鱚鱠鱧鱶鱸鳧鳬鳰鴉鴈鳫鴃鴆鴪鴦鶯鴣鴟鵄鴕鴒鵁鴿鴾鵆鵈'],
- [0xea40, '鵝鵞鵤鵑鵐鵙鵲鶉鶇鶫鵯鵺鶚鶤鶩鶲鷄鷁鶻鶸鶺鷆鷏鷂鷙鷓鷸鷦鷭鷯鷽鸚鸛鸞鹵鹹鹽麁麈麋麌麒麕麑麝麥麩麸麪麭靡黌黎黏黐黔黜點黝黠黥黨黯'],
- [0xea80, '黴黶黷黹黻黼黽鼇鼈皷鼕鼡鼬鼾齊齒齔齣齟齠齡齦齧齬齪齷齲齶龕龜龠堯槇遙瑤凜熙']
-]
-
-module.exports = function toSJIS (utf8Char) {
- if (!utf8Char || utf8Char === '') return
-
- for (let i = 0; i < SJIS_UTF8.length; i++) {
- const kanji = SJIS_UTF8[i][1]
-
- const posIndex = kanji.indexOf(utf8Char)
- if (posIndex >= 0) {
- return SJIS_UTF8[i][0] + posIndex
- }
- }
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/browser.js b/uds-auth/lib/qrcode-lib/lib/browser.js
deleted file mode 100644
index dc8a9998..00000000
--- a/uds-auth/lib/qrcode-lib/lib/browser.js
+++ /dev/null
@@ -1,76 +0,0 @@
-
-const canPromise = require('./can-promise')
-
-const QRCode = require('./core/qrcode')
-const CanvasRenderer = require('./renderer/canvas')
-const SvgRenderer = require('./renderer/svg-tag.js')
-
-function renderCanvas (renderFunc, canvas, text, opts, cb) {
- const args = [].slice.call(arguments, 1)
- const argsNum = args.length
- const isLastArgCb = typeof args[argsNum - 1] === 'function'
-
- if (!isLastArgCb && !canPromise()) {
- throw new Error('Callback required as last argument')
- }
-
- if (isLastArgCb) {
- if (argsNum < 2) {
- throw new Error('Too few arguments provided')
- }
-
- if (argsNum === 2) {
- cb = text
- text = canvas
- canvas = opts = undefined
- } else if (argsNum === 3) {
- if (canvas.getContext && typeof cb === 'undefined') {
- cb = opts
- opts = undefined
- } else {
- cb = opts
- opts = text
- text = canvas
- canvas = undefined
- }
- }
- } else {
- if (argsNum < 1) {
- throw new Error('Too few arguments provided')
- }
-
- if (argsNum === 1) {
- text = canvas
- canvas = opts = undefined
- } else if (argsNum === 2 && !canvas.getContext) {
- opts = text
- text = canvas
- canvas = undefined
- }
-
- return new Promise(function (resolve, reject) {
- try {
- const data = QRCode.create(text, opts)
- resolve(renderFunc(data, canvas, opts))
- } catch (e) {
- reject(e)
- }
- })
- }
-
- try {
- const data = QRCode.create(text, opts)
- cb(null, renderFunc(data, canvas, opts))
- } catch (e) {
- cb(e)
- }
-}
-
-exports.create = QRCode.create
-exports.toCanvas = renderCanvas.bind(null, CanvasRenderer.render)
-exports.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL)
-
-// only svg for now.
-exports.toString = renderCanvas.bind(null, function (data, _, opts) {
- return SvgRenderer.render(data, opts)
-})
diff --git a/uds-auth/lib/qrcode-lib/lib/can-promise.js b/uds-auth/lib/qrcode-lib/lib/can-promise.js
deleted file mode 100644
index 77267f15..00000000
--- a/uds-auth/lib/qrcode-lib/lib/can-promise.js
+++ /dev/null
@@ -1,7 +0,0 @@
-// can-promise has a crash in some versions of react native that dont have
-// standard global objects
-// https://github.com/soldair/node-qrcode/issues/157
-
-module.exports = function () {
- return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/alignment-pattern.js b/uds-auth/lib/qrcode-lib/lib/core/alignment-pattern.js
deleted file mode 100644
index 63c3154e..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/alignment-pattern.js
+++ /dev/null
@@ -1,83 +0,0 @@
-/**
- * Alignment pattern are fixed reference pattern in defined positions
- * in a matrix symbology, which enables the decode software to re-synchronise
- * the coordinate mapping of the image modules in the event of moderate amounts
- * of distortion of the image.
- *
- * Alignment patterns are present only in QR Code symbols of version 2 or larger
- * and their number depends on the symbol version.
- */
-
-const getSymbolSize = require('./utils').getSymbolSize
-
-/**
- * Calculate the row/column coordinates of the center module of each alignment pattern
- * for the specified QR Code version.
- *
- * The alignment patterns are positioned symmetrically on either side of the diagonal
- * running from the top left corner of the symbol to the bottom right corner.
- *
- * Since positions are simmetrical only half of the coordinates are returned.
- * Each item of the array will represent in turn the x and y coordinate.
- * @see {@link getPositions}
- *
- * @param {Number} version QR Code version
- * @return {Array} Array of coordinate
- */
-exports.getRowColCoords = function getRowColCoords (version) {
- if (version === 1) return []
-
- const posCount = Math.floor(version / 7) + 2
- const size = getSymbolSize(version)
- const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2
- const positions = [size - 7] // Last coord is always (size - 7)
-
- for (let i = 1; i < posCount - 1; i++) {
- positions[i] = positions[i - 1] - intervals
- }
-
- positions.push(6) // First coord is always 6
-
- return positions.reverse()
-}
-
-/**
- * Returns an array containing the positions of each alignment pattern.
- * Each array's element represent the center point of the pattern as (x, y) coordinates
- *
- * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}
- * and filtering out the items that overlaps with finder pattern
- *
- * @example
- * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.
- * The alignment patterns, therefore, are to be centered on (row, column)
- * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).
- * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns
- * and are not therefore used for alignment patterns.
- *
- * let pos = getPositions(7)
- * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]
- *
- * @param {Number} version QR Code version
- * @return {Array} Array of coordinates
- */
-exports.getPositions = function getPositions (version) {
- const coords = []
- const pos = exports.getRowColCoords(version)
- const posLength = pos.length
-
- for (let i = 0; i < posLength; i++) {
- for (let j = 0; j < posLength; j++) {
- // Skip if position is occupied by finder patterns
- if ((i === 0 && j === 0) || // top-left
- (i === 0 && j === posLength - 1) || // bottom-left
- (i === posLength - 1 && j === 0)) { // top-right
- continue
- }
-
- coords.push([pos[i], pos[j]])
- }
- }
-
- return coords
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/alphanumeric-data.js b/uds-auth/lib/qrcode-lib/lib/core/alphanumeric-data.js
deleted file mode 100644
index 29ddf50c..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/alphanumeric-data.js
+++ /dev/null
@@ -1,59 +0,0 @@
-const Mode = require('./mode')
-
-/**
- * Array of characters available in alphanumeric mode
- *
- * As per QR Code specification, to each character
- * is assigned a value from 0 to 44 which in this case coincides
- * with the array index
- *
- * @type {Array}
- */
-const ALPHA_NUM_CHARS = [
- '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
- 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M',
- 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
- ' ', '$', '%', '*', '+', '-', '.', '/', ':'
-]
-
-function AlphanumericData (data) {
- this.mode = Mode.ALPHANUMERIC
- this.data = data
-}
-
-AlphanumericData.getBitsLength = function getBitsLength (length) {
- return 11 * Math.floor(length / 2) + 6 * (length % 2)
-}
-
-AlphanumericData.prototype.getLength = function getLength () {
- return this.data.length
-}
-
-AlphanumericData.prototype.getBitsLength = function getBitsLength () {
- return AlphanumericData.getBitsLength(this.data.length)
-}
-
-AlphanumericData.prototype.write = function write (bitBuffer) {
- let i
-
- // Input data characters are divided into groups of two characters
- // and encoded as 11-bit binary codes.
- for (i = 0; i + 2 <= this.data.length; i += 2) {
- // The character value of the first character is multiplied by 45
- let value = ALPHA_NUM_CHARS.indexOf(this.data[i]) * 45
-
- // The character value of the second digit is added to the product
- value += ALPHA_NUM_CHARS.indexOf(this.data[i + 1])
-
- // The sum is then stored as 11-bit binary number
- bitBuffer.put(value, 11)
- }
-
- // If the number of input data characters is not a multiple of two,
- // the character value of the final character is encoded as a 6-bit binary number.
- if (this.data.length % 2) {
- bitBuffer.put(ALPHA_NUM_CHARS.indexOf(this.data[i]), 6)
- }
-}
-
-module.exports = AlphanumericData
diff --git a/uds-auth/lib/qrcode-lib/lib/core/bit-buffer.js b/uds-auth/lib/qrcode-lib/lib/core/bit-buffer.js
deleted file mode 100644
index 5b41d3d9..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/bit-buffer.js
+++ /dev/null
@@ -1,37 +0,0 @@
-function BitBuffer () {
- this.buffer = []
- this.length = 0
-}
-
-BitBuffer.prototype = {
-
- get: function (index) {
- const bufIndex = Math.floor(index / 8)
- return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1
- },
-
- put: function (num, length) {
- for (let i = 0; i < length; i++) {
- this.putBit(((num >>> (length - i - 1)) & 1) === 1)
- }
- },
-
- getLengthInBits: function () {
- return this.length
- },
-
- putBit: function (bit) {
- const bufIndex = Math.floor(this.length / 8)
- if (this.buffer.length <= bufIndex) {
- this.buffer.push(0)
- }
-
- if (bit) {
- this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))
- }
-
- this.length++
- }
-}
-
-module.exports = BitBuffer
diff --git a/uds-auth/lib/qrcode-lib/lib/core/bit-matrix.js b/uds-auth/lib/qrcode-lib/lib/core/bit-matrix.js
deleted file mode 100644
index 439138b9..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/bit-matrix.js
+++ /dev/null
@@ -1,65 +0,0 @@
-/**
- * Helper class to handle QR Code symbol modules
- *
- * @param {Number} size Symbol size
- */
-function BitMatrix (size) {
- if (!size || size < 1) {
- throw new Error('BitMatrix size must be defined and greater than 0')
- }
-
- this.size = size
- this.data = new Uint8Array(size * size)
- this.reservedBit = new Uint8Array(size * size)
-}
-
-/**
- * Set bit value at specified location
- * If reserved flag is set, this bit will be ignored during masking process
- *
- * @param {Number} row
- * @param {Number} col
- * @param {Boolean} value
- * @param {Boolean} reserved
- */
-BitMatrix.prototype.set = function (row, col, value, reserved) {
- const index = row * this.size + col
- this.data[index] = value
- if (reserved) this.reservedBit[index] = true
-}
-
-/**
- * Returns bit value at specified location
- *
- * @param {Number} row
- * @param {Number} col
- * @return {Boolean}
- */
-BitMatrix.prototype.get = function (row, col) {
- return this.data[row * this.size + col]
-}
-
-/**
- * Applies xor operator at specified location
- * (used during masking process)
- *
- * @param {Number} row
- * @param {Number} col
- * @param {Boolean} value
- */
-BitMatrix.prototype.xor = function (row, col, value) {
- this.data[row * this.size + col] ^= value
-}
-
-/**
- * Check if bit at specified location is reserved
- *
- * @param {Number} row
- * @param {Number} col
- * @return {Boolean}
- */
-BitMatrix.prototype.isReserved = function (row, col) {
- return this.reservedBit[row * this.size + col]
-}
-
-module.exports = BitMatrix
diff --git a/uds-auth/lib/qrcode-lib/lib/core/byte-data.js b/uds-auth/lib/qrcode-lib/lib/core/byte-data.js
deleted file mode 100644
index d562fcc9..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/byte-data.js
+++ /dev/null
@@ -1,30 +0,0 @@
-const Mode = require('./mode')
-
-function ByteData (data) {
- this.mode = Mode.BYTE
- if (typeof (data) === 'string') {
- this.data = new TextEncoder().encode(data)
- } else {
- this.data = new Uint8Array(data)
- }
-}
-
-ByteData.getBitsLength = function getBitsLength (length) {
- return length * 8
-}
-
-ByteData.prototype.getLength = function getLength () {
- return this.data.length
-}
-
-ByteData.prototype.getBitsLength = function getBitsLength () {
- return ByteData.getBitsLength(this.data.length)
-}
-
-ByteData.prototype.write = function (bitBuffer) {
- for (let i = 0, l = this.data.length; i < l; i++) {
- bitBuffer.put(this.data[i], 8)
- }
-}
-
-module.exports = ByteData
diff --git a/uds-auth/lib/qrcode-lib/lib/core/dijkstra.js b/uds-auth/lib/qrcode-lib/lib/core/dijkstra.js
deleted file mode 100644
index 06d69894..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/dijkstra.js
+++ /dev/null
@@ -1,122 +0,0 @@
-'use strict'
-
-/******************************************************************************
- * Vendored dijkstrajs (MIT, Wyatt Baldwin / tcort)
- * https://github.com/tcort/dijkstrajs
- *
- * 原本通过 node_modules 中的 dijkstrajs 包提供;插件打包部署时不会携带
- * node_modules,导致 qrcode 库加载失败。这里内建为普通源码文件,
- * 使 qrcode-lib 在任何部署方式下都零外部依赖可用。
- *****************************************************************************/
-var dijkstra = {
- single_source_shortest_paths: function (graph, s, d) {
- // Predecessor map for each node that has been encountered.
- // node ID => predecessor node ID
- var predecessors = {}
-
- // Costs of shortest paths from s to all nodes encountered.
- // node ID => cost
- var costs = {}
- costs[s] = 0
-
- var open = dijkstra.PriorityQueue.make()
- open.push(s, 0)
-
- var closest,
- u, v,
- costOfSToU,
- adjacentNodes,
- costOfE,
- costOfSToUPlusCostOfE,
- costOfSToV,
- firstVisit
- while (!open.empty()) {
- closest = open.pop()
- u = closest.value
- costOfSToU = closest.cost
-
- adjacentNodes = graph[u] || {}
-
- for (v in adjacentNodes) {
- if (adjacentNodes.hasOwnProperty(v)) {
- costOfE = adjacentNodes[v]
- costOfSToUPlusCostOfE = costOfSToU + costOfE
-
- costOfSToV = costs[v]
- firstVisit = (typeof costs[v] === 'undefined')
- if (firstVisit || costOfSToV > costOfSToUPlusCostOfE) {
- costs[v] = costOfSToUPlusCostOfE
- open.push(v, costOfSToUPlusCostOfE)
- predecessors[v] = u
- }
- }
- }
- }
-
- if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {
- var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('')
- throw new Error(msg)
- }
-
- return predecessors
- },
-
- extract_shortest_path_from_predecessor_list: function (predecessors, d) {
- var nodes = []
- var u = d
- var predecessor
- while (u) {
- nodes.push(u)
- predecessor = predecessors[u]
- u = predecessors[u]
- }
- nodes.reverse()
- return nodes
- },
-
- find_path: function (graph, s, d) {
- var predecessors = dijkstra.single_source_shortest_paths(graph, s, d)
- return dijkstra.extract_shortest_path_from_predecessor_list(
- predecessors, d)
- },
-
- /**
- * A very naive priority queue implementation.
- */
- PriorityQueue: {
- make: function (opts) {
- var T = dijkstra.PriorityQueue
- var t = {}
- var key
- opts = opts || {}
- for (key in T) {
- if (T.hasOwnProperty(key)) {
- t[key] = T[key]
- }
- }
- t.queue = []
- t.sorter = opts.sorter || T.defaultSorter
- return t
- },
-
- defaultSorter: function (a, b) {
- return a.cost - b.cost
- },
-
- push: function (value, cost) {
- var item = { value: value, cost: cost }
- this.queue.push(item)
- this.queue.sort(this.sorter)
- },
-
- pop: function () {
- return this.queue.shift()
- },
-
- empty: function () {
- return this.queue.length === 0
- }
- }
-}
-
-module.exports = dijkstra
diff --git a/uds-auth/lib/qrcode-lib/lib/core/error-correction-code.js b/uds-auth/lib/qrcode-lib/lib/core/error-correction-code.js
deleted file mode 100644
index 5f2fcebb..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/error-correction-code.js
+++ /dev/null
@@ -1,135 +0,0 @@
-const ECLevel = require('./error-correction-level')
-
-const EC_BLOCKS_TABLE = [
-// L M Q H
- 1, 1, 1, 1,
- 1, 1, 1, 1,
- 1, 1, 2, 2,
- 1, 2, 2, 4,
- 1, 2, 4, 4,
- 2, 4, 4, 4,
- 2, 4, 6, 5,
- 2, 4, 6, 6,
- 2, 5, 8, 8,
- 4, 5, 8, 8,
- 4, 5, 8, 11,
- 4, 8, 10, 11,
- 4, 9, 12, 16,
- 4, 9, 16, 16,
- 6, 10, 12, 18,
- 6, 10, 17, 16,
- 6, 11, 16, 19,
- 6, 13, 18, 21,
- 7, 14, 21, 25,
- 8, 16, 20, 25,
- 8, 17, 23, 25,
- 9, 17, 23, 34,
- 9, 18, 25, 30,
- 10, 20, 27, 32,
- 12, 21, 29, 35,
- 12, 23, 34, 37,
- 12, 25, 34, 40,
- 13, 26, 35, 42,
- 14, 28, 38, 45,
- 15, 29, 40, 48,
- 16, 31, 43, 51,
- 17, 33, 45, 54,
- 18, 35, 48, 57,
- 19, 37, 51, 60,
- 19, 38, 53, 63,
- 20, 40, 56, 66,
- 21, 43, 59, 70,
- 22, 45, 62, 74,
- 24, 47, 65, 77,
- 25, 49, 68, 81
-]
-
-const EC_CODEWORDS_TABLE = [
-// L M Q H
- 7, 10, 13, 17,
- 10, 16, 22, 28,
- 15, 26, 36, 44,
- 20, 36, 52, 64,
- 26, 48, 72, 88,
- 36, 64, 96, 112,
- 40, 72, 108, 130,
- 48, 88, 132, 156,
- 60, 110, 160, 192,
- 72, 130, 192, 224,
- 80, 150, 224, 264,
- 96, 176, 260, 308,
- 104, 198, 288, 352,
- 120, 216, 320, 384,
- 132, 240, 360, 432,
- 144, 280, 408, 480,
- 168, 308, 448, 532,
- 180, 338, 504, 588,
- 196, 364, 546, 650,
- 224, 416, 600, 700,
- 224, 442, 644, 750,
- 252, 476, 690, 816,
- 270, 504, 750, 900,
- 300, 560, 810, 960,
- 312, 588, 870, 1050,
- 336, 644, 952, 1110,
- 360, 700, 1020, 1200,
- 390, 728, 1050, 1260,
- 420, 784, 1140, 1350,
- 450, 812, 1200, 1440,
- 480, 868, 1290, 1530,
- 510, 924, 1350, 1620,
- 540, 980, 1440, 1710,
- 570, 1036, 1530, 1800,
- 570, 1064, 1590, 1890,
- 600, 1120, 1680, 1980,
- 630, 1204, 1770, 2100,
- 660, 1260, 1860, 2220,
- 720, 1316, 1950, 2310,
- 750, 1372, 2040, 2430
-]
-
-/**
- * Returns the number of error correction block that the QR Code should contain
- * for the specified version and error correction level.
- *
- * @param {Number} version QR Code version
- * @param {Number} errorCorrectionLevel Error correction level
- * @return {Number} Number of error correction blocks
- */
-exports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {
- switch (errorCorrectionLevel) {
- case ECLevel.L:
- return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]
- case ECLevel.M:
- return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]
- case ECLevel.Q:
- return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]
- case ECLevel.H:
- return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]
- default:
- return undefined
- }
-}
-
-/**
- * Returns the number of error correction codewords to use for the specified
- * version and error correction level.
- *
- * @param {Number} version QR Code version
- * @param {Number} errorCorrectionLevel Error correction level
- * @return {Number} Number of error correction codewords
- */
-exports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {
- switch (errorCorrectionLevel) {
- case ECLevel.L:
- return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]
- case ECLevel.M:
- return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]
- case ECLevel.Q:
- return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]
- case ECLevel.H:
- return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]
- default:
- return undefined
- }
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/error-correction-level.js b/uds-auth/lib/qrcode-lib/lib/core/error-correction-level.js
deleted file mode 100644
index 07433d6b..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/error-correction-level.js
+++ /dev/null
@@ -1,50 +0,0 @@
-exports.L = { bit: 1 }
-exports.M = { bit: 0 }
-exports.Q = { bit: 3 }
-exports.H = { bit: 2 }
-
-function fromString (string) {
- if (typeof string !== 'string') {
- throw new Error('Param is not a string')
- }
-
- const lcStr = string.toLowerCase()
-
- switch (lcStr) {
- case 'l':
- case 'low':
- return exports.L
-
- case 'm':
- case 'medium':
- return exports.M
-
- case 'q':
- case 'quartile':
- return exports.Q
-
- case 'h':
- case 'high':
- return exports.H
-
- default:
- throw new Error('Unknown EC Level: ' + string)
- }
-}
-
-exports.isValid = function isValid (level) {
- return level && typeof level.bit !== 'undefined' &&
- level.bit >= 0 && level.bit < 4
-}
-
-exports.from = function from (value, defaultValue) {
- if (exports.isValid(value)) {
- return value
- }
-
- try {
- return fromString(value)
- } catch (e) {
- return defaultValue
- }
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/finder-pattern.js b/uds-auth/lib/qrcode-lib/lib/core/finder-pattern.js
deleted file mode 100644
index 4613c041..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/finder-pattern.js
+++ /dev/null
@@ -1,22 +0,0 @@
-const getSymbolSize = require('./utils').getSymbolSize
-const FINDER_PATTERN_SIZE = 7
-
-/**
- * Returns an array containing the positions of each finder pattern.
- * Each array's element represent the top-left point of the pattern as (x, y) coordinates
- *
- * @param {Number} version QR Code version
- * @return {Array} Array of coordinates
- */
-exports.getPositions = function getPositions (version) {
- const size = getSymbolSize(version)
-
- return [
- // top-left
- [0, 0],
- // top-right
- [size - FINDER_PATTERN_SIZE, 0],
- // bottom-left
- [0, size - FINDER_PATTERN_SIZE]
- ]
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/format-info.js b/uds-auth/lib/qrcode-lib/lib/core/format-info.js
deleted file mode 100644
index 11fe9efa..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/format-info.js
+++ /dev/null
@@ -1,29 +0,0 @@
-const Utils = require('./utils')
-
-const G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0)
-const G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1)
-const G15_BCH = Utils.getBCHDigit(G15)
-
-/**
- * Returns format information with relative error correction bits
- *
- * The format information is a 15-bit sequence containing 5 data bits,
- * with 10 error correction bits calculated using the (15, 5) BCH code.
- *
- * @param {Number} errorCorrectionLevel Error correction level
- * @param {Number} mask Mask pattern
- * @return {Number} Encoded format information bits
- */
-exports.getEncodedBits = function getEncodedBits (errorCorrectionLevel, mask) {
- const data = ((errorCorrectionLevel.bit << 3) | mask)
- let d = data << 10
-
- while (Utils.getBCHDigit(d) - G15_BCH >= 0) {
- d ^= (G15 << (Utils.getBCHDigit(d) - G15_BCH))
- }
-
- // xor final data with mask pattern in order to ensure that
- // no combination of Error Correction Level and data mask pattern
- // will result in an all-zero data string
- return ((data << 10) | d) ^ G15_MASK
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/galois-field.js b/uds-auth/lib/qrcode-lib/lib/core/galois-field.js
deleted file mode 100644
index 8125179c..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/galois-field.js
+++ /dev/null
@@ -1,69 +0,0 @@
-const EXP_TABLE = new Uint8Array(512)
-const LOG_TABLE = new Uint8Array(256)
-/**
- * Precompute the log and anti-log tables for faster computation later
- *
- * For each possible value in the galois field 2^8, we will pre-compute
- * the logarithm and anti-logarithm (exponential) of this value
- *
- * ref {@link https://en.wikiversity.org/wiki/Reed%E2%80%93Solomon_codes_for_coders#Introduction_to_mathematical_fields}
- */
-;(function initTables () {
- let x = 1
- for (let i = 0; i < 255; i++) {
- EXP_TABLE[i] = x
- LOG_TABLE[x] = i
-
- x <<= 1 // multiply by 2
-
- // The QR code specification says to use byte-wise modulo 100011101 arithmetic.
- // This means that when a number is 256 or larger, it should be XORed with 0x11D.
- if (x & 0x100) { // similar to x >= 256, but a lot faster (because 0x100 == 256)
- x ^= 0x11D
- }
- }
-
- // Optimization: double the size of the anti-log table so that we don't need to mod 255 to
- // stay inside the bounds (because we will mainly use this table for the multiplication of
- // two GF numbers, no more).
- // @see {@link mul}
- for (let i = 255; i < 512; i++) {
- EXP_TABLE[i] = EXP_TABLE[i - 255]
- }
-}())
-
-/**
- * Returns log value of n inside Galois Field
- *
- * @param {Number} n
- * @return {Number}
- */
-exports.log = function log (n) {
- if (n < 1) throw new Error('log(' + n + ')')
- return LOG_TABLE[n]
-}
-
-/**
- * Returns anti-log value of n inside Galois Field
- *
- * @param {Number} n
- * @return {Number}
- */
-exports.exp = function exp (n) {
- return EXP_TABLE[n]
-}
-
-/**
- * Multiplies two number inside Galois Field
- *
- * @param {Number} x
- * @param {Number} y
- * @return {Number}
- */
-exports.mul = function mul (x, y) {
- if (x === 0 || y === 0) return 0
-
- // should be EXP_TABLE[(LOG_TABLE[x] + LOG_TABLE[y]) % 255] if EXP_TABLE wasn't oversized
- // @see {@link initTables}
- return EXP_TABLE[LOG_TABLE[x] + LOG_TABLE[y]]
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/kanji-data.js b/uds-auth/lib/qrcode-lib/lib/core/kanji-data.js
deleted file mode 100644
index a1d9a692..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/kanji-data.js
+++ /dev/null
@@ -1,54 +0,0 @@
-const Mode = require('./mode')
-const Utils = require('./utils')
-
-function KanjiData (data) {
- this.mode = Mode.KANJI
- this.data = data
-}
-
-KanjiData.getBitsLength = function getBitsLength (length) {
- return length * 13
-}
-
-KanjiData.prototype.getLength = function getLength () {
- return this.data.length
-}
-
-KanjiData.prototype.getBitsLength = function getBitsLength () {
- return KanjiData.getBitsLength(this.data.length)
-}
-
-KanjiData.prototype.write = function (bitBuffer) {
- let i
-
- // In the Shift JIS system, Kanji characters are represented by a two byte combination.
- // These byte values are shifted from the JIS X 0208 values.
- // JIS X 0208 gives details of the shift coded representation.
- for (i = 0; i < this.data.length; i++) {
- let value = Utils.toSJIS(this.data[i])
-
- // For characters with Shift JIS values from 0x8140 to 0x9FFC:
- if (value >= 0x8140 && value <= 0x9FFC) {
- // Subtract 0x8140 from Shift JIS value
- value -= 0x8140
-
- // For characters with Shift JIS values from 0xE040 to 0xEBBF
- } else if (value >= 0xE040 && value <= 0xEBBF) {
- // Subtract 0xC140 from Shift JIS value
- value -= 0xC140
- } else {
- throw new Error(
- 'Invalid SJIS character: ' + this.data[i] + '\n' +
- 'Make sure your charset is UTF-8')
- }
-
- // Multiply most significant byte of result by 0xC0
- // and add least significant byte to product
- value = (((value >>> 8) & 0xff) * 0xC0) + (value & 0xff)
-
- // Convert result to a 13-bit binary string
- bitBuffer.put(value, 13)
- }
-}
-
-module.exports = KanjiData
diff --git a/uds-auth/lib/qrcode-lib/lib/core/mask-pattern.js b/uds-auth/lib/qrcode-lib/lib/core/mask-pattern.js
deleted file mode 100644
index f5f8900e..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/mask-pattern.js
+++ /dev/null
@@ -1,234 +0,0 @@
-/**
- * Data mask pattern reference
- * @type {Object}
- */
-exports.Patterns = {
- PATTERN000: 0,
- PATTERN001: 1,
- PATTERN010: 2,
- PATTERN011: 3,
- PATTERN100: 4,
- PATTERN101: 5,
- PATTERN110: 6,
- PATTERN111: 7
-}
-
-/**
- * Weighted penalty scores for the undesirable features
- * @type {Object}
- */
-const PenaltyScores = {
- N1: 3,
- N2: 3,
- N3: 40,
- N4: 10
-}
-
-/**
- * Check if mask pattern value is valid
- *
- * @param {Number} mask Mask pattern
- * @return {Boolean} true if valid, false otherwise
- */
-exports.isValid = function isValid (mask) {
- return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7
-}
-
-/**
- * Returns mask pattern from a value.
- * If value is not valid, returns undefined
- *
- * @param {Number|String} value Mask pattern value
- * @return {Number} Valid mask pattern or undefined
- */
-exports.from = function from (value) {
- return exports.isValid(value) ? parseInt(value, 10) : undefined
-}
-
-/**
-* Find adjacent modules in row/column with the same color
-* and assign a penalty value.
-*
-* Points: N1 + i
-* i is the amount by which the number of adjacent modules of the same color exceeds 5
-*/
-exports.getPenaltyN1 = function getPenaltyN1 (data) {
- const size = data.size
- let points = 0
- let sameCountCol = 0
- let sameCountRow = 0
- let lastCol = null
- let lastRow = null
-
- for (let row = 0; row < size; row++) {
- sameCountCol = sameCountRow = 0
- lastCol = lastRow = null
-
- for (let col = 0; col < size; col++) {
- let module = data.get(row, col)
- if (module === lastCol) {
- sameCountCol++
- } else {
- if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)
- lastCol = module
- sameCountCol = 1
- }
-
- module = data.get(col, row)
- if (module === lastRow) {
- sameCountRow++
- } else {
- if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)
- lastRow = module
- sameCountRow = 1
- }
- }
-
- if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)
- if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)
- }
-
- return points
-}
-
-/**
- * Find 2x2 blocks with the same color and assign a penalty value
- *
- * Points: N2 * (m - 1) * (n - 1)
- */
-exports.getPenaltyN2 = function getPenaltyN2 (data) {
- const size = data.size
- let points = 0
-
- for (let row = 0; row < size - 1; row++) {
- for (let col = 0; col < size - 1; col++) {
- const last = data.get(row, col) +
- data.get(row, col + 1) +
- data.get(row + 1, col) +
- data.get(row + 1, col + 1)
-
- if (last === 4 || last === 0) points++
- }
- }
-
- return points * PenaltyScores.N2
-}
-
-/**
- * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,
- * preceded or followed by light area 4 modules wide
- *
- * Points: N3 * number of pattern found
- */
-exports.getPenaltyN3 = function getPenaltyN3 (data) {
- const size = data.size
- let points = 0
- let bitsCol = 0
- let bitsRow = 0
-
- for (let row = 0; row < size; row++) {
- bitsCol = bitsRow = 0
- for (let col = 0; col < size; col++) {
- bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)
- if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++
-
- bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)
- if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++
- }
- }
-
- return points * PenaltyScores.N3
-}
-
-/**
- * Calculate proportion of dark modules in entire symbol
- *
- * Points: N4 * k
- *
- * k is the rating of the deviation of the proportion of dark modules
- * in the symbol from 50% in steps of 5%
- */
-exports.getPenaltyN4 = function getPenaltyN4 (data) {
- let darkCount = 0
- const modulesCount = data.data.length
-
- for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]
-
- const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)
-
- return k * PenaltyScores.N4
-}
-
-/**
- * Return mask value at given position
- *
- * @param {Number} maskPattern Pattern reference value
- * @param {Number} i Row
- * @param {Number} j Column
- * @return {Boolean} Mask value
- */
-function getMaskAt (maskPattern, i, j) {
- switch (maskPattern) {
- case exports.Patterns.PATTERN000: return (i + j) % 2 === 0
- case exports.Patterns.PATTERN001: return i % 2 === 0
- case exports.Patterns.PATTERN010: return j % 3 === 0
- case exports.Patterns.PATTERN011: return (i + j) % 3 === 0
- case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0
- case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0
- case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0
- case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0
-
- default: throw new Error('bad maskPattern:' + maskPattern)
- }
-}
-
-/**
- * Apply a mask pattern to a BitMatrix
- *
- * @param {Number} pattern Pattern reference number
- * @param {BitMatrix} data BitMatrix data
- */
-exports.applyMask = function applyMask (pattern, data) {
- const size = data.size
-
- for (let col = 0; col < size; col++) {
- for (let row = 0; row < size; row++) {
- if (data.isReserved(row, col)) continue
- data.xor(row, col, getMaskAt(pattern, row, col))
- }
- }
-}
-
-/**
- * Returns the best mask pattern for data
- *
- * @param {BitMatrix} data
- * @return {Number} Mask pattern reference number
- */
-exports.getBestMask = function getBestMask (data, setupFormatFunc) {
- const numPatterns = Object.keys(exports.Patterns).length
- let bestPattern = 0
- let lowerPenalty = Infinity
-
- for (let p = 0; p < numPatterns; p++) {
- setupFormatFunc(p)
- exports.applyMask(p, data)
-
- // Calculate penalty
- const penalty =
- exports.getPenaltyN1(data) +
- exports.getPenaltyN2(data) +
- exports.getPenaltyN3(data) +
- exports.getPenaltyN4(data)
-
- // Undo previously applied mask
- exports.applyMask(p, data)
-
- if (penalty < lowerPenalty) {
- lowerPenalty = penalty
- bestPattern = p
- }
- }
-
- return bestPattern
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/mode.js b/uds-auth/lib/qrcode-lib/lib/core/mode.js
deleted file mode 100644
index fd95a6ef..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/mode.js
+++ /dev/null
@@ -1,167 +0,0 @@
-const VersionCheck = require('./version-check')
-const Regex = require('./regex')
-
-/**
- * Numeric mode encodes data from the decimal digit set (0 - 9)
- * (byte values 30HEX to 39HEX).
- * Normally, 3 data characters are represented by 10 bits.
- *
- * @type {Object}
- */
-exports.NUMERIC = {
- id: 'Numeric',
- bit: 1 << 0,
- ccBits: [10, 12, 14]
-}
-
-/**
- * Alphanumeric mode encodes data from a set of 45 characters,
- * i.e. 10 numeric digits (0 - 9),
- * 26 alphabetic characters (A - Z),
- * and 9 symbols (SP, $, %, *, +, -, ., /, :).
- * Normally, two input characters are represented by 11 bits.
- *
- * @type {Object}
- */
-exports.ALPHANUMERIC = {
- id: 'Alphanumeric',
- bit: 1 << 1,
- ccBits: [9, 11, 13]
-}
-
-/**
- * In byte mode, data is encoded at 8 bits per character.
- *
- * @type {Object}
- */
-exports.BYTE = {
- id: 'Byte',
- bit: 1 << 2,
- ccBits: [8, 16, 16]
-}
-
-/**
- * The Kanji mode efficiently encodes Kanji characters in accordance with
- * the Shift JIS system based on JIS X 0208.
- * The Shift JIS values are shifted from the JIS X 0208 values.
- * JIS X 0208 gives details of the shift coded representation.
- * Each two-byte character value is compacted to a 13-bit binary codeword.
- *
- * @type {Object}
- */
-exports.KANJI = {
- id: 'Kanji',
- bit: 1 << 3,
- ccBits: [8, 10, 12]
-}
-
-/**
- * Mixed mode will contain a sequences of data in a combination of any of
- * the modes described above
- *
- * @type {Object}
- */
-exports.MIXED = {
- bit: -1
-}
-
-/**
- * Returns the number of bits needed to store the data length
- * according to QR Code specifications.
- *
- * @param {Mode} mode Data mode
- * @param {Number} version QR Code version
- * @return {Number} Number of bits
- */
-exports.getCharCountIndicator = function getCharCountIndicator (mode, version) {
- if (!mode.ccBits) throw new Error('Invalid mode: ' + mode)
-
- if (!VersionCheck.isValid(version)) {
- throw new Error('Invalid version: ' + version)
- }
-
- if (version >= 1 && version < 10) return mode.ccBits[0]
- else if (version < 27) return mode.ccBits[1]
- return mode.ccBits[2]
-}
-
-/**
- * Returns the most efficient mode to store the specified data
- *
- * @param {String} dataStr Input data string
- * @return {Mode} Best mode
- */
-exports.getBestModeForData = function getBestModeForData (dataStr) {
- if (Regex.testNumeric(dataStr)) return exports.NUMERIC
- else if (Regex.testAlphanumeric(dataStr)) return exports.ALPHANUMERIC
- else if (Regex.testKanji(dataStr)) return exports.KANJI
- else return exports.BYTE
-}
-
-/**
- * Return mode name as string
- *
- * @param {Mode} mode Mode object
- * @returns {String} Mode name
- */
-exports.toString = function toString (mode) {
- if (mode && mode.id) return mode.id
- throw new Error('Invalid mode')
-}
-
-/**
- * Check if input param is a valid mode object
- *
- * @param {Mode} mode Mode object
- * @returns {Boolean} True if valid mode, false otherwise
- */
-exports.isValid = function isValid (mode) {
- return mode && mode.bit && mode.ccBits
-}
-
-/**
- * Get mode object from its name
- *
- * @param {String} string Mode name
- * @returns {Mode} Mode object
- */
-function fromString (string) {
- if (typeof string !== 'string') {
- throw new Error('Param is not a string')
- }
-
- const lcStr = string.toLowerCase()
-
- switch (lcStr) {
- case 'numeric':
- return exports.NUMERIC
- case 'alphanumeric':
- return exports.ALPHANUMERIC
- case 'kanji':
- return exports.KANJI
- case 'byte':
- return exports.BYTE
- default:
- throw new Error('Unknown mode: ' + string)
- }
-}
-
-/**
- * Returns mode from a value.
- * If value is not a valid mode, returns defaultValue
- *
- * @param {Mode|String} value Encoding mode
- * @param {Mode} defaultValue Fallback value
- * @return {Mode} Encoding mode
- */
-exports.from = function from (value, defaultValue) {
- if (exports.isValid(value)) {
- return value
- }
-
- try {
- return fromString(value)
- } catch (e) {
- return defaultValue
- }
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/numeric-data.js b/uds-auth/lib/qrcode-lib/lib/core/numeric-data.js
deleted file mode 100644
index 5223991c..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/numeric-data.js
+++ /dev/null
@@ -1,43 +0,0 @@
-const Mode = require('./mode')
-
-function NumericData (data) {
- this.mode = Mode.NUMERIC
- this.data = data.toString()
-}
-
-NumericData.getBitsLength = function getBitsLength (length) {
- return 10 * Math.floor(length / 3) + ((length % 3) ? ((length % 3) * 3 + 1) : 0)
-}
-
-NumericData.prototype.getLength = function getLength () {
- return this.data.length
-}
-
-NumericData.prototype.getBitsLength = function getBitsLength () {
- return NumericData.getBitsLength(this.data.length)
-}
-
-NumericData.prototype.write = function write (bitBuffer) {
- let i, group, value
-
- // The input data string is divided into groups of three digits,
- // and each group is converted to its 10-bit binary equivalent.
- for (i = 0; i + 3 <= this.data.length; i += 3) {
- group = this.data.substr(i, 3)
- value = parseInt(group, 10)
-
- bitBuffer.put(value, 10)
- }
-
- // If the number of input digits is not an exact multiple of three,
- // the final one or two digits are converted to 4 or 7 bits respectively.
- const remainingNum = this.data.length - i
- if (remainingNum > 0) {
- group = this.data.substr(i)
- value = parseInt(group, 10)
-
- bitBuffer.put(value, remainingNum * 3 + 1)
- }
-}
-
-module.exports = NumericData
diff --git a/uds-auth/lib/qrcode-lib/lib/core/polynomial.js b/uds-auth/lib/qrcode-lib/lib/core/polynomial.js
deleted file mode 100644
index c6ed9c2e..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/polynomial.js
+++ /dev/null
@@ -1,62 +0,0 @@
-const GF = require('./galois-field')
-
-/**
- * Multiplies two polynomials inside Galois Field
- *
- * @param {Uint8Array} p1 Polynomial
- * @param {Uint8Array} p2 Polynomial
- * @return {Uint8Array} Product of p1 and p2
- */
-exports.mul = function mul (p1, p2) {
- const coeff = new Uint8Array(p1.length + p2.length - 1)
-
- for (let i = 0; i < p1.length; i++) {
- for (let j = 0; j < p2.length; j++) {
- coeff[i + j] ^= GF.mul(p1[i], p2[j])
- }
- }
-
- return coeff
-}
-
-/**
- * Calculate the remainder of polynomials division
- *
- * @param {Uint8Array} divident Polynomial
- * @param {Uint8Array} divisor Polynomial
- * @return {Uint8Array} Remainder
- */
-exports.mod = function mod (divident, divisor) {
- let result = new Uint8Array(divident)
-
- while ((result.length - divisor.length) >= 0) {
- const coeff = result[0]
-
- for (let i = 0; i < divisor.length; i++) {
- result[i] ^= GF.mul(divisor[i], coeff)
- }
-
- // remove all zeros from buffer head
- let offset = 0
- while (offset < result.length && result[offset] === 0) offset++
- result = result.slice(offset)
- }
-
- return result
-}
-
-/**
- * Generate an irreducible generator polynomial of specified degree
- * (used by Reed-Solomon encoder)
- *
- * @param {Number} degree Degree of the generator polynomial
- * @return {Uint8Array} Buffer containing polynomial coefficients
- */
-exports.generateECPolynomial = function generateECPolynomial (degree) {
- let poly = new Uint8Array([1])
- for (let i = 0; i < degree; i++) {
- poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))
- }
-
- return poly
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/qrcode.js b/uds-auth/lib/qrcode-lib/lib/core/qrcode.js
deleted file mode 100644
index f76df54b..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/qrcode.js
+++ /dev/null
@@ -1,495 +0,0 @@
-const Utils = require('./utils')
-const ECLevel = require('./error-correction-level')
-const BitBuffer = require('./bit-buffer')
-const BitMatrix = require('./bit-matrix')
-const AlignmentPattern = require('./alignment-pattern')
-const FinderPattern = require('./finder-pattern')
-const MaskPattern = require('./mask-pattern')
-const ECCode = require('./error-correction-code')
-const ReedSolomonEncoder = require('./reed-solomon-encoder')
-const Version = require('./version')
-const FormatInfo = require('./format-info')
-const Mode = require('./mode')
-const Segments = require('./segments')
-
-/**
- * QRCode for JavaScript
- *
- * modified by Ryan Day for nodejs support
- * Copyright (c) 2011 Ryan Day
- *
- * Licensed under the MIT license:
- * http://www.opensource.org/licenses/mit-license.php
- *
-//---------------------------------------------------------------------
-// QRCode for JavaScript
-//
-// Copyright (c) 2009 Kazuhiko Arase
-//
-// URL: http://www.d-project.com/
-//
-// Licensed under the MIT license:
-// http://www.opensource.org/licenses/mit-license.php
-//
-// The word "QR Code" is registered trademark of
-// DENSO WAVE INCORPORATED
-// http://www.denso-wave.com/qrcode/faqpatent-e.html
-//
-//---------------------------------------------------------------------
-*/
-
-/**
- * Add finder patterns bits to matrix
- *
- * @param {BitMatrix} matrix Modules matrix
- * @param {Number} version QR Code version
- */
-function setupFinderPattern (matrix, version) {
- const size = matrix.size
- const pos = FinderPattern.getPositions(version)
-
- for (let i = 0; i < pos.length; i++) {
- const row = pos[i][0]
- const col = pos[i][1]
-
- for (let r = -1; r <= 7; r++) {
- if (row + r <= -1 || size <= row + r) continue
-
- for (let c = -1; c <= 7; c++) {
- if (col + c <= -1 || size <= col + c) continue
-
- if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||
- (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||
- (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {
- matrix.set(row + r, col + c, true, true)
- } else {
- matrix.set(row + r, col + c, false, true)
- }
- }
- }
- }
-}
-
-/**
- * Add timing pattern bits to matrix
- *
- * Note: this function must be called before {@link setupAlignmentPattern}
- *
- * @param {BitMatrix} matrix Modules matrix
- */
-function setupTimingPattern (matrix) {
- const size = matrix.size
-
- for (let r = 8; r < size - 8; r++) {
- const value = r % 2 === 0
- matrix.set(r, 6, value, true)
- matrix.set(6, r, value, true)
- }
-}
-
-/**
- * Add alignment patterns bits to matrix
- *
- * Note: this function must be called after {@link setupTimingPattern}
- *
- * @param {BitMatrix} matrix Modules matrix
- * @param {Number} version QR Code version
- */
-function setupAlignmentPattern (matrix, version) {
- const pos = AlignmentPattern.getPositions(version)
-
- for (let i = 0; i < pos.length; i++) {
- const row = pos[i][0]
- const col = pos[i][1]
-
- for (let r = -2; r <= 2; r++) {
- for (let c = -2; c <= 2; c++) {
- if (r === -2 || r === 2 || c === -2 || c === 2 ||
- (r === 0 && c === 0)) {
- matrix.set(row + r, col + c, true, true)
- } else {
- matrix.set(row + r, col + c, false, true)
- }
- }
- }
- }
-}
-
-/**
- * Add version info bits to matrix
- *
- * @param {BitMatrix} matrix Modules matrix
- * @param {Number} version QR Code version
- */
-function setupVersionInfo (matrix, version) {
- const size = matrix.size
- const bits = Version.getEncodedBits(version)
- let row, col, mod
-
- for (let i = 0; i < 18; i++) {
- row = Math.floor(i / 3)
- col = i % 3 + size - 8 - 3
- mod = ((bits >> i) & 1) === 1
-
- matrix.set(row, col, mod, true)
- matrix.set(col, row, mod, true)
- }
-}
-
-/**
- * Add format info bits to matrix
- *
- * @param {BitMatrix} matrix Modules matrix
- * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level
- * @param {Number} maskPattern Mask pattern reference value
- */
-function setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {
- const size = matrix.size
- const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)
- let i, mod
-
- for (i = 0; i < 15; i++) {
- mod = ((bits >> i) & 1) === 1
-
- // vertical
- if (i < 6) {
- matrix.set(i, 8, mod, true)
- } else if (i < 8) {
- matrix.set(i + 1, 8, mod, true)
- } else {
- matrix.set(size - 15 + i, 8, mod, true)
- }
-
- // horizontal
- if (i < 8) {
- matrix.set(8, size - i - 1, mod, true)
- } else if (i < 9) {
- matrix.set(8, 15 - i - 1 + 1, mod, true)
- } else {
- matrix.set(8, 15 - i - 1, mod, true)
- }
- }
-
- // fixed module
- matrix.set(size - 8, 8, 1, true)
-}
-
-/**
- * Add encoded data bits to matrix
- *
- * @param {BitMatrix} matrix Modules matrix
- * @param {Uint8Array} data Data codewords
- */
-function setupData (matrix, data) {
- const size = matrix.size
- let inc = -1
- let row = size - 1
- let bitIndex = 7
- let byteIndex = 0
-
- for (let col = size - 1; col > 0; col -= 2) {
- if (col === 6) col--
-
- while (true) {
- for (let c = 0; c < 2; c++) {
- if (!matrix.isReserved(row, col - c)) {
- let dark = false
-
- if (byteIndex < data.length) {
- dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)
- }
-
- matrix.set(row, col - c, dark)
- bitIndex--
-
- if (bitIndex === -1) {
- byteIndex++
- bitIndex = 7
- }
- }
- }
-
- row += inc
-
- if (row < 0 || size <= row) {
- row -= inc
- inc = -inc
- break
- }
- }
- }
-}
-
-/**
- * Create encoded codewords from data input
- *
- * @param {Number} version QR Code version
- * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level
- * @param {ByteData} data Data input
- * @return {Uint8Array} Buffer containing encoded codewords
- */
-function createData (version, errorCorrectionLevel, segments) {
- // Prepare data buffer
- const buffer = new BitBuffer()
-
- segments.forEach(function (data) {
- // prefix data with mode indicator (4 bits)
- buffer.put(data.mode.bit, 4)
-
- // Prefix data with character count indicator.
- // The character count indicator is a string of bits that represents the
- // number of characters that are being encoded.
- // The character count indicator must be placed after the mode indicator
- // and must be a certain number of bits long, depending on the QR version
- // and data mode
- // @see {@link Mode.getCharCountIndicator}.
- buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))
-
- // add binary data sequence to buffer
- data.write(buffer)
- })
-
- // Calculate required number of bits
- const totalCodewords = Utils.getSymbolTotalCodewords(version)
- const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)
- const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8
-
- // Add a terminator.
- // If the bit string is shorter than the total number of required bits,
- // a terminator of up to four 0s must be added to the right side of the string.
- // If the bit string is more than four bits shorter than the required number of bits,
- // add four 0s to the end.
- if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
- buffer.put(0, 4)
- }
-
- // If the bit string is fewer than four bits shorter, add only the number of 0s that
- // are needed to reach the required number of bits.
-
- // After adding the terminator, if the number of bits in the string is not a multiple of 8,
- // pad the string on the right with 0s to make the string's length a multiple of 8.
- while (buffer.getLengthInBits() % 8 !== 0) {
- buffer.putBit(0)
- }
-
- // Add pad bytes if the string is still shorter than the total number of required bits.
- // Extend the buffer to fill the data capacity of the symbol corresponding to
- // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)
- // and 00010001 (0x11) alternately.
- const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8
- for (let i = 0; i < remainingByte; i++) {
- buffer.put(i % 2 ? 0x11 : 0xEC, 8)
- }
-
- return createCodewords(buffer, version, errorCorrectionLevel)
-}
-
-/**
- * Encode input data with Reed-Solomon and return codewords with
- * relative error correction bits
- *
- * @param {BitBuffer} bitBuffer Data to encode
- * @param {Number} version QR Code version
- * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level
- * @return {Uint8Array} Buffer containing encoded codewords
- */
-function createCodewords (bitBuffer, version, errorCorrectionLevel) {
- // Total codewords for this QR code version (Data + Error correction)
- const totalCodewords = Utils.getSymbolTotalCodewords(version)
-
- // Total number of error correction codewords
- const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)
-
- // Total number of data codewords
- const dataTotalCodewords = totalCodewords - ecTotalCodewords
-
- // Total number of blocks
- const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)
-
- // Calculate how many blocks each group should contain
- const blocksInGroup2 = totalCodewords % ecTotalBlocks
- const blocksInGroup1 = ecTotalBlocks - blocksInGroup2
-
- const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)
-
- const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)
- const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1
-
- // Number of EC codewords is the same for both groups
- const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1
-
- // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount
- const rs = new ReedSolomonEncoder(ecCount)
-
- let offset = 0
- const dcData = new Array(ecTotalBlocks)
- const ecData = new Array(ecTotalBlocks)
- let maxDataSize = 0
- const buffer = new Uint8Array(bitBuffer.buffer)
-
- // Divide the buffer into the required number of blocks
- for (let b = 0; b < ecTotalBlocks; b++) {
- const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2
-
- // extract a block of data from buffer
- dcData[b] = buffer.slice(offset, offset + dataSize)
-
- // Calculate EC codewords for this data block
- ecData[b] = rs.encode(dcData[b])
-
- offset += dataSize
- maxDataSize = Math.max(maxDataSize, dataSize)
- }
-
- // Create final data
- // Interleave the data and error correction codewords from each block
- const data = new Uint8Array(totalCodewords)
- let index = 0
- let i, r
-
- // Add data codewords
- for (i = 0; i < maxDataSize; i++) {
- for (r = 0; r < ecTotalBlocks; r++) {
- if (i < dcData[r].length) {
- data[index++] = dcData[r][i]
- }
- }
- }
-
- // Apped EC codewords
- for (i = 0; i < ecCount; i++) {
- for (r = 0; r < ecTotalBlocks; r++) {
- data[index++] = ecData[r][i]
- }
- }
-
- return data
-}
-
-/**
- * Build QR Code symbol
- *
- * @param {String} data Input string
- * @param {Number} version QR Code version
- * @param {ErrorCorretionLevel} errorCorrectionLevel Error level
- * @param {MaskPattern} maskPattern Mask pattern
- * @return {Object} Object containing symbol data
- */
-function createSymbol (data, version, errorCorrectionLevel, maskPattern) {
- let segments
-
- if (Array.isArray(data)) {
- segments = Segments.fromArray(data)
- } else if (typeof data === 'string') {
- let estimatedVersion = version
-
- if (!estimatedVersion) {
- const rawSegments = Segments.rawSplit(data)
-
- // Estimate best version that can contain raw splitted segments
- estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)
- }
-
- // Build optimized segments
- // If estimated version is undefined, try with the highest version
- segments = Segments.fromString(data, estimatedVersion || 40)
- } else {
- throw new Error('Invalid data')
- }
-
- // Get the min version that can contain data
- const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)
-
- // If no version is found, data cannot be stored
- if (!bestVersion) {
- throw new Error('The amount of data is too big to be stored in a QR Code')
- }
-
- // If not specified, use min version as default
- if (!version) {
- version = bestVersion
-
- // Check if the specified version can contain the data
- } else if (version < bestVersion) {
- throw new Error('\n' +
- 'The chosen QR Code version cannot contain this amount of data.\n' +
- 'Minimum version required to store current data is: ' + bestVersion + '.\n'
- )
- }
-
- const dataBits = createData(version, errorCorrectionLevel, segments)
-
- // Allocate matrix buffer
- const moduleCount = Utils.getSymbolSize(version)
- const modules = new BitMatrix(moduleCount)
-
- // Add function modules
- setupFinderPattern(modules, version)
- setupTimingPattern(modules)
- setupAlignmentPattern(modules, version)
-
- // Add temporary dummy bits for format info just to set them as reserved.
- // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}
- // since the masking operation must be performed only on the encoding region.
- // These blocks will be replaced with correct values later in code.
- setupFormatInfo(modules, errorCorrectionLevel, 0)
-
- if (version >= 7) {
- setupVersionInfo(modules, version)
- }
-
- // Add data codewords
- setupData(modules, dataBits)
-
- if (isNaN(maskPattern)) {
- // Find best mask pattern
- maskPattern = MaskPattern.getBestMask(modules,
- setupFormatInfo.bind(null, modules, errorCorrectionLevel))
- }
-
- // Apply mask pattern
- MaskPattern.applyMask(maskPattern, modules)
-
- // Replace format info bits with correct values
- setupFormatInfo(modules, errorCorrectionLevel, maskPattern)
-
- return {
- modules: modules,
- version: version,
- errorCorrectionLevel: errorCorrectionLevel,
- maskPattern: maskPattern,
- segments: segments
- }
-}
-
-/**
- * QR Code
- *
- * @param {String | Array} data Input data
- * @param {Object} options Optional configurations
- * @param {Number} options.version QR Code version
- * @param {String} options.errorCorrectionLevel Error correction level
- * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis
- */
-exports.create = function create (data, options) {
- if (typeof data === 'undefined' || data === '') {
- throw new Error('No input text')
- }
-
- let errorCorrectionLevel = ECLevel.M
- let version
- let mask
-
- if (typeof options !== 'undefined') {
- // Use higher error correction level as default
- errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)
- version = Version.from(options.version)
- mask = MaskPattern.from(options.maskPattern)
-
- if (options.toSJISFunc) {
- Utils.setToSJISFunction(options.toSJISFunc)
- }
- }
-
- return createSymbol(data, version, errorCorrectionLevel, mask)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/reed-solomon-encoder.js b/uds-auth/lib/qrcode-lib/lib/core/reed-solomon-encoder.js
deleted file mode 100644
index c1984227..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/reed-solomon-encoder.js
+++ /dev/null
@@ -1,56 +0,0 @@
-const Polynomial = require('./polynomial')
-
-function ReedSolomonEncoder (degree) {
- this.genPoly = undefined
- this.degree = degree
-
- if (this.degree) this.initialize(this.degree)
-}
-
-/**
- * Initialize the encoder.
- * The input param should correspond to the number of error correction codewords.
- *
- * @param {Number} degree
- */
-ReedSolomonEncoder.prototype.initialize = function initialize (degree) {
- // create an irreducible generator polynomial
- this.degree = degree
- this.genPoly = Polynomial.generateECPolynomial(this.degree)
-}
-
-/**
- * Encodes a chunk of data
- *
- * @param {Uint8Array} data Buffer containing input data
- * @return {Uint8Array} Buffer containing encoded data
- */
-ReedSolomonEncoder.prototype.encode = function encode (data) {
- if (!this.genPoly) {
- throw new Error('Encoder not initialized')
- }
-
- // Calculate EC for this data block
- // extends data size to data+genPoly size
- const paddedData = new Uint8Array(data.length + this.degree)
- paddedData.set(data)
-
- // The error correction codewords are the remainder after dividing the data codewords
- // by a generator polynomial
- const remainder = Polynomial.mod(paddedData, this.genPoly)
-
- // return EC data blocks (last n byte, where n is the degree of genPoly)
- // If coefficients number in remainder are less than genPoly degree,
- // pad with 0s to the left to reach the needed number of coefficients
- const start = this.degree - remainder.length
- if (start > 0) {
- const buff = new Uint8Array(this.degree)
- buff.set(remainder, start)
-
- return buff
- }
-
- return remainder
-}
-
-module.exports = ReedSolomonEncoder
diff --git a/uds-auth/lib/qrcode-lib/lib/core/regex.js b/uds-auth/lib/qrcode-lib/lib/core/regex.js
deleted file mode 100644
index 9dd13a42..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/regex.js
+++ /dev/null
@@ -1,31 +0,0 @@
-const numeric = '[0-9]+'
-const alphanumeric = '[A-Z $%*+\\-./:]+'
-let kanji = '(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|' +
- '[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|' +
- '[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|' +
- '[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+'
-kanji = kanji.replace(/u/g, '\\u')
-
-const byte = '(?:(?![A-Z0-9 $%*+\\-./:]|' + kanji + ')(?:.|[\r\n]))+'
-
-exports.KANJI = new RegExp(kanji, 'g')
-exports.BYTE_KANJI = new RegExp('[^A-Z0-9 $%*+\\-./:]+', 'g')
-exports.BYTE = new RegExp(byte, 'g')
-exports.NUMERIC = new RegExp(numeric, 'g')
-exports.ALPHANUMERIC = new RegExp(alphanumeric, 'g')
-
-const TEST_KANJI = new RegExp('^' + kanji + '$')
-const TEST_NUMERIC = new RegExp('^' + numeric + '$')
-const TEST_ALPHANUMERIC = new RegExp('^[A-Z0-9 $%*+\\-./:]+$')
-
-exports.testKanji = function testKanji (str) {
- return TEST_KANJI.test(str)
-}
-
-exports.testNumeric = function testNumeric (str) {
- return TEST_NUMERIC.test(str)
-}
-
-exports.testAlphanumeric = function testAlphanumeric (str) {
- return TEST_ALPHANUMERIC.test(str)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/segments.js b/uds-auth/lib/qrcode-lib/lib/core/segments.js
deleted file mode 100644
index a955236f..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/segments.js
+++ /dev/null
@@ -1,330 +0,0 @@
-const Mode = require('./mode')
-const NumericData = require('./numeric-data')
-const AlphanumericData = require('./alphanumeric-data')
-const ByteData = require('./byte-data')
-const KanjiData = require('./kanji-data')
-const Regex = require('./regex')
-const Utils = require('./utils')
-const dijkstra = require('./dijkstra')
-
-/**
- * Returns UTF8 byte length
- *
- * @param {String} str Input string
- * @return {Number} Number of byte
- */
-function getStringByteLength (str) {
- return unescape(encodeURIComponent(str)).length
-}
-
-/**
- * Get a list of segments of the specified mode
- * from a string
- *
- * @param {Mode} mode Segment mode
- * @param {String} str String to process
- * @return {Array} Array of object with segments data
- */
-function getSegments (regex, mode, str) {
- const segments = []
- let result
-
- while ((result = regex.exec(str)) !== null) {
- segments.push({
- data: result[0],
- index: result.index,
- mode: mode,
- length: result[0].length
- })
- }
-
- return segments
-}
-
-/**
- * Extracts a series of segments with the appropriate
- * modes from a string
- *
- * @param {String} dataStr Input string
- * @return {Array} Array of object with segments data
- */
-function getSegmentsFromString (dataStr) {
- const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)
- const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)
- let byteSegs
- let kanjiSegs
-
- if (Utils.isKanjiModeEnabled()) {
- byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)
- kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)
- } else {
- byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)
- kanjiSegs = []
- }
-
- const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)
-
- return segs
- .sort(function (s1, s2) {
- return s1.index - s2.index
- })
- .map(function (obj) {
- return {
- data: obj.data,
- mode: obj.mode,
- length: obj.length
- }
- })
-}
-
-/**
- * Returns how many bits are needed to encode a string of
- * specified length with the specified mode
- *
- * @param {Number} length String length
- * @param {Mode} mode Segment mode
- * @return {Number} Bit length
- */
-function getSegmentBitsLength (length, mode) {
- switch (mode) {
- case Mode.NUMERIC:
- return NumericData.getBitsLength(length)
- case Mode.ALPHANUMERIC:
- return AlphanumericData.getBitsLength(length)
- case Mode.KANJI:
- return KanjiData.getBitsLength(length)
- case Mode.BYTE:
- return ByteData.getBitsLength(length)
- }
-}
-
-/**
- * Merges adjacent segments which have the same mode
- *
- * @param {Array} segs Array of object with segments data
- * @return {Array} Array of object with segments data
- */
-function mergeSegments (segs) {
- return segs.reduce(function (acc, curr) {
- const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null
- if (prevSeg && prevSeg.mode === curr.mode) {
- acc[acc.length - 1].data += curr.data
- return acc
- }
-
- acc.push(curr)
- return acc
- }, [])
-}
-
-/**
- * Generates a list of all possible nodes combination which
- * will be used to build a segments graph.
- *
- * Nodes are divided by groups. Each group will contain a list of all the modes
- * in which is possible to encode the given text.
- *
- * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.
- * The group for '12345' will contain then 3 objects, one for each
- * possible encoding mode.
- *
- * Each node represents a possible segment.
- *
- * @param {Array} segs Array of object with segments data
- * @return {Array} Array of object with segments data
- */
-function buildNodes (segs) {
- const nodes = []
- for (let i = 0; i < segs.length; i++) {
- const seg = segs[i]
-
- switch (seg.mode) {
- case Mode.NUMERIC:
- nodes.push([seg,
- { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },
- { data: seg.data, mode: Mode.BYTE, length: seg.length }
- ])
- break
- case Mode.ALPHANUMERIC:
- nodes.push([seg,
- { data: seg.data, mode: Mode.BYTE, length: seg.length }
- ])
- break
- case Mode.KANJI:
- nodes.push([seg,
- { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }
- ])
- break
- case Mode.BYTE:
- nodes.push([
- { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }
- ])
- }
- }
-
- return nodes
-}
-
-/**
- * Builds a graph from a list of nodes.
- * All segments in each node group will be connected with all the segments of
- * the next group and so on.
- *
- * At each connection will be assigned a weight depending on the
- * segment's byte length.
- *
- * @param {Array} nodes Array of object with segments data
- * @param {Number} version QR Code version
- * @return {Object} Graph of all possible segments
- */
-function buildGraph (nodes, version) {
- const table = {}
- const graph = { start: {} }
- let prevNodeIds = ['start']
-
- for (let i = 0; i < nodes.length; i++) {
- const nodeGroup = nodes[i]
- const currentNodeIds = []
-
- for (let j = 0; j < nodeGroup.length; j++) {
- const node = nodeGroup[j]
- const key = '' + i + j
-
- currentNodeIds.push(key)
- table[key] = { node: node, lastCount: 0 }
- graph[key] = {}
-
- for (let n = 0; n < prevNodeIds.length; n++) {
- const prevNodeId = prevNodeIds[n]
-
- if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {
- graph[prevNodeId][key] =
- getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -
- getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)
-
- table[prevNodeId].lastCount += node.length
- } else {
- if (table[prevNodeId]) table[prevNodeId].lastCount = node.length
-
- graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +
- 4 + Mode.getCharCountIndicator(node.mode, version) // switch cost
- }
- }
- }
-
- prevNodeIds = currentNodeIds
- }
-
- for (let n = 0; n < prevNodeIds.length; n++) {
- graph[prevNodeIds[n]].end = 0
- }
-
- return { map: graph, table: table }
-}
-
-/**
- * Builds a segment from a specified data and mode.
- * If a mode is not specified, the more suitable will be used.
- *
- * @param {String} data Input data
- * @param {Mode | String} modesHint Data mode
- * @return {Segment} Segment
- */
-function buildSingleSegment (data, modesHint) {
- let mode
- const bestMode = Mode.getBestModeForData(data)
-
- mode = Mode.from(modesHint, bestMode)
-
- // Make sure data can be encoded
- if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {
- throw new Error('"' + data + '"' +
- ' cannot be encoded with mode ' + Mode.toString(mode) +
- '.\n Suggested mode is: ' + Mode.toString(bestMode))
- }
-
- // Use Mode.BYTE if Kanji support is disabled
- if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {
- mode = Mode.BYTE
- }
-
- switch (mode) {
- case Mode.NUMERIC:
- return new NumericData(data)
-
- case Mode.ALPHANUMERIC:
- return new AlphanumericData(data)
-
- case Mode.KANJI:
- return new KanjiData(data)
-
- case Mode.BYTE:
- return new ByteData(data)
- }
-}
-
-/**
- * Builds a list of segments from an array.
- * Array can contain Strings or Objects with segment's info.
- *
- * For each item which is a string, will be generated a segment with the given
- * string and the more appropriate encoding mode.
- *
- * For each item which is an object, will be generated a segment with the given
- * data and mode.
- * Objects must contain at least the property "data".
- * If property "mode" is not present, the more suitable mode will be used.
- *
- * @param {Array} array Array of objects with segments data
- * @return {Array} Array of Segments
- */
-exports.fromArray = function fromArray (array) {
- return array.reduce(function (acc, seg) {
- if (typeof seg === 'string') {
- acc.push(buildSingleSegment(seg, null))
- } else if (seg.data) {
- acc.push(buildSingleSegment(seg.data, seg.mode))
- }
-
- return acc
- }, [])
-}
-
-/**
- * Builds an optimized sequence of segments from a string,
- * which will produce the shortest possible bitstream.
- *
- * @param {String} data Input string
- * @param {Number} version QR Code version
- * @return {Array} Array of segments
- */
-exports.fromString = function fromString (data, version) {
- const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())
-
- const nodes = buildNodes(segs)
- const graph = buildGraph(nodes, version)
- const path = dijkstra.find_path(graph.map, 'start', 'end')
-
- const optimizedSegs = []
- for (let i = 1; i < path.length - 1; i++) {
- optimizedSegs.push(graph.table[path[i]].node)
- }
-
- return exports.fromArray(mergeSegments(optimizedSegs))
-}
-
-/**
- * Splits a string in various segments with the modes which
- * best represent their content.
- * The produced segments are far from being optimized.
- * The output of this function is only used to estimate a QR Code version
- * which may contain the data.
- *
- * @param {string} data Input string
- * @return {Array} Array of segments
- */
-exports.rawSplit = function rawSplit (data) {
- return exports.fromArray(
- getSegmentsFromString(data, Utils.isKanjiModeEnabled())
- )
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/utils.js b/uds-auth/lib/qrcode-lib/lib/core/utils.js
deleted file mode 100644
index 8a0b87ba..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/utils.js
+++ /dev/null
@@ -1,63 +0,0 @@
-let toSJISFunction
-const CODEWORDS_COUNT = [
- 0, // Not used
- 26, 44, 70, 100, 134, 172, 196, 242, 292, 346,
- 404, 466, 532, 581, 655, 733, 815, 901, 991, 1085,
- 1156, 1258, 1364, 1474, 1588, 1706, 1828, 1921, 2051, 2185,
- 2323, 2465, 2611, 2761, 2876, 3034, 3196, 3362, 3532, 3706
-]
-
-/**
- * Returns the QR Code size for the specified version
- *
- * @param {Number} version QR Code version
- * @return {Number} size of QR code
- */
-exports.getSymbolSize = function getSymbolSize (version) {
- if (!version) throw new Error('"version" cannot be null or undefined')
- if (version < 1 || version > 40) throw new Error('"version" should be in range from 1 to 40')
- return version * 4 + 17
-}
-
-/**
- * Returns the total number of codewords used to store data and EC information.
- *
- * @param {Number} version QR Code version
- * @return {Number} Data length in bits
- */
-exports.getSymbolTotalCodewords = function getSymbolTotalCodewords (version) {
- return CODEWORDS_COUNT[version]
-}
-
-/**
- * Encode data with Bose-Chaudhuri-Hocquenghem
- *
- * @param {Number} data Value to encode
- * @return {Number} Encoded value
- */
-exports.getBCHDigit = function (data) {
- let digit = 0
-
- while (data !== 0) {
- digit++
- data >>>= 1
- }
-
- return digit
-}
-
-exports.setToSJISFunction = function setToSJISFunction (f) {
- if (typeof f !== 'function') {
- throw new Error('"toSJISFunc" is not a valid function.')
- }
-
- toSJISFunction = f
-}
-
-exports.isKanjiModeEnabled = function () {
- return typeof toSJISFunction !== 'undefined'
-}
-
-exports.toSJIS = function toSJIS (kanji) {
- return toSJISFunction(kanji)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/version-check.js b/uds-auth/lib/qrcode-lib/lib/core/version-check.js
deleted file mode 100644
index dd32b5ac..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/version-check.js
+++ /dev/null
@@ -1,9 +0,0 @@
-/**
- * Check if QR Code version is valid
- *
- * @param {Number} version QR Code version
- * @return {Boolean} true if valid version, false otherwise
- */
-exports.isValid = function isValid (version) {
- return !isNaN(version) && version >= 1 && version <= 40
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/core/version.js b/uds-auth/lib/qrcode-lib/lib/core/version.js
deleted file mode 100644
index 32b84661..00000000
--- a/uds-auth/lib/qrcode-lib/lib/core/version.js
+++ /dev/null
@@ -1,163 +0,0 @@
-const Utils = require('./utils')
-const ECCode = require('./error-correction-code')
-const ECLevel = require('./error-correction-level')
-const Mode = require('./mode')
-const VersionCheck = require('./version-check')
-
-// Generator polynomial used to encode version information
-const G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0)
-const G18_BCH = Utils.getBCHDigit(G18)
-
-function getBestVersionForDataLength (mode, length, errorCorrectionLevel) {
- for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {
- if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, mode)) {
- return currentVersion
- }
- }
-
- return undefined
-}
-
-function getReservedBitsCount (mode, version) {
- // Character count indicator + mode indicator bits
- return Mode.getCharCountIndicator(mode, version) + 4
-}
-
-function getTotalBitsFromDataArray (segments, version) {
- let totalBits = 0
-
- segments.forEach(function (data) {
- const reservedBits = getReservedBitsCount(data.mode, version)
- totalBits += reservedBits + data.getBitsLength()
- })
-
- return totalBits
-}
-
-function getBestVersionForMixedData (segments, errorCorrectionLevel) {
- for (let currentVersion = 1; currentVersion <= 40; currentVersion++) {
- const length = getTotalBitsFromDataArray(segments, currentVersion)
- if (length <= exports.getCapacity(currentVersion, errorCorrectionLevel, Mode.MIXED)) {
- return currentVersion
- }
- }
-
- return undefined
-}
-
-/**
- * Returns version number from a value.
- * If value is not a valid version, returns defaultValue
- *
- * @param {Number|String} value QR Code version
- * @param {Number} defaultValue Fallback value
- * @return {Number} QR Code version number
- */
-exports.from = function from (value, defaultValue) {
- if (VersionCheck.isValid(value)) {
- return parseInt(value, 10)
- }
-
- return defaultValue
-}
-
-/**
- * Returns how much data can be stored with the specified QR code version
- * and error correction level
- *
- * @param {Number} version QR Code version (1-40)
- * @param {Number} errorCorrectionLevel Error correction level
- * @param {Mode} mode Data mode
- * @return {Number} Quantity of storable data
- */
-exports.getCapacity = function getCapacity (version, errorCorrectionLevel, mode) {
- if (!VersionCheck.isValid(version)) {
- throw new Error('Invalid QR Code version')
- }
-
- // Use Byte mode as default
- if (typeof mode === 'undefined') mode = Mode.BYTE
-
- // Total codewords for this QR code version (Data + Error correction)
- const totalCodewords = Utils.getSymbolTotalCodewords(version)
-
- // Total number of error correction codewords
- const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)
-
- // Total number of data codewords
- const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8
-
- if (mode === Mode.MIXED) return dataTotalCodewordsBits
-
- const usableBits = dataTotalCodewordsBits - getReservedBitsCount(mode, version)
-
- // Return max number of storable codewords
- switch (mode) {
- case Mode.NUMERIC:
- return Math.floor((usableBits / 10) * 3)
-
- case Mode.ALPHANUMERIC:
- return Math.floor((usableBits / 11) * 2)
-
- case Mode.KANJI:
- return Math.floor(usableBits / 13)
-
- case Mode.BYTE:
- default:
- return Math.floor(usableBits / 8)
- }
-}
-
-/**
- * Returns the minimum version needed to contain the amount of data
- *
- * @param {Segment} data Segment of data
- * @param {Number} [errorCorrectionLevel=H] Error correction level
- * @param {Mode} mode Data mode
- * @return {Number} QR Code version
- */
-exports.getBestVersionForData = function getBestVersionForData (data, errorCorrectionLevel) {
- let seg
-
- const ecl = ECLevel.from(errorCorrectionLevel, ECLevel.M)
-
- if (Array.isArray(data)) {
- if (data.length > 1) {
- return getBestVersionForMixedData(data, ecl)
- }
-
- if (data.length === 0) {
- return 1
- }
-
- seg = data[0]
- } else {
- seg = data
- }
-
- return getBestVersionForDataLength(seg.mode, seg.getLength(), ecl)
-}
-
-/**
- * Returns version information with relative error correction bits
- *
- * The version information is included in QR Code symbols of version 7 or larger.
- * It consists of an 18-bit sequence containing 6 data bits,
- * with 12 error correction bits calculated using the (18, 6) Golay code.
- *
- * @param {Number} version QR Code version
- * @return {Number} Encoded version info bits
- */
-exports.getEncodedBits = function getEncodedBits (version) {
- if (!VersionCheck.isValid(version) || version < 7) {
- throw new Error('Invalid QR Code version')
- }
-
- let d = version << 12
-
- while (Utils.getBCHDigit(d) - G18_BCH >= 0) {
- d ^= (G18 << (Utils.getBCHDigit(d) - G18_BCH))
- }
-
- return (version << 12) | d
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/index.js b/uds-auth/lib/qrcode-lib/lib/index.js
deleted file mode 100644
index 57c8f703..00000000
--- a/uds-auth/lib/qrcode-lib/lib/index.js
+++ /dev/null
@@ -1,12 +0,0 @@
-/*
-*copyright Ryan Day 2012
-*
-* Licensed under the MIT license:
-* http://www.opensource.org/licenses/mit-license.php
-*
-* this is the main server side application file for node-qrcode.
-* these exports use serverside canvas api methods for file IO and buffers
-*
-*/
-
-module.exports = require('./server')
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/canvas.js b/uds-auth/lib/qrcode-lib/lib/renderer/canvas.js
deleted file mode 100644
index 42050cf5..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/canvas.js
+++ /dev/null
@@ -1,63 +0,0 @@
-const Utils = require('./utils')
-
-function clearCanvas (ctx, canvas, size) {
- ctx.clearRect(0, 0, canvas.width, canvas.height)
-
- if (!canvas.style) canvas.style = {}
- canvas.height = size
- canvas.width = size
- canvas.style.height = size + 'px'
- canvas.style.width = size + 'px'
-}
-
-function getCanvasElement () {
- try {
- return document.createElement('canvas')
- } catch (e) {
- throw new Error('You need to specify a canvas element')
- }
-}
-
-exports.render = function render (qrData, canvas, options) {
- let opts = options
- let canvasEl = canvas
-
- if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {
- opts = canvas
- canvas = undefined
- }
-
- if (!canvas) {
- canvasEl = getCanvasElement()
- }
-
- opts = Utils.getOptions(opts)
- const size = Utils.getImageWidth(qrData.modules.size, opts)
-
- const ctx = canvasEl.getContext('2d')
- const image = ctx.createImageData(size, size)
- Utils.qrToImageData(image.data, qrData, opts)
-
- clearCanvas(ctx, canvasEl, size)
- ctx.putImageData(image, 0, 0)
-
- return canvasEl
-}
-
-exports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {
- let opts = options
-
- if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {
- opts = canvas
- canvas = undefined
- }
-
- if (!opts) opts = {}
-
- const canvasEl = exports.render(qrData, canvas, opts)
-
- const type = opts.type || 'image/png'
- const rendererOpts = opts.rendererOpts || {}
-
- return canvasEl.toDataURL(type, rendererOpts.quality)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/png.js b/uds-auth/lib/qrcode-lib/lib/renderer/png.js
deleted file mode 100644
index 27421608..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/png.js
+++ /dev/null
@@ -1,78 +0,0 @@
-const fs = require('fs')
-const PNG = require('pngjs').PNG
-const Utils = require('./utils')
-
-exports.render = function render (qrData, options) {
- const opts = Utils.getOptions(options)
- const pngOpts = opts.rendererOpts
- const size = Utils.getImageWidth(qrData.modules.size, opts)
-
- pngOpts.width = size
- pngOpts.height = size
-
- const pngImage = new PNG(pngOpts)
- Utils.qrToImageData(pngImage.data, qrData, opts)
-
- return pngImage
-}
-
-exports.renderToDataURL = function renderToDataURL (qrData, options, cb) {
- if (typeof cb === 'undefined') {
- cb = options
- options = undefined
- }
-
- exports.renderToBuffer(qrData, options, function (err, output) {
- if (err) cb(err)
- let url = 'data:image/png;base64,'
- url += output.toString('base64')
- cb(null, url)
- })
-}
-
-exports.renderToBuffer = function renderToBuffer (qrData, options, cb) {
- if (typeof cb === 'undefined') {
- cb = options
- options = undefined
- }
-
- const png = exports.render(qrData, options)
- const buffer = []
-
- png.on('error', cb)
-
- png.on('data', function (data) {
- buffer.push(data)
- })
-
- png.on('end', function () {
- cb(null, Buffer.concat(buffer))
- })
-
- png.pack()
-}
-
-exports.renderToFile = function renderToFile (path, qrData, options, cb) {
- if (typeof cb === 'undefined') {
- cb = options
- options = undefined
- }
-
- let called = false
- const done = (...args) => {
- if (called) return
- called = true
- cb.apply(null, args)
- }
- const stream = fs.createWriteStream(path)
-
- stream.on('error', done)
- stream.on('close', done)
-
- exports.renderToFileStream(stream, qrData, options)
-}
-
-exports.renderToFileStream = function renderToFileStream (stream, qrData, options) {
- const png = exports.render(qrData, options)
- png.pack().pipe(stream)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/svg-tag.js b/uds-auth/lib/qrcode-lib/lib/renderer/svg-tag.js
deleted file mode 100644
index d0839fe0..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/svg-tag.js
+++ /dev/null
@@ -1,81 +0,0 @@
-const Utils = require('./utils')
-
-function getColorAttrib (color, attrib) {
- const alpha = color.a / 255
- const str = attrib + '="' + color.hex + '"'
-
- return alpha < 1
- ? str + ' ' + attrib + '-opacity="' + alpha.toFixed(2).slice(1) + '"'
- : str
-}
-
-function svgCmd (cmd, x, y) {
- let str = cmd + x
- if (typeof y !== 'undefined') str += ' ' + y
-
- return str
-}
-
-function qrToPath (data, size, margin) {
- let path = ''
- let moveBy = 0
- let newRow = false
- let lineLength = 0
-
- for (let i = 0; i < data.length; i++) {
- const col = Math.floor(i % size)
- const row = Math.floor(i / size)
-
- if (!col && !newRow) newRow = true
-
- if (data[i]) {
- lineLength++
-
- if (!(i > 0 && col > 0 && data[i - 1])) {
- path += newRow
- ? svgCmd('M', col + margin, 0.5 + row + margin)
- : svgCmd('m', moveBy, 0)
-
- moveBy = 0
- newRow = false
- }
-
- if (!(col + 1 < size && data[i + 1])) {
- path += svgCmd('h', lineLength)
- lineLength = 0
- }
- } else {
- moveBy++
- }
- }
-
- return path
-}
-
-exports.render = function render (qrData, options, cb) {
- const opts = Utils.getOptions(options)
- const size = qrData.modules.size
- const data = qrData.modules.data
- const qrcodesize = size + opts.margin * 2
-
- const bg = !opts.color.light.a
- ? ''
- : ''
-
- const path =
- ''
-
- const viewBox = 'viewBox="' + '0 0 ' + qrcodesize + ' ' + qrcodesize + '"'
-
- const width = !opts.width ? '' : 'width="' + opts.width + '" height="' + opts.width + '" '
-
- const svgTag = '\n'
-
- if (typeof cb === 'function') {
- cb(null, svgTag)
- }
-
- return svgTag
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/svg.js b/uds-auth/lib/qrcode-lib/lib/renderer/svg.js
deleted file mode 100644
index ba99d14c..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/svg.js
+++ /dev/null
@@ -1,19 +0,0 @@
-const svgTagRenderer = require('./svg-tag')
-
-exports.render = svgTagRenderer.render
-
-exports.renderToFile = function renderToFile (path, qrData, options, cb) {
- if (typeof cb === 'undefined') {
- cb = options
- options = undefined
- }
-
- const fs = require('fs')
- const svgTag = exports.render(qrData, options)
-
- const xmlStr = '' +
- '' +
- svgTag
-
- fs.writeFile(path, xmlStr, cb)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/terminal.js b/uds-auth/lib/qrcode-lib/lib/renderer/terminal.js
deleted file mode 100644
index 36ddfde7..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/terminal.js
+++ /dev/null
@@ -1,9 +0,0 @@
-const big = require('./terminal/terminal')
-const small = require('./terminal/terminal-small')
-
-exports.render = function (qrData, options, cb) {
- if (options && options.small) {
- return small.render(qrData, options, cb)
- }
- return big.render(qrData, options, cb)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/terminal/terminal-small.js b/uds-auth/lib/qrcode-lib/lib/renderer/terminal/terminal-small.js
deleted file mode 100644
index 9810d4e1..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/terminal/terminal-small.js
+++ /dev/null
@@ -1,85 +0,0 @@
-const backgroundWhite = '\x1b[47m'
-const backgroundBlack = '\x1b[40m'
-const foregroundWhite = '\x1b[37m'
-const foregroundBlack = '\x1b[30m'
-const reset = '\x1b[0m'
-const lineSetupNormal = backgroundWhite + foregroundBlack // setup colors
-const lineSetupInverse = backgroundBlack + foregroundWhite // setup colors
-
-const createPalette = function (lineSetup, foregroundWhite, foregroundBlack) {
- return {
- // 1 ... white, 2 ... black, 0 ... transparent (default)
-
- '00': reset + ' ' + lineSetup,
- '01': reset + foregroundWhite + '▄' + lineSetup,
- '02': reset + foregroundBlack + '▄' + lineSetup,
- 10: reset + foregroundWhite + '▀' + lineSetup,
- 11: ' ',
- 12: '▄',
- 20: reset + foregroundBlack + '▀' + lineSetup,
- 21: '▀',
- 22: '█'
- }
-}
-
-/**
- * Returns code for QR pixel
- * @param {boolean[][]} modules
- * @param {number} size
- * @param {number} x
- * @param {number} y
- * @return {'0' | '1' | '2'}
- */
-const mkCodePixel = function (modules, size, x, y) {
- const sizePlus = size + 1
- if ((x >= sizePlus) || (y >= sizePlus) || (y < -1) || (x < -1)) return '0'
- if ((x >= size) || (y >= size) || (y < 0) || (x < 0)) return '1'
- const idx = (y * size) + x
- return modules[idx] ? '2' : '1'
-}
-
-/**
- * Returns code for four QR pixels. Suitable as key in palette.
- * @param {boolean[][]} modules
- * @param {number} size
- * @param {number} x
- * @param {number} y
- * @return {keyof palette}
- */
-const mkCode = function (modules, size, x, y) {
- return (
- mkCodePixel(modules, size, x, y) +
- mkCodePixel(modules, size, x, y + 1)
- )
-}
-
-exports.render = function (qrData, options, cb) {
- const size = qrData.modules.size
- const data = qrData.modules.data
-
- const inverse = !!(options && options.inverse)
- const lineSetup = options && options.inverse ? lineSetupInverse : lineSetupNormal
- const white = inverse ? foregroundBlack : foregroundWhite
- const black = inverse ? foregroundWhite : foregroundBlack
-
- const palette = createPalette(lineSetup, white, black)
- const newLine = reset + '\n' + lineSetup
-
- let output = lineSetup // setup colors
-
- for (let y = -1; y < size + 1; y += 2) {
- for (let x = -1; x < size; x++) {
- output += palette[mkCode(data, size, x, y)]
- }
-
- output += palette[mkCode(data, size, size, y)] + newLine
- }
-
- output += reset
-
- if (typeof cb === 'function') {
- cb(null, output)
- }
-
- return output
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/terminal/terminal.js b/uds-auth/lib/qrcode-lib/lib/renderer/terminal/terminal.js
deleted file mode 100644
index f15610b5..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/terminal/terminal.js
+++ /dev/null
@@ -1,49 +0,0 @@
-// let Utils = require('./utils')
-
-exports.render = function (qrData, options, cb) {
- const size = qrData.modules.size
- const data = qrData.modules.data
-
- // let opts = Utils.getOptions(options)
-
- // use same scheme as https://github.com/gtanner/qrcode-terminal because it actually works! =)
- const black = '\x1b[40m \x1b[0m'
- const white = '\x1b[47m \x1b[0m'
-
- let output = ''
- const hMargin = Array(size + 3).join(white)
- const vMargin = Array(2).join(white)
-
- output += hMargin + '\n'
- for (let i = 0; i < size; ++i) {
- output += white
- for (let j = 0; j < size; j++) {
- // let topModule = data[i * size + j]
- // let bottomModule = data[(i + 1) * size + j]
-
- output += data[i * size + j] ? black : white// getBlockChar(topModule, bottomModule)
- }
- // output += white+'\n'
- output += vMargin + '\n'
- }
-
- output += hMargin + '\n'
-
- if (typeof cb === 'function') {
- cb(null, output)
- }
-
- return output
-}
-/*
-exports.renderToFile = function renderToFile (path, qrData, options, cb) {
- if (typeof cb === 'undefined') {
- cb = options
- options = undefined
- }
-
- let fs = require('fs')
- let utf8 = exports.render(qrData, options)
- fs.writeFile(path, utf8, cb)
-}
-*/
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/utf8.js b/uds-auth/lib/qrcode-lib/lib/renderer/utf8.js
deleted file mode 100644
index d76116e5..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/utf8.js
+++ /dev/null
@@ -1,71 +0,0 @@
-const Utils = require('./utils')
-
-const BLOCK_CHAR = {
- WW: ' ',
- WB: '▄',
- BB: '█',
- BW: '▀'
-}
-
-const INVERTED_BLOCK_CHAR = {
- BB: ' ',
- BW: '▄',
- WW: '█',
- WB: '▀'
-}
-
-function getBlockChar (top, bottom, blocks) {
- if (top && bottom) return blocks.BB
- if (top && !bottom) return blocks.BW
- if (!top && bottom) return blocks.WB
- return blocks.WW
-}
-
-exports.render = function (qrData, options, cb) {
- const opts = Utils.getOptions(options)
- let blocks = BLOCK_CHAR
- if (opts.color.dark.hex === '#ffffff' || opts.color.light.hex === '#000000') {
- blocks = INVERTED_BLOCK_CHAR
- }
-
- const size = qrData.modules.size
- const data = qrData.modules.data
-
- let output = ''
- let hMargin = Array(size + (opts.margin * 2) + 1).join(blocks.WW)
- hMargin = Array((opts.margin / 2) + 1).join(hMargin + '\n')
-
- const vMargin = Array(opts.margin + 1).join(blocks.WW)
-
- output += hMargin
- for (let i = 0; i < size; i += 2) {
- output += vMargin
- for (let j = 0; j < size; j++) {
- const topModule = data[i * size + j]
- const bottomModule = data[(i + 1) * size + j]
-
- output += getBlockChar(topModule, bottomModule, blocks)
- }
-
- output += vMargin + '\n'
- }
-
- output += hMargin.slice(0, -1)
-
- if (typeof cb === 'function') {
- cb(null, output)
- }
-
- return output
-}
-
-exports.renderToFile = function renderToFile (path, qrData, options, cb) {
- if (typeof cb === 'undefined') {
- cb = options
- options = undefined
- }
-
- const fs = require('fs')
- const utf8 = exports.render(qrData, options)
- fs.writeFile(path, utf8, cb)
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/renderer/utils.js b/uds-auth/lib/qrcode-lib/lib/renderer/utils.js
deleted file mode 100644
index 87239dc5..00000000
--- a/uds-auth/lib/qrcode-lib/lib/renderer/utils.js
+++ /dev/null
@@ -1,99 +0,0 @@
-function hex2rgba (hex) {
- if (typeof hex === 'number') {
- hex = hex.toString()
- }
-
- if (typeof hex !== 'string') {
- throw new Error('Color should be defined as hex string')
- }
-
- let hexCode = hex.slice().replace('#', '').split('')
- if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {
- throw new Error('Invalid hex color: ' + hex)
- }
-
- // Convert from short to long form (fff -> ffffff)
- if (hexCode.length === 3 || hexCode.length === 4) {
- hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {
- return [c, c]
- }))
- }
-
- // Add default alpha value
- if (hexCode.length === 6) hexCode.push('F', 'F')
-
- const hexValue = parseInt(hexCode.join(''), 16)
-
- return {
- r: (hexValue >> 24) & 255,
- g: (hexValue >> 16) & 255,
- b: (hexValue >> 8) & 255,
- a: hexValue & 255,
- hex: '#' + hexCode.slice(0, 6).join('')
- }
-}
-
-exports.getOptions = function getOptions (options) {
- if (!options) options = {}
- if (!options.color) options.color = {}
-
- const margin = typeof options.margin === 'undefined' ||
- options.margin === null ||
- options.margin < 0
- ? 4
- : options.margin
-
- const width = options.width && options.width >= 21 ? options.width : undefined
- const scale = options.scale || 4
-
- return {
- width: width,
- scale: width ? 4 : scale,
- margin: margin,
- color: {
- dark: hex2rgba(options.color.dark || '#000000ff'),
- light: hex2rgba(options.color.light || '#ffffffff')
- },
- type: options.type,
- rendererOpts: options.rendererOpts || {}
- }
-}
-
-exports.getScale = function getScale (qrSize, opts) {
- return opts.width && opts.width >= qrSize + opts.margin * 2
- ? opts.width / (qrSize + opts.margin * 2)
- : opts.scale
-}
-
-exports.getImageWidth = function getImageWidth (qrSize, opts) {
- const scale = exports.getScale(qrSize, opts)
- return Math.floor((qrSize + opts.margin * 2) * scale)
-}
-
-exports.qrToImageData = function qrToImageData (imgData, qr, opts) {
- const size = qr.modules.size
- const data = qr.modules.data
- const scale = exports.getScale(size, opts)
- const symbolSize = Math.floor((size + opts.margin * 2) * scale)
- const scaledMargin = opts.margin * scale
- const palette = [opts.color.light, opts.color.dark]
-
- for (let i = 0; i < symbolSize; i++) {
- for (let j = 0; j < symbolSize; j++) {
- let posDst = (i * symbolSize + j) * 4
- let pxColor = opts.color.light
-
- if (i >= scaledMargin && j >= scaledMargin &&
- i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {
- const iSrc = Math.floor((i - scaledMargin) / scale)
- const jSrc = Math.floor((j - scaledMargin) / scale)
- pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]
- }
-
- imgData[posDst++] = pxColor.r
- imgData[posDst++] = pxColor.g
- imgData[posDst++] = pxColor.b
- imgData[posDst] = pxColor.a
- }
- }
-}
diff --git a/uds-auth/lib/qrcode-lib/lib/server.js b/uds-auth/lib/qrcode-lib/lib/server.js
deleted file mode 100644
index 619e398e..00000000
--- a/uds-auth/lib/qrcode-lib/lib/server.js
+++ /dev/null
@@ -1,138 +0,0 @@
-const canPromise = require('./can-promise')
-const QRCode = require('./core/qrcode')
-const PngRenderer = require('./renderer/png')
-const Utf8Renderer = require('./renderer/utf8')
-const TerminalRenderer = require('./renderer/terminal')
-const SvgRenderer = require('./renderer/svg')
-
-function checkParams (text, opts, cb) {
- if (typeof text === 'undefined') {
- throw new Error('String required as first argument')
- }
-
- if (typeof cb === 'undefined') {
- cb = opts
- opts = {}
- }
-
- if (typeof cb !== 'function') {
- if (!canPromise()) {
- throw new Error('Callback required as last argument')
- } else {
- opts = cb || {}
- cb = null
- }
- }
-
- return {
- opts: opts,
- cb: cb
- }
-}
-
-function getTypeFromFilename (path) {
- return path.slice((path.lastIndexOf('.') - 1 >>> 0) + 2).toLowerCase()
-}
-
-function getRendererFromType (type) {
- switch (type) {
- case 'svg':
- return SvgRenderer
-
- case 'txt':
- case 'utf8':
- return Utf8Renderer
-
- case 'png':
- case 'image/png':
- default:
- return PngRenderer
- }
-}
-
-function getStringRendererFromType (type) {
- switch (type) {
- case 'svg':
- return SvgRenderer
-
- case 'terminal':
- return TerminalRenderer
-
- case 'utf8':
- default:
- return Utf8Renderer
- }
-}
-
-function render (renderFunc, text, params) {
- if (!params.cb) {
- return new Promise(function (resolve, reject) {
- try {
- const data = QRCode.create(text, params.opts)
- return renderFunc(data, params.opts, function (err, data) {
- return err ? reject(err) : resolve(data)
- })
- } catch (e) {
- reject(e)
- }
- })
- }
-
- try {
- const data = QRCode.create(text, params.opts)
- return renderFunc(data, params.opts, params.cb)
- } catch (e) {
- params.cb(e)
- }
-}
-
-exports.create = QRCode.create
-
-exports.toCanvas = require('./browser').toCanvas
-
-exports.toString = function toString (text, opts, cb) {
- const params = checkParams(text, opts, cb)
- const type = params.opts ? params.opts.type : undefined
- const renderer = getStringRendererFromType(type)
- return render(renderer.render, text, params)
-}
-
-exports.toDataURL = function toDataURL (text, opts, cb) {
- const params = checkParams(text, opts, cb)
- const renderer = getRendererFromType(params.opts.type)
- return render(renderer.renderToDataURL, text, params)
-}
-
-exports.toBuffer = function toBuffer (text, opts, cb) {
- const params = checkParams(text, opts, cb)
- const renderer = getRendererFromType(params.opts.type)
- return render(renderer.renderToBuffer, text, params)
-}
-
-exports.toFile = function toFile (path, text, opts, cb) {
- if (typeof path !== 'string' || !(typeof text === 'string' || typeof text === 'object')) {
- throw new Error('Invalid argument')
- }
-
- if ((arguments.length < 3) && !canPromise()) {
- throw new Error('Too few arguments provided')
- }
-
- const params = checkParams(text, opts, cb)
- const type = params.opts.type || getTypeFromFilename(path)
- const renderer = getRendererFromType(type)
- const renderToFile = renderer.renderToFile.bind(null, path)
-
- return render(renderToFile, text, params)
-}
-
-exports.toFileStream = function toFileStream (stream, text, opts) {
- if (arguments.length < 2) {
- throw new Error('Too few arguments provided')
- }
-
- const params = checkParams(text, opts, stream.emit.bind(stream, 'error'))
- const renderer = getRendererFromType('png') // Only png support for now
- const renderToFileStream = renderer.renderToFileStream.bind(null, stream)
- render(renderToFileStream, text, params)
-}
diff --git a/uds-auth/lib/qrcode-lib/license b/uds-auth/lib/qrcode-lib/license
deleted file mode 100644
index 4e2b3b93..00000000
--- a/uds-auth/lib/qrcode-lib/license
+++ /dev/null
@@ -1,10 +0,0 @@
-The MIT License (MIT)
-
-Copyright (c) 2012 Ryan Day
-
-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.
-
diff --git a/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode b/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode
deleted file mode 100644
index 167d37eb..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode
+++ /dev/null
@@ -1,55 +0,0 @@
-#!/bin/sh
-# Resolve $0 through symlinks so basedir is the shim's real directory.
-# Cap hops at the kernel's ELOOP limit so a cycle cannot hang the shim.
-link="$0"
-hops=0
-while [ -L "$link" ] && [ "$hops" -lt 40 ]; do
- hops=$((hops+1))
- target=$(readlink "$link")
- case "$target" in
- /*) link="$target" ;;
- *) link="$(dirname "$link")/$target" ;;
- esac
-done
-basedir=$(dirname "$(echo "$link" | sed -e 's,\\,/,g')")
-basedir_win="$basedir"
-exe=""
-msys=""
-
-case `uname -a` in
- *CYGWIN*|*MINGW*|*MSYS*)
- if command -v cygpath > /dev/null 2>&1; then
- basedir_win=`cygpath -w "$basedir"`
- fi
- exe=".exe"
- msys="true"
- ;;
- *WSL2*)
- if command -v wslpath > /dev/null 2>&1; then
- basedir_win="$(wslpath -w "$basedir" 2> /dev/null)"
- if [ $? -ne 0 ] || [ -z "$basedir_win" ]; then
- basedir_win="$basedir"
- else
- exe=".exe"
- fi
- fi
- ;;
-esac
-
-if [ -z "$NODE_PATH" ]; then
- export NODE_PATH="/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/node_modules:/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules:/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/node_modules"
-else
- export NODE_PATH="/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/node_modules:/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules:/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/node_modules:$NODE_PATH"
-fi
-if [ -n "$exe" ] && [ -x "$basedir/node.exe" ]; then
- exec "$basedir/node.exe" "$basedir_win/../../bin/qrcode" "$@"
-elif [ -x "$basedir/node" ]; then
- exec "$basedir/node" "$basedir/../../bin/qrcode" "$@"
-elif command -v node >/dev/null 2>&1; then
- exec node "$basedir/../../bin/qrcode" "$@"
-elif [ -n "$exe" ] && command -v node.exe >/dev/null 2>&1; then
- exec node.exe "$basedir_win/../../bin/qrcode" "$@"
-else
- exec node "$basedir/../../bin/qrcode" "$@"
-fi
-# cmd-shim-target=D:/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/bin/qrcode
diff --git a/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode.CMD b/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode.CMD
deleted file mode 100644
index e8e7c031..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode.CMD
+++ /dev/null
@@ -1,12 +0,0 @@
-@SETLOCAL
-@IF NOT DEFINED NODE_PATH (
- @SET "NODE_PATH=D:\code\gpt\dsh-im-ops\node_modules\.pnpm\qrcode@1.5.4\node_modules\qrcode\node_modules;D:\code\gpt\dsh-im-ops\node_modules\.pnpm\qrcode@1.5.4\node_modules;D:\code\gpt\dsh-im-ops\node_modules\.pnpm\node_modules"
-) ELSE (
- @SET "NODE_PATH=D:\code\gpt\dsh-im-ops\node_modules\.pnpm\qrcode@1.5.4\node_modules\qrcode\node_modules;D:\code\gpt\dsh-im-ops\node_modules\.pnpm\qrcode@1.5.4\node_modules;D:\code\gpt\dsh-im-ops\node_modules\.pnpm\node_modules;%NODE_PATH%"
-)
-@IF EXIST "%~dp0\node.exe" (
- "%~dp0\node.exe" "%~dp0\..\..\bin\qrcode" %*
-) ELSE (
- @SET PATHEXT=%PATHEXT:;.JS;=;%
- node "%~dp0\..\..\bin\qrcode" %*
-)
diff --git a/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode.ps1 b/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode.ps1
deleted file mode 100644
index 9f8c97fa..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/.bin/qrcode.ps1
+++ /dev/null
@@ -1,41 +0,0 @@
-#!/usr/bin/env pwsh
-$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
-
-$exe=""
-$pathsep=":"
-$env_node_path=$env:NODE_PATH
-$new_node_path="D:\code\gpt\dsh-im-ops\node_modules\.pnpm\qrcode@1.5.4\node_modules\qrcode\node_modules;D:\code\gpt\dsh-im-ops\node_modules\.pnpm\qrcode@1.5.4\node_modules;D:\code\gpt\dsh-im-ops\node_modules\.pnpm\node_modules"
-if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
- # Fix case when both the Windows and Linux builds of Node
- # are installed in the same directory
- $exe=".exe"
- $pathsep=";"
-} else {
- $new_node_path="/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/node_modules:/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/qrcode@1.5.4/node_modules:/mnt/d/code/gpt/dsh-im-ops/node_modules/.pnpm/node_modules"
-}
-if ([string]::IsNullOrEmpty($env_node_path)) {
- $env:NODE_PATH=$new_node_path
-} else {
- $env:NODE_PATH="$new_node_path$pathsep$env_node_path"
-}
-
-$ret=0
-if (Test-Path "$basedir/node$exe") {
- # Support pipeline input
- if ($MyInvocation.ExpectingInput) {
- $input | & "$basedir/node$exe" "$basedir/../../bin/qrcode" $args
- } else {
- & "$basedir/node$exe" "$basedir/../../bin/qrcode" $args
- }
- $ret=$LASTEXITCODE
-} else {
- # Support pipeline input
- if ($MyInvocation.ExpectingInput) {
- $input | & "node$exe" "$basedir/../../bin/qrcode" $args
- } else {
- & "node$exe" "$basedir/../../bin/qrcode" $args
- }
- $ret=$LASTEXITCODE
-}
-$env:NODE_PATH=$env_node_path
-exit $ret
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/.travis.yml b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/.travis.yml
deleted file mode 100644
index 2d63fafb..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/.travis.yml
+++ /dev/null
@@ -1,4 +0,0 @@
-language: node_js
-node_js:
- - "stable"
-sudo: false
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/CONTRIBUTING.md b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/CONTRIBUTING.md
deleted file mode 100644
index 5f25961e..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/CONTRIBUTING.md
+++ /dev/null
@@ -1,8 +0,0 @@
-Contributing
-============
-
-1. Fork it
-2. Create your feature branch (`git checkout -b my-new-feature`)
-3. Commit your changes (`git commit -am 'Add some feature'`)
-4. Push to the branch (`git push origin my-new-feature`)
-5. Create new Pull Request
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/LICENSE.md b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/LICENSE.md
deleted file mode 100644
index b662d803..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/LICENSE.md
+++ /dev/null
@@ -1,19 +0,0 @@
-```
-Dijkstra path-finding functions. Adapted from the Dijkstar Python project.
-
-Copyright (C) 2008
- Wyatt Baldwin
- All rights reserved
-
-Licensed under the MIT license.
-
- http://www.opensource.org/licenses/mit-license.php
-
-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.
-```
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/README.md b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/README.md
deleted file mode 100644
index 77deac75..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/README.md
+++ /dev/null
@@ -1,18 +0,0 @@
-# dijkstrajs.js
-
-dijkstrajs is a simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.
-
-The code was originally written by Wyatt Baldwin and turned into a node module by Thomas Cort.
-
-## Requirements
-
-* [nodejs](http://nodejs.org/)
-
-## Installation
-
- npm install dijkstrajs
-
-## Examples
-
-See `test/dijkstra.test.js` in the sources for some example code.
-
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/dijkstra.js b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/dijkstra.js
deleted file mode 100644
index 4f83f1f2..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/dijkstra.js
+++ /dev/null
@@ -1,165 +0,0 @@
-'use strict';
-
-/******************************************************************************
- * Created 2008-08-19.
- *
- * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.
- *
- * Copyright (C) 2008
- * Wyatt Baldwin
- * All rights reserved
- *
- * Licensed under the MIT license.
- *
- * http://www.opensource.org/licenses/mit-license.php
- *
- * 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 dijkstra = {
- single_source_shortest_paths: function(graph, s, d) {
- // Predecessor map for each node that has been encountered.
- // node ID => predecessor node ID
- var predecessors = {};
-
- // Costs of shortest paths from s to all nodes encountered.
- // node ID => cost
- var costs = {};
- costs[s] = 0;
-
- // Costs of shortest paths from s to all nodes encountered; differs from
- // `costs` in that it provides easy access to the node that currently has
- // the known shortest path from s.
- // XXX: Do we actually need both `costs` and `open`?
- var open = dijkstra.PriorityQueue.make();
- open.push(s, 0);
-
- var closest,
- u, v,
- cost_of_s_to_u,
- adjacent_nodes,
- cost_of_e,
- cost_of_s_to_u_plus_cost_of_e,
- cost_of_s_to_v,
- first_visit;
- while (!open.empty()) {
- // In the nodes remaining in graph that have a known cost from s,
- // find the node, u, that currently has the shortest path from s.
- closest = open.pop();
- u = closest.value;
- cost_of_s_to_u = closest.cost;
-
- // Get nodes adjacent to u...
- adjacent_nodes = graph[u] || {};
-
- // ...and explore the edges that connect u to those nodes, updating
- // the cost of the shortest paths to any or all of those nodes as
- // necessary. v is the node across the current edge from u.
- for (v in adjacent_nodes) {
- if (adjacent_nodes.hasOwnProperty(v)) {
- // Get the cost of the edge running from u to v.
- cost_of_e = adjacent_nodes[v];
-
- // Cost of s to u plus the cost of u to v across e--this is *a*
- // cost from s to v that may or may not be less than the current
- // known cost to v.
- cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;
-
- // If we haven't visited v yet OR if the current known cost from s to
- // v is greater than the new cost we just found (cost of s to u plus
- // cost of u to v across e), update v's cost in the cost list and
- // update v's predecessor in the predecessor list (it's now u).
- cost_of_s_to_v = costs[v];
- first_visit = (typeof costs[v] === 'undefined');
- if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {
- costs[v] = cost_of_s_to_u_plus_cost_of_e;
- open.push(v, cost_of_s_to_u_plus_cost_of_e);
- predecessors[v] = u;
- }
- }
- }
- }
-
- if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {
- var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');
- throw new Error(msg);
- }
-
- return predecessors;
- },
-
- extract_shortest_path_from_predecessor_list: function(predecessors, d) {
- var nodes = [];
- var u = d;
- var predecessor;
- while (u) {
- nodes.push(u);
- predecessor = predecessors[u];
- u = predecessors[u];
- }
- nodes.reverse();
- return nodes;
- },
-
- find_path: function(graph, s, d) {
- var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);
- return dijkstra.extract_shortest_path_from_predecessor_list(
- predecessors, d);
- },
-
- /**
- * A very naive priority queue implementation.
- */
- PriorityQueue: {
- make: function (opts) {
- var T = dijkstra.PriorityQueue,
- t = {},
- key;
- opts = opts || {};
- for (key in T) {
- if (T.hasOwnProperty(key)) {
- t[key] = T[key];
- }
- }
- t.queue = [];
- t.sorter = opts.sorter || T.default_sorter;
- return t;
- },
-
- default_sorter: function (a, b) {
- return a.cost - b.cost;
- },
-
- /**
- * Add a new item to the queue and ensure the highest priority element
- * is at the front of the queue.
- */
- push: function (value, cost) {
- var item = {value: value, cost: cost};
- this.queue.push(item);
- this.queue.sort(this.sorter);
- },
-
- /**
- * Return the highest priority element in the queue.
- */
- pop: function () {
- return this.queue.shift();
- },
-
- empty: function () {
- return this.queue.length === 0;
- }
- }
-};
-
-
-// node.js module exports
-if (typeof module !== 'undefined') {
- module.exports = dijkstra;
-}
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/package.json b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/package.json
deleted file mode 100644
index 67cd76d6..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/package.json
+++ /dev/null
@@ -1,60 +0,0 @@
-{
- "name": "dijkstrajs",
- "version": "1.0.3",
- "description": "A simple JavaScript implementation of Dijkstra's single-source shortest-paths algorithm.",
- "main": "dijkstra.js",
- "scripts": {
- "pretest": "jshint dijkstra.js",
- "test": "mocha -R spec"
- },
- "repository": {
- "type": "git",
- "url": "git://github.com/tcort/dijkstrajs"
- },
- "keywords": [
- "dijkstra",
- "shortest",
- "path",
- "search",
- "graph"
- ],
- "license": "MIT",
- "bugs": {
- "url": "https://github.com/tcort/dijkstrajs/issues"
- },
- "homepage": "https://github.com/tcort/dijkstrajs",
- "devDependencies": {
- "expect.js": "^0.3.1",
- "jshint": "^2.13.6",
- "mocha": "^10.2.0"
- },
- "jshintConfig": {
- "bitwise": true,
- "curly": true,
- "eqeqeq": true,
- "forin": true,
- "freeze": true,
- "globalstrict": true,
- "immed": true,
- "indent": 4,
- "moz": true,
- "newcap": true,
- "noarg": true,
- "node": true,
- "noempty": true,
- "nonew": true,
- "trailing": true,
- "undef": true,
- "smarttabs": true,
- "strict": true,
- "validthis": true,
- "globals": {
- "describe": false,
- "it": false,
- "before": false,
- "beforeEach": false,
- "after": false,
- "afterEach": false
- }
- }
-}
diff --git a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/test/dijkstra.test.js b/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/test/dijkstra.test.js
deleted file mode 100644
index 865c5a00..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/dijkstrajs/test/dijkstra.test.js
+++ /dev/null
@@ -1,96 +0,0 @@
-'use strict';
-
-var expect = require('expect.js');
-var dijkstra = require('../dijkstra.js');
-var find_path = dijkstra.find_path;
-
-describe('dijkstra.js', function () {
-
- describe('.find_path()', function () {
-
- it('should find the path between two points, all edges have weight 1', function () {
- // A B C
- // D E F
- // G H I
- var graph = {
- a: {b: 10, d: 1},
- b: {a: 1, c: 1, e: 1},
- c: {b: 1, f: 1},
- d: {a: 1, e: 1, g: 1},
- e: {b: 1, d: 1, f: 1, h: 1},
- f: {c: 1, e: 1, i: 1},
- g: {d: 1, h: 1},
- h: {e: 1, g: 1, i: 1},
- i: {f: 1, h: 1}
- };
- var path = find_path(graph, 'a', 'i');
- expect(path).to.eql(['a', 'd', 'e', 'f', 'i']);
- });
-
- it('should find the path between two points, weighted edges', function () {
- var graph = {
- a: {b: 10, c: 100, d: 1},
- b: {c: 10},
- d: {b: 1, e: 1},
- e: {f: 1},
- f: {c: 1},
- g: {b: 1}
- };
-
- var path = find_path(graph, 'a', 'c');
- expect(path).to.eql(['a', 'd', 'e', 'f', 'c']);
- path = find_path(graph, 'd', 'b');
- expect(path).to.eql(['d', 'b']);
- });
-
- it('should throw on unreachable destination', function () {
- var graph = {
- a: {b: 10, c: 100, d: 1},
- b: {c: 10},
- d: {b: 1, e: 1},
- e: {f: 1},
- f: {c: 1},
- g: {b: 1}
- };
-
- expect(function () { find_path(graph, 'c', 'a'); }).to.throwException();
- expect(function () { find_path(graph, 'a', 'g'); }).to.throwException();
- });
-
- it('should throw on non-existent destination', function () {
- var graph = {
- a: {b: 10, c: 100, d: 1},
- b: {c: 10},
- d: {b: 1, e: 1},
- e: {f: 1},
- f: {c: 1},
- g: {b: 1}
- };
-
- expect(function () { find_path(graph, 'a', 'z'); }).to.throwException();
- });
- });
-
- describe('.single_source_shortest_paths()', function () {
- it('should find all paths from a node', function () {
- var graph = {
- a: {b: 10, c: 100, d: 1},
- b: {c: 10},
- d: {b: 1, e: 1},
- e: {f: 1},
- f: {c: 1},
- g: {b: 1}
- };
-
- // All paths from 'a'
- var paths = dijkstra.single_source_shortest_paths(graph, 'a');
- expect(paths).to.eql({
- d: 'a',
- b: 'd',
- e: 'd',
- f: 'e',
- c: 'f'
- });
- });
- });
-});
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/.eslintignore b/uds-auth/lib/qrcode-lib/node_modules/pngjs/.eslintignore
deleted file mode 100644
index 188bbcf3..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/.eslintignore
+++ /dev/null
@@ -1,2 +0,0 @@
-/browser.js
-/test/imagediff.js
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/.eslintrc.json b/uds-auth/lib/qrcode-lib/node_modules/pngjs/.eslintrc.json
deleted file mode 100644
index a66e0189..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/.eslintrc.json
+++ /dev/null
@@ -1,19 +0,0 @@
-{
- "parserOptions": { "ecmaVersion": 2018 },
- "extends": ["eslint:recommended", "prettier"],
- "env": {
- "node": true,
- "es6": true
- },
- "rules": {
- "no-var": "error"
- },
- "overrides": [
- {
- "files": ["test/*.js", "examples/*.js"],
- "rules": {
- "no-console": "off"
- }
- }
- ]
-}
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/.prettierignore b/uds-auth/lib/qrcode-lib/node_modules/pngjs/.prettierignore
deleted file mode 100644
index 8af2c5d6..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/.prettierignore
+++ /dev/null
@@ -1,3 +0,0 @@
-/browser.js
-/test/imagediff.js
-.nyc_output
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/LICENSE b/uds-auth/lib/qrcode-lib/node_modules/pngjs/LICENSE
deleted file mode 100644
index 6942e254..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/LICENSE
+++ /dev/null
@@ -1,20 +0,0 @@
-pngjs2 original work Copyright (c) 2015 Luke Page & Original Contributors
-pngjs derived work Copyright (c) 2012 Kuba Niegowski
-
-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.
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/README.md b/uds-auth/lib/qrcode-lib/node_modules/pngjs/README.md
deleted file mode 100644
index 1b07d33a..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/README.md
+++ /dev/null
@@ -1,429 +0,0 @@
-[](https://travis-ci.com/lukeapage/pngjs) [](https://ci.appveyor.com/project/lukeapage/pngjs/branch/master) [](https://codecov.io/gh/lukeapage/pngjs) [](http://badge.fury.io/js/pngjs)
-
-# pngjs
-
-Simple PNG encoder/decoder for Node.js with no dependencies.
-
-Based on the original [pngjs](https://github.com/niegowski/node-pngjs) with the follow enhancements.
-
-- Support for reading 1,2,4 & 16 bit files
-- Support for reading interlace files
-- Support for reading `tTRNS` transparent colours
-- Support for writing colortype 0 (grayscale), colortype 2 (RGB), colortype 4 (grayscale alpha) and colortype 6 (RGBA)
-- Sync interface as well as async
-- API compatible with pngjs and node-pngjs
-
-Known lack of support for:
-
-- Extended PNG e.g. Animation
-- Writing in colortype 3 (indexed color)
-
-# Table of Contents
-
-- [Requirements](#requirements)
-- [Comparison Table](#comparison-table)
-- [Tests](#tests)
-- [Installation](#installation)
-- [Browser](#browser)
-- [Example](#example)
-- [Async API](#async-api)
-- [Sync API](#sync-api)
-- [Changelog](#changelog)
-
-# Requirements
-
-- Node.js v4 (use older v2.3.0 for 0.10/0.12/iojs support)
-
-# Comparison Table
-
-| Name | Forked From | Sync | Async | 16 Bit | 1/2/4 Bit | Interlace | Gamma | Encodes | Tested |
-| ------------- | ----------- | ---- | ----- | ------ | --------- | --------- | ------ | ------- | ------ |
-| pngjs | | Yes | Yes | Yes | Yes | Yes | Yes | Yes | Yes |
-| node-png | pngjs | No | Yes | No | No | No | Hidden | Yes | Manual |
-| png-coder | pngjs | No | Yes | Yes | No | No | Hidden | Yes | Manual |
-| pngparse | | No | Yes | No | Yes | No | No | No | Yes |
-| pngparse-sync | pngparse | Yes | No | No | Yes | No | No | No | Yes |
-| png-async | | No | Yes | No | No | No | No | Yes | Yes |
-| png-js | | No | Yes | No | No | No | No | No | No |
-
-Native C++ node decoders:
-
-- png
-- png-sync (sync version of above)
-- pixel-png
-- png-img
-
-# Tests
-
-Tested using [PNG Suite](http://www.schaik.com/pngsuite/). We read every file into pngjs, output it in standard 8bit colour, synchronously and asynchronously, then compare the original with the newly saved images.
-
-To run the tests, fetch the repo (tests are not distributed via npm) and install with `npm i`, run `npm test`.
-
-The only thing not converted is gamma correction - this is because multiple vendors will do gamma correction differently, so the tests will have different results on different browsers.
-
-In addition we use a tolerance of 3 for 16 bit images in PhantomJS because PhantomJS seems to have non-compliant rules for downscaling 16 bit images.
-
-# Installation
-
-```
-$ npm install pngjs --save
-```
-
-# Browser
-
-The package has been build with a [Browserify](browserify.org) version (`npm run browserify`) and you can use the browser version by including in your code:
-
-```
-import { PNG } from 'pngjs/browser';
-```
-
-# Example
-
-```js
-var fs = require("fs"),
- PNG = require("pngjs").PNG;
-
-fs.createReadStream("in.png")
- .pipe(
- new PNG({
- filterType: 4,
- })
- )
- .on("parsed", function () {
- for (var y = 0; y < this.height; y++) {
- for (var x = 0; x < this.width; x++) {
- var idx = (this.width * y + x) << 2;
-
- // invert color
- this.data[idx] = 255 - this.data[idx];
- this.data[idx + 1] = 255 - this.data[idx + 1];
- this.data[idx + 2] = 255 - this.data[idx + 2];
-
- // and reduce opacity
- this.data[idx + 3] = this.data[idx + 3] >> 1;
- }
- }
-
- this.pack().pipe(fs.createWriteStream("out.png"));
- });
-```
-
-For more examples see `examples` folder.
-
-# Async API
-
-As input any color type is accepted (grayscale, rgb, palette, grayscale with alpha, rgb with alpha) but 8 bit per sample (channel) is the only supported bit depth. Interlaced mode is not supported.
-
-## Class: PNG
-
-`PNG` is readable and writable `Stream`.
-
-### Options
-
-- `width` - use this with `height` if you want to create png from scratch
-- `height` - as above
-- `checkCRC` - whether parser should be strict about checksums in source stream (default: `true`)
-- `deflateChunkSize` - chunk size used for deflating data chunks, this should be power of 2 and must not be less than 256 and more than 32\*1024 (default: 32 kB)
-- `deflateLevel` - compression level for deflate (default: 9)
-- `deflateStrategy` - compression strategy for deflate (default: 3)
-- `deflateFactory` - deflate stream factory (default: `zlib.createDeflate`)
-- `filterType` - png filtering method for scanlines (default: -1 => auto, accepts array of numbers 0-4)
-- `colorType` - the output colorType - see constants. 0 = grayscale, no alpha, 2 = color, no alpha, 4 = grayscale & alpha, 6 = color & alpha. Default currently 6, but in the future may calculate best mode.
-- `inputColorType` - the input colorType - see constants. Default is 6 (RGBA)
-- `bitDepth` - the bitDepth of the output, 8 or 16 bits. Input data is expected to have this bit depth.
- 16 bit data is expected in the system endianness (Default: 8)
-- `inputHasAlpha` - whether the input bitmap has 4 bytes per pixel (rgb and alpha) or 3 (rgb - no alpha).
-- `bgColor` - an object containing red, green, and blue values between 0 and 255
- that is used when packing a PNG if alpha is not to be included (default: 255,255,255)
-
-### Event "metadata"
-
-`function(metadata) { }`
-Image's header has been parsed, metadata contains this information:
-
-- `width` image size in pixels
-- `height` image size in pixels
-- `palette` image is paletted
-- `color` image is not grayscale
-- `alpha` image contains alpha channel
-- `interlace` image is interlaced
-
-### Event: "parsed"
-
-`function(data) { }`
-Input image has been completely parsed, `data` is complete and ready for modification.
-
-### Event: "error"
-
-`function(error) { }`
-
-### png.parse(data, [callback])
-
-Parses PNG file data. Can be `String` or `Buffer`. Alternatively you can stream data to instance of PNG.
-
-Optional `callback` is once called on `error` or `parsed`. The callback gets
-two arguments `(err, data)`.
-
-Returns `this` for method chaining.
-
-#### Example
-
-```js
-new PNG({ filterType: 4 }).parse(imageData, function (error, data) {
- console.log(error, data);
-});
-```
-
-### png.pack()
-
-Starts converting data to PNG file Stream.
-
-Returns `this` for method chaining.
-
-### png.bitblt(dst, sx, sy, w, h, dx, dy)
-
-Helper for image manipulation, copies a rectangle of pixels from current (i.e. the source) image (`sx`, `sy`, `w`, `h`) to `dst` image (at `dx`, `dy`).
-
-Returns `this` for method chaining.
-
-For example, the following code copies the top-left 100x50 px of `in.png` into dst and writes it to `out.png`:
-
-```js
-var dst = new PNG({ width: 100, height: 50 });
-fs.createReadStream("in.png")
- .pipe(new PNG())
- .on("parsed", function () {
- this.bitblt(dst, 0, 0, 100, 50, 0, 0);
- dst.pack().pipe(fs.createWriteStream("out.png"));
- });
-```
-
-### Property: adjustGamma()
-
-Helper that takes data and adjusts it to be gamma corrected. Note that it is not 100% reliable with transparent colours because that requires knowing the background colour the bitmap is rendered on to.
-
-In tests against PNG suite it compared 100% with chrome on all 8 bit and below images. On IE there were some differences.
-
-The following example reads a file, adjusts the gamma (which sets the gamma to 0) and writes it out again, effectively removing any gamma correction from the image.
-
-```js
-fs.createReadStream("in.png")
- .pipe(new PNG())
- .on("parsed", function () {
- this.adjustGamma();
- this.pack().pipe(fs.createWriteStream("out.png"));
- });
-```
-
-### Property: width
-
-Width of image in pixels
-
-### Property: height
-
-Height of image in pixels
-
-### Property: data
-
-Buffer of image pixel data. Every pixel consists 4 bytes: R, G, B, A (opacity).
-
-### Property: gamma
-
-Gamma of image (0 if not specified)
-
-## Packing a PNG and removing alpha (RGBA to RGB)
-
-When removing the alpha channel from an image, there needs to be a background color to correctly
-convert each pixel's transparency to the appropriate RGB value. By default, pngjs will flatten
-the image against a white background. You can override this in the options:
-
-```js
-var fs = require("fs"),
- PNG = require("pngjs").PNG;
-
-fs.createReadStream("in.png")
- .pipe(
- new PNG({
- colorType: 2,
- bgColor: {
- red: 0,
- green: 255,
- blue: 0,
- },
- })
- )
- .on("parsed", function () {
- this.pack().pipe(fs.createWriteStream("out.png"));
- });
-```
-
-# Sync API
-
-## PNG.sync
-
-### PNG.sync.read(buffer)
-
-Take a buffer and returns a PNG image. The properties on the image include the meta data and `data` as per the async API above.
-
-```
-var data = fs.readFileSync('in.png');
-var png = PNG.sync.read(data);
-```
-
-### PNG.sync.write(png)
-
-Take a PNG image and returns a buffer. The properties on the image include the meta data and `data` as per the async API above.
-
-```
-var data = fs.readFileSync('in.png');
-var png = PNG.sync.read(data);
-var options = { colorType: 6 };
-var buffer = PNG.sync.write(png, options);
-fs.writeFileSync('out.png', buffer);
-```
-
-### PNG.adjustGamma(src)
-
-Adjusts the gamma of a sync image. See the async adjustGamma.
-
-```
-var data = fs.readFileSync('in.png');
-var png = PNG.sync.read(data);
-PNG.adjustGamma(png);
-```
-
-# Changelog
-
-### 5.0.0 - 15/04/2020
-
-- Drop support for Node 8
-- Browserified bundle may now contain ES20(15-20) code if the supported node version supports it. Please run the browserified version through babel if you need to support older browsers.
-
-### 4.0.1 - 15/04/2020
-
-- Fix to possible null reference in nextTick of async method
-
-### 4.0.0 - 09/04/2020
-
-- Fix issue in newer nodes with using Buffer
-- Fix async issue with some png files
-- Drop support for Node 4 & 6
-
-### 3.4.0 - 09/03/2019
-
-- Include whether the png has alpha in the meta data
-- emit an error if the image is truncated instead of hanging
-- Add a browserified version
-- speed up some mapping functions
-
-### 3.3.3 - 19/04/2018
-
-- Real fix for node 9
-
-### 3.3.2 - 16/02/2018
-
-- Fix for node 9
-
-### 3.3.1 - 15/11/2017
-
-- Bugfixes and removal of es6
-
-### 3.3.0
-
-- Add writing 16 bit channels and support for grayscale input
-
-### 3.2.0 - 30/04/2017
-
-- Support for encoding 8-bit grayscale images
-
-### 3.1.0 - 30/04/2017
-
-- Support for pngs with zlib chunks that are malformed after valid data
-
-### 3.0.1 - 16/02/2017
-
-- Fix single pixel pngs
-
-### 3.0.0 - 03/08/2016
-
-- Drop support for node below v4 and iojs. Pin to 2.3.0 to use with old, unsupported or patched node versions.
-
-### 2.3.0 - 22/04/2016
-
-- Support for sync in node 0.10
-
-### 2.2.0 - 04/12/2015
-
-- Add sync write api
-- Fix newfile example
-- Correct comparison table
-
-### 2.1.0 - 28/10/2015
-
-- rename package to pngjs
-- added 'bgColor' option
-
-### 2.0.0 - 08/10/2015
-
-- fixes to readme
-- _breaking change_ - bitblt on the png prototype now doesn't take a unused, unnecessary src first argument
-
-### 1.2.0 - 13/09/2015
-
-- support passing colorType to write PNG's and writing bitmaps without alpha information
-
-### 1.1.0 - 07/09/2015
-
-- support passing a deflate factory for controlled compression
-
-### 1.0.2 - 22/08/2015
-
-- Expose all PNG creation info
-
-### 1.0.1 - 21/08/2015
-
-- Fix non square interlaced files
-
-### 1.0.0 - 08/08/2015
-
-- More tests
-- source linted
-- maintainability refactorings
-- async API - exceptions in reading now emit warnings
-- documentation improvement - sync api now documented, adjustGamma documented
-- breaking change - gamma chunk is now written. previously a read then write would destroy gamma information, now it is persisted.
-
-### 0.0.3 - 03/08/2015
-
-- Error handling fixes
-- ignore files for smaller npm footprint
-
-### 0.0.2 - 02/08/2015
-
-- Bugfixes to interlacing, support for transparent colours
-
-### 0.0.1 - 02/08/2015
-
-- Initial release, see pngjs for older changelog.
-
-# License
-
-(The MIT License)
-
-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.
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/browser.js b/uds-auth/lib/qrcode-lib/node_modules/pngjs/browser.js
deleted file mode 100644
index 9daae914..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/browser.js
+++ /dev/null
@@ -1,16096 +0,0 @@
-(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.png = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o= data.length) {
- throw new Error("Ran out of data");
- }
-
- let pixel = data[rawPos];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = data[rawPos + 1];
- },
-
- // 3 - RGB
- // 0: 0, 1: 1, 2: 2, 3: 0xff
- function (pxData, data, pxPos, rawPos) {
- if (rawPos + 2 >= data.length) {
- throw new Error("Ran out of data");
- }
-
- pxData[pxPos] = data[rawPos];
- pxData[pxPos + 1] = data[rawPos + 1];
- pxData[pxPos + 2] = data[rawPos + 2];
- pxData[pxPos + 3] = 0xff;
- },
-
- // 4 - RGBA
- // 0: 0, 1: 1, 2: 2, 3: 3
- function (pxData, data, pxPos, rawPos) {
- if (rawPos + 3 >= data.length) {
- throw new Error("Ran out of data");
- }
-
- pxData[pxPos] = data[rawPos];
- pxData[pxPos + 1] = data[rawPos + 1];
- pxData[pxPos + 2] = data[rawPos + 2];
- pxData[pxPos + 3] = data[rawPos + 3];
- },
-];
-
-let pixelBppCustomMapper = [
- // 0 - dummy entry
- function () {},
-
- // 1 - L
- // 0: 0, 1: 0, 2: 0, 3: 0xff
- function (pxData, pixelData, pxPos, maxBit) {
- let pixel = pixelData[0];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = maxBit;
- },
-
- // 2 - LA
- // 0: 0, 1: 0, 2: 0, 3: 1
- function (pxData, pixelData, pxPos) {
- let pixel = pixelData[0];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = pixelData[1];
- },
-
- // 3 - RGB
- // 0: 0, 1: 1, 2: 2, 3: 0xff
- function (pxData, pixelData, pxPos, maxBit) {
- pxData[pxPos] = pixelData[0];
- pxData[pxPos + 1] = pixelData[1];
- pxData[pxPos + 2] = pixelData[2];
- pxData[pxPos + 3] = maxBit;
- },
-
- // 4 - RGBA
- // 0: 0, 1: 1, 2: 2, 3: 3
- function (pxData, pixelData, pxPos) {
- pxData[pxPos] = pixelData[0];
- pxData[pxPos + 1] = pixelData[1];
- pxData[pxPos + 2] = pixelData[2];
- pxData[pxPos + 3] = pixelData[3];
- },
-];
-
-function bitRetriever(data, depth) {
- let leftOver = [];
- let i = 0;
-
- function split() {
- if (i === data.length) {
- throw new Error("Ran out of data");
- }
- let byte = data[i];
- i++;
- let byte8, byte7, byte6, byte5, byte4, byte3, byte2, byte1;
- switch (depth) {
- default:
- throw new Error("unrecognised depth");
- case 16:
- byte2 = data[i];
- i++;
- leftOver.push((byte << 8) + byte2);
- break;
- case 4:
- byte2 = byte & 0x0f;
- byte1 = byte >> 4;
- leftOver.push(byte1, byte2);
- break;
- case 2:
- byte4 = byte & 3;
- byte3 = (byte >> 2) & 3;
- byte2 = (byte >> 4) & 3;
- byte1 = (byte >> 6) & 3;
- leftOver.push(byte1, byte2, byte3, byte4);
- break;
- case 1:
- byte8 = byte & 1;
- byte7 = (byte >> 1) & 1;
- byte6 = (byte >> 2) & 1;
- byte5 = (byte >> 3) & 1;
- byte4 = (byte >> 4) & 1;
- byte3 = (byte >> 5) & 1;
- byte2 = (byte >> 6) & 1;
- byte1 = (byte >> 7) & 1;
- leftOver.push(byte1, byte2, byte3, byte4, byte5, byte6, byte7, byte8);
- break;
- }
- }
-
- return {
- get: function (count) {
- while (leftOver.length < count) {
- split();
- }
- let returner = leftOver.slice(0, count);
- leftOver = leftOver.slice(count);
- return returner;
- },
- resetAfterLine: function () {
- leftOver.length = 0;
- },
- end: function () {
- if (i !== data.length) {
- throw new Error("extra data found");
- }
- },
- };
-}
-
-function mapImage8Bit(image, pxData, getPxPos, bpp, data, rawPos) {
- // eslint-disable-line max-params
- let imageWidth = image.width;
- let imageHeight = image.height;
- let imagePass = image.index;
- for (let y = 0; y < imageHeight; y++) {
- for (let x = 0; x < imageWidth; x++) {
- let pxPos = getPxPos(x, y, imagePass);
- pixelBppMapper[bpp](pxData, data, pxPos, rawPos);
- rawPos += bpp; //eslint-disable-line no-param-reassign
- }
- }
- return rawPos;
-}
-
-function mapImageCustomBit(image, pxData, getPxPos, bpp, bits, maxBit) {
- // eslint-disable-line max-params
- let imageWidth = image.width;
- let imageHeight = image.height;
- let imagePass = image.index;
- for (let y = 0; y < imageHeight; y++) {
- for (let x = 0; x < imageWidth; x++) {
- let pixelData = bits.get(bpp);
- let pxPos = getPxPos(x, y, imagePass);
- pixelBppCustomMapper[bpp](pxData, pixelData, pxPos, maxBit);
- }
- bits.resetAfterLine();
- }
-}
-
-exports.dataToBitMap = function (data, bitmapInfo) {
- let width = bitmapInfo.width;
- let height = bitmapInfo.height;
- let depth = bitmapInfo.depth;
- let bpp = bitmapInfo.bpp;
- let interlace = bitmapInfo.interlace;
- let bits;
-
- if (depth !== 8) {
- bits = bitRetriever(data, depth);
- }
- let pxData;
- if (depth <= 8) {
- pxData = Buffer.alloc(width * height * 4);
- } else {
- pxData = new Uint16Array(width * height * 4);
- }
- let maxBit = Math.pow(2, depth) - 1;
- let rawPos = 0;
- let images;
- let getPxPos;
-
- if (interlace) {
- images = interlaceUtils.getImagePasses(width, height);
- getPxPos = interlaceUtils.getInterlaceIterator(width, height);
- } else {
- let nonInterlacedPxPos = 0;
- getPxPos = function () {
- let returner = nonInterlacedPxPos;
- nonInterlacedPxPos += 4;
- return returner;
- };
- images = [{ width: width, height: height }];
- }
-
- for (let imageIndex = 0; imageIndex < images.length; imageIndex++) {
- if (depth === 8) {
- rawPos = mapImage8Bit(
- images[imageIndex],
- pxData,
- getPxPos,
- bpp,
- data,
- rawPos
- );
- } else {
- mapImageCustomBit(
- images[imageIndex],
- pxData,
- getPxPos,
- bpp,
- bits,
- maxBit
- );
- }
- }
- if (depth === 8) {
- if (rawPos !== data.length) {
- throw new Error("extra data found");
- }
- } else {
- bits.end();
- }
-
- return pxData;
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./interlace":11,"buffer":28}],2:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let constants = require("./constants");
-
-module.exports = function (dataIn, width, height, options) {
- let outHasAlpha =
- [constants.COLORTYPE_COLOR_ALPHA, constants.COLORTYPE_ALPHA].indexOf(
- options.colorType
- ) !== -1;
- if (options.colorType === options.inputColorType) {
- let bigEndian = (function () {
- let buffer = new ArrayBuffer(2);
- new DataView(buffer).setInt16(0, 256, true /* littleEndian */);
- // Int16Array uses the platform's endianness.
- return new Int16Array(buffer)[0] !== 256;
- })();
- // If no need to convert to grayscale and alpha is present/absent in both, take a fast route
- if (options.bitDepth === 8 || (options.bitDepth === 16 && bigEndian)) {
- return dataIn;
- }
- }
-
- // map to a UInt16 array if data is 16bit, fix endianness below
- let data = options.bitDepth !== 16 ? dataIn : new Uint16Array(dataIn.buffer);
-
- let maxValue = 255;
- let inBpp = constants.COLORTYPE_TO_BPP_MAP[options.inputColorType];
- if (inBpp === 4 && !options.inputHasAlpha) {
- inBpp = 3;
- }
- let outBpp = constants.COLORTYPE_TO_BPP_MAP[options.colorType];
- if (options.bitDepth === 16) {
- maxValue = 65535;
- outBpp *= 2;
- }
- let outData = Buffer.alloc(width * height * outBpp);
-
- let inIndex = 0;
- let outIndex = 0;
-
- let bgColor = options.bgColor || {};
- if (bgColor.red === undefined) {
- bgColor.red = maxValue;
- }
- if (bgColor.green === undefined) {
- bgColor.green = maxValue;
- }
- if (bgColor.blue === undefined) {
- bgColor.blue = maxValue;
- }
-
- function getRGBA() {
- let red;
- let green;
- let blue;
- let alpha = maxValue;
- switch (options.inputColorType) {
- case constants.COLORTYPE_COLOR_ALPHA:
- alpha = data[inIndex + 3];
- red = data[inIndex];
- green = data[inIndex + 1];
- blue = data[inIndex + 2];
- break;
- case constants.COLORTYPE_COLOR:
- red = data[inIndex];
- green = data[inIndex + 1];
- blue = data[inIndex + 2];
- break;
- case constants.COLORTYPE_ALPHA:
- alpha = data[inIndex + 1];
- red = data[inIndex];
- green = red;
- blue = red;
- break;
- case constants.COLORTYPE_GRAYSCALE:
- red = data[inIndex];
- green = red;
- blue = red;
- break;
- default:
- throw new Error(
- "input color type:" +
- options.inputColorType +
- " is not supported at present"
- );
- }
-
- if (options.inputHasAlpha) {
- if (!outHasAlpha) {
- alpha /= maxValue;
- red = Math.min(
- Math.max(Math.round((1 - alpha) * bgColor.red + alpha * red), 0),
- maxValue
- );
- green = Math.min(
- Math.max(Math.round((1 - alpha) * bgColor.green + alpha * green), 0),
- maxValue
- );
- blue = Math.min(
- Math.max(Math.round((1 - alpha) * bgColor.blue + alpha * blue), 0),
- maxValue
- );
- }
- }
- return { red: red, green: green, blue: blue, alpha: alpha };
- }
-
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- let rgba = getRGBA(data, inIndex);
-
- switch (options.colorType) {
- case constants.COLORTYPE_COLOR_ALPHA:
- case constants.COLORTYPE_COLOR:
- if (options.bitDepth === 8) {
- outData[outIndex] = rgba.red;
- outData[outIndex + 1] = rgba.green;
- outData[outIndex + 2] = rgba.blue;
- if (outHasAlpha) {
- outData[outIndex + 3] = rgba.alpha;
- }
- } else {
- outData.writeUInt16BE(rgba.red, outIndex);
- outData.writeUInt16BE(rgba.green, outIndex + 2);
- outData.writeUInt16BE(rgba.blue, outIndex + 4);
- if (outHasAlpha) {
- outData.writeUInt16BE(rgba.alpha, outIndex + 6);
- }
- }
- break;
- case constants.COLORTYPE_ALPHA:
- case constants.COLORTYPE_GRAYSCALE: {
- // Convert to grayscale and alpha
- let grayscale = (rgba.red + rgba.green + rgba.blue) / 3;
- if (options.bitDepth === 8) {
- outData[outIndex] = grayscale;
- if (outHasAlpha) {
- outData[outIndex + 1] = rgba.alpha;
- }
- } else {
- outData.writeUInt16BE(grayscale, outIndex);
- if (outHasAlpha) {
- outData.writeUInt16BE(rgba.alpha, outIndex + 2);
- }
- }
- break;
- }
- default:
- throw new Error("unrecognised color Type " + options.colorType);
- }
-
- inIndex += inBpp;
- outIndex += outBpp;
- }
- }
-
- return outData;
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./constants":4,"buffer":28}],3:[function(require,module,exports){
-(function (process,Buffer){
-"use strict";
-
-let util = require("util");
-let Stream = require("stream");
-
-let ChunkStream = (module.exports = function () {
- Stream.call(this);
-
- this._buffers = [];
- this._buffered = 0;
-
- this._reads = [];
- this._paused = false;
-
- this._encoding = "utf8";
- this.writable = true;
-});
-util.inherits(ChunkStream, Stream);
-
-ChunkStream.prototype.read = function (length, callback) {
- this._reads.push({
- length: Math.abs(length), // if length < 0 then at most this length
- allowLess: length < 0,
- func: callback,
- });
-
- process.nextTick(
- function () {
- this._process();
-
- // its paused and there is not enought data then ask for more
- if (this._paused && this._reads && this._reads.length > 0) {
- this._paused = false;
-
- this.emit("drain");
- }
- }.bind(this)
- );
-};
-
-ChunkStream.prototype.write = function (data, encoding) {
- if (!this.writable) {
- this.emit("error", new Error("Stream not writable"));
- return false;
- }
-
- let dataBuffer;
- if (Buffer.isBuffer(data)) {
- dataBuffer = data;
- } else {
- dataBuffer = Buffer.from(data, encoding || this._encoding);
- }
-
- this._buffers.push(dataBuffer);
- this._buffered += dataBuffer.length;
-
- this._process();
-
- // ok if there are no more read requests
- if (this._reads && this._reads.length === 0) {
- this._paused = true;
- }
-
- return this.writable && !this._paused;
-};
-
-ChunkStream.prototype.end = function (data, encoding) {
- if (data) {
- this.write(data, encoding);
- }
-
- this.writable = false;
-
- // already destroyed
- if (!this._buffers) {
- return;
- }
-
- // enqueue or handle end
- if (this._buffers.length === 0) {
- this._end();
- } else {
- this._buffers.push(null);
- this._process();
- }
-};
-
-ChunkStream.prototype.destroySoon = ChunkStream.prototype.end;
-
-ChunkStream.prototype._end = function () {
- if (this._reads.length > 0) {
- this.emit("error", new Error("Unexpected end of input"));
- }
-
- this.destroy();
-};
-
-ChunkStream.prototype.destroy = function () {
- if (!this._buffers) {
- return;
- }
-
- this.writable = false;
- this._reads = null;
- this._buffers = null;
-
- this.emit("close");
-};
-
-ChunkStream.prototype._processReadAllowingLess = function (read) {
- // ok there is any data so that we can satisfy this request
- this._reads.shift(); // == read
-
- // first we need to peek into first buffer
- let smallerBuf = this._buffers[0];
-
- // ok there is more data than we need
- if (smallerBuf.length > read.length) {
- this._buffered -= read.length;
- this._buffers[0] = smallerBuf.slice(read.length);
-
- read.func.call(this, smallerBuf.slice(0, read.length));
- } else {
- // ok this is less than maximum length so use it all
- this._buffered -= smallerBuf.length;
- this._buffers.shift(); // == smallerBuf
-
- read.func.call(this, smallerBuf);
- }
-};
-
-ChunkStream.prototype._processRead = function (read) {
- this._reads.shift(); // == read
-
- let pos = 0;
- let count = 0;
- let data = Buffer.alloc(read.length);
-
- // create buffer for all data
- while (pos < read.length) {
- let buf = this._buffers[count++];
- let len = Math.min(buf.length, read.length - pos);
-
- buf.copy(data, pos, 0, len);
- pos += len;
-
- // last buffer wasn't used all so just slice it and leave
- if (len !== buf.length) {
- this._buffers[--count] = buf.slice(len);
- }
- }
-
- // remove all used buffers
- if (count > 0) {
- this._buffers.splice(0, count);
- }
-
- this._buffered -= read.length;
-
- read.func.call(this, data);
-};
-
-ChunkStream.prototype._process = function () {
- try {
- // as long as there is any data and read requests
- while (this._buffered > 0 && this._reads && this._reads.length > 0) {
- let read = this._reads[0];
-
- // read any data (but no more than length)
- if (read.allowLess) {
- this._processReadAllowingLess(read);
- } else if (this._buffered >= read.length) {
- // ok we can meet some expectations
-
- this._processRead(read);
- } else {
- // not enought data to satisfy first request in queue
- // so we need to wait for more
- break;
- }
- }
-
- if (this._buffers && !this.writable) {
- this._end();
- }
- } catch (ex) {
- this.emit("error", ex);
- }
-};
-
-}).call(this,require('_process'),require("buffer").Buffer)
-},{"_process":47,"buffer":28,"stream":63,"util":67}],4:[function(require,module,exports){
-"use strict";
-
-module.exports = {
- PNG_SIGNATURE: [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a],
-
- TYPE_IHDR: 0x49484452,
- TYPE_IEND: 0x49454e44,
- TYPE_IDAT: 0x49444154,
- TYPE_PLTE: 0x504c5445,
- TYPE_tRNS: 0x74524e53, // eslint-disable-line camelcase
- TYPE_gAMA: 0x67414d41, // eslint-disable-line camelcase
-
- // color-type bits
- COLORTYPE_GRAYSCALE: 0,
- COLORTYPE_PALETTE: 1,
- COLORTYPE_COLOR: 2,
- COLORTYPE_ALPHA: 4, // e.g. grayscale and alpha
-
- // color-type combinations
- COLORTYPE_PALETTE_COLOR: 3,
- COLORTYPE_COLOR_ALPHA: 6,
-
- COLORTYPE_TO_BPP_MAP: {
- 0: 1,
- 2: 3,
- 3: 1,
- 4: 2,
- 6: 4,
- },
-
- GAMMA_DIVISION: 100000,
-};
-
-},{}],5:[function(require,module,exports){
-"use strict";
-
-let crcTable = [];
-
-(function () {
- for (let i = 0; i < 256; i++) {
- let currentCrc = i;
- for (let j = 0; j < 8; j++) {
- if (currentCrc & 1) {
- currentCrc = 0xedb88320 ^ (currentCrc >>> 1);
- } else {
- currentCrc = currentCrc >>> 1;
- }
- }
- crcTable[i] = currentCrc;
- }
-})();
-
-let CrcCalculator = (module.exports = function () {
- this._crc = -1;
-});
-
-CrcCalculator.prototype.write = function (data) {
- for (let i = 0; i < data.length; i++) {
- this._crc = crcTable[(this._crc ^ data[i]) & 0xff] ^ (this._crc >>> 8);
- }
- return true;
-};
-
-CrcCalculator.prototype.crc32 = function () {
- return this._crc ^ -1;
-};
-
-CrcCalculator.crc32 = function (buf) {
- let crc = -1;
- for (let i = 0; i < buf.length; i++) {
- crc = crcTable[(crc ^ buf[i]) & 0xff] ^ (crc >>> 8);
- }
- return crc ^ -1;
-};
-
-},{}],6:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let paethPredictor = require("./paeth-predictor");
-
-function filterNone(pxData, pxPos, byteWidth, rawData, rawPos) {
- for (let x = 0; x < byteWidth; x++) {
- rawData[rawPos + x] = pxData[pxPos + x];
- }
-}
-
-function filterSumNone(pxData, pxPos, byteWidth) {
- let sum = 0;
- let length = pxPos + byteWidth;
-
- for (let i = pxPos; i < length; i++) {
- sum += Math.abs(pxData[i]);
- }
- return sum;
-}
-
-function filterSub(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let val = pxData[pxPos + x] - left;
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumSub(pxData, pxPos, byteWidth, bpp) {
- let sum = 0;
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let val = pxData[pxPos + x] - left;
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-function filterUp(pxData, pxPos, byteWidth, rawData, rawPos) {
- for (let x = 0; x < byteWidth; x++) {
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let val = pxData[pxPos + x] - up;
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumUp(pxData, pxPos, byteWidth) {
- let sum = 0;
- let length = pxPos + byteWidth;
- for (let x = pxPos; x < length; x++) {
- let up = pxPos > 0 ? pxData[x - byteWidth] : 0;
- let val = pxData[x] - up;
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-function filterAvg(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let val = pxData[pxPos + x] - ((left + up) >> 1);
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumAvg(pxData, pxPos, byteWidth, bpp) {
- let sum = 0;
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let val = pxData[pxPos + x] - ((left + up) >> 1);
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-function filterPaeth(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let upleft =
- pxPos > 0 && x >= bpp ? pxData[pxPos + x - (byteWidth + bpp)] : 0;
- let val = pxData[pxPos + x] - paethPredictor(left, up, upleft);
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumPaeth(pxData, pxPos, byteWidth, bpp) {
- let sum = 0;
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let upleft =
- pxPos > 0 && x >= bpp ? pxData[pxPos + x - (byteWidth + bpp)] : 0;
- let val = pxData[pxPos + x] - paethPredictor(left, up, upleft);
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-let filters = {
- 0: filterNone,
- 1: filterSub,
- 2: filterUp,
- 3: filterAvg,
- 4: filterPaeth,
-};
-
-let filterSums = {
- 0: filterSumNone,
- 1: filterSumSub,
- 2: filterSumUp,
- 3: filterSumAvg,
- 4: filterSumPaeth,
-};
-
-module.exports = function (pxData, width, height, options, bpp) {
- let filterTypes;
- if (!("filterType" in options) || options.filterType === -1) {
- filterTypes = [0, 1, 2, 3, 4];
- } else if (typeof options.filterType === "number") {
- filterTypes = [options.filterType];
- } else {
- throw new Error("unrecognised filter types");
- }
-
- if (options.bitDepth === 16) {
- bpp *= 2;
- }
- let byteWidth = width * bpp;
- let rawPos = 0;
- let pxPos = 0;
- let rawData = Buffer.alloc((byteWidth + 1) * height);
-
- let sel = filterTypes[0];
-
- for (let y = 0; y < height; y++) {
- if (filterTypes.length > 1) {
- // find best filter for this line (with lowest sum of values)
- let min = Infinity;
-
- for (let i = 0; i < filterTypes.length; i++) {
- let sum = filterSums[filterTypes[i]](pxData, pxPos, byteWidth, bpp);
- if (sum < min) {
- sel = filterTypes[i];
- min = sum;
- }
- }
- }
-
- rawData[rawPos] = sel;
- rawPos++;
- filters[sel](pxData, pxPos, byteWidth, rawData, rawPos, bpp);
- rawPos += byteWidth;
- pxPos += byteWidth;
- }
- return rawData;
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./paeth-predictor":15,"buffer":28}],7:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let util = require("util");
-let ChunkStream = require("./chunkstream");
-let Filter = require("./filter-parse");
-
-let FilterAsync = (module.exports = function (bitmapInfo) {
- ChunkStream.call(this);
-
- let buffers = [];
- let that = this;
- this._filter = new Filter(bitmapInfo, {
- read: this.read.bind(this),
- write: function (buffer) {
- buffers.push(buffer);
- },
- complete: function () {
- that.emit("complete", Buffer.concat(buffers));
- },
- });
-
- this._filter.start();
-});
-util.inherits(FilterAsync, ChunkStream);
-
-}).call(this,require("buffer").Buffer)
-},{"./chunkstream":3,"./filter-parse":9,"buffer":28,"util":67}],8:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let SyncReader = require("./sync-reader");
-let Filter = require("./filter-parse");
-
-exports.process = function (inBuffer, bitmapInfo) {
- let outBuffers = [];
- let reader = new SyncReader(inBuffer);
- let filter = new Filter(bitmapInfo, {
- read: reader.read.bind(reader),
- write: function (bufferPart) {
- outBuffers.push(bufferPart);
- },
- complete: function () {},
- });
-
- filter.start();
- reader.process();
-
- return Buffer.concat(outBuffers);
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./filter-parse":9,"./sync-reader":22,"buffer":28}],9:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let interlaceUtils = require("./interlace");
-let paethPredictor = require("./paeth-predictor");
-
-function getByteWidth(width, bpp, depth) {
- let byteWidth = width * bpp;
- if (depth !== 8) {
- byteWidth = Math.ceil(byteWidth / (8 / depth));
- }
- return byteWidth;
-}
-
-let Filter = (module.exports = function (bitmapInfo, dependencies) {
- let width = bitmapInfo.width;
- let height = bitmapInfo.height;
- let interlace = bitmapInfo.interlace;
- let bpp = bitmapInfo.bpp;
- let depth = bitmapInfo.depth;
-
- this.read = dependencies.read;
- this.write = dependencies.write;
- this.complete = dependencies.complete;
-
- this._imageIndex = 0;
- this._images = [];
- if (interlace) {
- let passes = interlaceUtils.getImagePasses(width, height);
- for (let i = 0; i < passes.length; i++) {
- this._images.push({
- byteWidth: getByteWidth(passes[i].width, bpp, depth),
- height: passes[i].height,
- lineIndex: 0,
- });
- }
- } else {
- this._images.push({
- byteWidth: getByteWidth(width, bpp, depth),
- height: height,
- lineIndex: 0,
- });
- }
-
- // when filtering the line we look at the pixel to the left
- // the spec also says it is done on a byte level regardless of the number of pixels
- // so if the depth is byte compatible (8 or 16) we subtract the bpp in order to compare back
- // a pixel rather than just a different byte part. However if we are sub byte, we ignore.
- if (depth === 8) {
- this._xComparison = bpp;
- } else if (depth === 16) {
- this._xComparison = bpp * 2;
- } else {
- this._xComparison = 1;
- }
-});
-
-Filter.prototype.start = function () {
- this.read(
- this._images[this._imageIndex].byteWidth + 1,
- this._reverseFilterLine.bind(this)
- );
-};
-
-Filter.prototype._unFilterType1 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let xComparison = this._xComparison;
- let xBiggerThan = xComparison - 1;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f1Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;
- unfilteredLine[x] = rawByte + f1Left;
- }
-};
-
-Filter.prototype._unFilterType2 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let lastLine = this._lastLine;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f2Up = lastLine ? lastLine[x] : 0;
- unfilteredLine[x] = rawByte + f2Up;
- }
-};
-
-Filter.prototype._unFilterType3 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let xComparison = this._xComparison;
- let xBiggerThan = xComparison - 1;
- let lastLine = this._lastLine;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f3Up = lastLine ? lastLine[x] : 0;
- let f3Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;
- let f3Add = Math.floor((f3Left + f3Up) / 2);
- unfilteredLine[x] = rawByte + f3Add;
- }
-};
-
-Filter.prototype._unFilterType4 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let xComparison = this._xComparison;
- let xBiggerThan = xComparison - 1;
- let lastLine = this._lastLine;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f4Up = lastLine ? lastLine[x] : 0;
- let f4Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;
- let f4UpLeft = x > xBiggerThan && lastLine ? lastLine[x - xComparison] : 0;
- let f4Add = paethPredictor(f4Left, f4Up, f4UpLeft);
- unfilteredLine[x] = rawByte + f4Add;
- }
-};
-
-Filter.prototype._reverseFilterLine = function (rawData) {
- let filter = rawData[0];
- let unfilteredLine;
- let currentImage = this._images[this._imageIndex];
- let byteWidth = currentImage.byteWidth;
-
- if (filter === 0) {
- unfilteredLine = rawData.slice(1, byteWidth + 1);
- } else {
- unfilteredLine = Buffer.alloc(byteWidth);
-
- switch (filter) {
- case 1:
- this._unFilterType1(rawData, unfilteredLine, byteWidth);
- break;
- case 2:
- this._unFilterType2(rawData, unfilteredLine, byteWidth);
- break;
- case 3:
- this._unFilterType3(rawData, unfilteredLine, byteWidth);
- break;
- case 4:
- this._unFilterType4(rawData, unfilteredLine, byteWidth);
- break;
- default:
- throw new Error("Unrecognised filter type - " + filter);
- }
- }
-
- this.write(unfilteredLine);
-
- currentImage.lineIndex++;
- if (currentImage.lineIndex >= currentImage.height) {
- this._lastLine = null;
- this._imageIndex++;
- currentImage = this._images[this._imageIndex];
- } else {
- this._lastLine = unfilteredLine;
- }
-
- if (currentImage) {
- // read, using the byte width that may be from the new current image
- this.read(currentImage.byteWidth + 1, this._reverseFilterLine.bind(this));
- } else {
- this._lastLine = null;
- this.complete();
- }
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./interlace":11,"./paeth-predictor":15,"buffer":28}],10:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-function dePalette(indata, outdata, width, height, palette) {
- let pxPos = 0;
- // use values from palette
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- let color = palette[indata[pxPos]];
-
- if (!color) {
- throw new Error("index " + indata[pxPos] + " not in palette");
- }
-
- for (let i = 0; i < 4; i++) {
- outdata[pxPos + i] = color[i];
- }
- pxPos += 4;
- }
- }
-}
-
-function replaceTransparentColor(indata, outdata, width, height, transColor) {
- let pxPos = 0;
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- let makeTrans = false;
-
- if (transColor.length === 1) {
- if (transColor[0] === indata[pxPos]) {
- makeTrans = true;
- }
- } else if (
- transColor[0] === indata[pxPos] &&
- transColor[1] === indata[pxPos + 1] &&
- transColor[2] === indata[pxPos + 2]
- ) {
- makeTrans = true;
- }
- if (makeTrans) {
- for (let i = 0; i < 4; i++) {
- outdata[pxPos + i] = 0;
- }
- }
- pxPos += 4;
- }
- }
-}
-
-function scaleDepth(indata, outdata, width, height, depth) {
- let maxOutSample = 255;
- let maxInSample = Math.pow(2, depth) - 1;
- let pxPos = 0;
-
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- for (let i = 0; i < 4; i++) {
- outdata[pxPos + i] = Math.floor(
- (indata[pxPos + i] * maxOutSample) / maxInSample + 0.5
- );
- }
- pxPos += 4;
- }
- }
-}
-
-module.exports = function (indata, imageData) {
- let depth = imageData.depth;
- let width = imageData.width;
- let height = imageData.height;
- let colorType = imageData.colorType;
- let transColor = imageData.transColor;
- let palette = imageData.palette;
-
- let outdata = indata; // only different for 16 bits
-
- if (colorType === 3) {
- // paletted
- dePalette(indata, outdata, width, height, palette);
- } else {
- if (transColor) {
- replaceTransparentColor(indata, outdata, width, height, transColor);
- }
- // if it needs scaling
- if (depth !== 8) {
- // if we need to change the buffer size
- if (depth === 16) {
- outdata = Buffer.alloc(width * height * 4);
- }
- scaleDepth(indata, outdata, width, height, depth);
- }
- }
- return outdata;
-};
-
-}).call(this,require("buffer").Buffer)
-},{"buffer":28}],11:[function(require,module,exports){
-"use strict";
-
-// Adam 7
-// 0 1 2 3 4 5 6 7
-// 0 x 6 4 6 x 6 4 6
-// 1 7 7 7 7 7 7 7 7
-// 2 5 6 5 6 5 6 5 6
-// 3 7 7 7 7 7 7 7 7
-// 4 3 6 4 6 3 6 4 6
-// 5 7 7 7 7 7 7 7 7
-// 6 5 6 5 6 5 6 5 6
-// 7 7 7 7 7 7 7 7 7
-
-let imagePasses = [
- {
- // pass 1 - 1px
- x: [0],
- y: [0],
- },
- {
- // pass 2 - 1px
- x: [4],
- y: [0],
- },
- {
- // pass 3 - 2px
- x: [0, 4],
- y: [4],
- },
- {
- // pass 4 - 4px
- x: [2, 6],
- y: [0, 4],
- },
- {
- // pass 5 - 8px
- x: [0, 2, 4, 6],
- y: [2, 6],
- },
- {
- // pass 6 - 16px
- x: [1, 3, 5, 7],
- y: [0, 2, 4, 6],
- },
- {
- // pass 7 - 32px
- x: [0, 1, 2, 3, 4, 5, 6, 7],
- y: [1, 3, 5, 7],
- },
-];
-
-exports.getImagePasses = function (width, height) {
- let images = [];
- let xLeftOver = width % 8;
- let yLeftOver = height % 8;
- let xRepeats = (width - xLeftOver) / 8;
- let yRepeats = (height - yLeftOver) / 8;
- for (let i = 0; i < imagePasses.length; i++) {
- let pass = imagePasses[i];
- let passWidth = xRepeats * pass.x.length;
- let passHeight = yRepeats * pass.y.length;
- for (let j = 0; j < pass.x.length; j++) {
- if (pass.x[j] < xLeftOver) {
- passWidth++;
- } else {
- break;
- }
- }
- for (let j = 0; j < pass.y.length; j++) {
- if (pass.y[j] < yLeftOver) {
- passHeight++;
- } else {
- break;
- }
- }
- if (passWidth > 0 && passHeight > 0) {
- images.push({ width: passWidth, height: passHeight, index: i });
- }
- }
- return images;
-};
-
-exports.getInterlaceIterator = function (width) {
- return function (x, y, pass) {
- let outerXLeftOver = x % imagePasses[pass].x.length;
- let outerX =
- ((x - outerXLeftOver) / imagePasses[pass].x.length) * 8 +
- imagePasses[pass].x[outerXLeftOver];
- let outerYLeftOver = y % imagePasses[pass].y.length;
- let outerY =
- ((y - outerYLeftOver) / imagePasses[pass].y.length) * 8 +
- imagePasses[pass].y[outerYLeftOver];
- return outerX * 4 + outerY * width * 4;
- };
-};
-
-},{}],12:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let util = require("util");
-let Stream = require("stream");
-let constants = require("./constants");
-let Packer = require("./packer");
-
-let PackerAsync = (module.exports = function (opt) {
- Stream.call(this);
-
- let options = opt || {};
-
- this._packer = new Packer(options);
- this._deflate = this._packer.createDeflate();
-
- this.readable = true;
-});
-util.inherits(PackerAsync, Stream);
-
-PackerAsync.prototype.pack = function (data, width, height, gamma) {
- // Signature
- this.emit("data", Buffer.from(constants.PNG_SIGNATURE));
- this.emit("data", this._packer.packIHDR(width, height));
-
- if (gamma) {
- this.emit("data", this._packer.packGAMA(gamma));
- }
-
- let filteredData = this._packer.filterData(data, width, height);
-
- // compress it
- this._deflate.on("error", this.emit.bind(this, "error"));
-
- this._deflate.on(
- "data",
- function (compressedData) {
- this.emit("data", this._packer.packIDAT(compressedData));
- }.bind(this)
- );
-
- this._deflate.on(
- "end",
- function () {
- this.emit("data", this._packer.packIEND());
- this.emit("end");
- }.bind(this)
- );
-
- this._deflate.end(filteredData);
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./constants":4,"./packer":14,"buffer":28,"stream":63,"util":67}],13:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let hasSyncZlib = true;
-let zlib = require("zlib");
-if (!zlib.deflateSync) {
- hasSyncZlib = false;
-}
-let constants = require("./constants");
-let Packer = require("./packer");
-
-module.exports = function (metaData, opt) {
- if (!hasSyncZlib) {
- throw new Error(
- "To use the sync capability of this library in old node versions, please pin pngjs to v2.3.0"
- );
- }
-
- let options = opt || {};
-
- let packer = new Packer(options);
-
- let chunks = [];
-
- // Signature
- chunks.push(Buffer.from(constants.PNG_SIGNATURE));
-
- // Header
- chunks.push(packer.packIHDR(metaData.width, metaData.height));
-
- if (metaData.gamma) {
- chunks.push(packer.packGAMA(metaData.gamma));
- }
-
- let filteredData = packer.filterData(
- metaData.data,
- metaData.width,
- metaData.height
- );
-
- // compress it
- let compressedData = zlib.deflateSync(
- filteredData,
- packer.getDeflateOptions()
- );
- filteredData = null;
-
- if (!compressedData || !compressedData.length) {
- throw new Error("bad png - invalid compressed data response");
- }
- chunks.push(packer.packIDAT(compressedData));
-
- // End
- chunks.push(packer.packIEND());
-
- return Buffer.concat(chunks);
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./constants":4,"./packer":14,"buffer":28,"zlib":27}],14:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let constants = require("./constants");
-let CrcStream = require("./crc");
-let bitPacker = require("./bitpacker");
-let filter = require("./filter-pack");
-let zlib = require("zlib");
-
-let Packer = (module.exports = function (options) {
- this._options = options;
-
- options.deflateChunkSize = options.deflateChunkSize || 32 * 1024;
- options.deflateLevel =
- options.deflateLevel != null ? options.deflateLevel : 9;
- options.deflateStrategy =
- options.deflateStrategy != null ? options.deflateStrategy : 3;
- options.inputHasAlpha =
- options.inputHasAlpha != null ? options.inputHasAlpha : true;
- options.deflateFactory = options.deflateFactory || zlib.createDeflate;
- options.bitDepth = options.bitDepth || 8;
- // This is outputColorType
- options.colorType =
- typeof options.colorType === "number"
- ? options.colorType
- : constants.COLORTYPE_COLOR_ALPHA;
- options.inputColorType =
- typeof options.inputColorType === "number"
- ? options.inputColorType
- : constants.COLORTYPE_COLOR_ALPHA;
-
- if (
- [
- constants.COLORTYPE_GRAYSCALE,
- constants.COLORTYPE_COLOR,
- constants.COLORTYPE_COLOR_ALPHA,
- constants.COLORTYPE_ALPHA,
- ].indexOf(options.colorType) === -1
- ) {
- throw new Error(
- "option color type:" + options.colorType + " is not supported at present"
- );
- }
- if (
- [
- constants.COLORTYPE_GRAYSCALE,
- constants.COLORTYPE_COLOR,
- constants.COLORTYPE_COLOR_ALPHA,
- constants.COLORTYPE_ALPHA,
- ].indexOf(options.inputColorType) === -1
- ) {
- throw new Error(
- "option input color type:" +
- options.inputColorType +
- " is not supported at present"
- );
- }
- if (options.bitDepth !== 8 && options.bitDepth !== 16) {
- throw new Error(
- "option bit depth:" + options.bitDepth + " is not supported at present"
- );
- }
-});
-
-Packer.prototype.getDeflateOptions = function () {
- return {
- chunkSize: this._options.deflateChunkSize,
- level: this._options.deflateLevel,
- strategy: this._options.deflateStrategy,
- };
-};
-
-Packer.prototype.createDeflate = function () {
- return this._options.deflateFactory(this.getDeflateOptions());
-};
-
-Packer.prototype.filterData = function (data, width, height) {
- // convert to correct format for filtering (e.g. right bpp and bit depth)
- let packedData = bitPacker(data, width, height, this._options);
-
- // filter pixel data
- let bpp = constants.COLORTYPE_TO_BPP_MAP[this._options.colorType];
- let filteredData = filter(packedData, width, height, this._options, bpp);
- return filteredData;
-};
-
-Packer.prototype._packChunk = function (type, data) {
- let len = data ? data.length : 0;
- let buf = Buffer.alloc(len + 12);
-
- buf.writeUInt32BE(len, 0);
- buf.writeUInt32BE(type, 4);
-
- if (data) {
- data.copy(buf, 8);
- }
-
- buf.writeInt32BE(
- CrcStream.crc32(buf.slice(4, buf.length - 4)),
- buf.length - 4
- );
- return buf;
-};
-
-Packer.prototype.packGAMA = function (gamma) {
- let buf = Buffer.alloc(4);
- buf.writeUInt32BE(Math.floor(gamma * constants.GAMMA_DIVISION), 0);
- return this._packChunk(constants.TYPE_gAMA, buf);
-};
-
-Packer.prototype.packIHDR = function (width, height) {
- let buf = Buffer.alloc(13);
- buf.writeUInt32BE(width, 0);
- buf.writeUInt32BE(height, 4);
- buf[8] = this._options.bitDepth; // Bit depth
- buf[9] = this._options.colorType; // colorType
- buf[10] = 0; // compression
- buf[11] = 0; // filter
- buf[12] = 0; // interlace
-
- return this._packChunk(constants.TYPE_IHDR, buf);
-};
-
-Packer.prototype.packIDAT = function (data) {
- return this._packChunk(constants.TYPE_IDAT, data);
-};
-
-Packer.prototype.packIEND = function () {
- return this._packChunk(constants.TYPE_IEND, null);
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./bitpacker":2,"./constants":4,"./crc":5,"./filter-pack":6,"buffer":28,"zlib":27}],15:[function(require,module,exports){
-"use strict";
-
-module.exports = function paethPredictor(left, above, upLeft) {
- let paeth = left + above - upLeft;
- let pLeft = Math.abs(paeth - left);
- let pAbove = Math.abs(paeth - above);
- let pUpLeft = Math.abs(paeth - upLeft);
-
- if (pLeft <= pAbove && pLeft <= pUpLeft) {
- return left;
- }
- if (pAbove <= pUpLeft) {
- return above;
- }
- return upLeft;
-};
-
-},{}],16:[function(require,module,exports){
-"use strict";
-
-let util = require("util");
-let zlib = require("zlib");
-let ChunkStream = require("./chunkstream");
-let FilterAsync = require("./filter-parse-async");
-let Parser = require("./parser");
-let bitmapper = require("./bitmapper");
-let formatNormaliser = require("./format-normaliser");
-
-let ParserAsync = (module.exports = function (options) {
- ChunkStream.call(this);
-
- this._parser = new Parser(options, {
- read: this.read.bind(this),
- error: this._handleError.bind(this),
- metadata: this._handleMetaData.bind(this),
- gamma: this.emit.bind(this, "gamma"),
- palette: this._handlePalette.bind(this),
- transColor: this._handleTransColor.bind(this),
- finished: this._finished.bind(this),
- inflateData: this._inflateData.bind(this),
- simpleTransparency: this._simpleTransparency.bind(this),
- headersFinished: this._headersFinished.bind(this),
- });
- this._options = options;
- this.writable = true;
-
- this._parser.start();
-});
-util.inherits(ParserAsync, ChunkStream);
-
-ParserAsync.prototype._handleError = function (err) {
- this.emit("error", err);
-
- this.writable = false;
-
- this.destroy();
-
- if (this._inflate && this._inflate.destroy) {
- this._inflate.destroy();
- }
-
- if (this._filter) {
- this._filter.destroy();
- // For backward compatibility with Node 7 and below.
- // Suppress errors due to _inflate calling write() even after
- // it's destroy()'ed.
- this._filter.on("error", function () {});
- }
-
- this.errord = true;
-};
-
-ParserAsync.prototype._inflateData = function (data) {
- if (!this._inflate) {
- if (this._bitmapInfo.interlace) {
- this._inflate = zlib.createInflate();
-
- this._inflate.on("error", this.emit.bind(this, "error"));
- this._filter.on("complete", this._complete.bind(this));
-
- this._inflate.pipe(this._filter);
- } else {
- let rowSize =
- ((this._bitmapInfo.width *
- this._bitmapInfo.bpp *
- this._bitmapInfo.depth +
- 7) >>
- 3) +
- 1;
- let imageSize = rowSize * this._bitmapInfo.height;
- let chunkSize = Math.max(imageSize, zlib.Z_MIN_CHUNK);
-
- this._inflate = zlib.createInflate({ chunkSize: chunkSize });
- let leftToInflate = imageSize;
-
- let emitError = this.emit.bind(this, "error");
- this._inflate.on("error", function (err) {
- if (!leftToInflate) {
- return;
- }
-
- emitError(err);
- });
- this._filter.on("complete", this._complete.bind(this));
-
- let filterWrite = this._filter.write.bind(this._filter);
- this._inflate.on("data", function (chunk) {
- if (!leftToInflate) {
- return;
- }
-
- if (chunk.length > leftToInflate) {
- chunk = chunk.slice(0, leftToInflate);
- }
-
- leftToInflate -= chunk.length;
-
- filterWrite(chunk);
- });
-
- this._inflate.on("end", this._filter.end.bind(this._filter));
- }
- }
- this._inflate.write(data);
-};
-
-ParserAsync.prototype._handleMetaData = function (metaData) {
- this._metaData = metaData;
- this._bitmapInfo = Object.create(metaData);
-
- this._filter = new FilterAsync(this._bitmapInfo);
-};
-
-ParserAsync.prototype._handleTransColor = function (transColor) {
- this._bitmapInfo.transColor = transColor;
-};
-
-ParserAsync.prototype._handlePalette = function (palette) {
- this._bitmapInfo.palette = palette;
-};
-
-ParserAsync.prototype._simpleTransparency = function () {
- this._metaData.alpha = true;
-};
-
-ParserAsync.prototype._headersFinished = function () {
- // Up until this point, we don't know if we have a tRNS chunk (alpha)
- // so we can't emit metadata any earlier
- this.emit("metadata", this._metaData);
-};
-
-ParserAsync.prototype._finished = function () {
- if (this.errord) {
- return;
- }
-
- if (!this._inflate) {
- this.emit("error", "No Inflate block");
- } else {
- // no more data to inflate
- this._inflate.end();
- }
-};
-
-ParserAsync.prototype._complete = function (filteredData) {
- if (this.errord) {
- return;
- }
-
- let normalisedBitmapData;
-
- try {
- let bitmapData = bitmapper.dataToBitMap(filteredData, this._bitmapInfo);
-
- normalisedBitmapData = formatNormaliser(bitmapData, this._bitmapInfo);
- bitmapData = null;
- } catch (ex) {
- this._handleError(ex);
- return;
- }
-
- this.emit("parsed", normalisedBitmapData);
-};
-
-},{"./bitmapper":1,"./chunkstream":3,"./filter-parse-async":7,"./format-normaliser":10,"./parser":18,"util":67,"zlib":27}],17:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let hasSyncZlib = true;
-let zlib = require("zlib");
-let inflateSync = require("./sync-inflate");
-if (!zlib.deflateSync) {
- hasSyncZlib = false;
-}
-let SyncReader = require("./sync-reader");
-let FilterSync = require("./filter-parse-sync");
-let Parser = require("./parser");
-let bitmapper = require("./bitmapper");
-let formatNormaliser = require("./format-normaliser");
-
-module.exports = function (buffer, options) {
- if (!hasSyncZlib) {
- throw new Error(
- "To use the sync capability of this library in old node versions, please pin pngjs to v2.3.0"
- );
- }
-
- let err;
- function handleError(_err_) {
- err = _err_;
- }
-
- let metaData;
- function handleMetaData(_metaData_) {
- metaData = _metaData_;
- }
-
- function handleTransColor(transColor) {
- metaData.transColor = transColor;
- }
-
- function handlePalette(palette) {
- metaData.palette = palette;
- }
-
- function handleSimpleTransparency() {
- metaData.alpha = true;
- }
-
- let gamma;
- function handleGamma(_gamma_) {
- gamma = _gamma_;
- }
-
- let inflateDataList = [];
- function handleInflateData(inflatedData) {
- inflateDataList.push(inflatedData);
- }
-
- let reader = new SyncReader(buffer);
-
- let parser = new Parser(options, {
- read: reader.read.bind(reader),
- error: handleError,
- metadata: handleMetaData,
- gamma: handleGamma,
- palette: handlePalette,
- transColor: handleTransColor,
- inflateData: handleInflateData,
- simpleTransparency: handleSimpleTransparency,
- });
-
- parser.start();
- reader.process();
-
- if (err) {
- throw err;
- }
-
- //join together the inflate datas
- let inflateData = Buffer.concat(inflateDataList);
- inflateDataList.length = 0;
-
- let inflatedData;
- if (metaData.interlace) {
- inflatedData = zlib.inflateSync(inflateData);
- } else {
- let rowSize =
- ((metaData.width * metaData.bpp * metaData.depth + 7) >> 3) + 1;
- let imageSize = rowSize * metaData.height;
- inflatedData = inflateSync(inflateData, {
- chunkSize: imageSize,
- maxLength: imageSize,
- });
- }
- inflateData = null;
-
- if (!inflatedData || !inflatedData.length) {
- throw new Error("bad png - invalid inflate data response");
- }
-
- let unfilteredData = FilterSync.process(inflatedData, metaData);
- inflateData = null;
-
- let bitmapData = bitmapper.dataToBitMap(unfilteredData, metaData);
- unfilteredData = null;
-
- let normalisedBitmapData = formatNormaliser(bitmapData, metaData);
-
- metaData.data = normalisedBitmapData;
- metaData.gamma = gamma || 0;
-
- return metaData;
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./bitmapper":1,"./filter-parse-sync":8,"./format-normaliser":10,"./parser":18,"./sync-inflate":21,"./sync-reader":22,"buffer":28,"zlib":27}],18:[function(require,module,exports){
-(function (Buffer){
-"use strict";
-
-let constants = require("./constants");
-let CrcCalculator = require("./crc");
-
-let Parser = (module.exports = function (options, dependencies) {
- this._options = options;
- options.checkCRC = options.checkCRC !== false;
-
- this._hasIHDR = false;
- this._hasIEND = false;
- this._emittedHeadersFinished = false;
-
- // input flags/metadata
- this._palette = [];
- this._colorType = 0;
-
- this._chunks = {};
- this._chunks[constants.TYPE_IHDR] = this._handleIHDR.bind(this);
- this._chunks[constants.TYPE_IEND] = this._handleIEND.bind(this);
- this._chunks[constants.TYPE_IDAT] = this._handleIDAT.bind(this);
- this._chunks[constants.TYPE_PLTE] = this._handlePLTE.bind(this);
- this._chunks[constants.TYPE_tRNS] = this._handleTRNS.bind(this);
- this._chunks[constants.TYPE_gAMA] = this._handleGAMA.bind(this);
-
- this.read = dependencies.read;
- this.error = dependencies.error;
- this.metadata = dependencies.metadata;
- this.gamma = dependencies.gamma;
- this.transColor = dependencies.transColor;
- this.palette = dependencies.palette;
- this.parsed = dependencies.parsed;
- this.inflateData = dependencies.inflateData;
- this.finished = dependencies.finished;
- this.simpleTransparency = dependencies.simpleTransparency;
- this.headersFinished = dependencies.headersFinished || function () {};
-});
-
-Parser.prototype.start = function () {
- this.read(constants.PNG_SIGNATURE.length, this._parseSignature.bind(this));
-};
-
-Parser.prototype._parseSignature = function (data) {
- let signature = constants.PNG_SIGNATURE;
-
- for (let i = 0; i < signature.length; i++) {
- if (data[i] !== signature[i]) {
- this.error(new Error("Invalid file signature"));
- return;
- }
- }
- this.read(8, this._parseChunkBegin.bind(this));
-};
-
-Parser.prototype._parseChunkBegin = function (data) {
- // chunk content length
- let length = data.readUInt32BE(0);
-
- // chunk type
- let type = data.readUInt32BE(4);
- let name = "";
- for (let i = 4; i < 8; i++) {
- name += String.fromCharCode(data[i]);
- }
-
- //console.log('chunk ', name, length);
-
- // chunk flags
- let ancillary = Boolean(data[4] & 0x20); // or critical
- // priv = Boolean(data[5] & 0x20), // or public
- // safeToCopy = Boolean(data[7] & 0x20); // or unsafe
-
- if (!this._hasIHDR && type !== constants.TYPE_IHDR) {
- this.error(new Error("Expected IHDR on beggining"));
- return;
- }
-
- this._crc = new CrcCalculator();
- this._crc.write(Buffer.from(name));
-
- if (this._chunks[type]) {
- return this._chunks[type](length);
- }
-
- if (!ancillary) {
- this.error(new Error("Unsupported critical chunk type " + name));
- return;
- }
-
- this.read(length + 4, this._skipChunk.bind(this));
-};
-
-Parser.prototype._skipChunk = function (/*data*/) {
- this.read(8, this._parseChunkBegin.bind(this));
-};
-
-Parser.prototype._handleChunkEnd = function () {
- this.read(4, this._parseChunkEnd.bind(this));
-};
-
-Parser.prototype._parseChunkEnd = function (data) {
- let fileCrc = data.readInt32BE(0);
- let calcCrc = this._crc.crc32();
-
- // check CRC
- if (this._options.checkCRC && calcCrc !== fileCrc) {
- this.error(new Error("Crc error - " + fileCrc + " - " + calcCrc));
- return;
- }
-
- if (!this._hasIEND) {
- this.read(8, this._parseChunkBegin.bind(this));
- }
-};
-
-Parser.prototype._handleIHDR = function (length) {
- this.read(length, this._parseIHDR.bind(this));
-};
-Parser.prototype._parseIHDR = function (data) {
- this._crc.write(data);
-
- let width = data.readUInt32BE(0);
- let height = data.readUInt32BE(4);
- let depth = data[8];
- let colorType = data[9]; // bits: 1 palette, 2 color, 4 alpha
- let compr = data[10];
- let filter = data[11];
- let interlace = data[12];
-
- // console.log(' width', width, 'height', height,
- // 'depth', depth, 'colorType', colorType,
- // 'compr', compr, 'filter', filter, 'interlace', interlace
- // );
-
- if (
- depth !== 8 &&
- depth !== 4 &&
- depth !== 2 &&
- depth !== 1 &&
- depth !== 16
- ) {
- this.error(new Error("Unsupported bit depth " + depth));
- return;
- }
- if (!(colorType in constants.COLORTYPE_TO_BPP_MAP)) {
- this.error(new Error("Unsupported color type"));
- return;
- }
- if (compr !== 0) {
- this.error(new Error("Unsupported compression method"));
- return;
- }
- if (filter !== 0) {
- this.error(new Error("Unsupported filter method"));
- return;
- }
- if (interlace !== 0 && interlace !== 1) {
- this.error(new Error("Unsupported interlace method"));
- return;
- }
-
- this._colorType = colorType;
-
- let bpp = constants.COLORTYPE_TO_BPP_MAP[this._colorType];
-
- this._hasIHDR = true;
-
- this.metadata({
- width: width,
- height: height,
- depth: depth,
- interlace: Boolean(interlace),
- palette: Boolean(colorType & constants.COLORTYPE_PALETTE),
- color: Boolean(colorType & constants.COLORTYPE_COLOR),
- alpha: Boolean(colorType & constants.COLORTYPE_ALPHA),
- bpp: bpp,
- colorType: colorType,
- });
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handlePLTE = function (length) {
- this.read(length, this._parsePLTE.bind(this));
-};
-Parser.prototype._parsePLTE = function (data) {
- this._crc.write(data);
-
- let entries = Math.floor(data.length / 3);
- // console.log('Palette:', entries);
-
- for (let i = 0; i < entries; i++) {
- this._palette.push([data[i * 3], data[i * 3 + 1], data[i * 3 + 2], 0xff]);
- }
-
- this.palette(this._palette);
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handleTRNS = function (length) {
- this.simpleTransparency();
- this.read(length, this._parseTRNS.bind(this));
-};
-Parser.prototype._parseTRNS = function (data) {
- this._crc.write(data);
-
- // palette
- if (this._colorType === constants.COLORTYPE_PALETTE_COLOR) {
- if (this._palette.length === 0) {
- this.error(new Error("Transparency chunk must be after palette"));
- return;
- }
- if (data.length > this._palette.length) {
- this.error(new Error("More transparent colors than palette size"));
- return;
- }
- for (let i = 0; i < data.length; i++) {
- this._palette[i][3] = data[i];
- }
- this.palette(this._palette);
- }
-
- // for colorType 0 (grayscale) and 2 (rgb)
- // there might be one gray/color defined as transparent
- if (this._colorType === constants.COLORTYPE_GRAYSCALE) {
- // grey, 2 bytes
- this.transColor([data.readUInt16BE(0)]);
- }
- if (this._colorType === constants.COLORTYPE_COLOR) {
- this.transColor([
- data.readUInt16BE(0),
- data.readUInt16BE(2),
- data.readUInt16BE(4),
- ]);
- }
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handleGAMA = function (length) {
- this.read(length, this._parseGAMA.bind(this));
-};
-Parser.prototype._parseGAMA = function (data) {
- this._crc.write(data);
- this.gamma(data.readUInt32BE(0) / constants.GAMMA_DIVISION);
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handleIDAT = function (length) {
- if (!this._emittedHeadersFinished) {
- this._emittedHeadersFinished = true;
- this.headersFinished();
- }
- this.read(-length, this._parseIDAT.bind(this, length));
-};
-Parser.prototype._parseIDAT = function (length, data) {
- this._crc.write(data);
-
- if (
- this._colorType === constants.COLORTYPE_PALETTE_COLOR &&
- this._palette.length === 0
- ) {
- throw new Error("Expected palette not found");
- }
-
- this.inflateData(data);
- let leftOverLength = length - data.length;
-
- if (leftOverLength > 0) {
- this._handleIDAT(leftOverLength);
- } else {
- this._handleChunkEnd();
- }
-};
-
-Parser.prototype._handleIEND = function (length) {
- this.read(length, this._parseIEND.bind(this));
-};
-Parser.prototype._parseIEND = function (data) {
- this._crc.write(data);
-
- this._hasIEND = true;
- this._handleChunkEnd();
-
- if (this.finished) {
- this.finished();
- }
-};
-
-}).call(this,require("buffer").Buffer)
-},{"./constants":4,"./crc":5,"buffer":28}],19:[function(require,module,exports){
-"use strict";
-
-let parse = require("./parser-sync");
-let pack = require("./packer-sync");
-
-exports.read = function (buffer, options) {
- return parse(buffer, options || {});
-};
-
-exports.write = function (png, options) {
- return pack(png, options);
-};
-
-},{"./packer-sync":13,"./parser-sync":17}],20:[function(require,module,exports){
-(function (process,Buffer){
-"use strict";
-
-let util = require("util");
-let Stream = require("stream");
-let Parser = require("./parser-async");
-let Packer = require("./packer-async");
-let PNGSync = require("./png-sync");
-
-let PNG = (exports.PNG = function (options) {
- Stream.call(this);
-
- options = options || {}; // eslint-disable-line no-param-reassign
-
- // coerce pixel dimensions to integers (also coerces undefined -> 0):
- this.width = options.width | 0;
- this.height = options.height | 0;
-
- this.data =
- this.width > 0 && this.height > 0
- ? Buffer.alloc(4 * this.width * this.height)
- : null;
-
- if (options.fill && this.data) {
- this.data.fill(0);
- }
-
- this.gamma = 0;
- this.readable = this.writable = true;
-
- this._parser = new Parser(options);
-
- this._parser.on("error", this.emit.bind(this, "error"));
- this._parser.on("close", this._handleClose.bind(this));
- this._parser.on("metadata", this._metadata.bind(this));
- this._parser.on("gamma", this._gamma.bind(this));
- this._parser.on(
- "parsed",
- function (data) {
- this.data = data;
- this.emit("parsed", data);
- }.bind(this)
- );
-
- this._packer = new Packer(options);
- this._packer.on("data", this.emit.bind(this, "data"));
- this._packer.on("end", this.emit.bind(this, "end"));
- this._parser.on("close", this._handleClose.bind(this));
- this._packer.on("error", this.emit.bind(this, "error"));
-});
-util.inherits(PNG, Stream);
-
-PNG.sync = PNGSync;
-
-PNG.prototype.pack = function () {
- if (!this.data || !this.data.length) {
- this.emit("error", "No data provided");
- return this;
- }
-
- process.nextTick(
- function () {
- this._packer.pack(this.data, this.width, this.height, this.gamma);
- }.bind(this)
- );
-
- return this;
-};
-
-PNG.prototype.parse = function (data, callback) {
- if (callback) {
- let onParsed, onError;
-
- onParsed = function (parsedData) {
- this.removeListener("error", onError);
-
- this.data = parsedData;
- callback(null, this);
- }.bind(this);
-
- onError = function (err) {
- this.removeListener("parsed", onParsed);
-
- callback(err, null);
- }.bind(this);
-
- this.once("parsed", onParsed);
- this.once("error", onError);
- }
-
- this.end(data);
- return this;
-};
-
-PNG.prototype.write = function (data) {
- this._parser.write(data);
- return true;
-};
-
-PNG.prototype.end = function (data) {
- this._parser.end(data);
-};
-
-PNG.prototype._metadata = function (metadata) {
- this.width = metadata.width;
- this.height = metadata.height;
-
- this.emit("metadata", metadata);
-};
-
-PNG.prototype._gamma = function (gamma) {
- this.gamma = gamma;
-};
-
-PNG.prototype._handleClose = function () {
- if (!this._parser.writable && !this._packer.readable) {
- this.emit("close");
- }
-};
-
-PNG.bitblt = function (src, dst, srcX, srcY, width, height, deltaX, deltaY) {
- // eslint-disable-line max-params
- // coerce pixel dimensions to integers (also coerces undefined -> 0):
- /* eslint-disable no-param-reassign */
- srcX |= 0;
- srcY |= 0;
- width |= 0;
- height |= 0;
- deltaX |= 0;
- deltaY |= 0;
- /* eslint-enable no-param-reassign */
-
- if (
- srcX > src.width ||
- srcY > src.height ||
- srcX + width > src.width ||
- srcY + height > src.height
- ) {
- throw new Error("bitblt reading outside image");
- }
-
- if (
- deltaX > dst.width ||
- deltaY > dst.height ||
- deltaX + width > dst.width ||
- deltaY + height > dst.height
- ) {
- throw new Error("bitblt writing outside image");
- }
-
- for (let y = 0; y < height; y++) {
- src.data.copy(
- dst.data,
- ((deltaY + y) * dst.width + deltaX) << 2,
- ((srcY + y) * src.width + srcX) << 2,
- ((srcY + y) * src.width + srcX + width) << 2
- );
- }
-};
-
-PNG.prototype.bitblt = function (
- dst,
- srcX,
- srcY,
- width,
- height,
- deltaX,
- deltaY
-) {
- // eslint-disable-line max-params
-
- PNG.bitblt(this, dst, srcX, srcY, width, height, deltaX, deltaY);
- return this;
-};
-
-PNG.adjustGamma = function (src) {
- if (src.gamma) {
- for (let y = 0; y < src.height; y++) {
- for (let x = 0; x < src.width; x++) {
- let idx = (src.width * y + x) << 2;
-
- for (let i = 0; i < 3; i++) {
- let sample = src.data[idx + i] / 255;
- sample = Math.pow(sample, 1 / 2.2 / src.gamma);
- src.data[idx + i] = Math.round(sample * 255);
- }
- }
- }
- src.gamma = 0;
- }
-};
-
-PNG.prototype.adjustGamma = function () {
- PNG.adjustGamma(this);
-};
-
-}).call(this,require('_process'),require("buffer").Buffer)
-},{"./packer-async":12,"./parser-async":16,"./png-sync":19,"_process":47,"buffer":28,"stream":63,"util":67}],21:[function(require,module,exports){
-(function (process,Buffer){
-"use strict";
-
-let assert = require("assert").ok;
-let zlib = require("zlib");
-let util = require("util");
-
-let kMaxLength = require("buffer").kMaxLength;
-
-function Inflate(opts) {
- if (!(this instanceof Inflate)) {
- return new Inflate(opts);
- }
-
- if (opts && opts.chunkSize < zlib.Z_MIN_CHUNK) {
- opts.chunkSize = zlib.Z_MIN_CHUNK;
- }
-
- zlib.Inflate.call(this, opts);
-
- // Node 8 --> 9 compatibility check
- this._offset = this._offset === undefined ? this._outOffset : this._offset;
- this._buffer = this._buffer || this._outBuffer;
-
- if (opts && opts.maxLength != null) {
- this._maxLength = opts.maxLength;
- }
-}
-
-function createInflate(opts) {
- return new Inflate(opts);
-}
-
-function _close(engine, callback) {
- if (callback) {
- process.nextTick(callback);
- }
-
- // Caller may invoke .close after a zlib error (which will null _handle).
- if (!engine._handle) {
- return;
- }
-
- engine._handle.close();
- engine._handle = null;
-}
-
-Inflate.prototype._processChunk = function (chunk, flushFlag, asyncCb) {
- if (typeof asyncCb === "function") {
- return zlib.Inflate._processChunk.call(this, chunk, flushFlag, asyncCb);
- }
-
- let self = this;
-
- let availInBefore = chunk && chunk.length;
- let availOutBefore = this._chunkSize - this._offset;
- let leftToInflate = this._maxLength;
- let inOff = 0;
-
- let buffers = [];
- let nread = 0;
-
- let error;
- this.on("error", function (err) {
- error = err;
- });
-
- function handleChunk(availInAfter, availOutAfter) {
- if (self._hadError) {
- return;
- }
-
- let have = availOutBefore - availOutAfter;
- assert(have >= 0, "have should not go down");
-
- if (have > 0) {
- let out = self._buffer.slice(self._offset, self._offset + have);
- self._offset += have;
-
- if (out.length > leftToInflate) {
- out = out.slice(0, leftToInflate);
- }
-
- buffers.push(out);
- nread += out.length;
- leftToInflate -= out.length;
-
- if (leftToInflate === 0) {
- return false;
- }
- }
-
- if (availOutAfter === 0 || self._offset >= self._chunkSize) {
- availOutBefore = self._chunkSize;
- self._offset = 0;
- self._buffer = Buffer.allocUnsafe(self._chunkSize);
- }
-
- if (availOutAfter === 0) {
- inOff += availInBefore - availInAfter;
- availInBefore = availInAfter;
-
- return true;
- }
-
- return false;
- }
-
- assert(this._handle, "zlib binding closed");
- let res;
- do {
- res = this._handle.writeSync(
- flushFlag,
- chunk, // in
- inOff, // in_off
- availInBefore, // in_len
- this._buffer, // out
- this._offset, //out_off
- availOutBefore
- ); // out_len
- // Node 8 --> 9 compatibility check
- res = res || this._writeState;
- } while (!this._hadError && handleChunk(res[0], res[1]));
-
- if (this._hadError) {
- throw error;
- }
-
- if (nread >= kMaxLength) {
- _close(this);
- throw new RangeError(
- "Cannot create final Buffer. It would be larger than 0x" +
- kMaxLength.toString(16) +
- " bytes"
- );
- }
-
- let buf = Buffer.concat(buffers, nread);
- _close(this);
-
- return buf;
-};
-
-util.inherits(Inflate, zlib.Inflate);
-
-function zlibBufferSync(engine, buffer) {
- if (typeof buffer === "string") {
- buffer = Buffer.from(buffer);
- }
- if (!(buffer instanceof Buffer)) {
- throw new TypeError("Not a string or buffer");
- }
-
- let flushFlag = engine._finishFlushFlag;
- if (flushFlag == null) {
- flushFlag = zlib.Z_FINISH;
- }
-
- return engine._processChunk(buffer, flushFlag);
-}
-
-function inflateSync(buffer, opts) {
- return zlibBufferSync(new Inflate(opts), buffer);
-}
-
-module.exports = exports = inflateSync;
-exports.Inflate = Inflate;
-exports.createInflate = createInflate;
-exports.inflateSync = inflateSync;
-
-}).call(this,require('_process'),require("buffer").Buffer)
-},{"_process":47,"assert":23,"buffer":28,"util":67,"zlib":27}],22:[function(require,module,exports){
-"use strict";
-
-let SyncReader = (module.exports = function (buffer) {
- this._buffer = buffer;
- this._reads = [];
-});
-
-SyncReader.prototype.read = function (length, callback) {
- this._reads.push({
- length: Math.abs(length), // if length < 0 then at most this length
- allowLess: length < 0,
- func: callback,
- });
-};
-
-SyncReader.prototype.process = function () {
- // as long as there is any data and read requests
- while (this._reads.length > 0 && this._buffer.length) {
- let read = this._reads[0];
-
- if (
- this._buffer.length &&
- (this._buffer.length >= read.length || read.allowLess)
- ) {
- // ok there is any data so that we can satisfy this request
- this._reads.shift(); // == read
-
- let buf = this._buffer;
-
- this._buffer = buf.slice(read.length);
-
- read.func.call(this, buf.slice(0, read.length));
- } else {
- break;
- }
- }
-
- if (this._reads.length > 0) {
- return new Error("There are some read requests waitng on finished stream");
- }
-
- if (this._buffer.length > 0) {
- return new Error("unrecognised content at end of stream");
- }
-};
-
-},{}],23:[function(require,module,exports){
-(function (global){
-'use strict';
-
-// 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:
-
-// 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 = require('util/');
-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; };
-
-var objectKeys = Object.keys || function (obj) {
- var keys = [];
- for (var key in obj) {
- if (hasOwn.call(obj, key)) keys.push(key);
- }
- return keys;
-};
-
-}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{"util/":67}],24:[function(require,module,exports){
-'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
-}
-
-revLookup['-'.charCodeAt(0)] = 62
-revLookup['_'.charCodeAt(0)] = 63
-
-function placeHoldersCount (b64) {
- var len = b64.length
- if (len % 4 > 0) {
- throw new Error('Invalid string. Length must be a multiple of 4')
- }
-
- // the number of equal signs (place holders)
- // if there are two placeholders, than the two characters before it
- // represent one byte
- // if there is only one, then the three characters before it represent 2 bytes
- // this is just a cheap hack to not do indexOf twice
- return b64[len - 2] === '=' ? 2 : b64[len - 1] === '=' ? 1 : 0
-}
-
-function byteLength (b64) {
- // base64 is 4/3 + up to two characters of the original data
- return (b64.length * 3 / 4) - placeHoldersCount(b64)
-}
-
-function toByteArray (b64) {
- var i, l, tmp, placeHolders, arr
- var len = b64.length
- placeHolders = placeHoldersCount(b64)
-
- arr = new Arr((len * 3 / 4) - placeHolders)
-
- // if there are placeholders, only get up to the last complete 4 chars
- l = placeHolders > 0 ? len - 4 : len
-
- var L = 0
-
- for (i = 0; i < l; 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[L++] = (tmp >> 16) & 0xFF
- arr[L++] = (tmp >> 8) & 0xFF
- arr[L++] = tmp & 0xFF
- }
-
- if (placeHolders === 2) {
- tmp = (revLookup[b64.charCodeAt(i)] << 2) | (revLookup[b64.charCodeAt(i + 1)] >> 4)
- arr[L++] = tmp & 0xFF
- } else if (placeHolders === 1) {
- tmp = (revLookup[b64.charCodeAt(i)] << 10) | (revLookup[b64.charCodeAt(i + 1)] << 4) | (revLookup[b64.charCodeAt(i + 2)] >> 2)
- arr[L++] = (tmp >> 8) & 0xFF
- arr[L++] = 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) + (uint8[i + 1] << 8) + (uint8[i + 2])
- 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 output = ''
- 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]
- output += lookup[tmp >> 2]
- output += lookup[(tmp << 4) & 0x3F]
- output += '=='
- } else if (extraBytes === 2) {
- tmp = (uint8[len - 2] << 8) + (uint8[len - 1])
- output += lookup[tmp >> 10]
- output += lookup[(tmp >> 4) & 0x3F]
- output += lookup[(tmp << 2) & 0x3F]
- output += '='
- }
-
- parts.push(output)
-
- return parts.join('')
-}
-
-},{}],25:[function(require,module,exports){
-
-},{}],26:[function(require,module,exports){
-(function (process,Buffer){
-'use strict';
-/* eslint camelcase: "off" */
-
-var assert = require('assert');
-
-var Zstream = require('pako/lib/zlib/zstream');
-var zlib_deflate = require('pako/lib/zlib/deflate.js');
-var zlib_inflate = require('pako/lib/zlib/inflate.js');
-var constants = require('pako/lib/zlib/constants');
-
-for (var key in constants) {
- exports[key] = constants[key];
-}
-
-// zlib modes
-exports.NONE = 0;
-exports.DEFLATE = 1;
-exports.INFLATE = 2;
-exports.GZIP = 3;
-exports.GUNZIP = 4;
-exports.DEFLATERAW = 5;
-exports.INFLATERAW = 6;
-exports.UNZIP = 7;
-
-var GZIP_HEADER_ID1 = 0x1f;
-var GZIP_HEADER_ID2 = 0x8b;
-
-/**
- * Emulate Node's zlib C++ layer for use by the JS layer in index.js
- */
-function Zlib(mode) {
- if (typeof mode !== 'number' || mode < exports.DEFLATE || mode > exports.UNZIP) {
- throw new TypeError('Bad argument');
- }
-
- this.dictionary = null;
- this.err = 0;
- this.flush = 0;
- this.init_done = false;
- this.level = 0;
- this.memLevel = 0;
- this.mode = mode;
- this.strategy = 0;
- this.windowBits = 0;
- this.write_in_progress = false;
- this.pending_close = false;
- this.gzip_id_bytes_read = 0;
-}
-
-Zlib.prototype.close = function () {
- if (this.write_in_progress) {
- this.pending_close = true;
- return;
- }
-
- this.pending_close = false;
-
- assert(this.init_done, 'close before init');
- assert(this.mode <= exports.UNZIP);
-
- if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) {
- zlib_deflate.deflateEnd(this.strm);
- } else if (this.mode === exports.INFLATE || this.mode === exports.GUNZIP || this.mode === exports.INFLATERAW || this.mode === exports.UNZIP) {
- zlib_inflate.inflateEnd(this.strm);
- }
-
- this.mode = exports.NONE;
-
- this.dictionary = null;
-};
-
-Zlib.prototype.write = function (flush, input, in_off, in_len, out, out_off, out_len) {
- return this._write(true, flush, input, in_off, in_len, out, out_off, out_len);
-};
-
-Zlib.prototype.writeSync = function (flush, input, in_off, in_len, out, out_off, out_len) {
- return this._write(false, flush, input, in_off, in_len, out, out_off, out_len);
-};
-
-Zlib.prototype._write = function (async, flush, input, in_off, in_len, out, out_off, out_len) {
- assert.equal(arguments.length, 8);
-
- assert(this.init_done, 'write before init');
- assert(this.mode !== exports.NONE, 'already finalized');
- assert.equal(false, this.write_in_progress, 'write already in progress');
- assert.equal(false, this.pending_close, 'close is pending');
-
- this.write_in_progress = true;
-
- assert.equal(false, flush === undefined, 'must provide flush value');
-
- this.write_in_progress = true;
-
- if (flush !== exports.Z_NO_FLUSH && flush !== exports.Z_PARTIAL_FLUSH && flush !== exports.Z_SYNC_FLUSH && flush !== exports.Z_FULL_FLUSH && flush !== exports.Z_FINISH && flush !== exports.Z_BLOCK) {
- throw new Error('Invalid flush value');
- }
-
- if (input == null) {
- input = Buffer.alloc(0);
- in_len = 0;
- in_off = 0;
- }
-
- this.strm.avail_in = in_len;
- this.strm.input = input;
- this.strm.next_in = in_off;
- this.strm.avail_out = out_len;
- this.strm.output = out;
- this.strm.next_out = out_off;
- this.flush = flush;
-
- if (!async) {
- // sync version
- this._process();
-
- if (this._checkError()) {
- return this._afterSync();
- }
- return;
- }
-
- // async version
- var self = this;
- process.nextTick(function () {
- self._process();
- self._after();
- });
-
- return this;
-};
-
-Zlib.prototype._afterSync = function () {
- var avail_out = this.strm.avail_out;
- var avail_in = this.strm.avail_in;
-
- this.write_in_progress = false;
-
- return [avail_in, avail_out];
-};
-
-Zlib.prototype._process = function () {
- var next_expected_header_byte = null;
-
- // If the avail_out is left at 0, then it means that it ran out
- // of room. If there was avail_out left over, then it means
- // that all of the input was consumed.
- switch (this.mode) {
- case exports.DEFLATE:
- case exports.GZIP:
- case exports.DEFLATERAW:
- this.err = zlib_deflate.deflate(this.strm, this.flush);
- break;
- case exports.UNZIP:
- if (this.strm.avail_in > 0) {
- next_expected_header_byte = this.strm.next_in;
- }
-
- switch (this.gzip_id_bytes_read) {
- case 0:
- if (next_expected_header_byte === null) {
- break;
- }
-
- if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID1) {
- this.gzip_id_bytes_read = 1;
- next_expected_header_byte++;
-
- if (this.strm.avail_in === 1) {
- // The only available byte was already read.
- break;
- }
- } else {
- this.mode = exports.INFLATE;
- break;
- }
-
- // fallthrough
- case 1:
- if (next_expected_header_byte === null) {
- break;
- }
-
- if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID2) {
- this.gzip_id_bytes_read = 2;
- this.mode = exports.GUNZIP;
- } else {
- // There is no actual difference between INFLATE and INFLATERAW
- // (after initialization).
- this.mode = exports.INFLATE;
- }
-
- break;
- default:
- throw new Error('invalid number of gzip magic number bytes read');
- }
-
- // fallthrough
- case exports.INFLATE:
- case exports.GUNZIP:
- case exports.INFLATERAW:
- this.err = zlib_inflate.inflate(this.strm, this.flush
-
- // If data was encoded with dictionary
- );if (this.err === exports.Z_NEED_DICT && this.dictionary) {
- // Load it
- this.err = zlib_inflate.inflateSetDictionary(this.strm, this.dictionary);
- if (this.err === exports.Z_OK) {
- // And try to decode again
- this.err = zlib_inflate.inflate(this.strm, this.flush);
- } else if (this.err === exports.Z_DATA_ERROR) {
- // Both inflateSetDictionary() and inflate() return Z_DATA_ERROR.
- // Make it possible for After() to tell a bad dictionary from bad
- // input.
- this.err = exports.Z_NEED_DICT;
- }
- }
- while (this.strm.avail_in > 0 && this.mode === exports.GUNZIP && this.err === exports.Z_STREAM_END && this.strm.next_in[0] !== 0x00) {
- // Bytes remain in input buffer. Perhaps this is another compressed
- // member in the same archive, or just trailing garbage.
- // Trailing zero bytes are okay, though, since they are frequently
- // used for padding.
-
- this.reset();
- this.err = zlib_inflate.inflate(this.strm, this.flush);
- }
- break;
- default:
- throw new Error('Unknown mode ' + this.mode);
- }
-};
-
-Zlib.prototype._checkError = function () {
- // Acceptable error states depend on the type of zlib stream.
- switch (this.err) {
- case exports.Z_OK:
- case exports.Z_BUF_ERROR:
- if (this.strm.avail_out !== 0 && this.flush === exports.Z_FINISH) {
- this._error('unexpected end of file');
- return false;
- }
- break;
- case exports.Z_STREAM_END:
- // normal statuses, not fatal
- break;
- case exports.Z_NEED_DICT:
- if (this.dictionary == null) {
- this._error('Missing dictionary');
- } else {
- this._error('Bad dictionary');
- }
- return false;
- default:
- // something else.
- this._error('Zlib error');
- return false;
- }
-
- return true;
-};
-
-Zlib.prototype._after = function () {
- if (!this._checkError()) {
- return;
- }
-
- var avail_out = this.strm.avail_out;
- var avail_in = this.strm.avail_in;
-
- this.write_in_progress = false;
-
- // call the write() cb
- this.callback(avail_in, avail_out);
-
- if (this.pending_close) {
- this.close();
- }
-};
-
-Zlib.prototype._error = function (message) {
- if (this.strm.msg) {
- message = this.strm.msg;
- }
- this.onerror(message, this.err
-
- // no hope of rescue.
- );this.write_in_progress = false;
- if (this.pending_close) {
- this.close();
- }
-};
-
-Zlib.prototype.init = function (windowBits, level, memLevel, strategy, dictionary) {
- assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strategy, [dictionary])');
-
- assert(windowBits >= 8 && windowBits <= 15, 'invalid windowBits');
- assert(level >= -1 && level <= 9, 'invalid compression level');
-
- assert(memLevel >= 1 && memLevel <= 9, 'invalid memlevel');
-
- assert(strategy === exports.Z_FILTERED || strategy === exports.Z_HUFFMAN_ONLY || strategy === exports.Z_RLE || strategy === exports.Z_FIXED || strategy === exports.Z_DEFAULT_STRATEGY, 'invalid strategy');
-
- this._init(level, windowBits, memLevel, strategy, dictionary);
- this._setDictionary();
-};
-
-Zlib.prototype.params = function () {
- throw new Error('deflateParams Not supported');
-};
-
-Zlib.prototype.reset = function () {
- this._reset();
- this._setDictionary();
-};
-
-Zlib.prototype._init = function (level, windowBits, memLevel, strategy, dictionary) {
- this.level = level;
- this.windowBits = windowBits;
- this.memLevel = memLevel;
- this.strategy = strategy;
-
- this.flush = exports.Z_NO_FLUSH;
-
- this.err = exports.Z_OK;
-
- if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) {
- this.windowBits += 16;
- }
-
- if (this.mode === exports.UNZIP) {
- this.windowBits += 32;
- }
-
- if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) {
- this.windowBits = -1 * this.windowBits;
- }
-
- this.strm = new Zstream();
-
- switch (this.mode) {
- case exports.DEFLATE:
- case exports.GZIP:
- case exports.DEFLATERAW:
- this.err = zlib_deflate.deflateInit2(this.strm, this.level, exports.Z_DEFLATED, this.windowBits, this.memLevel, this.strategy);
- break;
- case exports.INFLATE:
- case exports.GUNZIP:
- case exports.INFLATERAW:
- case exports.UNZIP:
- this.err = zlib_inflate.inflateInit2(this.strm, this.windowBits);
- break;
- default:
- throw new Error('Unknown mode ' + this.mode);
- }
-
- if (this.err !== exports.Z_OK) {
- this._error('Init error');
- }
-
- this.dictionary = dictionary;
-
- this.write_in_progress = false;
- this.init_done = true;
-};
-
-Zlib.prototype._setDictionary = function () {
- if (this.dictionary == null) {
- return;
- }
-
- this.err = exports.Z_OK;
-
- switch (this.mode) {
- case exports.DEFLATE:
- case exports.DEFLATERAW:
- this.err = zlib_deflate.deflateSetDictionary(this.strm, this.dictionary);
- break;
- default:
- break;
- }
-
- if (this.err !== exports.Z_OK) {
- this._error('Failed to set dictionary');
- }
-};
-
-Zlib.prototype._reset = function () {
- this.err = exports.Z_OK;
-
- switch (this.mode) {
- case exports.DEFLATE:
- case exports.DEFLATERAW:
- case exports.GZIP:
- this.err = zlib_deflate.deflateReset(this.strm);
- break;
- case exports.INFLATE:
- case exports.INFLATERAW:
- case exports.GUNZIP:
- this.err = zlib_inflate.inflateReset(this.strm);
- break;
- default:
- break;
- }
-
- if (this.err !== exports.Z_OK) {
- this._error('Failed to reset stream');
- }
-};
-
-exports.Zlib = Zlib;
-}).call(this,require('_process'),require("buffer").Buffer)
-},{"_process":47,"assert":23,"buffer":28,"pako/lib/zlib/constants":37,"pako/lib/zlib/deflate.js":39,"pako/lib/zlib/inflate.js":41,"pako/lib/zlib/zstream":45}],27:[function(require,module,exports){
-(function (process){
-'use strict';
-
-var Buffer = require('buffer').Buffer;
-var Transform = require('stream').Transform;
-var binding = require('./binding');
-var util = require('util');
-var assert = require('assert').ok;
-var kMaxLength = require('buffer').kMaxLength;
-var kRangeErrorMessage = 'Cannot create final Buffer. It would be larger ' + 'than 0x' + kMaxLength.toString(16) + ' bytes';
-
-// zlib doesn't provide these, so kludge them in following the same
-// const naming scheme zlib uses.
-binding.Z_MIN_WINDOWBITS = 8;
-binding.Z_MAX_WINDOWBITS = 15;
-binding.Z_DEFAULT_WINDOWBITS = 15;
-
-// fewer than 64 bytes per chunk is stupid.
-// technically it could work with as few as 8, but even 64 bytes
-// is absurdly low. Usually a MB or more is best.
-binding.Z_MIN_CHUNK = 64;
-binding.Z_MAX_CHUNK = Infinity;
-binding.Z_DEFAULT_CHUNK = 16 * 1024;
-
-binding.Z_MIN_MEMLEVEL = 1;
-binding.Z_MAX_MEMLEVEL = 9;
-binding.Z_DEFAULT_MEMLEVEL = 8;
-
-binding.Z_MIN_LEVEL = -1;
-binding.Z_MAX_LEVEL = 9;
-binding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION;
-
-// expose all the zlib constants
-var bkeys = Object.keys(binding);
-for (var bk = 0; bk < bkeys.length; bk++) {
- var bkey = bkeys[bk];
- if (bkey.match(/^Z/)) {
- Object.defineProperty(exports, bkey, {
- enumerable: true, value: binding[bkey], writable: false
- });
- }
-}
-
-// translation table for return codes.
-var codes = {
- Z_OK: binding.Z_OK,
- Z_STREAM_END: binding.Z_STREAM_END,
- Z_NEED_DICT: binding.Z_NEED_DICT,
- Z_ERRNO: binding.Z_ERRNO,
- Z_STREAM_ERROR: binding.Z_STREAM_ERROR,
- Z_DATA_ERROR: binding.Z_DATA_ERROR,
- Z_MEM_ERROR: binding.Z_MEM_ERROR,
- Z_BUF_ERROR: binding.Z_BUF_ERROR,
- Z_VERSION_ERROR: binding.Z_VERSION_ERROR
-};
-
-var ckeys = Object.keys(codes);
-for (var ck = 0; ck < ckeys.length; ck++) {
- var ckey = ckeys[ck];
- codes[codes[ckey]] = ckey;
-}
-
-Object.defineProperty(exports, 'codes', {
- enumerable: true, value: Object.freeze(codes), writable: false
-});
-
-exports.Deflate = Deflate;
-exports.Inflate = Inflate;
-exports.Gzip = Gzip;
-exports.Gunzip = Gunzip;
-exports.DeflateRaw = DeflateRaw;
-exports.InflateRaw = InflateRaw;
-exports.Unzip = Unzip;
-
-exports.createDeflate = function (o) {
- return new Deflate(o);
-};
-
-exports.createInflate = function (o) {
- return new Inflate(o);
-};
-
-exports.createDeflateRaw = function (o) {
- return new DeflateRaw(o);
-};
-
-exports.createInflateRaw = function (o) {
- return new InflateRaw(o);
-};
-
-exports.createGzip = function (o) {
- return new Gzip(o);
-};
-
-exports.createGunzip = function (o) {
- return new Gunzip(o);
-};
-
-exports.createUnzip = function (o) {
- return new Unzip(o);
-};
-
-// Convenience methods.
-// compress/decompress a string or buffer in one step.
-exports.deflate = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new Deflate(opts), buffer, callback);
-};
-
-exports.deflateSync = function (buffer, opts) {
- return zlibBufferSync(new Deflate(opts), buffer);
-};
-
-exports.gzip = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new Gzip(opts), buffer, callback);
-};
-
-exports.gzipSync = function (buffer, opts) {
- return zlibBufferSync(new Gzip(opts), buffer);
-};
-
-exports.deflateRaw = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new DeflateRaw(opts), buffer, callback);
-};
-
-exports.deflateRawSync = function (buffer, opts) {
- return zlibBufferSync(new DeflateRaw(opts), buffer);
-};
-
-exports.unzip = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new Unzip(opts), buffer, callback);
-};
-
-exports.unzipSync = function (buffer, opts) {
- return zlibBufferSync(new Unzip(opts), buffer);
-};
-
-exports.inflate = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new Inflate(opts), buffer, callback);
-};
-
-exports.inflateSync = function (buffer, opts) {
- return zlibBufferSync(new Inflate(opts), buffer);
-};
-
-exports.gunzip = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new Gunzip(opts), buffer, callback);
-};
-
-exports.gunzipSync = function (buffer, opts) {
- return zlibBufferSync(new Gunzip(opts), buffer);
-};
-
-exports.inflateRaw = function (buffer, opts, callback) {
- if (typeof opts === 'function') {
- callback = opts;
- opts = {};
- }
- return zlibBuffer(new InflateRaw(opts), buffer, callback);
-};
-
-exports.inflateRawSync = function (buffer, opts) {
- return zlibBufferSync(new InflateRaw(opts), buffer);
-};
-
-function zlibBuffer(engine, buffer, callback) {
- var buffers = [];
- var nread = 0;
-
- engine.on('error', onError);
- engine.on('end', onEnd);
-
- engine.end(buffer);
- flow();
-
- function flow() {
- var chunk;
- while (null !== (chunk = engine.read())) {
- buffers.push(chunk);
- nread += chunk.length;
- }
- engine.once('readable', flow);
- }
-
- function onError(err) {
- engine.removeListener('end', onEnd);
- engine.removeListener('readable', flow);
- callback(err);
- }
-
- function onEnd() {
- var buf;
- var err = null;
-
- if (nread >= kMaxLength) {
- err = new RangeError(kRangeErrorMessage);
- } else {
- buf = Buffer.concat(buffers, nread);
- }
-
- buffers = [];
- engine.close();
- callback(err, buf);
- }
-}
-
-function zlibBufferSync(engine, buffer) {
- if (typeof buffer === 'string') buffer = Buffer.from(buffer);
-
- if (!Buffer.isBuffer(buffer)) throw new TypeError('Not a string or buffer');
-
- var flushFlag = engine._finishFlushFlag;
-
- return engine._processChunk(buffer, flushFlag);
-}
-
-// generic zlib
-// minimal 2-byte header
-function Deflate(opts) {
- if (!(this instanceof Deflate)) return new Deflate(opts);
- Zlib.call(this, opts, binding.DEFLATE);
-}
-
-function Inflate(opts) {
- if (!(this instanceof Inflate)) return new Inflate(opts);
- Zlib.call(this, opts, binding.INFLATE);
-}
-
-// gzip - bigger header, same deflate compression
-function Gzip(opts) {
- if (!(this instanceof Gzip)) return new Gzip(opts);
- Zlib.call(this, opts, binding.GZIP);
-}
-
-function Gunzip(opts) {
- if (!(this instanceof Gunzip)) return new Gunzip(opts);
- Zlib.call(this, opts, binding.GUNZIP);
-}
-
-// raw - no header
-function DeflateRaw(opts) {
- if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts);
- Zlib.call(this, opts, binding.DEFLATERAW);
-}
-
-function InflateRaw(opts) {
- if (!(this instanceof InflateRaw)) return new InflateRaw(opts);
- Zlib.call(this, opts, binding.INFLATERAW);
-}
-
-// auto-detect header.
-function Unzip(opts) {
- if (!(this instanceof Unzip)) return new Unzip(opts);
- Zlib.call(this, opts, binding.UNZIP);
-}
-
-function isValidFlushFlag(flag) {
- return flag === binding.Z_NO_FLUSH || flag === binding.Z_PARTIAL_FLUSH || flag === binding.Z_SYNC_FLUSH || flag === binding.Z_FULL_FLUSH || flag === binding.Z_FINISH || flag === binding.Z_BLOCK;
-}
-
-// the Zlib class they all inherit from
-// This thing manages the queue of requests, and returns
-// true or false if there is anything in the queue when
-// you call the .write() method.
-
-function Zlib(opts, mode) {
- var _this = this;
-
- this._opts = opts = opts || {};
- this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK;
-
- Transform.call(this, opts);
-
- if (opts.flush && !isValidFlushFlag(opts.flush)) {
- throw new Error('Invalid flush flag: ' + opts.flush);
- }
- if (opts.finishFlush && !isValidFlushFlag(opts.finishFlush)) {
- throw new Error('Invalid flush flag: ' + opts.finishFlush);
- }
-
- this._flushFlag = opts.flush || binding.Z_NO_FLUSH;
- this._finishFlushFlag = typeof opts.finishFlush !== 'undefined' ? opts.finishFlush : binding.Z_FINISH;
-
- if (opts.chunkSize) {
- if (opts.chunkSize < exports.Z_MIN_CHUNK || opts.chunkSize > exports.Z_MAX_CHUNK) {
- throw new Error('Invalid chunk size: ' + opts.chunkSize);
- }
- }
-
- if (opts.windowBits) {
- if (opts.windowBits < exports.Z_MIN_WINDOWBITS || opts.windowBits > exports.Z_MAX_WINDOWBITS) {
- throw new Error('Invalid windowBits: ' + opts.windowBits);
- }
- }
-
- if (opts.level) {
- if (opts.level < exports.Z_MIN_LEVEL || opts.level > exports.Z_MAX_LEVEL) {
- throw new Error('Invalid compression level: ' + opts.level);
- }
- }
-
- if (opts.memLevel) {
- if (opts.memLevel < exports.Z_MIN_MEMLEVEL || opts.memLevel > exports.Z_MAX_MEMLEVEL) {
- throw new Error('Invalid memLevel: ' + opts.memLevel);
- }
- }
-
- if (opts.strategy) {
- if (opts.strategy != exports.Z_FILTERED && opts.strategy != exports.Z_HUFFMAN_ONLY && opts.strategy != exports.Z_RLE && opts.strategy != exports.Z_FIXED && opts.strategy != exports.Z_DEFAULT_STRATEGY) {
- throw new Error('Invalid strategy: ' + opts.strategy);
- }
- }
-
- if (opts.dictionary) {
- if (!Buffer.isBuffer(opts.dictionary)) {
- throw new Error('Invalid dictionary: it should be a Buffer instance');
- }
- }
-
- this._handle = new binding.Zlib(mode);
-
- var self = this;
- this._hadError = false;
- this._handle.onerror = function (message, errno) {
- // there is no way to cleanly recover.
- // continuing only obscures problems.
- _close(self);
- self._hadError = true;
-
- var error = new Error(message);
- error.errno = errno;
- error.code = exports.codes[errno];
- self.emit('error', error);
- };
-
- var level = exports.Z_DEFAULT_COMPRESSION;
- if (typeof opts.level === 'number') level = opts.level;
-
- var strategy = exports.Z_DEFAULT_STRATEGY;
- if (typeof opts.strategy === 'number') strategy = opts.strategy;
-
- this._handle.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, level, opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, strategy, opts.dictionary);
-
- this._buffer = Buffer.allocUnsafe(this._chunkSize);
- this._offset = 0;
- this._level = level;
- this._strategy = strategy;
-
- this.once('end', this.close);
-
- Object.defineProperty(this, '_closed', {
- get: function () {
- return !_this._handle;
- },
- configurable: true,
- enumerable: true
- });
-}
-
-util.inherits(Zlib, Transform);
-
-Zlib.prototype.params = function (level, strategy, callback) {
- if (level < exports.Z_MIN_LEVEL || level > exports.Z_MAX_LEVEL) {
- throw new RangeError('Invalid compression level: ' + level);
- }
- if (strategy != exports.Z_FILTERED && strategy != exports.Z_HUFFMAN_ONLY && strategy != exports.Z_RLE && strategy != exports.Z_FIXED && strategy != exports.Z_DEFAULT_STRATEGY) {
- throw new TypeError('Invalid strategy: ' + strategy);
- }
-
- if (this._level !== level || this._strategy !== strategy) {
- var self = this;
- this.flush(binding.Z_SYNC_FLUSH, function () {
- assert(self._handle, 'zlib binding closed');
- self._handle.params(level, strategy);
- if (!self._hadError) {
- self._level = level;
- self._strategy = strategy;
- if (callback) callback();
- }
- });
- } else {
- process.nextTick(callback);
- }
-};
-
-Zlib.prototype.reset = function () {
- assert(this._handle, 'zlib binding closed');
- return this._handle.reset();
-};
-
-// This is the _flush function called by the transform class,
-// internally, when the last chunk has been written.
-Zlib.prototype._flush = function (callback) {
- this._transform(Buffer.alloc(0), '', callback);
-};
-
-Zlib.prototype.flush = function (kind, callback) {
- var _this2 = this;
-
- var ws = this._writableState;
-
- if (typeof kind === 'function' || kind === undefined && !callback) {
- callback = kind;
- kind = binding.Z_FULL_FLUSH;
- }
-
- if (ws.ended) {
- if (callback) process.nextTick(callback);
- } else if (ws.ending) {
- if (callback) this.once('end', callback);
- } else if (ws.needDrain) {
- if (callback) {
- this.once('drain', function () {
- return _this2.flush(kind, callback);
- });
- }
- } else {
- this._flushFlag = kind;
- this.write(Buffer.alloc(0), '', callback);
- }
-};
-
-Zlib.prototype.close = function (callback) {
- _close(this, callback);
- process.nextTick(emitCloseNT, this);
-};
-
-function _close(engine, callback) {
- if (callback) process.nextTick(callback);
-
- // Caller may invoke .close after a zlib error (which will null _handle).
- if (!engine._handle) return;
-
- engine._handle.close();
- engine._handle = null;
-}
-
-function emitCloseNT(self) {
- self.emit('close');
-}
-
-Zlib.prototype._transform = function (chunk, encoding, cb) {
- var flushFlag;
- var ws = this._writableState;
- var ending = ws.ending || ws.ended;
- var last = ending && (!chunk || ws.length === chunk.length);
-
- if (chunk !== null && !Buffer.isBuffer(chunk)) return cb(new Error('invalid input'));
-
- if (!this._handle) return cb(new Error('zlib binding closed'));
-
- // If it's the last chunk, or a final flush, we use the Z_FINISH flush flag
- // (or whatever flag was provided using opts.finishFlush).
- // If it's explicitly flushing at some other time, then we use
- // Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression
- // goodness.
- if (last) flushFlag = this._finishFlushFlag;else {
- flushFlag = this._flushFlag;
- // once we've flushed the last of the queue, stop flushing and
- // go back to the normal behavior.
- if (chunk.length >= ws.length) {
- this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH;
- }
- }
-
- this._processChunk(chunk, flushFlag, cb);
-};
-
-Zlib.prototype._processChunk = function (chunk, flushFlag, cb) {
- var availInBefore = chunk && chunk.length;
- var availOutBefore = this._chunkSize - this._offset;
- var inOff = 0;
-
- var self = this;
-
- var async = typeof cb === 'function';
-
- if (!async) {
- var buffers = [];
- var nread = 0;
-
- var error;
- this.on('error', function (er) {
- error = er;
- });
-
- assert(this._handle, 'zlib binding closed');
- do {
- var res = this._handle.writeSync(flushFlag, chunk, // in
- inOff, // in_off
- availInBefore, // in_len
- this._buffer, // out
- this._offset, //out_off
- availOutBefore); // out_len
- } while (!this._hadError && callback(res[0], res[1]));
-
- if (this._hadError) {
- throw error;
- }
-
- if (nread >= kMaxLength) {
- _close(this);
- throw new RangeError(kRangeErrorMessage);
- }
-
- var buf = Buffer.concat(buffers, nread);
- _close(this);
-
- return buf;
- }
-
- assert(this._handle, 'zlib binding closed');
- var req = this._handle.write(flushFlag, chunk, // in
- inOff, // in_off
- availInBefore, // in_len
- this._buffer, // out
- this._offset, //out_off
- availOutBefore); // out_len
-
- req.buffer = chunk;
- req.callback = callback;
-
- function callback(availInAfter, availOutAfter) {
- // When the callback is used in an async write, the callback's
- // context is the `req` object that was created. The req object
- // is === this._handle, and that's why it's important to null
- // out the values after they are done being used. `this._handle`
- // can stay in memory longer than the callback and buffer are needed.
- if (this) {
- this.buffer = null;
- this.callback = null;
- }
-
- if (self._hadError) return;
-
- var have = availOutBefore - availOutAfter;
- assert(have >= 0, 'have should not go down');
-
- if (have > 0) {
- var out = self._buffer.slice(self._offset, self._offset + have);
- self._offset += have;
- // serve some output to the consumer.
- if (async) {
- self.push(out);
- } else {
- buffers.push(out);
- nread += out.length;
- }
- }
-
- // exhausted the output buffer, or used all the input create a new one.
- if (availOutAfter === 0 || self._offset >= self._chunkSize) {
- availOutBefore = self._chunkSize;
- self._offset = 0;
- self._buffer = Buffer.allocUnsafe(self._chunkSize);
- }
-
- if (availOutAfter === 0) {
- // Not actually done. Need to reprocess.
- // Also, update the availInBefore to the availInAfter value,
- // so that if we have to hit it a third (fourth, etc.) time,
- // it'll have the correct byte counts.
- inOff += availInBefore - availInAfter;
- availInBefore = availInAfter;
-
- if (!async) return true;
-
- var newReq = self._handle.write(flushFlag, chunk, inOff, availInBefore, self._buffer, self._offset, self._chunkSize);
- newReq.callback = callback; // this same function
- newReq.buffer = chunk;
- return;
- }
-
- if (!async) return false;
-
- // finished with the chunk.
- cb();
- }
-};
-
-util.inherits(Deflate, Zlib);
-util.inherits(Inflate, Zlib);
-util.inherits(Gzip, Zlib);
-util.inherits(Gunzip, Zlib);
-util.inherits(DeflateRaw, Zlib);
-util.inherits(InflateRaw, Zlib);
-util.inherits(Unzip, Zlib);
-}).call(this,require('_process'))
-},{"./binding":26,"_process":47,"assert":23,"buffer":28,"stream":63,"util":67}],28:[function(require,module,exports){
-/*!
- * The buffer module from node.js, for the browser.
- *
- * @author Feross Aboukhadijeh
- * @license MIT
- */
-/* eslint-disable no-proto */
-
-'use strict'
-
-var base64 = require('base64-js')
-var ieee754 = require('ieee754')
-
-exports.Buffer = Buffer
-exports.SlowBuffer = SlowBuffer
-exports.INSPECT_MAX_BYTES = 50
-
-var K_MAX_LENGTH = 0x7fffffff
-exports.kMaxLength = K_MAX_LENGTH
-
-/**
- * If `Buffer.TYPED_ARRAY_SUPPORT`:
- * === true Use Uint8Array implementation (fastest)
- * === false Print warning and recommend using `buffer` v4.x which has an 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+.
- *
- * We report that the browser does not support typed arrays if the are not subclassable
- * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`
- * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support
- * for __proto__ and has a buggy typed array implementation.
- */
-Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport()
-
-if (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&
- typeof console.error === 'function') {
- console.error(
- 'This browser lacks typed array (Uint8Array) support which is required by ' +
- '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'
- )
-}
-
-function typedArraySupport () {
- // Can typed array instances can be augmented?
- try {
- var arr = new Uint8Array(1)
- arr.__proto__ = { __proto__: Uint8Array.prototype, foo: function () { return 42 } }
- return arr.foo() === 42
- } catch (e) {
- return false
- }
-}
-
-Object.defineProperty(Buffer.prototype, 'parent', {
- enumerable: true,
- get: function () {
- if (!Buffer.isBuffer(this)) return undefined
- return this.buffer
- }
-})
-
-Object.defineProperty(Buffer.prototype, 'offset', {
- enumerable: true,
- get: function () {
- if (!Buffer.isBuffer(this)) return undefined
- return this.byteOffset
- }
-})
-
-function createBuffer (length) {
- if (length > K_MAX_LENGTH) {
- throw new RangeError('The value "' + length + '" is invalid for option "size"')
- }
- // Return an augmented `Uint8Array` instance
- var buf = new Uint8Array(length)
- buf.__proto__ = Buffer.prototype
- return buf
-}
-
-/**
- * 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) {
- // Common case.
- if (typeof arg === 'number') {
- if (typeof encodingOrOffset === 'string') {
- throw new TypeError(
- 'The "string" argument must be of type string. Received type number'
- )
- }
- return allocUnsafe(arg)
- }
- return from(arg, encodingOrOffset, length)
-}
-
-// Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97
-if (typeof Symbol !== 'undefined' && Symbol.species != null &&
- Buffer[Symbol.species] === Buffer) {
- Object.defineProperty(Buffer, Symbol.species, {
- value: null,
- configurable: true,
- enumerable: false,
- writable: false
- })
-}
-
-Buffer.poolSize = 8192 // not used by this implementation
-
-function from (value, encodingOrOffset, length) {
- if (typeof value === 'string') {
- return fromString(value, encodingOrOffset)
- }
-
- if (ArrayBuffer.isView(value)) {
- return fromArrayLike(value)
- }
-
- if (value == null) {
- throw TypeError(
- 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +
- 'or Array-like Object. Received type ' + (typeof value)
- )
- }
-
- if (isInstance(value, ArrayBuffer) ||
- (value && isInstance(value.buffer, ArrayBuffer))) {
- return fromArrayBuffer(value, encodingOrOffset, length)
- }
-
- if (typeof value === 'number') {
- throw new TypeError(
- 'The "value" argument must not be of type number. Received type number'
- )
- }
-
- var valueOf = value.valueOf && value.valueOf()
- if (valueOf != null && valueOf !== value) {
- return Buffer.from(valueOf, encodingOrOffset, length)
- }
-
- var b = fromObject(value)
- if (b) return b
-
- if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&
- typeof value[Symbol.toPrimitive] === 'function') {
- return Buffer.from(
- value[Symbol.toPrimitive]('string'), encodingOrOffset, length
- )
- }
-
- throw new TypeError(
- 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +
- 'or Array-like Object. Received type ' + (typeof 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(value, encodingOrOffset, length)
-}
-
-// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:
-// https://github.com/feross/buffer/pull/148
-Buffer.prototype.__proto__ = Uint8Array.prototype
-Buffer.__proto__ = Uint8Array
-
-function assertSize (size) {
- if (typeof size !== 'number') {
- throw new TypeError('"size" argument must be of type number')
- } else if (size < 0) {
- throw new RangeError('The value "' + size + '" is invalid for option "size"')
- }
-}
-
-function alloc (size, fill, encoding) {
- assertSize(size)
- if (size <= 0) {
- return createBuffer(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(size).fill(fill, encoding)
- : createBuffer(size).fill(fill)
- }
- return createBuffer(size)
-}
-
-/**
- * Creates a new filled Buffer instance.
- * alloc(size[, fill[, encoding]])
- **/
-Buffer.alloc = function (size, fill, encoding) {
- return alloc(size, fill, encoding)
-}
-
-function allocUnsafe (size) {
- assertSize(size)
- return createBuffer(size < 0 ? 0 : checked(size) | 0)
-}
-
-/**
- * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.
- * */
-Buffer.allocUnsafe = function (size) {
- return allocUnsafe(size)
-}
-/**
- * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.
- */
-Buffer.allocUnsafeSlow = function (size) {
- return allocUnsafe(size)
-}
-
-function fromString (string, encoding) {
- if (typeof encoding !== 'string' || encoding === '') {
- encoding = 'utf8'
- }
-
- if (!Buffer.isEncoding(encoding)) {
- throw new TypeError('Unknown encoding: ' + encoding)
- }
-
- var length = byteLength(string, encoding) | 0
- var buf = createBuffer(length)
-
- var actual = buf.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')
- buf = buf.slice(0, actual)
- }
-
- return buf
-}
-
-function fromArrayLike (array) {
- var length = array.length < 0 ? 0 : checked(array.length) | 0
- var buf = createBuffer(length)
- for (var i = 0; i < length; i += 1) {
- buf[i] = array[i] & 255
- }
- return buf
-}
-
-function fromArrayBuffer (array, byteOffset, length) {
- if (byteOffset < 0 || array.byteLength < byteOffset) {
- throw new RangeError('"offset" is outside of buffer bounds')
- }
-
- if (array.byteLength < byteOffset + (length || 0)) {
- throw new RangeError('"length" is outside of buffer bounds')
- }
-
- var buf
- if (byteOffset === undefined && length === undefined) {
- buf = new Uint8Array(array)
- } else if (length === undefined) {
- buf = new Uint8Array(array, byteOffset)
- } else {
- buf = new Uint8Array(array, byteOffset, length)
- }
-
- // Return an augmented `Uint8Array` instance
- buf.__proto__ = Buffer.prototype
- return buf
-}
-
-function fromObject (obj) {
- if (Buffer.isBuffer(obj)) {
- var len = checked(obj.length) | 0
- var buf = createBuffer(len)
-
- if (buf.length === 0) {
- return buf
- }
-
- obj.copy(buf, 0, 0, len)
- return buf
- }
-
- if (obj.length !== undefined) {
- if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {
- return createBuffer(0)
- }
- return fromArrayLike(obj)
- }
-
- if (obj.type === 'Buffer' && Array.isArray(obj.data)) {
- return fromArrayLike(obj.data)
- }
-}
-
-function checked (length) {
- // Note: cannot use `length < K_MAX_LENGTH` here because that fails when
- // length is NaN (which is otherwise coerced to zero.)
- if (length >= K_MAX_LENGTH) {
- throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
- 'size: 0x' + K_MAX_LENGTH.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 === true &&
- b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false
-}
-
-Buffer.compare = function compare (a, b) {
- if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)
- if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)
- if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {
- throw new TypeError(
- 'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'
- )
- }
-
- 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 (!Array.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 (isInstance(buf, Uint8Array)) {
- buf = Buffer.from(buf)
- }
- 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 (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {
- return string.byteLength
- }
- if (typeof string !== 'string') {
- throw new TypeError(
- 'The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' +
- 'Received type ' + typeof string
- )
- }
-
- var len = string.length
- var mustMatch = (arguments.length > 2 && arguments[2] === true)
- if (!mustMatch && 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':
- 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 mustMatch ? -1 : 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
- }
- }
-}
-
-// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)
-// to detect a Buffer instance. It's not possible to use `instanceof Buffer`
-// reliably in a browserify context because there could be multiple different
-// copies of the 'buffer' package in use. This method works even for Buffer
-// instances that were created from another copy of the `buffer` package.
-// See: https://github.com/feross/buffer/issues/154
-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
- if (length === 0) return ''
- if (arguments.length === 0) return utf8Slice(this, 0, length)
- return slowToString.apply(this, arguments)
-}
-
-Buffer.prototype.toLocaleString = Buffer.prototype.toString
-
-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
- str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()
- if (this.length > max) str += ' ... '
- return ''
-}
-
-Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {
- if (isInstance(target, Uint8Array)) {
- target = Buffer.from(target, target.offset, target.byteLength)
- }
- if (!Buffer.isBuffer(target)) {
- throw new TypeError(
- 'The "target" argument must be one of type Buffer or Uint8Array. ' +
- 'Received type ' + (typeof target)
- )
- }
-
- 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 (numberIsNaN(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 (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
- }
- }
-
- var strLen = string.length
-
- if (length > strLen / 2) {
- length = strLen / 2
- }
- for (var i = 0; i < length; ++i) {
- var parsed = parseInt(string.substr(i * 2, 2), 16)
- if (numberIsNaN(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
- }
- } 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 = this.subarray(start, end)
- // Return an augmented `Uint8Array` instance
- newBuf.__proto__ = Buffer.prototype
- 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) {
- offset = offset >>> 0
- if (!noAssert) checkOffset(offset, 1, this.length)
- return this[offset]
-}
-
-Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
- offset = offset >>> 0
- if (!noAssert) checkOffset(offset, 2, this.length)
- return this[offset] | (this[offset + 1] << 8)
-}
-
-Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
- offset = offset >>> 0
- if (!noAssert) checkOffset(offset, 2, this.length)
- return (this[offset] << 8) | this[offset + 1]
-}
-
-Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- 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) {
- offset = offset >>> 0
- if (!noAssert) checkOffset(offset, 4, this.length)
- return ieee754.read(this, offset, true, 23, 4)
-}
-
-Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
- offset = offset >>> 0
- if (!noAssert) checkOffset(offset, 4, this.length)
- return ieee754.read(this, offset, false, 23, 4)
-}
-
-Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
- offset = offset >>> 0
- if (!noAssert) checkOffset(offset, 8, this.length)
- return ieee754.read(this, offset, true, 52, 8)
-}
-
-Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
- offset = offset >>> 0
- 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)
- this[offset] = (value & 0xff)
- return offset + 1
-}
-
-Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
- value = +value
- offset = offset >>> 0
- if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
- this[offset] = (value & 0xff)
- this[offset + 1] = (value >>> 8)
- 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)
- this[offset] = (value >>> 8)
- this[offset + 1] = (value & 0xff)
- return offset + 2
-}
-
-Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
- value = +value
- offset = offset >>> 0
- if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
- this[offset + 3] = (value >>> 24)
- this[offset + 2] = (value >>> 16)
- this[offset + 1] = (value >>> 8)
- this[offset] = (value & 0xff)
- 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)
- this[offset] = (value >>> 24)
- this[offset + 1] = (value >>> 16)
- this[offset + 2] = (value >>> 8)
- this[offset + 3] = (value & 0xff)
- 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 (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)
- this[offset] = (value & 0xff)
- this[offset + 1] = (value >>> 8)
- 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)
- this[offset] = (value >>> 8)
- this[offset + 1] = (value & 0xff)
- 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)
- this[offset] = (value & 0xff)
- this[offset + 1] = (value >>> 8)
- this[offset + 2] = (value >>> 16)
- this[offset + 3] = (value >>> 24)
- 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
- this[offset] = (value >>> 24)
- this[offset + 1] = (value >>> 16)
- this[offset + 2] = (value >>> 8)
- this[offset + 3] = (value & 0xff)
- 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) {
- value = +value
- offset = offset >>> 0
- 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) {
- value = +value
- offset = offset >>> 0
- 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 (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')
- 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('Index out of range')
- 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
-
- if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {
- // Use built-in when available, missing from IE11
- this.copyWithin(targetStart, start, end)
- } else if (this === target && start < targetStart && targetStart < end) {
- // descending copy from end
- for (var i = len - 1; i >= 0; --i) {
- target[i + targetStart] = this[i + start]
- }
- } else {
- Uint8Array.prototype.set.call(
- target,
- this.subarray(start, end),
- 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 (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)
- }
- if (val.length === 1) {
- var code = val.charCodeAt(0)
- if ((encoding === 'utf8' && code < 128) ||
- encoding === 'latin1') {
- // Fast path: If `val` fits into a single byte, use that numeric value.
- val = code
- }
- }
- } 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
- : Buffer.from(val, encoding)
- var len = bytes.length
- if (len === 0) {
- throw new TypeError('The value "' + val +
- '" is invalid for argument "value"')
- }
- 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 takes equal signs as end of the Base64 encoding
- str = str.split('=')[0]
- // Node strips out invalid characters like \n and \t from the string, base64-js does not
- str = str.trim().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 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
-}
-
-// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass
-// the `instanceof` check but they should be treated as of that type.
-// See: https://github.com/feross/buffer/issues/166
-function isInstance (obj, type) {
- return obj instanceof type ||
- (obj != null && obj.constructor != null && obj.constructor.name != null &&
- obj.constructor.name === type.name)
-}
-function numberIsNaN (obj) {
- // For IE11 support
- return obj !== obj // eslint-disable-line no-self-compare
-}
-
-},{"base64-js":24,"ieee754":31}],29:[function(require,module,exports){
-(function (Buffer){
-// 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);
-}
-
-}).call(this,{"isBuffer":require("../../is-buffer/index.js")})
-},{"../../is-buffer/index.js":33}],30:[function(require,module,exports){
-// 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 objectCreate = Object.create || objectCreatePolyfill
-var objectKeys = Object.keys || objectKeysPolyfill
-var bind = Function.prototype.bind || functionBindPolyfill
-
-function EventEmitter() {
- if (!this._events || !Object.prototype.hasOwnProperty.call(this, '_events')) {
- this._events = objectCreate(null);
- this._eventsCount = 0;
- }
-
- this._maxListeners = this._maxListeners || undefined;
-}
-module.exports = EventEmitter;
-
-// Backwards-compat with node 0.10.x
-EventEmitter.EventEmitter = EventEmitter;
-
-EventEmitter.prototype._events = undefined;
-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;
-
-var hasDefineProperty;
-try {
- var o = {};
- if (Object.defineProperty) Object.defineProperty(o, 'x', { value: 0 });
- hasDefineProperty = o.x === 0;
-} catch (err) { hasDefineProperty = false }
-if (hasDefineProperty) {
- Object.defineProperty(EventEmitter, 'defaultMaxListeners', {
- enumerable: true,
- get: function() {
- return defaultMaxListeners;
- },
- set: function(arg) {
- // check whether the input is a positive number (whose value is zero or
- // greater and not a NaN).
- if (typeof arg !== 'number' || arg < 0 || arg !== arg)
- throw new TypeError('"defaultMaxListeners" must be a positive number');
- defaultMaxListeners = arg;
- }
- });
-} else {
- EventEmitter.defaultMaxListeners = defaultMaxListeners;
-}
-
-// 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 || isNaN(n))
- throw new TypeError('"n" argument must be a positive number');
- 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);
-};
-
-// These standalone emit* functions are used to optimize calling of event
-// handlers for fast cases because emit() itself often has a variable number of
-// arguments and can be deoptimized because of that. These functions always have
-// the same number of arguments and thus do not get deoptimized, so the code
-// inside them can execute faster.
-function emitNone(handler, isFn, self) {
- if (isFn)
- handler.call(self);
- else {
- var len = handler.length;
- var listeners = arrayClone(handler, len);
- for (var i = 0; i < len; ++i)
- listeners[i].call(self);
- }
-}
-function emitOne(handler, isFn, self, arg1) {
- if (isFn)
- handler.call(self, arg1);
- else {
- var len = handler.length;
- var listeners = arrayClone(handler, len);
- for (var i = 0; i < len; ++i)
- listeners[i].call(self, arg1);
- }
-}
-function emitTwo(handler, isFn, self, arg1, arg2) {
- if (isFn)
- handler.call(self, arg1, arg2);
- else {
- var len = handler.length;
- var listeners = arrayClone(handler, len);
- for (var i = 0; i < len; ++i)
- listeners[i].call(self, arg1, arg2);
- }
-}
-function emitThree(handler, isFn, self, arg1, arg2, arg3) {
- if (isFn)
- handler.call(self, arg1, arg2, arg3);
- else {
- var len = handler.length;
- var listeners = arrayClone(handler, len);
- for (var i = 0; i < len; ++i)
- listeners[i].call(self, arg1, arg2, arg3);
- }
-}
-
-function emitMany(handler, isFn, self, args) {
- if (isFn)
- handler.apply(self, args);
- else {
- var len = handler.length;
- var listeners = arrayClone(handler, len);
- for (var i = 0; i < len; ++i)
- listeners[i].apply(self, args);
- }
-}
-
-EventEmitter.prototype.emit = function emit(type) {
- var er, handler, len, args, i, events;
- var doError = (type === 'error');
-
- events = this._events;
- if (events)
- doError = (doError && events.error == null);
- else if (!doError)
- return false;
-
- // If there is no 'error' event listener then throw.
- if (doError) {
- if (arguments.length > 1)
- er = arguments[1];
- if (er instanceof Error) {
- throw er; // Unhandled 'error' event
- } else {
- // At least give some kind of context to the user
- var err = new Error('Unhandled "error" event. (' + er + ')');
- err.context = er;
- throw err;
- }
- return false;
- }
-
- handler = events[type];
-
- if (!handler)
- return false;
-
- var isFn = typeof handler === 'function';
- len = arguments.length;
- switch (len) {
- // fast cases
- case 1:
- emitNone(handler, isFn, this);
- break;
- case 2:
- emitOne(handler, isFn, this, arguments[1]);
- break;
- case 3:
- emitTwo(handler, isFn, this, arguments[1], arguments[2]);
- break;
- case 4:
- emitThree(handler, isFn, this, arguments[1], arguments[2], arguments[3]);
- break;
- // slower
- default:
- args = new Array(len - 1);
- for (i = 1; i < len; i++)
- args[i - 1] = arguments[i];
- emitMany(handler, isFn, this, args);
- }
-
- return true;
-};
-
-function _addListener(target, type, listener, prepend) {
- var m;
- var events;
- var existing;
-
- if (typeof listener !== 'function')
- throw new TypeError('"listener" argument must be a function');
-
- events = target._events;
- if (!events) {
- events = target._events = objectCreate(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) {
- 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) {
- // 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];
- } else {
- // If we've already got an array, just append.
- if (prepend) {
- existing.unshift(listener);
- } else {
- existing.push(listener);
- }
- }
-
- // Check for listener leak
- if (!existing.warned) {
- m = $getMaxListeners(target);
- if (m && m > 0 && existing.length > m) {
- existing.warned = true;
- 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;
- if (typeof console === 'object' && console.warn) {
- console.warn('%s: %s', w.name, w.message);
- }
- }
- }
- }
-
- 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() {
- if (!this.fired) {
- this.target.removeListener(this.type, this.wrapFn);
- this.fired = true;
- switch (arguments.length) {
- case 0:
- return this.listener.call(this.target);
- case 1:
- return this.listener.call(this.target, arguments[0]);
- case 2:
- return this.listener.call(this.target, arguments[0], arguments[1]);
- case 3:
- return this.listener.call(this.target, arguments[0], arguments[1],
- arguments[2]);
- default:
- var args = new Array(arguments.length);
- for (var i = 0; i < args.length; ++i)
- args[i] = arguments[i];
- this.listener.apply(this.target, args);
- }
- }
-}
-
-function _onceWrap(target, type, listener) {
- var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };
- var wrapped = bind.call(onceWrapper, state);
- wrapped.listener = listener;
- state.wrapFn = wrapped;
- return wrapped;
-}
-
-EventEmitter.prototype.once = function once(type, listener) {
- if (typeof listener !== 'function')
- throw new TypeError('"listener" argument must be a function');
- this.on(type, _onceWrap(this, type, listener));
- return this;
-};
-
-EventEmitter.prototype.prependOnceListener =
- function prependOnceListener(type, listener) {
- if (typeof listener !== 'function')
- throw new TypeError('"listener" argument must be a function');
- 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('"listener" argument must be a function');
-
- events = this._events;
- if (!events)
- return this;
-
- list = events[type];
- if (!list)
- return this;
-
- if (list === listener || list.listener === listener) {
- if (--this._eventsCount === 0)
- this._events = objectCreate(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)
- this.emit('removeListener', type, originalListener || listener);
- }
-
- return this;
- };
-
-EventEmitter.prototype.removeAllListeners =
- function removeAllListeners(type) {
- var listeners, events, i;
-
- events = this._events;
- if (!events)
- return this;
-
- // not listening for removeListener, no need to emit
- if (!events.removeListener) {
- if (arguments.length === 0) {
- this._events = objectCreate(null);
- this._eventsCount = 0;
- } else if (events[type]) {
- if (--this._eventsCount === 0)
- this._events = objectCreate(null);
- else
- delete events[type];
- }
- return this;
- }
-
- // emit removeListener for all listeners on all events
- if (arguments.length === 0) {
- var keys = objectKeys(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 = objectCreate(null);
- this._eventsCount = 0;
- return this;
- }
-
- listeners = events[type];
-
- if (typeof listeners === 'function') {
- this.removeListener(type, listeners);
- } else if (listeners) {
- // 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)
- return [];
-
- var evlistener = events[type];
- if (!evlistener)
- 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) {
- var evlistener = events[type];
-
- if (typeof evlistener === 'function') {
- return 1;
- } else if (evlistener) {
- return evlistener.length;
- }
- }
-
- return 0;
-}
-
-EventEmitter.prototype.eventNames = function eventNames() {
- return this._eventsCount > 0 ? Reflect.ownKeys(this._events) : [];
-};
-
-// About 1.5x faster than the two-arg version of Array#splice().
-function spliceOne(list, index) {
- for (var i = index, k = i + 1, n = list.length; k < n; i += 1, k += 1)
- list[i] = list[k];
- list.pop();
-}
-
-function arrayClone(arr, n) {
- var copy = new Array(n);
- for (var i = 0; i < n; ++i)
- copy[i] = arr[i];
- return copy;
-}
-
-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;
-}
-
-function objectCreatePolyfill(proto) {
- var F = function() {};
- F.prototype = proto;
- return new F;
-}
-function objectKeysPolyfill(obj) {
- var keys = [];
- for (var k in obj) if (Object.prototype.hasOwnProperty.call(obj, k)) {
- keys.push(k);
- }
- return k;
-}
-function functionBindPolyfill(context) {
- var fn = this;
- return function () {
- return fn.apply(context, arguments);
- };
-}
-
-},{}],31:[function(require,module,exports){
-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
-}
-
-},{}],32:[function(require,module,exports){
-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.prototype = superCtor.prototype
- ctor.prototype = new TempCtor()
- ctor.prototype.constructor = ctor
- }
-}
-
-},{}],33:[function(require,module,exports){
-/*!
- * Determine if an object is a Buffer
- *
- * @author Feross Aboukhadijeh
- * @license MIT
- */
-
-// The _isBuffer check is for Safari 5-7 support, because it's missing
-// Object.prototype.constructor. Remove this eventually
-module.exports = function (obj) {
- return obj != null && (isBuffer(obj) || isSlowBuffer(obj) || !!obj._isBuffer)
-}
-
-function isBuffer (obj) {
- return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)
-}
-
-// For Node v0.10 support. Remove this eventually.
-function isSlowBuffer (obj) {
- return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isBuffer(obj.slice(0, 0))
-}
-
-},{}],34:[function(require,module,exports){
-var toString = {}.toString;
-
-module.exports = Array.isArray || function (arr) {
- return toString.call(arr) == '[object Array]';
-};
-
-},{}],35:[function(require,module,exports){
-'use strict';
-
-
-var TYPED_OK = (typeof Uint8Array !== 'undefined') &&
- (typeof Uint16Array !== 'undefined') &&
- (typeof Int32Array !== 'undefined');
-
-function _has(obj, key) {
- return Object.prototype.hasOwnProperty.call(obj, key);
-}
-
-exports.assign = function (obj /*from1, from2, from3, ...*/) {
- var sources = Array.prototype.slice.call(arguments, 1);
- while (sources.length) {
- var source = sources.shift();
- if (!source) { continue; }
-
- if (typeof source !== 'object') {
- throw new TypeError(source + 'must be non-object');
- }
-
- for (var p in source) {
- if (_has(source, p)) {
- obj[p] = source[p];
- }
- }
- }
-
- return obj;
-};
-
-
-// reduce buffer size, avoiding mem copy
-exports.shrinkBuf = function (buf, size) {
- if (buf.length === size) { return buf; }
- if (buf.subarray) { return buf.subarray(0, size); }
- buf.length = size;
- return buf;
-};
-
-
-var fnTyped = {
- arraySet: function (dest, src, src_offs, len, dest_offs) {
- if (src.subarray && dest.subarray) {
- dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
- return;
- }
- // Fallback to ordinary array
- for (var i = 0; i < len; i++) {
- dest[dest_offs + i] = src[src_offs + i];
- }
- },
- // Join array of chunks to single array.
- flattenChunks: function (chunks) {
- var i, l, len, pos, chunk, result;
-
- // calculate data length
- len = 0;
- for (i = 0, l = chunks.length; i < l; i++) {
- len += chunks[i].length;
- }
-
- // join chunks
- result = new Uint8Array(len);
- pos = 0;
- for (i = 0, l = chunks.length; i < l; i++) {
- chunk = chunks[i];
- result.set(chunk, pos);
- pos += chunk.length;
- }
-
- return result;
- }
-};
-
-var fnUntyped = {
- arraySet: function (dest, src, src_offs, len, dest_offs) {
- for (var i = 0; i < len; i++) {
- dest[dest_offs + i] = src[src_offs + i];
- }
- },
- // Join array of chunks to single array.
- flattenChunks: function (chunks) {
- return [].concat.apply([], chunks);
- }
-};
-
-
-// Enable/Disable typed arrays use, for testing
-//
-exports.setTyped = function (on) {
- if (on) {
- exports.Buf8 = Uint8Array;
- exports.Buf16 = Uint16Array;
- exports.Buf32 = Int32Array;
- exports.assign(exports, fnTyped);
- } else {
- exports.Buf8 = Array;
- exports.Buf16 = Array;
- exports.Buf32 = Array;
- exports.assign(exports, fnUntyped);
- }
-};
-
-exports.setTyped(TYPED_OK);
-
-},{}],36:[function(require,module,exports){
-'use strict';
-
-// Note: adler32 takes 12% for level 0 and 2% for level 6.
-// It isn't worth it to make additional optimizations as in original.
-// Small size is preferable.
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-function adler32(adler, buf, len, pos) {
- var s1 = (adler & 0xffff) |0,
- s2 = ((adler >>> 16) & 0xffff) |0,
- n = 0;
-
- while (len !== 0) {
- // Set limit ~ twice less than 5552, to keep
- // s2 in 31-bits, because we force signed ints.
- // in other case %= will fail.
- n = len > 2000 ? 2000 : len;
- len -= n;
-
- do {
- s1 = (s1 + buf[pos++]) |0;
- s2 = (s2 + s1) |0;
- } while (--n);
-
- s1 %= 65521;
- s2 %= 65521;
- }
-
- return (s1 | (s2 << 16)) |0;
-}
-
-
-module.exports = adler32;
-
-},{}],37:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-module.exports = {
-
- /* Allowed flush values; see deflate() and inflate() below for details */
- Z_NO_FLUSH: 0,
- Z_PARTIAL_FLUSH: 1,
- Z_SYNC_FLUSH: 2,
- Z_FULL_FLUSH: 3,
- Z_FINISH: 4,
- Z_BLOCK: 5,
- Z_TREES: 6,
-
- /* Return codes for the compression/decompression functions. Negative values
- * are errors, positive values are used for special but normal events.
- */
- Z_OK: 0,
- Z_STREAM_END: 1,
- Z_NEED_DICT: 2,
- Z_ERRNO: -1,
- Z_STREAM_ERROR: -2,
- Z_DATA_ERROR: -3,
- //Z_MEM_ERROR: -4,
- Z_BUF_ERROR: -5,
- //Z_VERSION_ERROR: -6,
-
- /* compression levels */
- Z_NO_COMPRESSION: 0,
- Z_BEST_SPEED: 1,
- Z_BEST_COMPRESSION: 9,
- Z_DEFAULT_COMPRESSION: -1,
-
-
- Z_FILTERED: 1,
- Z_HUFFMAN_ONLY: 2,
- Z_RLE: 3,
- Z_FIXED: 4,
- Z_DEFAULT_STRATEGY: 0,
-
- /* Possible values of the data_type field (though see inflate()) */
- Z_BINARY: 0,
- Z_TEXT: 1,
- //Z_ASCII: 1, // = Z_TEXT (deprecated)
- Z_UNKNOWN: 2,
-
- /* The deflate compression method */
- Z_DEFLATED: 8
- //Z_NULL: null // Use -1 or null inline, depending on var type
-};
-
-},{}],38:[function(require,module,exports){
-'use strict';
-
-// Note: we can't get significant speed boost here.
-// So write code to minimize size - no pregenerated tables
-// and array tools dependencies.
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-// Use ordinary array, since untyped makes no boost here
-function makeTable() {
- var c, table = [];
-
- for (var n = 0; n < 256; n++) {
- c = n;
- for (var k = 0; k < 8; k++) {
- c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
- }
- table[n] = c;
- }
-
- return table;
-}
-
-// Create table on load. Just 255 signed longs. Not a problem.
-var crcTable = makeTable();
-
-
-function crc32(crc, buf, len, pos) {
- var t = crcTable,
- end = pos + len;
-
- crc ^= -1;
-
- for (var i = pos; i < end; i++) {
- crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
- }
-
- return (crc ^ (-1)); // >>> 0;
-}
-
-
-module.exports = crc32;
-
-},{}],39:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-var utils = require('../utils/common');
-var trees = require('./trees');
-var adler32 = require('./adler32');
-var crc32 = require('./crc32');
-var msg = require('./messages');
-
-/* Public constants ==========================================================*/
-/* ===========================================================================*/
-
-
-/* Allowed flush values; see deflate() and inflate() below for details */
-var Z_NO_FLUSH = 0;
-var Z_PARTIAL_FLUSH = 1;
-//var Z_SYNC_FLUSH = 2;
-var Z_FULL_FLUSH = 3;
-var Z_FINISH = 4;
-var Z_BLOCK = 5;
-//var Z_TREES = 6;
-
-
-/* Return codes for the compression/decompression functions. Negative values
- * are errors, positive values are used for special but normal events.
- */
-var Z_OK = 0;
-var Z_STREAM_END = 1;
-//var Z_NEED_DICT = 2;
-//var Z_ERRNO = -1;
-var Z_STREAM_ERROR = -2;
-var Z_DATA_ERROR = -3;
-//var Z_MEM_ERROR = -4;
-var Z_BUF_ERROR = -5;
-//var Z_VERSION_ERROR = -6;
-
-
-/* compression levels */
-//var Z_NO_COMPRESSION = 0;
-//var Z_BEST_SPEED = 1;
-//var Z_BEST_COMPRESSION = 9;
-var Z_DEFAULT_COMPRESSION = -1;
-
-
-var Z_FILTERED = 1;
-var Z_HUFFMAN_ONLY = 2;
-var Z_RLE = 3;
-var Z_FIXED = 4;
-var Z_DEFAULT_STRATEGY = 0;
-
-/* Possible values of the data_type field (though see inflate()) */
-//var Z_BINARY = 0;
-//var Z_TEXT = 1;
-//var Z_ASCII = 1; // = Z_TEXT
-var Z_UNKNOWN = 2;
-
-
-/* The deflate compression method */
-var Z_DEFLATED = 8;
-
-/*============================================================================*/
-
-
-var MAX_MEM_LEVEL = 9;
-/* Maximum value for memLevel in deflateInit2 */
-var MAX_WBITS = 15;
-/* 32K LZ77 window */
-var DEF_MEM_LEVEL = 8;
-
-
-var LENGTH_CODES = 29;
-/* number of length codes, not counting the special END_BLOCK code */
-var LITERALS = 256;
-/* number of literal bytes 0..255 */
-var L_CODES = LITERALS + 1 + LENGTH_CODES;
-/* number of Literal or Length codes, including the END_BLOCK code */
-var D_CODES = 30;
-/* number of distance codes */
-var BL_CODES = 19;
-/* number of codes used to transfer the bit lengths */
-var HEAP_SIZE = 2 * L_CODES + 1;
-/* maximum heap size */
-var MAX_BITS = 15;
-/* All codes must not exceed MAX_BITS bits */
-
-var MIN_MATCH = 3;
-var MAX_MATCH = 258;
-var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);
-
-var PRESET_DICT = 0x20;
-
-var INIT_STATE = 42;
-var EXTRA_STATE = 69;
-var NAME_STATE = 73;
-var COMMENT_STATE = 91;
-var HCRC_STATE = 103;
-var BUSY_STATE = 113;
-var FINISH_STATE = 666;
-
-var BS_NEED_MORE = 1; /* block not completed, need more input or more output */
-var BS_BLOCK_DONE = 2; /* block flush performed */
-var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */
-var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */
-
-var OS_CODE = 0x03; // Unix :) . Don't detect, use this default.
-
-function err(strm, errorCode) {
- strm.msg = msg[errorCode];
- return errorCode;
-}
-
-function rank(f) {
- return ((f) << 1) - ((f) > 4 ? 9 : 0);
-}
-
-function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
-
-
-/* =========================================================================
- * Flush as much pending output as possible. All deflate() output goes
- * through this function so some applications may wish to modify it
- * to avoid allocating a large strm->output buffer and copying into it.
- * (See also read_buf()).
- */
-function flush_pending(strm) {
- var s = strm.state;
-
- //_tr_flush_bits(s);
- var len = s.pending;
- if (len > strm.avail_out) {
- len = strm.avail_out;
- }
- if (len === 0) { return; }
-
- utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
- strm.next_out += len;
- s.pending_out += len;
- strm.total_out += len;
- strm.avail_out -= len;
- s.pending -= len;
- if (s.pending === 0) {
- s.pending_out = 0;
- }
-}
-
-
-function flush_block_only(s, last) {
- trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);
- s.block_start = s.strstart;
- flush_pending(s.strm);
-}
-
-
-function put_byte(s, b) {
- s.pending_buf[s.pending++] = b;
-}
-
-
-/* =========================================================================
- * Put a short in the pending buffer. The 16-bit value is put in MSB order.
- * IN assertion: the stream state is correct and there is enough room in
- * pending_buf.
- */
-function putShortMSB(s, b) {
-// put_byte(s, (Byte)(b >> 8));
-// put_byte(s, (Byte)(b & 0xff));
- s.pending_buf[s.pending++] = (b >>> 8) & 0xff;
- s.pending_buf[s.pending++] = b & 0xff;
-}
-
-
-/* ===========================================================================
- * Read a new buffer from the current input stream, update the adler32
- * and total number of bytes read. All deflate() input goes through
- * this function so some applications may wish to modify it to avoid
- * allocating a large strm->input buffer and copying from it.
- * (See also flush_pending()).
- */
-function read_buf(strm, buf, start, size) {
- var len = strm.avail_in;
-
- if (len > size) { len = size; }
- if (len === 0) { return 0; }
-
- strm.avail_in -= len;
-
- // zmemcpy(buf, strm->next_in, len);
- utils.arraySet(buf, strm.input, strm.next_in, len, start);
- if (strm.state.wrap === 1) {
- strm.adler = adler32(strm.adler, buf, len, start);
- }
-
- else if (strm.state.wrap === 2) {
- strm.adler = crc32(strm.adler, buf, len, start);
- }
-
- strm.next_in += len;
- strm.total_in += len;
-
- return len;
-}
-
-
-/* ===========================================================================
- * Set match_start to the longest match starting at the given string and
- * return its length. Matches shorter or equal to prev_length are discarded,
- * in which case the result is equal to prev_length and match_start is
- * garbage.
- * IN assertions: cur_match is the head of the hash chain for the current
- * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
- * OUT assertion: the match length is not greater than s->lookahead.
- */
-function longest_match(s, cur_match) {
- var chain_length = s.max_chain_length; /* max hash chain length */
- var scan = s.strstart; /* current string */
- var match; /* matched string */
- var len; /* length of current match */
- var best_len = s.prev_length; /* best match length so far */
- var nice_match = s.nice_match; /* stop if match long enough */
- var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?
- s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;
-
- var _win = s.window; // shortcut
-
- var wmask = s.w_mask;
- var prev = s.prev;
-
- /* Stop when cur_match becomes <= limit. To simplify the code,
- * we prevent matches with the string of window index 0.
- */
-
- var strend = s.strstart + MAX_MATCH;
- var scan_end1 = _win[scan + best_len - 1];
- var scan_end = _win[scan + best_len];
-
- /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
- * It is easy to get rid of this optimization if necessary.
- */
- // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
-
- /* Do not waste too much time if we already have a good match: */
- if (s.prev_length >= s.good_match) {
- chain_length >>= 2;
- }
- /* Do not look for matches beyond the end of the input. This is necessary
- * to make deflate deterministic.
- */
- if (nice_match > s.lookahead) { nice_match = s.lookahead; }
-
- // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
-
- do {
- // Assert(cur_match < s->strstart, "no future");
- match = cur_match;
-
- /* Skip to next match if the match length cannot increase
- * or if the match length is less than 2. Note that the checks below
- * for insufficient lookahead only occur occasionally for performance
- * reasons. Therefore uninitialized memory will be accessed, and
- * conditional jumps will be made that depend on those values.
- * However the length of the match is limited to the lookahead, so
- * the output of deflate is not affected by the uninitialized values.
- */
-
- if (_win[match + best_len] !== scan_end ||
- _win[match + best_len - 1] !== scan_end1 ||
- _win[match] !== _win[scan] ||
- _win[++match] !== _win[scan + 1]) {
- continue;
- }
-
- /* The check at best_len-1 can be removed because it will be made
- * again later. (This heuristic is not always a win.)
- * It is not necessary to compare scan[2] and match[2] since they
- * are always equal when the other bytes match, given that
- * the hash keys are equal and that HASH_BITS >= 8.
- */
- scan += 2;
- match++;
- // Assert(*scan == *match, "match[2]?");
-
- /* We check for insufficient lookahead only every 8th comparison;
- * the 256th check will be made at strstart+258.
- */
- do {
- /*jshint noempty:false*/
- } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
- _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
- _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
- _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
- scan < strend);
-
- // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
-
- len = MAX_MATCH - (strend - scan);
- scan = strend - MAX_MATCH;
-
- if (len > best_len) {
- s.match_start = cur_match;
- best_len = len;
- if (len >= nice_match) {
- break;
- }
- scan_end1 = _win[scan + best_len - 1];
- scan_end = _win[scan + best_len];
- }
- } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);
-
- if (best_len <= s.lookahead) {
- return best_len;
- }
- return s.lookahead;
-}
-
-
-/* ===========================================================================
- * Fill the window when the lookahead becomes insufficient.
- * Updates strstart and lookahead.
- *
- * IN assertion: lookahead < MIN_LOOKAHEAD
- * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
- * At least one byte has been read, or avail_in == 0; reads are
- * performed for at least two bytes (required for the zip translate_eol
- * option -- not supported here).
- */
-function fill_window(s) {
- var _w_size = s.w_size;
- var p, n, m, more, str;
-
- //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
-
- do {
- more = s.window_size - s.lookahead - s.strstart;
-
- // JS ints have 32 bit, block below not needed
- /* Deal with !@#$% 64K limit: */
- //if (sizeof(int) <= 2) {
- // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
- // more = wsize;
- //
- // } else if (more == (unsigned)(-1)) {
- // /* Very unlikely, but possible on 16 bit machine if
- // * strstart == 0 && lookahead == 1 (input done a byte at time)
- // */
- // more--;
- // }
- //}
-
-
- /* If the window is almost full and there is insufficient lookahead,
- * move the upper half to the lower one to make room in the upper half.
- */
- if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {
-
- utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
- s.match_start -= _w_size;
- s.strstart -= _w_size;
- /* we now have strstart >= MAX_DIST */
- s.block_start -= _w_size;
-
- /* Slide the hash table (could be avoided with 32 bit values
- at the expense of memory usage). We slide even when level == 0
- to keep the hash table consistent if we switch back to level > 0
- later. (Using level 0 permanently is not an optimal usage of
- zlib, so we don't care about this pathological case.)
- */
-
- n = s.hash_size;
- p = n;
- do {
- m = s.head[--p];
- s.head[p] = (m >= _w_size ? m - _w_size : 0);
- } while (--n);
-
- n = _w_size;
- p = n;
- do {
- m = s.prev[--p];
- s.prev[p] = (m >= _w_size ? m - _w_size : 0);
- /* If n is not on any hash chain, prev[n] is garbage but
- * its value will never be used.
- */
- } while (--n);
-
- more += _w_size;
- }
- if (s.strm.avail_in === 0) {
- break;
- }
-
- /* If there was no sliding:
- * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
- * more == window_size - lookahead - strstart
- * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
- * => more >= window_size - 2*WSIZE + 2
- * In the BIG_MEM or MMAP case (not yet supported),
- * window_size == input_size + MIN_LOOKAHEAD &&
- * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
- * Otherwise, window_size == 2*WSIZE so more >= 2.
- * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
- */
- //Assert(more >= 2, "more < 2");
- n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
- s.lookahead += n;
-
- /* Initialize the hash value now that we have some input: */
- if (s.lookahead + s.insert >= MIN_MATCH) {
- str = s.strstart - s.insert;
- s.ins_h = s.window[str];
-
- /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;
-//#if MIN_MATCH != 3
-// Call update_hash() MIN_MATCH-3 more times
-//#endif
- while (s.insert) {
- /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
-
- s.prev[str & s.w_mask] = s.head[s.ins_h];
- s.head[s.ins_h] = str;
- str++;
- s.insert--;
- if (s.lookahead + s.insert < MIN_MATCH) {
- break;
- }
- }
- }
- /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
- * but this is not important since only literal bytes will be emitted.
- */
-
- } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);
-
- /* If the WIN_INIT bytes after the end of the current data have never been
- * written, then zero those bytes in order to avoid memory check reports of
- * the use of uninitialized (or uninitialised as Julian writes) bytes by
- * the longest match routines. Update the high water mark for the next
- * time through here. WIN_INIT is set to MAX_MATCH since the longest match
- * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
- */
-// if (s.high_water < s.window_size) {
-// var curr = s.strstart + s.lookahead;
-// var init = 0;
-//
-// if (s.high_water < curr) {
-// /* Previous high water mark below current data -- zero WIN_INIT
-// * bytes or up to end of window, whichever is less.
-// */
-// init = s.window_size - curr;
-// if (init > WIN_INIT)
-// init = WIN_INIT;
-// zmemzero(s->window + curr, (unsigned)init);
-// s->high_water = curr + init;
-// }
-// else if (s->high_water < (ulg)curr + WIN_INIT) {
-// /* High water mark at or above current data, but below current data
-// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
-// * to end of window, whichever is less.
-// */
-// init = (ulg)curr + WIN_INIT - s->high_water;
-// if (init > s->window_size - s->high_water)
-// init = s->window_size - s->high_water;
-// zmemzero(s->window + s->high_water, (unsigned)init);
-// s->high_water += init;
-// }
-// }
-//
-// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
-// "not enough room for search");
-}
-
-/* ===========================================================================
- * Copy without compression as much as possible from the input stream, return
- * the current block state.
- * This function does not insert new strings in the dictionary since
- * uncompressible data is probably not useful. This function is used
- * only for the level=0 compression option.
- * NOTE: this function should be optimized to avoid extra copying from
- * window to pending_buf.
- */
-function deflate_stored(s, flush) {
- /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
- * to pending_buf_size, and each stored block has a 5 byte header:
- */
- var max_block_size = 0xffff;
-
- if (max_block_size > s.pending_buf_size - 5) {
- max_block_size = s.pending_buf_size - 5;
- }
-
- /* Copy as much as possible from input to output: */
- for (;;) {
- /* Fill the window as much as possible: */
- if (s.lookahead <= 1) {
-
- //Assert(s->strstart < s->w_size+MAX_DIST(s) ||
- // s->block_start >= (long)s->w_size, "slide too late");
-// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||
-// s.block_start >= s.w_size)) {
-// throw new Error("slide too late");
-// }
-
- fill_window(s);
- if (s.lookahead === 0 && flush === Z_NO_FLUSH) {
- return BS_NEED_MORE;
- }
-
- if (s.lookahead === 0) {
- break;
- }
- /* flush the current block */
- }
- //Assert(s->block_start >= 0L, "block gone");
-// if (s.block_start < 0) throw new Error("block gone");
-
- s.strstart += s.lookahead;
- s.lookahead = 0;
-
- /* Emit a stored block if pending_buf will be full: */
- var max_start = s.block_start + max_block_size;
-
- if (s.strstart === 0 || s.strstart >= max_start) {
- /* strstart == 0 is possible when wraparound on 16-bit machine */
- s.lookahead = s.strstart - max_start;
- s.strstart = max_start;
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
-
-
- }
- /* Flush if we may have to slide, otherwise block_start may become
- * negative and the data will be gone:
- */
- if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- }
-
- s.insert = 0;
-
- if (flush === Z_FINISH) {
- /*** FLUSH_BLOCK(s, 1); ***/
- flush_block_only(s, true);
- if (s.strm.avail_out === 0) {
- return BS_FINISH_STARTED;
- }
- /***/
- return BS_FINISH_DONE;
- }
-
- if (s.strstart > s.block_start) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
-
- return BS_NEED_MORE;
-}
-
-/* ===========================================================================
- * Compress as much as possible from the input stream, return the current
- * block state.
- * This function does not perform lazy evaluation of matches and inserts
- * new strings in the dictionary only for unmatched strings or for short
- * matches. It is used only for the fast compression options.
- */
-function deflate_fast(s, flush) {
- var hash_head; /* head of the hash chain */
- var bflush; /* set if current block must be flushed */
-
- for (;;) {
- /* Make sure that we always have enough lookahead, except
- * at the end of the input file. We need MAX_MATCH bytes
- * for the next match, plus MIN_MATCH bytes to insert the
- * string following the next match.
- */
- if (s.lookahead < MIN_LOOKAHEAD) {
- fill_window(s);
- if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
- return BS_NEED_MORE;
- }
- if (s.lookahead === 0) {
- break; /* flush the current block */
- }
- }
-
- /* Insert the string window[strstart .. strstart+2] in the
- * dictionary, and set hash_head to the head of the hash chain:
- */
- hash_head = 0/*NIL*/;
- if (s.lookahead >= MIN_MATCH) {
- /*** INSERT_STRING(s, s.strstart, hash_head); ***/
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
- hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
- s.head[s.ins_h] = s.strstart;
- /***/
- }
-
- /* Find the longest match, discarding those <= prev_length.
- * At this point we have always match_length < MIN_MATCH
- */
- if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {
- /* To simplify the code, we prevent matches with the string
- * of window index 0 (in particular we have to avoid a match
- * of the string with itself at the start of the input file).
- */
- s.match_length = longest_match(s, hash_head);
- /* longest_match() sets match_start */
- }
- if (s.match_length >= MIN_MATCH) {
- // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only
-
- /*** _tr_tally_dist(s, s.strstart - s.match_start,
- s.match_length - MIN_MATCH, bflush); ***/
- bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
-
- s.lookahead -= s.match_length;
-
- /* Insert new strings in the hash table only if the match length
- * is not too large. This saves time but degrades compression.
- */
- if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
- s.match_length--; /* string at strstart already in table */
- do {
- s.strstart++;
- /*** INSERT_STRING(s, s.strstart, hash_head); ***/
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
- hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
- s.head[s.ins_h] = s.strstart;
- /***/
- /* strstart never exceeds WSIZE-MAX_MATCH, so there are
- * always MIN_MATCH bytes ahead.
- */
- } while (--s.match_length !== 0);
- s.strstart++;
- } else
- {
- s.strstart += s.match_length;
- s.match_length = 0;
- s.ins_h = s.window[s.strstart];
- /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;
-
-//#if MIN_MATCH != 3
-// Call UPDATE_HASH() MIN_MATCH-3 more times
-//#endif
- /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
- * matter since it will be recomputed at next deflate call.
- */
- }
- } else {
- /* No match, output a literal byte */
- //Tracevv((stderr,"%c", s.window[s.strstart]));
- /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
- bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
-
- s.lookahead--;
- s.strstart++;
- }
- if (bflush) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- }
- s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);
- if (flush === Z_FINISH) {
- /*** FLUSH_BLOCK(s, 1); ***/
- flush_block_only(s, true);
- if (s.strm.avail_out === 0) {
- return BS_FINISH_STARTED;
- }
- /***/
- return BS_FINISH_DONE;
- }
- if (s.last_lit) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- return BS_BLOCK_DONE;
-}
-
-/* ===========================================================================
- * Same as above, but achieves better compression. We use a lazy
- * evaluation for matches: a match is finally adopted only if there is
- * no better match at the next window position.
- */
-function deflate_slow(s, flush) {
- var hash_head; /* head of hash chain */
- var bflush; /* set if current block must be flushed */
-
- var max_insert;
-
- /* Process the input block. */
- for (;;) {
- /* Make sure that we always have enough lookahead, except
- * at the end of the input file. We need MAX_MATCH bytes
- * for the next match, plus MIN_MATCH bytes to insert the
- * string following the next match.
- */
- if (s.lookahead < MIN_LOOKAHEAD) {
- fill_window(s);
- if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
- return BS_NEED_MORE;
- }
- if (s.lookahead === 0) { break; } /* flush the current block */
- }
-
- /* Insert the string window[strstart .. strstart+2] in the
- * dictionary, and set hash_head to the head of the hash chain:
- */
- hash_head = 0/*NIL*/;
- if (s.lookahead >= MIN_MATCH) {
- /*** INSERT_STRING(s, s.strstart, hash_head); ***/
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
- hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
- s.head[s.ins_h] = s.strstart;
- /***/
- }
-
- /* Find the longest match, discarding those <= prev_length.
- */
- s.prev_length = s.match_length;
- s.prev_match = s.match_start;
- s.match_length = MIN_MATCH - 1;
-
- if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&
- s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {
- /* To simplify the code, we prevent matches with the string
- * of window index 0 (in particular we have to avoid a match
- * of the string with itself at the start of the input file).
- */
- s.match_length = longest_match(s, hash_head);
- /* longest_match() sets match_start */
-
- if (s.match_length <= 5 &&
- (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {
-
- /* If prev_match is also MIN_MATCH, match_start is garbage
- * but we will ignore the current match anyway.
- */
- s.match_length = MIN_MATCH - 1;
- }
- }
- /* If there was a match at the previous step and the current
- * match is not better, output the previous match:
- */
- if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {
- max_insert = s.strstart + s.lookahead - MIN_MATCH;
- /* Do not insert strings in hash table beyond this. */
-
- //check_match(s, s.strstart-1, s.prev_match, s.prev_length);
-
- /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,
- s.prev_length - MIN_MATCH, bflush);***/
- bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);
- /* Insert in hash table all strings up to the end of the match.
- * strstart-1 and strstart are already inserted. If there is not
- * enough lookahead, the last two strings are not inserted in
- * the hash table.
- */
- s.lookahead -= s.prev_length - 1;
- s.prev_length -= 2;
- do {
- if (++s.strstart <= max_insert) {
- /*** INSERT_STRING(s, s.strstart, hash_head); ***/
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
- hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
- s.head[s.ins_h] = s.strstart;
- /***/
- }
- } while (--s.prev_length !== 0);
- s.match_available = 0;
- s.match_length = MIN_MATCH - 1;
- s.strstart++;
-
- if (bflush) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
-
- } else if (s.match_available) {
- /* If there was no match at the previous position, output a
- * single literal. If there was a match but the current match
- * is longer, truncate the previous match to a single literal.
- */
- //Tracevv((stderr,"%c", s->window[s->strstart-1]));
- /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
- bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
-
- if (bflush) {
- /*** FLUSH_BLOCK_ONLY(s, 0) ***/
- flush_block_only(s, false);
- /***/
- }
- s.strstart++;
- s.lookahead--;
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- } else {
- /* There is no previous match to compare with, wait for
- * the next step to decide.
- */
- s.match_available = 1;
- s.strstart++;
- s.lookahead--;
- }
- }
- //Assert (flush != Z_NO_FLUSH, "no flush?");
- if (s.match_available) {
- //Tracevv((stderr,"%c", s->window[s->strstart-1]));
- /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
- bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
-
- s.match_available = 0;
- }
- s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
- if (flush === Z_FINISH) {
- /*** FLUSH_BLOCK(s, 1); ***/
- flush_block_only(s, true);
- if (s.strm.avail_out === 0) {
- return BS_FINISH_STARTED;
- }
- /***/
- return BS_FINISH_DONE;
- }
- if (s.last_lit) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
-
- return BS_BLOCK_DONE;
-}
-
-
-/* ===========================================================================
- * For Z_RLE, simply look for runs of bytes, generate matches only of distance
- * one. Do not maintain a hash table. (It will be regenerated if this run of
- * deflate switches away from Z_RLE.)
- */
-function deflate_rle(s, flush) {
- var bflush; /* set if current block must be flushed */
- var prev; /* byte at distance one to match */
- var scan, strend; /* scan goes up to strend for length of run */
-
- var _win = s.window;
-
- for (;;) {
- /* Make sure that we always have enough lookahead, except
- * at the end of the input file. We need MAX_MATCH bytes
- * for the longest run, plus one for the unrolled loop.
- */
- if (s.lookahead <= MAX_MATCH) {
- fill_window(s);
- if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {
- return BS_NEED_MORE;
- }
- if (s.lookahead === 0) { break; } /* flush the current block */
- }
-
- /* See how many times the previous byte repeats */
- s.match_length = 0;
- if (s.lookahead >= MIN_MATCH && s.strstart > 0) {
- scan = s.strstart - 1;
- prev = _win[scan];
- if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {
- strend = s.strstart + MAX_MATCH;
- do {
- /*jshint noempty:false*/
- } while (prev === _win[++scan] && prev === _win[++scan] &&
- prev === _win[++scan] && prev === _win[++scan] &&
- prev === _win[++scan] && prev === _win[++scan] &&
- prev === _win[++scan] && prev === _win[++scan] &&
- scan < strend);
- s.match_length = MAX_MATCH - (strend - scan);
- if (s.match_length > s.lookahead) {
- s.match_length = s.lookahead;
- }
- }
- //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan");
- }
-
- /* Emit match if have run of MIN_MATCH or longer, else emit literal */
- if (s.match_length >= MIN_MATCH) {
- //check_match(s, s.strstart, s.strstart - 1, s.match_length);
-
- /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/
- bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);
-
- s.lookahead -= s.match_length;
- s.strstart += s.match_length;
- s.match_length = 0;
- } else {
- /* No match, output a literal byte */
- //Tracevv((stderr,"%c", s->window[s->strstart]));
- /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
- bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
-
- s.lookahead--;
- s.strstart++;
- }
- if (bflush) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- }
- s.insert = 0;
- if (flush === Z_FINISH) {
- /*** FLUSH_BLOCK(s, 1); ***/
- flush_block_only(s, true);
- if (s.strm.avail_out === 0) {
- return BS_FINISH_STARTED;
- }
- /***/
- return BS_FINISH_DONE;
- }
- if (s.last_lit) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- return BS_BLOCK_DONE;
-}
-
-/* ===========================================================================
- * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.
- * (It will be regenerated if this run of deflate switches away from Huffman.)
- */
-function deflate_huff(s, flush) {
- var bflush; /* set if current block must be flushed */
-
- for (;;) {
- /* Make sure that we have a literal to write. */
- if (s.lookahead === 0) {
- fill_window(s);
- if (s.lookahead === 0) {
- if (flush === Z_NO_FLUSH) {
- return BS_NEED_MORE;
- }
- break; /* flush the current block */
- }
- }
-
- /* Output a literal byte */
- s.match_length = 0;
- //Tracevv((stderr,"%c", s->window[s->strstart]));
- /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
- bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
- s.lookahead--;
- s.strstart++;
- if (bflush) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- }
- s.insert = 0;
- if (flush === Z_FINISH) {
- /*** FLUSH_BLOCK(s, 1); ***/
- flush_block_only(s, true);
- if (s.strm.avail_out === 0) {
- return BS_FINISH_STARTED;
- }
- /***/
- return BS_FINISH_DONE;
- }
- if (s.last_lit) {
- /*** FLUSH_BLOCK(s, 0); ***/
- flush_block_only(s, false);
- if (s.strm.avail_out === 0) {
- return BS_NEED_MORE;
- }
- /***/
- }
- return BS_BLOCK_DONE;
-}
-
-/* Values for max_lazy_match, good_match and max_chain_length, depending on
- * the desired pack level (0..9). The values given below have been tuned to
- * exclude worst case performance for pathological files. Better values may be
- * found for specific files.
- */
-function Config(good_length, max_lazy, nice_length, max_chain, func) {
- this.good_length = good_length;
- this.max_lazy = max_lazy;
- this.nice_length = nice_length;
- this.max_chain = max_chain;
- this.func = func;
-}
-
-var configuration_table;
-
-configuration_table = [
- /* good lazy nice chain */
- new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */
- new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */
- new Config(4, 5, 16, 8, deflate_fast), /* 2 */
- new Config(4, 6, 32, 32, deflate_fast), /* 3 */
-
- new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */
- new Config(8, 16, 32, 32, deflate_slow), /* 5 */
- new Config(8, 16, 128, 128, deflate_slow), /* 6 */
- new Config(8, 32, 128, 256, deflate_slow), /* 7 */
- new Config(32, 128, 258, 1024, deflate_slow), /* 8 */
- new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */
-];
-
-
-/* ===========================================================================
- * Initialize the "longest match" routines for a new zlib stream
- */
-function lm_init(s) {
- s.window_size = 2 * s.w_size;
-
- /*** CLEAR_HASH(s); ***/
- zero(s.head); // Fill with NIL (= 0);
-
- /* Set the default configuration parameters:
- */
- s.max_lazy_match = configuration_table[s.level].max_lazy;
- s.good_match = configuration_table[s.level].good_length;
- s.nice_match = configuration_table[s.level].nice_length;
- s.max_chain_length = configuration_table[s.level].max_chain;
-
- s.strstart = 0;
- s.block_start = 0;
- s.lookahead = 0;
- s.insert = 0;
- s.match_length = s.prev_length = MIN_MATCH - 1;
- s.match_available = 0;
- s.ins_h = 0;
-}
-
-
-function DeflateState() {
- this.strm = null; /* pointer back to this zlib stream */
- this.status = 0; /* as the name implies */
- this.pending_buf = null; /* output still pending */
- this.pending_buf_size = 0; /* size of pending_buf */
- this.pending_out = 0; /* next pending byte to output to the stream */
- this.pending = 0; /* nb of bytes in the pending buffer */
- this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */
- this.gzhead = null; /* gzip header information to write */
- this.gzindex = 0; /* where in extra, name, or comment */
- this.method = Z_DEFLATED; /* can only be DEFLATED */
- this.last_flush = -1; /* value of flush param for previous deflate call */
-
- this.w_size = 0; /* LZ77 window size (32K by default) */
- this.w_bits = 0; /* log2(w_size) (8..16) */
- this.w_mask = 0; /* w_size - 1 */
-
- this.window = null;
- /* Sliding window. Input bytes are read into the second half of the window,
- * and move to the first half later to keep a dictionary of at least wSize
- * bytes. With this organization, matches are limited to a distance of
- * wSize-MAX_MATCH bytes, but this ensures that IO is always
- * performed with a length multiple of the block size.
- */
-
- this.window_size = 0;
- /* Actual size of window: 2*wSize, except when the user input buffer
- * is directly used as sliding window.
- */
-
- this.prev = null;
- /* Link to older string with same hash index. To limit the size of this
- * array to 64K, this link is maintained only for the last 32K strings.
- * An index in this array is thus a window index modulo 32K.
- */
-
- this.head = null; /* Heads of the hash chains or NIL. */
-
- this.ins_h = 0; /* hash index of string to be inserted */
- this.hash_size = 0; /* number of elements in hash table */
- this.hash_bits = 0; /* log2(hash_size) */
- this.hash_mask = 0; /* hash_size-1 */
-
- this.hash_shift = 0;
- /* Number of bits by which ins_h must be shifted at each input
- * step. It must be such that after MIN_MATCH steps, the oldest
- * byte no longer takes part in the hash key, that is:
- * hash_shift * MIN_MATCH >= hash_bits
- */
-
- this.block_start = 0;
- /* Window position at the beginning of the current output block. Gets
- * negative when the window is moved backwards.
- */
-
- this.match_length = 0; /* length of best match */
- this.prev_match = 0; /* previous match */
- this.match_available = 0; /* set if previous match exists */
- this.strstart = 0; /* start of string to insert */
- this.match_start = 0; /* start of matching string */
- this.lookahead = 0; /* number of valid bytes ahead in window */
-
- this.prev_length = 0;
- /* Length of the best match at previous step. Matches not greater than this
- * are discarded. This is used in the lazy match evaluation.
- */
-
- this.max_chain_length = 0;
- /* To speed up deflation, hash chains are never searched beyond this
- * length. A higher limit improves compression ratio but degrades the
- * speed.
- */
-
- this.max_lazy_match = 0;
- /* Attempt to find a better match only when the current match is strictly
- * smaller than this value. This mechanism is used only for compression
- * levels >= 4.
- */
- // That's alias to max_lazy_match, don't use directly
- //this.max_insert_length = 0;
- /* Insert new strings in the hash table only if the match length is not
- * greater than this length. This saves time but degrades compression.
- * max_insert_length is used only for compression levels <= 3.
- */
-
- this.level = 0; /* compression level (1..9) */
- this.strategy = 0; /* favor or force Huffman coding*/
-
- this.good_match = 0;
- /* Use a faster search when the previous match is longer than this */
-
- this.nice_match = 0; /* Stop searching when current match exceeds this */
-
- /* used by trees.c: */
-
- /* Didn't use ct_data typedef below to suppress compiler warning */
-
- // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
- // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
- // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
-
- // Use flat array of DOUBLE size, with interleaved fata,
- // because JS does not support effective
- this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);
- this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);
- this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);
- zero(this.dyn_ltree);
- zero(this.dyn_dtree);
- zero(this.bl_tree);
-
- this.l_desc = null; /* desc. for literal tree */
- this.d_desc = null; /* desc. for distance tree */
- this.bl_desc = null; /* desc. for bit length tree */
-
- //ush bl_count[MAX_BITS+1];
- this.bl_count = new utils.Buf16(MAX_BITS + 1);
- /* number of codes at each bit length for an optimal tree */
-
- //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
- this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */
- zero(this.heap);
-
- this.heap_len = 0; /* number of elements in the heap */
- this.heap_max = 0; /* element of largest frequency */
- /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
- * The same heap array is used to build all trees.
- */
-
- this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];
- zero(this.depth);
- /* Depth of each subtree used as tie breaker for trees of equal frequency
- */
-
- this.l_buf = 0; /* buffer index for literals or lengths */
-
- this.lit_bufsize = 0;
- /* Size of match buffer for literals/lengths. There are 4 reasons for
- * limiting lit_bufsize to 64K:
- * - frequencies can be kept in 16 bit counters
- * - if compression is not successful for the first block, all input
- * data is still in the window so we can still emit a stored block even
- * when input comes from standard input. (This can also be done for
- * all blocks if lit_bufsize is not greater than 32K.)
- * - if compression is not successful for a file smaller than 64K, we can
- * even emit a stored file instead of a stored block (saving 5 bytes).
- * This is applicable only for zip (not gzip or zlib).
- * - creating new Huffman trees less frequently may not provide fast
- * adaptation to changes in the input data statistics. (Take for
- * example a binary file with poorly compressible code followed by
- * a highly compressible string table.) Smaller buffer sizes give
- * fast adaptation but have of course the overhead of transmitting
- * trees more frequently.
- * - I can't count above 4
- */
-
- this.last_lit = 0; /* running index in l_buf */
-
- this.d_buf = 0;
- /* Buffer index for distances. To simplify the code, d_buf and l_buf have
- * the same number of elements. To use different lengths, an extra flag
- * array would be necessary.
- */
-
- this.opt_len = 0; /* bit length of current block with optimal trees */
- this.static_len = 0; /* bit length of current block with static trees */
- this.matches = 0; /* number of string matches in current block */
- this.insert = 0; /* bytes at end of window left to insert */
-
-
- this.bi_buf = 0;
- /* Output buffer. bits are inserted starting at the bottom (least
- * significant bits).
- */
- this.bi_valid = 0;
- /* Number of valid bits in bi_buf. All bits above the last valid bit
- * are always zero.
- */
-
- // Used for window memory init. We safely ignore it for JS. That makes
- // sense only for pointers and memory check tools.
- //this.high_water = 0;
- /* High water mark offset in window for initialized bytes -- bytes above
- * this are set to zero in order to avoid memory check warnings when
- * longest match routines access bytes past the input. This is then
- * updated to the new high water mark.
- */
-}
-
-
-function deflateResetKeep(strm) {
- var s;
-
- if (!strm || !strm.state) {
- return err(strm, Z_STREAM_ERROR);
- }
-
- strm.total_in = strm.total_out = 0;
- strm.data_type = Z_UNKNOWN;
-
- s = strm.state;
- s.pending = 0;
- s.pending_out = 0;
-
- if (s.wrap < 0) {
- s.wrap = -s.wrap;
- /* was made negative by deflate(..., Z_FINISH); */
- }
- s.status = (s.wrap ? INIT_STATE : BUSY_STATE);
- strm.adler = (s.wrap === 2) ?
- 0 // crc32(0, Z_NULL, 0)
- :
- 1; // adler32(0, Z_NULL, 0)
- s.last_flush = Z_NO_FLUSH;
- trees._tr_init(s);
- return Z_OK;
-}
-
-
-function deflateReset(strm) {
- var ret = deflateResetKeep(strm);
- if (ret === Z_OK) {
- lm_init(strm.state);
- }
- return ret;
-}
-
-
-function deflateSetHeader(strm, head) {
- if (!strm || !strm.state) { return Z_STREAM_ERROR; }
- if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }
- strm.state.gzhead = head;
- return Z_OK;
-}
-
-
-function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
- if (!strm) { // === Z_NULL
- return Z_STREAM_ERROR;
- }
- var wrap = 1;
-
- if (level === Z_DEFAULT_COMPRESSION) {
- level = 6;
- }
-
- if (windowBits < 0) { /* suppress zlib wrapper */
- wrap = 0;
- windowBits = -windowBits;
- }
-
- else if (windowBits > 15) {
- wrap = 2; /* write gzip wrapper instead */
- windowBits -= 16;
- }
-
-
- if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||
- windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
- strategy < 0 || strategy > Z_FIXED) {
- return err(strm, Z_STREAM_ERROR);
- }
-
-
- if (windowBits === 8) {
- windowBits = 9;
- }
- /* until 256-byte window bug fixed */
-
- var s = new DeflateState();
-
- strm.state = s;
- s.strm = strm;
-
- s.wrap = wrap;
- s.gzhead = null;
- s.w_bits = windowBits;
- s.w_size = 1 << s.w_bits;
- s.w_mask = s.w_size - 1;
-
- s.hash_bits = memLevel + 7;
- s.hash_size = 1 << s.hash_bits;
- s.hash_mask = s.hash_size - 1;
- s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);
-
- s.window = new utils.Buf8(s.w_size * 2);
- s.head = new utils.Buf16(s.hash_size);
- s.prev = new utils.Buf16(s.w_size);
-
- // Don't need mem init magic for JS.
- //s.high_water = 0; /* nothing written to s->window yet */
-
- s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */
-
- s.pending_buf_size = s.lit_bufsize * 4;
-
- //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
- //s->pending_buf = (uchf *) overlay;
- s.pending_buf = new utils.Buf8(s.pending_buf_size);
-
- // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)
- //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
- s.d_buf = 1 * s.lit_bufsize;
-
- //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
- s.l_buf = (1 + 2) * s.lit_bufsize;
-
- s.level = level;
- s.strategy = strategy;
- s.method = method;
-
- return deflateReset(strm);
-}
-
-function deflateInit(strm, level) {
- return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
-}
-
-
-function deflate(strm, flush) {
- var old_flush, s;
- var beg, val; // for gzip header write only
-
- if (!strm || !strm.state ||
- flush > Z_BLOCK || flush < 0) {
- return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
- }
-
- s = strm.state;
-
- if (!strm.output ||
- (!strm.input && strm.avail_in !== 0) ||
- (s.status === FINISH_STATE && flush !== Z_FINISH)) {
- return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);
- }
-
- s.strm = strm; /* just in case */
- old_flush = s.last_flush;
- s.last_flush = flush;
-
- /* Write the header */
- if (s.status === INIT_STATE) {
-
- if (s.wrap === 2) { // GZIP header
- strm.adler = 0; //crc32(0L, Z_NULL, 0);
- put_byte(s, 31);
- put_byte(s, 139);
- put_byte(s, 8);
- if (!s.gzhead) { // s->gzhead == Z_NULL
- put_byte(s, 0);
- put_byte(s, 0);
- put_byte(s, 0);
- put_byte(s, 0);
- put_byte(s, 0);
- put_byte(s, s.level === 9 ? 2 :
- (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
- 4 : 0));
- put_byte(s, OS_CODE);
- s.status = BUSY_STATE;
- }
- else {
- put_byte(s, (s.gzhead.text ? 1 : 0) +
- (s.gzhead.hcrc ? 2 : 0) +
- (!s.gzhead.extra ? 0 : 4) +
- (!s.gzhead.name ? 0 : 8) +
- (!s.gzhead.comment ? 0 : 16)
- );
- put_byte(s, s.gzhead.time & 0xff);
- put_byte(s, (s.gzhead.time >> 8) & 0xff);
- put_byte(s, (s.gzhead.time >> 16) & 0xff);
- put_byte(s, (s.gzhead.time >> 24) & 0xff);
- put_byte(s, s.level === 9 ? 2 :
- (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
- 4 : 0));
- put_byte(s, s.gzhead.os & 0xff);
- if (s.gzhead.extra && s.gzhead.extra.length) {
- put_byte(s, s.gzhead.extra.length & 0xff);
- put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);
- }
- if (s.gzhead.hcrc) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
- }
- s.gzindex = 0;
- s.status = EXTRA_STATE;
- }
- }
- else // DEFLATE header
- {
- var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;
- var level_flags = -1;
-
- if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
- level_flags = 0;
- } else if (s.level < 6) {
- level_flags = 1;
- } else if (s.level === 6) {
- level_flags = 2;
- } else {
- level_flags = 3;
- }
- header |= (level_flags << 6);
- if (s.strstart !== 0) { header |= PRESET_DICT; }
- header += 31 - (header % 31);
-
- s.status = BUSY_STATE;
- putShortMSB(s, header);
-
- /* Save the adler32 of the preset dictionary: */
- if (s.strstart !== 0) {
- putShortMSB(s, strm.adler >>> 16);
- putShortMSB(s, strm.adler & 0xffff);
- }
- strm.adler = 1; // adler32(0L, Z_NULL, 0);
- }
- }
-
-//#ifdef GZIP
- if (s.status === EXTRA_STATE) {
- if (s.gzhead.extra/* != Z_NULL*/) {
- beg = s.pending; /* start of bytes to update crc */
-
- while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {
- if (s.pending === s.pending_buf_size) {
- if (s.gzhead.hcrc && s.pending > beg) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
- }
- flush_pending(strm);
- beg = s.pending;
- if (s.pending === s.pending_buf_size) {
- break;
- }
- }
- put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);
- s.gzindex++;
- }
- if (s.gzhead.hcrc && s.pending > beg) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
- }
- if (s.gzindex === s.gzhead.extra.length) {
- s.gzindex = 0;
- s.status = NAME_STATE;
- }
- }
- else {
- s.status = NAME_STATE;
- }
- }
- if (s.status === NAME_STATE) {
- if (s.gzhead.name/* != Z_NULL*/) {
- beg = s.pending; /* start of bytes to update crc */
- //int val;
-
- do {
- if (s.pending === s.pending_buf_size) {
- if (s.gzhead.hcrc && s.pending > beg) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
- }
- flush_pending(strm);
- beg = s.pending;
- if (s.pending === s.pending_buf_size) {
- val = 1;
- break;
- }
- }
- // JS specific: little magic to add zero terminator to end of string
- if (s.gzindex < s.gzhead.name.length) {
- val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;
- } else {
- val = 0;
- }
- put_byte(s, val);
- } while (val !== 0);
-
- if (s.gzhead.hcrc && s.pending > beg) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
- }
- if (val === 0) {
- s.gzindex = 0;
- s.status = COMMENT_STATE;
- }
- }
- else {
- s.status = COMMENT_STATE;
- }
- }
- if (s.status === COMMENT_STATE) {
- if (s.gzhead.comment/* != Z_NULL*/) {
- beg = s.pending; /* start of bytes to update crc */
- //int val;
-
- do {
- if (s.pending === s.pending_buf_size) {
- if (s.gzhead.hcrc && s.pending > beg) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
- }
- flush_pending(strm);
- beg = s.pending;
- if (s.pending === s.pending_buf_size) {
- val = 1;
- break;
- }
- }
- // JS specific: little magic to add zero terminator to end of string
- if (s.gzindex < s.gzhead.comment.length) {
- val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;
- } else {
- val = 0;
- }
- put_byte(s, val);
- } while (val !== 0);
-
- if (s.gzhead.hcrc && s.pending > beg) {
- strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
- }
- if (val === 0) {
- s.status = HCRC_STATE;
- }
- }
- else {
- s.status = HCRC_STATE;
- }
- }
- if (s.status === HCRC_STATE) {
- if (s.gzhead.hcrc) {
- if (s.pending + 2 > s.pending_buf_size) {
- flush_pending(strm);
- }
- if (s.pending + 2 <= s.pending_buf_size) {
- put_byte(s, strm.adler & 0xff);
- put_byte(s, (strm.adler >> 8) & 0xff);
- strm.adler = 0; //crc32(0L, Z_NULL, 0);
- s.status = BUSY_STATE;
- }
- }
- else {
- s.status = BUSY_STATE;
- }
- }
-//#endif
-
- /* Flush as much pending output as possible */
- if (s.pending !== 0) {
- flush_pending(strm);
- if (strm.avail_out === 0) {
- /* Since avail_out is 0, deflate will be called again with
- * more output space, but possibly with both pending and
- * avail_in equal to zero. There won't be anything to do,
- * but this is not an error situation so make sure we
- * return OK instead of BUF_ERROR at next call of deflate:
- */
- s.last_flush = -1;
- return Z_OK;
- }
-
- /* Make sure there is something to do and avoid duplicate consecutive
- * flushes. For repeated and useless calls with Z_FINISH, we keep
- * returning Z_STREAM_END instead of Z_BUF_ERROR.
- */
- } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&
- flush !== Z_FINISH) {
- return err(strm, Z_BUF_ERROR);
- }
-
- /* User must not provide more input after the first FINISH: */
- if (s.status === FINISH_STATE && strm.avail_in !== 0) {
- return err(strm, Z_BUF_ERROR);
- }
-
- /* Start a new block or continue the current one.
- */
- if (strm.avail_in !== 0 || s.lookahead !== 0 ||
- (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {
- var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :
- (s.strategy === Z_RLE ? deflate_rle(s, flush) :
- configuration_table[s.level].func(s, flush));
-
- if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {
- s.status = FINISH_STATE;
- }
- if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {
- if (strm.avail_out === 0) {
- s.last_flush = -1;
- /* avoid BUF_ERROR next call, see above */
- }
- return Z_OK;
- /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
- * of deflate should use the same flush parameter to make sure
- * that the flush is complete. So we don't have to output an
- * empty block here, this will be done at next call. This also
- * ensures that for a very small output buffer, we emit at most
- * one empty block.
- */
- }
- if (bstate === BS_BLOCK_DONE) {
- if (flush === Z_PARTIAL_FLUSH) {
- trees._tr_align(s);
- }
- else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */
-
- trees._tr_stored_block(s, 0, 0, false);
- /* For a full flush, this empty block will be recognized
- * as a special marker by inflate_sync().
- */
- if (flush === Z_FULL_FLUSH) {
- /*** CLEAR_HASH(s); ***/ /* forget history */
- zero(s.head); // Fill with NIL (= 0);
-
- if (s.lookahead === 0) {
- s.strstart = 0;
- s.block_start = 0;
- s.insert = 0;
- }
- }
- }
- flush_pending(strm);
- if (strm.avail_out === 0) {
- s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */
- return Z_OK;
- }
- }
- }
- //Assert(strm->avail_out > 0, "bug2");
- //if (strm.avail_out <= 0) { throw new Error("bug2");}
-
- if (flush !== Z_FINISH) { return Z_OK; }
- if (s.wrap <= 0) { return Z_STREAM_END; }
-
- /* Write the trailer */
- if (s.wrap === 2) {
- put_byte(s, strm.adler & 0xff);
- put_byte(s, (strm.adler >> 8) & 0xff);
- put_byte(s, (strm.adler >> 16) & 0xff);
- put_byte(s, (strm.adler >> 24) & 0xff);
- put_byte(s, strm.total_in & 0xff);
- put_byte(s, (strm.total_in >> 8) & 0xff);
- put_byte(s, (strm.total_in >> 16) & 0xff);
- put_byte(s, (strm.total_in >> 24) & 0xff);
- }
- else
- {
- putShortMSB(s, strm.adler >>> 16);
- putShortMSB(s, strm.adler & 0xffff);
- }
-
- flush_pending(strm);
- /* If avail_out is zero, the application will call deflate again
- * to flush the rest.
- */
- if (s.wrap > 0) { s.wrap = -s.wrap; }
- /* write the trailer only once! */
- return s.pending !== 0 ? Z_OK : Z_STREAM_END;
-}
-
-function deflateEnd(strm) {
- var status;
-
- if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
- return Z_STREAM_ERROR;
- }
-
- status = strm.state.status;
- if (status !== INIT_STATE &&
- status !== EXTRA_STATE &&
- status !== NAME_STATE &&
- status !== COMMENT_STATE &&
- status !== HCRC_STATE &&
- status !== BUSY_STATE &&
- status !== FINISH_STATE
- ) {
- return err(strm, Z_STREAM_ERROR);
- }
-
- strm.state = null;
-
- return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
-}
-
-
-/* =========================================================================
- * Initializes the compression dictionary from the given byte
- * sequence without producing any compressed output.
- */
-function deflateSetDictionary(strm, dictionary) {
- var dictLength = dictionary.length;
-
- var s;
- var str, n;
- var wrap;
- var avail;
- var next;
- var input;
- var tmpDict;
-
- if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
- return Z_STREAM_ERROR;
- }
-
- s = strm.state;
- wrap = s.wrap;
-
- if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {
- return Z_STREAM_ERROR;
- }
-
- /* when using zlib wrappers, compute Adler-32 for provided dictionary */
- if (wrap === 1) {
- /* adler32(strm->adler, dictionary, dictLength); */
- strm.adler = adler32(strm.adler, dictionary, dictLength, 0);
- }
-
- s.wrap = 0; /* avoid computing Adler-32 in read_buf */
-
- /* if dictionary would fill window, just replace the history */
- if (dictLength >= s.w_size) {
- if (wrap === 0) { /* already empty otherwise */
- /*** CLEAR_HASH(s); ***/
- zero(s.head); // Fill with NIL (= 0);
- s.strstart = 0;
- s.block_start = 0;
- s.insert = 0;
- }
- /* use the tail */
- // dictionary = dictionary.slice(dictLength - s.w_size);
- tmpDict = new utils.Buf8(s.w_size);
- utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);
- dictionary = tmpDict;
- dictLength = s.w_size;
- }
- /* insert dictionary into window and hash */
- avail = strm.avail_in;
- next = strm.next_in;
- input = strm.input;
- strm.avail_in = dictLength;
- strm.next_in = 0;
- strm.input = dictionary;
- fill_window(s);
- while (s.lookahead >= MIN_MATCH) {
- str = s.strstart;
- n = s.lookahead - (MIN_MATCH - 1);
- do {
- /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
- s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
-
- s.prev[str & s.w_mask] = s.head[s.ins_h];
-
- s.head[s.ins_h] = str;
- str++;
- } while (--n);
- s.strstart = str;
- s.lookahead = MIN_MATCH - 1;
- fill_window(s);
- }
- s.strstart += s.lookahead;
- s.block_start = s.strstart;
- s.insert = s.lookahead;
- s.lookahead = 0;
- s.match_length = s.prev_length = MIN_MATCH - 1;
- s.match_available = 0;
- strm.next_in = next;
- strm.input = input;
- strm.avail_in = avail;
- s.wrap = wrap;
- return Z_OK;
-}
-
-
-exports.deflateInit = deflateInit;
-exports.deflateInit2 = deflateInit2;
-exports.deflateReset = deflateReset;
-exports.deflateResetKeep = deflateResetKeep;
-exports.deflateSetHeader = deflateSetHeader;
-exports.deflate = deflate;
-exports.deflateEnd = deflateEnd;
-exports.deflateSetDictionary = deflateSetDictionary;
-exports.deflateInfo = 'pako deflate (from Nodeca project)';
-
-/* Not implemented
-exports.deflateBound = deflateBound;
-exports.deflateCopy = deflateCopy;
-exports.deflateParams = deflateParams;
-exports.deflatePending = deflatePending;
-exports.deflatePrime = deflatePrime;
-exports.deflateTune = deflateTune;
-*/
-
-},{"../utils/common":35,"./adler32":36,"./crc32":38,"./messages":43,"./trees":44}],40:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-// See state defs from inflate.js
-var BAD = 30; /* got a data error -- remain here until reset */
-var TYPE = 12; /* i: waiting for type bits, including last-flag bit */
-
-/*
- Decode literal, length, and distance codes and write out the resulting
- literal and match bytes until either not enough input or output is
- available, an end-of-block is encountered, or a data error is encountered.
- When large enough input and output buffers are supplied to inflate(), for
- example, a 16K input buffer and a 64K output buffer, more than 95% of the
- inflate execution time is spent in this routine.
-
- Entry assumptions:
-
- state.mode === LEN
- strm.avail_in >= 6
- strm.avail_out >= 258
- start >= strm.avail_out
- state.bits < 8
-
- On return, state.mode is one of:
-
- LEN -- ran out of enough output space or enough available input
- TYPE -- reached end of block code, inflate() to interpret next block
- BAD -- error in block data
-
- Notes:
-
- - The maximum input bits used by a length/distance pair is 15 bits for the
- length code, 5 bits for the length extra, 15 bits for the distance code,
- and 13 bits for the distance extra. This totals 48 bits, or six bytes.
- Therefore if strm.avail_in >= 6, then there is enough input to avoid
- checking for available input while decoding.
-
- - The maximum bytes that a single length/distance pair can output is 258
- bytes, which is the maximum length that can be coded. inflate_fast()
- requires strm.avail_out >= 258 for each loop to avoid checking for
- output space.
- */
-module.exports = function inflate_fast(strm, start) {
- var state;
- var _in; /* local strm.input */
- var last; /* have enough input while in < last */
- var _out; /* local strm.output */
- var beg; /* inflate()'s initial strm.output */
- var end; /* while out < end, enough space available */
-//#ifdef INFLATE_STRICT
- var dmax; /* maximum distance from zlib header */
-//#endif
- var wsize; /* window size or zero if not using window */
- var whave; /* valid bytes in the window */
- var wnext; /* window write index */
- // Use `s_window` instead `window`, avoid conflict with instrumentation tools
- var s_window; /* allocated sliding window, if wsize != 0 */
- var hold; /* local strm.hold */
- var bits; /* local strm.bits */
- var lcode; /* local strm.lencode */
- var dcode; /* local strm.distcode */
- var lmask; /* mask for first level of length codes */
- var dmask; /* mask for first level of distance codes */
- var here; /* retrieved table entry */
- var op; /* code bits, operation, extra bits, or */
- /* window position, window bytes to copy */
- var len; /* match length, unused bytes */
- var dist; /* match distance */
- var from; /* where to copy match from */
- var from_source;
-
-
- var input, output; // JS specific, because we have no pointers
-
- /* copy state to local variables */
- state = strm.state;
- //here = state.here;
- _in = strm.next_in;
- input = strm.input;
- last = _in + (strm.avail_in - 5);
- _out = strm.next_out;
- output = strm.output;
- beg = _out - (start - strm.avail_out);
- end = _out + (strm.avail_out - 257);
-//#ifdef INFLATE_STRICT
- dmax = state.dmax;
-//#endif
- wsize = state.wsize;
- whave = state.whave;
- wnext = state.wnext;
- s_window = state.window;
- hold = state.hold;
- bits = state.bits;
- lcode = state.lencode;
- dcode = state.distcode;
- lmask = (1 << state.lenbits) - 1;
- dmask = (1 << state.distbits) - 1;
-
-
- /* decode literals and length/distances until end-of-block or not enough
- input data or output space */
-
- top:
- do {
- if (bits < 15) {
- hold += input[_in++] << bits;
- bits += 8;
- hold += input[_in++] << bits;
- bits += 8;
- }
-
- here = lcode[hold & lmask];
-
- dolen:
- for (;;) { // Goto emulation
- op = here >>> 24/*here.bits*/;
- hold >>>= op;
- bits -= op;
- op = (here >>> 16) & 0xff/*here.op*/;
- if (op === 0) { /* literal */
- //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
- // "inflate: literal '%c'\n" :
- // "inflate: literal 0x%02x\n", here.val));
- output[_out++] = here & 0xffff/*here.val*/;
- }
- else if (op & 16) { /* length base */
- len = here & 0xffff/*here.val*/;
- op &= 15; /* number of extra bits */
- if (op) {
- if (bits < op) {
- hold += input[_in++] << bits;
- bits += 8;
- }
- len += hold & ((1 << op) - 1);
- hold >>>= op;
- bits -= op;
- }
- //Tracevv((stderr, "inflate: length %u\n", len));
- if (bits < 15) {
- hold += input[_in++] << bits;
- bits += 8;
- hold += input[_in++] << bits;
- bits += 8;
- }
- here = dcode[hold & dmask];
-
- dodist:
- for (;;) { // goto emulation
- op = here >>> 24/*here.bits*/;
- hold >>>= op;
- bits -= op;
- op = (here >>> 16) & 0xff/*here.op*/;
-
- if (op & 16) { /* distance base */
- dist = here & 0xffff/*here.val*/;
- op &= 15; /* number of extra bits */
- if (bits < op) {
- hold += input[_in++] << bits;
- bits += 8;
- if (bits < op) {
- hold += input[_in++] << bits;
- bits += 8;
- }
- }
- dist += hold & ((1 << op) - 1);
-//#ifdef INFLATE_STRICT
- if (dist > dmax) {
- strm.msg = 'invalid distance too far back';
- state.mode = BAD;
- break top;
- }
-//#endif
- hold >>>= op;
- bits -= op;
- //Tracevv((stderr, "inflate: distance %u\n", dist));
- op = _out - beg; /* max distance in output */
- if (dist > op) { /* see if copy from window */
- op = dist - op; /* distance back in window */
- if (op > whave) {
- if (state.sane) {
- strm.msg = 'invalid distance too far back';
- state.mode = BAD;
- break top;
- }
-
-// (!) This block is disabled in zlib defaults,
-// don't enable it for binary compatibility
-//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
-// if (len <= op - whave) {
-// do {
-// output[_out++] = 0;
-// } while (--len);
-// continue top;
-// }
-// len -= op - whave;
-// do {
-// output[_out++] = 0;
-// } while (--op > whave);
-// if (op === 0) {
-// from = _out - dist;
-// do {
-// output[_out++] = output[from++];
-// } while (--len);
-// continue top;
-// }
-//#endif
- }
- from = 0; // window index
- from_source = s_window;
- if (wnext === 0) { /* very common case */
- from += wsize - op;
- if (op < len) { /* some from window */
- len -= op;
- do {
- output[_out++] = s_window[from++];
- } while (--op);
- from = _out - dist; /* rest from output */
- from_source = output;
- }
- }
- else if (wnext < op) { /* wrap around window */
- from += wsize + wnext - op;
- op -= wnext;
- if (op < len) { /* some from end of window */
- len -= op;
- do {
- output[_out++] = s_window[from++];
- } while (--op);
- from = 0;
- if (wnext < len) { /* some from start of window */
- op = wnext;
- len -= op;
- do {
- output[_out++] = s_window[from++];
- } while (--op);
- from = _out - dist; /* rest from output */
- from_source = output;
- }
- }
- }
- else { /* contiguous in window */
- from += wnext - op;
- if (op < len) { /* some from window */
- len -= op;
- do {
- output[_out++] = s_window[from++];
- } while (--op);
- from = _out - dist; /* rest from output */
- from_source = output;
- }
- }
- while (len > 2) {
- output[_out++] = from_source[from++];
- output[_out++] = from_source[from++];
- output[_out++] = from_source[from++];
- len -= 3;
- }
- if (len) {
- output[_out++] = from_source[from++];
- if (len > 1) {
- output[_out++] = from_source[from++];
- }
- }
- }
- else {
- from = _out - dist; /* copy direct from output */
- do { /* minimum length is three */
- output[_out++] = output[from++];
- output[_out++] = output[from++];
- output[_out++] = output[from++];
- len -= 3;
- } while (len > 2);
- if (len) {
- output[_out++] = output[from++];
- if (len > 1) {
- output[_out++] = output[from++];
- }
- }
- }
- }
- else if ((op & 64) === 0) { /* 2nd level distance code */
- here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
- continue dodist;
- }
- else {
- strm.msg = 'invalid distance code';
- state.mode = BAD;
- break top;
- }
-
- break; // need to emulate goto via "continue"
- }
- }
- else if ((op & 64) === 0) { /* 2nd level length code */
- here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
- continue dolen;
- }
- else if (op & 32) { /* end-of-block */
- //Tracevv((stderr, "inflate: end of block\n"));
- state.mode = TYPE;
- break top;
- }
- else {
- strm.msg = 'invalid literal/length code';
- state.mode = BAD;
- break top;
- }
-
- break; // need to emulate goto via "continue"
- }
- } while (_in < last && _out < end);
-
- /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
- len = bits >> 3;
- _in -= len;
- bits -= len << 3;
- hold &= (1 << bits) - 1;
-
- /* update state and return */
- strm.next_in = _in;
- strm.next_out = _out;
- strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
- strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
- state.hold = hold;
- state.bits = bits;
- return;
-};
-
-},{}],41:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-var utils = require('../utils/common');
-var adler32 = require('./adler32');
-var crc32 = require('./crc32');
-var inflate_fast = require('./inffast');
-var inflate_table = require('./inftrees');
-
-var CODES = 0;
-var LENS = 1;
-var DISTS = 2;
-
-/* Public constants ==========================================================*/
-/* ===========================================================================*/
-
-
-/* Allowed flush values; see deflate() and inflate() below for details */
-//var Z_NO_FLUSH = 0;
-//var Z_PARTIAL_FLUSH = 1;
-//var Z_SYNC_FLUSH = 2;
-//var Z_FULL_FLUSH = 3;
-var Z_FINISH = 4;
-var Z_BLOCK = 5;
-var Z_TREES = 6;
-
-
-/* Return codes for the compression/decompression functions. Negative values
- * are errors, positive values are used for special but normal events.
- */
-var Z_OK = 0;
-var Z_STREAM_END = 1;
-var Z_NEED_DICT = 2;
-//var Z_ERRNO = -1;
-var Z_STREAM_ERROR = -2;
-var Z_DATA_ERROR = -3;
-var Z_MEM_ERROR = -4;
-var Z_BUF_ERROR = -5;
-//var Z_VERSION_ERROR = -6;
-
-/* The deflate compression method */
-var Z_DEFLATED = 8;
-
-
-/* STATES ====================================================================*/
-/* ===========================================================================*/
-
-
-var HEAD = 1; /* i: waiting for magic header */
-var FLAGS = 2; /* i: waiting for method and flags (gzip) */
-var TIME = 3; /* i: waiting for modification time (gzip) */
-var OS = 4; /* i: waiting for extra flags and operating system (gzip) */
-var EXLEN = 5; /* i: waiting for extra length (gzip) */
-var EXTRA = 6; /* i: waiting for extra bytes (gzip) */
-var NAME = 7; /* i: waiting for end of file name (gzip) */
-var COMMENT = 8; /* i: waiting for end of comment (gzip) */
-var HCRC = 9; /* i: waiting for header crc (gzip) */
-var DICTID = 10; /* i: waiting for dictionary check value */
-var DICT = 11; /* waiting for inflateSetDictionary() call */
-var TYPE = 12; /* i: waiting for type bits, including last-flag bit */
-var TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */
-var STORED = 14; /* i: waiting for stored size (length and complement) */
-var COPY_ = 15; /* i/o: same as COPY below, but only first time in */
-var COPY = 16; /* i/o: waiting for input or output to copy stored block */
-var TABLE = 17; /* i: waiting for dynamic block table lengths */
-var LENLENS = 18; /* i: waiting for code length code lengths */
-var CODELENS = 19; /* i: waiting for length/lit and distance code lengths */
-var LEN_ = 20; /* i: same as LEN below, but only first time in */
-var LEN = 21; /* i: waiting for length/lit/eob code */
-var LENEXT = 22; /* i: waiting for length extra bits */
-var DIST = 23; /* i: waiting for distance code */
-var DISTEXT = 24; /* i: waiting for distance extra bits */
-var MATCH = 25; /* o: waiting for output space to copy string */
-var LIT = 26; /* o: waiting for output space to write literal */
-var CHECK = 27; /* i: waiting for 32-bit check value */
-var LENGTH = 28; /* i: waiting for 32-bit length (gzip) */
-var DONE = 29; /* finished check, done -- remain here until reset */
-var BAD = 30; /* got a data error -- remain here until reset */
-var MEM = 31; /* got an inflate() memory error -- remain here until reset */
-var SYNC = 32; /* looking for synchronization bytes to restart inflate() */
-
-/* ===========================================================================*/
-
-
-
-var ENOUGH_LENS = 852;
-var ENOUGH_DISTS = 592;
-//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
-
-var MAX_WBITS = 15;
-/* 32K LZ77 window */
-var DEF_WBITS = MAX_WBITS;
-
-
-function zswap32(q) {
- return (((q >>> 24) & 0xff) +
- ((q >>> 8) & 0xff00) +
- ((q & 0xff00) << 8) +
- ((q & 0xff) << 24));
-}
-
-
-function InflateState() {
- this.mode = 0; /* current inflate mode */
- this.last = false; /* true if processing last block */
- this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */
- this.havedict = false; /* true if dictionary provided */
- this.flags = 0; /* gzip header method and flags (0 if zlib) */
- this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */
- this.check = 0; /* protected copy of check value */
- this.total = 0; /* protected copy of output count */
- // TODO: may be {}
- this.head = null; /* where to save gzip header information */
-
- /* sliding window */
- this.wbits = 0; /* log base 2 of requested window size */
- this.wsize = 0; /* window size or zero if not using window */
- this.whave = 0; /* valid bytes in the window */
- this.wnext = 0; /* window write index */
- this.window = null; /* allocated sliding window, if needed */
-
- /* bit accumulator */
- this.hold = 0; /* input bit accumulator */
- this.bits = 0; /* number of bits in "in" */
-
- /* for string and stored block copying */
- this.length = 0; /* literal or length of data to copy */
- this.offset = 0; /* distance back to copy string from */
-
- /* for table and code decoding */
- this.extra = 0; /* extra bits needed */
-
- /* fixed and dynamic code tables */
- this.lencode = null; /* starting table for length/literal codes */
- this.distcode = null; /* starting table for distance codes */
- this.lenbits = 0; /* index bits for lencode */
- this.distbits = 0; /* index bits for distcode */
-
- /* dynamic table building */
- this.ncode = 0; /* number of code length code lengths */
- this.nlen = 0; /* number of length code lengths */
- this.ndist = 0; /* number of distance code lengths */
- this.have = 0; /* number of code lengths in lens[] */
- this.next = null; /* next available space in codes[] */
-
- this.lens = new utils.Buf16(320); /* temporary storage for code lengths */
- this.work = new utils.Buf16(288); /* work area for code table building */
-
- /*
- because we don't have pointers in js, we use lencode and distcode directly
- as buffers so we don't need codes
- */
- //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */
- this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */
- this.distdyn = null; /* dynamic table for distance codes (JS specific) */
- this.sane = 0; /* if false, allow invalid distance too far */
- this.back = 0; /* bits back of last unprocessed length/lit */
- this.was = 0; /* initial length of match */
-}
-
-function inflateResetKeep(strm) {
- var state;
-
- if (!strm || !strm.state) { return Z_STREAM_ERROR; }
- state = strm.state;
- strm.total_in = strm.total_out = state.total = 0;
- strm.msg = ''; /*Z_NULL*/
- if (state.wrap) { /* to support ill-conceived Java test suite */
- strm.adler = state.wrap & 1;
- }
- state.mode = HEAD;
- state.last = 0;
- state.havedict = 0;
- state.dmax = 32768;
- state.head = null/*Z_NULL*/;
- state.hold = 0;
- state.bits = 0;
- //state.lencode = state.distcode = state.next = state.codes;
- state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);
- state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);
-
- state.sane = 1;
- state.back = -1;
- //Tracev((stderr, "inflate: reset\n"));
- return Z_OK;
-}
-
-function inflateReset(strm) {
- var state;
-
- if (!strm || !strm.state) { return Z_STREAM_ERROR; }
- state = strm.state;
- state.wsize = 0;
- state.whave = 0;
- state.wnext = 0;
- return inflateResetKeep(strm);
-
-}
-
-function inflateReset2(strm, windowBits) {
- var wrap;
- var state;
-
- /* get the state */
- if (!strm || !strm.state) { return Z_STREAM_ERROR; }
- state = strm.state;
-
- /* extract wrap request from windowBits parameter */
- if (windowBits < 0) {
- wrap = 0;
- windowBits = -windowBits;
- }
- else {
- wrap = (windowBits >> 4) + 1;
- if (windowBits < 48) {
- windowBits &= 15;
- }
- }
-
- /* set number of window bits, free window if different */
- if (windowBits && (windowBits < 8 || windowBits > 15)) {
- return Z_STREAM_ERROR;
- }
- if (state.window !== null && state.wbits !== windowBits) {
- state.window = null;
- }
-
- /* update state and reset the rest of it */
- state.wrap = wrap;
- state.wbits = windowBits;
- return inflateReset(strm);
-}
-
-function inflateInit2(strm, windowBits) {
- var ret;
- var state;
-
- if (!strm) { return Z_STREAM_ERROR; }
- //strm.msg = Z_NULL; /* in case we return an error */
-
- state = new InflateState();
-
- //if (state === Z_NULL) return Z_MEM_ERROR;
- //Tracev((stderr, "inflate: allocated\n"));
- strm.state = state;
- state.window = null/*Z_NULL*/;
- ret = inflateReset2(strm, windowBits);
- if (ret !== Z_OK) {
- strm.state = null/*Z_NULL*/;
- }
- return ret;
-}
-
-function inflateInit(strm) {
- return inflateInit2(strm, DEF_WBITS);
-}
-
-
-/*
- Return state with length and distance decoding tables and index sizes set to
- fixed code decoding. Normally this returns fixed tables from inffixed.h.
- If BUILDFIXED is defined, then instead this routine builds the tables the
- first time it's called, and returns those tables the first time and
- thereafter. This reduces the size of the code by about 2K bytes, in
- exchange for a little execution time. However, BUILDFIXED should not be
- used for threaded applications, since the rewriting of the tables and virgin
- may not be thread-safe.
- */
-var virgin = true;
-
-var lenfix, distfix; // We have no pointers in JS, so keep tables separate
-
-function fixedtables(state) {
- /* build fixed huffman tables if first call (may not be thread safe) */
- if (virgin) {
- var sym;
-
- lenfix = new utils.Buf32(512);
- distfix = new utils.Buf32(32);
-
- /* literal/length table */
- sym = 0;
- while (sym < 144) { state.lens[sym++] = 8; }
- while (sym < 256) { state.lens[sym++] = 9; }
- while (sym < 280) { state.lens[sym++] = 7; }
- while (sym < 288) { state.lens[sym++] = 8; }
-
- inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });
-
- /* distance table */
- sym = 0;
- while (sym < 32) { state.lens[sym++] = 5; }
-
- inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });
-
- /* do this just once */
- virgin = false;
- }
-
- state.lencode = lenfix;
- state.lenbits = 9;
- state.distcode = distfix;
- state.distbits = 5;
-}
-
-
-/*
- Update the window with the last wsize (normally 32K) bytes written before
- returning. If window does not exist yet, create it. This is only called
- when a window is already in use, or when output has been written during this
- inflate call, but the end of the deflate stream has not been reached yet.
- It is also called to create a window for dictionary data when a dictionary
- is loaded.
-
- Providing output buffers larger than 32K to inflate() should provide a speed
- advantage, since only the last 32K of output is copied to the sliding window
- upon return from inflate(), and since all distances after the first 32K of
- output will fall in the output data, making match copies simpler and faster.
- The advantage may be dependent on the size of the processor's data caches.
- */
-function updatewindow(strm, src, end, copy) {
- var dist;
- var state = strm.state;
-
- /* if it hasn't been done already, allocate space for the window */
- if (state.window === null) {
- state.wsize = 1 << state.wbits;
- state.wnext = 0;
- state.whave = 0;
-
- state.window = new utils.Buf8(state.wsize);
- }
-
- /* copy state->wsize or less output bytes into the circular window */
- if (copy >= state.wsize) {
- utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);
- state.wnext = 0;
- state.whave = state.wsize;
- }
- else {
- dist = state.wsize - state.wnext;
- if (dist > copy) {
- dist = copy;
- }
- //zmemcpy(state->window + state->wnext, end - copy, dist);
- utils.arraySet(state.window, src, end - copy, dist, state.wnext);
- copy -= dist;
- if (copy) {
- //zmemcpy(state->window, end - copy, copy);
- utils.arraySet(state.window, src, end - copy, copy, 0);
- state.wnext = copy;
- state.whave = state.wsize;
- }
- else {
- state.wnext += dist;
- if (state.wnext === state.wsize) { state.wnext = 0; }
- if (state.whave < state.wsize) { state.whave += dist; }
- }
- }
- return 0;
-}
-
-function inflate(strm, flush) {
- var state;
- var input, output; // input/output buffers
- var next; /* next input INDEX */
- var put; /* next output INDEX */
- var have, left; /* available input and output */
- var hold; /* bit buffer */
- var bits; /* bits in bit buffer */
- var _in, _out; /* save starting available input and output */
- var copy; /* number of stored or match bytes to copy */
- var from; /* where to copy match bytes from */
- var from_source;
- var here = 0; /* current decoding table entry */
- var here_bits, here_op, here_val; // paked "here" denormalized (JS specific)
- //var last; /* parent table entry */
- var last_bits, last_op, last_val; // paked "last" denormalized (JS specific)
- var len; /* length to copy for repeats, bits to drop */
- var ret; /* return code */
- var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */
- var opts;
-
- var n; // temporary var for NEED_BITS
-
- var order = /* permutation of code lengths */
- [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];
-
-
- if (!strm || !strm.state || !strm.output ||
- (!strm.input && strm.avail_in !== 0)) {
- return Z_STREAM_ERROR;
- }
-
- state = strm.state;
- if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */
-
-
- //--- LOAD() ---
- put = strm.next_out;
- output = strm.output;
- left = strm.avail_out;
- next = strm.next_in;
- input = strm.input;
- have = strm.avail_in;
- hold = state.hold;
- bits = state.bits;
- //---
-
- _in = have;
- _out = left;
- ret = Z_OK;
-
- inf_leave: // goto emulation
- for (;;) {
- switch (state.mode) {
- case HEAD:
- if (state.wrap === 0) {
- state.mode = TYPEDO;
- break;
- }
- //=== NEEDBITS(16);
- while (bits < 16) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */
- state.check = 0/*crc32(0L, Z_NULL, 0)*/;
- //=== CRC2(state.check, hold);
- hbuf[0] = hold & 0xff;
- hbuf[1] = (hold >>> 8) & 0xff;
- state.check = crc32(state.check, hbuf, 2, 0);
- //===//
-
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- state.mode = FLAGS;
- break;
- }
- state.flags = 0; /* expect zlib header */
- if (state.head) {
- state.head.done = false;
- }
- if (!(state.wrap & 1) || /* check if zlib header allowed */
- (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {
- strm.msg = 'incorrect header check';
- state.mode = BAD;
- break;
- }
- if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {
- strm.msg = 'unknown compression method';
- state.mode = BAD;
- break;
- }
- //--- DROPBITS(4) ---//
- hold >>>= 4;
- bits -= 4;
- //---//
- len = (hold & 0x0f)/*BITS(4)*/ + 8;
- if (state.wbits === 0) {
- state.wbits = len;
- }
- else if (len > state.wbits) {
- strm.msg = 'invalid window size';
- state.mode = BAD;
- break;
- }
- state.dmax = 1 << len;
- //Tracev((stderr, "inflate: zlib header ok\n"));
- strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
- state.mode = hold & 0x200 ? DICTID : TYPE;
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- break;
- case FLAGS:
- //=== NEEDBITS(16); */
- while (bits < 16) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.flags = hold;
- if ((state.flags & 0xff) !== Z_DEFLATED) {
- strm.msg = 'unknown compression method';
- state.mode = BAD;
- break;
- }
- if (state.flags & 0xe000) {
- strm.msg = 'unknown header flags set';
- state.mode = BAD;
- break;
- }
- if (state.head) {
- state.head.text = ((hold >> 8) & 1);
- }
- if (state.flags & 0x0200) {
- //=== CRC2(state.check, hold);
- hbuf[0] = hold & 0xff;
- hbuf[1] = (hold >>> 8) & 0xff;
- state.check = crc32(state.check, hbuf, 2, 0);
- //===//
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- state.mode = TIME;
- /* falls through */
- case TIME:
- //=== NEEDBITS(32); */
- while (bits < 32) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- if (state.head) {
- state.head.time = hold;
- }
- if (state.flags & 0x0200) {
- //=== CRC4(state.check, hold)
- hbuf[0] = hold & 0xff;
- hbuf[1] = (hold >>> 8) & 0xff;
- hbuf[2] = (hold >>> 16) & 0xff;
- hbuf[3] = (hold >>> 24) & 0xff;
- state.check = crc32(state.check, hbuf, 4, 0);
- //===
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- state.mode = OS;
- /* falls through */
- case OS:
- //=== NEEDBITS(16); */
- while (bits < 16) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- if (state.head) {
- state.head.xflags = (hold & 0xff);
- state.head.os = (hold >> 8);
- }
- if (state.flags & 0x0200) {
- //=== CRC2(state.check, hold);
- hbuf[0] = hold & 0xff;
- hbuf[1] = (hold >>> 8) & 0xff;
- state.check = crc32(state.check, hbuf, 2, 0);
- //===//
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- state.mode = EXLEN;
- /* falls through */
- case EXLEN:
- if (state.flags & 0x0400) {
- //=== NEEDBITS(16); */
- while (bits < 16) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.length = hold;
- if (state.head) {
- state.head.extra_len = hold;
- }
- if (state.flags & 0x0200) {
- //=== CRC2(state.check, hold);
- hbuf[0] = hold & 0xff;
- hbuf[1] = (hold >>> 8) & 0xff;
- state.check = crc32(state.check, hbuf, 2, 0);
- //===//
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- }
- else if (state.head) {
- state.head.extra = null/*Z_NULL*/;
- }
- state.mode = EXTRA;
- /* falls through */
- case EXTRA:
- if (state.flags & 0x0400) {
- copy = state.length;
- if (copy > have) { copy = have; }
- if (copy) {
- if (state.head) {
- len = state.head.extra_len - state.length;
- if (!state.head.extra) {
- // Use untyped array for more convenient processing later
- state.head.extra = new Array(state.head.extra_len);
- }
- utils.arraySet(
- state.head.extra,
- input,
- next,
- // extra field is limited to 65536 bytes
- // - no need for additional size check
- copy,
- /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
- len
- );
- //zmemcpy(state.head.extra + len, next,
- // len + copy > state.head.extra_max ?
- // state.head.extra_max - len : copy);
- }
- if (state.flags & 0x0200) {
- state.check = crc32(state.check, input, copy, next);
- }
- have -= copy;
- next += copy;
- state.length -= copy;
- }
- if (state.length) { break inf_leave; }
- }
- state.length = 0;
- state.mode = NAME;
- /* falls through */
- case NAME:
- if (state.flags & 0x0800) {
- if (have === 0) { break inf_leave; }
- copy = 0;
- do {
- // TODO: 2 or 1 bytes?
- len = input[next + copy++];
- /* use constant limit because in js we should not preallocate memory */
- if (state.head && len &&
- (state.length < 65536 /*state.head.name_max*/)) {
- state.head.name += String.fromCharCode(len);
- }
- } while (len && copy < have);
-
- if (state.flags & 0x0200) {
- state.check = crc32(state.check, input, copy, next);
- }
- have -= copy;
- next += copy;
- if (len) { break inf_leave; }
- }
- else if (state.head) {
- state.head.name = null;
- }
- state.length = 0;
- state.mode = COMMENT;
- /* falls through */
- case COMMENT:
- if (state.flags & 0x1000) {
- if (have === 0) { break inf_leave; }
- copy = 0;
- do {
- len = input[next + copy++];
- /* use constant limit because in js we should not preallocate memory */
- if (state.head && len &&
- (state.length < 65536 /*state.head.comm_max*/)) {
- state.head.comment += String.fromCharCode(len);
- }
- } while (len && copy < have);
- if (state.flags & 0x0200) {
- state.check = crc32(state.check, input, copy, next);
- }
- have -= copy;
- next += copy;
- if (len) { break inf_leave; }
- }
- else if (state.head) {
- state.head.comment = null;
- }
- state.mode = HCRC;
- /* falls through */
- case HCRC:
- if (state.flags & 0x0200) {
- //=== NEEDBITS(16); */
- while (bits < 16) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- if (hold !== (state.check & 0xffff)) {
- strm.msg = 'header crc mismatch';
- state.mode = BAD;
- break;
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- }
- if (state.head) {
- state.head.hcrc = ((state.flags >> 9) & 1);
- state.head.done = true;
- }
- strm.adler = state.check = 0;
- state.mode = TYPE;
- break;
- case DICTID:
- //=== NEEDBITS(32); */
- while (bits < 32) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- strm.adler = state.check = zswap32(hold);
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- state.mode = DICT;
- /* falls through */
- case DICT:
- if (state.havedict === 0) {
- //--- RESTORE() ---
- strm.next_out = put;
- strm.avail_out = left;
- strm.next_in = next;
- strm.avail_in = have;
- state.hold = hold;
- state.bits = bits;
- //---
- return Z_NEED_DICT;
- }
- strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;
- state.mode = TYPE;
- /* falls through */
- case TYPE:
- if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }
- /* falls through */
- case TYPEDO:
- if (state.last) {
- //--- BYTEBITS() ---//
- hold >>>= bits & 7;
- bits -= bits & 7;
- //---//
- state.mode = CHECK;
- break;
- }
- //=== NEEDBITS(3); */
- while (bits < 3) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.last = (hold & 0x01)/*BITS(1)*/;
- //--- DROPBITS(1) ---//
- hold >>>= 1;
- bits -= 1;
- //---//
-
- switch ((hold & 0x03)/*BITS(2)*/) {
- case 0: /* stored block */
- //Tracev((stderr, "inflate: stored block%s\n",
- // state.last ? " (last)" : ""));
- state.mode = STORED;
- break;
- case 1: /* fixed block */
- fixedtables(state);
- //Tracev((stderr, "inflate: fixed codes block%s\n",
- // state.last ? " (last)" : ""));
- state.mode = LEN_; /* decode codes */
- if (flush === Z_TREES) {
- //--- DROPBITS(2) ---//
- hold >>>= 2;
- bits -= 2;
- //---//
- break inf_leave;
- }
- break;
- case 2: /* dynamic block */
- //Tracev((stderr, "inflate: dynamic codes block%s\n",
- // state.last ? " (last)" : ""));
- state.mode = TABLE;
- break;
- case 3:
- strm.msg = 'invalid block type';
- state.mode = BAD;
- }
- //--- DROPBITS(2) ---//
- hold >>>= 2;
- bits -= 2;
- //---//
- break;
- case STORED:
- //--- BYTEBITS() ---// /* go to byte boundary */
- hold >>>= bits & 7;
- bits -= bits & 7;
- //---//
- //=== NEEDBITS(32); */
- while (bits < 32) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {
- strm.msg = 'invalid stored block lengths';
- state.mode = BAD;
- break;
- }
- state.length = hold & 0xffff;
- //Tracev((stderr, "inflate: stored length %u\n",
- // state.length));
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- state.mode = COPY_;
- if (flush === Z_TREES) { break inf_leave; }
- /* falls through */
- case COPY_:
- state.mode = COPY;
- /* falls through */
- case COPY:
- copy = state.length;
- if (copy) {
- if (copy > have) { copy = have; }
- if (copy > left) { copy = left; }
- if (copy === 0) { break inf_leave; }
- //--- zmemcpy(put, next, copy); ---
- utils.arraySet(output, input, next, copy, put);
- //---//
- have -= copy;
- next += copy;
- left -= copy;
- put += copy;
- state.length -= copy;
- break;
- }
- //Tracev((stderr, "inflate: stored end\n"));
- state.mode = TYPE;
- break;
- case TABLE:
- //=== NEEDBITS(14); */
- while (bits < 14) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;
- //--- DROPBITS(5) ---//
- hold >>>= 5;
- bits -= 5;
- //---//
- state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;
- //--- DROPBITS(5) ---//
- hold >>>= 5;
- bits -= 5;
- //---//
- state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;
- //--- DROPBITS(4) ---//
- hold >>>= 4;
- bits -= 4;
- //---//
-//#ifndef PKZIP_BUG_WORKAROUND
- if (state.nlen > 286 || state.ndist > 30) {
- strm.msg = 'too many length or distance symbols';
- state.mode = BAD;
- break;
- }
-//#endif
- //Tracev((stderr, "inflate: table sizes ok\n"));
- state.have = 0;
- state.mode = LENLENS;
- /* falls through */
- case LENLENS:
- while (state.have < state.ncode) {
- //=== NEEDBITS(3);
- while (bits < 3) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);
- //--- DROPBITS(3) ---//
- hold >>>= 3;
- bits -= 3;
- //---//
- }
- while (state.have < 19) {
- state.lens[order[state.have++]] = 0;
- }
- // We have separate tables & no pointers. 2 commented lines below not needed.
- //state.next = state.codes;
- //state.lencode = state.next;
- // Switch to use dynamic table
- state.lencode = state.lendyn;
- state.lenbits = 7;
-
- opts = { bits: state.lenbits };
- ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
- state.lenbits = opts.bits;
-
- if (ret) {
- strm.msg = 'invalid code lengths set';
- state.mode = BAD;
- break;
- }
- //Tracev((stderr, "inflate: code lengths ok\n"));
- state.have = 0;
- state.mode = CODELENS;
- /* falls through */
- case CODELENS:
- while (state.have < state.nlen + state.ndist) {
- for (;;) {
- here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/
- here_bits = here >>> 24;
- here_op = (here >>> 16) & 0xff;
- here_val = here & 0xffff;
-
- if ((here_bits) <= bits) { break; }
- //--- PULLBYTE() ---//
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- //---//
- }
- if (here_val < 16) {
- //--- DROPBITS(here.bits) ---//
- hold >>>= here_bits;
- bits -= here_bits;
- //---//
- state.lens[state.have++] = here_val;
- }
- else {
- if (here_val === 16) {
- //=== NEEDBITS(here.bits + 2);
- n = here_bits + 2;
- while (bits < n) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- //--- DROPBITS(here.bits) ---//
- hold >>>= here_bits;
- bits -= here_bits;
- //---//
- if (state.have === 0) {
- strm.msg = 'invalid bit length repeat';
- state.mode = BAD;
- break;
- }
- len = state.lens[state.have - 1];
- copy = 3 + (hold & 0x03);//BITS(2);
- //--- DROPBITS(2) ---//
- hold >>>= 2;
- bits -= 2;
- //---//
- }
- else if (here_val === 17) {
- //=== NEEDBITS(here.bits + 3);
- n = here_bits + 3;
- while (bits < n) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- //--- DROPBITS(here.bits) ---//
- hold >>>= here_bits;
- bits -= here_bits;
- //---//
- len = 0;
- copy = 3 + (hold & 0x07);//BITS(3);
- //--- DROPBITS(3) ---//
- hold >>>= 3;
- bits -= 3;
- //---//
- }
- else {
- //=== NEEDBITS(here.bits + 7);
- n = here_bits + 7;
- while (bits < n) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- //--- DROPBITS(here.bits) ---//
- hold >>>= here_bits;
- bits -= here_bits;
- //---//
- len = 0;
- copy = 11 + (hold & 0x7f);//BITS(7);
- //--- DROPBITS(7) ---//
- hold >>>= 7;
- bits -= 7;
- //---//
- }
- if (state.have + copy > state.nlen + state.ndist) {
- strm.msg = 'invalid bit length repeat';
- state.mode = BAD;
- break;
- }
- while (copy--) {
- state.lens[state.have++] = len;
- }
- }
- }
-
- /* handle error breaks in while */
- if (state.mode === BAD) { break; }
-
- /* check for end-of-block code (better have one) */
- if (state.lens[256] === 0) {
- strm.msg = 'invalid code -- missing end-of-block';
- state.mode = BAD;
- break;
- }
-
- /* build code tables -- note: do not change the lenbits or distbits
- values here (9 and 6) without reading the comments in inftrees.h
- concerning the ENOUGH constants, which depend on those values */
- state.lenbits = 9;
-
- opts = { bits: state.lenbits };
- ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
- // We have separate tables & no pointers. 2 commented lines below not needed.
- // state.next_index = opts.table_index;
- state.lenbits = opts.bits;
- // state.lencode = state.next;
-
- if (ret) {
- strm.msg = 'invalid literal/lengths set';
- state.mode = BAD;
- break;
- }
-
- state.distbits = 6;
- //state.distcode.copy(state.codes);
- // Switch to use dynamic table
- state.distcode = state.distdyn;
- opts = { bits: state.distbits };
- ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
- // We have separate tables & no pointers. 2 commented lines below not needed.
- // state.next_index = opts.table_index;
- state.distbits = opts.bits;
- // state.distcode = state.next;
-
- if (ret) {
- strm.msg = 'invalid distances set';
- state.mode = BAD;
- break;
- }
- //Tracev((stderr, 'inflate: codes ok\n'));
- state.mode = LEN_;
- if (flush === Z_TREES) { break inf_leave; }
- /* falls through */
- case LEN_:
- state.mode = LEN;
- /* falls through */
- case LEN:
- if (have >= 6 && left >= 258) {
- //--- RESTORE() ---
- strm.next_out = put;
- strm.avail_out = left;
- strm.next_in = next;
- strm.avail_in = have;
- state.hold = hold;
- state.bits = bits;
- //---
- inflate_fast(strm, _out);
- //--- LOAD() ---
- put = strm.next_out;
- output = strm.output;
- left = strm.avail_out;
- next = strm.next_in;
- input = strm.input;
- have = strm.avail_in;
- hold = state.hold;
- bits = state.bits;
- //---
-
- if (state.mode === TYPE) {
- state.back = -1;
- }
- break;
- }
- state.back = 0;
- for (;;) {
- here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/
- here_bits = here >>> 24;
- here_op = (here >>> 16) & 0xff;
- here_val = here & 0xffff;
-
- if (here_bits <= bits) { break; }
- //--- PULLBYTE() ---//
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- //---//
- }
- if (here_op && (here_op & 0xf0) === 0) {
- last_bits = here_bits;
- last_op = here_op;
- last_val = here_val;
- for (;;) {
- here = state.lencode[last_val +
- ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];
- here_bits = here >>> 24;
- here_op = (here >>> 16) & 0xff;
- here_val = here & 0xffff;
-
- if ((last_bits + here_bits) <= bits) { break; }
- //--- PULLBYTE() ---//
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- //---//
- }
- //--- DROPBITS(last.bits) ---//
- hold >>>= last_bits;
- bits -= last_bits;
- //---//
- state.back += last_bits;
- }
- //--- DROPBITS(here.bits) ---//
- hold >>>= here_bits;
- bits -= here_bits;
- //---//
- state.back += here_bits;
- state.length = here_val;
- if (here_op === 0) {
- //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
- // "inflate: literal '%c'\n" :
- // "inflate: literal 0x%02x\n", here.val));
- state.mode = LIT;
- break;
- }
- if (here_op & 32) {
- //Tracevv((stderr, "inflate: end of block\n"));
- state.back = -1;
- state.mode = TYPE;
- break;
- }
- if (here_op & 64) {
- strm.msg = 'invalid literal/length code';
- state.mode = BAD;
- break;
- }
- state.extra = here_op & 15;
- state.mode = LENEXT;
- /* falls through */
- case LENEXT:
- if (state.extra) {
- //=== NEEDBITS(state.extra);
- n = state.extra;
- while (bits < n) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;
- //--- DROPBITS(state.extra) ---//
- hold >>>= state.extra;
- bits -= state.extra;
- //---//
- state.back += state.extra;
- }
- //Tracevv((stderr, "inflate: length %u\n", state.length));
- state.was = state.length;
- state.mode = DIST;
- /* falls through */
- case DIST:
- for (;;) {
- here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/
- here_bits = here >>> 24;
- here_op = (here >>> 16) & 0xff;
- here_val = here & 0xffff;
-
- if ((here_bits) <= bits) { break; }
- //--- PULLBYTE() ---//
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- //---//
- }
- if ((here_op & 0xf0) === 0) {
- last_bits = here_bits;
- last_op = here_op;
- last_val = here_val;
- for (;;) {
- here = state.distcode[last_val +
- ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];
- here_bits = here >>> 24;
- here_op = (here >>> 16) & 0xff;
- here_val = here & 0xffff;
-
- if ((last_bits + here_bits) <= bits) { break; }
- //--- PULLBYTE() ---//
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- //---//
- }
- //--- DROPBITS(last.bits) ---//
- hold >>>= last_bits;
- bits -= last_bits;
- //---//
- state.back += last_bits;
- }
- //--- DROPBITS(here.bits) ---//
- hold >>>= here_bits;
- bits -= here_bits;
- //---//
- state.back += here_bits;
- if (here_op & 64) {
- strm.msg = 'invalid distance code';
- state.mode = BAD;
- break;
- }
- state.offset = here_val;
- state.extra = (here_op) & 15;
- state.mode = DISTEXT;
- /* falls through */
- case DISTEXT:
- if (state.extra) {
- //=== NEEDBITS(state.extra);
- n = state.extra;
- while (bits < n) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;
- //--- DROPBITS(state.extra) ---//
- hold >>>= state.extra;
- bits -= state.extra;
- //---//
- state.back += state.extra;
- }
-//#ifdef INFLATE_STRICT
- if (state.offset > state.dmax) {
- strm.msg = 'invalid distance too far back';
- state.mode = BAD;
- break;
- }
-//#endif
- //Tracevv((stderr, "inflate: distance %u\n", state.offset));
- state.mode = MATCH;
- /* falls through */
- case MATCH:
- if (left === 0) { break inf_leave; }
- copy = _out - left;
- if (state.offset > copy) { /* copy from window */
- copy = state.offset - copy;
- if (copy > state.whave) {
- if (state.sane) {
- strm.msg = 'invalid distance too far back';
- state.mode = BAD;
- break;
- }
-// (!) This block is disabled in zlib defaults,
-// don't enable it for binary compatibility
-//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
-// Trace((stderr, "inflate.c too far\n"));
-// copy -= state.whave;
-// if (copy > state.length) { copy = state.length; }
-// if (copy > left) { copy = left; }
-// left -= copy;
-// state.length -= copy;
-// do {
-// output[put++] = 0;
-// } while (--copy);
-// if (state.length === 0) { state.mode = LEN; }
-// break;
-//#endif
- }
- if (copy > state.wnext) {
- copy -= state.wnext;
- from = state.wsize - copy;
- }
- else {
- from = state.wnext - copy;
- }
- if (copy > state.length) { copy = state.length; }
- from_source = state.window;
- }
- else { /* copy from output */
- from_source = output;
- from = put - state.offset;
- copy = state.length;
- }
- if (copy > left) { copy = left; }
- left -= copy;
- state.length -= copy;
- do {
- output[put++] = from_source[from++];
- } while (--copy);
- if (state.length === 0) { state.mode = LEN; }
- break;
- case LIT:
- if (left === 0) { break inf_leave; }
- output[put++] = state.length;
- left--;
- state.mode = LEN;
- break;
- case CHECK:
- if (state.wrap) {
- //=== NEEDBITS(32);
- while (bits < 32) {
- if (have === 0) { break inf_leave; }
- have--;
- // Use '|' instead of '+' to make sure that result is signed
- hold |= input[next++] << bits;
- bits += 8;
- }
- //===//
- _out -= left;
- strm.total_out += _out;
- state.total += _out;
- if (_out) {
- strm.adler = state.check =
- /*UPDATE(state.check, put - _out, _out);*/
- (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));
-
- }
- _out = left;
- // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too
- if ((state.flags ? hold : zswap32(hold)) !== state.check) {
- strm.msg = 'incorrect data check';
- state.mode = BAD;
- break;
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- //Tracev((stderr, "inflate: check matches trailer\n"));
- }
- state.mode = LENGTH;
- /* falls through */
- case LENGTH:
- if (state.wrap && state.flags) {
- //=== NEEDBITS(32);
- while (bits < 32) {
- if (have === 0) { break inf_leave; }
- have--;
- hold += input[next++] << bits;
- bits += 8;
- }
- //===//
- if (hold !== (state.total & 0xffffffff)) {
- strm.msg = 'incorrect length check';
- state.mode = BAD;
- break;
- }
- //=== INITBITS();
- hold = 0;
- bits = 0;
- //===//
- //Tracev((stderr, "inflate: length matches trailer\n"));
- }
- state.mode = DONE;
- /* falls through */
- case DONE:
- ret = Z_STREAM_END;
- break inf_leave;
- case BAD:
- ret = Z_DATA_ERROR;
- break inf_leave;
- case MEM:
- return Z_MEM_ERROR;
- case SYNC:
- /* falls through */
- default:
- return Z_STREAM_ERROR;
- }
- }
-
- // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave"
-
- /*
- Return from inflate(), updating the total counts and the check value.
- If there was no progress during the inflate() call, return a buffer
- error. Call updatewindow() to create and/or update the window state.
- Note: a memory error from inflate() is non-recoverable.
- */
-
- //--- RESTORE() ---
- strm.next_out = put;
- strm.avail_out = left;
- strm.next_in = next;
- strm.avail_in = have;
- state.hold = hold;
- state.bits = bits;
- //---
-
- if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&
- (state.mode < CHECK || flush !== Z_FINISH))) {
- if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {
- state.mode = MEM;
- return Z_MEM_ERROR;
- }
- }
- _in -= strm.avail_in;
- _out -= strm.avail_out;
- strm.total_in += _in;
- strm.total_out += _out;
- state.total += _out;
- if (state.wrap && _out) {
- strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
- (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));
- }
- strm.data_type = state.bits + (state.last ? 64 : 0) +
- (state.mode === TYPE ? 128 : 0) +
- (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
- if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {
- ret = Z_BUF_ERROR;
- }
- return ret;
-}
-
-function inflateEnd(strm) {
-
- if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {
- return Z_STREAM_ERROR;
- }
-
- var state = strm.state;
- if (state.window) {
- state.window = null;
- }
- strm.state = null;
- return Z_OK;
-}
-
-function inflateGetHeader(strm, head) {
- var state;
-
- /* check state */
- if (!strm || !strm.state) { return Z_STREAM_ERROR; }
- state = strm.state;
- if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }
-
- /* save header structure */
- state.head = head;
- head.done = false;
- return Z_OK;
-}
-
-function inflateSetDictionary(strm, dictionary) {
- var dictLength = dictionary.length;
-
- var state;
- var dictid;
- var ret;
-
- /* check state */
- if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }
- state = strm.state;
-
- if (state.wrap !== 0 && state.mode !== DICT) {
- return Z_STREAM_ERROR;
- }
-
- /* check for correct dictionary identifier */
- if (state.mode === DICT) {
- dictid = 1; /* adler32(0, null, 0)*/
- /* dictid = adler32(dictid, dictionary, dictLength); */
- dictid = adler32(dictid, dictionary, dictLength, 0);
- if (dictid !== state.check) {
- return Z_DATA_ERROR;
- }
- }
- /* copy dictionary to window using updatewindow(), which will amend the
- existing dictionary if appropriate */
- ret = updatewindow(strm, dictionary, dictLength, dictLength);
- if (ret) {
- state.mode = MEM;
- return Z_MEM_ERROR;
- }
- state.havedict = 1;
- // Tracev((stderr, "inflate: dictionary set\n"));
- return Z_OK;
-}
-
-exports.inflateReset = inflateReset;
-exports.inflateReset2 = inflateReset2;
-exports.inflateResetKeep = inflateResetKeep;
-exports.inflateInit = inflateInit;
-exports.inflateInit2 = inflateInit2;
-exports.inflate = inflate;
-exports.inflateEnd = inflateEnd;
-exports.inflateGetHeader = inflateGetHeader;
-exports.inflateSetDictionary = inflateSetDictionary;
-exports.inflateInfo = 'pako inflate (from Nodeca project)';
-
-/* Not implemented
-exports.inflateCopy = inflateCopy;
-exports.inflateGetDictionary = inflateGetDictionary;
-exports.inflateMark = inflateMark;
-exports.inflatePrime = inflatePrime;
-exports.inflateSync = inflateSync;
-exports.inflateSyncPoint = inflateSyncPoint;
-exports.inflateUndermine = inflateUndermine;
-*/
-
-},{"../utils/common":35,"./adler32":36,"./crc32":38,"./inffast":40,"./inftrees":42}],42:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-var utils = require('../utils/common');
-
-var MAXBITS = 15;
-var ENOUGH_LENS = 852;
-var ENOUGH_DISTS = 592;
-//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
-
-var CODES = 0;
-var LENS = 1;
-var DISTS = 2;
-
-var lbase = [ /* Length codes 257..285 base */
- 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
- 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
-];
-
-var lext = [ /* Length codes 257..285 extra */
- 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
- 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
-];
-
-var dbase = [ /* Distance codes 0..29 base */
- 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
- 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
- 8193, 12289, 16385, 24577, 0, 0
-];
-
-var dext = [ /* Distance codes 0..29 extra */
- 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
- 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
- 28, 28, 29, 29, 64, 64
-];
-
-module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)
-{
- var bits = opts.bits;
- //here = opts.here; /* table entry for duplication */
-
- var len = 0; /* a code's length in bits */
- var sym = 0; /* index of code symbols */
- var min = 0, max = 0; /* minimum and maximum code lengths */
- var root = 0; /* number of index bits for root table */
- var curr = 0; /* number of index bits for current table */
- var drop = 0; /* code bits to drop for sub-table */
- var left = 0; /* number of prefix codes available */
- var used = 0; /* code entries in table used */
- var huff = 0; /* Huffman code */
- var incr; /* for incrementing code, index */
- var fill; /* index for replicating entries */
- var low; /* low bits for current root entry */
- var mask; /* mask for low root bits */
- var next; /* next available space in table */
- var base = null; /* base value table to use */
- var base_index = 0;
-// var shoextra; /* extra bits table to use */
- var end; /* use base and extra for symbol > end */
- var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */
- var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */
- var extra = null;
- var extra_index = 0;
-
- var here_bits, here_op, here_val;
-
- /*
- Process a set of code lengths to create a canonical Huffman code. The
- code lengths are lens[0..codes-1]. Each length corresponds to the
- symbols 0..codes-1. The Huffman code is generated by first sorting the
- symbols by length from short to long, and retaining the symbol order
- for codes with equal lengths. Then the code starts with all zero bits
- for the first code of the shortest length, and the codes are integer
- increments for the same length, and zeros are appended as the length
- increases. For the deflate format, these bits are stored backwards
- from their more natural integer increment ordering, and so when the
- decoding tables are built in the large loop below, the integer codes
- are incremented backwards.
-
- This routine assumes, but does not check, that all of the entries in
- lens[] are in the range 0..MAXBITS. The caller must assure this.
- 1..MAXBITS is interpreted as that code length. zero means that that
- symbol does not occur in this code.
-
- The codes are sorted by computing a count of codes for each length,
- creating from that a table of starting indices for each length in the
- sorted table, and then entering the symbols in order in the sorted
- table. The sorted table is work[], with that space being provided by
- the caller.
-
- The length counts are used for other purposes as well, i.e. finding
- the minimum and maximum length codes, determining if there are any
- codes at all, checking for a valid set of lengths, and looking ahead
- at length counts to determine sub-table sizes when building the
- decoding tables.
- */
-
- /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
- for (len = 0; len <= MAXBITS; len++) {
- count[len] = 0;
- }
- for (sym = 0; sym < codes; sym++) {
- count[lens[lens_index + sym]]++;
- }
-
- /* bound code lengths, force root to be within code lengths */
- root = bits;
- for (max = MAXBITS; max >= 1; max--) {
- if (count[max] !== 0) { break; }
- }
- if (root > max) {
- root = max;
- }
- if (max === 0) { /* no symbols to code at all */
- //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */
- //table.bits[opts.table_index] = 1; //here.bits = (var char)1;
- //table.val[opts.table_index++] = 0; //here.val = (var short)0;
- table[table_index++] = (1 << 24) | (64 << 16) | 0;
-
-
- //table.op[opts.table_index] = 64;
- //table.bits[opts.table_index] = 1;
- //table.val[opts.table_index++] = 0;
- table[table_index++] = (1 << 24) | (64 << 16) | 0;
-
- opts.bits = 1;
- return 0; /* no symbols, but wait for decoding to report error */
- }
- for (min = 1; min < max; min++) {
- if (count[min] !== 0) { break; }
- }
- if (root < min) {
- root = min;
- }
-
- /* check for an over-subscribed or incomplete set of lengths */
- left = 1;
- for (len = 1; len <= MAXBITS; len++) {
- left <<= 1;
- left -= count[len];
- if (left < 0) {
- return -1;
- } /* over-subscribed */
- }
- if (left > 0 && (type === CODES || max !== 1)) {
- return -1; /* incomplete set */
- }
-
- /* generate offsets into symbol table for each length for sorting */
- offs[1] = 0;
- for (len = 1; len < MAXBITS; len++) {
- offs[len + 1] = offs[len] + count[len];
- }
-
- /* sort symbols by length, by symbol order within each length */
- for (sym = 0; sym < codes; sym++) {
- if (lens[lens_index + sym] !== 0) {
- work[offs[lens[lens_index + sym]]++] = sym;
- }
- }
-
- /*
- Create and fill in decoding tables. In this loop, the table being
- filled is at next and has curr index bits. The code being used is huff
- with length len. That code is converted to an index by dropping drop
- bits off of the bottom. For codes where len is less than drop + curr,
- those top drop + curr - len bits are incremented through all values to
- fill the table with replicated entries.
-
- root is the number of index bits for the root table. When len exceeds
- root, sub-tables are created pointed to by the root entry with an index
- of the low root bits of huff. This is saved in low to check for when a
- new sub-table should be started. drop is zero when the root table is
- being filled, and drop is root when sub-tables are being filled.
-
- When a new sub-table is needed, it is necessary to look ahead in the
- code lengths to determine what size sub-table is needed. The length
- counts are used for this, and so count[] is decremented as codes are
- entered in the tables.
-
- used keeps track of how many table entries have been allocated from the
- provided *table space. It is checked for LENS and DIST tables against
- the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
- the initial root table size constants. See the comments in inftrees.h
- for more information.
-
- sym increments through all symbols, and the loop terminates when
- all codes of length max, i.e. all codes, have been processed. This
- routine permits incomplete codes, so another loop after this one fills
- in the rest of the decoding tables with invalid code markers.
- */
-
- /* set up for code type */
- // poor man optimization - use if-else instead of switch,
- // to avoid deopts in old v8
- if (type === CODES) {
- base = extra = work; /* dummy value--not used */
- end = 19;
-
- } else if (type === LENS) {
- base = lbase;
- base_index -= 257;
- extra = lext;
- extra_index -= 257;
- end = 256;
-
- } else { /* DISTS */
- base = dbase;
- extra = dext;
- end = -1;
- }
-
- /* initialize opts for loop */
- huff = 0; /* starting code */
- sym = 0; /* starting code symbol */
- len = min; /* starting code length */
- next = table_index; /* current table to fill in */
- curr = root; /* current table index bits */
- drop = 0; /* current bits to drop from code for index */
- low = -1; /* trigger new sub-table when len > root */
- used = 1 << root; /* use root table entries */
- mask = used - 1; /* mask for comparing low */
-
- /* check available table space */
- if ((type === LENS && used > ENOUGH_LENS) ||
- (type === DISTS && used > ENOUGH_DISTS)) {
- return 1;
- }
-
- /* process all codes and make table entries */
- for (;;) {
- /* create table entry */
- here_bits = len - drop;
- if (work[sym] < end) {
- here_op = 0;
- here_val = work[sym];
- }
- else if (work[sym] > end) {
- here_op = extra[extra_index + work[sym]];
- here_val = base[base_index + work[sym]];
- }
- else {
- here_op = 32 + 64; /* end of block */
- here_val = 0;
- }
-
- /* replicate for those indices with low len bits equal to huff */
- incr = 1 << (len - drop);
- fill = 1 << curr;
- min = fill; /* save offset to next table */
- do {
- fill -= incr;
- table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;
- } while (fill !== 0);
-
- /* backwards increment the len-bit code huff */
- incr = 1 << (len - 1);
- while (huff & incr) {
- incr >>= 1;
- }
- if (incr !== 0) {
- huff &= incr - 1;
- huff += incr;
- } else {
- huff = 0;
- }
-
- /* go to next symbol, update count, len */
- sym++;
- if (--count[len] === 0) {
- if (len === max) { break; }
- len = lens[lens_index + work[sym]];
- }
-
- /* create new sub-table if needed */
- if (len > root && (huff & mask) !== low) {
- /* if first time, transition to sub-tables */
- if (drop === 0) {
- drop = root;
- }
-
- /* increment past last table */
- next += min; /* here min is 1 << curr */
-
- /* determine length of next table */
- curr = len - drop;
- left = 1 << curr;
- while (curr + drop < max) {
- left -= count[curr + drop];
- if (left <= 0) { break; }
- curr++;
- left <<= 1;
- }
-
- /* check for enough space */
- used += 1 << curr;
- if ((type === LENS && used > ENOUGH_LENS) ||
- (type === DISTS && used > ENOUGH_DISTS)) {
- return 1;
- }
-
- /* point entry in root table to sub-table */
- low = huff & mask;
- /*table.op[low] = curr;
- table.bits[low] = root;
- table.val[low] = next - opts.table_index;*/
- table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;
- }
- }
-
- /* fill in remaining table entry if code is incomplete (guaranteed to have
- at most one remaining entry, since if the code is incomplete, the
- maximum code length that was allowed to get this far is one bit) */
- if (huff !== 0) {
- //table.op[next + huff] = 64; /* invalid code marker */
- //table.bits[next + huff] = len - drop;
- //table.val[next + huff] = 0;
- table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
- }
-
- /* set return parameters */
- //opts.table_index += used;
- opts.bits = root;
- return 0;
-};
-
-},{"../utils/common":35}],43:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-module.exports = {
- 2: 'need dictionary', /* Z_NEED_DICT 2 */
- 1: 'stream end', /* Z_STREAM_END 1 */
- 0: '', /* Z_OK 0 */
- '-1': 'file error', /* Z_ERRNO (-1) */
- '-2': 'stream error', /* Z_STREAM_ERROR (-2) */
- '-3': 'data error', /* Z_DATA_ERROR (-3) */
- '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */
- '-5': 'buffer error', /* Z_BUF_ERROR (-5) */
- '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */
-};
-
-},{}],44:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-var utils = require('../utils/common');
-
-/* Public constants ==========================================================*/
-/* ===========================================================================*/
-
-
-//var Z_FILTERED = 1;
-//var Z_HUFFMAN_ONLY = 2;
-//var Z_RLE = 3;
-var Z_FIXED = 4;
-//var Z_DEFAULT_STRATEGY = 0;
-
-/* Possible values of the data_type field (though see inflate()) */
-var Z_BINARY = 0;
-var Z_TEXT = 1;
-//var Z_ASCII = 1; // = Z_TEXT
-var Z_UNKNOWN = 2;
-
-/*============================================================================*/
-
-
-function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
-
-// From zutil.h
-
-var STORED_BLOCK = 0;
-var STATIC_TREES = 1;
-var DYN_TREES = 2;
-/* The three kinds of block type */
-
-var MIN_MATCH = 3;
-var MAX_MATCH = 258;
-/* The minimum and maximum match lengths */
-
-// From deflate.h
-/* ===========================================================================
- * Internal compression state.
- */
-
-var LENGTH_CODES = 29;
-/* number of length codes, not counting the special END_BLOCK code */
-
-var LITERALS = 256;
-/* number of literal bytes 0..255 */
-
-var L_CODES = LITERALS + 1 + LENGTH_CODES;
-/* number of Literal or Length codes, including the END_BLOCK code */
-
-var D_CODES = 30;
-/* number of distance codes */
-
-var BL_CODES = 19;
-/* number of codes used to transfer the bit lengths */
-
-var HEAP_SIZE = 2 * L_CODES + 1;
-/* maximum heap size */
-
-var MAX_BITS = 15;
-/* All codes must not exceed MAX_BITS bits */
-
-var Buf_size = 16;
-/* size of bit buffer in bi_buf */
-
-
-/* ===========================================================================
- * Constants
- */
-
-var MAX_BL_BITS = 7;
-/* Bit length codes must not exceed MAX_BL_BITS bits */
-
-var END_BLOCK = 256;
-/* end of block literal code */
-
-var REP_3_6 = 16;
-/* repeat previous bit length 3-6 times (2 bits of repeat count) */
-
-var REPZ_3_10 = 17;
-/* repeat a zero length 3-10 times (3 bits of repeat count) */
-
-var REPZ_11_138 = 18;
-/* repeat a zero length 11-138 times (7 bits of repeat count) */
-
-/* eslint-disable comma-spacing,array-bracket-spacing */
-var extra_lbits = /* extra bits for each length code */
- [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];
-
-var extra_dbits = /* extra bits for each distance code */
- [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];
-
-var extra_blbits = /* extra bits for each bit length code */
- [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];
-
-var bl_order =
- [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];
-/* eslint-enable comma-spacing,array-bracket-spacing */
-
-/* The lengths of the bit length codes are sent in order of decreasing
- * probability, to avoid transmitting the lengths for unused bit length codes.
- */
-
-/* ===========================================================================
- * Local data. These are initialized only once.
- */
-
-// We pre-fill arrays with 0 to avoid uninitialized gaps
-
-var DIST_CODE_LEN = 512; /* see definition of array dist_code below */
-
-// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1
-var static_ltree = new Array((L_CODES + 2) * 2);
-zero(static_ltree);
-/* The static literal tree. Since the bit lengths are imposed, there is no
- * need for the L_CODES extra codes used during heap construction. However
- * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
- * below).
- */
-
-var static_dtree = new Array(D_CODES * 2);
-zero(static_dtree);
-/* The static distance tree. (Actually a trivial tree since all codes use
- * 5 bits.)
- */
-
-var _dist_code = new Array(DIST_CODE_LEN);
-zero(_dist_code);
-/* Distance codes. The first 256 values correspond to the distances
- * 3 .. 258, the last 256 values correspond to the top 8 bits of
- * the 15 bit distances.
- */
-
-var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);
-zero(_length_code);
-/* length code for each normalized match length (0 == MIN_MATCH) */
-
-var base_length = new Array(LENGTH_CODES);
-zero(base_length);
-/* First normalized length for each code (0 = MIN_MATCH) */
-
-var base_dist = new Array(D_CODES);
-zero(base_dist);
-/* First normalized distance for each code (0 = distance of 1) */
-
-
-function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {
-
- this.static_tree = static_tree; /* static tree or NULL */
- this.extra_bits = extra_bits; /* extra bits for each code or NULL */
- this.extra_base = extra_base; /* base index for extra_bits */
- this.elems = elems; /* max number of elements in the tree */
- this.max_length = max_length; /* max bit length for the codes */
-
- // show if `static_tree` has data or dummy - needed for monomorphic objects
- this.has_stree = static_tree && static_tree.length;
-}
-
-
-var static_l_desc;
-var static_d_desc;
-var static_bl_desc;
-
-
-function TreeDesc(dyn_tree, stat_desc) {
- this.dyn_tree = dyn_tree; /* the dynamic tree */
- this.max_code = 0; /* largest code with non zero frequency */
- this.stat_desc = stat_desc; /* the corresponding static tree */
-}
-
-
-
-function d_code(dist) {
- return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
-}
-
-
-/* ===========================================================================
- * Output a short LSB first on the stream.
- * IN assertion: there is enough room in pendingBuf.
- */
-function put_short(s, w) {
-// put_byte(s, (uch)((w) & 0xff));
-// put_byte(s, (uch)((ush)(w) >> 8));
- s.pending_buf[s.pending++] = (w) & 0xff;
- s.pending_buf[s.pending++] = (w >>> 8) & 0xff;
-}
-
-
-/* ===========================================================================
- * Send a value on a given number of bits.
- * IN assertion: length <= 16 and value fits in length bits.
- */
-function send_bits(s, value, length) {
- if (s.bi_valid > (Buf_size - length)) {
- s.bi_buf |= (value << s.bi_valid) & 0xffff;
- put_short(s, s.bi_buf);
- s.bi_buf = value >> (Buf_size - s.bi_valid);
- s.bi_valid += length - Buf_size;
- } else {
- s.bi_buf |= (value << s.bi_valid) & 0xffff;
- s.bi_valid += length;
- }
-}
-
-
-function send_code(s, c, tree) {
- send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);
-}
-
-
-/* ===========================================================================
- * Reverse the first len bits of a code, using straightforward code (a faster
- * method would use a table)
- * IN assertion: 1 <= len <= 15
- */
-function bi_reverse(code, len) {
- var res = 0;
- do {
- res |= code & 1;
- code >>>= 1;
- res <<= 1;
- } while (--len > 0);
- return res >>> 1;
-}
-
-
-/* ===========================================================================
- * Flush the bit buffer, keeping at most 7 bits in it.
- */
-function bi_flush(s) {
- if (s.bi_valid === 16) {
- put_short(s, s.bi_buf);
- s.bi_buf = 0;
- s.bi_valid = 0;
-
- } else if (s.bi_valid >= 8) {
- s.pending_buf[s.pending++] = s.bi_buf & 0xff;
- s.bi_buf >>= 8;
- s.bi_valid -= 8;
- }
-}
-
-
-/* ===========================================================================
- * Compute the optimal bit lengths for a tree and update the total bit length
- * for the current block.
- * IN assertion: the fields freq and dad are set, heap[heap_max] and
- * above are the tree nodes sorted by increasing frequency.
- * OUT assertions: the field len is set to the optimal bit length, the
- * array bl_count contains the frequencies for each bit length.
- * The length opt_len is updated; static_len is also updated if stree is
- * not null.
- */
-function gen_bitlen(s, desc)
-// deflate_state *s;
-// tree_desc *desc; /* the tree descriptor */
-{
- var tree = desc.dyn_tree;
- var max_code = desc.max_code;
- var stree = desc.stat_desc.static_tree;
- var has_stree = desc.stat_desc.has_stree;
- var extra = desc.stat_desc.extra_bits;
- var base = desc.stat_desc.extra_base;
- var max_length = desc.stat_desc.max_length;
- var h; /* heap index */
- var n, m; /* iterate over the tree elements */
- var bits; /* bit length */
- var xbits; /* extra bits */
- var f; /* frequency */
- var overflow = 0; /* number of elements with bit length too large */
-
- for (bits = 0; bits <= MAX_BITS; bits++) {
- s.bl_count[bits] = 0;
- }
-
- /* In a first pass, compute the optimal bit lengths (which may
- * overflow in the case of the bit length tree).
- */
- tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */
-
- for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {
- n = s.heap[h];
- bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
- if (bits > max_length) {
- bits = max_length;
- overflow++;
- }
- tree[n * 2 + 1]/*.Len*/ = bits;
- /* We overwrite tree[n].Dad which is no longer needed */
-
- if (n > max_code) { continue; } /* not a leaf node */
-
- s.bl_count[bits]++;
- xbits = 0;
- if (n >= base) {
- xbits = extra[n - base];
- }
- f = tree[n * 2]/*.Freq*/;
- s.opt_len += f * (bits + xbits);
- if (has_stree) {
- s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);
- }
- }
- if (overflow === 0) { return; }
-
- // Trace((stderr,"\nbit length overflow\n"));
- /* This happens for example on obj2 and pic of the Calgary corpus */
-
- /* Find the first bit length which could increase: */
- do {
- bits = max_length - 1;
- while (s.bl_count[bits] === 0) { bits--; }
- s.bl_count[bits]--; /* move one leaf down the tree */
- s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
- s.bl_count[max_length]--;
- /* The brother of the overflow item also moves one step up,
- * but this does not affect bl_count[max_length]
- */
- overflow -= 2;
- } while (overflow > 0);
-
- /* Now recompute all bit lengths, scanning in increasing frequency.
- * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
- * lengths instead of fixing only the wrong ones. This idea is taken
- * from 'ar' written by Haruhiko Okumura.)
- */
- for (bits = max_length; bits !== 0; bits--) {
- n = s.bl_count[bits];
- while (n !== 0) {
- m = s.heap[--h];
- if (m > max_code) { continue; }
- if (tree[m * 2 + 1]/*.Len*/ !== bits) {
- // Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
- s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;
- tree[m * 2 + 1]/*.Len*/ = bits;
- }
- n--;
- }
- }
-}
-
-
-/* ===========================================================================
- * Generate the codes for a given tree and bit counts (which need not be
- * optimal).
- * IN assertion: the array bl_count contains the bit length statistics for
- * the given tree and the field len is set for all tree elements.
- * OUT assertion: the field code is set for all tree elements of non
- * zero code length.
- */
-function gen_codes(tree, max_code, bl_count)
-// ct_data *tree; /* the tree to decorate */
-// int max_code; /* largest code with non zero frequency */
-// ushf *bl_count; /* number of codes at each bit length */
-{
- var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */
- var code = 0; /* running code value */
- var bits; /* bit index */
- var n; /* code index */
-
- /* The distribution counts are first used to generate the code values
- * without bit reversal.
- */
- for (bits = 1; bits <= MAX_BITS; bits++) {
- next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
- }
- /* Check that the bit counts in bl_count are consistent. The last code
- * must be all ones.
- */
- //Assert (code + bl_count[MAX_BITS]-1 == (1< length code (0..28) */
- length = 0;
- for (code = 0; code < LENGTH_CODES - 1; code++) {
- base_length[code] = length;
- for (n = 0; n < (1 << extra_lbits[code]); n++) {
- _length_code[length++] = code;
- }
- }
- //Assert (length == 256, "tr_static_init: length != 256");
- /* Note that the length 255 (match length 258) can be represented
- * in two different ways: code 284 + 5 bits or code 285, so we
- * overwrite length_code[255] to use the best encoding:
- */
- _length_code[length - 1] = code;
-
- /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
- dist = 0;
- for (code = 0; code < 16; code++) {
- base_dist[code] = dist;
- for (n = 0; n < (1 << extra_dbits[code]); n++) {
- _dist_code[dist++] = code;
- }
- }
- //Assert (dist == 256, "tr_static_init: dist != 256");
- dist >>= 7; /* from now on, all distances are divided by 128 */
- for (; code < D_CODES; code++) {
- base_dist[code] = dist << 7;
- for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
- _dist_code[256 + dist++] = code;
- }
- }
- //Assert (dist == 256, "tr_static_init: 256+dist != 512");
-
- /* Construct the codes of the static literal tree */
- for (bits = 0; bits <= MAX_BITS; bits++) {
- bl_count[bits] = 0;
- }
-
- n = 0;
- while (n <= 143) {
- static_ltree[n * 2 + 1]/*.Len*/ = 8;
- n++;
- bl_count[8]++;
- }
- while (n <= 255) {
- static_ltree[n * 2 + 1]/*.Len*/ = 9;
- n++;
- bl_count[9]++;
- }
- while (n <= 279) {
- static_ltree[n * 2 + 1]/*.Len*/ = 7;
- n++;
- bl_count[7]++;
- }
- while (n <= 287) {
- static_ltree[n * 2 + 1]/*.Len*/ = 8;
- n++;
- bl_count[8]++;
- }
- /* Codes 286 and 287 do not exist, but we must include them in the
- * tree construction to get a canonical Huffman tree (longest code
- * all ones)
- */
- gen_codes(static_ltree, L_CODES + 1, bl_count);
-
- /* The static distance tree is trivial: */
- for (n = 0; n < D_CODES; n++) {
- static_dtree[n * 2 + 1]/*.Len*/ = 5;
- static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);
- }
-
- // Now data ready and we can init static trees
- static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);
- static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);
- static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);
-
- //static_init_done = true;
-}
-
-
-/* ===========================================================================
- * Initialize a new block.
- */
-function init_block(s) {
- var n; /* iterates over tree elements */
-
- /* Initialize the trees. */
- for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }
- for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }
- for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }
-
- s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;
- s.opt_len = s.static_len = 0;
- s.last_lit = s.matches = 0;
-}
-
-
-/* ===========================================================================
- * Flush the bit buffer and align the output on a byte boundary
- */
-function bi_windup(s)
-{
- if (s.bi_valid > 8) {
- put_short(s, s.bi_buf);
- } else if (s.bi_valid > 0) {
- //put_byte(s, (Byte)s->bi_buf);
- s.pending_buf[s.pending++] = s.bi_buf;
- }
- s.bi_buf = 0;
- s.bi_valid = 0;
-}
-
-/* ===========================================================================
- * Copy a stored block, storing first the length and its
- * one's complement if requested.
- */
-function copy_block(s, buf, len, header)
-//DeflateState *s;
-//charf *buf; /* the input data */
-//unsigned len; /* its length */
-//int header; /* true if block header must be written */
-{
- bi_windup(s); /* align on byte boundary */
-
- if (header) {
- put_short(s, len);
- put_short(s, ~len);
- }
-// while (len--) {
-// put_byte(s, *buf++);
-// }
- utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
- s.pending += len;
-}
-
-/* ===========================================================================
- * Compares to subtrees, using the tree depth as tie breaker when
- * the subtrees have equal frequency. This minimizes the worst case length.
- */
-function smaller(tree, n, m, depth) {
- var _n2 = n * 2;
- var _m2 = m * 2;
- return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
- (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
-}
-
-/* ===========================================================================
- * Restore the heap property by moving down the tree starting at node k,
- * exchanging a node with the smallest of its two sons if necessary, stopping
- * when the heap property is re-established (each father smaller than its
- * two sons).
- */
-function pqdownheap(s, tree, k)
-// deflate_state *s;
-// ct_data *tree; /* the tree to restore */
-// int k; /* node to move down */
-{
- var v = s.heap[k];
- var j = k << 1; /* left son of k */
- while (j <= s.heap_len) {
- /* Set j to the smallest of the two sons: */
- if (j < s.heap_len &&
- smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
- j++;
- }
- /* Exit if v is smaller than both sons */
- if (smaller(tree, v, s.heap[j], s.depth)) { break; }
-
- /* Exchange v with the smallest son */
- s.heap[k] = s.heap[j];
- k = j;
-
- /* And continue down the tree, setting j to the left son of k */
- j <<= 1;
- }
- s.heap[k] = v;
-}
-
-
-// inlined manually
-// var SMALLEST = 1;
-
-/* ===========================================================================
- * Send the block data compressed using the given Huffman trees
- */
-function compress_block(s, ltree, dtree)
-// deflate_state *s;
-// const ct_data *ltree; /* literal tree */
-// const ct_data *dtree; /* distance tree */
-{
- var dist; /* distance of matched string */
- var lc; /* match length or unmatched char (if dist == 0) */
- var lx = 0; /* running index in l_buf */
- var code; /* the code to send */
- var extra; /* number of extra bits to send */
-
- if (s.last_lit !== 0) {
- do {
- dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);
- lc = s.pending_buf[s.l_buf + lx];
- lx++;
-
- if (dist === 0) {
- send_code(s, lc, ltree); /* send a literal byte */
- //Tracecv(isgraph(lc), (stderr," '%c' ", lc));
- } else {
- /* Here, lc is the match length - MIN_MATCH */
- code = _length_code[lc];
- send_code(s, code + LITERALS + 1, ltree); /* send the length code */
- extra = extra_lbits[code];
- if (extra !== 0) {
- lc -= base_length[code];
- send_bits(s, lc, extra); /* send the extra length bits */
- }
- dist--; /* dist is now the match distance - 1 */
- code = d_code(dist);
- //Assert (code < D_CODES, "bad d_code");
-
- send_code(s, code, dtree); /* send the distance code */
- extra = extra_dbits[code];
- if (extra !== 0) {
- dist -= base_dist[code];
- send_bits(s, dist, extra); /* send the extra distance bits */
- }
- } /* literal or match pair ? */
-
- /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
- //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
- // "pendingBuf overflow");
-
- } while (lx < s.last_lit);
- }
-
- send_code(s, END_BLOCK, ltree);
-}
-
-
-/* ===========================================================================
- * Construct one Huffman tree and assigns the code bit strings and lengths.
- * Update the total bit length for the current block.
- * IN assertion: the field freq is set for all tree elements.
- * OUT assertions: the fields len and code are set to the optimal bit length
- * and corresponding code. The length opt_len is updated; static_len is
- * also updated if stree is not null. The field max_code is set.
- */
-function build_tree(s, desc)
-// deflate_state *s;
-// tree_desc *desc; /* the tree descriptor */
-{
- var tree = desc.dyn_tree;
- var stree = desc.stat_desc.static_tree;
- var has_stree = desc.stat_desc.has_stree;
- var elems = desc.stat_desc.elems;
- var n, m; /* iterate over heap elements */
- var max_code = -1; /* largest code with non zero frequency */
- var node; /* new node being created */
-
- /* Construct the initial heap, with least frequent element in
- * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
- * heap[0] is not used.
- */
- s.heap_len = 0;
- s.heap_max = HEAP_SIZE;
-
- for (n = 0; n < elems; n++) {
- if (tree[n * 2]/*.Freq*/ !== 0) {
- s.heap[++s.heap_len] = max_code = n;
- s.depth[n] = 0;
-
- } else {
- tree[n * 2 + 1]/*.Len*/ = 0;
- }
- }
-
- /* The pkzip format requires that at least one distance code exists,
- * and that at least one bit should be sent even if there is only one
- * possible code. So to avoid special checks later on we force at least
- * two codes of non zero frequency.
- */
- while (s.heap_len < 2) {
- node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
- tree[node * 2]/*.Freq*/ = 1;
- s.depth[node] = 0;
- s.opt_len--;
-
- if (has_stree) {
- s.static_len -= stree[node * 2 + 1]/*.Len*/;
- }
- /* node is 0 or 1 so it does not have extra bits */
- }
- desc.max_code = max_code;
-
- /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
- * establish sub-heaps of increasing lengths:
- */
- for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
-
- /* Construct the Huffman tree by repeatedly combining the least two
- * frequent nodes.
- */
- node = elems; /* next internal node of the tree */
- do {
- //pqremove(s, tree, n); /* n = node of least frequency */
- /*** pqremove ***/
- n = s.heap[1/*SMALLEST*/];
- s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];
- pqdownheap(s, tree, 1/*SMALLEST*/);
- /***/
-
- m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */
-
- s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
- s.heap[--s.heap_max] = m;
-
- /* Create a new node father of n and m */
- tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
- s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
- tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;
-
- /* and insert the new node in the heap */
- s.heap[1/*SMALLEST*/] = node++;
- pqdownheap(s, tree, 1/*SMALLEST*/);
-
- } while (s.heap_len >= 2);
-
- s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];
-
- /* At this point, the fields freq and dad are set. We can now
- * generate the bit lengths.
- */
- gen_bitlen(s, desc);
-
- /* The field len is now set, we can generate the bit codes */
- gen_codes(tree, max_code, s.bl_count);
-}
-
-
-/* ===========================================================================
- * Scan a literal or distance tree to determine the frequencies of the codes
- * in the bit length tree.
- */
-function scan_tree(s, tree, max_code)
-// deflate_state *s;
-// ct_data *tree; /* the tree to be scanned */
-// int max_code; /* and its largest code of non zero frequency */
-{
- var n; /* iterates over all tree elements */
- var prevlen = -1; /* last emitted length */
- var curlen; /* length of current code */
-
- var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */
-
- var count = 0; /* repeat count of the current code */
- var max_count = 7; /* max repeat count */
- var min_count = 4; /* min repeat count */
-
- if (nextlen === 0) {
- max_count = 138;
- min_count = 3;
- }
- tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */
-
- for (n = 0; n <= max_code; n++) {
- curlen = nextlen;
- nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
-
- if (++count < max_count && curlen === nextlen) {
- continue;
-
- } else if (count < min_count) {
- s.bl_tree[curlen * 2]/*.Freq*/ += count;
-
- } else if (curlen !== 0) {
-
- if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }
- s.bl_tree[REP_3_6 * 2]/*.Freq*/++;
-
- } else if (count <= 10) {
- s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;
-
- } else {
- s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;
- }
-
- count = 0;
- prevlen = curlen;
-
- if (nextlen === 0) {
- max_count = 138;
- min_count = 3;
-
- } else if (curlen === nextlen) {
- max_count = 6;
- min_count = 3;
-
- } else {
- max_count = 7;
- min_count = 4;
- }
- }
-}
-
-
-/* ===========================================================================
- * Send a literal or distance tree in compressed form, using the codes in
- * bl_tree.
- */
-function send_tree(s, tree, max_code)
-// deflate_state *s;
-// ct_data *tree; /* the tree to be scanned */
-// int max_code; /* and its largest code of non zero frequency */
-{
- var n; /* iterates over all tree elements */
- var prevlen = -1; /* last emitted length */
- var curlen; /* length of current code */
-
- var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */
-
- var count = 0; /* repeat count of the current code */
- var max_count = 7; /* max repeat count */
- var min_count = 4; /* min repeat count */
-
- /* tree[max_code+1].Len = -1; */ /* guard already set */
- if (nextlen === 0) {
- max_count = 138;
- min_count = 3;
- }
-
- for (n = 0; n <= max_code; n++) {
- curlen = nextlen;
- nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
-
- if (++count < max_count && curlen === nextlen) {
- continue;
-
- } else if (count < min_count) {
- do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);
-
- } else if (curlen !== 0) {
- if (curlen !== prevlen) {
- send_code(s, curlen, s.bl_tree);
- count--;
- }
- //Assert(count >= 3 && count <= 6, " 3_6?");
- send_code(s, REP_3_6, s.bl_tree);
- send_bits(s, count - 3, 2);
-
- } else if (count <= 10) {
- send_code(s, REPZ_3_10, s.bl_tree);
- send_bits(s, count - 3, 3);
-
- } else {
- send_code(s, REPZ_11_138, s.bl_tree);
- send_bits(s, count - 11, 7);
- }
-
- count = 0;
- prevlen = curlen;
- if (nextlen === 0) {
- max_count = 138;
- min_count = 3;
-
- } else if (curlen === nextlen) {
- max_count = 6;
- min_count = 3;
-
- } else {
- max_count = 7;
- min_count = 4;
- }
- }
-}
-
-
-/* ===========================================================================
- * Construct the Huffman tree for the bit lengths and return the index in
- * bl_order of the last bit length code to send.
- */
-function build_bl_tree(s) {
- var max_blindex; /* index of last bit length code of non zero freq */
-
- /* Determine the bit length frequencies for literal and distance trees */
- scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
- scan_tree(s, s.dyn_dtree, s.d_desc.max_code);
-
- /* Build the bit length tree: */
- build_tree(s, s.bl_desc);
- /* opt_len now includes the length of the tree representations, except
- * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
- */
-
- /* Determine the number of bit length codes to send. The pkzip format
- * requires that at least 4 bit length codes be sent. (appnote.txt says
- * 3 but the actual value used is 4.)
- */
- for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
- if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {
- break;
- }
- }
- /* Update opt_len to include the bit length tree and counts */
- s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
- //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
- // s->opt_len, s->static_len));
-
- return max_blindex;
-}
-
-
-/* ===========================================================================
- * Send the header for a block using dynamic Huffman trees: the counts, the
- * lengths of the bit length codes, the literal tree and the distance tree.
- * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
- */
-function send_all_trees(s, lcodes, dcodes, blcodes)
-// deflate_state *s;
-// int lcodes, dcodes, blcodes; /* number of codes for each tree */
-{
- var rank; /* index in bl_order */
-
- //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
- //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
- // "too many codes");
- //Tracev((stderr, "\nbl counts: "));
- send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */
- send_bits(s, dcodes - 1, 5);
- send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */
- for (rank = 0; rank < blcodes; rank++) {
- //Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
- send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);
- }
- //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
-
- send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */
- //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
-
- send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */
- //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
-}
-
-
-/* ===========================================================================
- * Check if the data type is TEXT or BINARY, using the following algorithm:
- * - TEXT if the two conditions below are satisfied:
- * a) There are no non-portable control characters belonging to the
- * "black list" (0..6, 14..25, 28..31).
- * b) There is at least one printable character belonging to the
- * "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
- * - BINARY otherwise.
- * - The following partially-portable control characters form a
- * "gray list" that is ignored in this detection algorithm:
- * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
- * IN assertion: the fields Freq of dyn_ltree are set.
- */
-function detect_data_type(s) {
- /* black_mask is the bit mask of black-listed bytes
- * set bits 0..6, 14..25, and 28..31
- * 0xf3ffc07f = binary 11110011111111111100000001111111
- */
- var black_mask = 0xf3ffc07f;
- var n;
-
- /* Check for non-textual ("black-listed") bytes. */
- for (n = 0; n <= 31; n++, black_mask >>>= 1) {
- if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {
- return Z_BINARY;
- }
- }
-
- /* Check for textual ("white-listed") bytes. */
- if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||
- s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {
- return Z_TEXT;
- }
- for (n = 32; n < LITERALS; n++) {
- if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {
- return Z_TEXT;
- }
- }
-
- /* There are no "black-listed" or "white-listed" bytes:
- * this stream either is empty or has tolerated ("gray-listed") bytes only.
- */
- return Z_BINARY;
-}
-
-
-var static_init_done = false;
-
-/* ===========================================================================
- * Initialize the tree data structures for a new zlib stream.
- */
-function _tr_init(s)
-{
-
- if (!static_init_done) {
- tr_static_init();
- static_init_done = true;
- }
-
- s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);
- s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);
- s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);
-
- s.bi_buf = 0;
- s.bi_valid = 0;
-
- /* Initialize the first block of the first file: */
- init_block(s);
-}
-
-
-/* ===========================================================================
- * Send a stored block
- */
-function _tr_stored_block(s, buf, stored_len, last)
-//DeflateState *s;
-//charf *buf; /* input block */
-//ulg stored_len; /* length of input block */
-//int last; /* one if this is the last block for a file */
-{
- send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */
- copy_block(s, buf, stored_len, true); /* with header */
-}
-
-
-/* ===========================================================================
- * Send one empty static block to give enough lookahead for inflate.
- * This takes 10 bits, of which 7 may remain in the bit buffer.
- */
-function _tr_align(s) {
- send_bits(s, STATIC_TREES << 1, 3);
- send_code(s, END_BLOCK, static_ltree);
- bi_flush(s);
-}
-
-
-/* ===========================================================================
- * Determine the best encoding for the current block: dynamic trees, static
- * trees or store, and output the encoded block to the zip file.
- */
-function _tr_flush_block(s, buf, stored_len, last)
-//DeflateState *s;
-//charf *buf; /* input block, or NULL if too old */
-//ulg stored_len; /* length of input block */
-//int last; /* one if this is the last block for a file */
-{
- var opt_lenb, static_lenb; /* opt_len and static_len in bytes */
- var max_blindex = 0; /* index of last bit length code of non zero freq */
-
- /* Build the Huffman trees unless a stored block is forced */
- if (s.level > 0) {
-
- /* Check if the file is binary or text */
- if (s.strm.data_type === Z_UNKNOWN) {
- s.strm.data_type = detect_data_type(s);
- }
-
- /* Construct the literal and distance trees */
- build_tree(s, s.l_desc);
- // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
- // s->static_len));
-
- build_tree(s, s.d_desc);
- // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
- // s->static_len));
- /* At this point, opt_len and static_len are the total bit lengths of
- * the compressed block data, excluding the tree representations.
- */
-
- /* Build the bit length tree for the above two trees, and get the index
- * in bl_order of the last bit length code to send.
- */
- max_blindex = build_bl_tree(s);
-
- /* Determine the best encoding. Compute the block lengths in bytes. */
- opt_lenb = (s.opt_len + 3 + 7) >>> 3;
- static_lenb = (s.static_len + 3 + 7) >>> 3;
-
- // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
- // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
- // s->last_lit));
-
- if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }
-
- } else {
- // Assert(buf != (char*)0, "lost buf");
- opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
- }
-
- if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {
- /* 4: two words for the lengths */
-
- /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
- * Otherwise we can't have processed more than WSIZE input bytes since
- * the last block flush, because compression would have been
- * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
- * transform a block into a stored block.
- */
- _tr_stored_block(s, buf, stored_len, last);
-
- } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {
-
- send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);
- compress_block(s, static_ltree, static_dtree);
-
- } else {
- send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);
- send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);
- compress_block(s, s.dyn_ltree, s.dyn_dtree);
- }
- // Assert (s->compressed_len == s->bits_sent, "bad compressed size");
- /* The above check is made mod 2^32, for files larger than 512 MB
- * and uLong implemented on 32 bits.
- */
- init_block(s);
-
- if (last) {
- bi_windup(s);
- }
- // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
- // s->compressed_len-7*last));
-}
-
-/* ===========================================================================
- * Save the match info and tally the frequency counts. Return true if
- * the current block must be flushed.
- */
-function _tr_tally(s, dist, lc)
-// deflate_state *s;
-// unsigned dist; /* distance of matched string */
-// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
-{
- //var out_length, in_length, dcode;
-
- s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;
- s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;
-
- s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;
- s.last_lit++;
-
- if (dist === 0) {
- /* lc is the unmatched char */
- s.dyn_ltree[lc * 2]/*.Freq*/++;
- } else {
- s.matches++;
- /* Here, lc is the match length - MIN_MATCH */
- dist--; /* dist = match distance - 1 */
- //Assert((ush)dist < (ush)MAX_DIST(s) &&
- // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
- // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
-
- s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;
- s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;
- }
-
-// (!) This block is disabled in zlib defaults,
-// don't enable it for binary compatibility
-
-//#ifdef TRUNCATE_BLOCK
-// /* Try to guess if it is profitable to stop the current block here */
-// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {
-// /* Compute an upper bound for the compressed length */
-// out_length = s.last_lit*8;
-// in_length = s.strstart - s.block_start;
-//
-// for (dcode = 0; dcode < D_CODES; dcode++) {
-// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);
-// }
-// out_length >>>= 3;
-// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
-// // s->last_lit, in_length, out_length,
-// // 100L - out_length*100L/in_length));
-// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {
-// return true;
-// }
-// }
-//#endif
-
- return (s.last_lit === s.lit_bufsize - 1);
- /* We avoid equality with lit_bufsize because of wraparound at 64K
- * on 16 bit machines and because stored blocks are restricted to
- * 64K-1 bytes.
- */
-}
-
-exports._tr_init = _tr_init;
-exports._tr_stored_block = _tr_stored_block;
-exports._tr_flush_block = _tr_flush_block;
-exports._tr_tally = _tr_tally;
-exports._tr_align = _tr_align;
-
-},{"../utils/common":35}],45:[function(require,module,exports){
-'use strict';
-
-// (C) 1995-2013 Jean-loup Gailly and Mark Adler
-// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
-//
-// This software is provided 'as-is', without any express or implied
-// warranty. In no event will the authors be held liable for any damages
-// arising from the use of this software.
-//
-// Permission is granted to anyone to use this software for any purpose,
-// including commercial applications, and to alter it and redistribute it
-// freely, subject to the following restrictions:
-//
-// 1. The origin of this software must not be misrepresented; you must not
-// claim that you wrote the original software. If you use this software
-// in a product, an acknowledgment in the product documentation would be
-// appreciated but is not required.
-// 2. Altered source versions must be plainly marked as such, and must not be
-// misrepresented as being the original software.
-// 3. This notice may not be removed or altered from any source distribution.
-
-function ZStream() {
- /* next input byte */
- this.input = null; // JS specific, because we have no pointers
- this.next_in = 0;
- /* number of bytes available at input */
- this.avail_in = 0;
- /* total number of input bytes read so far */
- this.total_in = 0;
- /* next output byte should be put there */
- this.output = null; // JS specific, because we have no pointers
- this.next_out = 0;
- /* remaining free space at output */
- this.avail_out = 0;
- /* total number of bytes output so far */
- this.total_out = 0;
- /* last error message, NULL if no error */
- this.msg = ''/*Z_NULL*/;
- /* not visible by applications */
- this.state = null;
- /* best guess about the data type: binary or text */
- this.data_type = 2/*Z_UNKNOWN*/;
- /* adler32 value of the uncompressed data */
- this.adler = 0;
-}
-
-module.exports = ZStream;
-
-},{}],46:[function(require,module,exports){
-(function (process){
-'use strict';
-
-if (!process.version ||
- process.version.indexOf('v0.') === 0 ||
- process.version.indexOf('v1.') === 0 && process.version.indexOf('v1.8.') !== 0) {
- module.exports = nextTick;
-} else {
- module.exports = process.nextTick;
-}
-
-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);
- });
- }
-}
-
-}).call(this,require('_process'))
-},{"_process":47}],47:[function(require,module,exports){
-// 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; };
-
-},{}],48:[function(require,module,exports){
-module.exports = require('./lib/_stream_duplex.js');
-
-},{"./lib/_stream_duplex.js":49}],49:[function(require,module,exports){
-// 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.
-
-'use strict';
-
-/**/
-
-var processNextTick = require('process-nextick-args');
-/**/
-
-/**/
-var objectKeys = Object.keys || function (obj) {
- var keys = [];
- for (var key in obj) {
- keys.push(key);
- }return keys;
-};
-/**/
-
-module.exports = Duplex;
-
-/**/
-var util = require('core-util-is');
-util.inherits = require('inherits');
-/**/
-
-var Readable = require('./_stream_readable');
-var Writable = require('./_stream_writable');
-
-util.inherits(Duplex, Readable);
-
-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);
-}
-
-// 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.
- processNextTick(onEndNT, this);
-}
-
-function onEndNT(self) {
- self.end();
-}
-
-Object.defineProperty(Duplex.prototype, 'destroyed', {
- get: function () {
- if (this._readableState === undefined || this._writableState === undefined) {
- return false;
- }
- return this._readableState.destroyed && this._writableState.destroyed;
- },
- set: function (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();
-
- processNextTick(cb, err);
-};
-
-function forEach(xs, f) {
- for (var i = 0, l = xs.length; i < l; i++) {
- f(xs[i], i);
- }
-}
-},{"./_stream_readable":51,"./_stream_writable":53,"core-util-is":29,"inherits":32,"process-nextick-args":46}],50:[function(require,module,exports){
-// 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 passthrough stream.
-// basically just the most minimal sort of Transform stream.
-// Every written chunk gets output as-is.
-
-'use strict';
-
-module.exports = PassThrough;
-
-var Transform = require('./_stream_transform');
-
-/**/
-var util = require('core-util-is');
-util.inherits = require('inherits');
-/**/
-
-util.inherits(PassThrough, Transform);
-
-function PassThrough(options) {
- if (!(this instanceof PassThrough)) return new PassThrough(options);
-
- Transform.call(this, options);
-}
-
-PassThrough.prototype._transform = function (chunk, encoding, cb) {
- cb(null, chunk);
-};
-},{"./_stream_transform":52,"core-util-is":29,"inherits":32}],51:[function(require,module,exports){
-(function (process,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.
-
-'use strict';
-
-/**/
-
-var processNextTick = require('process-nextick-args');
-/**/
-
-module.exports = Readable;
-
-/**/
-var isArray = require('isarray');
-/**/
-
-/**/
-var Duplex;
-/**/
-
-Readable.ReadableState = ReadableState;
-
-/**/
-var EE = require('events').EventEmitter;
-
-var EElistenerCount = function (emitter, type) {
- return emitter.listeners(type).length;
-};
-/**/
-
-/**/
-var Stream = require('./internal/streams/stream');
-/**/
-
-// TODO(bmeurer): Change this back to const once hole checks are
-// properly optimized away early in Ignition+TurboFan.
-/**/
-var Buffer = require('safe-buffer').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 = require('core-util-is');
-util.inherits = require('inherits');
-/**/
-
-/**/
-var debugUtil = require('util');
-var debug = void 0;
-if (debugUtil && debugUtil.debuglog) {
- debug = debugUtil.debuglog('stream');
-} else {
- debug = function () {};
-}
-/**/
-
-var BufferList = require('./internal/streams/BufferList');
-var destroyImpl = require('./internal/streams/destroy');
-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);
- } else {
- // 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 || require('./_stream_duplex');
-
- options = options || {};
-
- // 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 (stream instanceof Duplex) 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 defaultHwm = this.objectMode ? 16 : 16 * 1024;
- this.highWaterMark = hwm || hwm === 0 ? hwm : 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 = require('string_decoder/').StringDecoder;
- this.decoder = new StringDecoder(options.encoding);
- this.encoding = options.encoding;
- }
-}
-
-function Readable(options) {
- Duplex = Duplex || require('./_stream_duplex');
-
- 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 () {
- if (this._readableState === undefined) {
- return false;
- }
- return this._readableState.destroyed;
- },
- set: function (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 = require('string_decoder/').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) processNextTick(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;
- processNextTick(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) processNextTick(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) {
- processNextTick(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;
- processNextTick(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 state = this._readableState;
- var paused = false;
-
- var self = this;
- stream.on('end', function () {
- debug('wrapped end');
- if (state.decoder && !state.ended) {
- var chunk = state.decoder.end();
- if (chunk && chunk.length) self.push(chunk);
- }
-
- self.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 = self.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], self.emit.bind(self, kProxyEvents[n]));
- }
-
- // when we try to consume some more bytes, simply unpause the
- // underlying stream.
- self._read = function (n) {
- debug('wrapped _read', n);
- if (paused) {
- paused = false;
- stream.resume();
- }
- };
-
- return self;
-};
-
-// 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;
- processNextTick(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 forEach(xs, f) {
- for (var i = 0, l = xs.length; i < l; i++) {
- f(xs[i], i);
- }
-}
-
-function indexOf(xs, x) {
- for (var i = 0, l = xs.length; i < l; i++) {
- if (xs[i] === x) return i;
- }
- return -1;
-}
-}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{"./_stream_duplex":49,"./internal/streams/BufferList":54,"./internal/streams/destroy":55,"./internal/streams/stream":56,"_process":47,"core-util-is":29,"events":30,"inherits":32,"isarray":34,"process-nextick-args":46,"safe-buffer":62,"string_decoder/":57,"util":25}],52:[function(require,module,exports){
-// 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.
-
-'use strict';
-
-module.exports = Transform;
-
-var Duplex = require('./_stream_duplex');
-
-/**/
-var util = require('core-util-is');
-util.inherits = require('inherits');
-/**/
-
-util.inherits(Transform, Duplex);
-
-function TransformState(stream) {
- this.afterTransform = function (er, data) {
- return afterTransform(stream, er, data);
- };
-
- this.needTransform = false;
- this.transforming = false;
- this.writecb = null;
- this.writechunk = null;
- this.writeencoding = null;
-}
-
-function afterTransform(stream, er, data) {
- var ts = stream._transformState;
- ts.transforming = false;
-
- var cb = ts.writecb;
-
- if (!cb) {
- return stream.emit('error', new Error('write callback called multiple times'));
- }
-
- ts.writechunk = null;
- ts.writecb = null;
-
- if (data !== null && data !== undefined) stream.push(data);
-
- cb(er);
-
- var rs = stream._readableState;
- rs.reading = false;
- if (rs.needReadable || rs.length < rs.highWaterMark) {
- stream._read(rs.highWaterMark);
- }
-}
-
-function Transform(options) {
- if (!(this instanceof Transform)) return new Transform(options);
-
- Duplex.call(this, options);
-
- this._transformState = new TransformState(this);
-
- var stream = this;
-
- // 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.once('prefinish', function () {
- if (typeof this._flush === 'function') this._flush(function (er, data) {
- done(stream, er, data);
- });else done(stream);
- });
-}
-
-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 _this = this;
-
- Duplex.prototype._destroy.call(this, err, function (err2) {
- cb(err2);
- _this.emit('close');
- });
-};
-
-function done(stream, er, data) {
- if (er) return stream.emit('error', er);
-
- if (data !== null && data !== undefined) stream.push(data);
-
- // if there's nothing in the write buffer, then that means
- // that nothing more will ever be provided
- var ws = stream._writableState;
- var ts = stream._transformState;
-
- if (ws.length) throw new Error('Calling transform done when ws.length != 0');
-
- if (ts.transforming) throw new Error('Calling transform done when still transforming');
-
- return stream.push(null);
-}
-},{"./_stream_duplex":49,"core-util-is":29,"inherits":32}],53:[function(require,module,exports){
-(function (process,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.
-
-'use strict';
-
-/**/
-
-var processNextTick = require('process-nextick-args');
-/**/
-
-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 : processNextTick;
-/**/
-
-/**/
-var Duplex;
-/**/
-
-Writable.WritableState = WritableState;
-
-/**/
-var util = require('core-util-is');
-util.inherits = require('inherits');
-/**/
-
-/**/
-var internalUtil = {
- deprecate: require('util-deprecate')
-};
-/**/
-
-/**/
-var Stream = require('./internal/streams/stream');
-/**/
-
-/**/
-var Buffer = require('safe-buffer').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 = require('./internal/streams/destroy');
-
-util.inherits(Writable, Stream);
-
-function nop() {}
-
-function WritableState(options, stream) {
- Duplex = Duplex || require('./_stream_duplex');
-
- options = options || {};
-
- // object stream flag to indicate whether or not this stream
- // contains buffers or objects.
- this.objectMode = !!options.objectMode;
-
- if (stream instanceof Duplex) 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 defaultHwm = this.objectMode ? 16 : 16 * 1024;
- this.highWaterMark = hwm || hwm === 0 ? hwm : 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 (object) {
- if (realHasInstance.call(this, object)) return true;
-
- return object && object._writableState instanceof WritableState;
- }
- });
-} else {
- realHasInstance = function (object) {
- return object instanceof this;
- };
-}
-
-function Writable(options) {
- Duplex = Duplex || require('./_stream_duplex');
-
- // 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);
- processNextTick(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);
- processNextTick(cb, er);
- valid = false;
- }
- return valid;
-}
-
-Writable.prototype.write = function (chunk, encoding, cb) {
- var state = this._writableState;
- var ret = false;
- var isBuf = _isUint8Array(chunk) && !state.objectMode;
-
- 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;
-}
-
-// 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
- processNextTick(cb, er);
- // this can emit finish, and it will always happen
- // after error
- processNextTick(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);
- }
- } 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;
- // 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.bufferedRequestCount = 0;
- 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;
- processNextTick(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) processNextTick(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 () {
- if (this._writableState === undefined) {
- return false;
- }
- return this._writableState.destroyed;
- },
- set: function (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);
-};
-}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{"./_stream_duplex":49,"./internal/streams/destroy":55,"./internal/streams/stream":56,"_process":47,"core-util-is":29,"inherits":32,"process-nextick-args":46,"safe-buffer":62,"util-deprecate":64}],54:[function(require,module,exports){
-'use strict';
-
-/**/
-
-function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
-
-var Buffer = require('safe-buffer').Buffer;
-/**/
-
-function copyBuffer(src, target, offset) {
- src.copy(target, offset);
-}
-
-module.exports = function () {
- function BufferList() {
- _classCallCheck(this, BufferList);
-
- this.head = null;
- this.tail = null;
- this.length = 0;
- }
-
- BufferList.prototype.push = function push(v) {
- var entry = { data: v, next: null };
- if (this.length > 0) this.tail.next = entry;else this.head = entry;
- this.tail = entry;
- ++this.length;
- };
-
- BufferList.prototype.unshift = function unshift(v) {
- var entry = { data: v, next: this.head };
- if (this.length === 0) this.tail = entry;
- this.head = entry;
- ++this.length;
- };
-
- BufferList.prototype.shift = function shift() {
- if (this.length === 0) return;
- var ret = this.head.data;
- if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;
- --this.length;
- return ret;
- };
-
- BufferList.prototype.clear = function clear() {
- this.head = this.tail = null;
- this.length = 0;
- };
-
- BufferList.prototype.join = function join(s) {
- if (this.length === 0) return '';
- var p = this.head;
- var ret = '' + p.data;
- while (p = p.next) {
- ret += s + p.data;
- }return ret;
- };
-
- BufferList.prototype.concat = function concat(n) {
- if (this.length === 0) return Buffer.alloc(0);
- if (this.length === 1) return this.head.data;
- var ret = Buffer.allocUnsafe(n >>> 0);
- var p = this.head;
- var i = 0;
- while (p) {
- copyBuffer(p.data, ret, i);
- i += p.data.length;
- p = p.next;
- }
- return ret;
- };
-
- return BufferList;
-}();
-},{"safe-buffer":62}],55:[function(require,module,exports){
-'use strict';
-
-/**/
-
-var processNextTick = require('process-nextick-args');
-/**/
-
-// 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)) {
- processNextTick(emitErrorNT, this, err);
- }
- return;
- }
-
- // 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) {
- processNextTick(emitErrorNT, _this, err);
- if (_this._writableState) {
- _this._writableState.errorEmitted = true;
- }
- } else if (cb) {
- cb(err);
- }
- });
-}
-
-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
-};
-},{"process-nextick-args":46}],56:[function(require,module,exports){
-module.exports = require('events').EventEmitter;
-
-},{"events":30}],57:[function(require,module,exports){
-'use strict';
-
-var Buffer = require('safe-buffer').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.
-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 -1;
-}
-
-// 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) return 0;
- nb = utf8CheckByte(buf[j]);
- if (nb >= 0) {
- if (nb > 0) self.lastNeed = nb - 2;
- return nb;
- }
- if (--j < i) 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
-// UTF-8 replacement characters ('\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'.repeat(p);
- }
- if (self.lastNeed > 1 && buf.length > 1) {
- if ((buf[1] & 0xC0) !== 0x80) {
- self.lastNeed = 1;
- return '\ufffd'.repeat(p + 1);
- }
- if (self.lastNeed > 2 && buf.length > 2) {
- if ((buf[2] & 0xC0) !== 0x80) {
- self.lastNeed = 2;
- return '\ufffd'.repeat(p + 2);
- }
- }
- }
-}
-
-// 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 for each buffered byte of a (partial)
-// character needs to be added to the output.
-function utf8End(buf) {
- var r = buf && buf.length ? this.write(buf) : '';
- if (this.lastNeed) return r + '\ufffd'.repeat(this.lastTotal - this.lastNeed);
- 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) : '';
-}
-},{"safe-buffer":62}],58:[function(require,module,exports){
-module.exports = require('./readable').PassThrough
-
-},{"./readable":59}],59:[function(require,module,exports){
-exports = module.exports = require('./lib/_stream_readable.js');
-exports.Stream = exports;
-exports.Readable = exports;
-exports.Writable = require('./lib/_stream_writable.js');
-exports.Duplex = require('./lib/_stream_duplex.js');
-exports.Transform = require('./lib/_stream_transform.js');
-exports.PassThrough = require('./lib/_stream_passthrough.js');
-
-},{"./lib/_stream_duplex.js":49,"./lib/_stream_passthrough.js":50,"./lib/_stream_readable.js":51,"./lib/_stream_transform.js":52,"./lib/_stream_writable.js":53}],60:[function(require,module,exports){
-module.exports = require('./readable').Transform
-
-},{"./readable":59}],61:[function(require,module,exports){
-module.exports = require('./lib/_stream_writable.js');
-
-},{"./lib/_stream_writable.js":53}],62:[function(require,module,exports){
-/* eslint-disable node/no-deprecated-api */
-var buffer = require('buffer')
-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)
-}
-
-},{"buffer":28}],63:[function(require,module,exports){
-// 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 = require('events').EventEmitter;
-var inherits = require('inherits');
-
-inherits(Stream, EE);
-Stream.Readable = require('readable-stream/readable.js');
-Stream.Writable = require('readable-stream/writable.js');
-Stream.Duplex = require('readable-stream/duplex.js');
-Stream.Transform = require('readable-stream/transform.js');
-Stream.PassThrough = require('readable-stream/passthrough.js');
-
-// 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;
-};
-
-},{"events":30,"inherits":32,"readable-stream/duplex.js":48,"readable-stream/passthrough.js":58,"readable-stream/readable.js":59,"readable-stream/transform.js":60,"readable-stream/writable.js":61}],64:[function(require,module,exports){
-(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';
-}
-
-}).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{}],65:[function(require,module,exports){
-arguments[4][32][0].apply(exports,arguments)
-},{"dup":32}],66:[function(require,module,exports){
-module.exports = function isBuffer(arg) {
- return arg && typeof arg === 'object'
- && typeof arg.copy === 'function'
- && typeof arg.fill === 'function'
- && typeof arg.readUInt8 === 'function';
-}
-},{}],67:[function(require,module,exports){
-(function (process,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.
-
-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) {
- // Allow for deprecating things in the process of starting up.
- if (isUndefined(global.process)) {
- return function() {
- return exports.deprecate(fn, msg).apply(this, arguments);
- };
- }
-
- if (process.noDeprecation === true) {
- return fn;
- }
-
- 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 '\u001b[' + inspect.colors[style][0] + 'm' + str +
- '\u001b[' + 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 = require('./support/isBuffer');
-
-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 = require('inherits');
-
-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);
-}
-
-}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{"./support/isBuffer":66,"_process":47,"inherits":65}]},{},[20])(20)
-});
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/base.css b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/base.css
deleted file mode 100644
index ac7c23c5..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/base.css
+++ /dev/null
@@ -1,354 +0,0 @@
-body,
-html {
- margin: 0;
- padding: 0;
- height: 100%;
-}
-body {
- font-family: Helvetica Neue, Helvetica, Arial;
- font-size: 14px;
- color: #333;
-}
-.small {
- font-size: 12px;
-}
-*,
-*:after,
-*:before {
- -webkit-box-sizing: border-box;
- -moz-box-sizing: border-box;
- box-sizing: border-box;
-}
-h1 {
- font-size: 20px;
- margin: 0;
-}
-h2 {
- font-size: 14px;
-}
-pre {
- font: 12px/1.4 Consolas, "Liberation Mono", Menlo, Courier, monospace;
- margin: 0;
- padding: 0;
- -moz-tab-size: 2;
- -o-tab-size: 2;
- tab-size: 2;
-}
-a {
- color: #0074d9;
- text-decoration: none;
-}
-a:hover {
- text-decoration: underline;
-}
-.strong {
- font-weight: bold;
-}
-.space-top1 {
- padding: 10px 0 0 0;
-}
-.pad2y {
- padding: 20px 0;
-}
-.pad1y {
- padding: 10px 0;
-}
-.pad2x {
- padding: 0 20px;
-}
-.pad2 {
- padding: 20px;
-}
-.pad1 {
- padding: 10px;
-}
-.space-left2 {
- padding-left: 55px;
-}
-.space-right2 {
- padding-right: 20px;
-}
-.center {
- text-align: center;
-}
-.clearfix {
- display: block;
-}
-.clearfix:after {
- content: "";
- display: block;
- height: 0;
- clear: both;
- visibility: hidden;
-}
-.fl {
- float: left;
-}
-@media only screen and (max-width: 640px) {
- .col3 {
- width: 100%;
- max-width: 100%;
- }
- .hide-mobile {
- display: none !important;
- }
-}
-
-.quiet {
- color: #7f7f7f;
- color: rgba(0, 0, 0, 0.5);
-}
-.quiet a {
- opacity: 0.7;
-}
-
-.fraction {
- font-family: Consolas, "Liberation Mono", Menlo, Courier, monospace;
- font-size: 10px;
- color: #555;
- background: #e8e8e8;
- padding: 4px 5px;
- border-radius: 3px;
- vertical-align: middle;
-}
-
-div.path a:link,
-div.path a:visited {
- color: #333;
-}
-table.coverage {
- border-collapse: collapse;
- margin: 10px 0 0 0;
- padding: 0;
-}
-
-table.coverage td {
- margin: 0;
- padding: 0;
- vertical-align: top;
-}
-table.coverage td.line-count {
- text-align: right;
- padding: 0 5px 0 20px;
-}
-table.coverage td.line-coverage {
- text-align: right;
- padding-right: 10px;
- min-width: 20px;
-}
-
-table.coverage td span.cline-any {
- display: inline-block;
- padding: 0 5px;
- width: 100%;
-}
-.missing-if-branch {
- display: inline-block;
- margin-right: 5px;
- border-radius: 3px;
- position: relative;
- padding: 0 4px;
- background: #333;
- color: yellow;
-}
-
-.skip-if-branch {
- display: none;
- margin-right: 10px;
- position: relative;
- padding: 0 4px;
- background: #ccc;
- color: white;
-}
-.missing-if-branch .typ,
-.skip-if-branch .typ {
- color: inherit !important;
-}
-.coverage-summary {
- border-collapse: collapse;
- width: 100%;
-}
-.coverage-summary tr {
- border-bottom: 1px solid #bbb;
-}
-.keyline-all {
- border: 1px solid #ddd;
-}
-.coverage-summary td,
-.coverage-summary th {
- padding: 10px;
-}
-.coverage-summary tbody {
- border: 1px solid #bbb;
-}
-.coverage-summary td {
- border-right: 1px solid #bbb;
-}
-.coverage-summary td:last-child {
- border-right: none;
-}
-.coverage-summary th {
- text-align: left;
- font-weight: normal;
- white-space: nowrap;
-}
-.coverage-summary th.file {
- border-right: none !important;
-}
-.coverage-summary th.pct {
-}
-.coverage-summary th.pic,
-.coverage-summary th.abs,
-.coverage-summary td.pct,
-.coverage-summary td.abs {
- text-align: right;
-}
-.coverage-summary td.file {
- white-space: nowrap;
-}
-.coverage-summary td.pic {
- min-width: 120px !important;
-}
-.coverage-summary tfoot td {
-}
-
-.coverage-summary .sorter {
- height: 10px;
- width: 7px;
- display: inline-block;
- margin-left: 0.5em;
- background: url(sort-arrow-sprite.png) no-repeat scroll 0 0 transparent;
-}
-.coverage-summary .sorted .sorter {
- background-position: 0 -20px;
-}
-.coverage-summary .sorted-desc .sorter {
- background-position: 0 -10px;
-}
-.status-line {
- height: 10px;
-}
-/* yellow */
-.cbranch-no {
- background: yellow !important;
- color: #111;
-}
-/* dark red */
-.red.solid,
-.status-line.low,
-.low .cover-fill {
- background: #c21f39;
-}
-.low .chart {
- border: 1px solid #c21f39;
-}
-.highlighted,
-.highlighted .cstat-no,
-.highlighted .fstat-no,
-.highlighted .cbranch-no {
- background: #c21f39 !important;
-}
-/* medium red */
-.cstat-no,
-.fstat-no,
-.cbranch-no,
-.cbranch-no {
- background: #f6c6ce;
-}
-/* light red */
-.low,
-.cline-no {
- background: #fce1e5;
-}
-/* light green */
-.high,
-.cline-yes {
- background: rgb(230, 245, 208);
-}
-/* medium green */
-.cstat-yes {
- background: rgb(161, 215, 106);
-}
-/* dark green */
-.status-line.high,
-.high .cover-fill {
- background: rgb(77, 146, 33);
-}
-.high .chart {
- border: 1px solid rgb(77, 146, 33);
-}
-/* dark yellow (gold) */
-.status-line.medium,
-.medium .cover-fill {
- background: #f9cd0b;
-}
-.medium .chart {
- border: 1px solid #f9cd0b;
-}
-/* light yellow */
-.medium {
- background: #fff4c2;
-}
-
-.cstat-skip {
- background: #ddd;
- color: #111;
-}
-.fstat-skip {
- background: #ddd;
- color: #111 !important;
-}
-.cbranch-skip {
- background: #ddd !important;
- color: #111;
-}
-
-span.cline-neutral {
- background: #eaeaea;
-}
-
-.coverage-summary td.empty {
- opacity: 0.5;
- padding-top: 4px;
- padding-bottom: 4px;
- line-height: 1;
- color: #888;
-}
-
-.cover-fill,
-.cover-empty {
- display: inline-block;
- height: 12px;
-}
-.chart {
- line-height: 0;
-}
-.cover-empty {
- background: white;
-}
-.cover-full {
- border-right: none !important;
-}
-pre.prettyprint {
- border: none !important;
- padding: 0 !important;
- margin: 0 !important;
-}
-.com {
- color: #999 !important;
-}
-.ignore-none {
- color: #999;
- font-weight: normal;
-}
-
-.wrapper {
- min-height: 100%;
- height: auto !important;
- height: 100%;
- margin: 0 auto -48px;
-}
-.footer,
-.push {
- height: 48px;
-}
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/bitmapper.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/bitmapper.js.html
deleted file mode 100644
index bafa89bb..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/bitmapper.js.html
+++ /dev/null
@@ -1,881 +0,0 @@
-
-
-
-
-
- Code coverage report for bitmapper.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 94.37%
- Statements
- 134/142
-
-
-
-
- 72.41%
- Branches
- 21/29
-
-
-
-
- 89.47%
- Functions
- 17/19
-
-
-
-
- 94.16%
- Lines
- 129/137
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166
-167
-168
-169
-170
-171
-172
-173
-174
-175
-176
-177
-178
-179
-180
-181
-182
-183
-184
-185
-186
-187
-188
-189
-190
-191
-192
-193
-194
-195
-196
-197
-198
-199
-200
-201
-202
-203
-204
-205
-206
-207
-208
-209
-210
-211
-212
-213
-214
-215
-216
-217
-218
-219
-220
-221
-222
-223
-224
-225
-226
-227
-228
-229
-230
-231
-232
-233
-234
-235
-236
-237
-238
-239
-240
-241
-242
-243
-244
-245
-246
-247
-248
-249
-250
-251
-252
-253
-254
-255
-256
-257
-258
-259
-260
-261
-262
-263
-264
-265
-266
-267
-268 |
-
-1x
-
-1x
-
-
-
-
-
-
-313632x
-
-
-
-313632x
-313632x
-313632x
-313632x
-313632x
-
-
-
-
-
-8192x
-
-
-
-8192x
-8192x
-8192x
-8192x
-8192x
-
-
-
-
-
-1228160x
-
-
-
-1228160x
-1228160x
-1228160x
-1228160x
-
-
-
-
-
-272640x
-
-
-
-272640x
-272640x
-272640x
-272640x
-
-
-
-1x
-
-
-
-
-
-
-1193380x
-1193380x
-1193380x
-1193380x
-1193380x
-
-
-
-
-
-8192x
-8192x
-8192x
-8192x
-8192x
-
-
-
-
-
-24576x
-24576x
-24576x
-24576x
-
-
-
-
-
-8192x
-8192x
-8192x
-8192x
-
-
-
-
-209x
-209x
-
-
-334250x
-
-
-334250x
-334250x
-
-334250x
-
-
-
-149504x
-149504x
-149504x
-149504x
-
-49612x
-49612x
-49612x
-49612x
-
-2968x
-2968x
-2968x
-2968x
-2968x
-2968x
-
-132166x
-132166x
-132166x
-132166x
-132166x
-132166x
-132166x
-132166x
-132166x
-132166x
-
-
-
-209x
-
-1234340x
-334250x
-
-1234340x
-1234340x
-1234340x
-
-
-8106x
-
-
-209x
-
-
-
-
-
-
-
-
-210x
-210x
-210x
-210x
-7288x
-1822624x
-1822624x
-1822624x
-
-
-210x
-
-
-
-
-529x
-529x
-529x
-529x
-8106x
-1234340x
-1234340x
-1234340x
-
-8106x
-
-
-
-1x
-335x
-335x
-335x
-335x
-335x
-
-
-335x
-209x
-
-
-335x
-269x
-
-66x
-
-335x
-335x
-
-
-
-335x
-72x
-72x
-
-263x
-263x
-2732114x
-2732114x
-2732114x
-
-263x
-
-
-335x
-739x
-210x
-
-
-
-
-
-
-
-
-529x
-
-
-
-
-
-
-
-
-
-335x
-126x
-
-
-
-209x
-
-
-335x
-
- | "use strict";
-
-let interlaceUtils = require("./interlace");
-
-let pixelBppMapper = [
- // 0 - dummy entry
- function () {},
-
- // 1 - L
- // 0: 0, 1: 0, 2: 0, 3: 0xff
- function (pxData, data, pxPos, rawPos) {
- Iif (rawPos === data.length) {
- throw new Error("Ran out of data");
- }
-
- let pixel = data[rawPos];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = 0xff;
- },
-
- // 2 - LA
- // 0: 0, 1: 0, 2: 0, 3: 1
- function (pxData, data, pxPos, rawPos) {
- Iif (rawPos + 1 >= data.length) {
- throw new Error("Ran out of data");
- }
-
- let pixel = data[rawPos];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = data[rawPos + 1];
- },
-
- // 3 - RGB
- // 0: 0, 1: 1, 2: 2, 3: 0xff
- function (pxData, data, pxPos, rawPos) {
- Iif (rawPos + 2 >= data.length) {
- throw new Error("Ran out of data");
- }
-
- pxData[pxPos] = data[rawPos];
- pxData[pxPos + 1] = data[rawPos + 1];
- pxData[pxPos + 2] = data[rawPos + 2];
- pxData[pxPos + 3] = 0xff;
- },
-
- // 4 - RGBA
- // 0: 0, 1: 1, 2: 2, 3: 3
- function (pxData, data, pxPos, rawPos) {
- Iif (rawPos + 3 >= data.length) {
- throw new Error("Ran out of data");
- }
-
- pxData[pxPos] = data[rawPos];
- pxData[pxPos + 1] = data[rawPos + 1];
- pxData[pxPos + 2] = data[rawPos + 2];
- pxData[pxPos + 3] = data[rawPos + 3];
- },
-];
-
-let pixelBppCustomMapper = [
- // 0 - dummy entry
- function () {},
-
- // 1 - L
- // 0: 0, 1: 0, 2: 0, 3: 0xff
- function (pxData, pixelData, pxPos, maxBit) {
- let pixel = pixelData[0];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = maxBit;
- },
-
- // 2 - LA
- // 0: 0, 1: 0, 2: 0, 3: 1
- function (pxData, pixelData, pxPos) {
- let pixel = pixelData[0];
- pxData[pxPos] = pixel;
- pxData[pxPos + 1] = pixel;
- pxData[pxPos + 2] = pixel;
- pxData[pxPos + 3] = pixelData[1];
- },
-
- // 3 - RGB
- // 0: 0, 1: 1, 2: 2, 3: 0xff
- function (pxData, pixelData, pxPos, maxBit) {
- pxData[pxPos] = pixelData[0];
- pxData[pxPos + 1] = pixelData[1];
- pxData[pxPos + 2] = pixelData[2];
- pxData[pxPos + 3] = maxBit;
- },
-
- // 4 - RGBA
- // 0: 0, 1: 1, 2: 2, 3: 3
- function (pxData, pixelData, pxPos) {
- pxData[pxPos] = pixelData[0];
- pxData[pxPos + 1] = pixelData[1];
- pxData[pxPos + 2] = pixelData[2];
- pxData[pxPos + 3] = pixelData[3];
- },
-];
-
-function bitRetriever(data, depth) {
- let leftOver = [];
- let i = 0;
-
- function split() {
- Iif (i === data.length) {
- throw new Error("Ran out of data");
- }
- let byte = data[i];
- i++;
- let byte8, byte7, byte6, byte5, byte4, byte3, byte2, byte1;
- switch (depth) {
- default:
- throw new Error("unrecognised depth");
- case 16:
- byte2 = data[i];
- i++;
- leftOver.push((byte << 8) + byte2);
- break;
- case 4:
- byte2 = byte & 0x0f;
- byte1 = byte >> 4;
- leftOver.push(byte1, byte2);
- break;
- case 2:
- byte4 = byte & 3;
- byte3 = (byte >> 2) & 3;
- byte2 = (byte >> 4) & 3;
- byte1 = (byte >> 6) & 3;
- leftOver.push(byte1, byte2, byte3, byte4);
- break;
- case 1:
- byte8 = byte & 1;
- byte7 = (byte >> 1) & 1;
- byte6 = (byte >> 2) & 1;
- byte5 = (byte >> 3) & 1;
- byte4 = (byte >> 4) & 1;
- byte3 = (byte >> 5) & 1;
- byte2 = (byte >> 6) & 1;
- byte1 = (byte >> 7) & 1;
- leftOver.push(byte1, byte2, byte3, byte4, byte5, byte6, byte7, byte8);
- break;
- }
- }
-
- return {
- get: function (count) {
- while (leftOver.length < count) {
- split();
- }
- let returner = leftOver.slice(0, count);
- leftOver = leftOver.slice(count);
- return returner;
- },
- resetAfterLine: function () {
- leftOver.length = 0;
- },
- end: function () {
- Iif (i !== data.length) {
- throw new Error("extra data found");
- }
- },
- };
-}
-
-function mapImage8Bit(image, pxData, getPxPos, bpp, data, rawPos) {
- // eslint-disable-line max-params
- let imageWidth = image.width;
- let imageHeight = image.height;
- let imagePass = image.index;
- for (let y = 0; y < imageHeight; y++) {
- for (let x = 0; x < imageWidth; x++) {
- let pxPos = getPxPos(x, y, imagePass);
- pixelBppMapper[bpp](pxData, data, pxPos, rawPos);
- rawPos += bpp; //eslint-disable-line no-param-reassign
- }
- }
- return rawPos;
-}
-
-function mapImageCustomBit(image, pxData, getPxPos, bpp, bits, maxBit) {
- // eslint-disable-line max-params
- let imageWidth = image.width;
- let imageHeight = image.height;
- let imagePass = image.index;
- for (let y = 0; y < imageHeight; y++) {
- for (let x = 0; x < imageWidth; x++) {
- let pixelData = bits.get(bpp);
- let pxPos = getPxPos(x, y, imagePass);
- pixelBppCustomMapper[bpp](pxData, pixelData, pxPos, maxBit);
- }
- bits.resetAfterLine();
- }
-}
-
-exports.dataToBitMap = function (data, bitmapInfo) {
- let width = bitmapInfo.width;
- let height = bitmapInfo.height;
- let depth = bitmapInfo.depth;
- let bpp = bitmapInfo.bpp;
- let interlace = bitmapInfo.interlace;
- let bits;
-
- if (depth !== 8) {
- bits = bitRetriever(data, depth);
- }
- let pxData;
- if (depth <= 8) {
- pxData = Buffer.alloc(width * height * 4);
- } else {
- pxData = new Uint16Array(width * height * 4);
- }
- let maxBit = Math.pow(2, depth) - 1;
- let rawPos = 0;
- let images;
- let getPxPos;
-
- if (interlace) {
- images = interlaceUtils.getImagePasses(width, height);
- getPxPos = interlaceUtils.getInterlaceIterator(width, height);
- } else {
- let nonInterlacedPxPos = 0;
- getPxPos = function () {
- let returner = nonInterlacedPxPos;
- nonInterlacedPxPos += 4;
- return returner;
- };
- images = [{ width: width, height: height }];
- }
-
- for (let imageIndex = 0; imageIndex < images.length; imageIndex++) {
- if (depth === 8) {
- rawPos = mapImage8Bit(
- images[imageIndex],
- pxData,
- getPxPos,
- bpp,
- data,
- rawPos
- );
- } else {
- mapImageCustomBit(
- images[imageIndex],
- pxData,
- getPxPos,
- bpp,
- bits,
- maxBit
- );
- }
- }
- if (depth === 8) {
- Iif (rawPos !== data.length) {
- throw new Error("extra data found");
- }
- } else {
- bits.end();
- }
-
- return pxData;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/bitpacker.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/bitpacker.js.html
deleted file mode 100644
index 50cca239..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/bitpacker.js.html
+++ /dev/null
@@ -1,554 +0,0 @@
-
-
-
-
-
- Code coverage report for bitpacker.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 11.36%
- Statements
- 10/88
-
-
-
-
- 6.12%
- Branches
- 3/49
-
-
-
-
- 66.67%
- Functions
- 2/3
-
-
-
-
- 11.63%
- Lines
- 10/86
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159 |
-
-1x
-
-1x
-
-325x
-
-
-325x
-325x
-325x
-325x
-
-325x
-
-
-325x
-325x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- | "use strict";
-
-let constants = require("./constants");
-
-module.exports = function (dataIn, width, height, options) {
- let outHasAlpha =
- [constants.COLORTYPE_COLOR_ALPHA, constants.COLORTYPE_ALPHA].indexOf(
- options.colorType
- ) !== -1;
- Eif (options.colorType === options.inputColorType) {
- let bigEndian = (function () {
- let buffer = new ArrayBuffer(2);
- new DataView(buffer).setInt16(0, 256, true /* littleEndian */);
- // Int16Array uses the platform's endianness.
- return new Int16Array(buffer)[0] !== 256;
- })();
- // If no need to convert to grayscale and alpha is present/absent in both, take a fast route
- Eif (options.bitDepth === 8 || (options.bitDepth === 16 && bigEndian)) {
- return dataIn;
- }
- }
-
- // map to a UInt16 array if data is 16bit, fix endianness below
- let data = options.bitDepth !== 16 ? dataIn : new Uint16Array(dataIn.buffer);
-
- let maxValue = 255;
- let inBpp = constants.COLORTYPE_TO_BPP_MAP[options.inputColorType];
- if (inBpp === 4 && !options.inputHasAlpha) {
- inBpp = 3;
- }
- let outBpp = constants.COLORTYPE_TO_BPP_MAP[options.colorType];
- if (options.bitDepth === 16) {
- maxValue = 65535;
- outBpp *= 2;
- }
- let outData = Buffer.alloc(width * height * outBpp);
-
- let inIndex = 0;
- let outIndex = 0;
-
- let bgColor = options.bgColor || {};
- if (bgColor.red === undefined) {
- bgColor.red = maxValue;
- }
- if (bgColor.green === undefined) {
- bgColor.green = maxValue;
- }
- if (bgColor.blue === undefined) {
- bgColor.blue = maxValue;
- }
-
- function getRGBA() {
- let red;
- let green;
- let blue;
- let alpha = maxValue;
- switch (options.inputColorType) {
- case constants.COLORTYPE_COLOR_ALPHA:
- alpha = data[inIndex + 3];
- red = data[inIndex];
- green = data[inIndex + 1];
- blue = data[inIndex + 2];
- break;
- case constants.COLORTYPE_COLOR:
- red = data[inIndex];
- green = data[inIndex + 1];
- blue = data[inIndex + 2];
- break;
- case constants.COLORTYPE_ALPHA:
- alpha = data[inIndex + 1];
- red = data[inIndex];
- green = red;
- blue = red;
- break;
- case constants.COLORTYPE_GRAYSCALE:
- red = data[inIndex];
- green = red;
- blue = red;
- break;
- default:
- throw new Error(
- "input color type:" +
- options.inputColorType +
- " is not supported at present"
- );
- }
-
- if (options.inputHasAlpha) {
- if (!outHasAlpha) {
- alpha /= maxValue;
- red = Math.min(
- Math.max(Math.round((1 - alpha) * bgColor.red + alpha * red), 0),
- maxValue
- );
- green = Math.min(
- Math.max(Math.round((1 - alpha) * bgColor.green + alpha * green), 0),
- maxValue
- );
- blue = Math.min(
- Math.max(Math.round((1 - alpha) * bgColor.blue + alpha * blue), 0),
- maxValue
- );
- }
- }
- return { red: red, green: green, blue: blue, alpha: alpha };
- }
-
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- let rgba = getRGBA(data, inIndex);
-
- switch (options.colorType) {
- case constants.COLORTYPE_COLOR_ALPHA:
- case constants.COLORTYPE_COLOR:
- if (options.bitDepth === 8) {
- outData[outIndex] = rgba.red;
- outData[outIndex + 1] = rgba.green;
- outData[outIndex + 2] = rgba.blue;
- if (outHasAlpha) {
- outData[outIndex + 3] = rgba.alpha;
- }
- } else {
- outData.writeUInt16BE(rgba.red, outIndex);
- outData.writeUInt16BE(rgba.green, outIndex + 2);
- outData.writeUInt16BE(rgba.blue, outIndex + 4);
- if (outHasAlpha) {
- outData.writeUInt16BE(rgba.alpha, outIndex + 6);
- }
- }
- break;
- case constants.COLORTYPE_ALPHA:
- case constants.COLORTYPE_GRAYSCALE: {
- // Convert to grayscale and alpha
- let grayscale = (rgba.red + rgba.green + rgba.blue) / 3;
- if (options.bitDepth === 8) {
- outData[outIndex] = grayscale;
- if (outHasAlpha) {
- outData[outIndex + 1] = rgba.alpha;
- }
- } else {
- outData.writeUInt16BE(grayscale, outIndex);
- if (outHasAlpha) {
- outData.writeUInt16BE(rgba.alpha, outIndex + 2);
- }
- }
- break;
- }
- default:
- throw new Error("unrecognised color Type " + options.colorType);
- }
-
- inIndex += inBpp;
- outIndex += outBpp;
- }
- }
-
- return outData;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/block-navigation.js b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/block-navigation.js
deleted file mode 100644
index 81d08c06..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/block-navigation.js
+++ /dev/null
@@ -1,77 +0,0 @@
-/* eslint-disable */
-var jumpToCode = (function init() {
- // Classes of code we would like to highlight in the file view
- var missingCoverageClasses = [".cbranch-no", ".cstat-no", ".fstat-no"];
-
- // Elements to highlight in the file listing view
- var fileListingElements = ["td.pct.low"];
-
- // We don't want to select elements that are direct descendants of another match
- var notSelector = ":not(" + missingCoverageClasses.join("):not(") + ") > "; // becomes `:not(a):not(b) > `
-
- // Selecter that finds elements on the page to which we can jump
- var selector =
- fileListingElements.join(", ") +
- ", " +
- notSelector +
- missingCoverageClasses.join(", " + notSelector); // becomes `:not(a):not(b) > a, :not(a):not(b) > b`
-
- // The NodeList of matching elements
- var missingCoverageElements = document.querySelectorAll(selector);
-
- var currentIndex;
-
- function toggleClass(index) {
- missingCoverageElements.item(currentIndex).classList.remove("highlighted");
- missingCoverageElements.item(index).classList.add("highlighted");
- }
-
- function makeCurrent(index) {
- toggleClass(index);
- currentIndex = index;
- missingCoverageElements.item(index).scrollIntoView({
- behavior: "smooth",
- block: "center",
- inline: "center",
- });
- }
-
- function goToPrevious() {
- var nextIndex = 0;
- if (typeof currentIndex !== "number" || currentIndex === 0) {
- nextIndex = missingCoverageElements.length - 1;
- } else if (missingCoverageElements.length > 1) {
- nextIndex = currentIndex - 1;
- }
-
- makeCurrent(nextIndex);
- }
-
- function goToNext() {
- var nextIndex = 0;
-
- if (
- typeof currentIndex === "number" &&
- currentIndex < missingCoverageElements.length - 1
- ) {
- nextIndex = currentIndex + 1;
- }
-
- makeCurrent(nextIndex);
- }
-
- return function jump(event) {
- switch (event.which) {
- case 78: // n
- case 74: // j
- goToNext();
- break;
- case 66: // b
- case 75: // k
- case 80: // p
- goToPrevious();
- break;
- }
- };
-})();
-window.addEventListener("keydown", jumpToCode);
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/chunkstream.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/chunkstream.js.html
deleted file mode 100644
index 552ffbaf..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/chunkstream.js.html
+++ /dev/null
@@ -1,647 +0,0 @@
-
-
-
-
-
- Code coverage report for chunkstream.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 90.11%
- Statements
- 82/91
-
-
-
-
- 81.4%
- Branches
- 35/43
-
-
-
-
- 100%
- Functions
- 10/10
-
-
-
-
- 90.11%
- Lines
- 82/91
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166
-167
-168
-169
-170
-171
-172
-173
-174
-175
-176
-177
-178
-179
-180
-181
-182
-183
-184
-185
-186
-187
-188
-189
-190 |
-
-1x
-1x
-
-1x
-529x
-
-529x
-529x
-
-529x
-529x
-
-529x
-529x
-
-1x
-
-1x
-13318x
-
-
-
-
-
-13318x
-
-13318x
-
-
-13318x
-
-
-
-
-
-
-
-
-1x
-943x
-
-
-
-
-
-943x
-943x
-
-
-
-
-943x
-943x
-
-943x
-
-
-943x
-346x
-
-
-943x
-
-
-1x
-311x
-
-
-
-311x
-
-
-311x
-
-
-
-
-311x
-309x
-
-2x
-2x
-
-
-
-1x
-
-1x
-311x
-3x
-
-
-311x
-
-
-1x
-327x
-
-
-
-327x
-327x
-327x
-
-327x
-
-
-1x
-
-741x
-
-
-741x
-
-
-741x
-568x
-568x
-
-568x
-
-
-173x
-173x
-
-173x
-
-
-
-1x
-12408x
-
-12408x
-12408x
-12408x
-
-
-12408x
-12617x
-12617x
-
-12617x
-12617x
-
-
-12617x
-11863x
-
-
-
-
-12408x
-532x
-
-
-12408x
-
-12408x
-
-
-1x
-14263x
-
-14263x
-15656x
-
-
-15656x
-741x
-14915x
-
-
-12408x
-
-
-
-2507x
-
-
-
-14263x
-2x
-
-
-
-
-
- | "use strict";
-
-let util = require("util");
-let Stream = require("stream");
-
-let ChunkStream = (module.exports = function () {
- Stream.call(this);
-
- this._buffers = [];
- this._buffered = 0;
-
- this._reads = [];
- this._paused = false;
-
- this._encoding = "utf8";
- this.writable = true;
-});
-util.inherits(ChunkStream, Stream);
-
-ChunkStream.prototype.read = function (length, callback) {
- this._reads.push({
- length: Math.abs(length), // if length < 0 then at most this length
- allowLess: length < 0,
- func: callback,
- });
-
- process.nextTick(
- function () {
- this._process();
-
- // its paused and there is not enought data then ask for more
- Iif (this._paused && this._reads.length > 0) {
- this._paused = false;
-
- this.emit("drain");
- }
- }.bind(this)
- );
-};
-
-ChunkStream.prototype.write = function (data, encoding) {
- Iif (!this.writable) {
- this.emit("error", new Error("Stream not writable"));
- return false;
- }
-
- let dataBuffer;
- Eif (Buffer.isBuffer(data)) {
- dataBuffer = data;
- } else {
- dataBuffer = Buffer.from(data, encoding || this._encoding);
- }
-
- this._buffers.push(dataBuffer);
- this._buffered += dataBuffer.length;
-
- this._process();
-
- // ok if there are no more read requests
- if (this._reads && this._reads.length === 0) {
- this._paused = true;
- }
-
- return this.writable && !this._paused;
-};
-
-ChunkStream.prototype.end = function (data, encoding) {
- Iif (data) {
- this.write(data, encoding);
- }
-
- this.writable = false;
-
- // already destroyed
- Iif (!this._buffers) {
- return;
- }
-
- // enqueue or handle end
- if (this._buffers.length === 0) {
- this._end();
- } else {
- this._buffers.push(null);
- this._process();
- }
-};
-
-ChunkStream.prototype.destroySoon = ChunkStream.prototype.end;
-
-ChunkStream.prototype._end = function () {
- if (this._reads.length > 0) {
- this.emit("error", new Error("Unexpected end of input"));
- }
-
- this.destroy();
-};
-
-ChunkStream.prototype.destroy = function () {
- Iif (!this._buffers) {
- return;
- }
-
- this.writable = false;
- this._reads = null;
- this._buffers = null;
-
- this.emit("close");
-};
-
-ChunkStream.prototype._processReadAllowingLess = function (read) {
- // ok there is any data so that we can satisfy this request
- this._reads.shift(); // == read
-
- // first we need to peek into first buffer
- let smallerBuf = this._buffers[0];
-
- // ok there is more data than we need
- if (smallerBuf.length > read.length) {
- this._buffered -= read.length;
- this._buffers[0] = smallerBuf.slice(read.length);
-
- read.func.call(this, smallerBuf.slice(0, read.length));
- } else {
- // ok this is less than maximum length so use it all
- this._buffered -= smallerBuf.length;
- this._buffers.shift(); // == smallerBuf
-
- read.func.call(this, smallerBuf);
- }
-};
-
-ChunkStream.prototype._processRead = function (read) {
- this._reads.shift(); // == read
-
- let pos = 0;
- let count = 0;
- let data = Buffer.alloc(read.length);
-
- // create buffer for all data
- while (pos < read.length) {
- let buf = this._buffers[count++];
- let len = Math.min(buf.length, read.length - pos);
-
- buf.copy(data, pos, 0, len);
- pos += len;
-
- // last buffer wasn't used all so just slice it and leave
- if (len !== buf.length) {
- this._buffers[--count] = buf.slice(len);
- }
- }
-
- // remove all used buffers
- if (count > 0) {
- this._buffers.splice(0, count);
- }
-
- this._buffered -= read.length;
-
- read.func.call(this, data);
-};
-
-ChunkStream.prototype._process = function () {
- try {
- // as long as there is any data and read requests
- while (this._buffered > 0 && this._reads && this._reads.length > 0) {
- let read = this._reads[0];
-
- // read any data (but no more than length)
- if (read.allowLess) {
- this._processReadAllowingLess(read);
- } else if (this._buffered >= read.length) {
- // ok we can meet some expectations
-
- this._processRead(read);
- } else {
- // not enought data to satisfy first request in queue
- // so we need to wait for more
- break;
- }
- }
-
- if (this._buffers && !this.writable) {
- this._end();
- }
- } catch (ex) {
- this.emit("error", ex);
- }
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/constants.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/constants.js.html
deleted file mode 100644
index a6edd802..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/constants.js.html
+++ /dev/null
@@ -1,176 +0,0 @@
-
-
-
-
-
- Code coverage report for constants.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 100%
- Statements
- 1/1
-
-
-
-
- 100%
- Branches
- 0/0
-
-
-
-
- 100%
- Functions
- 0/0
-
-
-
-
- 100%
- Lines
- 1/1
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33 |
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- | "use strict";
-
-module.exports = {
- PNG_SIGNATURE: [0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a],
-
- TYPE_IHDR: 0x49484452,
- TYPE_IEND: 0x49454e44,
- TYPE_IDAT: 0x49444154,
- TYPE_PLTE: 0x504c5445,
- TYPE_tRNS: 0x74524e53, // eslint-disable-line camelcase
- TYPE_gAMA: 0x67414d41, // eslint-disable-line camelcase
-
- // color-type bits
- COLORTYPE_GRAYSCALE: 0,
- COLORTYPE_PALETTE: 1,
- COLORTYPE_COLOR: 2,
- COLORTYPE_ALPHA: 4, // e.g. grayscale and alpha
-
- // color-type combinations
- COLORTYPE_PALETTE_COLOR: 3,
- COLORTYPE_COLOR_ALPHA: 6,
-
- COLORTYPE_TO_BPP_MAP: {
- 0: 1,
- 2: 3,
- 3: 1,
- 4: 2,
- 6: 4,
- },
-
- GAMMA_DIVISION: 100000,
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/crc.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/crc.js.html
deleted file mode 100644
index 53fc72a3..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/crc.js.html
+++ /dev/null
@@ -1,200 +0,0 @@
-
-
-
-
-
- Code coverage report for crc.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 100%
- Statements
- 26/26
-
-
-
-
- 100%
- Branches
- 2/2
-
-
-
-
- 100%
- Functions
- 5/5
-
-
-
-
- 100%
- Lines
- 22/22
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41 |
-
-1x
-
-1x
-1x
-256x
-256x
-2048x
-1024x
-
-1024x
-
-
-256x
-
-
-
-1x
-2461x
-
-
-1x
-4839x
-823519x
-
-4839x
-
-
-1x
-2195x
-
-
-1x
-1592x
-1592x
-305287x
-
-1592x
-
- | "use strict";
-
-let crcTable = [];
-
-(function () {
- for (let i = 0; i < 256; i++) {
- let currentCrc = i;
- for (let j = 0; j < 8; j++) {
- if (currentCrc & 1) {
- currentCrc = 0xedb88320 ^ (currentCrc >>> 1);
- } else {
- currentCrc = currentCrc >>> 1;
- }
- }
- crcTable[i] = currentCrc;
- }
-})();
-
-let CrcCalculator = (module.exports = function () {
- this._crc = -1;
-});
-
-CrcCalculator.prototype.write = function (data) {
- for (let i = 0; i < data.length; i++) {
- this._crc = crcTable[(this._crc ^ data[i]) & 0xff] ^ (this._crc >>> 8);
- }
- return true;
-};
-
-CrcCalculator.prototype.crc32 = function () {
- return this._crc ^ -1;
-};
-
-CrcCalculator.crc32 = function (buf) {
- let crc = -1;
- for (let i = 0; i < buf.length; i++) {
- crc = crcTable[(crc ^ buf[i]) & 0xff] ^ (crc >>> 8);
- }
- return crc ^ -1;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/favicon.png b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/favicon.png
deleted file mode 100644
index 66918178..00000000
Binary files a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/favicon.png and /dev/null differ
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-pack.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-pack.js.html
deleted file mode 100644
index e718a1a7..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-pack.js.html
+++ /dev/null
@@ -1,593 +0,0 @@
-
-
-
-
-
- Code coverage report for filter-pack.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 95.83%
- Statements
- 92/96
-
-
-
-
- 81.82%
- Branches
- 36/44
-
-
-
-
- 100%
- Functions
- 11/11
-
-
-
-
- 95.24%
- Lines
- 80/84
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166
-167
-168
-169
-170
-171
-172 |
-
-1x
-
-
-44x
-5136x
-
-
-
-
-10490x
-10490x
-
-10490x
-2776736x
-
-10490x
-
-
-
-637x
-107032x
-107032x
-
-107032x
-
-
-
-
-10490x
-10490x
-2776736x
-2776736x
-
-2776736x
-
-
-10490x
-
-
-
-2670x
-581344x
-581344x
-
-581344x
-
-
-
-
-10490x
-10490x
-10490x
-2776736x
-2776736x
-
-2776736x
-
-
-10490x
-
-
-
-208x
-204096x
-204096x
-204096x
-
-204096x
-
-
-
-
-10490x
-10490x
-2776736x
-2776736x
-2776736x
-
-2776736x
-
-
-10490x
-
-
-
-6931x
-1879128x
-1879128x
-
-1879128x
-1879128x
-
-1879128x
-
-
-
-
-10490x
-10490x
-2776736x
-2776736x
-
-2776736x
-2776736x
-
-2776736x
-
-
-10490x
-
-
-1x
-
-
-
-
-
-
-
-1x
-
-
-
-
-
-
-
-1x
-
-325x
-325x
-
-
-
-
-
-
-325x
-
-
-325x
-325x
-325x
-325x
-
-325x
-
-325x
-10490x
-
-10490x
-
-10490x
-52450x
-52450x
-35370x
-35370x
-
-
-
-
-10490x
-10490x
-10490x
-10490x
-10490x
-
-325x
-
- | "use strict";
-
-let paethPredictor = require("./paeth-predictor");
-
-function filterNone(pxData, pxPos, byteWidth, rawData, rawPos) {
- for (let x = 0; x < byteWidth; x++) {
- rawData[rawPos + x] = pxData[pxPos + x];
- }
-}
-
-function filterSumNone(pxData, pxPos, byteWidth) {
- let sum = 0;
- let length = pxPos + byteWidth;
-
- for (let i = pxPos; i < length; i++) {
- sum += Math.abs(pxData[i]);
- }
- return sum;
-}
-
-function filterSub(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let val = pxData[pxPos + x] - left;
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumSub(pxData, pxPos, byteWidth, bpp) {
- let sum = 0;
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let val = pxData[pxPos + x] - left;
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-function filterUp(pxData, pxPos, byteWidth, rawData, rawPos) {
- for (let x = 0; x < byteWidth; x++) {
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let val = pxData[pxPos + x] - up;
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumUp(pxData, pxPos, byteWidth) {
- let sum = 0;
- let length = pxPos + byteWidth;
- for (let x = pxPos; x < length; x++) {
- let up = pxPos > 0 ? pxData[x - byteWidth] : 0;
- let val = pxData[x] - up;
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-function filterAvg(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let val = pxData[pxPos + x] - ((left + up) >> 1);
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumAvg(pxData, pxPos, byteWidth, bpp) {
- let sum = 0;
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let val = pxData[pxPos + x] - ((left + up) >> 1);
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-function filterPaeth(pxData, pxPos, byteWidth, rawData, rawPos, bpp) {
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let upleft =
- pxPos > 0 && x >= bpp ? pxData[pxPos + x - (byteWidth + bpp)] : 0;
- let val = pxData[pxPos + x] - paethPredictor(left, up, upleft);
-
- rawData[rawPos + x] = val;
- }
-}
-
-function filterSumPaeth(pxData, pxPos, byteWidth, bpp) {
- let sum = 0;
- for (let x = 0; x < byteWidth; x++) {
- let left = x >= bpp ? pxData[pxPos + x - bpp] : 0;
- let up = pxPos > 0 ? pxData[pxPos + x - byteWidth] : 0;
- let upleft =
- pxPos > 0 && x >= bpp ? pxData[pxPos + x - (byteWidth + bpp)] : 0;
- let val = pxData[pxPos + x] - paethPredictor(left, up, upleft);
-
- sum += Math.abs(val);
- }
-
- return sum;
-}
-
-let filters = {
- 0: filterNone,
- 1: filterSub,
- 2: filterUp,
- 3: filterAvg,
- 4: filterPaeth,
-};
-
-let filterSums = {
- 0: filterSumNone,
- 1: filterSumSub,
- 2: filterSumUp,
- 3: filterSumAvg,
- 4: filterSumPaeth,
-};
-
-module.exports = function (pxData, width, height, options, bpp) {
- let filterTypes;
- Eif (!("filterType" in options) || options.filterType === -1) {
- filterTypes = [0, 1, 2, 3, 4];
- } else if (typeof options.filterType === "number") {
- filterTypes = [options.filterType];
- } else {
- throw new Error("unrecognised filter types");
- }
-
- Iif (options.bitDepth === 16) {
- bpp *= 2;
- }
- let byteWidth = width * bpp;
- let rawPos = 0;
- let pxPos = 0;
- let rawData = Buffer.alloc((byteWidth + 1) * height);
-
- let sel = filterTypes[0];
-
- for (let y = 0; y < height; y++) {
- Eif (filterTypes.length > 1) {
- // find best filter for this line (with lowest sum of values)
- let min = Infinity;
-
- for (let i = 0; i < filterTypes.length; i++) {
- let sum = filterSums[filterTypes[i]](pxData, pxPos, byteWidth, bpp);
- if (sum < min) {
- sel = filterTypes[i];
- min = sum;
- }
- }
- }
-
- rawData[rawPos] = sel;
- rawPos++;
- filters[sel](pxData, pxPos, byteWidth, rawData, rawPos, bpp);
- rawPos += byteWidth;
- pxPos += byteWidth;
- }
- return rawData;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse-async.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse-async.js.html
deleted file mode 100644
index 06f25f17..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse-async.js.html
+++ /dev/null
@@ -1,152 +0,0 @@
-
-
-
-
-
- Code coverage report for filter-parse-async.js
-
-
-
-
-
-
-
-
-
-
-
-
All files filter-parse-async.js
-
-
-
- 100%
- Statements
- 12/12
-
-
-
-
- 100%
- Branches
- 0/0
-
-
-
-
- 100%
- Functions
- 3/3
-
-
-
-
- 100%
- Lines
- 12/12
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25 |
-
-1x
-1x
-1x
-
-1x
-176x
-
-176x
-176x
-176x
-
-
-9057x
-
-
-173x
-
-
-
-176x
-
-1x
- | "use strict";
-
-let util = require("util");
-let ChunkStream = require("./chunkstream");
-let Filter = require("./filter-parse");
-
-let FilterAsync = (module.exports = function (bitmapInfo) {
- ChunkStream.call(this);
-
- let buffers = [];
- let that = this;
- this._filter = new Filter(bitmapInfo, {
- read: this.read.bind(this),
- write: function (buffer) {
- buffers.push(buffer);
- },
- complete: function () {
- that.emit("complete", Buffer.concat(buffers));
- },
- });
-
- this._filter.start();
-});
-util.inherits(FilterAsync, ChunkStream);
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse-sync.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse-sync.js.html
deleted file mode 100644
index df91a354..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse-sync.js.html
+++ /dev/null
@@ -1,143 +0,0 @@
-
-
-
-
-
- Code coverage report for filter-parse-sync.js
-
-
-
-
-
-
-
-
-
-
-
-
All files filter-parse-sync.js
-
-
-
- 100%
- Statements
- 10/10
-
-
-
-
- 100%
- Branches
- 0/0
-
-
-
-
- 100%
- Functions
- 3/3
-
-
-
-
- 100%
- Lines
- 10/10
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22 |
-
-1x
-1x
-
-1x
-162x
-162x
-162x
-
-
-6337x
-
-
-
-
-162x
-162x
-
-162x
-
- | "use strict";
-
-let SyncReader = require("./sync-reader");
-let Filter = require("./filter-parse");
-
-exports.process = function (inBuffer, bitmapInfo) {
- let outBuffers = [];
- let reader = new SyncReader(inBuffer);
- let filter = new Filter(bitmapInfo, {
- read: reader.read.bind(reader),
- write: function (bufferPart) {
- outBuffers.push(bufferPart);
- },
- complete: function () {},
- });
-
- filter.start();
- reader.process();
-
- return Buffer.concat(outBuffers);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse.js.html
deleted file mode 100644
index 945757ce..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/filter-parse.js.html
+++ /dev/null
@@ -1,611 +0,0 @@
-
-
-
-
-
- Code coverage report for filter-parse.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 98.96%
- Statements
- 95/96
-
-
-
-
- 97.14%
- Branches
- 34/35
-
-
-
-
- 100%
- Functions
- 8/8
-
-
-
-
- 98.9%
- Lines
- 90/91
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166
-167
-168
-169
-170
-171
-172
-173
-174
-175
-176
-177
-178 |
-
-1x
-1x
-
-
-742x
-742x
-531x
-
-742x
-
-
-1x
-338x
-338x
-338x
-338x
-338x
-
-338x
-338x
-338x
-
-338x
-338x
-338x
-72x
-72x
-476x
-
-
-
-
-
-
-266x
-
-
-
-
-
-
-
-
-
-
-338x
-127x
-211x
-66x
-
-145x
-
-
-
-1x
-338x
-
-
-
-
-
-1x
-
-
-
-
-1939x
-1939x
-
-1939x
-3563504x
-3563504x
-3563504x
-
-
-
-1x
-
-
-
-
-800x
-
-800x
-330256x
-330256x
-330256x
-
-
-
-1x
-
-
-
-
-172x
-172x
-172x
-
-172x
-9952x
-9952x
-9952x
-9952x
-9952x
-
-
-
-1x
-
-
-
-
-4165x
-4165x
-4165x
-
-4165x
-1152544x
-1152544x
-1152544x
-1152544x
-1152544x
-1152544x
-
-
-
-1x
-15394x
-
-15394x
-15394x
-
-15394x
-8318x
-
-7076x
-
-7076x
-
-1939x
-1939x
-
-800x
-800x
-
-172x
-172x
-
-4165x
-4165x
-
-
-
-
-
-15394x
-
-15394x
-15394x
-739x
-739x
-739x
-
-14655x
-
-
-15394x
-
-15059x
-
-335x
-335x
-
-
- | "use strict";
-
-let interlaceUtils = require("./interlace");
-let paethPredictor = require("./paeth-predictor");
-
-function getByteWidth(width, bpp, depth) {
- let byteWidth = width * bpp;
- if (depth !== 8) {
- byteWidth = Math.ceil(byteWidth / (8 / depth));
- }
- return byteWidth;
-}
-
-let Filter = (module.exports = function (bitmapInfo, dependencies) {
- let width = bitmapInfo.width;
- let height = bitmapInfo.height;
- let interlace = bitmapInfo.interlace;
- let bpp = bitmapInfo.bpp;
- let depth = bitmapInfo.depth;
-
- this.read = dependencies.read;
- this.write = dependencies.write;
- this.complete = dependencies.complete;
-
- this._imageIndex = 0;
- this._images = [];
- if (interlace) {
- let passes = interlaceUtils.getImagePasses(width, height);
- for (let i = 0; i < passes.length; i++) {
- this._images.push({
- byteWidth: getByteWidth(passes[i].width, bpp, depth),
- height: passes[i].height,
- lineIndex: 0,
- });
- }
- } else {
- this._images.push({
- byteWidth: getByteWidth(width, bpp, depth),
- height: height,
- lineIndex: 0,
- });
- }
-
- // when filtering the line we look at the pixel to the left
- // the spec also says it is done on a byte level regardless of the number of pixels
- // so if the depth is byte compatible (8 or 16) we subtract the bpp in order to compare back
- // a pixel rather than just a different byte part. However if we are sub byte, we ignore.
- if (depth === 8) {
- this._xComparison = bpp;
- } else if (depth === 16) {
- this._xComparison = bpp * 2;
- } else {
- this._xComparison = 1;
- }
-});
-
-Filter.prototype.start = function () {
- this.read(
- this._images[this._imageIndex].byteWidth + 1,
- this._reverseFilterLine.bind(this)
- );
-};
-
-Filter.prototype._unFilterType1 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let xComparison = this._xComparison;
- let xBiggerThan = xComparison - 1;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f1Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;
- unfilteredLine[x] = rawByte + f1Left;
- }
-};
-
-Filter.prototype._unFilterType2 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let lastLine = this._lastLine;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f2Up = lastLine ? lastLine[x] : 0;
- unfilteredLine[x] = rawByte + f2Up;
- }
-};
-
-Filter.prototype._unFilterType3 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let xComparison = this._xComparison;
- let xBiggerThan = xComparison - 1;
- let lastLine = this._lastLine;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f3Up = lastLine ? lastLine[x] : 0;
- let f3Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;
- let f3Add = Math.floor((f3Left + f3Up) / 2);
- unfilteredLine[x] = rawByte + f3Add;
- }
-};
-
-Filter.prototype._unFilterType4 = function (
- rawData,
- unfilteredLine,
- byteWidth
-) {
- let xComparison = this._xComparison;
- let xBiggerThan = xComparison - 1;
- let lastLine = this._lastLine;
-
- for (let x = 0; x < byteWidth; x++) {
- let rawByte = rawData[1 + x];
- let f4Up = lastLine ? lastLine[x] : 0;
- let f4Left = x > xBiggerThan ? unfilteredLine[x - xComparison] : 0;
- let f4UpLeft = x > xBiggerThan && lastLine ? lastLine[x - xComparison] : 0;
- let f4Add = paethPredictor(f4Left, f4Up, f4UpLeft);
- unfilteredLine[x] = rawByte + f4Add;
- }
-};
-
-Filter.prototype._reverseFilterLine = function (rawData) {
- let filter = rawData[0];
- let unfilteredLine;
- let currentImage = this._images[this._imageIndex];
- let byteWidth = currentImage.byteWidth;
-
- if (filter === 0) {
- unfilteredLine = rawData.slice(1, byteWidth + 1);
- } else {
- unfilteredLine = Buffer.alloc(byteWidth);
-
- switch (filter) {
- case 1:
- this._unFilterType1(rawData, unfilteredLine, byteWidth);
- break;
- case 2:
- this._unFilterType2(rawData, unfilteredLine, byteWidth);
- break;
- case 3:
- this._unFilterType3(rawData, unfilteredLine, byteWidth);
- break;
- case 4:
- this._unFilterType4(rawData, unfilteredLine, byteWidth);
- break;
- default:
- throw new Error("Unrecognised filter type - " + filter);
- }
- }
-
- this.write(unfilteredLine);
-
- currentImage.lineIndex++;
- if (currentImage.lineIndex >= currentImage.height) {
- this._lastLine = null;
- this._imageIndex++;
- currentImage = this._images[this._imageIndex];
- } else {
- this._lastLine = unfilteredLine;
- }
-
- if (currentImage) {
- // read, using the byte width that may be from the new current image
- this.read(currentImage.byteWidth + 1, this._reverseFilterLine.bind(this));
- } else {
- this._lastLine = null;
- this.complete();
- }
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/format-normaliser.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/format-normaliser.js.html
deleted file mode 100644
index c61afcfd..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/format-normaliser.js.html
+++ /dev/null
@@ -1,359 +0,0 @@
-
-
-
-
-
- Code coverage report for format-normaliser.js
-
-
-
-
-
-
-
-
-
-
-
-
All files format-normaliser.js
-
-
-
- 98.21%
- Statements
- 55/56
-
-
-
-
- 95.24%
- Branches
- 20/21
-
-
-
-
- 100%
- Functions
- 4/4
-
-
-
-
- 97.87%
- Lines
- 46/47
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94 |
-
-
-131x
-
-131x
-4912x
-1418436x
-
-1418436x
-
-
-
-1418436x
-5673744x
-
-1418436x
-
-
-
-
-
-12x
-12x
-384x
-12288x
-
-12288x
-6144x
-2762x
-
-6144x
-
-
-
-
-2718x
-
-12288x
-5480x
-21920x
-
-
-12288x
-
-
-
-
-
-106x
-106x
-106x
-
-106x
-3392x
-108544x
-434176x
-
-
-
-108544x
-
-
-
-
-1x
-335x
-335x
-335x
-335x
-335x
-335x
-
-335x
-
-335x
-
-131x
-
-204x
-12x
-
-
-204x
-
-106x
-66x
-
-106x
-
-
-335x
-
- | "use strict";
-
-function dePalette(indata, outdata, width, height, palette) {
- let pxPos = 0;
- // use values from palette
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- let color = palette[indata[pxPos]];
-
- Iif (!color) {
- throw new Error("index " + indata[pxPos] + " not in palette");
- }
-
- for (let i = 0; i < 4; i++) {
- outdata[pxPos + i] = color[i];
- }
- pxPos += 4;
- }
- }
-}
-
-function replaceTransparentColor(indata, outdata, width, height, transColor) {
- let pxPos = 0;
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- let makeTrans = false;
-
- if (transColor.length === 1) {
- if (transColor[0] === indata[pxPos]) {
- makeTrans = true;
- }
- } else if (
- transColor[0] === indata[pxPos] &&
- transColor[1] === indata[pxPos + 1] &&
- transColor[2] === indata[pxPos + 2]
- ) {
- makeTrans = true;
- }
- if (makeTrans) {
- for (let i = 0; i < 4; i++) {
- outdata[pxPos + i] = 0;
- }
- }
- pxPos += 4;
- }
- }
-}
-
-function scaleDepth(indata, outdata, width, height, depth) {
- let maxOutSample = 255;
- let maxInSample = Math.pow(2, depth) - 1;
- let pxPos = 0;
-
- for (let y = 0; y < height; y++) {
- for (let x = 0; x < width; x++) {
- for (let i = 0; i < 4; i++) {
- outdata[pxPos + i] = Math.floor(
- (indata[pxPos + i] * maxOutSample) / maxInSample + 0.5
- );
- }
- pxPos += 4;
- }
- }
-}
-
-module.exports = function (indata, imageData) {
- let depth = imageData.depth;
- let width = imageData.width;
- let height = imageData.height;
- let colorType = imageData.colorType;
- let transColor = imageData.transColor;
- let palette = imageData.palette;
-
- let outdata = indata; // only different for 16 bits
-
- if (colorType === 3) {
- // paletted
- dePalette(indata, outdata, width, height, palette);
- } else {
- if (transColor) {
- replaceTransparentColor(indata, outdata, width, height, transColor);
- }
- // if it needs scaling
- if (depth !== 8) {
- // if we need to change the buffer size
- if (depth === 16) {
- outdata = Buffer.alloc(width * height * 4);
- }
- scaleDepth(indata, outdata, width, height, depth);
- }
- }
- return outdata;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/index.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/index.html
deleted file mode 100644
index 51ecafd0..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/index.html
+++ /dev/null
@@ -1,426 +0,0 @@
-
-
-
-
-
- Code coverage report for All files
-
-
-
-
-
-
-
-
-
-
-
-
All files
-
-
-
- 82.72%
- Statements
- 1034/1250
-
-
-
-
- 67.59%
- Branches
- 317/469
-
-
-
-
- 90.26%
- Functions
- 139/154
-
-
-
-
- 82.53%
- Lines
- 992/1202
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-
-
-
- | File |
- |
- Statements |
- |
- Branches |
- |
- Functions |
- |
- Lines |
- |
-
-
-
- | bitmapper.js |
-
-
- |
- 94.37% |
- 134/142 |
- 72.41% |
- 21/29 |
- 89.47% |
- 17/19 |
- 94.16% |
- 129/137 |
-
-
-
- | bitpacker.js |
-
-
- |
- 11.36% |
- 10/88 |
- 6.12% |
- 3/49 |
- 66.67% |
- 2/3 |
- 11.63% |
- 10/86 |
-
-
-
- | chunkstream.js |
-
-
- |
- 90.11% |
- 82/91 |
- 81.4% |
- 35/43 |
- 100% |
- 10/10 |
- 90.11% |
- 82/91 |
-
-
-
- | constants.js |
-
-
- |
- 100% |
- 1/1 |
- 100% |
- 0/0 |
- 100% |
- 0/0 |
- 100% |
- 1/1 |
-
-
-
- | crc.js |
-
-
- |
- 100% |
- 26/26 |
- 100% |
- 2/2 |
- 100% |
- 5/5 |
- 100% |
- 22/22 |
-
-
-
- | filter-pack.js |
-
-
- |
- 95.83% |
- 92/96 |
- 81.82% |
- 36/44 |
- 100% |
- 11/11 |
- 95.24% |
- 80/84 |
-
-
-
- | filter-parse-async.js |
-
-
- |
- 100% |
- 12/12 |
- 100% |
- 0/0 |
- 100% |
- 3/3 |
- 100% |
- 12/12 |
-
-
-
- | filter-parse-sync.js |
-
-
- |
- 100% |
- 10/10 |
- 100% |
- 0/0 |
- 100% |
- 3/3 |
- 100% |
- 10/10 |
-
-
-
- | filter-parse.js |
-
-
- |
- 98.96% |
- 95/96 |
- 97.14% |
- 34/35 |
- 100% |
- 8/8 |
- 98.9% |
- 90/91 |
-
-
-
- | format-normaliser.js |
-
-
- |
- 98.21% |
- 55/56 |
- 95.24% |
- 20/21 |
- 100% |
- 4/4 |
- 97.87% |
- 46/47 |
-
-
-
- | interlace.js |
-
-
- |
- 100% |
- 32/32 |
- 100% |
- 8/8 |
- 100% |
- 3/3 |
- 100% |
- 29/29 |
-
-
-
- | packer-async.js |
-
-
- |
- 100% |
- 24/24 |
- 75% |
- 3/4 |
- 100% |
- 4/4 |
- 100% |
- 24/24 |
-
-
-
- | packer-sync.js |
-
-
- |
- 25% |
- 6/24 |
- 8.33% |
- 1/12 |
- 0% |
- 0/1 |
- 25% |
- 6/24 |
-
-
-
- | packer.js |
-
-
- |
- 94.74% |
- 54/57 |
- 67.86% |
- 19/28 |
- 100% |
- 9/9 |
- 94.74% |
- 54/57 |
-
-
-
- | paeth-predictor.js |
-
-
- |
- 100% |
- 10/10 |
- 100% |
- 6/6 |
- 100% |
- 1/1 |
- 100% |
- 10/10 |
-
-
-
- | parser-async.js |
-
-
- |
- 88.75% |
- 71/80 |
- 72.73% |
- 16/22 |
- 84.62% |
- 11/13 |
- 88.75% |
- 71/80 |
-
-
-
- | parser-sync.js |
-
-
- |
- 93.33% |
- 42/45 |
- 78.57% |
- 11/14 |
- 100% |
- 8/8 |
- 93.33% |
- 42/45 |
-
-
-
- | parser.js |
-
-
- |
- 90.57% |
- 144/159 |
- 85.45% |
- 47/55 |
- 100% |
- 20/20 |
- 90.32% |
- 140/155 |
-
-
-
- | png-sync.js |
-
-
- |
- 83.33% |
- 5/6 |
- 100% |
- 2/2 |
- 50% |
- 1/2 |
- 83.33% |
- 5/6 |
-
-
-
- | png.js |
-
-
- |
- 54.17% |
- 52/96 |
- 41.18% |
- 14/34 |
- 56.25% |
- 9/16 |
- 56.52% |
- 52/92 |
-
-
-
- | sync-inflate.js |
-
-
- |
- 75.31% |
- 61/81 |
- 62% |
- 31/50 |
- 87.5% |
- 7/8 |
- 75.31% |
- 61/81 |
-
-
-
- | sync-reader.js |
-
-
- |
- 88.89% |
- 16/18 |
- 72.73% |
- 8/11 |
- 100% |
- 3/3 |
- 88.89% |
- 16/18 |
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/interlace.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/interlace.js.html
deleted file mode 100644
index d67b0878..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/interlace.js.html
+++ /dev/null
@@ -1,365 +0,0 @@
-
-
-
-
-
- Code coverage report for interlace.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 100%
- Statements
- 32/32
-
-
-
-
- 100%
- Branches
- 8/8
-
-
-
-
- 100%
- Functions
- 3/3
-
-
-
-
- 100%
- Lines
- 29/29
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96 |
-
-
-
-
-
-
-
-
-
-
-
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-1x
-144x
-144x
-144x
-144x
-144x
-144x
-1008x
-1008x
-1008x
-1008x
-1556x
-672x
-
-884x
-
-
-1008x
-1360x
-552x
-
-808x
-
-
-1008x
-952x
-
-
-144x
-
-
-1x
-72x
-324850x
-
-324850x
-
-324850x
-
-324850x
-
-324850x
-
-
- | "use strict";
-
-// Adam 7
-// 0 1 2 3 4 5 6 7
-// 0 x 6 4 6 x 6 4 6
-// 1 7 7 7 7 7 7 7 7
-// 2 5 6 5 6 5 6 5 6
-// 3 7 7 7 7 7 7 7 7
-// 4 3 6 4 6 3 6 4 6
-// 5 7 7 7 7 7 7 7 7
-// 6 5 6 5 6 5 6 5 6
-// 7 7 7 7 7 7 7 7 7
-
-let imagePasses = [
- {
- // pass 1 - 1px
- x: [0],
- y: [0],
- },
- {
- // pass 2 - 1px
- x: [4],
- y: [0],
- },
- {
- // pass 3 - 2px
- x: [0, 4],
- y: [4],
- },
- {
- // pass 4 - 4px
- x: [2, 6],
- y: [0, 4],
- },
- {
- // pass 5 - 8px
- x: [0, 2, 4, 6],
- y: [2, 6],
- },
- {
- // pass 6 - 16px
- x: [1, 3, 5, 7],
- y: [0, 2, 4, 6],
- },
- {
- // pass 7 - 32px
- x: [0, 1, 2, 3, 4, 5, 6, 7],
- y: [1, 3, 5, 7],
- },
-];
-
-exports.getImagePasses = function (width, height) {
- let images = [];
- let xLeftOver = width % 8;
- let yLeftOver = height % 8;
- let xRepeats = (width - xLeftOver) / 8;
- let yRepeats = (height - yLeftOver) / 8;
- for (let i = 0; i < imagePasses.length; i++) {
- let pass = imagePasses[i];
- let passWidth = xRepeats * pass.x.length;
- let passHeight = yRepeats * pass.y.length;
- for (let j = 0; j < pass.x.length; j++) {
- if (pass.x[j] < xLeftOver) {
- passWidth++;
- } else {
- break;
- }
- }
- for (let j = 0; j < pass.y.length; j++) {
- if (pass.y[j] < yLeftOver) {
- passHeight++;
- } else {
- break;
- }
- }
- if (passWidth > 0 && passHeight > 0) {
- images.push({ width: passWidth, height: passHeight, index: i });
- }
- }
- return images;
-};
-
-exports.getInterlaceIterator = function (width) {
- return function (x, y, pass) {
- let outerXLeftOver = x % imagePasses[pass].x.length;
- let outerX =
- ((x - outerXLeftOver) / imagePasses[pass].x.length) * 8 +
- imagePasses[pass].x[outerXLeftOver];
- let outerYLeftOver = y % imagePasses[pass].y.length;
- let outerY =
- ((y - outerYLeftOver) / imagePasses[pass].y.length) * 8 +
- imagePasses[pass].y[outerYLeftOver];
- return outerX * 4 + outerY * width * 4;
- };
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer-async.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer-async.js.html
deleted file mode 100644
index 55365c71..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer-async.js.html
+++ /dev/null
@@ -1,230 +0,0 @@
-
-
-
-
-
- Code coverage report for packer-async.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 100%
- Statements
- 24/24
-
-
-
-
- 75%
- Branches
- 3/4
-
-
-
-
- 100%
- Functions
- 4/4
-
-
-
-
- 100%
- Lines
- 24/24
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51 |
-
-1x
-1x
-1x
-1x
-
-1x
-353x
-
-353x
-
-353x
-353x
-
-353x
-
-1x
-
-1x
-
-325x
-325x
-
-325x
-290x
-
-
-325x
-
-
-325x
-
-325x
-
-
-652x
-
-
-
-325x
-
-
-325x
-325x
-
-
-
-325x
-
- | "use strict";
-
-let util = require("util");
-let Stream = require("stream");
-let constants = require("./constants");
-let Packer = require("./packer");
-
-let PackerAsync = (module.exports = function (opt) {
- Stream.call(this);
-
- let options = opt || {};
-
- this._packer = new Packer(options);
- this._deflate = this._packer.createDeflate();
-
- this.readable = true;
-});
-util.inherits(PackerAsync, Stream);
-
-PackerAsync.prototype.pack = function (data, width, height, gamma) {
- // Signature
- this.emit("data", Buffer.from(constants.PNG_SIGNATURE));
- this.emit("data", this._packer.packIHDR(width, height));
-
- if (gamma) {
- this.emit("data", this._packer.packGAMA(gamma));
- }
-
- let filteredData = this._packer.filterData(data, width, height);
-
- // compress it
- this._deflate.on("error", this.emit.bind(this, "error"));
-
- this._deflate.on(
- "data",
- function (compressedData) {
- this.emit("data", this._packer.packIDAT(compressedData));
- }.bind(this)
- );
-
- this._deflate.on(
- "end",
- function () {
- this.emit("data", this._packer.packIEND());
- this.emit("end");
- }.bind(this)
- );
-
- this._deflate.end(filteredData);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer-sync.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer-sync.js.html
deleted file mode 100644
index 86283b56..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer-sync.js.html
+++ /dev/null
@@ -1,248 +0,0 @@
-
-
-
-
-
- Code coverage report for packer-sync.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 25%
- Statements
- 6/24
-
-
-
-
- 8.33%
- Branches
- 1/12
-
-
-
-
- 0%
- Functions
- 0/1
-
-
-
-
- 25%
- Lines
- 6/24
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57 |
-
-1x
-1x
-1x
-
-
-1x
-1x
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- | "use strict";
-
-let hasSyncZlib = true;
-let zlib = require("zlib");
-Iif (!zlib.deflateSync) {
- hasSyncZlib = false;
-}
-let constants = require("./constants");
-let Packer = require("./packer");
-
-module.exports = function (metaData, opt) {
- if (!hasSyncZlib) {
- throw new Error(
- "To use the sync capability of this library in old node versions, please pin pngjs to v2.3.0"
- );
- }
-
- let options = opt || {};
-
- let packer = new Packer(options);
-
- let chunks = [];
-
- // Signature
- chunks.push(Buffer.from(constants.PNG_SIGNATURE));
-
- // Header
- chunks.push(packer.packIHDR(metaData.width, metaData.height));
-
- if (metaData.gamma) {
- chunks.push(packer.packGAMA(metaData.gamma));
- }
-
- let filteredData = packer.filterData(
- metaData.data,
- metaData.width,
- metaData.height
- );
-
- // compress it
- let compressedData = zlib.deflateSync(
- filteredData,
- packer.getDeflateOptions()
- );
- filteredData = null;
-
- if (!compressedData || !compressedData.length) {
- throw new Error("bad png - invalid compressed data response");
- }
- chunks.push(packer.packIDAT(compressedData));
-
- // End
- chunks.push(packer.packIEND());
-
- return Buffer.concat(chunks);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer.js.html
deleted file mode 100644
index 606e1930..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/packer.js.html
+++ /dev/null
@@ -1,467 +0,0 @@
-
-
-
-
-
- Code coverage report for packer.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 94.74%
- Statements
- 54/57
-
-
-
-
- 67.86%
- Branches
- 19/28
-
-
-
-
- 100%
- Functions
- 9/9
-
-
-
-
- 94.74%
- Lines
- 54/57
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130 |
-
-1x
-1x
-1x
-1x
-1x
-
-1x
-353x
-
-353x
-353x
-
-353x
-
-353x
-
-353x
-353x
-
-353x
-
-
-
-353x
-
-
-
-
-353x
-
-
-
-
-
-
-
-
-
-
-
-353x
-
-
-
-
-
-
-
-
-
-
-
-
-
-353x
-
-
-
-
-
-
-1x
-353x
-
-
-
-
-
-
-1x
-353x
-
-
-1x
-
-325x
-
-
-325x
-325x
-325x
-
-
-1x
-1592x
-1592x
-
-1592x
-1592x
-
-1592x
-1267x
-
-
-1592x
-
-
-
-1592x
-
-
-1x
-290x
-290x
-290x
-
-
-1x
-325x
-325x
-325x
-325x
-325x
-325x
-325x
-325x
-
-325x
-
-
-1x
-652x
-
-
-1x
-325x
-
- | "use strict";
-
-let constants = require("./constants");
-let CrcStream = require("./crc");
-let bitPacker = require("./bitpacker");
-let filter = require("./filter-pack");
-let zlib = require("zlib");
-
-let Packer = (module.exports = function (options) {
- this._options = options;
-
- options.deflateChunkSize = options.deflateChunkSize || 32 * 1024;
- options.deflateLevel =
- options.deflateLevel != null ? options.deflateLevel : 9;
- options.deflateStrategy =
- options.deflateStrategy != null ? options.deflateStrategy : 3;
- options.inputHasAlpha =
- options.inputHasAlpha != null ? options.inputHasAlpha : true;
- options.deflateFactory = options.deflateFactory || zlib.createDeflate;
- options.bitDepth = options.bitDepth || 8;
- // This is outputColorType
- options.colorType =
- typeof options.colorType === "number"
- ? options.colorType
- : constants.COLORTYPE_COLOR_ALPHA;
- options.inputColorType =
- typeof options.inputColorType === "number"
- ? options.inputColorType
- : constants.COLORTYPE_COLOR_ALPHA;
-
- Iif (
- [
- constants.COLORTYPE_GRAYSCALE,
- constants.COLORTYPE_COLOR,
- constants.COLORTYPE_COLOR_ALPHA,
- constants.COLORTYPE_ALPHA,
- ].indexOf(options.colorType) === -1
- ) {
- throw new Error(
- "option color type:" + options.colorType + " is not supported at present"
- );
- }
- Iif (
- [
- constants.COLORTYPE_GRAYSCALE,
- constants.COLORTYPE_COLOR,
- constants.COLORTYPE_COLOR_ALPHA,
- constants.COLORTYPE_ALPHA,
- ].indexOf(options.inputColorType) === -1
- ) {
- throw new Error(
- "option input color type:" +
- options.inputColorType +
- " is not supported at present"
- );
- }
- Iif (options.bitDepth !== 8 && options.bitDepth !== 16) {
- throw new Error(
- "option bit depth:" + options.bitDepth + " is not supported at present"
- );
- }
-});
-
-Packer.prototype.getDeflateOptions = function () {
- return {
- chunkSize: this._options.deflateChunkSize,
- level: this._options.deflateLevel,
- strategy: this._options.deflateStrategy,
- };
-};
-
-Packer.prototype.createDeflate = function () {
- return this._options.deflateFactory(this.getDeflateOptions());
-};
-
-Packer.prototype.filterData = function (data, width, height) {
- // convert to correct format for filtering (e.g. right bpp and bit depth)
- let packedData = bitPacker(data, width, height, this._options);
-
- // filter pixel data
- let bpp = constants.COLORTYPE_TO_BPP_MAP[this._options.colorType];
- let filteredData = filter(packedData, width, height, this._options, bpp);
- return filteredData;
-};
-
-Packer.prototype._packChunk = function (type, data) {
- let len = data ? data.length : 0;
- let buf = Buffer.alloc(len + 12);
-
- buf.writeUInt32BE(len, 0);
- buf.writeUInt32BE(type, 4);
-
- if (data) {
- data.copy(buf, 8);
- }
-
- buf.writeInt32BE(
- CrcStream.crc32(buf.slice(4, buf.length - 4)),
- buf.length - 4
- );
- return buf;
-};
-
-Packer.prototype.packGAMA = function (gamma) {
- let buf = Buffer.alloc(4);
- buf.writeUInt32BE(Math.floor(gamma * constants.GAMMA_DIVISION), 0);
- return this._packChunk(constants.TYPE_gAMA, buf);
-};
-
-Packer.prototype.packIHDR = function (width, height) {
- let buf = Buffer.alloc(13);
- buf.writeUInt32BE(width, 0);
- buf.writeUInt32BE(height, 4);
- buf[8] = this._options.bitDepth; // Bit depth
- buf[9] = this._options.colorType; // colorType
- buf[10] = 0; // compression
- buf[11] = 0; // filter
- buf[12] = 0; // interlace
-
- return this._packChunk(constants.TYPE_IHDR, buf);
-};
-
-Packer.prototype.packIDAT = function (data) {
- return this._packChunk(constants.TYPE_IDAT, data);
-};
-
-Packer.prototype.packIEND = function () {
- return this._packChunk(constants.TYPE_IEND, null);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/paeth-predictor.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/paeth-predictor.js.html
deleted file mode 100644
index 6385999a..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/paeth-predictor.js.html
+++ /dev/null
@@ -1,128 +0,0 @@
-
-
-
-
-
- Code coverage report for paeth-predictor.js
-
-
-
-
-
-
-
-
-
-
-
-
All files paeth-predictor.js
-
-
-
- 100%
- Statements
- 10/10
-
-
-
-
- 100%
- Branches
- 6/6
-
-
-
-
- 100%
- Functions
- 1/1
-
-
-
-
- 100%
- Lines
- 10/10
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17 |
-
-1x
-5808408x
-5808408x
-5808408x
-5808408x
-
-5808408x
-5156742x
-
-651666x
-539893x
-
-111773x
-
- | "use strict";
-
-module.exports = function paethPredictor(left, above, upLeft) {
- let paeth = left + above - upLeft;
- let pLeft = Math.abs(paeth - left);
- let pAbove = Math.abs(paeth - above);
- let pUpLeft = Math.abs(paeth - upLeft);
-
- if (pLeft <= pAbove && pLeft <= pUpLeft) {
- return left;
- }
- if (pAbove <= pUpLeft) {
- return above;
- }
- return upLeft;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser-async.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser-async.js.html
deleted file mode 100644
index 77074ffc..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser-async.js.html
+++ /dev/null
@@ -1,575 +0,0 @@
-
-
-
-
-
- Code coverage report for parser-async.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 88.75%
- Statements
- 71/80
-
-
-
-
- 72.73%
- Branches
- 16/22
-
-
-
-
- 84.62%
- Functions
- 11/13
-
-
-
-
- 88.75%
- Lines
- 71/80
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166 |
-
-1x
-1x
-1x
-1x
-1x
-1x
-1x
-
-1x
-353x
-
-353x
-
-
-
-
-
-
-
-
-
-
-
-353x
-353x
-
-353x
-
-1x
-
-1x
-14x
-
-14x
-
-14x
-
-14x
-1x
-
-
-14x
-2x
-
-
-
-2x
-
-
-14x
-
-
-1x
-741x
-174x
-36x
-
-36x
-36x
-
-36x
-
-
-138x
-
-
-
-
-
-138x
-138x
-
-138x
-138x
-
-138x
-138x
-
-
-
-
-
-
-138x
-
-138x
-138x
-487x
-
-
-
-487x
-
-
-
-487x
-
-487x
-
-
-138x
-
-
-741x
-
-
-1x
-176x
-176x
-
-176x
-
-
-1x
-7x
-
-
-1x
-77x
-
-
-1x
-15x
-
-
-1x
-
-
-174x
-
-
-1x
-173x
-
-
-
-173x
-1x
-
-
-172x
-
-
-
-1x
-173x
-
-
-
-
-
-173x
-173x
-
-173x
-173x
-
-
-
-
-
-173x
-
- | "use strict";
-
-let util = require("util");
-let zlib = require("zlib");
-let ChunkStream = require("./chunkstream");
-let FilterAsync = require("./filter-parse-async");
-let Parser = require("./parser");
-let bitmapper = require("./bitmapper");
-let formatNormaliser = require("./format-normaliser");
-
-let ParserAsync = (module.exports = function (options) {
- ChunkStream.call(this);
-
- this._parser = new Parser(options, {
- read: this.read.bind(this),
- error: this._handleError.bind(this),
- metadata: this._handleMetaData.bind(this),
- gamma: this.emit.bind(this, "gamma"),
- palette: this._handlePalette.bind(this),
- transColor: this._handleTransColor.bind(this),
- finished: this._finished.bind(this),
- inflateData: this._inflateData.bind(this),
- simpleTransparency: this._simpleTransparency.bind(this),
- headersFinished: this._headersFinished.bind(this),
- });
- this._options = options;
- this.writable = true;
-
- this._parser.start();
-});
-util.inherits(ParserAsync, ChunkStream);
-
-ParserAsync.prototype._handleError = function (err) {
- this.emit("error", err);
-
- this.writable = false;
-
- this.destroy();
-
- if (this._inflate && this._inflate.destroy) {
- this._inflate.destroy();
- }
-
- if (this._filter) {
- this._filter.destroy();
- // For backward compatibility with Node 7 and below.
- // Suppress errors due to _inflate calling write() even after
- // it's destroy()'ed.
- this._filter.on("error", function () {});
- }
-
- this.errord = true;
-};
-
-ParserAsync.prototype._inflateData = function (data) {
- if (!this._inflate) {
- if (this._bitmapInfo.interlace) {
- this._inflate = zlib.createInflate();
-
- this._inflate.on("error", this.emit.bind(this, "error"));
- this._filter.on("complete", this._complete.bind(this));
-
- this._inflate.pipe(this._filter);
- } else {
- let rowSize =
- ((this._bitmapInfo.width *
- this._bitmapInfo.bpp *
- this._bitmapInfo.depth +
- 7) >>
- 3) +
- 1;
- let imageSize = rowSize * this._bitmapInfo.height;
- let chunkSize = Math.max(imageSize, zlib.Z_MIN_CHUNK);
-
- this._inflate = zlib.createInflate({ chunkSize: chunkSize });
- let leftToInflate = imageSize;
-
- let emitError = this.emit.bind(this, "error");
- this._inflate.on("error", function (err) {
- if (!leftToInflate) {
- return;
- }
-
- emitError(err);
- });
- this._filter.on("complete", this._complete.bind(this));
-
- let filterWrite = this._filter.write.bind(this._filter);
- this._inflate.on("data", function (chunk) {
- Iif (!leftToInflate) {
- return;
- }
-
- Iif (chunk.length > leftToInflate) {
- chunk = chunk.slice(0, leftToInflate);
- }
-
- leftToInflate -= chunk.length;
-
- filterWrite(chunk);
- });
-
- this._inflate.on("end", this._filter.end.bind(this._filter));
- }
- }
- this._inflate.write(data);
-};
-
-ParserAsync.prototype._handleMetaData = function (metaData) {
- this._metaData = metaData;
- this._bitmapInfo = Object.create(metaData);
-
- this._filter = new FilterAsync(this._bitmapInfo);
-};
-
-ParserAsync.prototype._handleTransColor = function (transColor) {
- this._bitmapInfo.transColor = transColor;
-};
-
-ParserAsync.prototype._handlePalette = function (palette) {
- this._bitmapInfo.palette = palette;
-};
-
-ParserAsync.prototype._simpleTransparency = function () {
- this._metaData.alpha = true;
-};
-
-ParserAsync.prototype._headersFinished = function () {
- // Up until this point, we don't know if we have a tRNS chunk (alpha)
- // so we can't emit metadata any earlier
- this.emit("metadata", this._metaData);
-};
-
-ParserAsync.prototype._finished = function () {
- Iif (this.errord) {
- return;
- }
-
- if (!this._inflate) {
- this.emit("error", "No Inflate block");
- } else {
- // no more data to inflate
- this._inflate.end();
- }
-};
-
-ParserAsync.prototype._complete = function (filteredData) {
- Iif (this.errord) {
- return;
- }
-
- let normalisedBitmapData;
-
- try {
- let bitmapData = bitmapper.dataToBitMap(filteredData, this._bitmapInfo);
-
- normalisedBitmapData = formatNormaliser(bitmapData, this._bitmapInfo);
- bitmapData = null;
- } catch (ex) {
- this._handleError(ex);
- return;
- }
-
- this.emit("parsed", normalisedBitmapData);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser-sync.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser-sync.js.html
deleted file mode 100644
index 6ced1a98..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser-sync.js.html
+++ /dev/null
@@ -1,404 +0,0 @@
-
-
-
-
-
- Code coverage report for parser-sync.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 93.33%
- Statements
- 42/45
-
-
-
-
- 78.57%
- Branches
- 11/14
-
-
-
-
- 100%
- Functions
- 8/8
-
-
-
-
- 93.33%
- Lines
- 42/45
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109 |
-
-1x
-1x
-1x
-1x
-
-
-1x
-1x
-1x
-1x
-1x
-
-1x
-176x
-
-
-
-
-
-
-
-13x
-
-
-
-
-165x
-
-
-
-5x
-
-
-
-73x
-
-
-
-12x
-
-
-
-
-147x
-
-
-176x
-
-492x
-
-
-176x
-
-176x
-
-
-
-
-
-
-
-
-
-
-176x
-176x
-
-176x
-13x
-
-
-
-163x
-163x
-
-
-163x
-36x
-
-
-127x
-127x
-127x
-
-
-
-
-162x
-
-162x
-
-
-
-162x
-162x
-
-162x
-162x
-
-162x
-
-162x
-162x
-
-162x
-
- | "use strict";
-
-let hasSyncZlib = true;
-let zlib = require("zlib");
-let inflateSync = require("./sync-inflate");
-Iif (!zlib.deflateSync) {
- hasSyncZlib = false;
-}
-let SyncReader = require("./sync-reader");
-let FilterSync = require("./filter-parse-sync");
-let Parser = require("./parser");
-let bitmapper = require("./bitmapper");
-let formatNormaliser = require("./format-normaliser");
-
-module.exports = function (buffer, options) {
- Iif (!hasSyncZlib) {
- throw new Error(
- "To use the sync capability of this library in old node versions, please pin pngjs to v2.3.0"
- );
- }
-
- let err;
- function handleError(_err_) {
- err = _err_;
- }
-
- let metaData;
- function handleMetaData(_metaData_) {
- metaData = _metaData_;
- }
-
- function handleTransColor(transColor) {
- metaData.transColor = transColor;
- }
-
- function handlePalette(palette) {
- metaData.palette = palette;
- }
-
- function handleSimpleTransparency() {
- metaData.alpha = true;
- }
-
- let gamma;
- function handleGamma(_gamma_) {
- gamma = _gamma_;
- }
-
- let inflateDataList = [];
- function handleInflateData(inflatedData) {
- inflateDataList.push(inflatedData);
- }
-
- let reader = new SyncReader(buffer);
-
- let parser = new Parser(options, {
- read: reader.read.bind(reader),
- error: handleError,
- metadata: handleMetaData,
- gamma: handleGamma,
- palette: handlePalette,
- transColor: handleTransColor,
- inflateData: handleInflateData,
- simpleTransparency: handleSimpleTransparency,
- });
-
- parser.start();
- reader.process();
-
- if (err) {
- throw err;
- }
-
- //join together the inflate datas
- let inflateData = Buffer.concat(inflateDataList);
- inflateDataList.length = 0;
-
- let inflatedData;
- if (metaData.interlace) {
- inflatedData = zlib.inflateSync(inflateData);
- } else {
- let rowSize =
- ((metaData.width * metaData.bpp * metaData.depth + 7) >> 3) + 1;
- let imageSize = rowSize * metaData.height;
- inflatedData = inflateSync(inflateData, {
- chunkSize: imageSize,
- maxLength: imageSize,
- });
- }
- inflateData = null;
-
- Iif (!inflatedData || !inflatedData.length) {
- throw new Error("bad png - invalid inflate data response");
- }
-
- let unfilteredData = FilterSync.process(inflatedData, metaData);
- inflateData = null;
-
- let bitmapData = bitmapper.dataToBitMap(unfilteredData, metaData);
- unfilteredData = null;
-
- let normalisedBitmapData = formatNormaliser(bitmapData, metaData);
-
- metaData.data = normalisedBitmapData;
- metaData.gamma = gamma || 0;
-
- return metaData;
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser.js.html
deleted file mode 100644
index efc95044..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/parser.js.html
+++ /dev/null
@@ -1,950 +0,0 @@
-
-
-
-
-
- Code coverage report for parser.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 90.57%
- Statements
- 144/159
-
-
-
-
- 85.45%
- Branches
- 47/55
-
-
-
-
- 100%
- Functions
- 20/20
-
-
-
-
- 90.32%
- Lines
- 140/155
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166
-167
-168
-169
-170
-171
-172
-173
-174
-175
-176
-177
-178
-179
-180
-181
-182
-183
-184
-185
-186
-187
-188
-189
-190
-191
-192
-193
-194
-195
-196
-197
-198
-199
-200
-201
-202
-203
-204
-205
-206
-207
-208
-209
-210
-211
-212
-213
-214
-215
-216
-217
-218
-219
-220
-221
-222
-223
-224
-225
-226
-227
-228
-229
-230
-231
-232
-233
-234
-235
-236
-237
-238
-239
-240
-241
-242
-243
-244
-245
-246
-247
-248
-249
-250
-251
-252
-253
-254
-255
-256
-257
-258
-259
-260
-261
-262
-263
-264
-265
-266
-267
-268
-269
-270
-271
-272
-273
-274
-275
-276
-277
-278
-279
-280
-281
-282
-283
-284
-285
-286
-287
-288
-289
-290
-291 |
-
-1x
-1x
-
-1x
-529x
-529x
-
-529x
-529x
-529x
-
-
-529x
-529x
-
-529x
-529x
-529x
-529x
-529x
-529x
-529x
-
-529x
-529x
-529x
-529x
-529x
-529x
-529x
-529x
-529x
-529x
-529x
-
-
-1x
-529x
-
-
-1x
-365x
-
-365x
-2867x
-13x
-13x
-
-
-352x
-
-
-1x
-
-2461x
-
-
-2461x
-2461x
-2461x
-9844x
-
-
-
-
-
-2461x
-
-
-
-2461x
-
-
-
-
-2461x
-2461x
-
-2461x
-2205x
-
-
-256x
-
-
-
-
-256x
-
-
-1x
-256x
-
-
-1x
-2195x
-
-
-1x
-2195x
-2195x
-
-
-2195x
-4x
-4x
-
-
-2191x
-1855x
-
-
-
-1x
-351x
-
-1x
-351x
-
-351x
-351x
-351x
-351x
-351x
-351x
-351x
-
-
-
-
-
-
-351x
-
-
-
-
-
-
-6x
-6x
-
-345x
-4x
-4x
-
-341x
-
-
-
-341x
-
-
-
-341x
-
-
-
-
-341x
-
-341x
-
-341x
-
-341x
-
-
-
-
-
-
-
-
-
-
-
-341x
-
-
-1x
-135x
-
-1x
-135x
-
-135x
-
-
-135x
-7350x
-
-
-135x
-
-135x
-
-
-1x
-27x
-27x
-
-1x
-27x
-
-
-27x
-15x
-
-
-
-15x
-
-
-
-15x
-529x
-
-15x
-
-
-
-
-27x
-
-6x
-
-27x
-6x
-
-
-
-
-
-
-27x
-
-
-1x
-296x
-
-1x
-296x
-296x
-
-296x
-
-
-1x
-1233x
-337x
-337x
-
-1233x
-
-1x
-1233x
-
-1233x
-
-
-
-
-
-
-1233x
-1233x
-
-1233x
-173x
-
-1060x
-
-
-
-1x
-336x
-
-1x
-336x
-
-336x
-336x
-
-336x
-173x
-
-
- | "use strict";
-
-let constants = require("./constants");
-let CrcCalculator = require("./crc");
-
-let Parser = (module.exports = function (options, dependencies) {
- this._options = options;
- options.checkCRC = options.checkCRC !== false;
-
- this._hasIHDR = false;
- this._hasIEND = false;
- this._emittedHeadersFinished = false;
-
- // input flags/metadata
- this._palette = [];
- this._colorType = 0;
-
- this._chunks = {};
- this._chunks[constants.TYPE_IHDR] = this._handleIHDR.bind(this);
- this._chunks[constants.TYPE_IEND] = this._handleIEND.bind(this);
- this._chunks[constants.TYPE_IDAT] = this._handleIDAT.bind(this);
- this._chunks[constants.TYPE_PLTE] = this._handlePLTE.bind(this);
- this._chunks[constants.TYPE_tRNS] = this._handleTRNS.bind(this);
- this._chunks[constants.TYPE_gAMA] = this._handleGAMA.bind(this);
-
- this.read = dependencies.read;
- this.error = dependencies.error;
- this.metadata = dependencies.metadata;
- this.gamma = dependencies.gamma;
- this.transColor = dependencies.transColor;
- this.palette = dependencies.palette;
- this.parsed = dependencies.parsed;
- this.inflateData = dependencies.inflateData;
- this.finished = dependencies.finished;
- this.simpleTransparency = dependencies.simpleTransparency;
- this.headersFinished = dependencies.headersFinished || function () {};
-});
-
-Parser.prototype.start = function () {
- this.read(constants.PNG_SIGNATURE.length, this._parseSignature.bind(this));
-};
-
-Parser.prototype._parseSignature = function (data) {
- let signature = constants.PNG_SIGNATURE;
-
- for (let i = 0; i < signature.length; i++) {
- if (data[i] !== signature[i]) {
- this.error(new Error("Invalid file signature"));
- return;
- }
- }
- this.read(8, this._parseChunkBegin.bind(this));
-};
-
-Parser.prototype._parseChunkBegin = function (data) {
- // chunk content length
- let length = data.readUInt32BE(0);
-
- // chunk type
- let type = data.readUInt32BE(4);
- let name = "";
- for (let i = 4; i < 8; i++) {
- name += String.fromCharCode(data[i]);
- }
-
- //console.log('chunk ', name, length);
-
- // chunk flags
- let ancillary = Boolean(data[4] & 0x20); // or critical
- // priv = Boolean(data[5] & 0x20), // or public
- // safeToCopy = Boolean(data[7] & 0x20); // or unsafe
-
- Iif (!this._hasIHDR && type !== constants.TYPE_IHDR) {
- this.error(new Error("Expected IHDR on beggining"));
- return;
- }
-
- this._crc = new CrcCalculator();
- this._crc.write(Buffer.from(name));
-
- if (this._chunks[type]) {
- return this._chunks[type](length);
- }
-
- Iif (!ancillary) {
- this.error(new Error("Unsupported critical chunk type " + name));
- return;
- }
-
- this.read(length + 4, this._skipChunk.bind(this));
-};
-
-Parser.prototype._skipChunk = function (/*data*/) {
- this.read(8, this._parseChunkBegin.bind(this));
-};
-
-Parser.prototype._handleChunkEnd = function () {
- this.read(4, this._parseChunkEnd.bind(this));
-};
-
-Parser.prototype._parseChunkEnd = function (data) {
- let fileCrc = data.readInt32BE(0);
- let calcCrc = this._crc.crc32();
-
- // check CRC
- if (this._options.checkCRC && calcCrc !== fileCrc) {
- this.error(new Error("Crc error - " + fileCrc + " - " + calcCrc));
- return;
- }
-
- if (!this._hasIEND) {
- this.read(8, this._parseChunkBegin.bind(this));
- }
-};
-
-Parser.prototype._handleIHDR = function (length) {
- this.read(length, this._parseIHDR.bind(this));
-};
-Parser.prototype._parseIHDR = function (data) {
- this._crc.write(data);
-
- let width = data.readUInt32BE(0);
- let height = data.readUInt32BE(4);
- let depth = data[8];
- let colorType = data[9]; // bits: 1 palette, 2 color, 4 alpha
- let compr = data[10];
- let filter = data[11];
- let interlace = data[12];
-
- // console.log(' width', width, 'height', height,
- // 'depth', depth, 'colorType', colorType,
- // 'compr', compr, 'filter', filter, 'interlace', interlace
- // );
-
- if (
- depth !== 8 &&
- depth !== 4 &&
- depth !== 2 &&
- depth !== 1 &&
- depth !== 16
- ) {
- this.error(new Error("Unsupported bit depth " + depth));
- return;
- }
- if (!(colorType in constants.COLORTYPE_TO_BPP_MAP)) {
- this.error(new Error("Unsupported color type"));
- return;
- }
- Iif (compr !== 0) {
- this.error(new Error("Unsupported compression method"));
- return;
- }
- Iif (filter !== 0) {
- this.error(new Error("Unsupported filter method"));
- return;
- }
- Iif (interlace !== 0 && interlace !== 1) {
- this.error(new Error("Unsupported interlace method"));
- return;
- }
-
- this._colorType = colorType;
-
- let bpp = constants.COLORTYPE_TO_BPP_MAP[this._colorType];
-
- this._hasIHDR = true;
-
- this.metadata({
- width: width,
- height: height,
- depth: depth,
- interlace: Boolean(interlace),
- palette: Boolean(colorType & constants.COLORTYPE_PALETTE),
- color: Boolean(colorType & constants.COLORTYPE_COLOR),
- alpha: Boolean(colorType & constants.COLORTYPE_ALPHA),
- bpp: bpp,
- colorType: colorType,
- });
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handlePLTE = function (length) {
- this.read(length, this._parsePLTE.bind(this));
-};
-Parser.prototype._parsePLTE = function (data) {
- this._crc.write(data);
-
- let entries = Math.floor(data.length / 3);
- // console.log('Palette:', entries);
-
- for (let i = 0; i < entries; i++) {
- this._palette.push([data[i * 3], data[i * 3 + 1], data[i * 3 + 2], 0xff]);
- }
-
- this.palette(this._palette);
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handleTRNS = function (length) {
- this.simpleTransparency();
- this.read(length, this._parseTRNS.bind(this));
-};
-Parser.prototype._parseTRNS = function (data) {
- this._crc.write(data);
-
- // palette
- if (this._colorType === constants.COLORTYPE_PALETTE_COLOR) {
- Iif (this._palette.length === 0) {
- this.error(new Error("Transparency chunk must be after palette"));
- return;
- }
- Iif (data.length > this._palette.length) {
- this.error(new Error("More transparent colors than palette size"));
- return;
- }
- for (let i = 0; i < data.length; i++) {
- this._palette[i][3] = data[i];
- }
- this.palette(this._palette);
- }
-
- // for colorType 0 (grayscale) and 2 (rgb)
- // there might be one gray/color defined as transparent
- if (this._colorType === constants.COLORTYPE_GRAYSCALE) {
- // grey, 2 bytes
- this.transColor([data.readUInt16BE(0)]);
- }
- if (this._colorType === constants.COLORTYPE_COLOR) {
- this.transColor([
- data.readUInt16BE(0),
- data.readUInt16BE(2),
- data.readUInt16BE(4),
- ]);
- }
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handleGAMA = function (length) {
- this.read(length, this._parseGAMA.bind(this));
-};
-Parser.prototype._parseGAMA = function (data) {
- this._crc.write(data);
- this.gamma(data.readUInt32BE(0) / constants.GAMMA_DIVISION);
-
- this._handleChunkEnd();
-};
-
-Parser.prototype._handleIDAT = function (length) {
- if (!this._emittedHeadersFinished) {
- this._emittedHeadersFinished = true;
- this.headersFinished();
- }
- this.read(-length, this._parseIDAT.bind(this, length));
-};
-Parser.prototype._parseIDAT = function (length, data) {
- this._crc.write(data);
-
- Iif (
- this._colorType === constants.COLORTYPE_PALETTE_COLOR &&
- this._palette.length === 0
- ) {
- throw new Error("Expected palette not found");
- }
-
- this.inflateData(data);
- let leftOverLength = length - data.length;
-
- if (leftOverLength > 0) {
- this._handleIDAT(leftOverLength);
- } else {
- this._handleChunkEnd();
- }
-};
-
-Parser.prototype._handleIEND = function (length) {
- this.read(length, this._parseIEND.bind(this));
-};
-Parser.prototype._parseIEND = function (data) {
- this._crc.write(data);
-
- this._hasIEND = true;
- this._handleChunkEnd();
-
- if (this.finished) {
- this.finished();
- }
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/png-sync.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/png-sync.js.html
deleted file mode 100644
index 848f6a6c..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/png-sync.js.html
+++ /dev/null
@@ -1,116 +0,0 @@
-
-
-
-
-
- Code coverage report for png-sync.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 83.33%
- Statements
- 5/6
-
-
-
-
- 100%
- Branches
- 2/2
-
-
-
-
- 50%
- Functions
- 1/2
-
-
-
-
- 83.33%
- Lines
- 5/6
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13 |
-
-1x
-1x
-
-1x
-176x
-
-
-1x
-
-
- | "use strict";
-
-let parse = require("./parser-sync");
-let pack = require("./packer-sync");
-
-exports.read = function (buffer, options) {
- return parse(buffer, options || {});
-};
-
-exports.write = function (png, options) {
- return pack(png, options);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/png.js.html b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/png.js.html
deleted file mode 100644
index baa88032..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/png.js.html
+++ /dev/null
@@ -1,662 +0,0 @@
-
-
-
-
-
- Code coverage report for png.js
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- 54.17%
- Statements
- 52/96
-
-
-
-
- 41.18%
- Branches
- 14/34
-
-
-
-
- 56.25%
- Functions
- 9/16
-
-
-
-
- 56.52%
- Lines
- 52/92
-
-
-
-
-
- Press n or j to go to the next uncovered block, b, p or k for the previous block.
-
-
-
-
-| 1
-2
-3
-4
-5
-6
-7
-8
-9
-10
-11
-12
-13
-14
-15
-16
-17
-18
-19
-20
-21
-22
-23
-24
-25
-26
-27
-28
-29
-30
-31
-32
-33
-34
-35
-36
-37
-38
-39
-40
-41
-42
-43
-44
-45
-46
-47
-48
-49
-50
-51
-52
-53
-54
-55
-56
-57
-58
-59
-60
-61
-62
-63
-64
-65
-66
-67
-68
-69
-70
-71
-72
-73
-74
-75
-76
-77
-78
-79
-80
-81
-82
-83
-84
-85
-86
-87
-88
-89
-90
-91
-92
-93
-94
-95
-96
-97
-98
-99
-100
-101
-102
-103
-104
-105
-106
-107
-108
-109
-110
-111
-112
-113
-114
-115
-116
-117
-118
-119
-120
-121
-122
-123
-124
-125
-126
-127
-128
-129
-130
-131
-132
-133
-134
-135
-136
-137
-138
-139
-140
-141
-142
-143
-144
-145
-146
-147
-148
-149
-150
-151
-152
-153
-154
-155
-156
-157
-158
-159
-160
-161
-162
-163
-164
-165
-166
-167
-168
-169
-170
-171
-172
-173
-174
-175
-176
-177
-178
-179
-180
-181
-182
-183
-184
-185
-186
-187
-188
-189
-190
-191
-192
-193
-194
-195 |
-
-1x
-1x
-1x
-1x
-1x
-
-1x
-353x
-
-353x
-
-
-353x
-353x
-
-353x
-
-
-
-
-353x
-
-
-
-353x
-353x
-
-353x
-
-353x
-353x
-353x
-353x
-353x
-
-
-173x
-173x
-
-
-
-353x
-353x
-353x
-353x
-353x
-
-1x
-
-1x
-
-1x
-325x
-
-
-
-
-325x
-
-325x
-
-
-
-325x
-
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-1x
-412x
-412x
-
-
-1x
-175x
-
-
-1x
-174x
-174x
-
-174x
-
-
-1x
-149x
-
-
-1x
-378x
-
-
-
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-1x
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-1x
-
-
- | "use strict";
-
-let util = require("util");
-let Stream = require("stream");
-let Parser = require("./parser-async");
-let Packer = require("./packer-async");
-let PNGSync = require("./png-sync");
-
-let PNG = (exports.PNG = function (options) {
- Stream.call(this);
-
- options = options || {}; // eslint-disable-line no-param-reassign
-
- // coerce pixel dimensions to integers (also coerces undefined -> 0):
- this.width = options.width | 0;
- this.height = options.height | 0;
-
- this.data =
- this.width > 0 && this.height > 0
- ? Buffer.alloc(4 * this.width * this.height)
- : null;
-
- Iif (options.fill && this.data) {
- this.data.fill(0);
- }
-
- this.gamma = 0;
- this.readable = this.writable = true;
-
- this._parser = new Parser(options);
-
- this._parser.on("error", this.emit.bind(this, "error"));
- this._parser.on("close", this._handleClose.bind(this));
- this._parser.on("metadata", this._metadata.bind(this));
- this._parser.on("gamma", this._gamma.bind(this));
- this._parser.on(
- "parsed",
- function (data) {
- this.data = data;
- this.emit("parsed", data);
- }.bind(this)
- );
-
- this._packer = new Packer(options);
- this._packer.on("data", this.emit.bind(this, "data"));
- this._packer.on("end", this.emit.bind(this, "end"));
- this._parser.on("close", this._handleClose.bind(this));
- this._packer.on("error", this.emit.bind(this, "error"));
-});
-util.inherits(PNG, Stream);
-
-PNG.sync = PNGSync;
-
-PNG.prototype.pack = function () {
- Iif (!this.data || !this.data.length) {
- this.emit("error", "No data provided");
- return this;
- }
-
- process.nextTick(
- function () {
- this._packer.pack(this.data, this.width, this.height, this.gamma);
- }.bind(this)
- );
-
- return this;
-};
-
-PNG.prototype.parse = function (data, callback) {
- if (callback) {
- let onParsed, onError;
-
- onParsed = function (parsedData) {
- this.removeListener("error", onError);
-
- this.data = parsedData;
- callback(null, this);
- }.bind(this);
-
- onError = function (err) {
- this.removeListener("parsed", onParsed);
-
- callback(err, null);
- }.bind(this);
-
- this.once("parsed", onParsed);
- this.once("error", onError);
- }
-
- this.end(data);
- return this;
-};
-
-PNG.prototype.write = function (data) {
- this._parser.write(data);
- return true;
-};
-
-PNG.prototype.end = function (data) {
- this._parser.end(data);
-};
-
-PNG.prototype._metadata = function (metadata) {
- this.width = metadata.width;
- this.height = metadata.height;
-
- this.emit("metadata", metadata);
-};
-
-PNG.prototype._gamma = function (gamma) {
- this.gamma = gamma;
-};
-
-PNG.prototype._handleClose = function () {
- Iif (!this._parser.writable && !this._packer.readable) {
- this.emit("close");
- }
-};
-
-PNG.bitblt = function (src, dst, srcX, srcY, width, height, deltaX, deltaY) {
- // eslint-disable-line max-params
- // coerce pixel dimensions to integers (also coerces undefined -> 0):
- /* eslint-disable no-param-reassign */
- srcX |= 0;
- srcY |= 0;
- width |= 0;
- height |= 0;
- deltaX |= 0;
- deltaY |= 0;
- /* eslint-enable no-param-reassign */
-
- if (
- srcX > src.width ||
- srcY > src.height ||
- srcX + width > src.width ||
- srcY + height > src.height
- ) {
- throw new Error("bitblt reading outside image");
- }
-
- if (
- deltaX > dst.width ||
- deltaY > dst.height ||
- deltaX + width > dst.width ||
- deltaY + height > dst.height
- ) {
- throw new Error("bitblt writing outside image");
- }
-
- for (let y = 0; y < height; y++) {
- src.data.copy(
- dst.data,
- ((deltaY + y) * dst.width + deltaX) << 2,
- ((srcY + y) * src.width + srcX) << 2,
- ((srcY + y) * src.width + srcX + width) << 2
- );
- }
-};
-
-PNG.prototype.bitblt = function (
- dst,
- srcX,
- srcY,
- width,
- height,
- deltaX,
- deltaY
-) {
- // eslint-disable-line max-params
-
- PNG.bitblt(this, dst, srcX, srcY, width, height, deltaX, deltaY);
- return this;
-};
-
-PNG.adjustGamma = function (src) {
- if (src.gamma) {
- for (let y = 0; y < src.height; y++) {
- for (let x = 0; x < src.width; x++) {
- let idx = (src.width * y + x) << 2;
-
- for (let i = 0; i < 3; i++) {
- let sample = src.data[idx + i] / 255;
- sample = Math.pow(sample, 1 / 2.2 / src.gamma);
- src.data[idx + i] = Math.round(sample * 255);
- }
- }
- }
- src.gamma = 0;
- }
-};
-
-PNG.prototype.adjustGamma = function () {
- PNG.adjustGamma(this);
-};
- |
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/prettify.css b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/prettify.css
deleted file mode 100644
index 006492ca..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/prettify.css
+++ /dev/null
@@ -1,101 +0,0 @@
-.pln {
- color: #000;
-}
-@media screen {
- .str {
- color: #080;
- }
- .kwd {
- color: #008;
- }
- .com {
- color: #800;
- }
- .typ {
- color: #606;
- }
- .lit {
- color: #066;
- }
- .pun,
- .opn,
- .clo {
- color: #660;
- }
- .tag {
- color: #008;
- }
- .atn {
- color: #606;
- }
- .atv {
- color: #080;
- }
- .dec,
- .var {
- color: #606;
- }
- .fun {
- color: red;
- }
-}
-@media print, projection {
- .str {
- color: #060;
- }
- .kwd {
- color: #006;
- font-weight: bold;
- }
- .com {
- color: #600;
- font-style: italic;
- }
- .typ {
- color: #404;
- font-weight: bold;
- }
- .lit {
- color: #044;
- }
- .pun,
- .opn,
- .clo {
- color: #440;
- }
- .tag {
- color: #006;
- font-weight: bold;
- }
- .atn {
- color: #404;
- }
- .atv {
- color: #060;
- }
-}
-pre.prettyprint {
- padding: 2px;
- border: 1px solid #888;
-}
-ol.linenums {
- margin-top: 0;
- margin-bottom: 0;
-}
-li.L0,
-li.L1,
-li.L2,
-li.L3,
-li.L5,
-li.L6,
-li.L7,
-li.L8 {
- list-style-type: none;
-}
-li.L1,
-li.L3,
-li.L5,
-li.L7,
-li.L9 {
- background: #eee;
-}
diff --git a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/prettify.js b/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/prettify.js
deleted file mode 100644
index 7c0a2fe8..00000000
--- a/uds-auth/lib/qrcode-lib/node_modules/pngjs/coverage/lcov-report/prettify.js
+++ /dev/null
@@ -1,1007 +0,0 @@
-/* eslint-disable */
-window.PR_SHOULD_USE_CONTINUATION = true;
-(function () {
- var h = ["break,continue,do,else,for,if,return,while"];
- var u = [
- h,
- "auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile",
- ];
- var p = [
- u,
- "catch,class,delete,false,import,new,operator,private,protected,public,this,throw,true,try,typeof",
- ];
- var l = [
- p,
- "alignof,align_union,asm,axiom,bool,concept,concept_map,const_cast,constexpr,decltype,dynamic_cast,explicit,export,friend,inline,late_check,mutable,namespace,nullptr,reinterpret_cast,static_assert,static_cast,template,typeid,typename,using,virtual,where",
- ];
- var x = [
- p,
- "abstract,boolean,byte,extends,final,finally,implements,import,instanceof,null,native,package,strictfp,super,synchronized,throws,transient",
- ];
- var R = [
- x,
- "as,base,by,checked,decimal,delegate,descending,dynamic,event,fixed,foreach,from,group,implicit,in,interface,internal,into,is,lock,object,out,override,orderby,params,partial,readonly,ref,sbyte,sealed,stackalloc,string,select,uint,ulong,unchecked,unsafe,ushort,var",
- ];
- var r =
- "all,and,by,catch,class,else,extends,false,finally,for,if,in,is,isnt,loop,new,no,not,null,of,off,on,or,return,super,then,true,try,unless,until,when,while,yes";
- var w = [
- p,
- "debugger,eval,export,function,get,null,set,undefined,var,with,Infinity,NaN",
- ];
- var s =
- "caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END";
- var I = [
- h,
- "and,as,assert,class,def,del,elif,except,exec,finally,from,global,import,in,is,lambda,nonlocal,not,or,pass,print,raise,try,with,yield,False,True,None",
- ];
- var f = [
- h,
- "alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END",
- ];
- var H = [h, "case,done,elif,esac,eval,fi,function,in,local,set,then,until"];
- var A = [l, R, w, s + I, f, H];
- var e = /^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/;
- var C = "str";
- var z = "kwd";
- var j = "com";
- var O = "typ";
- var G = "lit";
- var L = "pun";
- var F = "pln";
- var m = "tag";
- var E = "dec";
- var J = "src";
- var P = "atn";
- var n = "atv";
- var N = "nocode";
- var M =
- "(?:^^\\.?|[+-]|\\!|\\!=|\\!==|\\#|\\%|\\%=|&|&&|&&=|&=|\\(|\\*|\\*=|\\+=|\\,|\\-=|\\->|\\/|\\/=|:|::|\\;|<|<<|<<=|<=|=|==|===|>|>=|>>|>>=|>>>|>>>=|\\?|\\@|\\[|\\^|\\^=|\\^\\^|\\^\\^=|\\{|\\||\\|=|\\|\\||\\|\\|=|\\~|break|case|continue|delete|do|else|finally|instanceof|return|throw|try|typeof)\\s*";
- function k(Z) {
- var ad = 0;
- var S = false;
- var ac = false;
- for (var V = 0, U = Z.length; V < U; ++V) {
- var ae = Z[V];
- if (ae.ignoreCase) {
- ac = true;
- } else {
- if (
- /[a-z]/i.test(
- ae.source.replace(/\\u[0-9a-f]{4}|\\x[0-9a-f]{2}|\\[^ux]/gi, "")
- )
- ) {
- S = true;
- ac = false;
- break;
- }
- }
- }
- var Y = { b: 8, t: 9, n: 10, v: 11, f: 12, r: 13 };
- function ab(ah) {
- var ag = ah.charCodeAt(0);
- if (ag !== 92) {
- return ag;
- }
- var af = ah.charAt(1);
- ag = Y[af];
- if (ag) {
- return ag;
- } else {
- if ("0" <= af && af <= "7") {
- return parseInt(ah.substring(1), 8);
- } else {
- if (af === "u" || af === "x") {
- return parseInt(ah.substring(2), 16);
- } else {
- return ah.charCodeAt(1);
- }
- }
- }
- }
- function T(af) {
- if (af < 32) {
- return (af < 16 ? "\\x0" : "\\x") + af.toString(16);
- }
- var ag = String.fromCharCode(af);
- if (ag === "\\" || ag === "-" || ag === "[" || ag === "]") {
- ag = "\\" + ag;
- }
- return ag;
- }
- function X(am) {
- var aq = am
- .substring(1, am.length - 1)
- .match(
- new RegExp(
- "\\\\u[0-9A-Fa-f]{4}|\\\\x[0-9A-Fa-f]{2}|\\\\[0-3][0-7]{0,2}|\\\\[0-7]{1,2}|\\\\[\\s\\S]|-|[^-\\\\]",
- "g"
- )
- );
- var ak = [];
- var af = [];
- var ao = aq[0] === "^";
- for (var ar = ao ? 1 : 0, aj = aq.length; ar < aj; ++ar) {
- var ah = aq[ar];
- if (/\\[bdsw]/i.test(ah)) {
- ak.push(ah);
- } else {
- var ag = ab(ah);
- var al;
- if (ar + 2 < aj && "-" === aq[ar + 1]) {
- al = ab(aq[ar + 2]);
- ar += 2;
- } else {
- al = ag;
- }
- af.push([ag, al]);
- if (!(al < 65 || ag > 122)) {
- if (!(al < 65 || ag > 90)) {
- af.push([Math.max(65, ag) | 32, Math.min(al, 90) | 32]);
- }
- if (!(al < 97 || ag > 122)) {
- af.push([Math.max(97, ag) & ~32, Math.min(al, 122) & ~32]);
- }
- }
- }
- }
- af.sort(function (av, au) {
- return av[0] - au[0] || au[1] - av[1];
- });
- var ai = [];
- var ap = [NaN, NaN];
- for (var ar = 0; ar < af.length; ++ar) {
- var at = af[ar];
- if (at[0] <= ap[1] + 1) {
- ap[1] = Math.max(ap[1], at[1]);
- } else {
- ai.push((ap = at));
- }
- }
- var an = ["["];
- if (ao) {
- an.push("^");
- }
- an.push.apply(an, ak);
- for (var ar = 0; ar < ai.length; ++ar) {
- var at = ai[ar];
- an.push(T(at[0]));
- if (at[1] > at[0]) {
- if (at[1] + 1 > at[0]) {
- an.push("-");
- }
- an.push(T(at[1]));
- }
- }
- an.push("]");
- return an.join("");
- }
- function W(al) {
- var aj = al.source.match(
- new RegExp(
- "(?:\\[(?:[^\\x5C\\x5D]|\\\\[\\s\\S])*\\]|\\\\u[A-Fa-f0-9]{4}|\\\\x[A-Fa-f0-9]{2}|\\\\[0-9]+|\\\\[^ux0-9]|\\(\\?[:!=]|[\\(\\)\\^]|[^\\x5B\\x5C\\(\\)\\^]+)",
- "g"
- )
- );
- var ah = aj.length;
- var an = [];
- for (var ak = 0, am = 0; ak < ah; ++ak) {
- var ag = aj[ak];
- if (ag === "(") {
- ++am;
- } else {
- if ("\\" === ag.charAt(0)) {
- var af = +ag.substring(1);
- if (af && af <= am) {
- an[af] = -1;
- }
- }
- }
- }
- for (var ak = 1; ak < an.length; ++ak) {
- if (-1 === an[ak]) {
- an[ak] = ++ad;
- }
- }
- for (var ak = 0, am = 0; ak < ah; ++ak) {
- var ag = aj[ak];
- if (ag === "(") {
- ++am;
- if (an[am] === undefined) {
- aj[ak] = "(?:";
- }
- } else {
- if ("\\" === ag.charAt(0)) {
- var af = +ag.substring(1);
- if (af && af <= am) {
- aj[ak] = "\\" + an[am];
- }
- }
- }
- }
- for (var ak = 0, am = 0; ak < ah; ++ak) {
- if ("^" === aj[ak] && "^" !== aj[ak + 1]) {
- aj[ak] = "";
- }
- }
- if (al.ignoreCase && S) {
- for (var ak = 0; ak < ah; ++ak) {
- var ag = aj[ak];
- var ai = ag.charAt(0);
- if (ag.length >= 2 && ai === "[") {
- aj[ak] = X(ag);
- } else {
- if (ai !== "\\") {
- aj[ak] = ag.replace(/[a-zA-Z]/g, function (ao) {
- var ap = ao.charCodeAt(0);
- return "[" + String.fromCharCode(ap & ~32, ap | 32) + "]";
- });
- }
- }
- }
- }
- return aj.join("");
- }
- var aa = [];
- for (var V = 0, U = Z.length; V < U; ++V) {
- var ae = Z[V];
- if (ae.global || ae.multiline) {
- throw new Error("" + ae);
- }
- aa.push("(?:" + W(ae) + ")");
- }
- return new RegExp(aa.join("|"), ac ? "gi" : "g");
- }
- function a(V) {
- var U = /(?:^|\s)nocode(?:\s|$)/;
- var X = [];
- var T = 0;
- var Z = [];
- var W = 0;
- var S;
- if (V.currentStyle) {
- S = V.currentStyle.whiteSpace;
- } else {
- if (window.getComputedStyle) {
- S = document.defaultView
- .getComputedStyle(V, null)
- .getPropertyValue("white-space");
- }
- }
- var Y = S && "pre" === S.substring(0, 3);
- function aa(ab) {
- switch (ab.nodeType) {
- case 1:
- if (U.test(ab.className)) {
- return;
- }
- for (var ae = ab.firstChild; ae; ae = ae.nextSibling) {
- aa(ae);
- }
- var ad = ab.nodeName;
- if ("BR" === ad || "LI" === ad) {
- X[W] = "\n";
- Z[W << 1] = T++;
- Z[(W++ << 1) | 1] = ab;
- }
- break;
- case 3:
- case 4:
- var ac = ab.nodeValue;
- if (ac.length) {
- if (!Y) {
- ac = ac.replace(/[ \t\r\n]+/g, " ");
- } else {
- ac = ac.replace(/\r\n?/g, "\n");
- }
- X[W] = ac;
- Z[W << 1] = T;
- T += ac.length;
- Z[(W++ << 1) | 1] = ab;
- }
- break;
- }
- }
- aa(V);
- return { sourceCode: X.join("").replace(/\n$/, ""), spans: Z };
- }
- function B(S, U, W, T) {
- if (!U) {
- return;
- }
- var V = { sourceCode: U, basePos: S };
- W(V);
- T.push.apply(T, V.decorations);
- }
- var v = /\S/;
- function o(S) {
- var V = undefined;
- for (var U = S.firstChild; U; U = U.nextSibling) {
- var T = U.nodeType;
- V = T === 1 ? (V ? S : U) : T === 3 ? (v.test(U.nodeValue) ? S : V) : V;
- }
- return V === S ? undefined : V;
- }
- function g(U, T) {
- var S = {};
- var V;
- (function () {
- var ad = U.concat(T);
- var ah = [];
- var ag = {};
- for (var ab = 0, Z = ad.length; ab < Z; ++ab) {
- var Y = ad[ab];
- var ac = Y[3];
- if (ac) {
- for (var ae = ac.length; --ae >= 0; ) {
- S[ac.charAt(ae)] = Y;
- }
- }
- var af = Y[1];
- var aa = "" + af;
- if (!ag.hasOwnProperty(aa)) {
- ah.push(af);
- ag[aa] = null;
- }
- }
- ah.push(/[\0-\uffff]/);
- V = k(ah);
- })();
- var X = T.length;
- var W = function (ah) {
- var Z = ah.sourceCode,
- Y = ah.basePos;
- var ad = [Y, F];
- var af = 0;
- var an = Z.match(V) || [];
- var aj = {};
- for (var ae = 0, aq = an.length; ae < aq; ++ae) {
- var ag = an[ae];
- var ap = aj[ag];
- var ai = void 0;
- var am;
- if (typeof ap === "string") {
- am = false;
- } else {
- var aa = S[ag.charAt(0)];
- if (aa) {
- ai = ag.match(aa[1]);
- ap = aa[0];
- } else {
- for (var ao = 0; ao < X; ++ao) {
- aa = T[ao];
- ai = ag.match(aa[1]);
- if (ai) {
- ap = aa[0];
- break;
- }
- }
- if (!ai) {
- ap = F;
- }
- }
- am = ap.length >= 5 && "lang-" === ap.substring(0, 5);
- if (am && !(ai && typeof ai[1] === "string")) {
- am = false;
- ap = J;
- }
- if (!am) {
- aj[ag] = ap;
- }
- }
- var ab = af;
- af += ag.length;
- if (!am) {
- ad.push(Y + ab, ap);
- } else {
- var al = ai[1];
- var ak = ag.indexOf(al);
- var ac = ak + al.length;
- if (ai[2]) {
- ac = ag.length - ai[2].length;
- ak = ac - al.length;
- }
- var ar = ap.substring(5);
- B(Y + ab, ag.substring(0, ak), W, ad);
- B(Y + ab + ak, al, q(ar, al), ad);
- B(Y + ab + ac, ag.substring(ac), W, ad);
- }
- }
- ah.decorations = ad;
- };
- return W;
- }
- function i(T) {
- var W = [],
- S = [];
- if (T.tripleQuotedStrings) {
- W.push([
- C,
- /^(?:\'\'\'(?:[^\'\\]|\\[\s\S]|\'{1,2}(?=[^\']))*(?:\'\'\'|$)|\"\"\"(?:[^\"\\]|\\[\s\S]|\"{1,2}(?=[^\"]))*(?:\"\"\"|$)|\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$))/,
- null,
- "'\"",
- ]);
- } else {
- if (T.multiLineStrings) {
- W.push([
- C,
- /^(?:\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$)|\`(?:[^\\\`]|\\[\s\S])*(?:\`|$))/,
- null,
- "'\"`",
- ]);
- } else {
- W.push([
- C,
- /^(?:\'(?:[^\\\'\r\n]|\\.)*(?:\'|$)|\"(?:[^\\\"\r\n]|\\.)*(?:\"|$))/,
- null,
- "\"'",
- ]);
- }
- }
- if (T.verbatimStrings) {
- S.push([C, /^@\"(?:[^\"]|\"\")*(?:\"|$)/, null]);
- }
- var Y = T.hashComments;
- if (Y) {
- if (T.cStyleComments) {
- if (Y > 1) {
- W.push([j, /^#(?:##(?:[^#]|#(?!##))*(?:###|$)|.*)/, null, "#"]);
- } else {
- W.push([
- j,
- /^#(?:(?:define|elif|else|endif|error|ifdef|include|ifndef|line|pragma|undef|warning)\b|[^\r\n]*)/,
- null,
- "#",
- ]);
- }
- S.push([
- C,
- /^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+\.h|[a-z]\w*)>/,
- null,
- ]);
- } else {
- W.push([j, /^#[^\r\n]*/, null, "#"]);
- }
- }
- if (T.cStyleComments) {
- S.push([j, /^\/\/[^\r\n]*/, null]);
- S.push([j, /^\/\*[\s\S]*?(?:\*\/|$)/, null]);
- }
- if (T.regexLiterals) {
- var X =
- "/(?=[^/*])(?:[^/\\x5B\\x5C]|\\x5C[\\s\\S]|\\x5B(?:[^\\x5C\\x5D]|\\x5C[\\s\\S])*(?:\\x5D|$))+/";
- S.push(["lang-regex", new RegExp("^" + M + "(" + X + ")")]);
- }
- var V = T.types;
- if (V) {
- S.push([O, V]);
- }
- var U = ("" + T.keywords).replace(/^ | $/g, "");
- if (U.length) {
- S.push([
- z,
- new RegExp("^(?:" + U.replace(/[\s,]+/g, "|") + ")\\b"),
- null,
- ]);
- }
- W.push([F, /^\s+/, null, " \r\n\t\xA0"]);
- S.push(
- [G, /^@[a-z_$][a-z_$@0-9]*/i, null],
- [O, /^(?:[@_]?[A-Z]+[a-z][A-Za-z_$@0-9]*|\w+_t\b)/, null],
- [F, /^[a-z_$][a-z_$@0-9]*/i, null],
- [
- G,
- new RegExp(
- "^(?:0x[a-f0-9]+|(?:\\d(?:_\\d+)*\\d*(?:\\.\\d*)?|\\.\\d\\+)(?:e[+\\-]?\\d+)?)[a-z]*",
- "i"
- ),
- null,
- "0123456789",
- ],
- [F, /^\\[\s\S]?/, null],
- [L, /^.[^\s\w\.$@\'\"\`\/\#\\]*/, null]
- );
- return g(W, S);
- }
- var K = i({
- keywords: A,
- hashComments: true,
- cStyleComments: true,
- multiLineStrings: true,
- regexLiterals: true,
- });
- function Q(V, ag) {
- var U = /(?:^|\s)nocode(?:\s|$)/;
- var ab = /\r\n?|\n/;
- var ac = V.ownerDocument;
- var S;
- if (V.currentStyle) {
- S = V.currentStyle.whiteSpace;
- } else {
- if (window.getComputedStyle) {
- S = ac.defaultView
- .getComputedStyle(V, null)
- .getPropertyValue("white-space");
- }
- }
- var Z = S && "pre" === S.substring(0, 3);
- var af = ac.createElement("LI");
- while (V.firstChild) {
- af.appendChild(V.firstChild);
- }
- var W = [af];
- function ae(al) {
- switch (al.nodeType) {
- case 1:
- if (U.test(al.className)) {
- break;
- }
- if ("BR" === al.nodeName) {
- ad(al);
- if (al.parentNode) {
- al.parentNode.removeChild(al);
- }
- } else {
- for (var an = al.firstChild; an; an = an.nextSibling) {
- ae(an);
- }
- }
- break;
- case 3:
- case 4:
- if (Z) {
- var am = al.nodeValue;
- var aj = am.match(ab);
- if (aj) {
- var ai = am.substring(0, aj.index);
- al.nodeValue = ai;
- var ah = am.substring(aj.index + aj[0].length);
- if (ah) {
- var ak = al.parentNode;
- ak.insertBefore(ac.createTextNode(ah), al.nextSibling);
- }
- ad(al);
- if (!ai) {
- al.parentNode.removeChild(al);
- }
- }
- }
- break;
- }
- }
- function ad(ak) {
- while (!ak.nextSibling) {
- ak = ak.parentNode;
- if (!ak) {
- return;
- }
- }
- function ai(al, ar) {
- var aq = ar ? al.cloneNode(false) : al;
- var ao = al.parentNode;
- if (ao) {
- var ap = ai(ao, 1);
- var an = al.nextSibling;
- ap.appendChild(aq);
- for (var am = an; am; am = an) {
- an = am.nextSibling;
- ap.appendChild(am);
- }
- }
- return aq;
- }
- var ah = ai(ak.nextSibling, 0);
- for (var aj; (aj = ah.parentNode) && aj.nodeType === 1; ) {
- ah = aj;
- }
- W.push(ah);
- }
- for (var Y = 0; Y < W.length; ++Y) {
- ae(W[Y]);
- }
- if (ag === (ag | 0)) {
- W[0].setAttribute("value", ag);
- }
- var aa = ac.createElement("OL");
- aa.className = "linenums";
- var X = Math.max(0, (ag - 1) | 0) || 0;
- for (var Y = 0, T = W.length; Y < T; ++Y) {
- af = W[Y];
- af.className = "L" + ((Y + X) % 10);
- if (!af.firstChild) {
- af.appendChild(ac.createTextNode("\xA0"));
- }
- aa.appendChild(af);
- }
- V.appendChild(aa);
- }
- function D(ac) {
- var aj = /\bMSIE\b/.test(navigator.userAgent);
- var am = /\n/g;
- var al = ac.sourceCode;
- var an = al.length;
- var V = 0;
- var aa = ac.spans;
- var T = aa.length;
- var ah = 0;
- var X = ac.decorations;
- var Y = X.length;
- var Z = 0;
- X[Y] = an;
- var ar, aq;
- for (aq = ar = 0; aq < Y; ) {
- if (X[aq] !== X[aq + 2]) {
- X[ar++] = X[aq++];
- X[ar++] = X[aq++];
- } else {
- aq += 2;
- }
- }
- Y = ar;
- for (aq = ar = 0; aq < Y; ) {
- var at = X[aq];
- var ab = X[aq + 1];
- var W = aq + 2;
- while (W + 2 <= Y && X[W + 1] === ab) {
- W += 2;
- }
- X[ar++] = at;
- X[ar++] = ab;
- aq = W;
- }
- Y = X.length = ar;
- var ae = null;
- while (ah < T) {
- var af = aa[ah];
- var S = aa[ah + 2] || an;
- var ag = X[Z];
- var ap = X[Z + 2] || an;
- var W = Math.min(S, ap);
- var ak = aa[ah + 1];
- var U;
- if (ak.nodeType !== 1 && (U = al.substring(V, W))) {
- if (aj) {
- U = U.replace(am, "\r");
- }
- ak.nodeValue = U;
- var ai = ak.ownerDocument;
- var ao = ai.createElement("SPAN");
- ao.className = X[Z + 1];
- var ad = ak.parentNode;
- ad.replaceChild(ao, ak);
- ao.appendChild(ak);
- if (V < S) {
- aa[ah + 1] = ak = ai.createTextNode(al.substring(W, S));
- ad.insertBefore(ak, ao.nextSibling);
- }
- }
- V = W;
- if (V >= S) {
- ah += 2;
- }
- if (V >= ap) {
- Z += 2;
- }
- }
- }
- var t = {};
- function c(U, V) {
- for (var S = V.length; --S >= 0; ) {
- var T = V[S];
- if (!t.hasOwnProperty(T)) {
- t[T] = U;
- } else {
- if (window.console) {
- console.warn("cannot override language handler %s", T);
- }
- }
- }
- }
- function q(T, S) {
- if (!(T && t.hasOwnProperty(T))) {
- T = /^\s*]*(?:>|$)/],
- [j, /^<\!--[\s\S]*?(?:-\->|$)/],
- ["lang-", /^<\?([\s\S]+?)(?:\?>|$)/],
- ["lang-", /^<%([\s\S]+?)(?:%>|$)/],
- [L, /^(?:<[%?]|[%?]>)/],
- ["lang-", /^]*>([\s\S]+?)<\/xmp\b[^>]*>/i],
- ["lang-js", /^
-
-
-
-